| blob | 4e3e1dccda0effa112627460d5cd78384c7d96df |
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
2268 /* Classes [gram.class] */
2270 static tree cp_parser_class_name
2272 static tree cp_parser_class_specifier
2274 static tree cp_parser_class_head
2276 static enum tag_types cp_parser_class_key
2278 static void cp_parser_type_parameter_key
2280 static void cp_parser_member_specification_opt
2282 static void cp_parser_member_declaration
2284 static tree cp_parser_pure_specifier
2286 static tree cp_parser_constant_initializer
2289 /* Derived classes [gram.class.derived] */
2291 static tree cp_parser_base_clause
2293 static tree cp_parser_base_specifier
2296 /* Special member functions [gram.special] */
2298 static tree cp_parser_conversion_function_id
2300 static tree cp_parser_conversion_type_id
2304 static void cp_parser_ctor_initializer_opt
2306 static void cp_parser_mem_initializer_list
2308 static tree cp_parser_mem_initializer
2310 static tree cp_parser_mem_initializer_id
2313 /* Overloading [gram.over] */
2315 static cp_expr cp_parser_operator_function_id
2317 static cp_expr cp_parser_operator
2320 /* Templates [gram.temp] */
2322 static void cp_parser_template_declaration
2324 static tree cp_parser_template_parameter_list
2326 static tree cp_parser_template_parameter
2328 static tree cp_parser_type_parameter
2330 static tree cp_parser_template_id
2332 static tree cp_parser_template_name
2334 static tree cp_parser_template_argument_list
2336 static tree cp_parser_template_argument
2338 static void cp_parser_explicit_instantiation
2340 static void cp_parser_explicit_specialization
2343 /* Exception handling [gram.exception] */
2345 static tree cp_parser_try_block
2347 static void cp_parser_function_try_block
2349 static void cp_parser_handler_seq
2351 static void cp_parser_handler
2353 static tree cp_parser_exception_declaration
2355 static tree cp_parser_throw_expression
2357 static tree cp_parser_exception_specification_opt
2359 static tree cp_parser_type_id_list
2362 /* GNU Extensions */
2364 static tree cp_parser_asm_specification_opt
2366 static tree cp_parser_asm_operand_list
2368 static tree cp_parser_asm_clobber_list
2370 static tree cp_parser_asm_label_list
2372 static bool cp_next_tokens_can_be_attribute_p
2374 static bool cp_next_tokens_can_be_gnu_attribute_p
2376 static bool cp_next_tokens_can_be_std_attribute_p
2378 static bool cp_nth_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_gnu_attribute_p
2382 static bool cp_nth_tokens_can_be_attribute_p
2384 static tree cp_parser_attributes_opt
2386 static tree cp_parser_gnu_attributes_opt
2388 static tree cp_parser_gnu_attribute_list
2390 static tree cp_parser_std_attribute
2392 static tree cp_parser_std_attribute_spec
2394 static tree cp_parser_std_attribute_spec_seq
2396 static size_t cp_parser_skip_attributes_opt
2398 static bool cp_parser_extension_opt
2400 static void cp_parser_label_declaration
2403 /* Concept Extensions */
2405 static tree cp_parser_requires_clause
2407 static tree cp_parser_requires_clause_opt
2409 static tree cp_parser_requires_expression
2411 static tree cp_parser_requirement_parameter_list
2413 static tree cp_parser_requirement_body
2415 static tree cp_parser_requirement_list
2417 static tree cp_parser_requirement
2419 static tree cp_parser_simple_requirement
2421 static tree cp_parser_compound_requirement
2423 static tree cp_parser_type_requirement
2425 static tree cp_parser_nested_requirement
2428 /* Transactional Memory Extensions */
2430 static tree cp_parser_transaction
2432 static tree cp_parser_transaction_expression
2434 static void cp_parser_function_transaction
2436 static tree cp_parser_transaction_cancel
2440 pragma_external,
2441 pragma_member,
2442 pragma_objc_icode,
2443 pragma_stmt,
2444 pragma_compound
2445 };
2446 static bool cp_parser_pragma
2449 /* Objective-C++ Productions */
2451 static tree cp_parser_objc_message_receiver
2453 static tree cp_parser_objc_message_args
2455 static tree cp_parser_objc_message_expression
2457 static cp_expr cp_parser_objc_encode_expression
2459 static tree cp_parser_objc_defs_expression
2461 static tree cp_parser_objc_protocol_expression
2463 static tree cp_parser_objc_selector_expression
2465 static cp_expr cp_parser_objc_expression
2467 static bool cp_parser_objc_selector_p
2469 static tree cp_parser_objc_selector
2471 static tree cp_parser_objc_protocol_refs_opt
2473 static void cp_parser_objc_declaration
2475 static tree cp_parser_objc_statement
2477 static bool cp_parser_objc_valid_prefix_attributes
2479 static void cp_parser_objc_at_property_declaration
2481 static void cp_parser_objc_at_synthesize_declaration
2483 static void cp_parser_objc_at_dynamic_declaration
2485 static tree cp_parser_objc_struct_declaration
2488 /* Utility Routines */
2490 static cp_expr cp_parser_lookup_name
2492 static tree cp_parser_lookup_name_simple
2494 static tree cp_parser_maybe_treat_template_as_class
2496 static bool cp_parser_check_declarator_template_parameters
2498 static bool cp_parser_check_template_parameters
2500 static cp_expr cp_parser_simple_cast_expression
2502 static tree cp_parser_global_scope_opt
2504 static bool cp_parser_constructor_declarator_p
2506 static tree cp_parser_function_definition_from_specifiers_and_declarator
2508 static tree cp_parser_function_definition_after_declarator
2510 static bool cp_parser_template_declaration_after_export
2512 static void cp_parser_perform_template_parameter_access_checks
2514 static tree cp_parser_single_declaration
2516 static cp_expr cp_parser_functional_cast
2518 static tree cp_parser_save_member_function_body
2520 static tree cp_parser_save_nsdmi
2522 static tree cp_parser_enclosed_template_argument_list
2524 static void cp_parser_save_default_args
2526 static void cp_parser_late_parsing_for_member
2528 static tree cp_parser_late_parse_one_default_arg
2530 static void cp_parser_late_parsing_nsdmi
2532 static void cp_parser_late_parsing_default_args
2534 static tree cp_parser_sizeof_operand
2536 static cp_expr cp_parser_trait_expr
2538 static bool cp_parser_declares_only_class_p
2540 static void cp_parser_set_storage_class
2542 static void cp_parser_set_decl_spec_type
2544 static void set_and_check_decl_spec_loc
2547 static bool cp_parser_friend_p
2549 static void cp_parser_required_error
2555 static bool cp_parser_token_starts_function_definition_p
2557 static bool cp_parser_next_token_starts_class_definition_p
2559 static bool cp_parser_next_token_ends_template_argument_p
2561 static bool cp_parser_nth_token_starts_template_argument_list_p
2563 static enum tag_types cp_parser_token_is_class_key
2565 static enum tag_types cp_parser_token_is_type_parameter_key
2567 static void cp_parser_check_class_key
2569 static void cp_parser_check_access_in_redeclaration
2571 static bool cp_parser_optional_template_keyword
2573 static void cp_parser_pre_parsed_nested_name_specifier
2575 static bool cp_parser_cache_group
2577 static tree cp_parser_cache_defarg
2579 static void cp_parser_parse_tentatively
2581 static void cp_parser_commit_to_tentative_parse
2583 static void cp_parser_commit_to_topmost_tentative_parse
2585 static void cp_parser_abort_tentative_parse
2587 static bool cp_parser_parse_definitely
2591 static bool cp_parser_uncommitted_to_tentative_parse_p
2593 static void cp_parser_error
2595 static void cp_parser_name_lookup_error
2597 static bool cp_parser_simulate_error
2599 static bool cp_parser_check_type_definition
2601 static void cp_parser_check_for_definition_in_return_type
2603 static void cp_parser_check_for_invalid_template_id
2605 static bool cp_parser_non_integral_constant_expression
2607 static void cp_parser_diagnose_invalid_type_name
2609 static bool cp_parser_parse_and_diagnose_invalid_type_name
2611 static int cp_parser_skip_to_closing_parenthesis
2613 static void cp_parser_skip_to_end_of_statement
2615 static void cp_parser_consume_semicolon_at_end_of_statement
2617 static void cp_parser_skip_to_end_of_block_or_statement
2619 static bool cp_parser_skip_to_closing_brace
2621 static void cp_parser_skip_to_end_of_template_parameter_list
2623 static void cp_parser_skip_to_pragma_eol
2625 static bool cp_parser_error_occurred
2627 static bool cp_parser_allow_gnu_extensions_p
2629 static bool cp_parser_is_pure_string_literal
2631 static bool cp_parser_is_string_literal
2633 static bool cp_parser_is_keyword
2635 static tree cp_parser_make_typename_type
2639 static bool cp_parser_compound_literal_p
2641 static bool cp_parser_array_designator_p
2643 static bool cp_parser_init_statement_p
2645 static bool cp_parser_skip_to_closing_square_bracket
2648 /* Concept-related syntactic transformations */
2653 // -------------------------------------------------------------------------- //
2654 // Unevaluated Operand Guard
2655 //
2656 // Implementation of an RAII helper for unevaluated operand parsing.
2658 {
2661 }
2664 {
2667 }
2669 // -------------------------------------------------------------------------- //
2670 // Tentative Parsing
2672 /* Returns nonzero if we are parsing tentatively. */
2676 {
2678 }
2680 /* Returns nonzero if TOKEN is a string literal. */
2682 static bool
2684 {
2690 }
2692 /* Returns nonzero if TOKEN is a string literal
2693 of a user-defined string literal. */
2695 static bool
2697 {
2704 }
2706 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2708 static bool
2710 {
2712 }
2714 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2715 PRAGMA_NONE. */
2717 static enum pragma_kind
2719 {
2722 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2724 }
2726 /* Helper function for cp_parser_error.
2727 Having peeked a token of kind TOK1_KIND that might signify
2728 a conflict marker, peek successor tokens to determine
2729 if we actually do have a conflict marker.
2730 Specifically, we consider a run of 7 '<', '=' or '>' characters
2731 at the start of a line as a conflict marker.
2732 These come through the lexer as three pairs and a single,
2733 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2734 If it returns true, *OUT_LOC is written to with the location/range
2735 of the marker. */
2737 static bool
2740 {
2751 /* It must be at the start of the line. */
2756 /* We have a conflict marker. Construct a location of the form:
2757 <<<<<<<
2758 ^~~~~~~
2759 with start == caret, finishing at the end of the marker. */
2764 }
2766 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2767 RT_CLOSE_PAREN. */
2771 {
2773 {
2781 }
2782 }
2784 /* Attempt to convert TOKEN_DESC from a required_token to an
2785 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2787 static enum cpp_ttype
2789 {
2791 {
2812 /* Use CPP_EOF as a "no completions possible" code. */
2814 }
2815 }
2818 /* Subroutine of cp_parser_error and cp_parser_required_error.
2820 Issue a diagnostic of the form
2821 FILE:LINE: MESSAGE before TOKEN
2822 where TOKEN is the next token in the input stream. MESSAGE
2823 (specified by the caller) is usually of the form "expected
2824 OTHER-TOKEN".
2826 This bypasses the check for tentative passing, and potentially
2827 adds material needed by cp_parser_required_error.
2829 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2830 suggesting insertion of the missing token.
2832 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2833 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2834 location. */
2836 static void
2838 required_token missing_token_desc,
2839 location_t matching_location)
2840 {
2842 /* This diagnostic makes more sense if it is tagged to the line
2843 of the token we just peeked at. */
2847 {
2852 }
2854 /* If this is actually a conflict marker, report it as such. */
2858 {
2859 location_t loc;
2861 {
2864 }
2865 }
2872 {
2873 /* Potentially supply a fix-it hint, suggesting to add the
2874 missing token immediately after the *previous* token.
2875 This may move the primary location within richloc. */
2877 location_t prev_token_loc
2881 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2882 Attempt to consolidate diagnostics by printing it as a
2883 secondary range within the main diagnostic. */
2885 added_matching_location
2887 }
2889 /* Actually emit the error. */
2891 /* Because c_parser_error does not understand
2892 CPP_KEYWORD, keywords are treated like
2893 identifiers. */
2898 {
2899 /* If we weren't able to consolidate matching_location, then
2900 print it as a secondary diagnostic. */
2905 }
2906 }
2908 /* If not parsing tentatively, issue a diagnostic of the form
2909 FILE:LINE: MESSAGE before TOKEN
2910 where TOKEN is the next token in the input stream. MESSAGE
2911 (specified by the caller) is usually of the form "expected
2912 OTHER-TOKEN". */
2914 static void
2916 {
2919 }
2921 /* Issue an error about name-lookup failing. NAME is the
2922 IDENTIFIER_NODE DECL is the result of
2923 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2924 the thing that we hoped to find. */
2926 static void
2928 tree name,
2929 tree decl,
2930 name_lookup_error desired,
2931 location_t location)
2932 {
2933 /* If name lookup completely failed, tell the user that NAME was not
2934 declared. */
2936 {
2949 else
2951 }
2953 {
2955 {
2972 }
2973 }
2975 {
2977 {
2987 name);
2991 }
2992 }
2993 else
2994 {
2996 {
3009 }
3010 }
3011 }
3013 /* If we are parsing tentatively, remember that an error has occurred
3014 during this tentative parse. Returns true if the error was
3015 simulated; false if a message should be issued by the caller. */
3017 static bool
3019 {
3021 {
3024 }
3026 }
3028 /* This function is called when a type is defined. If type
3029 definitions are forbidden at this point, an error message is
3030 issued. */
3032 static bool
3034 {
3035 /* If types are forbidden here, issue a message. */
3037 {
3038 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3039 in the message need to be interpreted. */
3042 }
3044 }
3046 /* This function is called when the DECLARATOR is processed. The TYPE
3047 was a type defined in the decl-specifiers. If it is invalid to
3048 define a type in the decl-specifiers for DECLARATOR, an error is
3049 issued. TYPE_LOCATION is the location of TYPE and is used
3050 for error reporting. */
3052 static void
3055 {
3056 /* [dcl.fct] forbids type definitions in return types.
3057 Unfortunately, it's not easy to know whether or not we are
3058 processing a return type until after the fact. */
3066 {
3071 type);
3072 }
3073 }
3075 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3076 "<" in any valid C++ program. If the next token is indeed "<",
3077 issue a message warning the user about what appears to be an
3078 invalid attempt to form a template-id. LOCATION is the location
3079 of the type-specifier (TYPE) */
3081 static void
3083 tree type,
3085 location_t location)
3086 {
3090 {
3096 {
3099 else
3101 }
3102 else
3104 /* Remember the location of the invalid "<". */
3107 /* Consume the "<". */
3109 /* Parse the template arguments. */
3111 /* Permanently remove the invalid template arguments so that
3112 this error message is not issued again. */
3115 }
3116 }
3118 /* If parsing an integral constant-expression, issue an error message
3119 about the fact that THING appeared and return true. Otherwise,
3120 return false. In either case, set
3121 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3123 static bool
3125 non_integral_constant thing)
3126 {
3129 {
3131 {
3134 {
3137 "ISO C++ forbids using a floating-point literal "
3142 "enumeration type cannot appear in a "
3233 }
3237 }
3238 }
3240 }
3242 /* Emit a diagnostic for an invalid type name. This function commits
3243 to the current active tentative parse, if any. (Otherwise, the
3244 problematic construct might be encountered again later, resulting
3245 in duplicate error messages.) LOCATION is the location of ID. */
3247 static void
3249 location_t location)
3250 {
3253 /* Try to lookup the identifier. */
3260 /* If the lookup was ambiguous, an error will already have
3261 been issued. */
3263 /* If the lookup found a template-name, it means that the user forgot
3264 to specify an argument list. Emit a useful error message. */
3266 {
3269 decl);
3274 }
3278 /* Something like 'unsigned A a;' */
3281 {
3282 /* Issue an error message. */
3283 name_hint hint;
3287 {
3293 }
3294 else
3296 /* If we're in a template class, it's possible that the user was
3297 referring to a type from a base class. For example:
3299 template <typename T> struct A { typedef T X; };
3300 template <typename T> struct B : public A<T> { X x; };
3302 The user should have said "typename A<T>::X". */
3318 {
3319 tree b;
3322 b;
3324 {
3328 {
3329 tree field;
3330 /* Go from a particular instantiation of the
3331 template (which will have an empty TYPE_FIELDs),
3332 to the main version. */
3335 field;
3339 {
3344 }
3347 }
3348 }
3349 }
3350 }
3351 /* Here we diagnose qualified-ids where the scope is actually correct,
3352 but the identifier does not resolve to a valid type name. */
3354 {
3356 {
3365 else
3374 }
3377 {
3378 /* A<T>::A<T>() */
3384 }
3387 {
3390 "need %<typename%> before %<%T::%D::%E%> because "
3394 id,
3397 else
3401 }
3403 {
3415 else
3421 }
3422 else
3424 }
3425 }
3427 /* Check for a common situation where a type-name should be present,
3428 but is not, and issue a sensible error message. Returns true if an
3429 invalid type-name was detected.
3431 The situation handled by this function are variable declarations of the
3432 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3433 Usually, `ID' should name a type, but if we got here it means that it
3434 does not. We try to emit the best possible error message depending on
3435 how exactly the id-expression looks like. */
3437 static bool
3439 {
3440 tree id;
3443 /* Avoid duplicate error about ambiguous lookup. */
3445 {
3449 }
3458 /* If the next token is a (, this is a function with no explicit return
3459 type, i.e. constructor, destructor or conversion op. */
3462 {
3465 }
3469 /* Emit a diagnostic for the invalid type. */
3471 out:
3472 /* If we aren't in the middle of a declarator (i.e. in a
3473 parameter-declaration-clause), skip to the end of the declaration;
3474 there's no point in trying to process it. */
3478 }
3480 /* Consume tokens up to, and including, the next non-nested closing `)'.
3481 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3482 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3483 found an unnested token of that type. */
3485 static int
3488 cpp_ttype or_ttype,
3490 {
3500 {
3503 /* Have we found what we're looking for before the closing paren? */
3509 {
3512 /* If we've run out of tokens, then there is no closing `)'. */
3515 /* This is good for lambda expression capture-lists. */
3525 /* This matches the processing in skip_to_end_of_statement. */
3545 {
3549 }
3554 }
3556 /* Consume the token. */
3558 }
3559 }
3561 /* Consume tokens up to, and including, the next non-nested closing `)'.
3562 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3563 are doing error recovery. Returns -1 if OR_COMMA is true and we
3564 found an unnested token of that type. */
3566 static int
3571 {
3575 }
3577 /* Consume tokens until we reach the end of the current statement.
3578 Normally, that will be just before consuming a `;'. However, if a
3579 non-nested `}' comes first, then we stop before consuming that. */
3581 static void
3583 {
3586 /* Unwind generic function template scope if necessary. */
3591 {
3595 {
3598 /* If we've run out of tokens, stop. */
3602 /* If the next token is a `;', we have reached the end of the
3603 statement. */
3609 /* If this is a non-nested '}', stop before consuming it.
3610 That way, when confronted with something like:
3612 { 3 + }
3614 we stop before consuming the closing '}', even though we
3615 have not yet reached a `;'. */
3619 /* If it is the closing '}' for a block that we have
3620 scanned, stop -- but only after consuming the token.
3621 That way given:
3623 void f g () { ... }
3624 typedef int I;
3626 we will stop after the body of the erroneously declared
3627 function, but before consuming the following `typedef'
3628 declaration. */
3630 {
3633 }
3642 }
3644 /* Consume the token. */
3646 }
3647 }
3649 /* This function is called at the end of a statement or declaration.
3650 If the next token is a semicolon, it is consumed; otherwise, error
3651 recovery is attempted. */
3653 static void
3655 {
3656 /* Look for the trailing `;'. */
3658 {
3659 /* If there is additional (erroneous) input, skip to the end of
3660 the statement. */
3662 /* If the next token is now a `;', consume it. */
3665 }
3666 }
3668 /* Skip tokens until we have consumed an entire block, or until we
3669 have consumed a non-nested `;'. */
3671 static void
3673 {
3676 /* Unwind generic function template scope if necessary. */
3681 {
3685 {
3688 /* If we've run out of tokens, stop. */
3692 /* Stop if this is an unnested ';'. */
3698 /* Stop if this is an unnested '}', or closes the outermost
3699 nesting level. */
3700 nesting_depth--;
3708 /* Nest. */
3709 nesting_depth++;
3714 }
3716 /* Consume the token. */
3718 }
3719 }
3721 /* Skip tokens until a non-nested closing curly brace is the next
3722 token, or there are no more tokens. Return true in the first case,
3723 false otherwise. */
3725 static bool
3727 {
3731 {
3735 {
3738 /* If we've run out of tokens, stop. */
3742 /* If the next token is a non-nested `}', then we have reached
3743 the end of the current block. */
3749 /* If it the next token is a `{', then we are entering a new
3750 block. Consume the entire block. */
3756 }
3758 /* Consume the token. */
3760 }
3761 }
3763 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3764 parameter is the PRAGMA token, allowing us to purge the entire pragma
3765 sequence. */
3767 static void
3769 {
3774 do
3778 /* Ensure that the pragma is not parsed again. */
3780 }
3782 /* Require pragma end of line, resyncing with it as necessary. The
3783 arguments are as for cp_parser_skip_to_pragma_eol. */
3785 static void
3787 {
3791 }
3793 /* This is a simple wrapper around make_typename_type. When the id is
3794 an unresolved identifier node, we can provide a superior diagnostic
3795 using cp_parser_diagnose_invalid_type_name. */
3797 static tree
3799 location_t id_location)
3800 {
3801 tree result;
3803 {
3809 }
3811 }
3813 /* This is a wrapper around the
3814 make_{pointer,ptrmem,reference}_declarator functions that decides
3815 which one to call based on the CODE and CLASS_TYPE arguments. The
3816 CODE argument should be one of the values returned by
3817 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3818 appertain to the pointer or reference. */
3822 cp_cv_quals cv_qualifiers,
3824 tree attributes)
3825 {
3832 else
3842 }
3844 /* Create a new C++ parser. */
3848 {
3853 /* cp_lexer_new_main is called before doing GC allocation because
3854 cp_lexer_new_main might load a PCH file. */
3857 /* Initialize the binops_by_token so that we can get the tree
3858 directly from the token. */
3866 /* For now, we always accept GNU extensions. */
3869 /* The `>' token is a greater-than operator, not the end of a
3870 template-id. */
3875 /* We are not parsing a constant-expression. */
3880 /* Local variable names are not forbidden. */
3883 /* We are not processing an `extern "C"' declaration. */
3886 /* We are not processing a declarator. */
3889 /* We are not processing a template-argument-list. */
3892 /* We are not in an iteration statement. */
3895 /* We are not in a switch statement. */
3898 /* We are not parsing a type-id inside an expression. */
3901 /* Declarations aren't implicitly extern "C". */
3904 /* String literals should be translated to the execution character set. */
3907 /* We are not parsing a function body. */
3910 /* We can correct until told otherwise. */
3913 /* The unparsed function queue is empty. */
3916 /* There are no classes being defined. */
3919 /* No template parameters apply. */
3922 /* Special parsing data structures. */
3926 /* Not declaring an implicit function template. */
3932 /* Allow constrained-type-specifiers. */
3935 /* We haven't yet seen an 'extern "C"'. */
3939 }
3941 /* Create a cp_lexer structure which will emit the tokens in CACHE
3942 and push it onto the parser's lexer stack. This is used for delayed
3943 parsing of in-class method bodies and default arguments, and should
3944 not be confused with tentative parsing. */
3945 static void
3947 {
3952 /* Move the current source position to that of the first token in the
3953 new lexer. */
3955 }
3957 /* Pop the top lexer off the parser stack. This is never used for the
3958 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3959 static void
3961 {
3966 /* Put the current source position back where it was before this
3967 lexer was pushed. */
3969 }
3971 /* Lexical conventions [gram.lex] */
3973 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3974 identifier. */
3976 static cp_expr
3978 {
3981 /* Look for the identifier. */
3983 /* Return the value. */
3986 else
3988 }
3990 /* Parse a sequence of adjacent string constants. Returns a
3991 TREE_STRING representing the combined, nul-terminated string
3992 constant. If TRANSLATE is true, translate the string to the
3993 execution character set. If WIDE_OK is true, a wide string is
3994 invalid here.
3996 C++98 [lex.string] says that if a narrow string literal token is
3997 adjacent to a wide string literal token, the behavior is undefined.
3998 However, C99 6.4.5p4 says that this results in a wide string literal.
3999 We follow C99 here, for consistency with the C front end.
4001 This code is largely lifted from lex_string() in c-lex.c.
4003 FUTURE: ObjC++ will need to handle @-strings here. */
4004 static cp_expr
4007 {
4008 tree value;
4015 tree string_tree;
4021 {
4024 }
4029 {
4033 }
4034 else
4035 {
4038 }
4041 /* Try to avoid the overhead of creating and destroying an obstack
4042 for the common case of just one string. */
4045 {
4053 {
4057 }
4058 else
4062 }
4063 else
4064 {
4069 do
4070 {
4072 count++;
4077 {
4080 {
4083 }
4086 {
4091 }
4093 }
4094 else
4098 {
4102 {
4106 "unsupported non-standard concatenation "
4108 }
4109 }
4117 {
4121 }
4122 else
4123 {
4127 }
4128 }
4131 /* A string literal built by concatenation has its caret=start at
4132 the start of the initial string, and its finish at the finish of
4133 the final string literal. */
4137 }
4140 {
4143 }
4147 {
4152 {
4167 }
4172 {
4177 else
4179 }
4180 }
4181 else
4182 /* cpp_interpret_string has issued an error. */
4189 }
4191 /* Look up a literal operator with the name and the exact arguments. */
4193 static tree
4195 {
4196 tree decl;
4202 {
4208 {
4211 {
4221 }
4224 /* May be this should be sufficient_parms_p instead,
4225 depending on how exactly should user-defined literals
4226 work in presence of default arguments on the literal
4227 operator parameters. */
4230 }
4231 }
4234 }
4236 /* Parse a user-defined char constant. Returns a call to a user-defined
4237 literal operator taking the character as an argument. */
4239 static cp_expr
4241 {
4249 /* Build up a call to the user-defined operator */
4250 /* Lookup the name we got back from the id-expression. */
4255 {
4260 }
4264 }
4266 /* A subroutine of cp_parser_userdef_numeric_literal to
4267 create a char... template parameter pack from a string node. */
4269 static tree
4271 {
4272 tree charvec;
4278 /* Fill in CHARVEC with all of the parameters. */
4283 /* Build the argument packs. */
4289 }
4291 /* A subroutine of cp_parser_userdef_numeric_literal to
4292 create a char... template parameter pack from a string node. */
4294 static tree
4296 {
4297 tree charvec;
4308 /* First template parm is character type. */
4311 /* Fill in CHARVEC with all of the parameters. */
4318 /* Build the argument packs. */
4324 }
4326 /* Parse a user-defined numeric constant. returns a call to a user-defined
4327 literal operator. */
4329 static cp_expr
4331 {
4342 /* Look for a literal operator taking the exact type of numeric argument
4343 as the literal value. */
4348 {
4350 tf_warning_or_error);
4353 {
4356 long_long_unsigned_type_node);
4357 }
4358 else
4359 {
4363 long_double_type_node);
4367 }
4371 }
4374 /* If the numeric argument didn't work, look for a raw literal
4375 operator taking a const char* argument consisting of the number
4376 in string format. */
4381 {
4383 tf_warning_or_error);
4386 }
4389 /* If the raw literal didn't work, look for a non-type template
4390 function with parameter pack char.... Call the function with
4391 template parameter characters representing the number. */
4395 {
4399 tf_warning_or_error);
4402 }
4406 /* In C++14 the standard library defines complex number suffixes that
4407 conflict with GNU extensions. Prefer them if <complex> is #included. */
4417 {
4422 {
4423 /* No <complex>, so pedwarn and use GNU semantics. */
4426 }
4427 }
4429 bool complained
4436 {
4438 "(from <complex>) to enable the C++14 user-defined literal "
4443 }
4450 else
4451 {
4452 /* Use the built-in semantics. */
4453 tree type;
4455 {
4458 else
4460 }
4469 }
4472 /* Avoid repeated diagnostics. */
4475 }
4477 /* Parse a user-defined string constant. Returns a call to a user-defined
4478 literal operator taking a character pointer and the length of the string
4479 as arguments. */
4481 static tree
4483 {
4492 /* Build up a call to the user-defined operator. */
4493 /* Lookup the name we got back from the id-expression. */
4500 {
4502 tf_warning_or_error);
4505 }
4508 /* Look for a template function with typename parameter CharT
4509 and parameter pack CharT... Call the function with
4510 template parameter characters representing the string. */
4514 {
4518 tf_warning_or_error);
4521 }
4527 }
4530 /* Basic concepts [gram.basic] */
4532 /* Parse a translation-unit.
4534 translation-unit:
4535 declaration-seq [opt]
4537 Returns TRUE if all went well. */
4539 static bool
4541 {
4542 /* The address of the first non-permanent object on the declarator
4543 obstack. */
4548 /* Create the declarator obstack, if necessary. */
4550 {
4552 /* Create the error declarator. */
4554 /* Create the empty parameter list. */
4556 UNKNOWN_LOCATION);
4557 /* Remember where the base of the declarator obstack lies. */
4559 }
4563 /* If there are no tokens left then all went well. */
4565 {
4566 /* Get rid of the token array; we don't need it any more. */
4570 /* This file might have been a context that's implicitly extern
4571 "C". If so, pop the lang context. (Only relevant for PCH.) */
4573 {
4576 }
4578 /* Finish up. */
4582 }
4583 else
4584 {
4587 }
4589 /* Make sure the declarator obstack was fully cleaned up. */
4593 /* All went well. */
4595 }
4597 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4598 decltype context. */
4602 {
4607 }
4609 /* We're about to parse a collection of statements. If we're currently
4610 parsing tentatively, set up a firewall so that any nested
4611 cp_parser_commit_to_tentative_parse won't affect the current context. */
4613 static cp_token_position
4615 {
4622 }
4624 /* We've finished parsing the collection of statements. Wrap up the
4625 firewall and replace the relevant tokens with the parsed form. */
4627 static void
4629 tree expr)
4630 {
4634 /* Finish the firewall level. */
4636 /* And remember the result of the parse for when we try again. */
4642 }
4644 /* Like the above functions, but let the user modify the tokens. Used by
4645 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4646 later parses, so it makes sense to localize the effects of
4647 cp_parser_commit_to_tentative_parse. */
4649 struct tentative_firewall
4650 {
4655 {
4656 /* If we're currently parsing tentatively, start a committed level as a
4657 firewall and then an inner tentative parse. */
4659 {
4663 }
4664 }
4667 {
4669 {
4670 /* Finish the inner tentative parse and the firewall, propagating any
4671 uncommitted error state to the outer tentative parse. */
4677 }
4678 }
4679 };
4681 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4682 This class is for tracking such a matching pair of symbols.
4683 In particular, it tracks the location of the first token,
4684 so that if the second token is missing, we can highlight the
4685 location of the first token when notifying the user about the
4686 problem. */
4689 class token_pair
4690 {
4692 /* token_pair's ctor. */
4695 /* If the next token is the opening symbol for this pair, consume it and
4696 return true.
4697 Otherwise, issue an error and return false.
4698 In either case, record the location of the opening token. */
4701 {
4705 }
4707 /* Consume the next token from PARSER, recording its location as
4708 that of the opening token within the pair. */
4711 {
4716 }
4718 /* If the next token is the closing symbol for this pair, consume it
4719 and return it.
4720 Otherwise, issue an error, highlighting the location of the
4721 corresponding opening token, and return NULL. */
4724 {
4727 m_open_loc);
4728 }
4731 location_t m_open_loc;
4732 };
4734 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4736 struct matching_paren_traits
4737 {
4742 };
4744 /* "matching_parens" is a token_pair<T> class for tracking matching
4745 pairs of parentheses. */
4749 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4751 struct matching_brace_traits
4752 {
4757 };
4759 /* "matching_braces" is a token_pair<T> class for tracking matching
4760 pairs of braces. */
4765 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4766 enclosing parentheses. */
4768 static cp_expr
4770 {
4773 /* Consume the '('. */
4775 matching_parens parens;
4777 /* Start the statement-expression. */
4779 /* Parse the compound-statement. */
4781 /* Finish up. */
4783 /* Consume the ')'. */
4791 }
4793 /* Expressions [gram.expr] */
4795 /* Parse a fold-operator.
4797 fold-operator:
4798 - * / % ^ & | = < > << >>
4799 = -= *= /= %= ^= &= |= <<= >>=
4800 == != <= >= && || , .* ->*
4802 This returns the tree code corresponding to the matched operator
4803 as an int. When the current token matches a compound assignment
4804 opertor, the resulting tree code is the negative value of the
4805 non-assignment operator. */
4807 static int
4809 {
4811 {
4851 }
4852 }
4854 /* Returns true if CODE indicates a binary expression, which is not allowed in
4855 the LHS of a fold-expression. More codes will need to be added to use this
4856 function in other contexts. */
4858 static bool
4860 {
4862 {
4895 }
4896 }
4898 /* If the next token is a suitable fold operator, consume it and return as
4899 the function above. */
4901 static int
4903 {
4909 }
4911 /* Parse a fold-expression.
4913 fold-expression:
4914 ( ... folding-operator cast-expression)
4915 ( cast-expression folding-operator ... )
4916 ( cast-expression folding operator ... folding-operator cast-expression)
4918 Note that the '(' and ')' are matched in primary expression. */
4920 static cp_expr
4922 {
4923 cp_id_kind pidk;
4925 // Left fold.
4927 {
4931 {
4934 }
4941 }
4946 {
4949 }
4952 {
4955 }
4958 /* The operands of a fold-expression are cast-expressions, so binary or
4959 conditional expressions are not allowed. We check this here to avoid
4960 tentative parsing. */
4972 // Right fold.
4977 {
4980 }
4983 // Binary left or right fold.
4988 }
4990 /* Parse a primary-expression.
4992 primary-expression:
4993 literal
4994 this
4995 ( expression )
4996 id-expression
4997 lambda-expression (C++11)
4999 GNU Extensions:
5001 primary-expression:
5002 ( compound-statement )
5003 __builtin_va_arg ( assignment-expression , type-id )
5004 __builtin_offsetof ( type-id , offsetof-expression )
5006 C++ Extensions:
5007 __has_nothrow_assign ( type-id )
5008 __has_nothrow_constructor ( type-id )
5009 __has_nothrow_copy ( type-id )
5010 __has_trivial_assign ( type-id )
5011 __has_trivial_constructor ( type-id )
5012 __has_trivial_copy ( type-id )
5013 __has_trivial_destructor ( type-id )
5014 __has_virtual_destructor ( type-id )
5015 __is_abstract ( type-id )
5016 __is_base_of ( type-id , type-id )
5017 __is_class ( type-id )
5018 __is_empty ( type-id )
5019 __is_enum ( type-id )
5020 __is_final ( type-id )
5021 __is_literal_type ( type-id )
5022 __is_pod ( type-id )
5023 __is_polymorphic ( type-id )
5024 __is_std_layout ( type-id )
5025 __is_trivial ( type-id )
5026 __is_union ( type-id )
5028 Objective-C++ Extension:
5030 primary-expression:
5031 objc-expression
5033 literal:
5034 __null
5036 ADDRESS_P is true iff this expression was immediately preceded by
5037 "&" and therefore might denote a pointer-to-member. CAST_P is true
5038 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5039 true iff this expression is a template argument.
5041 Returns a representation of the expression. Upon return, *IDK
5042 indicates what kind of id-expression (if any) was present. */
5044 static cp_expr
5051 {
5054 /* Assume the primary expression is not an id-expression. */
5057 /* Peek at the next token. */
5060 {
5061 /* literal:
5062 integer-literal
5063 character-literal
5064 floating-literal
5065 string-literal
5066 boolean-literal
5067 pointer-literal
5068 user-defined-literal */
5080 {
5084 }
5085 /* Floating-point literals are only allowed in an integral
5086 constant expression if they are cast to an integral or
5087 enumeration type. */
5091 {
5092 /* CAST_P will be set even in invalid code like "int(2.7 +
5093 ...)". Therefore, we have to check that the next token
5094 is sure to end the cast. */
5096 {
5101 enumerator-definition. */
5103 /* The curly brace at the end of an enum-specifier. */
5105 /* The end of a statement. */
5107 /* The end of the cast-expression. */
5109 /* The end of an array bound. */
5111 /* The closing ">" in a template-argument-list. */
5114 /* C++0x only: A ">>" treated like two ">" tokens,
5115 in a template-argument-list. */
5120 }
5122 /* If we are within a cast, then the constraint that the
5123 cast is to an integral or enumeration type will be
5124 checked at that point. If we are not within a cast, then
5125 this code is invalid. */
5128 }
5148 /* ??? Should wide strings be allowed when parser->translate_strings_p
5149 is false (i.e. in attributes)? If not, we can kill the third
5150 argument to cp_parser_string_literal. */
5156 /* If we see `( { ' then we are looking at the beginning of
5157 a GNU statement-expression. */
5160 {
5161 /* Statement-expressions are not allowed by the standard. */
5165 /* And they're not allowed outside of a function-body; you
5166 cannot, for example, write:
5168 int i = ({ int j = 3; j + 1; });
5170 at class or namespace scope. */
5173 {
5175 "statement-expressions are not allowed outside "
5181 }
5182 else
5184 }
5185 /* Otherwise it's a normal parenthesized expression. */
5186 {
5187 cp_expr expr;
5192 /* Consume the `('. */
5193 matching_parens parens;
5195 /* Within a parenthesized expression, a `>' token is always
5196 the greater-than operator. */
5197 saved_greater_than_is_operator_p
5202 /* Left fold expression. */
5204 else
5205 /* Parse the parenthesized expression. */
5210 {
5217 }
5218 else
5219 /* Let the front end know that this expression was
5220 enclosed in parentheses. This matters in case, for
5221 example, the expression is of the form `A::B', since
5222 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5223 not. */
5226 /* DR 705: Wrapping an unqualified name in parentheses
5227 suppresses arg-dependent lookup. We want to pass back
5228 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5229 (c++/37862), but none of the others. */
5233 /* The `>' token might be the end of a template-id or
5234 template-parameter-list now. */
5235 parser->greater_than_is_operator_p
5238 /* Consume the `)'. */
5247 }
5250 {
5252 {
5253 /* We might have an Objective-C++ message. */
5256 /* If that works out, we're done ... */
5259 /* ... else, fall though to see if it's a lambda. */
5260 }
5262 /* Don't warn about a failed tentative parse. */
5267 }
5271 /* We have an Objective-C++ string literal. */
5278 {
5279 /* These two are the boolean literals. */
5287 /* The `__null' literal. */
5292 /* The `nullptr' literal. */
5297 /* Recognize the `this' keyword. */
5301 {
5305 }
5306 /* Pointers cannot appear in constant-expressions. */
5311 /* The `operator' keyword can be the beginning of an
5312 id-expression. */
5319 {
5320 non_integral_constant name;
5322 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5323 __func__ are the names of variables -- but they are
5324 treated specially. Therefore, they are handled here,
5325 rather than relying on the generic id-expression logic
5326 below. Grammatically, these names are id-expressions.
5328 Consume the token. */
5332 {
5344 }
5349 /* Look up the name. */
5351 }
5354 {
5355 tree expression;
5356 tree type;
5357 source_location type_location;
5358 location_t start_loc
5360 /* The `__builtin_va_arg' construct is used to handle
5361 `va_arg'. Consume the `__builtin_va_arg' token. */
5363 /* Look for the opening `('. */
5364 matching_parens parens;
5366 /* Now, parse the assignment-expression. */
5368 /* Look for the `,'. */
5371 /* Parse the type-id. */
5372 {
5375 }
5376 /* Look for the closing `)'. */
5377 location_t finish_loc
5380 /* Using `va_arg' in a constant-expression is not
5381 allowed. */
5383 NIC_VA_ARG))
5385 /* Construct a location of the form:
5386 __builtin_va_arg (v, int)
5387 ~~~~~~~~~~~~~~~~~~~~~^~~~
5388 with the caret at the type, ranging from the start of the
5389 "__builtin_va_arg" token to the close paren. */
5390 location_t combined_loc
5393 }
5428 // C++ concepts
5432 /* Objective-C++ expressions. */
5442 {
5447 }
5448 /* FALLTHRU */
5452 }
5454 /* An id-expression can start with either an identifier, a
5455 `::' as the beginning of a qualified-id, or the "operator"
5456 keyword. */
5461 {
5462 id_expression:
5463 cp_expr id_expression;
5464 cp_expr decl;
5470 /* Parse the id-expression. */
5471 id_expression
5488 /* If we have a template-id, then no further lookup is
5489 required. If the template-id was for a template-class, we
5490 will sometimes have a TYPE_DECL at this point. */
5494 /* Look up the name. */
5495 else
5496 {
5497 tree ambiguous_decls;
5499 /* If we already know that this lookup is ambiguous, then
5500 we've already issued an error message; there's no reason
5501 to check again. */
5504 {
5507 }
5510 none_type,
5511 template_p,
5516 /* If the lookup was ambiguous, an error will already have
5517 been issued. */
5521 /* In Objective-C++, we may have an Objective-C 2.0
5522 dot-syntax for classes here. */
5527 {
5528 tree component;
5535 component);
5536 /* Build a location of the form:
5537 expr.component
5538 ~~~~~^~~~~~~~~
5539 with caret at the start of the component name (at
5540 input_location), ranging from the start of the id_expression
5541 to the end of the component name. */
5542 location_t combined_loc
5547 }
5549 /* In Objective-C++, an instance variable (ivar) may be preferred
5550 to whatever cp_parser_lookup_name() found.
5551 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5552 rest of c-family, we have to do a little extra work to preserve
5553 any location information in cp_expr "decl". Given that
5554 objc_lookup_ivar is implemented in "c-family" and "objc", we
5555 have a trip through the pure "tree" type, rather than cp_expr.
5556 Naively copying it back to "decl" would implicitly give the
5557 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5558 store an EXPR_LOCATION. Hence we only update "decl" (and
5559 hence its location_t) if we get back a different tree node. */
5561 id_expression);
5565 /* If name lookup gives us a SCOPE_REF, then the
5566 qualifying scope was dependent. */
5568 {
5569 /* At this point, we do not know if DECL is a valid
5570 integral constant expression. We assume that it is
5571 in fact such an expression, so that code like:
5573 template <int N> struct A {
5574 int a[B<N>::i];
5575 };
5577 is accepted. At template-instantiation time, we
5578 will check that B<N>::i is actually a constant. */
5580 }
5581 /* Check to see if DECL is a local variable in a context
5582 where that is forbidden. */
5585 {
5586 /* It might be that we only found DECL because we are
5587 trying to be generous with pre-ISO scoping rules.
5588 For example, consider:
5590 int i;
5591 void g() {
5592 for (int i = 0; i < 10; ++i) {}
5593 extern void f(int j = i);
5594 }
5596 Here, name look up will originally find the out
5597 of scope `i'. We need to issue a warning message,
5598 but then use the global `i'. */
5601 {
5606 }
5607 }
5608 }
5610 decl = (finish_id_expression
5612 idk,
5617 template_arg_p,
5624 }
5626 /* Anything else is an error. */
5630 }
5631 }
5639 {
5642 }
5644 /* Parse an id-expression.
5646 id-expression:
5647 unqualified-id
5648 qualified-id
5650 qualified-id:
5651 :: [opt] nested-name-specifier template [opt] unqualified-id
5652 :: identifier
5653 :: operator-function-id
5654 :: template-id
5656 Return a representation of the unqualified portion of the
5657 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5658 a `::' or nested-name-specifier.
5660 Often, if the id-expression was a qualified-id, the caller will
5661 want to make a SCOPE_REF to represent the qualified-id. This
5662 function does not do this in order to avoid wastefully creating
5663 SCOPE_REFs when they are not required.
5665 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5666 `template' keyword.
5668 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5669 uninstantiated templates.
5671 If *TEMPLATE_P is non-NULL, it is set to true iff the
5672 `template' keyword is used to explicitly indicate that the entity
5673 named is a template.
5675 If DECLARATOR_P is true, the id-expression is appearing as part of
5676 a declarator, rather than as part of an expression. */
5678 static cp_expr
5685 {
5689 /* Assume the `template' keyword was not used. */
5693 /* Look for the optional `::' operator. */
5694 global_scope_p
5695 = (!template_keyword_p
5700 /* Look for the optional nested-name-specifier. */
5701 nested_name_specifier_p
5704 check_dependency_p,
5706 declarator_p,
5707 template_keyword_p)
5710 /* If there is a nested-name-specifier, then we are looking at
5711 the first qualified-id production. */
5713 {
5714 tree saved_scope;
5715 tree saved_object_scope;
5716 tree saved_qualifying_scope;
5717 cp_expr unqualified_id;
5720 /* See if the next token is the `template' keyword. */
5724 /* Name lookup we do during the processing of the
5725 unqualified-id might obliterate SCOPE. */
5729 /* Process the final unqualified-id. */
5731 check_dependency_p,
5732 declarator_p,
5734 /* Restore the SAVED_SCOPE for our caller. */
5740 }
5741 /* Otherwise, if we are in global scope, then we are looking at one
5742 of the other qualified-id productions. */
5744 {
5746 tree id;
5748 /* Peek at the next token. */
5751 /* If it's an identifier, and the next token is not a "<", then
5752 we can avoid the template-id case. This is an optimization
5753 for this common case. */
5755 && !cp_parser_nth_token_starts_template_argument_list_p
5760 /* Try a template-id. */
5764 none_type,
5765 declarator_p);
5766 /* If that worked, we're done. */
5770 /* Peek at the next token. (Changes in the token buffer may
5771 have invalidated the pointer obtained above.) */
5775 {
5782 /* Fall through. */
5787 }
5788 }
5789 else
5792 declarator_p,
5793 optional_p);
5794 }
5796 /* Parse an unqualified-id.
5798 unqualified-id:
5799 identifier
5800 operator-function-id
5801 conversion-function-id
5802 ~ class-name
5803 template-id
5805 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5806 keyword, in a construct like `A::template ...'.
5808 Returns a representation of unqualified-id. For the `identifier'
5809 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5810 production a BIT_NOT_EXPR is returned; the operand of the
5811 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5812 other productions, see the documentation accompanying the
5813 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5814 names are looked up in uninstantiated templates. If DECLARATOR_P
5815 is true, the unqualified-id is appearing as part of a declarator,
5816 rather than as part of an expression. */
5818 static cp_expr
5824 {
5827 /* Peek at the next token. */
5831 {
5833 {
5834 tree id;
5836 /* We don't know yet whether or not this will be a
5837 template-id. */
5839 /* Try a template-id. */
5841 check_dependency_p,
5842 none_type,
5843 declarator_p);
5844 /* If it worked, we're done. */
5847 /* Otherwise, it's an ordinary identifier. */
5849 }
5853 check_dependency_p,
5854 none_type,
5855 declarator_p);
5858 {
5859 tree type_decl;
5860 tree qualifying_scope;
5861 tree object_scope;
5862 tree scope;
5865 /* Consume the `~' token. */
5867 /* Parse the class-name. The standard, as written, seems to
5868 say that:
5870 template <typename T> struct S { ~S (); };
5871 template <typename T> S<T>::~S() {}
5873 is invalid, since `~' must be followed by a class-name, but
5874 `S<T>' is dependent, and so not known to be a class.
5875 That's not right; we need to look in uninstantiated
5876 templates. A further complication arises from:
5878 template <typename T> void f(T t) {
5879 t.T::~T();
5880 }
5882 Here, it is not possible to look up `T' in the scope of `T'
5883 itself. We must look in both the current scope, and the
5884 scope of the containing complete expression.
5886 Yet another issue is:
5888 struct S {
5889 int S;
5890 ~S();
5891 };
5893 S::~S() {}
5895 The standard does not seem to say that the `S' in `~S'
5896 should refer to the type `S' and not the data member
5897 `S::S'. */
5899 /* DR 244 says that we look up the name after the "~" in the
5900 same scope as we looked up the qualifying name. That idea
5901 isn't fully worked out; it's more complicated than that. */
5906 /* Check for invalid scopes. */
5908 {
5912 }
5914 {
5918 scope);
5923 }
5926 /* If the name is of the form "X::~X" it's OK even if X is a
5927 typedef. */
5936 {
5939 }
5941 /* ~auto means the destructor of whatever the object is. */
5943 {
5946 "%<~auto%> only available with "
5950 }
5952 /* If there was an explicit qualification (S::~T), first look
5953 in the scope given by the qualification (i.e., S).
5955 Note: in the calls to cp_parser_class_name below we pass
5956 typename_type so that lookup finds the injected-class-name
5957 rather than the constructor. */
5961 {
5966 typename_type,
5969 declarator_p);
5972 }
5973 /* In "N::S::~S", look in "N" as well. */
5975 {
5980 type_decl
5984 typename_type,
5987 declarator_p);
5990 }
5991 /* In "p->S::~T", look in the scope given by "*p" as well. */
5993 {
5998 type_decl
6002 typename_type,
6005 declarator_p);
6008 }
6009 /* Look in the surrounding context. */
6011 {
6017 type_decl
6021 typename_type,
6024 declarator_p);
6027 {
6028 /* We couldn't find a type with this name. If we're parsing
6029 tentatively, fail and try something else. */
6031 {
6034 }
6035 /* Otherwise, accept it and check for a match at instantiation
6036 time. */
6041 }
6042 }
6043 /* If an error occurred, assume that the name of the
6044 destructor is the same as the name of the qualifying
6045 class. That allows us to keep parsing after running
6046 into ill-formed destructor names. */
6052 /* Check that destructor name and scope match. */
6054 {
6061 }
6063 /* [class.dtor]
6065 A typedef-name that names a class shall not be used as the
6066 identifier in the declarator for a destructor declaration. */
6073 type_decl);
6076 }
6080 {
6081 cp_expr id;
6083 /* This could be a template-id, so we try that first. */
6085 /* Try a template-id. */
6088 none_type,
6089 declarator_p);
6090 /* If that worked, we're done. */
6093 /* We still don't know whether we're looking at an
6094 operator-function-id or a conversion-function-id. */
6096 /* Try an operator-function-id. */
6098 /* If that didn't work, try a conversion-function-id. */
6102 {
6103 /* 17.6.3.3.5 */
6108 "literal operator suffixes not preceded by %<_%>"
6110 }
6113 }
6114 /* Fall through. */
6121 }
6122 }
6124 /* Parse an (optional) nested-name-specifier.
6126 nested-name-specifier: [C++98]
6127 class-or-namespace-name :: nested-name-specifier [opt]
6128 class-or-namespace-name :: template nested-name-specifier [opt]
6130 nested-name-specifier: [C++0x]
6131 type-name ::
6132 namespace-name ::
6133 nested-name-specifier identifier ::
6134 nested-name-specifier template [opt] simple-template-id ::
6136 PARSER->SCOPE should be set appropriately before this function is
6137 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6138 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6139 in name lookups.
6141 Sets PARSER->SCOPE to the class (TYPE) or namespace
6142 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6143 it unchanged if there is no nested-name-specifier. Returns the new
6144 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6146 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6147 part of a declaration and/or decl-specifier. */
6149 static tree
6156 {
6161 /* Remember where the nested-name-specifier starts. */
6163 {
6166 }
6169 {
6170 tree new_scope;
6171 tree old_scope;
6172 tree saved_qualifying_scope;
6174 /* Spot cases that cannot be the beginning of a
6175 nested-name-specifier. */
6178 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6179 the already parsed nested-name-specifier. */
6181 {
6182 /* Grab the nested-name-specifier and continue the loop. */
6184 /* If we originally encountered this nested-name-specifier
6185 with IS_DECLARATION set to false, we will not have
6186 resolved TYPENAME_TYPEs, so we must do so here. */
6189 {
6194 }
6197 }
6199 /* Spot cases that cannot be the beginning of a
6200 nested-name-specifier. On the second and subsequent times
6201 through the loop, we look for the `template' keyword. */
6203 ;
6204 /* A template-id can start a nested-name-specifier. */
6206 ;
6207 /* DR 743: decltype can be used in a nested-name-specifier. */
6209 ;
6210 else
6211 {
6212 /* If the next token is not an identifier, then it is
6213 definitely not a type-name or namespace-name. */
6216 /* If the following token is neither a `<' (to begin a
6217 template-id), nor a `::', then we are not looking at a
6218 nested-name-specifier. */
6224 {
6228 "found %<:%> in nested-name-specifier, "
6231 }
6234 && !cp_parser_nth_token_starts_template_argument_list_p
6237 }
6239 /* The nested-name-specifier is optional, so we parse
6240 tentatively. */
6243 /* Look for the optional `template' keyword, if this isn't the
6244 first time through the loop. */
6248 /* Save the old scope since the name lookup we are about to do
6249 might destroy it. */
6252 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6253 look up names in "X<T>::I" in order to determine that "Y" is
6254 a template. So, if we have a typename at this point, we make
6255 an effort to look through it. */
6257 && !typename_keyword_p
6262 /* Parse the qualifying entity. */
6263 new_scope
6265 typename_keyword_p,
6266 template_keyword_p,
6267 check_dependency_p,
6268 type_p,
6269 is_declaration);
6270 /* Look for the `::' token. */
6273 /* If we found what we wanted, we keep going; otherwise, we're
6274 done. */
6276 {
6279 /* Restore the OLD_SCOPE since it was valid before the
6280 failed attempt at finding the last
6281 class-or-namespace-name. */
6285 /* If the next token is a decltype, and the one after that is a
6286 `::', then the decltype has failed to resolve to a class or
6287 enumeration type. Give this error even when parsing
6288 tentatively since it can't possibly be valid--and we're going
6289 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6290 won't get another chance.*/
6294 {
6301 /* As below. */
6304 }
6308 {
6309 /* If we have a non-type template-id followed by ::, it can't
6310 possibly be valid. */
6315 {
6318 {
6324 }
6325 else
6326 {
6327 /* Variable template. */
6332 }
6339 /* As below. */
6343 }
6344 }
6348 /* If the next token is an identifier, and the one after
6349 that is a `::', then any valid interpretation would have
6350 found a class-or-namespace-name. */
6356 {
6359 {
6361 {
6362 tree decl;
6363 tree ambiguous_decls;
6366 none_type,
6375 decl);
6377 {
6378 // cp_parser_lookup_name has the same diagnostic,
6379 // thus make sure to emit it at most once.
6382 {
6387 }
6389 }
6390 else
6391 {
6393 cp_parser_name_lookup_error
6396 else
6397 cp_parser_name_lookup_error
6400 }
6401 }
6404 /* Treat this as a successful nested-name-specifier
6405 due to:
6407 [basic.lookup.qual]
6409 If the name found is not a class-name (clause
6410 _class_) or namespace-name (_namespace.def_), the
6411 program is ill-formed. */
6413 }
6415 }
6417 }
6418 /* We've found one valid nested-name-specifier. */
6420 /* Name lookup always gives us a DECL. */
6423 /* Uses of "template" must be followed by actual templates. */
6435 new_scope);
6436 /* If it is a class scope, try to complete it; we are about to
6437 be looking up names inside the class. */
6439 /* Since checking types for dependency can be expensive,
6440 avoid doing it if the type is already complete. */
6442 /* Do not try to complete dependent types. */
6444 {
6446 /* If it is a typedef to current class, use the current
6447 class instead, as the typedef won't have any names inside
6448 it yet. */
6452 }
6453 /* Make sure we look in the right scope the next time through
6454 the loop. */
6456 }
6458 /* If parsing tentatively, replace the sequence of tokens that makes
6459 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6460 token. That way, should we re-parse the token stream, we will
6461 not have to repeat the effort required to do the parse, nor will
6462 we issue duplicate error messages. */
6464 {
6468 /* Reset the contents of the START token. */
6470 /* Retrieve any deferred checks. Do not pop this access checks yet
6471 so the memory will not be reclaimed during token replacing below. */
6479 /* Purge all subsequent tokens. */
6481 }
6487 }
6489 /* Parse a nested-name-specifier. See
6490 cp_parser_nested_name_specifier_opt for details. This function
6491 behaves identically, except that it will an issue an error if no
6492 nested-name-specifier is present. */
6494 static tree
6500 {
6501 tree scope;
6503 /* Look for the nested-name-specifier. */
6505 typename_keyword_p,
6506 check_dependency_p,
6507 type_p,
6508 is_declaration);
6509 /* If it was not present, issue an error message. */
6511 {
6514 }
6517 }
6519 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6520 this is either a class-name or a namespace-name (which corresponds
6521 to the class-or-namespace-name production in the grammar). For
6522 C++0x, it can also be a type-name that refers to an enumeration
6523 type or a simple-template-id.
6525 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6526 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6527 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6528 TYPE_P is TRUE iff the next name should be taken as a class-name,
6529 even the same name is declared to be another entity in the same
6530 scope.
6532 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6533 specified by the class-or-namespace-name. If neither is found the
6534 ERROR_MARK_NODE is returned. */
6536 static tree
6543 {
6544 tree saved_scope;
6545 tree saved_qualifying_scope;
6546 tree saved_object_scope;
6547 tree scope;
6551 /* DR 743: decltype can appear in a nested-name-specifier. */
6553 {
6557 {
6560 }
6564 }
6566 /* Before we try to parse the class-name, we must save away the
6567 current PARSER->SCOPE since cp_parser_class_name will destroy
6568 it. */
6572 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6573 there is no need to look for a namespace-name. */
6574 only_class_p = template_keyword_p
6579 typename_keyword_p,
6580 template_keyword_p,
6582 check_dependency_p,
6584 is_declaration,
6587 /* If that didn't work, try for a namespace-name. */
6589 {
6590 /* Restore the saved scope. */
6594 /* If we are not looking at an identifier followed by the scope
6595 resolution operator, then this is not part of a
6596 nested-name-specifier. (Note that this function is only used
6597 to parse the components of a nested-name-specifier.) */
6602 }
6605 }
6607 /* Return true if we are looking at a compound-literal, false otherwise. */
6609 static bool
6611 {
6614 /* Skip tokens until the next token is a closing parenthesis.
6615 If we find the closing `)', and the next token is a `{', then
6616 we are looking at a compound-literal. */
6617 bool compound_literal_p
6622 /* Roll back the tokens we skipped. */
6626 }
6628 /* Return true if EXPR is the integer constant zero or a complex constant
6629 of zero, without any folding, but ignoring location wrappers. */
6631 static bool
6633 {
6636 }
6638 /* Parse a postfix-expression.
6640 postfix-expression:
6641 primary-expression
6642 postfix-expression [ expression ]
6643 postfix-expression ( expression-list [opt] )
6644 simple-type-specifier ( expression-list [opt] )
6645 typename :: [opt] nested-name-specifier identifier
6646 ( expression-list [opt] )
6647 typename :: [opt] nested-name-specifier template [opt] template-id
6648 ( expression-list [opt] )
6649 postfix-expression . template [opt] id-expression
6650 postfix-expression -> template [opt] id-expression
6651 postfix-expression . pseudo-destructor-name
6652 postfix-expression -> pseudo-destructor-name
6653 postfix-expression ++
6654 postfix-expression --
6655 dynamic_cast < type-id > ( expression )
6656 static_cast < type-id > ( expression )
6657 reinterpret_cast < type-id > ( expression )
6658 const_cast < type-id > ( expression )
6659 typeid ( expression )
6660 typeid ( type-id )
6662 GNU Extension:
6664 postfix-expression:
6665 ( type-id ) { initializer-list , [opt] }
6667 This extension is a GNU version of the C99 compound-literal
6668 construct. (The C99 grammar uses `type-name' instead of `type-id',
6669 but they are essentially the same concept.)
6671 If ADDRESS_P is true, the postfix expression is the operand of the
6672 `&' operator. CAST_P is true if this expression is the target of a
6673 cast.
6675 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6676 class member access expressions [expr.ref].
6678 Returns a representation of the expression. */
6680 static cp_expr
6684 {
6686 location_t loc;
6692 /* Peek at the next token. */
6697 /* Some of the productions are determined by keywords. */
6700 {
6705 {
6706 tree type;
6707 cp_expr expression;
6711 /* All of these can be handled in the same way from the point
6712 of view of parsing. Begin by consuming the token
6713 identifying the cast. */
6716 /* New types cannot be defined in the cast. */
6718 parser->type_definition_forbidden_message
6721 /* Look for the opening `<'. */
6723 /* Parse the type to which we are casting. */
6728 /* Look for the closing `>'. */
6730 /* Restore the old message. */
6733 bool saved_greater_than_is_operator_p
6737 /* And the expression which is being cast. */
6738 matching_parens parens;
6742 RT_CLOSE_PAREN);
6746 parser->greater_than_is_operator_p
6749 /* Only type conversions to integral or enumeration types
6750 can be used in constant-expressions. */
6753 {
6756 }
6759 {
6761 postfix_expression
6765 postfix_expression
6769 postfix_expression
6771 tf_warning_or_error);
6774 postfix_expression
6779 }
6781 /* Construct a location e.g. :
6782 reinterpret_cast <int *> (expr)
6783 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6784 ranging from the start of the "*_cast" token to the final closing
6785 paren, with the caret at the start. */
6788 }
6792 {
6793 tree type;
6797 /* Consume the `typeid' token. */
6799 /* Look for the `(' token. */
6800 matching_parens parens;
6802 /* Types cannot be defined in a `typeid' expression. */
6804 parser->type_definition_forbidden_message
6806 /* We can't be sure yet whether we're looking at a type-id or an
6807 expression. */
6809 /* Try a type-id first. */
6814 /* Look for the `)' token. Otherwise, we can't be sure that
6815 we're not looking at an expression: consider `typeid (int
6816 (3))', for example. */
6818 /* If all went well, simply lookup the type-id. */
6821 /* Otherwise, fall back to the expression variant. */
6822 else
6823 {
6824 tree expression;
6826 /* Look for an expression. */
6828 /* Compute its typeid. */
6830 /* Look for the `)' token. */
6832 }
6833 /* Restore the saved message. */
6835 /* `typeid' may not appear in an integral constant expression. */
6839 /* Construct a location e.g. :
6840 typeid (expr)
6841 ^~~~~~~~~~~~~
6842 ranging from the start of the "typeid" token to the final closing
6843 paren, with the caret at the start. */
6845 {
6846 location_t typeid_loc
6850 }
6851 }
6855 {
6856 tree type;
6857 /* The syntax permitted here is the same permitted for an
6858 elaborated-type-specifier. */
6865 }
6871 {
6874 tree p;
6881 {
6884 }
6890 {
6893 postfix_expression
6895 else
6896 {
6900 }
6906 tf_warning_or_error);
6907 else
6908 {
6912 }
6917 postfix_expression
6921 postfix_expression
6924 else
6925 {
6929 }
6934 }
6936 }
6939 {
6940 tree type;
6942 /* If the next thing is a simple-type-specifier, we may be
6943 looking at a functional cast. We could also be looking at
6944 an id-expression. So, we try the functional cast, and if
6945 that doesn't work we fall back to the primary-expression. */
6947 /* Look for the simple-type-specifier. */
6951 CP_PARSER_FLAGS_NONE);
6953 /* Parse the cast itself. */
6955 postfix_expression
6957 /* If that worked, we're done. */
6961 /* If the functional-cast didn't work out, try a
6962 compound-literal. */
6965 {
6970 matching_parens parens;
6973 /* Avoid calling cp_parser_type_id pointlessly, see comment
6974 in cp_parser_cast_expression about c++/29234. */
6977 else
6978 {
6979 /* Parse the type. */
6985 }
6987 /* If things aren't going well, there's no need to
6988 keep going. */
6990 {
6992 /* Parse the brace-enclosed initializer list. */
6995 }
6996 /* If that worked, we're definitely looking at a
6997 compound-literal expression. */
6999 {
7000 /* Warn the user that a compound literal is not
7001 allowed in standard C++. */
7004 /* For simplicity, we disallow compound literals in
7005 constant-expressions. We could
7006 allow compound literals of integer type, whose
7007 initializer was a constant, in constant
7008 expressions. Permitting that usage, as a further
7009 extension, would not change the meaning of any
7010 currently accepted programs. (Of course, as
7011 compound literals are not part of ISO C++, the
7012 standard has nothing to say.) */
7014 NIC_NCC))
7015 {
7018 }
7019 /* Form the representation of the compound-literal. */
7020 postfix_expression
7025 }
7026 }
7028 /* It must be a primary-expression. */
7029 postfix_expression
7032 decltype_p,
7034 }
7036 }
7038 /* Note that we don't need to worry about calling build_cplus_new on a
7039 class-valued CALL_EXPR in decltype when it isn't the end of the
7040 postfix-expression; unary_complex_lvalue will take care of that for
7041 all these cases. */
7043 /* Keep looping until the postfix-expression is complete. */
7045 {
7049 /* It is not a Koenig lookup function call. */
7050 postfix_expression
7053 /* Peek at the next token. */
7057 {
7060 {
7062 "two consecutive %<[%> shall "
7065 }
7066 postfix_expression
7068 postfix_expression,
7070 decltype_p);
7079 /* postfix-expression ( expression-list [opt] ) */
7080 {
7091 is_builtin_constant_p
7094 {
7095 /* The whole point of __builtin_constant_p is to allow
7096 non-constant expressions to appear as arguments. */
7097 saved_integral_constant_expression_p
7099 saved_non_integral_constant_expression_p
7102 }
7103 args = (cp_parser_parenthesized_expression_list
7110 {
7111 parser->integral_constant_expression_p
7113 parser->non_integral_constant_expression_p
7115 }
7118 {
7121 }
7123 /* Function calls are not permitted in
7124 constant-expressions. */
7127 NIC_FUNC_CALL))
7128 {
7132 }
7137 {
7139 {
7141 {
7144 postfix_expression
7146 complain);
7147 }
7148 else
7149 postfix_expression
7151 }
7152 /* We do not perform argument-dependent lookup if
7153 normal lookup finds a non-function, in accordance
7154 with the expected resolution of DR 218. */
7157 {
7161 /* Do not do argument dependent lookup if regular
7162 lookup finds a member function or a block-scope
7163 function declaration. [basic.lookup.argdep]/3 */
7166 {
7169 postfix_expression
7171 complain);
7172 }
7173 }
7174 }
7180 {
7187 }
7190 {
7200 {
7202 postfix_expression
7206 }
7209 {
7210 postfix_expression
7211 = (build_new_method_call
7217 complain));
7218 }
7219 else
7220 postfix_expression
7224 complain);
7225 }
7229 postfix_expression = (build_offset_ref_call_from_tree
7231 complain));
7233 /* A call to a static class member, or a namespace-scope
7234 function. */
7235 postfix_expression
7238 koenig_p,
7239 complain);
7240 else
7241 /* All other function calls. */
7242 postfix_expression
7245 koenig_p,
7246 complain);
7249 {
7251 start_loc,
7252 close_paren_loc);
7254 }
7256 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7260 }
7265 /* postfix-expression . template [opt] id-expression
7266 postfix-expression . pseudo-destructor-name
7267 postfix-expression -> template [opt] id-expression
7268 postfix-expression -> pseudo-destructor-name */
7270 /* Consume the `.' or `->' operator. */
7273 postfix_expression
7275 postfix_expression,
7282 /* postfix-expression ++ */
7283 /* Consume the `++' token. */
7285 /* Generate a representation for the complete expression. */
7286 postfix_expression
7288 POSTINCREMENT_EXPR);
7289 /* Increments may not appear in constant-expressions. */
7297 /* postfix-expression -- */
7298 /* Consume the `--' token. */
7300 /* Generate a representation for the complete expression. */
7301 postfix_expression
7303 POSTDECREMENT_EXPR);
7304 /* Decrements may not appear in constant-expressions. */
7315 return is_member_access
7316 ? postfix_expression
7318 else
7320 }
7321 }
7323 /* We should never get here. */
7326 }
7328 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7329 by cp_parser_builtin_offsetof. We're looking for
7331 postfix-expression [ expression ]
7332 postfix-expression [ braced-init-list ] (C++11)
7334 FOR_OFFSETOF is set if we're being called in that context, which
7335 changes how we deal with integer constant expressions. */
7337 static tree
7339 tree postfix_expression,
7342 {
7347 /* Consume the `[' token. */
7353 /* Parse the index expression. */
7354 /* ??? For offsetof, there is a question of what to allow here. If
7355 offsetof is not being used in an integral constant expression context,
7356 then we *could* get the right answer by computing the value at runtime.
7357 If we are in an integral constant expression context, then we might
7358 could accept any constant expression; hard to say without analysis.
7359 Rather than open the barn door too wide right away, allow only integer
7360 constant expressions here. */
7363 else
7364 {
7366 {
7371 }
7372 else
7374 }
7378 /* Look for the closing `]'. */
7381 /* Build the ARRAY_REF. */
7385 /* When not doing offsetof, array references are not permitted in
7386 constant-expressions. */
7392 }
7394 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7395 dereference of incomplete type, returns true if error_mark_node should
7396 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7397 and *DEPENDENT_P. */
7399 bool
7402 {
7403 /* In a template, be permissive by treating an object expression
7404 of incomplete type as dependent (after a pedwarn). */
7405 diagnostic_t kind = (processing_template_decl
7409 {
7421 /* Don't emit any diagnostic for OVERLOADs. */
7425 /* Avoid clobbering e.g. DECLs. */
7429 }
7441 {
7444 }
7446 }
7448 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7449 by cp_parser_builtin_offsetof. We're looking for
7451 postfix-expression . template [opt] id-expression
7452 postfix-expression . pseudo-destructor-name
7453 postfix-expression -> template [opt] id-expression
7454 postfix-expression -> pseudo-destructor-name
7456 FOR_OFFSETOF is set if we're being called in that context. That sorta
7457 limits what of the above we'll actually accept, but nevermind.
7458 TOKEN_TYPE is the "." or "->" token, which will already have been
7459 removed from the stream. */
7461 static tree
7464 cp_expr postfix_expression,
7466 location_t location)
7467 {
7468 tree name;
7474 /* If this is a `->' operator, dereference the pointer. */
7477 tf_warning_or_error);
7478 /* Check to see whether or not the expression is type-dependent and
7479 not the current instantiation. */
7481 /* The identifier following the `->' or `.' is not qualified. */
7487 /* Enter the scope corresponding to the type of the object
7488 given by the POSTFIX_EXPRESSION. */
7490 {
7492 /* According to the standard, no expression should ever have
7493 reference type. Unfortunately, we do not currently match
7494 the standard in this respect in that our internal representation
7495 of an expression may have reference type even when the standard
7496 says it does not. Therefore, we have to manually obtain the
7497 underlying type here. */
7499 /* The type of the POSTFIX_EXPRESSION must be complete. */
7500 /* Unlike the object expression in other contexts, *this is not
7501 required to be of complete type for purposes of class member
7502 access (5.2.5) outside the member function body. */
7505 && !(processing_template_decl
7506 && current_class_type
7507 && (same_type_ignoring_top_level_qualifiers_p
7509 {
7515 }
7518 {
7519 /* Let the name lookup machinery know that we are processing a
7520 class member access expression. */
7522 /* If something went wrong, we want to be able to discern that case,
7523 as opposed to the case where there was no SCOPE due to the type
7524 of expression being dependent. */
7527 /* If the SCOPE was erroneous, make the various semantic analysis
7528 functions exit quickly -- and without issuing additional error
7529 messages. */
7532 }
7533 }
7536 /* Tell cp_parser_lookup_name that there was an object, even though it's
7537 type-dependent. */
7540 /* Assume this expression is not a pseudo-destructor access. */
7543 /* If the SCOPE is a scalar type, then, if this is a valid program,
7544 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7545 is type dependent, it can be pseudo-destructor-name or something else.
7546 Try to parse it as pseudo-destructor-name first. */
7548 {
7549 tree s;
7550 tree type;
7553 /* Parse the pseudo-destructor-name. */
7562 {
7564 postfix_expression
7567 }
7568 }
7571 {
7572 /* If the SCOPE is not a scalar type, we are looking at an
7573 ordinary class member access expression, rather than a
7574 pseudo-destructor-name. */
7577 /* Parse the id-expression. */
7578 name = (cp_parser_id_expression
7585 /* In general, build a SCOPE_REF if the member name is qualified.
7586 However, if the name was not dependent and has already been
7587 resolved; there is no need to build the SCOPE_REF. For example;
7589 struct X { void f(); };
7590 template <typename T> void f(T* t) { t->X::f(); }
7592 Even though "t" is dependent, "X::f" is not and has been resolved
7593 to a BASELINK; there is no need to include scope information. */
7595 /* But we do need to remember that there was an explicit scope for
7596 virtual function calls. */
7600 /* If the name is a template-id that names a type, we will get a
7601 TYPE_DECL here. That is invalid code. */
7603 {
7606 }
7607 else
7608 {
7610 {
7612 {
7616 }
7617 else
7620 name,
7621 template_p);
7625 }
7627 adjust_result_of_qualified_name_lookup
7629 postfix_expression
7631 template_p,
7632 tf_warning_or_error);
7633 /* Build a location e.g.:
7634 ptr->access_expr
7635 ~~~^~~~~~~~~~~~~
7636 where the caret is at the deref token, ranging from
7637 the start of postfix_expression to the end of the access expr. */
7638 location_t end_loc
7640 location_t combined_loc
7643 }
7644 }
7646 /* We no longer need to look up names in the scope of the object on
7647 the left-hand side of the `.' or `->' operator. */
7650 /* Outside of offsetof, these operators may not appear in
7651 constant-expressions. */
7653 && (cp_parser_non_integral_constant_expression
7658 }
7660 /* Parse a parenthesized expression-list.
7662 expression-list:
7663 assignment-expression
7664 expression-list, assignment-expression
7666 attribute-list:
7667 expression-list
7668 identifier
7669 identifier, expression-list
7671 CAST_P is true if this expression is the target of a cast.
7673 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7674 argument pack.
7676 WRAP_LOCATIONS_P is true if expressions within this list for which
7677 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7678 their source locations.
7680 Returns a vector of trees. Each element is a representation of an
7681 assignment-expression. NULL is returned if the ( and or ) are
7682 missing. An empty, but allocated, vector is returned on no
7683 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7684 if we are parsing an attribute list for an attribute that wants a
7685 plain identifier argument, normal_attr for an attribute that wants
7686 an expression, or non_attr if we aren't parsing an attribute list. If
7687 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7688 not all of the expressions in the list were constant.
7689 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7690 will be written to with the location of the closing parenthesis. If
7691 an error occurs, it may or may not be written to. */
7701 {
7707 /* Assume all the expressions will be constant. */
7711 matching_parens parens;
7717 /* Within a parenthesized expression, a `>' token is always
7718 the greater-than operator. */
7719 saved_greater_than_is_operator_p
7725 /* Consume expressions until there are no more. */
7728 {
7729 /* At the beginning of attribute lists, check to see if the
7730 next token is an identifier. */
7733 {
7736 /* Consume the identifier. */
7738 /* Save the identifier. */
7740 }
7741 else
7742 {
7745 /* Parse the next assignment-expression. */
7747 {
7748 /* A braced-init-list. */
7754 }
7756 {
7757 expr = (cp_parser_constant_expression
7762 }
7763 else
7765 cast_p);
7770 /* If we have an ellipsis, then this is an expression
7771 expansion. */
7774 {
7775 /* Consume the `...'. */
7778 /* Build the argument pack. */
7780 }
7785 /* Add it to the list. We add error_mark_node
7786 expressions to the list, so that we can still tell if
7787 the correct form for a parenthesized expression-list
7788 is found. That gives better errors. */
7793 }
7795 /* After the first item, attribute lists look the same as
7796 expression lists. */
7799 get_comma:;
7800 /* If the next token isn't a `,', then we are done. */
7804 /* Otherwise, consume the `,' and keep going. */
7806 }
7812 {
7815 skip_comma:;
7816 /* We try and resync to an unnested comma, as that will give the
7817 user better diagnostics. */
7825 {
7826 parser->greater_than_is_operator_p
7829 }
7830 }
7832 parser->greater_than_is_operator_p
7839 }
7841 /* Parse a pseudo-destructor-name.
7843 pseudo-destructor-name:
7844 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7845 :: [opt] nested-name-specifier template template-id :: ~ type-name
7846 :: [opt] nested-name-specifier [opt] ~ type-name
7848 If either of the first two productions is used, sets *SCOPE to the
7849 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7850 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7851 or ERROR_MARK_NODE if the parse fails. */
7853 static void
7855 tree object,
7858 {
7861 /* Handle ~auto. */
7865 {
7868 "%<~auto%> only available with "
7875 }
7877 /* Assume that things will not work out. */
7880 /* Look for the optional `::' operator. */
7882 /* Look for the optional nested-name-specifier. */
7883 nested_name_specifier_p
7890 /* Now, if we saw a nested-name-specifier, we might be doing the
7891 second production. */
7894 {
7895 /* Consume the `template' keyword. */
7897 /* Parse the template-id. */
7901 class_type,
7903 /* Look for the `::' token. */
7905 }
7906 /* If the next token is not a `~', then there might be some
7907 additional qualification. */
7909 {
7910 /* At this point, we're looking for "type-name :: ~". The type-name
7911 must not be a class-name, since this is a pseudo-destructor. So,
7912 it must be either an enum-name, or a typedef-name -- both of which
7913 are just identifiers. So, we peek ahead to check that the "::"
7914 and "~" tokens are present; if they are not, then we can avoid
7915 calling type_name. */
7919 {
7922 }
7924 /* Look for the type-name. */
7929 /* Look for the `::' token. */
7931 }
7932 else
7935 /* Look for the `~'. */
7938 /* Once we see the ~, this has to be a pseudo-destructor. */
7942 /* Look for the type-name again. We are not responsible for
7943 checking that it matches the first type-name. */
7945 }
7947 /* Parse a unary-expression.
7949 unary-expression:
7950 postfix-expression
7951 ++ cast-expression
7952 -- cast-expression
7953 unary-operator cast-expression
7954 sizeof unary-expression
7955 sizeof ( type-id )
7956 alignof ( type-id ) [C++0x]
7957 new-expression
7958 delete-expression
7960 GNU Extensions:
7962 unary-expression:
7963 __extension__ cast-expression
7964 __alignof__ unary-expression
7965 __alignof__ ( type-id )
7966 alignof unary-expression [C++0x]
7967 __real__ cast-expression
7968 __imag__ cast-expression
7969 && identifier
7970 sizeof ( type-id ) { initializer-list , [opt] }
7971 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7972 __alignof__ ( type-id ) { initializer-list , [opt] }
7974 ADDRESS_P is true iff the unary-expression is appearing as the
7975 operand of the `&' operator. CAST_P is true if this expression is
7976 the target of a cast.
7978 Returns a representation of the expression. */
7980 static cp_expr
7983 {
7987 /* Peek at the next token. */
7989 /* Some keywords give away the kind of expression. */
7991 {
7995 {
7998 {
8004 /* Consume the token. */
8006 /* Parse the operand. */
8011 else
8012 {
8013 /* ISO C++ defines alignof only with types, not with
8014 expressions. So pedwarn if alignof is used with a non-
8015 type expression. However, __alignof__ is ok. */
8018 "ISO C++ does not allow %<alignof%> "
8022 }
8023 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8024 SIZEOF_EXPR with the original operand. */
8026 {
8028 {
8030 {
8033 error_mark_node));
8035 }
8036 else
8040 }
8041 }
8043 /* Construct a location e.g. :
8044 alignof (expr)
8045 ^~~~~~~~~~~~~~
8046 with start == caret at the start of the "alignof"/"sizeof"
8047 token, with the endpoint at the final closing paren. */
8048 location_t finish_loc
8050 location_t compound_loc
8057 }
8066 {
8067 /* The saved value of the PEDANTIC flag. */
8069 tree expr;
8071 /* Save away the PEDANTIC flag. */
8073 /* Parse the cast-expression. */
8075 /* Restore the PEDANTIC flag. */
8079 }
8083 {
8084 tree expression;
8086 /* Consume the `__real__' or `__imag__' token. */
8088 /* Parse the cast-expression. */
8090 /* Create the complete representation. */
8094 expression,
8095 tf_warning_or_error);
8096 }
8104 {
8105 tree expr;
8114 matching_parens parens;
8118 parser->type_definition_forbidden_message
8121 saved_integral_constant_expression_p
8123 saved_non_integral_constant_expression_p
8127 saved_greater_than_is_operator_p
8139 parser->greater_than_is_operator_p
8142 parser->integral_constant_expression_p
8144 parser->non_integral_constant_expression_p
8149 location_t finish_loc
8153 /* Construct a location of the form:
8154 noexcept (expr)
8155 ^~~~~~~~~~~~~~~
8156 with start == caret, finishing at the close-paren. */
8157 location_t noexcept_loc
8161 noexcept_loc);
8162 }
8166 }
8167 }
8169 /* Look for the `:: new' and `:: delete', which also signal the
8170 beginning of a new-expression, or delete-expression,
8171 respectively. If the next token is `::', then it might be one of
8172 these. */
8174 {
8177 /* See if the token after the `::' is one of the keywords in
8178 which we're interested. */
8180 /* If it's `new', we have a new-expression. */
8183 /* Similarly, for `delete'. */
8186 }
8188 /* Look for a unary operator. */
8190 /* The `++' and `--' operators can be handled similarly, even though
8191 they are not technically unary-operators in the grammar. */
8193 {
8198 /* Handle the GNU address-of-label extension. */
8201 {
8202 tree identifier;
8203 tree expression;
8206 /* Consume the '&&' token. */
8208 /* Look for the identifier. */
8209 location_t finish_loc
8212 /* Construct a location of the form:
8213 &&label
8214 ^~~~~~~
8215 with caret==start at the "&&", finish at the end of the label. */
8216 location_t combined_loc
8218 /* Create an expression representing the address. */
8221 NIC_ADDR_LABEL))
8224 }
8225 }
8227 {
8228 cp_expr cast_expression;
8234 /* Consume the operator token. */
8238 /* Parse the cast-expression. */
8239 cast_expression
8244 pidk);
8246 /* Make a location:
8247 OP_TOKEN CAST_EXPRESSION
8248 ^~~~~~~~~~~~~~~~~~~~~~~~~
8249 with start==caret at the operator token, and
8250 extending to the end of the cast_expression. */
8253 /* Now, build an appropriate representation. */
8255 {
8259 RO_UNARY_STAR,
8260 complain);
8261 /* TODO: build_x_indirect_ref does not always honor the
8262 location, so ensure it is set. */
8268 /* Fall through. */
8271 cast_expression,
8272 complain);
8273 /* TODO: build_x_unary_op does not always honor the location,
8274 so ensure it is set. */
8282 /* Fall through. */
8284 /* Immediately fold negation of a constant, unless the constant is 0
8285 (since -0 == 0) or it would overflow. */
8290 {
8293 cast_expression);
8295 {
8298 }
8299 }
8300 /* Fall through. */
8309 }
8313 non_constant_p))
8317 }
8321 decltype_p,
8322 pidk);
8323 }
8325 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8326 unary-operator, the corresponding tree code is returned. */
8328 static enum tree_code
8330 {
8332 {
8353 }
8354 }
8356 /* Parse a new-expression.
8358 new-expression:
8359 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8360 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8362 Returns a representation of the expression. */
8364 static tree
8366 {
8369 tree type;
8372 tree ret;
8376 /* Look for the optional `::' operator. */
8377 global_scope_p
8381 /* Look for the `new' operator. */
8383 /* There's no easy way to tell a new-placement from the
8384 `( type-id )' construct. */
8386 /* Look for a new-placement. */
8388 /* If that didn't work out, there's no new-placement. */
8390 {
8394 }
8396 /* If the next token is a `(', then we have a parenthesized
8397 type-id. */
8399 {
8403 /* Consume the `('. */
8404 matching_parens parens;
8407 /* Parse the type-id. */
8408 parser->type_definition_forbidden_message
8410 {
8413 }
8416 /* Look for the closing `)'. */
8419 /* There should not be a direct-new-declarator in this production,
8420 but GCC used to allowed this, so we check and emit a sensible error
8421 message for this case. */
8423 {
8429 }
8430 }
8431 /* Otherwise, there must be a new-type-id. */
8432 else
8435 /* If the next token is a `(' or '{', then we have a new-initializer. */
8440 else
8443 /* A new-expression may not appear in an integral constant
8444 expression. */
8447 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8448 of a new-type-id or type-id of a new-expression, the new-expression shall
8449 contain a new-initializer of the form ( assignment-expression )".
8450 Additionally, consistently with the spirit of DR 1467, we want to accept
8451 'new auto { 2 }' too. */
8457 {
8459 "initialization of new-expression for type %<auto%> "
8462 }
8463 else
8464 {
8465 /* Construct a location e.g.:
8466 ptr = new int[100]
8467 ^~~~~~~~~~~~
8468 with caret == start at the start of the "new" token, and the end
8469 at the end of the final token we consumed. */
8474 /* Create a representation of the new-expression. */
8476 tf_warning_or_error);
8478 }
8486 }
8488 /* Parse a new-placement.
8490 new-placement:
8491 ( expression-list )
8493 Returns the same representation as for an expression-list. */
8497 {
8500 /* Parse the expression-list. */
8501 expression_list = (cp_parser_parenthesized_expression_list
8510 }
8512 /* Parse a new-type-id.
8514 new-type-id:
8515 type-specifier-seq new-declarator [opt]
8517 Returns the TYPE allocated. If the new-type-id indicates an array
8518 type, *NELTS is set to the number of elements in the last array
8519 bound; the TYPE will not include the last array bound. */
8521 static tree
8523 {
8524 cp_decl_specifier_seq type_specifier_seq;
8530 /* The type-specifier sequence must not contain type definitions.
8531 (It cannot contain declarations of new types either, but if they
8532 are not definitions we will catch that because they are not
8533 complete.) */
8535 parser->type_definition_forbidden_message
8537 /* Parse the type-specifier-seq. */
8541 /* Restore the old message. */
8547 /* Parse the new-declarator. */
8550 /* Determine the number of elements in the last array dimension, if
8551 any. */
8553 /* Skip down to the last array dimension. */
8558 {
8561 }
8566 {
8569 }
8572 {
8579 else
8581 }
8584 }
8586 /* Parse an (optional) new-declarator.
8588 new-declarator:
8589 ptr-operator new-declarator [opt]
8590 direct-new-declarator
8592 Returns the declarator. */
8596 {
8599 cp_cv_quals cv_quals;
8601 /* We don't know if there's a ptr-operator next, or not. */
8603 /* Look for a ptr-operator. */
8605 /* If that worked, look for more new-declarators. */
8607 {
8610 /* Parse another optional declarator. */
8613 declarator = cp_parser_make_indirect_declarator
8617 }
8619 /* If the next token is a `[', there is a direct-new-declarator. */
8624 }
8626 /* Parse a direct-new-declarator.
8628 direct-new-declarator:
8629 [ expression ]
8630 direct-new-declarator [constant-expression]
8632 */
8636 {
8640 {
8641 tree expression;
8644 /* Look for the opening `['. */
8649 /* The standard requires that the expression have integral
8650 type. DR 74 adds enumeration types. We believe that the
8651 real intent is that these expressions be handled like the
8652 expression in a `switch' condition, which also allows
8653 classes with a single conversion to integral or
8654 enumeration type. */
8656 {
8657 expression
8659 expression,
8662 {
8664 "expression in new-declarator must have integral "
8667 }
8668 }
8670 /* Look for the closing `]'. */
8673 /* Add this bound to the declarator. */
8676 /* If the next token is not a `[', then there are no more
8677 bounds. */
8680 }
8683 }
8685 /* Parse a new-initializer.
8687 new-initializer:
8688 ( expression-list [opt] )
8689 braced-init-list
8691 Returns a representation of the expression-list. */
8695 {
8699 {
8700 tree t;
8707 }
8708 else
8709 expression_list = (cp_parser_parenthesized_expression_list
8715 }
8717 /* Parse a delete-expression.
8719 delete-expression:
8720 :: [opt] delete cast-expression
8721 :: [opt] delete [ ] cast-expression
8723 Returns a representation of the expression. */
8725 static tree
8727 {
8730 tree expression;
8732 /* Look for the optional `::' operator. */
8733 global_scope_p
8737 /* Look for the `delete' keyword. */
8739 /* See if the array syntax is in use. */
8741 {
8742 /* Consume the `[' token. */
8744 /* Look for the `]' token. */
8746 /* Remember that this is the `[]' construct. */
8748 }
8749 else
8752 /* Parse the cast-expression. */
8755 /* A delete-expression may not appear in an integral constant
8756 expression. */
8761 tf_warning_or_error);
8762 }
8764 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8765 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8766 0 otherwise. */
8768 static int
8770 {
8773 {
8815 /* In ((type ()) () the last () isn't a valid cast-expression,
8816 so the whole must be parsed as postfix-expression. */
8821 /* '[' may start a primary-expression in obj-c++ and in C++11,
8822 as a lambda-expression, eg, '(void)[]{}'. */
8829 /* '++' and '--' may or may not start a cast-expression:
8831 struct T { void operator++(int); };
8832 void f() { (T())++; }
8834 vs
8836 int a;
8837 (int)++a; */
8842 }
8843 }
8845 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8846 in the order: const_cast, static_cast, reinterpret_cast.
8848 Don't suggest dynamic_cast.
8850 Return the first legal cast kind found, or NULL otherwise. */
8854 {
8855 tree trial;
8857 /* Reuse the parser logic by attempting to build the various kinds of
8858 cast, with "complain" disabled.
8859 Identify the first such cast that is valid. */
8861 /* Don't attempt to run such logic within template processing. */
8865 /* First try const_cast. */
8870 /* If that fails, try static_cast. */
8875 /* Finally, try reinterpret_cast. */
8880 /* No such cast possible. */
8882 }
8884 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8885 suggesting how to convert a C-style cast of the form:
8887 (DST_TYPE)ORIG_EXPR
8889 to a C++-style cast.
8891 The primary range of RICHLOC is asssumed to be that of the original
8892 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8893 of the parens in the C-style cast. */
8895 static void
8898 tree dst_type)
8899 {
8900 /* This function is non-trivial, so bail out now if the warning isn't
8901 going to be emitted. */
8905 /* Try to find a legal C++ cast, trying them in order:
8906 const_cast, static_cast, reinterpret_cast. */
8911 /* Replace the open paren with "CAST_SUGGESTION<". */
8912 pretty_printer pp;
8916 /* Replace the close paren with "> (". */
8919 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8921 }
8924 /* Parse a cast-expression.
8926 cast-expression:
8927 unary-expression
8928 ( type-id ) cast-expression
8930 ADDRESS_P is true iff the unary-expression is appearing as the
8931 operand of the `&' operator. CAST_P is true if this expression is
8932 the target of a cast.
8934 Returns a representation of the expression. */
8936 static cp_expr
8939 {
8940 /* If it's a `(', then we might be looking at a cast. */
8942 {
8948 /* There's no way to know yet whether or not this is a cast.
8949 For example, `(int (3))' is a unary-expression, while `(int)
8950 3' is a cast. So, we resort to parsing tentatively. */
8952 /* Types may not be defined in a cast. */
8954 parser->type_definition_forbidden_message
8956 /* Consume the `('. */
8957 matching_parens parens;
8962 /* A very tricky bit is that `(struct S) { 3 }' is a
8963 compound-literal (which we permit in C++ as an extension).
8964 But, that construct is not a cast-expression -- it is a
8965 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8966 is legal; if the compound-literal were a cast-expression,
8967 you'd need an extra set of parentheses.) But, if we parse
8968 the type-id, and it happens to be a class-specifier, then we
8969 will commit to the parse at that point, because we cannot
8970 undo the action that is done when creating a new class. So,
8971 then we cannot back up and do a postfix-expression.
8973 Another tricky case is the following (c++/29234):
8975 struct S { void operator () (); };
8977 void foo ()
8978 {
8979 ( S()() );
8980 }
8982 As a type-id we parse the parenthesized S()() as a function
8983 returning a function, groktypename complains and we cannot
8984 back up in this case either.
8986 Therefore, we scan ahead to the closing `)', and check to see
8987 if the tokens after the `)' can start a cast-expression. Otherwise
8988 we are dealing with an unary-expression, a postfix-expression
8989 or something else.
8991 Yet another tricky case, in C++11, is the following (c++/54891):
8993 (void)[]{};
8995 The issue is that usually, besides the case of lambda-expressions,
8996 the parenthesized type-id cannot be followed by '[', and, eg, we
8997 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8998 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8999 we don't commit, we try a cast-expression, then an unary-expression.
9001 Save tokens so that we can put them back. */
9004 /* We may be looking at a cast-expression. */
9007 cast_expression
9010 /* Roll back the tokens we skipped. */
9012 /* If we aren't looking at a cast-expression, simulate an error so
9013 that the call to cp_parser_error_occurred below returns true. */
9016 else
9017 {
9020 /* Look for the type-id. */
9022 /* Look for the closing `)'. */
9027 }
9029 /* Restore the saved message. */
9032 /* At this point this can only be either a cast or a
9033 parenthesized ctor such as `(T ())' that looks like a cast to
9034 function returning T. */
9036 {
9037 /* Only commit if the cast-expression doesn't start with
9038 '++', '--', or '[' in C++11. */
9046 pidk);
9049 {
9050 /* Warn about old-style casts, if so requested. */
9055 {
9061 }
9063 /* Only type conversions to integral or enumeration types
9064 can be used in constant-expressions. */
9067 NIC_CAST))
9070 /* Perform the cast. */
9071 /* Make a location:
9072 (TYPE) EXPR
9073 ^~~~~~~~~~~
9074 with start==caret at the open paren, extending to the
9075 end of "expr". */
9077 open_paren_loc,
9081 }
9082 }
9083 else
9085 }
9087 /* If we get here, then it's not a cast, so it must be a
9088 unary-expression. */
9091 }
9093 /* Parse a binary expression of the general form:
9095 pm-expression:
9096 cast-expression
9097 pm-expression .* cast-expression
9098 pm-expression ->* cast-expression
9100 multiplicative-expression:
9101 pm-expression
9102 multiplicative-expression * pm-expression
9103 multiplicative-expression / pm-expression
9104 multiplicative-expression % pm-expression
9106 additive-expression:
9107 multiplicative-expression
9108 additive-expression + multiplicative-expression
9109 additive-expression - multiplicative-expression
9111 shift-expression:
9112 additive-expression
9113 shift-expression << additive-expression
9114 shift-expression >> additive-expression
9116 relational-expression:
9117 shift-expression
9118 relational-expression < shift-expression
9119 relational-expression > shift-expression
9120 relational-expression <= shift-expression
9121 relational-expression >= shift-expression
9123 GNU Extension:
9125 relational-expression:
9126 relational-expression <? shift-expression
9127 relational-expression >? shift-expression
9129 equality-expression:
9130 relational-expression
9131 equality-expression == relational-expression
9132 equality-expression != relational-expression
9134 and-expression:
9135 equality-expression
9136 and-expression & equality-expression
9138 exclusive-or-expression:
9139 and-expression
9140 exclusive-or-expression ^ and-expression
9142 inclusive-or-expression:
9143 exclusive-or-expression
9144 inclusive-or-expression | exclusive-or-expression
9146 logical-and-expression:
9147 inclusive-or-expression
9148 logical-and-expression && inclusive-or-expression
9150 logical-or-expression:
9151 logical-and-expression
9152 logical-or-expression || logical-and-expression
9154 All these are implemented with a single function like:
9156 binary-expression:
9157 simple-cast-expression
9158 binary-expression <token> binary-expression
9160 CAST_P is true if this expression is the target of a cast.
9162 The binops_by_token map is used to get the tree codes for each <token> type.
9163 binary-expressions are associated according to a precedence table. */
9165 #define TOKEN_PRECEDENCE(token) \
9166 (((token->type == CPP_GREATER \
9167 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9168 && !parser->greater_than_is_operator_p) \
9169 ? PREC_NOT_OPERATOR \
9170 : binops_by_token[token->type].prec)
9172 static cp_expr
9178 {
9179 cp_parser_expression_stack stack;
9181 cp_parser_expression_stack_entry current;
9182 cp_expr rhs;
9186 tree overload;
9188 /* Parse the first expression. */
9199 {
9200 /* Get an operator token. */
9206 {
9208 "%<>>%> operator is treated"
9212 }
9217 /* This is a fold-expression; handle it later. */
9220 /* Popping an entry off the stack means we completed a subexpression:
9221 - either we found a token which is not an operator (`>' where it is not
9222 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9223 will happen repeatedly;
9224 - or, we found an operator which has lower priority. This is the case
9225 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9226 parsing `3 * 4'. */
9228 {
9231 else
9233 }
9235 get_rhs:
9239 /* We used the operator token. */
9242 /* For "false && x" or "true || x", x will never be executed;
9243 disable warnings while evaluating it. */
9245 c_inhibit_evaluation_warnings +=
9248 c_inhibit_evaluation_warnings +=
9251 /* Extract another operand. It may be the RHS of this expression
9252 or the LHS of a new, higher priority expression. */
9257 /* Get another operator token. Look up its precedence to avoid
9258 building a useless (immediately popped) stack entry for common
9259 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9266 {
9267 /* ... and prepare to parse the RHS of the new, higher priority
9268 expression. Since precedence levels on the stack are
9269 monotonically increasing, we do not have to care about
9270 stack overflows. */
9279 pop:
9281 /* If the stack is not empty, we have parsed into LHS the right side
9282 (`4' in the example above) of an expression we had suspended.
9283 We can use the information on the stack to recover the LHS (`3')
9284 from the stack together with the tree code (`MULT_EXPR'), and
9285 the precedence of the higher level subexpression
9286 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9287 which will be used to actually build the additive expression. */
9292 }
9294 /* Undo the disabling of warnings done above. */
9296 c_inhibit_evaluation_warnings -=
9299 c_inhibit_evaluation_warnings -=
9305 /* Avoid warning for !!x == y. */
9310 /* Avoid warning for !b == y where b is boolean. */
9314 /* Avoid warning for !!b == y where b is boolean. */
9327 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9328 ERROR_MARK for everything that is not a binary expression.
9329 This makes warn_about_parentheses miss some warnings that
9330 involve unary operators. For unary expressions we should
9331 pass the correct tree_code unless the unary expression was
9332 surrounded by parentheses.
9333 */
9337 {
9340 else
9341 {
9342 current.lhs
9345 == tcc_comparison
9349 }
9350 }
9351 else
9352 {
9357 /* TODO: build_x_binary_op doesn't always honor the location. */
9359 }
9362 /* If the binary operator required the use of an overloaded operator,
9363 then this expression cannot be an integral constant-expression.
9364 An overloaded operator can be used even if both operands are
9365 otherwise permissible in an integral constant-expression if at
9366 least one of the operands is of enumeration type. */
9370 NIC_OVERLOADED))
9372 }
9375 }
9377 static cp_expr
9382 {
9385 }
9387 /* Parse the `? expression : assignment-expression' part of a
9388 conditional-expression. The LOGICAL_OR_EXPR is the
9389 logical-or-expression that started the conditional-expression.
9390 Returns a representation of the entire conditional-expression.
9392 This routine is used by cp_parser_assignment_expression.
9394 ? expression : assignment-expression
9396 GNU Extensions:
9398 ? : assignment-expression */
9400 static tree
9402 {
9404 cp_expr assignment_expr;
9408 /* Consume the `?' token. */
9413 {
9416 /* Implicit true clause. */
9418 c_inhibit_evaluation_warnings +=
9421 }
9422 else
9423 {
9426 /* Parse the expression. */
9427 c_inhibit_evaluation_warnings +=
9430 c_inhibit_evaluation_warnings +=
9434 }
9436 /* The next token should be a `:'. */
9438 /* Parse the assignment-expression. */
9440 c_inhibit_evaluation_warnings -=
9443 /* Make a location:
9444 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9445 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9446 with the caret at the "?", ranging from the start of
9447 the logical_or_expr to the end of the assignment_expr. */
9452 /* Build the conditional-expression. */
9454 expr,
9455 assignment_expr,
9456 tf_warning_or_error);
9457 }
9459 /* Parse an assignment-expression.
9461 assignment-expression:
9462 conditional-expression
9463 logical-or-expression assignment-operator assignment_expression
9464 throw-expression
9466 CAST_P is true if this expression is the target of a cast.
9467 DECLTYPE_P is true if this expression is the operand of decltype.
9469 Returns a representation for the expression. */
9471 static cp_expr
9474 {
9475 cp_expr expr;
9477 /* If the next token is the `throw' keyword, then we're looking at
9478 a throw-expression. */
9481 /* Otherwise, it must be that we are looking at a
9482 logical-or-expression. */
9483 else
9484 {
9485 /* Parse the binary expressions (logical-or-expression). */
9487 decltype_p,
9489 /* If the next token is a `?' then we're actually looking at a
9490 conditional-expression. */
9493 else
9494 {
9497 /* If it's an assignment-operator, we're using the second
9498 production. */
9499 enum tree_code assignment_operator
9502 {
9505 /* Parse the right-hand side of the assignment. */
9512 /* An assignment may not appear in a
9513 constant-expression. */
9515 NIC_ASSIGNMENT))
9517 /* Build the assignment expression. Its default
9518 location:
9519 LHS = RHS
9520 ~~~~^~~~~
9521 is the location of the '=' token as the
9522 caret, ranging from the start of the lhs to the
9523 end of the rhs. */
9528 assignment_operator,
9529 rhs,
9531 /* TODO: build_x_modify_expr doesn't honor the location,
9532 so we must set it here. */
9534 }
9535 }
9536 }
9539 }
9541 /* Parse an (optional) assignment-operator.
9543 assignment-operator: one of
9544 = *= /= %= += -= >>= <<= &= ^= |=
9546 GNU Extension:
9548 assignment-operator: one of
9549 <?= >?=
9551 If the next token is an assignment operator, the corresponding tree
9552 code is returned, and the token is consumed. For example, for
9553 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9554 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9555 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9556 operator, ERROR_MARK is returned. */
9558 static enum tree_code
9560 {
9564 /* Peek at the next token. */
9568 {
9614 /* Nothing else is an assignment operator. */
9616 }
9618 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9623 /* If it was an assignment operator, consume it. */
9628 }
9630 /* Parse an expression.
9632 expression:
9633 assignment-expression
9634 expression , assignment-expression
9636 CAST_P is true if this expression is the target of a cast.
9637 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9638 except possibly parenthesized or on the RHS of a comma (N3276).
9640 Returns a representation of the expression. */
9642 static cp_expr
9645 {
9650 {
9651 cp_expr assignment_expression;
9653 /* Parse the next assignment-expression. */
9654 assignment_expression
9657 /* We don't create a temporary for a call that is the immediate operand
9658 of decltype or on the RHS of a comma. But when we see a comma, we
9659 need to create a temporary for a call on the LHS. */
9664 assignment_expression
9668 /* If this is the first assignment-expression, we can just
9669 save it away. */
9672 else
9673 {
9674 /* Create a location with caret at the comma, ranging
9675 from the start of the LHS to the end of the RHS. */
9680 assignment_expression,
9683 }
9684 /* If the next token is not a comma, or we're in a fold-expression, then
9685 we are done with the expression. */
9689 /* Consume the `,'. */
9692 /* A comma operator cannot appear in a constant-expression. */
9695 }
9698 }
9700 /* Parse a constant-expression.
9702 constant-expression:
9703 conditional-expression
9705 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9706 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9707 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9708 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9709 only parse a conditional-expression, otherwise parse an
9710 assignment-expression. See below for rationale. */
9712 static cp_expr
9717 {
9721 cp_expr expression;
9723 /* It might seem that we could simply parse the
9724 conditional-expression, and then check to see if it were
9725 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9726 one that the compiler can figure out is constant, possibly after
9727 doing some simplifications or optimizations. The standard has a
9728 precise definition of constant-expression, and we must honor
9729 that, even though it is somewhat more restrictive.
9731 For example:
9733 int i[(2, 3)];
9735 is not a legal declaration, because `(2, 3)' is not a
9736 constant-expression. The `,' operator is forbidden in a
9737 constant-expression. However, GCC's constant-folding machinery
9738 will fold this operation to an INTEGER_CST for `3'. */
9740 /* Save the old settings. */
9742 saved_allow_non_integral_constant_expression_p
9745 /* We are now parsing a constant-expression. */
9747 parser->allow_non_integral_constant_expression_p
9750 /* Although the grammar says "conditional-expression", when not STRICT_P,
9751 we parse an "assignment-expression", which also permits
9752 "throw-expression" and the use of assignment operators. In the case
9753 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9754 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9755 actually essential that we look for an assignment-expression.
9756 For example, cp_parser_initializer_clauses uses this function to
9757 determine whether a particular assignment-expression is in fact
9758 constant. */
9760 {
9761 /* Parse the binary expressions (logical-or-expression). */
9764 /* If the next token is a `?' then we're actually looking at
9765 a conditional-expression; otherwise we're done. */
9768 }
9769 else
9771 /* Restore the old settings. */
9772 parser->integral_constant_expression_p
9774 parser->allow_non_integral_constant_expression_p
9777 {
9778 /* Require an rvalue constant expression here; that's what our
9779 callers expect. Reference constant expressions are handled
9780 separately in e.g. cp_parser_template_argument. */
9789 }
9792 parser->non_integral_constant_expression_p
9796 }
9798 /* Parse __builtin_offsetof.
9800 offsetof-expression:
9801 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9803 offsetof-member-designator:
9804 id-expression
9805 | offsetof-member-designator "." id-expression
9806 | offsetof-member-designator "[" expression "]"
9807 | offsetof-member-designator "->" id-expression */
9809 static cp_expr
9811 {
9813 tree type;
9814 cp_expr expr;
9815 cp_id_kind dummy;
9817 location_t finish_loc;
9819 /* We're about to accept non-integral-constant things, but will
9820 definitely yield an integral constant expression. Save and
9821 restore these values around our local parsing. */
9827 /* Consume the "__builtin_offsetof" token. */
9829 /* Consume the opening `('. */
9830 matching_parens parens;
9832 /* Parse the type-id. */
9835 /* Look for the `,'. */
9839 /* Build the (type *)null that begins the traditional offsetof macro. */
9840 tree object_ptr
9842 tf_warning_or_error);
9844 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9848 {
9851 {
9853 /* offsetof-member-designator "[" expression "]" */
9859 /* offsetof-member-designator "->" identifier */
9862 /* FALLTHRU */
9865 /* offsetof-member-designator "." identifier */
9873 /* Consume the ")" token. */
9879 /* Error. We know the following require will fail, but
9880 that gives the proper error message. */
9885 }
9886 }
9888 success:
9889 /* Make a location of the form:
9890 __builtin_offsetof (struct s, f)
9891 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9892 with caret at the type-id, ranging from the start of the
9893 "_builtin_offsetof" token to the close paren. */
9895 /* The result will be an INTEGER_CST, so we need to explicitly
9896 preserve the location. */
9899 failure:
9905 }
9907 /* Parse a trait expression.
9909 Returns a representation of the expression, the underlying type
9910 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9912 static cp_expr
9914 {
9915 cp_trait_kind kind;
9921 {
10023 }
10025 /* Get location of initial token. */
10028 /* Consume the token. */
10031 matching_parens parens;
10034 {
10037 }
10043 {
10046 {
10049 }
10053 }
10055 {
10057 {
10061 {
10064 }
10068 }
10069 }
10074 /* Construct a location of the form:
10075 __is_trivially_copyable(_Tp)
10076 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10077 with start == caret, finishing at the close-paren. */
10080 /* Complete the trait expression, which may mean either processing
10081 the trait expr now or saving it for template instantiation. */
10083 {
10092 }
10093 }
10095 /* Parse a lambda expression.
10097 lambda-expression:
10098 lambda-introducer lambda-declarator [opt] compound-statement
10100 Returns a representation of the expression. */
10102 static cp_expr
10104 {
10106 tree type;
10114 {
10116 {
10120 }
10122 }
10124 {
10126 {
10129 }
10131 }
10133 /* We may be in the middle of deferred access check. Disable
10134 it now. */
10145 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10148 /* Now that we've started the type, add the capture fields for any
10149 explicit captures. */
10152 {
10153 /* Inside the class, surrounding template-parameter-lists do not apply. */
10154 unsigned int saved_num_template_parameter_lists
10158 bool fully_implicit_function_template_p
10162 bool auto_is_implicit_function_template_parm_p
10173 /* By virtue of defining a local class, a lambda expression has access to
10174 the private variables of enclosing classes. */
10182 {
10187 }
10189 {
10192 }
10194 /* The capture list was built up in reverse order; fix that now. */
10206 parser->fully_implicit_function_template_p
10210 parser->auto_is_implicit_function_template_parm_p
10212 }
10214 /* This field is only used during parsing of the lambda. */
10217 /* This lambda shouldn't have any proxies left at this point. */
10219 /* And now that we're done, push proxies for an enclosing lambda. */
10224 else
10232 }
10234 /* Parse the beginning of a lambda expression.
10236 lambda-introducer:
10237 [ lambda-capture [opt] ]
10239 LAMBDA_EXPR is the current representation of the lambda expression. */
10241 static void
10243 {
10244 /* Need commas after the first capture. */
10247 /* Eat the leading `['. */
10250 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10258 {
10261 }
10264 {
10266 tree capture_id;
10267 tree capture_init_expr;
10271 enum capture_kind_type
10272 {
10273 BY_COPY,
10274 BY_REFERENCE
10275 };
10279 {
10282 }
10286 else
10289 /* Possibly capture `this'. */
10291 {
10302 explicit_init_p);
10304 }
10306 /* Possibly capture `*this'. */
10309 {
10320 explicit_init_p);
10322 }
10324 /* Remember whether we want to capture as a reference or not. */
10326 {
10329 }
10331 /* Get the identifier. */
10336 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10337 delimiters, but I modified this to stop on unnested ']' as well. It
10338 was already changed to stop on unnested '}', so the
10339 "closing_parenthesis" name is no more misleading with my change. */
10340 {
10346 }
10348 /* Find the initializer for this capture. */
10352 {
10354 /* An explicit initializer exists. */
10357 "lambda capture initializers "
10363 {
10366 }
10367 }
10368 else
10369 {
10372 /* Turn the identifier into an id-expression. */
10373 capture_init_expr
10378 {
10381 }
10384 {
10387 capture_init_expr);
10392 }
10395 {
10398 capture_init_expr))
10402 }
10404 capture_init_expr
10405 = finish_id_expression
10407 capture_init_expr,
10421 {
10424 }
10425 }
10429 {
10434 capture_id);
10438 "capture of %qD redundant with by-reference capture "
10440 }
10443 capture_id,
10444 capture_init_expr,
10446 explicit_init_p);
10448 /* If there is any qualification still in effect, clear it
10449 now; we will be starting fresh with the next capture. */
10453 }
10456 }
10458 /* Parse the (optional) middle of a lambda expression.
10460 lambda-declarator:
10461 < template-parameter-list [opt] >
10462 ( parameter-declaration-clause [opt] )
10463 attribute-specifier [opt]
10464 decl-specifier-seq [opt]
10465 exception-specification [opt]
10466 lambda-return-type-clause [opt]
10468 LAMBDA_EXPR is the current representation of the lambda expression. */
10470 static bool
10472 {
10473 /* 5.1.1.4 of the standard says:
10474 If a lambda-expression does not include a lambda-declarator, it is as if
10475 the lambda-declarator were ().
10476 This means an empty parameter list, no attributes, and no exception
10477 specification. */
10484 cp_decl_specifier_seq lambda_specs;
10487 /* The template-parameter-list is optional, but must begin with
10488 an opening angle if present. */
10490 {
10493 "lambda templates are only available with "
10497 "lambda templates are only available with "
10506 /* We just processed one more parameter list. */
10508 }
10510 /* The parameter-declaration-clause is optional (unless
10511 template-parameter-list was given), but must begin with an
10512 opening parenthesis if present. */
10514 {
10515 matching_parens parens;
10520 /* Parse parameters. */
10523 /* Default arguments shall not be specified in the
10524 parameter-declaration-clause of a lambda-declarator. */
10535 /* In the decl-specifier-seq of the lambda-declarator, each
10536 decl-specifier shall either be mutable or constexpr. */
10540 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10543 {
10548 }
10552 /* Parse optional exception specification. */
10555 /* Parse optional trailing return type. */
10557 {
10560 }
10562 /* The function parameters must be in scope all the way until after the
10563 trailing-return-type in case of decltype. */
10565 }
10569 /* Create the function call operator.
10571 Messing with declarators like this is no uglier than building up the
10572 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10573 other code. */
10574 {
10575 cp_decl_specifier_seq return_type_specs;
10577 tree fco;
10584 else
10585 /* Maybe we will deduce the return type later. */
10589 {
10593 else
10596 }
10605 VIRT_SPEC_UNSPECIFIED,
10606 REF_QUAL_NONE,
10607 tx_qual,
10608 exception_spec,
10614 declarator,
10615 attributes);
10617 {
10620 /* Give the object parameter a different name. */
10624 }
10626 {
10630 }
10639 }
10640 }
10642 /* Parse the body of a lambda expression, which is simply
10644 compound-statement
10646 but which requires special handling.
10647 LAMBDA_EXPR is the current representation of the lambda expression. */
10649 static void
10651 {
10658 else
10659 /* Still increment function_depth so that we don't GC in the
10660 middle of an expression. */
10665 /* Clear this in case we're in the middle of a default argument. */
10669 {
10673 matching_braces braces;
10676 {
10679 /* Originally C++11 required us to peek for 'return expr'; and
10680 process it specially here to deduce the return type. N3638
10681 removed the need for that. */
10689 }
10692 }
10699 else
10701 }
10703 /* Statements [gram.stmt.stmt] */
10705 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10707 static void
10709 {
10713 /* A concept is never expanded normally. */
10719 }
10721 /* Parse a statement.
10723 statement:
10724 labeled-statement
10725 expression-statement
10726 compound-statement
10727 selection-statement
10728 iteration-statement
10729 jump-statement
10730 declaration-statement
10731 try-block
10733 C++11:
10735 statement:
10736 labeled-statement
10737 attribute-specifier-seq (opt) expression-statement
10738 attribute-specifier-seq (opt) compound-statement
10739 attribute-specifier-seq (opt) selection-statement
10740 attribute-specifier-seq (opt) iteration-statement
10741 attribute-specifier-seq (opt) jump-statement
10742 declaration-statement
10743 attribute-specifier-seq (opt) try-block
10745 init-statement:
10746 expression-statement
10747 simple-declaration
10749 TM Extension:
10751 statement:
10752 atomic-statement
10754 IN_COMPOUND is true when the statement is nested inside a
10755 cp_parser_compound_statement; this matters for certain pragmas.
10757 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10758 is a (possibly labeled) if statement which is not enclosed in braces
10759 and has an else clause. This is used to implement -Wparentheses.
10761 CHAIN is a vector of if-else-if conditions. */
10763 static void
10767 {
10772 restart:
10775 /* There is no statement yet. */
10781 /* In obj-c++, seeing '[[' might be the either the beginning of
10782 c++11 attributes, or a nested objc-message-expression. So
10783 let's parse the c++11 attributes tentatively. */
10787 {
10790 }
10792 /* Peek at the next token. */
10794 /* Remember the location of the first token in the statement. */
10797 /* If this is a keyword, then that will often determine what kind of
10798 statement we have. */
10800 {
10804 {
10807 /* Looks like a labeled-statement with a case label.
10808 Parse the label, and then use tail recursion to parse
10809 the statement. */
10832 /* Objective-C++ exception-handling constructs. */
10846 /* This must be a namespace alias definition. */
10862 /* It might be a keyword like `int' that can start a
10863 declaration-statement. */
10865 }
10866 }
10868 {
10869 /* If the next token is a `:', then we are looking at a
10870 labeled-statement. */
10873 {
10874 /* Looks like a labeled-statement with an ordinary label.
10875 Parse the label, and then use tail recursion to parse
10876 the statement. */
10881 }
10882 }
10883 /* Anything that starts with a `{' must be a compound-statement. */
10886 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10887 a statement all its own. */
10889 {
10890 /* Only certain OpenMP pragmas are attached to statements, and thus
10891 are considered statements themselves. All others are not. In
10892 the context of a compound, accept the pragma as a "statement" and
10893 return so that we can check for a close brace. Otherwise we
10894 require a real statement and must go back and read one. */
10900 }
10902 {
10905 }
10907 /* Everything else must be a declaration-statement or an
10908 expression-statement. Try for the declaration-statement
10909 first, unless we are looking at a `;', in which case we know that
10910 we have an expression-statement. */
10912 {
10914 {
10916 {
10917 /* Attributes should be parsed as part of the the
10918 declaration, so let's un-parse them. */
10921 }
10924 /* Try to parse the declaration-statement. */
10926 /* If that worked, we're done. */
10929 }
10930 /* All preceding labels have been parsed at this point. */
10934 /* Look for an expression-statement instead. */
10937 /* Handle [[fallthrough]];. */
10939 {
10940 /* The next token after the fallthrough attribute is ';'. */
10942 {
10943 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10945 IFN_FALLTHROUGH,
10948 }
10949 else
10953 }
10954 }
10956 /* Set the line number for the statement. */
10960 /* Allow "[[fallthrough]];", but warn otherwise. */
10963 OPT_Wattributes,
10965 }
10967 /* Append ATTR to attribute list ATTRS. */
10969 static tree
10971 {
10977 }
10979 /* Parse the label for a labeled-statement, i.e.
10981 identifier :
10982 case constant-expression :
10983 default :
10985 GNU Extension:
10986 case constant-expression ... constant-expression : statement
10988 When a label is parsed without errors, the label is added to the
10989 parse tree by the finish_* functions, so this function doesn't
10990 have to return the label. */
10992 static void
10994 {
10999 /* The next token should be an identifier. */
11003 {
11006 }
11008 /* Remember whether this case or a user-defined label is allowed to fall
11009 through to. */
11014 {
11016 {
11020 /* Consume the `case' token. */
11022 /* Parse the constant-expression. */
11029 {
11030 /* Consume the `...' token. */
11036 /* We don't need to emit warnings here, as the common code
11037 will do this for us. */
11038 }
11039 else
11043 {
11047 }
11048 else
11051 expr);
11052 }
11056 /* Consume the `default' token. */
11060 {
11064 }
11065 else
11070 /* Anything else must be an ordinary label. */
11075 }
11077 /* Require the `:' token. */
11080 /* An ordinary label may optionally be followed by attributes.
11081 However, this is only permitted if the attributes are then
11082 followed by a semicolon. This is because, for backward
11083 compatibility, when parsing
11084 lab: __attribute__ ((unused)) int i;
11085 we want the attribute to attach to "i", not "lab". */
11088 {
11089 tree attrs;
11096 ;
11097 else
11099 }
11105 }
11107 /* Parse an expression-statement.
11109 expression-statement:
11110 expression [opt] ;
11112 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11113 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11114 indicates whether this expression-statement is part of an
11115 expression statement. */
11117 static tree
11119 {
11124 /* There might be attribute fallthrough. */
11127 /* If the next token is a ';', then there is no expression
11128 statement. */
11130 {
11134 {
11137 }
11138 }
11140 /* Handle [[fallthrough]];. */
11142 {
11143 /* The next token after the fallthrough attribute is ';'. */
11145 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11148 else
11152 }
11154 /* Allow "[[fallthrough]];", but warn otherwise. */
11159 /* Give a helpful message for "A<T>::type t;" and the like. */
11162 {
11169 {
11170 /* A::A a; */
11175 }
11176 }
11178 /* Consume the final `;'. */
11183 /* This is the final expression statement of a statement
11184 expression. */
11190 }
11192 /* Parse a compound-statement.
11194 compound-statement:
11195 { statement-seq [opt] }
11197 GNU extension:
11199 compound-statement:
11200 { label-declaration-seq [opt] statement-seq [opt] }
11202 label-declaration-seq:
11203 label-declaration
11204 label-declaration-seq label-declaration
11206 Returns a tree representing the statement. */
11208 static tree
11211 {
11212 tree compound_stmt;
11213 matching_braces braces;
11215 /* Consume the `{'. */
11222 /* Begin the compound-statement. */
11224 /* If the next keyword is `__label__' we have a label declaration. */
11227 /* Parse an (optional) statement-seq. */
11229 /* Finish the compound-statement. */
11231 /* Consume the `}'. */
11235 }
11237 /* Parse an (optional) statement-seq.
11239 statement-seq:
11240 statement
11241 statement-seq [opt] statement */
11243 static void
11245 {
11246 /* Scan statements until there aren't any more. */
11248 {
11251 /* If we are looking at a `}', then we have run out of
11252 statements; the same is true if we have reached the end
11253 of file, or have stumbled upon a stray '@end'. */
11260 /* If we are in a compound statement and find 'else' then
11261 something went wrong. */
11263 {
11266 else
11267 {
11270 }
11271 }
11273 /* Parse the statement. */
11275 }
11276 }
11278 /* Return true if we're looking at (init; cond), false otherwise. */
11280 static bool
11282 {
11283 /* Save tokens so that we can put them back. */
11286 /* Look for ';' that is not nested in () or {}. */
11289 CPP_SEMICOLON,
11292 /* Roll back the tokens we skipped. */
11296 }
11298 /* Parse a selection-statement.
11300 selection-statement:
11301 if ( init-statement [opt] condition ) statement
11302 if ( init-statement [opt] condition ) statement else statement
11303 switch ( init-statement [opt] condition ) statement
11305 Returns the new IF_STMT or SWITCH_STMT.
11307 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11308 is a (possibly labeled) if statement which is not enclosed in
11309 braces and has an else clause. This is used to implement
11310 -Wparentheses.
11312 CHAIN is a vector of if-else-if conditions. This is used to implement
11313 -Wduplicated-cond. */
11315 static tree
11318 {
11321 token_indent_info guard_tinfo;
11326 /* Peek at the next token. */
11330 /* See what kind of keyword it is. */
11333 {
11336 {
11337 tree statement;
11338 tree condition;
11343 RID_CONSTEXPR))
11344 {
11350 }
11352 /* Look for the `('. */
11353 matching_parens parens;
11355 {
11358 }
11360 /* Begin the selection-statement. */
11362 {
11365 }
11366 else
11369 /* Parse the optional init-statement. */
11371 {
11372 tree decl;
11375 "init-statement in selection statements only available "
11378 }
11380 /* Parse the condition. */
11382 /* Look for the `)'. */
11388 {
11392 /* Add the condition. */
11399 /* Parse the then-clause. */
11403 /* Outside a template, the non-selected branch of a constexpr
11404 if is a 'discarded statement', i.e. unevaluated. */
11409 {
11412 }
11415 guard_tinfo);
11422 {
11426 }
11428 /* If the next token is `else', parse the else-clause. */
11430 RID_ELSE))
11431 {
11435 {
11438 }
11440 guard_tinfo
11442 /* Consume the `else' keyword. */
11445 {
11447 RID_IF)
11449 {
11450 /* We've got "if (COND) else if (COND2)". Start
11451 the condition chain and add COND as the first
11452 element. */
11456 {
11457 /* Wrap it in a NOP_EXPR so that we can set the
11458 location of the condition. */
11460 condition);
11463 }
11464 }
11466 RID_IF))
11467 {
11468 /* This is if-else without subsequent if. Zap the
11469 condition chain; we would have already warned at
11470 this point. */
11473 }
11474 }
11476 /* Parse the else-clause. */
11482 /* If we are currently parsing a then-clause, then
11483 IF_P will not be NULL. We set it to true to
11484 indicate that this if statement has an else clause.
11485 This may trigger the Wparentheses warning below
11486 when we get back up to the parent if statement. */
11491 {
11495 }
11496 }
11497 else
11498 {
11499 /* This if statement does not have an else clause. If
11500 NESTED_IF is true, then the then-clause has an if
11501 statement which does have an else clause. We warn
11502 about the potential ambiguity. */
11505 "suggest explicit braces to avoid ambiguous"
11508 {
11509 /* We don't need the condition chain anymore. */
11512 }
11513 }
11515 /* Now we're all done with the if-statement. */
11517 }
11518 else
11519 {
11523 /* Add the condition. */
11526 /* Parse the body of the switch-statement. */
11532 guard_tinfo);
11536 /* Now we're all done with the switch-statement. */
11538 }
11541 }
11547 }
11548 }
11550 /* Parse a condition.
11552 condition:
11553 expression
11554 type-specifier-seq declarator = initializer-clause
11555 type-specifier-seq declarator braced-init-list
11557 GNU Extension:
11559 condition:
11560 type-specifier-seq declarator asm-specification [opt]
11561 attributes [opt] = assignment-expression
11563 Returns the expression that should be tested. */
11565 static tree
11567 {
11568 cp_decl_specifier_seq type_specifiers;
11572 /* Try the declaration first. */
11574 /* New types are not allowed in the type-specifier-seq for a
11575 condition. */
11577 parser->type_definition_forbidden_message
11579 /* Parse the type-specifier-seq. */
11581 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11584 /* Restore the saved message. */
11586 /* If all is well, we might be looking at a declaration. */
11588 {
11589 tree decl;
11590 tree asm_specification;
11591 tree attributes;
11595 /* Parse the declarator. */
11601 /* Parse the attributes. */
11603 /* Parse the asm-specification. */
11605 /* If the next token is not an `=' or '{', then we might still be
11606 looking at an expression. For example:
11608 if (A(a).x)
11610 looks like a decl-specifier-seq and a declarator -- but then
11611 there is no `=', so this is an expression. */
11616 /* If we did see an `=' or '{', then we are looking at a declaration
11617 for sure. */
11619 {
11620 tree pushed_scope;
11624 /* Create the declaration. */
11630 /* Parse the initializer. */
11632 {
11636 }
11637 else
11638 {
11639 /* Consume the `='. */
11642 }
11646 /* Process the initializer. */
11649 asm_specification,
11650 flags);
11656 }
11657 }
11658 /* If we didn't even get past the declarator successfully, we are
11659 definitely not looking at a declaration. */
11660 else
11663 /* Otherwise, we are looking at an expression. */
11665 }
11667 /* Parses a for-statement or range-for-statement until the closing ')',
11668 not included. */
11670 static tree
11672 {
11676 /* Begin the for-statement. */
11679 /* Parse the initialization. */
11684 else
11686 }
11688 static tree
11691 {
11692 /* Normal for loop */
11695 tree stmt;
11698 /* The init-statement has already been parsed in
11699 cp_parser_init_statement, so no work is needed here. */
11702 /* If there's a condition, process it. */
11706 {
11710 }
11712 {
11716 }
11718 /* Look for the `;'. */
11721 /* If there's an expression, process it. */
11727 }
11729 /* Tries to parse a range-based for-statement:
11731 range-based-for:
11732 decl-specifier-seq declarator : expression
11734 The decl-specifier-seq declarator and the `:' are already parsed by
11735 cp_parser_init_statement. If processing_template_decl it returns a
11736 newly created RANGE_FOR_STMT; if not, it is converted to a
11737 regular FOR_STMT. */
11739 static tree
11742 {
11749 /* Get the range declaration momentarily out of the way so that
11750 the range expression doesn't clash with it. */
11752 {
11754 {
11756 /* For decomposition declaration get all of the corresponding
11757 declarations out of the way. */
11761 {
11767 {
11773 }
11774 }
11775 }
11777 {
11782 }
11783 }
11786 {
11789 }
11790 else
11793 /* Put the range declaration(s) back into scope. */
11795 {
11799 }
11801 /* If in template, STMT is converted to a normal for-statement
11802 at instantiation. If not, it is done just ahead. */
11804 {
11814 /* do_auto_deduction doesn't mess with template init-lists. */
11817 }
11818 else
11819 {
11823 unroll);
11824 }
11826 }
11828 /* Subroutine of cp_convert_range_for: given the initializer expression,
11829 builds up the range temporary. */
11831 static tree
11833 {
11836 /* Find out the type deduced by the declaration
11837 `auto &&__range = range_expr'. */
11842 /* Create the __range variable. */
11849 }
11851 /* Used by cp_parser_range_for in template context: we aren't going to
11852 do a full conversion yet, but we still need to resolve auto in the
11853 type of the for-range-declaration if present. This is basically
11854 a shortcut version of cp_convert_range_for. */
11856 static void
11858 {
11861 {
11864 iter_type = (cp_parser_perform_range_for_lookup
11867 {
11869 iter_type);
11871 RO_UNARY_STAR,
11872 tf_warning_or_error);
11875 }
11876 }
11877 }
11879 /* Converts a range-based for-statement into a normal
11880 for-statement, as per the definition.
11882 for (RANGE_DECL : RANGE_EXPR)
11883 BLOCK
11885 should be equivalent to:
11887 {
11888 auto &&__range = RANGE_EXPR;
11889 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11890 __begin != __end;
11891 ++__begin)
11892 {
11893 RANGE_DECL = *__begin;
11894 BLOCK
11895 }
11896 }
11898 If RANGE_EXPR is an array:
11899 BEGIN_EXPR = __range
11900 END_EXPR = __range + ARRAY_SIZE(__range)
11901 Else if RANGE_EXPR has a member 'begin' or 'end':
11902 BEGIN_EXPR = __range.begin()
11903 END_EXPR = __range.end()
11904 Else:
11905 BEGIN_EXPR = begin(__range)
11906 END_EXPR = end(__range);
11908 If __range has a member 'begin' but not 'end', or vice versa, we must
11909 still use the second alternative (it will surely fail, however).
11910 When calling begin()/end() in the third alternative we must use
11911 argument dependent lookup, but always considering 'std' as an associated
11912 namespace. */
11914 tree
11918 {
11926 /* If an error happened previously do nothing or else a lot of
11927 unhelpful errors would be issued. */
11929 else
11930 {
11931 tree range_temp;
11935 /* Can't bind a reference to an array of runtime bound. */
11937 else
11938 {
11943 LOOKUP_ONLYCONVERTING);
11945 }
11948 }
11950 /* The new for initialization statement. */
11958 LOOKUP_ONLYCONVERTING);
11969 LOOKUP_ONLYCONVERTING);
11973 /* The new for condition. */
11980 /* The new increment expression. */
11983 tf_warning_or_error);
11989 /* The declaration is initialized with *__begin inside the loop body. */
11992 tf_warning_or_error),
11994 LOOKUP_ONLYCONVERTING);
11999 }
12001 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12002 We need to solve both at the same time because the method used
12003 depends on the existence of members begin or end.
12004 Returns the type deduced for the iterator expression. */
12006 static tree
12008 {
12010 {
12013 }
12016 {
12021 }
12023 {
12024 /* If RANGE is an array, we will use pointer arithmetic. */
12027 range,
12031 }
12032 else
12033 {
12034 /* If it is not an array, we must do a bit of magic. */
12044 tf_warning_or_error);
12047 tf_warning_or_error);
12050 {
12051 /* Use the member functions. */
12054 else
12060 else
12063 }
12064 else
12065 {
12066 /* Use global functions with ADL. */
12073 tf_warning_or_error);
12075 tf_warning_or_error);
12077 tf_warning_or_error);
12079 tf_warning_or_error);
12082 }
12084 /* Last common checks. */
12086 {
12087 /* If one of the expressions is an error do no more checks. */
12090 }
12093 /* Can happen, when, eg, in a template context, Koenig lookup
12094 can't resolve begin/end (c++/58503). */
12096 else
12097 {
12099 /* The unqualified type of the __begin and __end temporaries should
12100 be the same, as required by the multiple auto declaration. */
12102 {
12109 /* P0184R0 allows __begin and __end to have different types,
12110 but make sure they are comparable so we can give a better
12112 else
12116 }
12118 }
12119 }
12120 }
12122 /* Helper function for cp_parser_perform_range_for_lookup.
12123 Builds a tree for RANGE.IDENTIFIER(). */
12125 static tree
12127 {
12140 tf_warning_or_error);
12143 }
12145 /* Parse an iteration-statement.
12147 iteration-statement:
12148 while ( condition ) statement
12149 do statement while ( expression ) ;
12150 for ( init-statement condition [opt] ; expression [opt] )
12151 statement
12153 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12155 static tree
12158 {
12161 tree statement;
12163 token_indent_info guard_tinfo;
12165 /* Peek at the next token. */
12172 /* Remember whether or not we are already within an iteration
12173 statement. */
12176 /* See what kind of keyword it is. */
12179 {
12181 {
12182 tree condition;
12184 /* Begin the while-statement. */
12186 /* Look for the `('. */
12187 matching_parens parens;
12189 /* Parse the condition. */
12192 /* Look for the `)'. */
12194 /* Parse the dependent statement. */
12200 /* We're done with the while-statement. */
12202 }
12206 {
12207 tree expression;
12209 /* Begin the do-statement. */
12211 /* Parse the body of the do-statement. */
12218 /* Look for the `while' keyword. */
12220 /* Look for the `('. */
12221 matching_parens parens;
12223 /* Parse the expression. */
12225 /* We're done with the do-statement. */
12227 /* Look for the `)'. */
12229 /* Look for the `;'. */
12231 }
12235 {
12236 /* Look for the `('. */
12237 matching_parens parens;
12242 /* Look for the `)'. */
12245 /* Parse the body of the for-statement. */
12252 /* We're done with the for-statement. */
12254 }
12261 }
12264 }
12266 /* Parse a init-statement or the declarator of a range-based-for.
12267 Returns true if a range-based-for declaration is seen.
12269 init-statement:
12270 expression-statement
12271 simple-declaration */
12273 static bool
12275 {
12276 /* If the next token is a `;', then we have an empty
12277 expression-statement. Grammatically, this is also a
12278 simple-declaration, but an invalid one, because it does not
12279 declare anything. Therefore, if we did not handle this case
12280 specially, we would issue an error message about an invalid
12281 declaration. */
12283 {
12287 /* A colon is used in range-based for. */
12290 /* We're going to speculatively look for a declaration, falling back
12291 to an expression, if necessary. */
12293 /* Parse the declaration. */
12296 decl);
12299 {
12300 /* It is a range-for, consume the ':' */
12304 {
12306 "range-based %<for%> loops only available with "
12309 }
12310 }
12311 else
12312 /* The ';' is not consumed yet because we told
12313 cp_parser_simple_declaration not to. */
12318 /* If the tentative parse failed, then we shall need to look for an
12319 expression-statement. */
12320 }
12321 /* If we are here, it is an expression-statement. */
12324 }
12326 /* Parse a jump-statement.
12328 jump-statement:
12329 break ;
12330 continue ;
12331 return expression [opt] ;
12332 return braced-init-list ;
12333 goto identifier ;
12335 GNU extension:
12337 jump-statement:
12338 goto * expression ;
12340 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12342 static tree
12344 {
12350 /* Peek at the next token. */
12355 /* See what kind of keyword it is. */
12358 {
12362 {
12379 }
12385 {
12389 /* Fall through. */
12399 }
12404 {
12405 tree expr;
12409 {
12413 }
12416 else
12417 /* If the next token is a `;', then there is no
12418 expression. */
12420 /* Build the return-statement. */
12423 else
12425 /* Look for the final `;'. */
12427 }
12433 {
12436 }
12438 /* Create the goto-statement. */
12440 {
12441 /* Issue a warning about this use of a GNU extension. */
12443 /* Consume the '*' token. */
12445 /* Parse the dependent expression. */
12447 }
12448 else
12450 /* Look for the final `;'. */
12457 }
12460 }
12462 /* Parse a declaration-statement.
12464 declaration-statement:
12465 block-declaration */
12467 static void
12469 {
12472 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12475 /* Parse the block-declaration. */
12478 /* Free any declarators allocated. */
12480 }
12482 /* Some dependent statements (like `if (cond) statement'), are
12483 implicitly in their own scope. In other words, if the statement is
12484 a single statement (as opposed to a compound-statement), it is
12485 none-the-less treated as if it were enclosed in braces. Any
12486 declarations appearing in the dependent statement are out of scope
12487 after control passes that point. This function parses a statement,
12488 but ensures that is in its own scope, even if it is not a
12489 compound-statement.
12491 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12492 is a (possibly labeled) if statement which is not enclosed in
12493 braces and has an else clause. This is used to implement
12494 -Wparentheses.
12496 CHAIN is a vector of if-else-if conditions. This is used to implement
12497 -Wduplicated-cond.
12499 Returns the new statement. */
12501 static tree
12505 {
12506 tree statement;
12509 token_indent_info body_tinfo
12515 /* Mark if () ; with a special NOP_EXPR. */
12517 {
12528 }
12529 /* if a compound is opened, we simply parse the statement directly. */
12532 /* If the token is not a `{', then we must take special action. */
12533 else
12534 {
12535 /* Create a compound-statement. */
12537 /* Parse the dependent-statement. */
12540 /* Finish the dummy compound-statement. */
12542 }
12544 token_indent_info next_tinfo
12553 /* Return the statement. */
12555 }
12557 /* For some dependent statements (like `while (cond) statement'), we
12558 have already created a scope. Therefore, even if the dependent
12559 statement is a compound-statement, we do not want to create another
12560 scope. */
12562 static void
12565 {
12566 /* If the token is a `{', then we must take special action. */
12568 {
12569 token_indent_info body_tinfo
12575 token_indent_info next_tinfo
12584 }
12585 else
12586 {
12587 /* Avoid calling cp_parser_compound_statement, so that we
12588 don't create a new scope. Do everything else by hand. */
12589 matching_braces braces;
12591 /* If the next keyword is `__label__' we have a label declaration. */
12594 /* Parse an (optional) statement-seq. */
12597 }
12598 }
12600 /* Declarations [gram.dcl.dcl] */
12602 /* Parse an optional declaration-sequence.
12604 declaration-seq:
12605 declaration
12606 declaration-seq declaration */
12608 static void
12610 {
12612 {
12623 {
12624 /* A declaration consisting of a single semicolon is
12625 invalid. Allow it unless we're being pedantic. */
12630 }
12632 /* If we're entering or exiting a region that's implicitly
12633 extern "C", modify the lang context appropriately. */
12635 {
12638 }
12640 {
12643 }
12646 {
12647 /* A top-level declaration can consist solely of a #pragma.
12648 A nested declaration cannot, so this is done here and not
12649 in cp_parser_declaration. (A #pragma at block scope is
12650 handled in cp_parser_statement.) */
12653 }
12655 /* Parse the declaration itself. */
12657 }
12658 }
12660 /* Parse a declaration.
12662 declaration:
12663 block-declaration
12664 function-definition
12665 template-declaration
12666 explicit-instantiation
12667 explicit-specialization
12668 linkage-specification
12669 namespace-definition
12671 C++17:
12672 deduction-guide
12674 GNU extension:
12676 declaration:
12677 __extension__ declaration */
12679 static void
12681 {
12682 cp_token token1;
12683 cp_token token2;
12688 /* Check for the `__extension__' keyword. */
12690 {
12691 /* Parse the qualified declaration. */
12693 /* Restore the PEDANTIC flag. */
12697 }
12699 /* Try to figure out what kind of declaration is present. */
12704 else
12705 {
12708 }
12710 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12713 /* If the next token is `extern' and the following token is a string
12714 literal, then we have a linkage specification. */
12718 /* If the next token is `template', then we have either a template
12719 declaration, an explicit instantiation, or an explicit
12720 specialization. */
12722 {
12723 /* `template <>' indicates a template specialization. */
12727 /* `template <' indicates a template declaration. */
12730 /* Anything else must be an explicit instantiation. */
12731 else
12733 }
12734 /* If the next token is `export', then we have a template
12735 declaration. */
12738 /* If the next token is `extern', 'static' or 'inline' and the one
12739 after that is `template', we have a GNU extended explicit
12740 instantiation directive. */
12747 /* If the next token is `namespace', check for a named or unnamed
12748 namespace definition. */
12757 /* An unnamed namespace definition. */
12761 /* An inline (associated) namespace definition. */
12765 /* Objective-C++ declaration/definition. */
12772 /* At this point we may have a template declared by a concept
12773 introduction. */
12778 else
12779 /* Try to parse a block-declaration, or a function-definition. */
12782 /* Free any declarators allocated. */
12784 }
12786 /* Parse a block-declaration.
12788 block-declaration:
12789 simple-declaration
12790 asm-definition
12791 namespace-alias-definition
12792 using-declaration
12793 using-directive
12795 GNU Extension:
12797 block-declaration:
12798 __extension__ block-declaration
12800 C++0x Extension:
12802 block-declaration:
12803 static_assert-declaration
12805 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12806 part of a declaration-statement. */
12808 static void
12811 {
12815 /* Check for the `__extension__' keyword. */
12817 {
12818 /* Parse the qualified declaration. */
12820 /* Restore the PEDANTIC flag. */
12824 }
12826 /* Peek at the next token to figure out which kind of declaration is
12827 present. */
12830 /* If the next keyword is `asm', we have an asm-definition. */
12832 {
12836 }
12837 /* If the next keyword is `namespace', we have a
12838 namespace-alias-definition. */
12841 /* If the next keyword is `using', we have a
12842 using-declaration, a using-directive, or an alias-declaration. */
12844 {
12849 /* If the token after `using' is `namespace', then we have a
12850 using-directive. */
12854 /* If the second token after 'using' is '=', then we have an
12855 alias-declaration. */
12861 /* Otherwise, it's a using-declaration. */
12862 else
12865 }
12866 /* If the next keyword is `__label__' we have a misplaced label
12867 declaration. */
12869 {
12873 /* If the next token is now a `;', consume it. */
12876 }
12877 /* If the next token is `static_assert' we have a static assertion. */
12880 /* Anything else must be a simple-declaration. */
12881 else
12884 }
12886 /* Parse a simple-declaration.
12888 simple-declaration:
12889 decl-specifier-seq [opt] init-declarator-list [opt] ;
12890 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12891 brace-or-equal-initializer ;
12893 init-declarator-list:
12894 init-declarator
12895 init-declarator-list , init-declarator
12897 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12898 function-definition as a simple-declaration.
12900 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12901 parsed declaration if it is an uninitialized single declarator not followed
12902 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12903 if present, will not be consumed. */
12905 static void
12909 {
12910 cp_decl_specifier_seq decl_specifiers;
12919 /* Defer access checks until we know what is being declared; the
12920 checks for names appearing in the decl-specifier-seq should be
12921 done as if we were in the scope of the thing being declared. */
12924 /* Parse the decl-specifier-seq. We have to keep track of whether
12925 or not the decl-specifier-seq declares a named class or
12926 enumeration type, since that is the only case in which the
12927 init-declarator-list is allowed to be empty.
12929 [dcl.dcl]
12931 In a simple-declaration, the optional init-declarator-list can be
12932 omitted only when declaring a class or enumeration, that is when
12933 the decl-specifier-seq contains either a class-specifier, an
12934 elaborated-type-specifier, or an enum-specifier. */
12936 CP_PARSER_FLAGS_OPTIONAL,
12939 /* We no longer need to defer access checks. */
12942 /* In a block scope, a valid declaration must always have a
12943 decl-specifier-seq. By not trying to parse declarators, we can
12944 resolve the declaration/expression ambiguity more quickly. */
12947 {
12950 }
12952 /* If the next two tokens are both identifiers, the code is
12953 erroneous. The usual cause of this situation is code like:
12955 T t;
12957 where "T" should name a type -- but does not. */
12960 {
12961 /* If parsing tentatively, we should commit; we really are
12962 looking at a declaration. */
12964 /* Give up. */
12966 }
12968 /* If we have seen at least one decl-specifier, and the next token
12969 is not a parenthesis, then we must be looking at a declaration.
12970 (After "int (" we might be looking at a functional cast.) */
12977 /* Look for C++17 decomposition declaration. */
12985 {
12986 tree decl
12988 maybe_range_for_decl,
12991 /* The next token should be either a `,' or a `;'. */
12993 /* If it's a `;', we are done. */
12996 /* Anything else is an error. */
12997 else
12998 {
12999 /* If we have already issued an error message we don't need
13000 to issue another one. */
13005 /* Skip tokens until we reach the end of the statement. */
13007 /* If the next token is now a `;', consume it. */
13011 }
13012 }
13013 else
13016 tree last_type;
13018 /* NULL_TREE if both variable and function declaration are allowed,
13019 error_mark_node if function declaration are not allowed and
13020 a FUNCTION_DECL that should be diagnosed if it is followed by
13021 variable declarations. */
13022 tree auto_function_declaration;
13025 auto_specifier_p
13029 /* Keep going until we hit the `;' at the end of the simple
13030 declaration. */
13033 CPP_SEMICOLON))
13034 {
13037 tree decl;
13041 {
13042 /* If we are processing next declarator, comma is expected */
13047 {
13051 }
13052 }
13053 else
13056 /* Parse the init-declarator. */
13059 function_definition_allowed_p,
13061 declares_class_or_enum,
13063 maybe_range_for_decl,
13066 /* If an error occurred while parsing tentatively, exit quickly.
13067 (That usually happens when in the body of a function; each
13068 statement is treated as a declaration-statement until proven
13069 otherwise.) */
13074 {
13075 /* If the init-declarator-list contains more than one
13076 init-declarator, they shall all form declarations of
13077 variables. */
13079 auto_function_declaration
13083 {
13085 "non-variable %qD in declaration with more than one "
13090 }
13091 }
13095 {
13099 {
13100 /* If the list of declarators contains more than one declarator,
13101 the type of each declared variable is determined as described
13102 above. If the type deduced for the template parameter U is not
13103 the same in each deduction, the program is ill-formed. */
13108 }
13109 else
13111 }
13113 /* Handle function definitions specially. */
13115 {
13116 /* If the next token is a `,', then we are probably
13117 processing something like:
13119 void f() {}, *p;
13121 which is erroneous. */
13123 {
13126 "mixing"
13128 }
13129 /* Otherwise, we're done with the list of declarators. */
13130 else
13131 {
13134 }
13135 }
13138 /* The next token should be either a `,' or a `;'. */
13140 /* If it's a `,', there are more declarators to come. */
13143 /* If it's a `;', we are done. */
13147 {
13152 }
13153 /* Anything else is an error. */
13154 else
13155 {
13156 /* If we have already issued an error message we don't need
13157 to issue another one. */
13162 /* Skip tokens until we reach the end of the statement. */
13164 /* If the next token is now a `;', consume it. */
13168 }
13169 /* After the first time around, a function-definition is not
13170 allowed -- even if it was OK at first. For example:
13172 int i, f() {}
13174 is not valid. */
13176 }
13178 /* Issue an error message if no declarators are present, and the
13179 decl-specifier-seq does not itself declare a class or
13180 enumeration: [dcl.dcl]/3. */
13182 {
13184 {
13188 /* Ensure an error is issued anyway when finish_decltype_type,
13189 called via cp_parser_decl_specifier_seq, returns a class or
13190 an enumeration (c++/51786). */
13193 }
13194 /* Perform any deferred access checks. */
13196 }
13198 /* Consume the `;'. */
13199 finish:
13203 {
13209 }
13211 done:
13213 }
13215 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13216 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13217 initializer ; */
13219 static tree
13224 {
13229 /* Parse the identifier-list. */
13233 {
13241 }
13245 {
13251 else
13252 {
13255 }
13256 }
13262 tree pushed_scope;
13269 NULL_TREE);
13276 cp_expr e;
13277 cp_decl_specifier_seq decl_specs;
13282 {
13285 else
13288 tree elt_pushed_scope;
13294 {
13295 /* Ensure we've diagnosed redeclaration if we aren't creating
13296 a new VAR_DECL. */
13299 }
13300 else
13304 }
13307 {
13310 }
13314 {
13322 || (is_direct_init
13325 {
13329 }
13332 {
13337 }
13338 }
13340 {
13342 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13343 the underlying DECL. */
13345 }
13351 {
13354 }
13357 }
13359 /* Parse a decl-specifier-seq.
13361 decl-specifier-seq:
13362 decl-specifier-seq [opt] decl-specifier
13363 decl-specifier attribute-specifier-seq [opt] (C++11)
13365 decl-specifier:
13366 storage-class-specifier
13367 type-specifier
13368 function-specifier
13369 friend
13370 typedef
13372 GNU Extension:
13374 decl-specifier:
13375 attributes
13377 Concepts Extension:
13379 decl-specifier:
13380 concept
13382 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13384 The parser flags FLAGS is used to control type-specifier parsing.
13386 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13387 flags:
13389 1: one of the decl-specifiers is an elaborated-type-specifier
13390 (i.e., a type declaration)
13391 2: one of the decl-specifiers is an enum-specifier or a
13392 class-specifier (i.e., a type definition)
13394 */
13396 static void
13398 cp_parser_flags flags,
13401 {
13405 cp_decl_spec ds;
13407 /* Clear DECL_SPECS. */
13410 /* Assume no class or enumeration type is declared. */
13413 /* Keep reading specifiers until there are no more to read. */
13415 {
13420 /* Peek at the next token. */
13423 /* Save the first token of the decl spec list for error
13424 reporting. */
13427 /* Handle attributes. */
13429 {
13430 /* Parse the attributes. */
13433 /* In a sequence of declaration specifiers, c++11 attributes
13434 appertain to the type that precede them. In that case
13435 [dcl.spec]/1 says:
13437 The attribute-specifier-seq affects the type only for
13438 the declaration it appears in, not other declarations
13439 involving the same type.
13441 But for now let's force the user to position the
13442 attribute either at the beginning of the declaration or
13443 after the declarator-id, which would clearly mean that it
13444 applies to the declarator. */
13446 {
13448 /* The c++11 attribute is at the beginning of the
13449 declaration. It appertains to the entity being
13451 else
13452 {
13454 {
13455 /* This is an attribute following a
13456 class-specifier. */
13461 }
13462 else
13463 {
13464 decl_specs->std_attributes
13468 }
13470 }
13471 }
13473 decl_specs->attributes
13478 }
13479 /* Assume we will find a decl-specifier keyword. */
13481 /* If the next token is an appropriate keyword, we can simply
13482 add it to the list. */
13484 {
13485 /* decl-specifier:
13486 friend
13487 constexpr */
13490 {
13495 }
13496 else
13497 {
13499 /* Consume the token. */
13501 }
13514 /* function-specifier:
13515 inline
13516 virtual
13517 explicit */
13524 /* decl-specifier:
13525 typedef */
13528 /* Consume the token. */
13530 /* A constructor declarator cannot appear in a typedef. */
13532 /* The "typedef" keyword can only occur in a declaration; we
13533 may as well commit at this point. */
13540 /* storage-class-specifier:
13541 auto
13542 register
13543 static
13544 extern
13545 mutable
13547 GNU Extension:
13548 thread */
13551 {
13552 /* Consume the token. */
13555 /* Complain about `auto' as a storage specifier, if
13556 we're complaining about C++0x compatibility. */
13560 "%<auto%> changes meaning in C++11; "
13563 /* Set the storage class anyway. */
13565 token);
13566 }
13567 else
13568 /* C++0x auto type-specifier. */
13576 /* Consume the token. */
13579 token);
13582 /* Consume the token. */
13588 /* We did not yet find a decl-specifier yet. */
13591 }
13608 /* Constructors are a special case. The `S' in `S()' is not a
13609 decl-specifier; it is the beginning of the declarator. */
13610 constructor_p
13611 = (!found_decl_spec
13612 && constructor_possible_p
13613 && (cp_parser_constructor_declarator_p
13616 /* If we don't have a DECL_SPEC yet, then we must be looking at
13617 a type-specifier. */
13619 {
13622 tree type_spec;
13624 type_spec
13626 decl_specs,
13632 /* If this type-specifier referenced a user-defined type
13633 (a typedef, class-name, etc.), then we can't allow any
13634 more such type-specifiers henceforth.
13636 [dcl.spec]
13638 The longest sequence of decl-specifiers that could
13639 possibly be a type name is taken as the
13640 decl-specifier-seq of a declaration. The sequence shall
13641 be self-consistent as described below.
13643 [dcl.type]
13645 As a general rule, at most one type-specifier is allowed
13646 in the complete decl-specifier-seq of a declaration. The
13647 only exceptions are the following:
13649 -- const or volatile can be combined with any other
13650 type-specifier.
13652 -- signed or unsigned can be combined with char, long,
13653 short, or int.
13655 -- ..
13657 Example:
13659 typedef char* Pc;
13660 void g (const int Pc);
13662 Here, Pc is *not* part of the decl-specifier seq; it's
13663 the declarator. Therefore, once we see a type-specifier
13664 (other than a cv-qualifier), we forbid any additional
13665 user-defined types. We *do* still allow things like `int
13666 int' to be considered a decl-specifier-seq, and issue the
13667 error message later. */
13670 /* A constructor declarator cannot follow a type-specifier. */
13672 {
13677 }
13678 }
13680 /* If we still do not have a DECL_SPEC, then there are no more
13681 decl-specifiers. */
13686 /* After we see one decl-specifier, further decl-specifiers are
13687 always optional. */
13689 }
13691 /* Don't allow a friend specifier with a class definition. */
13696 }
13698 /* Parse an (optional) storage-class-specifier.
13700 storage-class-specifier:
13701 auto
13702 register
13703 static
13704 extern
13705 mutable
13707 GNU Extension:
13709 storage-class-specifier:
13710 thread
13712 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13714 static tree
13716 {
13718 {
13722 /* Fall through for C++98. */
13730 /* Consume the token. */
13735 }
13736 }
13738 /* Parse an (optional) function-specifier.
13740 function-specifier:
13741 inline
13742 virtual
13743 explicit
13745 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13746 Updates DECL_SPECS, if it is non-NULL. */
13748 static tree
13751 {
13754 {
13760 /* 14.5.2.3 [temp.mem]
13762 A member function template shall not be virtual. */
13766 else
13776 }
13778 /* Consume the token. */
13780 }
13782 /* Parse a linkage-specification.
13784 linkage-specification:
13785 extern string-literal { declaration-seq [opt] }
13786 extern string-literal declaration */
13788 static void
13790 {
13791 tree linkage;
13793 /* Look for the `extern' keyword. */
13794 cp_token *extern_token
13797 /* Look for the string-literal. */
13801 /* Transform the literal into an identifier. If the literal is a
13802 wide-character string, or contains embedded NULs, then we can't
13803 handle it as the user wants. */
13806 {
13808 /* Assume C++ linkage. */
13810 }
13811 else
13814 /* We're now using the new linkage. */
13817 /* Preserve the location of the the innermost linkage specification,
13818 tracking the locations of nested specifications via a local. */
13819 location_t saved_location
13821 /* Construct a location ranging from the start of the "extern" to
13822 the end of the string-literal, with the caret at the start, e.g.:
13823 extern "C" {
13824 ^~~~~~~~~~
13825 */
13826 parser->innermost_linkage_specification_location
13831 /* If the next token is a `{', then we're using the first
13832 production. */
13834 {
13838 /* Consume the `{' token. */
13839 matching_braces braces;
13841 /* Parse the declarations. */
13843 /* Look for the closing `}'. */
13845 }
13846 /* Otherwise, there's just one declaration. */
13847 else
13848 {
13851 saved_in_unbraced_linkage_specification_p
13855 parser->in_unbraced_linkage_specification_p
13857 }
13859 /* We're done with the linkage-specification. */
13862 /* Restore location of parent linkage specification, if any. */
13864 }
13866 /* Parse a static_assert-declaration.
13868 static_assert-declaration:
13869 static_assert ( constant-expression , string-literal ) ;
13870 static_assert ( constant-expression ) ; (C++17)
13872 If MEMBER_P, this static_assert is a class member. */
13874 static void
13876 {
13877 cp_expr condition;
13878 location_t token_loc;
13879 tree message;
13882 /* Peek at the `static_assert' token so we can keep track of exactly
13883 where the static assertion started. */
13886 /* Look for the `static_assert' keyword. */
13888 RT_STATIC_ASSERT))
13891 /* We know we are in a static assertion; commit to any tentative
13892 parse. */
13896 /* Parse the `(' starting the static assertion condition. */
13897 matching_parens parens;
13900 /* Parse the constant-expression. Allow a non-constant expression
13901 here in order to give better diagnostics in finish_static_assert. */
13902 condition =
13908 {
13911 "static_assert without a message "
13913 /* Eat the ')' */
13918 }
13919 else
13920 {
13921 /* Parse the separating `,'. */
13924 /* Parse the string-literal message. */
13929 /* A `)' completes the static assertion. */
13935 }
13937 /* A semicolon terminates the declaration. */
13940 /* Get the location for the static assertion. Use that of the
13941 condition if available, otherwise, use that of the "static_assert"
13942 token. */
13947 /* Complete the static assertion, which may mean either processing
13948 the static assert now or saving it for template instantiation. */
13950 }
13952 /* Parse the expression in decltype ( expression ). */
13954 static tree
13957 {
13959 tree expr;
13961 /* Since we're going to preserve any side-effects from this parse, set up a
13962 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13963 in the expression. */
13966 /* First, try parsing an id-expression. */
13977 {
13980 cp_id_kind idk;
13984 /* Lookup the name we got back from the id-expression. */
13989 /* A template without args is not a complete id-expression. */
13998 {
13999 /* Complete lookup of the id-expression. */
14000 expr = (finish_id_expression
14013 /* We found an id-expression, but it was something that we
14014 should not have found. This is an error, not something
14015 we can recover from, so note that we found an
14016 id-expression and we'll recover as gracefully as
14017 possible. */
14019 }
14024 /* We have an id-expression. */
14026 }
14029 {
14030 /* Abort the id-expression parse. */
14033 /* Parsing tentatively, again. */
14036 /* Parse a class member access. */
14044 /* We have an id-expression. */
14046 }
14049 /* We have parsed the complete id-expression or member access. */
14051 else
14052 {
14053 /* Abort our attempt to parse an id-expression or member access
14054 expression. */
14057 /* Commit to the tentative_firewall so we get syntax errors. */
14060 /* Parse a full expression. */
14063 }
14066 }
14068 /* Parse a `decltype' type. Returns the type.
14070 simple-type-specifier:
14071 decltype ( expression )
14072 C++14 proposal:
14073 decltype ( auto ) */
14075 static tree
14077 {
14082 {
14083 /* Already parsed. */
14086 }
14088 /* Look for the `decltype' token. */
14092 /* Parse the opening `('. */
14093 matching_parens parens;
14103 /* decltype (auto) */
14105 else
14106 {
14107 /* decltype (expression) */
14109 /* Types cannot be defined in a `decltype' expression. Save away the
14110 old message and set the new one. */
14112 parser->type_definition_forbidden_message
14115 /* The restrictions on constant-expressions do not apply inside
14116 decltype expressions. */
14117 bool saved_integral_constant_expression_p
14119 bool saved_non_integral_constant_expression_p
14123 /* Within a parenthesized expression, a `>' token is always
14124 the greater-than operator. */
14125 bool saved_greater_than_is_operator_p
14129 /* Do not actually evaluate the expression. */
14132 /* Do not warn about problems with the expression. */
14137 /* Go back to evaluating expressions. */
14141 /* The `>' token might be the end of a template-id or
14142 template-parameter-list now. */
14143 parser->greater_than_is_operator_p
14146 /* Restore the old message and the integral constant expression
14147 flags. */
14149 parser->integral_constant_expression_p
14151 parser->non_integral_constant_expression_p
14153 }
14155 /* Parse to the closing `)'. */
14157 {
14162 }
14165 {
14166 /* Build auto. */
14169 }
14170 else
14172 tf_warning_or_error);
14174 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14175 it again. */
14186 }
14188 /* Special member functions [gram.special] */
14190 /* Parse a conversion-function-id.
14192 conversion-function-id:
14193 operator conversion-type-id
14195 Returns an IDENTIFIER_NODE representing the operator. */
14197 static tree
14199 {
14200 tree type;
14201 tree saved_scope;
14202 tree saved_qualifying_scope;
14203 tree saved_object_scope;
14206 /* Look for the `operator' token. */
14209 /* When we parse the conversion-type-id, the current scope will be
14210 reset. However, we need that information in able to look up the
14211 conversion function later, so we save it here. */
14215 /* We must enter the scope of the class so that the names of
14216 entities declared within the class are available in the
14217 conversion-type-id. For example, consider:
14219 struct S {
14220 typedef int I;
14221 operator I();
14222 };
14224 S::operator I() { ... }
14226 In order to see that `I' is a type-name in the definition, we
14227 must be in the scope of `S'. */
14230 /* Parse the conversion-type-id. */
14232 /* Leave the scope of the class, if any. */
14235 /* Restore the saved scope. */
14239 /* If the TYPE is invalid, indicate failure. */
14243 }
14245 /* Parse a conversion-type-id:
14247 conversion-type-id:
14248 type-specifier-seq conversion-declarator [opt]
14250 Returns the TYPE specified. */
14252 static tree
14254 {
14255 tree attributes;
14256 cp_decl_specifier_seq type_specifiers;
14258 tree type_specified;
14261 /* Parse the attributes. */
14265 parser->type_definition_forbidden_message
14268 /* Parse the type-specifiers. */
14275 /* If that didn't work, stop. */
14278 /* Parse the conversion-declarator. */
14286 /* Don't give this error when parsing tentatively. This happens to
14287 work because we always parse this definitively once. */
14290 {
14292 {
14295 }
14299 }
14302 }
14304 /* Parse an (optional) conversion-declarator.
14306 conversion-declarator:
14307 ptr-operator conversion-declarator [opt]
14309 */
14313 {
14316 cp_cv_quals cv_quals;
14318 /* We don't know if there's a ptr-operator next, or not. */
14320 /* Try the ptr-operator. */
14323 /* If it worked, look for more conversion-declarators. */
14325 {
14328 /* Parse another optional declarator. */
14331 declarator = cp_parser_make_indirect_declarator
14335 }
14338 }
14340 /* Parse an (optional) ctor-initializer.
14342 ctor-initializer:
14343 : mem-initializer-list */
14345 static void
14347 {
14348 /* If the next token is not a `:', then there is no
14349 ctor-initializer. */
14351 {
14352 /* Do default initialization of any bases and members. */
14356 }
14358 /* Consume the `:' token. */
14360 /* And the mem-initializer-list. */
14362 }
14364 /* Parse a mem-initializer-list.
14366 mem-initializer-list:
14367 mem-initializer ... [opt]
14368 mem-initializer ... [opt] , mem-initializer-list */
14370 static void
14372 {
14377 /* Let the semantic analysis code know that we are starting the
14378 mem-initializer-list. */
14383 /* Loop through the list. */
14385 {
14386 tree mem_initializer;
14389 /* Parse the mem-initializer. */
14391 /* If the next token is a `...', we're expanding member initializers. */
14393 {
14394 /* Consume the `...'. */
14397 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14398 can be expanded but members cannot. */
14401 {
14406 }
14408 /* Construct the pack expansion type. */
14411 }
14414 {
14418 }
14419 /* Look for a target constructor. */
14423 {
14426 {
14430 }
14432 }
14433 /* Add it to the list, unless it was erroneous. */
14435 {
14438 }
14439 /* If the next token is not a `,', we're done. */
14442 /* Consume the `,' token. */
14444 }
14446 /* Perform semantic analysis. */
14449 }
14451 /* Parse a mem-initializer.
14453 mem-initializer:
14454 mem-initializer-id ( expression-list [opt] )
14455 mem-initializer-id braced-init-list
14457 GNU extension:
14459 mem-initializer:
14460 ( expression-list [opt] )
14462 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14463 class) or FIELD_DECL (for a non-static data member) to initialize;
14464 the TREE_VALUE is the expression-list. An empty initialization
14465 list is represented by void_list_node. */
14467 static tree
14469 {
14470 tree mem_initializer_id;
14471 tree expression_list;
14472 tree member;
14475 /* Find out what is being initialized. */
14477 {
14481 }
14482 else
14483 {
14487 }
14493 {
14500 }
14501 else
14502 {
14512 }
14522 }
14524 /* Parse a mem-initializer-id.
14526 mem-initializer-id:
14527 :: [opt] nested-name-specifier [opt] class-name
14528 decltype-specifier (C++11)
14529 identifier
14531 Returns a TYPE indicating the class to be initialized for the first
14532 production (and the second in C++11). Returns an IDENTIFIER_NODE
14533 indicating the data member to be initialized for the last production. */
14535 static tree
14537 {
14541 tree id;
14545 /* `typename' is not allowed in this context ([temp.res]). */
14547 {
14549 "keyword %<typename%> not allowed in this context (a qualified "
14552 }
14553 /* Look for the optional `::' operator. */
14554 global_scope_p
14558 /* Look for the optional nested-name-specifier. The simplest way to
14559 implement:
14561 [temp.res]
14563 The keyword `typename' is not permitted in a base-specifier or
14564 mem-initializer; in these contexts a qualified name that
14565 depends on a template-parameter is implicitly assumed to be a
14566 type name.
14568 is to assume that we have seen the `typename' keyword at this
14569 point. */
14570 nested_name_specifier_p
14579 /* If there is a `::' operator or a nested-name-specifier, then we
14580 are definitely looking for a class-name. */
14585 typename_type,
14589 /* Otherwise, we could also be looking for an ordinary identifier. */
14592 /* Try a decltype-specifier. */
14594 else
14595 /* Otherwise, try a class-name. */
14599 none_type,
14603 /* If we found one, we're done. */
14606 /* Otherwise, look for an ordinary identifier. */
14608 }
14610 /* Overloading [gram.over] */
14612 /* Parse an operator-function-id.
14614 operator-function-id:
14615 operator operator
14617 Returns an IDENTIFIER_NODE for the operator which is a
14618 human-readable spelling of the identifier, e.g., `operator +'. */
14620 static cp_expr
14622 {
14623 /* Look for the `operator' keyword. */
14626 /* And then the name of the operator itself. */
14628 }
14630 /* Return an identifier node for a user-defined literal operator.
14631 The suffix identifier is chained to the operator name identifier. */
14633 tree
14635 {
14636 tree identifier;
14643 }
14645 /* Parse an operator.
14647 operator:
14648 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14649 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14650 || ++ -- , ->* -> () []
14652 GNU Extensions:
14654 operator:
14655 <? >? <?= >?=
14657 Returns an IDENTIFIER_NODE for the operator which is a
14658 human-readable spelling of the identifier, e.g., `operator +'. */
14660 static cp_expr
14662 {
14667 /* Peek at the next token. */
14672 /* Figure out which operator we have. */
14677 {
14679 {
14680 /* The keyword should be either `new' or `delete'. */
14685 else
14688 /* Consume the `new' or `delete' token. */
14691 /* Peek at the next token. */
14693 /* If it's a `[' token then this is the array variant of the
14694 operator. */
14696 {
14697 /* Consume the `[' token. */
14699 /* Look for the `]' token. */
14704 }
14708 }
14866 {
14867 /* Consume the `('. */
14868 matching_parens parens;
14870 /* Look for the matching `)'. */
14875 }
14878 /* Consume the `['. */
14880 /* Look for the matching `]'. */
14889 /* FALLTHRU */
14898 {
14905 /* Consume the string. */
14911 {
14914 }
14915 else
14916 {
14918 /* Look for the suffix identifier. */
14923 {
14927 }
14928 else
14929 {
14932 }
14933 }
14938 {
14941 }
14944 {
14947 }
14949 {
14952 }
14954 }
14957 /* Anything else is an error. */
14959 }
14961 /* If we have selected an identifier, we need to consume the
14962 operator token. */
14964 {
14968 }
14969 /* Otherwise, no valid operator name was present. */
14970 else
14971 {
14974 }
14977 }
14979 /* Parse a template-declaration.
14981 template-declaration:
14982 export [opt] template < template-parameter-list > declaration
14984 If MEMBER_P is TRUE, this template-declaration occurs within a
14985 class-specifier.
14987 The grammar rule given by the standard isn't correct. What
14988 is really meant is:
14990 template-declaration:
14991 export [opt] template-parameter-list-seq
14992 decl-specifier-seq [opt] init-declarator [opt] ;
14993 export [opt] template-parameter-list-seq
14994 function-definition
14996 template-parameter-list-seq:
14997 template-parameter-list-seq [opt]
14998 template < template-parameter-list >
15000 Concept Extensions:
15002 template-parameter-list-seq:
15003 template < template-parameter-list > requires-clause [opt]
15005 requires-clause:
15006 requires logical-or-expression */
15008 static void
15010 {
15011 /* Check for `export'. */
15013 {
15014 /* Consume the `export' token. */
15016 /* Warn that we do not support `export'. */
15018 }
15021 }
15023 /* Parse a template-parameter-list.
15025 template-parameter-list:
15026 template-parameter
15027 template-parameter-list , template-parameter
15029 Returns a TREE_LIST. Each node represents a template parameter.
15030 The nodes are connected via their TREE_CHAINs. */
15032 static tree
15034 {
15039 /* The loop below parses the template parms. We first need to know
15040 the total number of template parms to be able to compute proper
15041 canonical types of each dependent type. So after the loop, when
15042 we know the total number of template parms,
15043 end_template_parm_list computes the proper canonical types and
15044 fixes up the dependent types accordingly. */
15046 {
15047 tree parameter;
15050 location_t parm_loc;
15052 /* Parse the template-parameter. */
15057 /* Add it to the list. */
15060 parm_loc,
15061 parameter,
15062 is_non_type,
15063 is_parameter_pack);
15064 else
15065 {
15068 }
15070 /* If the next token is not a `,', we're done. */
15073 /* Otherwise, consume the `,' token. */
15075 }
15078 }
15080 /* Parse a introduction-list.
15082 introduction-list:
15083 introduced-parameter
15084 introduction-list , introduced-parameter
15086 introduced-parameter:
15087 ...[opt] identifier
15089 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15090 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15091 WILDCARD_DECL will also have DECL_NAME set and token location in
15092 DECL_SOURCE_LOCATION. */
15094 static tree
15096 {
15100 {
15105 /* Build placeholder. */
15113 /* If the next token is not a `,', we're done. */
15116 /* Otherwise, consume the `,' token. */
15118 }
15120 /* Convert the vec into a TREE_VEC. */
15123 tree parm;
15129 }
15131 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15132 is an abstract declarator. */
15136 {
15141 }
15143 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15144 is an abstract declarator. */
15148 {
15152 else
15154 }
15156 /* Returns true if DECL represents a constrained-parameter. */
15160 {
15165 }
15167 /* Returns true if PARM declares a constrained-parameter. */
15171 {
15173 }
15175 /* Check that the type parameter is only a declarator-id, and that its
15176 type is not cv-qualified. */
15178 bool
15181 {
15186 {
15189 }
15191 /* Don't allow cv-qualified type parameters. */
15194 {
15197 }
15200 }
15202 /* Finish parsing/processing a template type parameter and checking
15203 various restrictions. */
15207 tree id,
15209 {
15212 else
15214 }
15216 static tree
15218 {
15219 /* FIXME: This should probably be copied, and we may need to adjust
15220 the template parameter depths. */
15230 }
15232 /* Finish parsing/processing a template template parameter by borrowing
15233 the template parameter list from the prototype parameter. */
15235 static tree
15237 tree proto,
15238 tree id,
15240 {
15244 }
15246 /* Create a new non-type template parameter from the given PARM
15247 declarator. */
15249 static tree
15252 {
15258 }
15260 /* Build a constrained template parameter based on the PARMDECL
15261 declarator. The type of PARMDECL is the constrained type, which
15262 refers to the prototype template parameter that ultimately
15263 specifies the type of the declared parameter. */
15265 static tree
15270 {
15276 /* A template parameter constrained by a variadic concept shall also
15277 be declared as a template parameter pack. */
15282 /* Build the parameter. Return an error if the declarator was invalid. */
15283 tree parm;
15288 parmdecl);
15289 else
15294 /* Finish the parameter decl and create a node attaching the
15295 default argument and constraint. */
15300 }
15302 /* Returns true if the parsed type actually represents the declaration
15303 of a type template-parameter. */
15307 {
15310 }
15313 /* Returns true if the parsed type actually represents the declaration of
15314 a template template-parameter. */
15316 static bool
15318 {
15321 }
15323 /* Parse a default argument for a type template-parameter.
15324 Note that diagnostics are handled in cp_parser_template_parameter. */
15326 static tree
15328 {
15331 /* Consume the `=' token. */
15336 /* Parse the default-argument. */
15342 {
15346 }
15349 }
15351 /* Parse a default argument for a template template-parameter. */
15353 static tree
15355 {
15360 /* Consume the `='. */
15362 /* Parse the id-expression. */
15364 /* save token before parsing the id-expression, for error
15365 reporting */
15367 tree default_argument
15375 /* If the id-expression was a template-id that refers to
15376 a template-class, we already have the declaration here,
15377 so no further lookup is needed. */
15378 ;
15379 else
15380 /* Look up the name. */
15381 default_argument
15383 none_type,
15389 /* See if the default argument is valid. */
15393 }
15395 /* Parse a template-parameter.
15397 template-parameter:
15398 type-parameter
15399 parameter-declaration
15401 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15402 the parameter. The TREE_PURPOSE is the default value, if any.
15403 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15404 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15405 set to true iff this parameter is a parameter pack. */
15407 static tree
15410 {
15413 tree parm;
15415 /* Assume it is a type parameter or a template parameter. */
15417 /* Assume it not a parameter pack. */
15419 /* Peek at the next token. */
15421 /* If it is `template', we have a type-parameter. */
15424 /* If it is `class' or `typename' we do not know yet whether it is a
15425 type parameter or a non-type parameter. Consider:
15427 template <typename T, typename T::X X> ...
15429 or:
15431 template <class C, class D*> ...
15433 Here, the first parameter is a type parameter, and the second is
15434 a non-type parameter. We can tell by looking at the token after
15435 the identifier -- if it is a `,', `=', or `>' then we have a type
15436 parameter. */
15438 {
15439 /* Peek at the token after `class' or `typename'. */
15441 /* If it's an ellipsis, we have a template type parameter
15442 pack. */
15445 /* If it's an identifier, skip it. */
15448 /* Now, see if the token looks like the end of a template
15449 parameter. */
15454 }
15456 /* Otherwise, it is a non-type parameter or a constrained parameter.
15458 [temp.param]
15460 When parsing a default template-argument for a non-type
15461 template-parameter, the first non-nested `>' is taken as the end
15462 of the template parameter-list rather than a greater-than
15463 operator. */
15464 parameter_declarator
15471 /* If the parameter declaration is marked as a parameter pack, set
15472 *IS_PARAMETER_PACK to notify the caller. */
15477 {
15478 /* Can happen in some cases of erroneous input (c++/34892). */
15480 /* Consume the `...' for better error recovery. */
15482 }
15484 // The parameter may have been constrained.
15487 parameter_declarator,
15488 is_non_type,
15489 is_parameter_pack);
15491 // Now we're sure that the parameter is a non-type parameter.
15502 }
15504 /* Parse a type-parameter.
15506 type-parameter:
15507 class identifier [opt]
15508 class identifier [opt] = type-id
15509 typename identifier [opt]
15510 typename identifier [opt] = type-id
15511 template < template-parameter-list > class identifier [opt]
15512 template < template-parameter-list > class identifier [opt]
15513 = id-expression
15515 GNU Extension (variadic templates):
15517 type-parameter:
15518 class ... identifier [opt]
15519 typename ... identifier [opt]
15521 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15522 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15523 the declaration of the parameter.
15525 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15527 static tree
15529 {
15531 tree parameter;
15533 /* Look for a keyword to tell us what kind of parameter this is. */
15539 {
15542 {
15543 tree identifier;
15544 tree default_argument;
15546 /* If the next token is an ellipsis, we have a template
15547 argument pack. */
15549 {
15550 /* Consume the `...' token. */
15555 }
15557 /* If the next token is an identifier, then it names the
15558 parameter. */
15561 else
15564 /* Create the parameter. */
15567 /* If the next token is an `=', we have a default argument. */
15569 {
15570 default_argument
15573 /* Template parameter packs cannot have default
15574 arguments. */
15576 {
15579 "template parameter pack %qD cannot have a "
15581 else
15583 "template parameter packs cannot have "
15586 }
15589 }
15590 else
15593 /* Create the combined representation of the parameter and the
15594 default argument. */
15596 }
15600 {
15601 tree identifier;
15602 tree default_argument;
15604 /* Look for the `<'. */
15606 /* Parse the template-parameter-list. */
15608 /* Look for the `>'. */
15611 // If template requirements are present, parse them.
15613 {
15618 }
15620 /* Look for the `class' or 'typename' keywords. */
15622 /* If the next token is an ellipsis, we have a template
15623 argument pack. */
15625 {
15626 /* Consume the `...' token. */
15631 }
15632 /* If the next token is an `=', then there is a
15633 default-argument. If the next token is a `>', we are at
15634 the end of the parameter-list. If the next token is a `,',
15635 then we are at the end of this parameter. */
15639 {
15641 /* Treat invalid names as if the parameter were nameless. */
15644 }
15645 else
15648 /* Create the template parameter. */
15650 identifier);
15652 /* If the next token is an `=', then there is a
15653 default-argument. */
15655 {
15656 default_argument
15659 /* Template parameter packs cannot have default
15660 arguments. */
15662 {
15665 "template parameter pack %qD cannot "
15667 identifier);
15668 else
15672 }
15673 }
15674 else
15677 /* Create the combined representation of the parameter and the
15678 default argument. */
15680 }
15686 }
15689 }
15691 /* Parse a template-id.
15693 template-id:
15694 template-name < template-argument-list [opt] >
15696 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15697 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15698 returned. Otherwise, if the template-name names a function, or set
15699 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15700 names a class, returns a TYPE_DECL for the specialization.
15702 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15703 uninstantiated templates. */
15705 static tree
15711 {
15712 tree templ;
15713 tree arguments;
15714 tree template_id;
15719 /* If the next token corresponds to a template-id, there is no need
15720 to reparse it. */
15723 {
15726 }
15728 /* Avoid performing name lookup if there is no possibility of
15729 finding a template-id. */
15732 && !cp_parser_nth_token_starts_template_argument_list_p
15734 {
15737 }
15739 /* Remember where the template-id starts. */
15745 /* Parse the template-name. */
15748 check_dependency_p,
15749 is_declaration,
15750 tag_type,
15753 {
15756 }
15758 /* Since we're going to preserve any side-effects from this parse, set up a
15759 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15760 in the template arguments. */
15763 /* If we find the sequence `[:' after a template-name, it's probably
15764 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15765 parse correctly the argument list. */
15772 {
15774 /* Change `:' into `::'. */
15776 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15777 CPP_LESS. */
15780 /* Parse the arguments. */
15783 {
15784 /* If we couldn't parse an argument list, then we revert our changes
15785 and return simply an error. Maybe this is not a template-id
15786 after all. */
15791 }
15792 /* Otherwise, emit an error about the invalid digraph, but continue
15793 parsing because we got our argument list. */
15796 {
15799 "%<<:%> is an alternate spelling for %<[%>."
15802 {
15804 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15807 }
15808 }
15809 }
15810 else
15811 {
15812 /* Look for the `<' that starts the template-argument-list. */
15814 {
15817 }
15818 /* Parse the arguments. */
15820 }
15822 /* Set the location to be of the form:
15823 template-name < template-argument-list [opt] >
15824 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15825 with caret == start at the start of the template-name,
15826 ranging until the closing '>'. */
15827 location_t finish_loc
15829 location_t combined_loc
15832 /* Build a representation of the specialization. */
15835 TEMPLATE_ID_EXPR,
15839 {
15841 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15842 template (rather than some instantiation thereof) only if
15843 is not nested within some other construct. For example, in
15844 "template <typename T> void f(T) { A<T>::", A<T> is just an
15845 instantiation of A. */
15848 CPP_SCOPE));
15849 template_id
15851 }
15852 /* A template-like identifier may be a partial concept id. */
15858 {
15862 }
15863 else
15864 {
15865 /* If it's not a class-template or a template-template, it should be
15866 a function-template. */
15874 }
15876 /* If parsing tentatively, replace the sequence of tokens that makes
15877 up the template-id with a CPP_TEMPLATE_ID token. That way,
15878 should we re-parse the token stream, we will not have to repeat
15879 the effort required to do the parse, nor will we issue duplicate
15880 error messages about problems during instantiation of the
15881 template. */
15883 /* Don't do this if we had a parse error in a declarator; re-parsing
15884 might succeed if a name changes meaning (60361). */
15888 {
15889 /* Reset the contents of the START_OF_ID token. */
15893 /* We must mark the lookup as kept, so we don't throw it away on
15894 the first parse. */
15898 /* Retrieve any deferred checks. Do not pop this access checks yet
15899 so the memory will not be reclaimed during token replacing below. */
15905 /* Purge all subsequent tokens. */
15908 /* ??? Can we actually assume that, if template_id ==
15909 error_mark_node, we will have issued a diagnostic to the
15910 user, as opposed to simply marking the tentative parse as
15911 failed? */
15914 }
15918 }
15920 /* Parse a template-name.
15922 template-name:
15923 identifier
15925 The standard should actually say:
15927 template-name:
15928 identifier
15929 operator-function-id
15931 A defect report has been filed about this issue.
15933 A conversion-function-id cannot be a template name because they cannot
15934 be part of a template-id. In fact, looking at this code:
15936 a.operator K<int>()
15938 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15939 It is impossible to call a templated conversion-function-id with an
15940 explicit argument list, since the only allowed template parameter is
15941 the type to which it is converting.
15943 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15944 `template' keyword, in a construction like:
15946 T::template f<3>()
15948 In that case `f' is taken to be a template-name, even though there
15949 is no way of knowing for sure.
15951 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15952 name refers to a set of overloaded functions, at least one of which
15953 is a template, or an IDENTIFIER_NODE with the name of the template,
15954 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15955 names are looked up inside uninstantiated templates. */
15957 static tree
15964 {
15965 tree identifier;
15966 tree decl;
15969 /* If the next token is `operator', then we have either an
15970 operator-function-id or a conversion-function-id. */
15972 {
15973 /* We don't know whether we're looking at an
15974 operator-function-id or a conversion-function-id. */
15976 /* Try an operator-function-id. */
15978 /* If that didn't work, try a conversion-function-id. */
15980 {
15983 }
15984 }
15985 /* Look for the identifier. */
15986 else
15989 /* If we didn't find an identifier, we don't have a template-id. */
15993 /* If the name immediately followed the `template' keyword, then it
15994 is a template-name. However, if the next token is not `<', then
15995 we do not treat it as a template-name, since it is not being used
15996 as part of a template-id. This enables us to handle constructs
15997 like:
15999 template <typename T> struct S { S(); };
16000 template <typename T> S<T>::S();
16002 correctly. We would treat `S' as a template -- if it were `S<T>'
16003 -- but we do not if there is no `<'. */
16007 {
16008 /* In a declaration, in a dependent context, we pretend that the
16009 "template" keyword was present in order to improve error
16010 recovery. For example, given:
16012 template <typename T> void f(T::X<int>);
16014 we want to treat "X<int>" as a template-id. */
16016 && !template_keyword_p
16018 && check_dependency_p
16020 /* Do not do this for dtors (or ctors), since they never
16021 need the template keyword before their name. */
16023 {
16026 /* Explain what went wrong. */
16028 identifier);
16031 /* If parsing tentatively, find the location of the "<" token. */
16034 /* Parse the template arguments so that we can issue error
16035 messages about them. */
16038 /* Skip tokens until we find a good place from which to
16039 continue parsing. */
16044 /* If parsing tentatively, permanently remove the
16045 template argument list. That will prevent duplicate
16046 error messages from being issued about the missing
16047 "template" keyword. */
16054 }
16056 /* If the "template" keyword is present, then there is generally
16057 no point in doing name-lookup, so we just return IDENTIFIER.
16058 But, if the qualifying scope is non-dependent then we can
16059 (and must) do name-lookup normally. */
16061 {
16067 {
16068 /* We're optimizing away the call to cp_parser_lookup_name, but
16069 we still need to do this. */
16072 }
16073 }
16074 }
16076 /* Look up the name. */
16078 tag_type,
16081 check_dependency_p,
16087 /* If DECL is a template, then the name was a template-name. */
16089 {
16093 }
16094 else
16095 {
16096 /* The standard does not explicitly indicate whether a name that
16097 names a set of overloaded declarations, some of which are
16098 templates, is a template-name. However, such a name should
16099 be a template-name; otherwise, there is no way to form a
16100 template-id for the overloaded templates. */
16109 {
16110 /* The name does not name a template. */
16113 }
16114 }
16116 /* If DECL is dependent, and refers to a function, then just return
16117 its name; we will look it up again during template instantiation. */
16119 {
16123 }
16126 }
16128 /* Parse a template-argument-list.
16130 template-argument-list:
16131 template-argument ... [opt]
16132 template-argument-list , template-argument ... [opt]
16134 Returns a TREE_VEC containing the arguments. */
16136 static tree
16138 {
16143 tree vec;
16150 /* Even if the template-id appears in an integral
16151 constant-expression, the contents of the argument list do
16152 not. */
16158 /* Parse the arguments. */
16159 do
16160 {
16161 tree argument;
16164 /* Consume the comma. */
16167 /* Parse the template-argument. */
16170 /* If the next token is an ellipsis, we're expanding a template
16171 argument pack. */
16173 {
16175 {
16179 }
16180 /* Consume the `...' token. */
16183 /* Make the argument into a TYPE_PACK_EXPANSION or
16184 EXPR_PACK_EXPANSION. */
16186 }
16189 {
16193 {
16196 }
16197 else
16199 }
16201 }
16217 }
16219 /* Parse a template-argument.
16221 template-argument:
16222 assignment-expression
16223 type-id
16224 id-expression
16226 The representation is that of an assignment-expression, type-id, or
16227 id-expression -- except that the qualified id-expression is
16228 evaluated, so that the value returned is either a DECL or an
16229 OVERLOAD.
16231 Although the standard says "assignment-expression", it forbids
16232 throw-expressions or assignments in the template argument.
16233 Therefore, we use "conditional-expression" instead. */
16235 static tree
16237 {
16238 tree argument;
16244 cp_id_kind idk;
16246 /* There's really no way to know what we're looking at, so we just
16247 try each alternative in order.
16249 [temp.arg]
16251 In a template-argument, an ambiguity between a type-id and an
16252 expression is resolved to a type-id, regardless of the form of
16253 the corresponding template-parameter.
16255 Therefore, we try a type-id first. */
16258 /* If there was no error parsing the type-id but the next token is a
16259 '>>', our behavior depends on which dialect of C++ we're
16260 parsing. In C++98, we probably found a typo for '> >'. But there
16261 are type-id which are also valid expressions. For instance:
16263 struct X { int operator >> (int); };
16264 template <int V> struct Foo {};
16265 Foo<X () >> 5> r;
16267 Here 'X()' is a valid type-id of a function type, but the user just
16268 wanted to write the expression "X() >> 5". Thus, we remember that we
16269 found a valid type-id, but we still try to parse the argument as an
16270 expression to see what happens.
16272 In C++0x, the '>>' will be considered two separate '>'
16273 tokens. */
16277 {
16280 }
16281 else
16282 {
16283 /* If the next token isn't a `,' or a `>', then this argument wasn't
16284 really finished. This means that the argument is not a valid
16285 type-id. */
16288 /* If that worked, we're done. */
16291 }
16292 /* We're still not sure what the argument will be. */
16294 /* Try a template. */
16302 /* If the next token isn't a `,' or a `>', then this argument wasn't
16303 really finished. */
16307 {
16308 /* Figure out what is being referred to. If the id-expression
16309 was for a class template specialization, then we will have a
16310 TYPE_DECL at this point. There is no need to do name lookup
16311 at this point in that case. */
16314 none_type,
16320 /* Handle a constrained-type-specifier for a non-type template
16321 parameter. */
16327 }
16329 {
16333 }
16334 /* It must be a non-type argument. In C++17 any constant-expression is
16335 allowed. */
16339 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16341 -- an integral constant-expression of integral or enumeration
16342 type; or
16344 -- the name of a non-type template-parameter; or
16346 -- the name of an object or function with external linkage...
16348 -- the address of an object or function with external linkage...
16350 -- a pointer to member... */
16351 /* Look for a non-type template parameter. */
16353 {
16365 }
16367 /* If the next token is "&", the argument must be the address of an
16368 object or function with external linkage. */
16371 {
16374 }
16375 /* See if we might have an id-expression. */
16382 {
16385 address_p,
16392 else
16393 {
16394 tree probe;
16397 {
16398 /* Strip the dereference temporarily. */
16401 }
16403 /* If we're in a template, we represent a qualified-id referring
16404 to a static data member as a SCOPE_REF even if the scope isn't
16405 dependent so that we can check access control later. */
16410 {
16411 /* A variable without external linkage might still be a
16412 valid constant-expression, so no error is issued here
16413 if the external-linkage check fails. */
16416 }
16418 /* All overloaded functions are allowed; if the external
16419 linkage test does not pass, an error will be issued
16420 later. */
16421 ;
16425 /* A pointer-to-member. */
16426 ;
16428 ;
16429 else
16433 {
16436 tf_warning_or_error);
16437 else
16440 }
16441 }
16442 }
16443 /* If the argument started with "&", there are no other valid
16444 alternatives at this point. */
16446 {
16449 }
16451 general_expr:
16452 /* If the argument wasn't successfully parsed as a type-id followed
16453 by '>>', the argument can only be a constant expression now.
16454 Otherwise, we try parsing the constant-expression tentatively,
16455 because the argument could really be a type-id. */
16461 else
16462 {
16463 /* With C++17 generalized non-type template arguments we need to handle
16464 lvalue constant expressions, too. */
16467 }
16475 /* We did our best to parse the argument as a non type-id, but that
16476 was the only alternative that matched (albeit with a '>' after
16477 it). We can assume it's just a typo from the user, and a
16478 diagnostic will then be issued. */
16480 }
16482 /* Parse an explicit-instantiation.
16484 explicit-instantiation:
16485 template declaration
16487 Although the standard says `declaration', what it really means is:
16489 explicit-instantiation:
16490 template decl-specifier-seq [opt] declarator [opt] ;
16492 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16493 supposed to be allowed. A defect report has been filed about this
16494 issue.
16496 GNU Extension:
16498 explicit-instantiation:
16499 storage-class-specifier template
16500 decl-specifier-seq [opt] declarator [opt] ;
16501 function-specifier template
16502 decl-specifier-seq [opt] declarator [opt] ; */
16504 static void
16506 {
16508 cp_decl_specifier_seq decl_specifiers;
16513 /* Look for an (optional) storage-class-specifier or
16514 function-specifier. */
16516 {
16517 extension_specifier
16520 extension_specifier
16523 }
16525 /* Look for the `template' keyword. */
16527 /* Let the front end know that we are processing an explicit
16528 instantiation. */
16530 /* [temp.explicit] says that we are supposed to ignore access
16531 control while processing explicit instantiation directives. */
16533 /* Parse a decl-specifier-seq. */
16535 CP_PARSER_FLAGS_OPTIONAL,
16538 /* If there was exactly one decl-specifier, and it declared a class,
16539 and there's no declarator, then we have an explicit type
16540 instantiation. */
16542 {
16543 tree type;
16547 /* Turn access control back on for names used during
16548 template instantiation. */
16553 }
16554 else
16555 {
16557 tree decl;
16559 /* Parse the declarator. */
16560 declarator
16571 {
16574 "explicit instantiation shall not use"
16578 "explicit instantiation shall not use"
16583 /* Turn access control back on for names used during
16584 template instantiation. */
16586 /* Do the explicit instantiation. */
16588 }
16589 else
16590 {
16592 /* Skip the body of the explicit instantiation. */
16594 }
16595 }
16596 /* We're done with the instantiation. */
16602 }
16604 /* Parse an explicit-specialization.
16606 explicit-specialization:
16607 template < > declaration
16609 Although the standard says `declaration', what it really means is:
16611 explicit-specialization:
16612 template <> decl-specifier [opt] init-declarator [opt] ;
16613 template <> function-definition
16614 template <> explicit-specialization
16615 template <> template-declaration */
16617 static void
16619 {
16623 /* Look for the `template' keyword. */
16625 /* Look for the `<'. */
16627 /* Look for the `>'. */
16629 /* We have processed another parameter list. */
16631 /* [temp]
16633 A template ... explicit specialization ... shall not have C
16634 linkage. */
16636 {
16639 /* Give it C++ linkage to avoid confusing other parts of the
16640 front end. */
16643 }
16644 else
16646 /* Let the front end know that we are beginning a specialization. */
16648 {
16651 }
16653 /* If the next keyword is `template', we need to figure out whether
16654 or not we're looking a template-declaration. */
16656 {
16661 else
16663 }
16664 else
16665 /* Parse the dependent declaration. */
16671 /* We're done with the specialization. */
16673 /* For the erroneous case of a template with C linkage, we pushed an
16674 implicit C++ linkage scope; exit that scope now. */
16677 /* We're done with this parameter list. */
16679 }
16681 /* Parse a type-specifier.
16683 type-specifier:
16684 simple-type-specifier
16685 class-specifier
16686 enum-specifier
16687 elaborated-type-specifier
16688 cv-qualifier
16690 GNU Extension:
16692 type-specifier:
16693 __complex__
16695 Returns a representation of the type-specifier. For a
16696 class-specifier, enum-specifier, or elaborated-type-specifier, a
16697 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16699 The parser flags FLAGS is used to control type-specifier parsing.
16701 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16702 in a decl-specifier-seq.
16704 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16705 class-specifier, enum-specifier, or elaborated-type-specifier, then
16706 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16707 if a type is declared; 2 if it is defined. Otherwise, it is set to
16708 zero.
16710 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16711 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16712 is set to FALSE. */
16714 static tree
16716 cp_parser_flags flags,
16721 {
16727 /* Assume this type-specifier does not declare a new type. */
16730 /* And that it does not specify a cv-qualifier. */
16733 /* Peek at the next token. */
16736 /* If we're looking at a keyword, we can use that to guide the
16737 production we choose. */
16740 {
16745 /* Look for the enum-specifier. */
16747 /* If that worked, we're done. */
16749 {
16754 type_spec,
16755 token,
16758 }
16759 else
16762 /* Any of these indicate either a class-specifier, or an
16763 elaborated-type-specifier. */
16770 /* Parse tentatively so that we can back up if we don't find a
16771 class-specifier. */
16773 /* Look for the class-specifier. */
16776 /* If that worked, we're done. */
16778 {
16783 type_spec,
16784 token,
16787 }
16789 /* Fall through. */
16790 elaborated_type_specifier:
16791 /* We're declaring (not defining) a class or enum. */
16795 /* Fall through. */
16797 /* Look for an elaborated-type-specifier. */
16798 type_spec
16799 = (cp_parser_elaborated_type_specifier
16802 is_declaration));
16805 type_spec,
16806 token,
16829 /* The `__complex__' keyword is a GNU extension. */
16835 }
16837 /* Handle simple keywords. */
16839 {
16841 {
16844 }
16846 }
16848 /* If we do not already have a type-specifier, assume we are looking
16849 at a simple-type-specifier. */
16851 decl_specs,
16852 flags);
16854 /* If we didn't find a type-specifier, and a type-specifier was not
16855 optional in this context, issue an error message. */
16857 {
16860 }
16863 }
16865 /* Parse a simple-type-specifier.
16867 simple-type-specifier:
16868 :: [opt] nested-name-specifier [opt] type-name
16869 :: [opt] nested-name-specifier template template-id
16870 char
16871 wchar_t
16872 bool
16873 short
16874 int
16875 long
16876 signed
16877 unsigned
16878 float
16879 double
16880 void
16882 C++11 Extension:
16884 simple-type-specifier:
16885 auto
16886 decltype ( expression )
16887 char16_t
16888 char32_t
16889 __underlying_type ( type-id )
16891 C++17 extension:
16893 nested-name-specifier(opt) template-name
16895 GNU Extension:
16897 simple-type-specifier:
16898 __int128
16899 __typeof__ unary-expression
16900 __typeof__ ( type-id )
16901 __typeof__ ( type-id ) { initializer-list , [opt] }
16903 Concepts Extension:
16905 simple-type-specifier:
16906 constrained-type-specifier
16908 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16909 appropriately updated. */
16911 static tree
16914 cp_parser_flags flags)
16915 {
16920 /* Peek at the next token. */
16923 /* If we're looking at a keyword, things are easy. */
16925 {
16960 {
16963 }
16992 {
16993 /* The 'auto' might be the placeholder return type for a function decl
16994 with trailing return type. */
17003 {
17005 {
17012 }
17015 {
17018 }
17021 }
17025 {
17028 }
17031 {
17034 }
17035 else
17039 {
17042 "use of %<auto%> in lambda parameter declaration "
17043 "only available with "
17045 }
17048 "use of %<auto%> in parameter declaration "
17049 "only available with "
17053 "use of %<auto%> in parameter declaration "
17055 }
17056 else
17061 /* Since DR 743, decltype can either be a simple-type-specifier by
17062 itself or begin a nested-name-specifier. Parsing it will replace
17063 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17064 handling below decide what to do. */
17070 /* Consume the `typeof' token. */
17072 /* Parse the operand to `typeof'. */
17074 /* If it is not already a TYPE, take its type. */
17080 token,
17089 token,
17099 token,
17104 }
17106 /* If token is an already-parsed decltype not followed by ::,
17107 it's a simple-type-specifier. */
17110 {
17113 {
17115 token,
17117 /* Remember that we are handling a decltype in order to
17118 implement the resolution of DR 1510 when the argument
17119 isn't instantiation dependent. */
17121 }
17124 }
17126 /* If the type-specifier was for a built-in type, we're done. */
17128 {
17129 /* Record the type. */
17136 type,
17137 token,
17142 /* Consume the token. */
17148 /* There is no valid C++ program where a non-template type is
17149 followed by a "<". That usually indicates that the user thought
17150 that the type was a template. */
17155 }
17157 /* The type-specifier must be a user-defined type. */
17159 {
17163 /* Don't gobble tokens or issue error messages if this is an
17164 optional type-specifier. */
17170 /* Look for the optional `::' operator. */
17171 global_p
17175 /* Look for the nested-name specifier. */
17176 qualified_p
17183 /* If we have seen a nested-name-specifier, and the next token
17184 is `template', then we are using the template-id production. */
17187 {
17188 /* Look for the template-id. */
17192 none_type,
17194 /* If the template-id did not name a type, we are out of
17195 luck. */
17197 {
17200 }
17201 }
17202 /* Otherwise, look for a type-name. */
17203 else
17205 /* Keep track of all name-lookups performed in class scopes. */
17207 && !global_p
17208 && !qualified_p
17212 /* If it didn't work out, we don't have a TYPE. */
17217 {
17231 {
17233 none_type,
17243 else
17244 {
17249 }
17250 }
17251 else
17257 }
17260 token,
17262 }
17264 /* If we didn't get a type-name, issue an error message. */
17266 {
17269 }
17272 {
17273 /* See if TYPE is an Objective-C type, and if so, parse and
17274 accept any protocol references following it. Do this before
17275 the cp_parser_check_for_invalid_template_id() call, because
17276 Objective-C types can be followed by '<...>' which would
17277 enclose protocol names rather than template arguments, and so
17278 everything is fine. */
17281 {
17285 /* Clobber the "unqualified" type previously entered into
17286 DECL_SPECS with the new, improved protocol-qualified version. */
17291 }
17293 /* There is no valid C++ program where a non-template type is
17294 followed by a "<". That usually indicates that the user
17295 thought that the type was a template. */
17297 none_type,
17299 }
17302 }
17304 /* Parse a type-name.
17306 type-name:
17307 class-name
17308 enum-name
17309 typedef-name
17310 simple-template-id [in c++0x]
17312 enum-name:
17313 identifier
17315 typedef-name:
17316 identifier
17318 Concepts:
17320 type-name:
17321 concept-name
17322 partial-concept-id
17324 concept-name:
17325 identifier
17327 Returns a TYPE_DECL for the type. */
17329 static tree
17331 {
17333 }
17335 /* See above. */
17336 static tree
17338 {
17339 tree type_decl;
17341 /* We can't know yet whether it is a class-name or not. */
17343 /* Try a class-name. */
17345 typename_keyword_p,
17347 none_type,
17351 /* If it's not a class-name, keep looking. */
17353 {
17355 /* It must be a typedef-name or an enum-name. */
17359 /* It is either a simple-template-id representing an
17360 instantiation of an alias template... */
17364 none_type,
17366 /* Note that this must be an instantiation of an alias template
17367 because [temp.names]/6 says:
17369 A template-id that names an alias template specialization
17370 is a type-name.
17372 Whereas [temp.names]/7 says:
17374 A simple-template-id that names a class template
17375 specialization is a class-name.
17377 With concepts, this could also be a partial-concept-id that
17378 declares a non-type template parameter. */
17385 else
17389 /* ... Or a typedef-name or an enum-name. */
17391 }
17394 }
17396 /* Check if DECL and ARGS can form a constrained-type-specifier.
17397 If ARGS is non-null, we try to form a concept check of the
17398 form DECL<?, ARGS> where ? is a wildcard that matches any
17399 kind of template argument. If ARGS is NULL, then we try to
17400 form a concept check of the form DECL<?>. */
17402 static tree
17405 {
17408 /* If we a constrained-type-specifier cannot be deduced. */
17412 /* A constrained type specifier can only be found in an
17413 overload set or as a reference to a template declaration.
17415 FIXME: This might be masking a bug. It's possible that
17416 that the deduction below is causing template specializations
17417 to be formed with the wildcard as an argument. */
17421 /* Try to build a call expression that evaluates the
17422 concept. This can fail if the overload set refers
17423 only to non-templates. */
17429 /* Deduce the checked constraint and the prototype parameter.
17431 FIXME: In certain cases, failure to deduce should be a
17432 diagnosable error. */
17433 tree conc;
17434 tree proto;
17438 /* In template parameter scope, this results in a constrained
17439 parameter. Return a descriptor of that parm. */
17443 /* In a parameter-declaration-clause, constrained-type
17444 specifiers result in invented template parameters. */
17446 {
17449 }
17450 else
17451 {
17452 /* Otherwise, we're in a context where the constrained
17453 type name is deduced and the constraint applies
17454 after deduction. */
17456 }
17459 }
17461 /* If DECL refers to a concept, return a TYPE_DECL representing
17462 the result of using the constrained type specifier in the
17463 current context. DECL refers to a concept if
17465 - it is an overload set containing a function concept taking a single
17466 type argument, or
17468 - it is a variable concept taking a single type argument. */
17470 static tree
17472 {
17478 else
17480 }
17482 /* Check if DECL and ARGS form a partial-concept-id. If so,
17483 assign ID to the resulting constrained placeholder.
17485 Returns true if the partial-concept-id designates a placeholder
17486 and false otherwise. Note that *id is set to NULL_TREE in
17487 this case. */
17489 static tree
17491 {
17493 }
17495 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17496 or a concept-name.
17498 enum-name:
17499 identifier
17501 typedef-name:
17502 identifier
17504 concept-name:
17505 identifier
17507 Returns a TYPE_DECL for the type. */
17509 static tree
17511 {
17512 tree type_decl;
17513 tree identifier;
17520 /* Look up the type-name. */
17525 /* If we found an overload set, then it may refer to a concept-name. */
17531 {
17532 /* See if this is an Objective-C type. */
17537 }
17539 /* Issue an error if we did not find a type-name. */
17541 /* In Objective-C, we have the complication that class names are
17542 normally type names and start declarations (eg, the
17543 "NSObject" in "NSObject *object;"), but can be used in an
17544 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17545 is an expression. So, a classname followed by a dot is not a
17546 valid type-name. */
17549 {
17554 }
17555 /* Remember that the name was used in the definition of the
17556 current class so that we can check later to see if the
17557 meaning would have been different after the class was
17558 entirely defined. */
17564 }
17566 /* Parse an elaborated-type-specifier. Note that the grammar given
17567 here incorporates the resolution to DR68.
17569 elaborated-type-specifier:
17570 class-key :: [opt] nested-name-specifier [opt] identifier
17571 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17572 enum-key :: [opt] nested-name-specifier [opt] identifier
17573 typename :: [opt] nested-name-specifier identifier
17574 typename :: [opt] nested-name-specifier template [opt]
17575 template-id
17577 GNU extension:
17579 elaborated-type-specifier:
17580 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17581 class-key attributes :: [opt] nested-name-specifier [opt]
17582 template [opt] template-id
17583 enum attributes :: [opt] nested-name-specifier [opt] identifier
17585 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17586 declared `friend'. If IS_DECLARATION is TRUE, then this
17587 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17588 something is being declared.
17590 Returns the TYPE specified. */
17592 static tree
17596 {
17598 tree identifier;
17601 tree globalscope;
17604 /* See if we're looking at the `enum' keyword. */
17606 {
17607 /* Consume the `enum' token. */
17609 /* Remember that it's an enumeration type. */
17611 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17612 enums) is used here. */
17616 {
17623 /* Consume the `struct' or `class' and parse it anyway. */
17625 }
17626 /* Parse the attributes. */
17628 }
17629 /* Or, it might be `typename'. */
17631 RID_TYPENAME))
17632 {
17633 /* Consume the `typename' token. */
17635 /* Remember that it's a `typename' type. */
17637 }
17638 /* Otherwise it must be a class-key. */
17639 else
17640 {
17644 /* Parse the attributes. */
17646 }
17648 /* Look for the `::' operator. */
17651 /* Look for the nested-name-specifier. */
17652 tree nested_name_specifier;
17654 {
17655 nested_name_specifier
17660 is_declaration);
17663 }
17664 else
17665 /* Even though `typename' is not present, the proposed resolution
17666 to Core Issue 180 says that in `class A<T>::B', `B' should be
17667 considered a type-name, even if `A<T>' is dependent. */
17668 nested_name_specifier
17673 is_declaration);
17674 /* For everything but enumeration types, consider a template-id.
17675 For an enumeration type, consider only a plain identifier. */
17677 {
17679 tree decl;
17681 /* Allow the `template' keyword. */
17683 /* If we didn't see `template', we don't know if there's a
17684 template-id or not. */
17687 /* Parse the template-id. */
17691 tag_type,
17692 is_declaration);
17693 /* If we didn't find a template-id, look for an ordinary
17694 identifier. */
17696 ;
17697 /* We can get here when cp_parser_template_id, called by
17698 cp_parser_class_name with tag_type == none_type, succeeds
17699 and caches a BASELINK. Then, when called again here,
17700 instead of failing and returning an error_mark_node
17701 returns it (see template/typename17.C in C++11).
17702 ??? Could we diagnose this earlier? */
17704 {
17707 }
17708 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17709 in effect, then we must assume that, upon instantiation, the
17710 template will correspond to a class. */
17714 typename_type,
17716 /* If the `typename' keyword is in effect and DECL is not a type
17717 decl, then type is non existent. */
17719 ;
17721 {
17725 /* If the next token is a semicolon, this must be a specialization,
17726 instantiation, or friend declaration. Check the scope while we
17727 still know whether or not we had a nested-name-specifier. */
17732 }
17735 }
17738 {
17743 {
17746 }
17748 /* For a `typename', we needn't call xref_tag. */
17754 /* Template parameter lists apply only if we are not within a
17755 function parameter list. */
17756 bool template_parm_lists_apply
17765 /* Look up a qualified name in the usual way. */
17767 {
17768 tree decl;
17769 tree ambiguous_decls;
17772 tag_type,
17779 /* If the lookup was ambiguous, an error will already have been
17780 issued. */
17784 /* If we are parsing friend declaration, DECL may be a
17785 TEMPLATE_DECL tree node here. However, we need to check
17786 whether this TEMPLATE_DECL results in valid code. Consider
17787 the following example:
17789 namespace N {
17790 template <class T> class C {};
17791 }
17792 class X {
17793 template <class T> friend class N::C; // #1, valid code
17794 };
17795 template <class T> class Y {
17796 friend class N::C; // #2, invalid code
17797 };
17799 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17800 name lookup of `N::C'. We see that friend declaration must
17801 be template for the code to be valid. Note that
17802 processing_template_decl does not work here since it is
17803 always 1 for the above two cases. */
17805 decl = (cp_parser_maybe_treat_template_as_class
17810 {
17812 identifier,
17815 }
17818 {
17822 allow_template);
17826 }
17828 /* Forward declarations of nested types, such as
17830 class C1::C2;
17831 class C1::C2::C3;
17833 are invalid unless all components preceding the final '::'
17834 are complete. If all enclosing types are complete, these
17835 declarations become merely pointless.
17837 Invalid forward declarations of nested types are errors
17838 caught elsewhere in parsing. Those that are pointless arrive
17839 here. */
17846 }
17847 else
17848 {
17849 /* An elaborated-type-specifier sometimes introduces a new type and
17850 sometimes names an existing type. Normally, the rule is that it
17851 introduces a new type only if there is not an existing type of
17852 the same name already in scope. For example, given:
17854 struct S {};
17855 void f() { struct S s; }
17857 the `struct S' in the body of `f' is the same `struct S' as in
17858 the global scope; the existing definition is used. However, if
17859 there were no global declaration, this would introduce a new
17860 local class named `S'.
17862 An exception to this rule applies to the following code:
17864 namespace N { struct S; }
17866 Here, the elaborated-type-specifier names a new type
17867 unconditionally; even if there is already an `S' in the
17868 containing scope this declaration names a new type.
17869 This exception only applies if the elaborated-type-specifier
17870 forms the complete declaration:
17872 [class.name]
17874 A declaration consisting solely of `class-key identifier ;' is
17875 either a redeclaration of the name in the current scope or a
17876 forward declaration of the identifier as a class name. It
17877 introduces the name into the current scope.
17879 We are in this situation precisely when the next token is a `;'.
17881 An exception to the exception is that a `friend' declaration does
17882 *not* name a new type; i.e., given:
17884 struct S { friend struct T; };
17886 `T' is not a new type in the scope of `S'.
17888 Also, `new struct S' or `sizeof (struct S)' never results in the
17889 definition of a new type; a new type can only be declared in a
17890 declaration context. */
17892 tag_scope ts;
17896 /* Friends have special name lookup rules. */
17900 CPP_SEMICOLON))
17901 /* This is a `class-key identifier ;' */
17903 else
17906 template_p =
17907 (template_parm_lists_apply
17910 /* An unqualified name was used to reference this type, so
17911 there were no qualifying templates. */
17919 }
17920 }
17925 /* Allow attributes on forward declarations of classes. */
17927 {
17937 else
17940 }
17943 {
17944 /* Indicate whether this class was declared as a `class' or as a
17945 `struct'. */
17949 }
17951 /* A "<" cannot follow an elaborated type specifier. If that
17952 happens, the user was probably trying to form a template-id. */
17957 }
17959 /* Parse an enum-specifier.
17961 enum-specifier:
17962 enum-head { enumerator-list [opt] }
17963 enum-head { enumerator-list , } [C++0x]
17965 enum-head:
17966 enum-key identifier [opt] enum-base [opt]
17967 enum-key nested-name-specifier identifier enum-base [opt]
17969 enum-key:
17970 enum
17971 enum class [C++0x]
17972 enum struct [C++0x]
17974 enum-base: [C++0x]
17975 : type-specifier-seq
17977 opaque-enum-specifier:
17978 enum-key identifier enum-base [opt] ;
17980 GNU Extensions:
17981 enum-key attributes[opt] identifier [opt] enum-base [opt]
17982 { enumerator-list [opt] }attributes[opt]
17983 enum-key attributes[opt] identifier [opt] enum-base [opt]
17984 { enumerator-list, }attributes[opt] [C++0x]
17986 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17987 if the token stream isn't an enum-specifier after all. */
17989 static tree
17991 {
17992 tree identifier;
17994 tree prev_scope;
17996 tree attributes;
18009 /* Parse tentatively so that we can back up if we don't find a
18010 enum-specifier. */
18013 /* Caller guarantees that the current token is 'enum', an identifier
18014 possibly follows, and the token after that is an opening brace.
18015 If we don't have an identifier, fabricate an anonymous name for
18016 the enumeration being defined. */
18019 /* Parse the "class" or "struct", which indicates a scoped
18020 enumeration type in C++0x. */
18023 {
18027 /* Consume the `struct' or `class' token. */
18031 }
18035 /* Clear the qualification. */
18040 /* Figure out in what scope the declaration is being placed. */
18046 nested_name_specifier
18054 {
18055 tree name;
18059 enum_type,
18064 input_location);
18066 {
18069 {
18070 /* Are template enums allowed in ISO? */
18074 /* ignore a typename reference, for it will be solved by name
18075 in start_enum. */
18077 }
18078 }
18081 else
18082 {
18087 }
18088 }
18089 else
18090 {
18093 else
18094 {
18100 }
18101 }
18104 /* Check for the `:' that denotes a specified underlying type in C++0x.
18105 Note that a ':' could also indicate a bitfield width, however. */
18107 {
18108 cp_decl_specifier_seq type_specifiers;
18110 /* Consume the `:'. */
18113 /* Parse the type-specifier-seq. */
18118 /* At this point this is surely not elaborated type specifier. */
18127 /* If that didn't work, stop. */
18129 {
18135 }
18136 }
18138 /* Look for the `{' but don't consume it yet. */
18140 {
18142 {
18145 {
18148 }
18149 }
18150 /* An opaque-enum-specifier must have a ';' here. */
18153 {
18156 {
18159 }
18160 }
18161 }
18167 {
18169 {
18173 }
18175 {
18177 }
18178 }
18180 /* Issue an error message if type-definitions are forbidden here. */
18183 else
18184 /* Create the new type. We do this before consuming the opening
18185 brace so the enum will be recorded as being on the line of its
18186 tag (or the 'enum' keyword, if there is no tag). */
18190 /* If the next token is not '{' it is an opaque-enum-specifier or an
18191 elaborated-type-specifier. */
18193 {
18197 {
18198 /* The following catches invalid code such as:
18199 enum class S<int>::E { A, B, C }; */
18207 {
18211 nested_name_specifier);
18213 }
18216 {
18218 "%qT for enum declaration does not name a class "
18221 }
18222 /* If that scope does not contain the scope in which the
18223 class was originally declared, the program is invalid. */
18225 nested_name_specifier))
18226 {
18229 "declaration of %qD in namespace %qD which does not "
18232 else
18234 "declaration of %qD in %qD which does not "
18238 }
18239 /* If that scope is the scope where the declaration is being placed
18240 the program is invalid. */
18244 {
18248 }
18249 }
18254 /* Consume the opening brace. */
18255 matching_braces braces;
18262 {
18266 }
18267 else
18268 {
18274 }
18278 /* If the next token is not '}', then there are some enumerators. */
18280 {
18284 }
18285 else
18288 /* Consume the final '}'. */
18294 }
18295 else
18296 {
18297 /* If a ';' follows, then it is an opaque-enum-specifier
18298 and additional restrictions apply. */
18300 {
18307 }
18308 }
18310 /* Look for trailing attributes to apply to this enumeration, and
18311 apply them if appropriate. */
18313 {
18316 trailing_attr,
18318 }
18320 /* Finish up the enumeration. */
18322 {
18327 }
18330 {
18332 {
18335 }
18337 {
18339 }
18340 }
18341 out:
18344 }
18346 /* Parse an enumerator-list. The enumerators all have the indicated
18347 TYPE.
18349 enumerator-list:
18350 enumerator-definition
18351 enumerator-list , enumerator-definition */
18353 static void
18355 {
18357 {
18358 /* Parse an enumerator-definition. */
18361 /* If the next token is not a ',', we've reached the end of
18362 the list. */
18365 /* Otherwise, consume the `,' and keep going. */
18367 /* If the next token is a `}', there is a trailing comma. */
18369 {
18374 }
18375 }
18376 }
18378 /* Parse an enumerator-definition. The enumerator has the indicated
18379 TYPE.
18381 enumerator-definition:
18382 enumerator
18383 enumerator = constant-expression
18385 enumerator:
18386 identifier
18388 GNU Extensions:
18390 enumerator-definition:
18391 enumerator attributes [opt]
18392 enumerator attributes [opt] = constant-expression */
18394 static void
18396 {
18397 tree identifier;
18398 tree value;
18399 location_t loc;
18401 /* Save the input location because we are interested in the location
18402 of the identifier and not the location of the explicit value. */
18405 /* Look for the identifier. */
18410 /* Parse any specified attributes. */
18413 /* If the next token is an '=', then there is an explicit value. */
18415 {
18416 /* Consume the `=' token. */
18418 /* Parse the value. */
18420 }
18421 else
18424 /* If we are processing a template, make sure the initializer of the
18425 enumerator doesn't contain any bare template parameter pack. */
18429 /* Create the enumerator. */
18431 }
18433 /* Parse a namespace-name.
18435 namespace-name:
18436 original-namespace-name
18437 namespace-alias
18439 Returns the NAMESPACE_DECL for the namespace. */
18441 static tree
18443 {
18444 tree identifier;
18445 tree namespace_decl;
18449 /* Get the name of the namespace. */
18454 /* Look up the identifier in the currently active scope. Look only
18455 for namespaces, due to:
18457 [basic.lookup.udir]
18459 When looking up a namespace-name in a using-directive or alias
18460 definition, only namespace names are considered.
18462 And:
18464 [basic.lookup.qual]
18466 During the lookup of a name preceding the :: scope resolution
18467 operator, object, function, and enumerator names are ignored.
18469 (Note that cp_parser_qualifying_entity only calls this
18470 function if the token after the name is the scope resolution
18471 operator.) */
18473 none_type,
18479 /* If it's not a namespace, issue an error. */
18482 {
18484 {
18490 }
18493 }
18496 }
18498 /* Parse a namespace-definition.
18500 namespace-definition:
18501 named-namespace-definition
18502 unnamed-namespace-definition
18504 named-namespace-definition:
18505 original-namespace-definition
18506 extension-namespace-definition
18508 original-namespace-definition:
18509 namespace identifier { namespace-body }
18511 extension-namespace-definition:
18512 namespace original-namespace-name { namespace-body }
18514 unnamed-namespace-definition:
18515 namespace { namespace-body } */
18517 static void
18519 {
18520 tree identifier;
18529 {
18532 }
18534 /* Look for the `namespace' keyword. */
18535 cp_token* token
18538 /* Parse any specified attributes before the identifier. */
18542 {
18546 {
18549 /* Parse any attributes specified after the identifier. */
18551 }
18558 "nested namespace definitions only available with "
18561 /* Nested namespace names can create new namespaces (unlike
18562 other qualified-ids). */
18565 else
18568 }
18580 /* Start the namespace. */
18587 /* Look for the `{' to validate starting the namespace. */
18588 matching_braces braces;
18590 {
18591 /* Parse the body of the namespace. */
18594 /* Look for the final `}'. */
18596 }
18601 /* Pop the nested namespace definitions. */
18604 }
18606 /* Parse a namespace-body.
18608 namespace-body:
18609 declaration-seq [opt] */
18611 static void
18613 {
18615 }
18617 /* Parse a namespace-alias-definition.
18619 namespace-alias-definition:
18620 namespace identifier = qualified-namespace-specifier ; */
18622 static void
18624 {
18625 tree identifier;
18626 tree namespace_specifier;
18630 /* Look for the `namespace' keyword. */
18632 /* Look for the identifier. */
18636 /* Look for the `=' token. */
18639 {
18641 /* Skip the definition. */
18646 }
18648 /* Look for the qualified-namespace-specifier. */
18649 namespace_specifier
18651 /* Look for the `;' token. */
18654 /* Register the alias in the symbol table. */
18656 }
18658 /* Parse a qualified-namespace-specifier.
18660 qualified-namespace-specifier:
18661 :: [opt] nested-name-specifier [opt] namespace-name
18663 Returns a NAMESPACE_DECL corresponding to the specified
18664 namespace. */
18666 static tree
18668 {
18669 /* Look for the optional `::'. */
18673 /* Look for the optional nested-name-specifier. */
18681 }
18683 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18684 access declaration.
18686 using-declaration:
18687 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18688 using :: unqualified-id ;
18690 access-declaration:
18691 qualified-id ;
18693 */
18695 static bool
18698 {
18702 tree decl;
18703 tree identifier;
18704 tree qscope;
18709 {
18712 }
18713 else
18714 {
18715 /* Look for the `using' keyword. */
18718 again:
18719 /* Peek at the next token. */
18721 /* See if it's `typename'. */
18723 {
18724 /* Remember that we've seen it. */
18726 /* Consume the `typename' token. */
18728 }
18729 }
18731 /* Look for the optional global scope qualification. */
18732 global_scope_p
18737 /* If we saw `typename', or didn't see `::', then there must be a
18738 nested-name-specifier present. */
18740 {
18746 {
18749 }
18750 }
18751 /* Otherwise, we could be in either of the two productions. In that
18752 case, treat the nested-name-specifier as optional. */
18753 else
18765 /* Something has already gone wrong; there's no need to parse
18766 further. Since an error has occurred, the return value of
18767 cp_parser_parse_definitely will be false, as required. */
18771 /* Parse the unqualified-id. */
18779 {
18784 }
18786 {
18791 "pack expansion in using-declaration only available "
18794 }
18796 /* The function we call to handle a using-declaration is different
18797 depending on what scope we are in. */
18799 ;
18802 /* [namespace.udecl]
18804 A using declaration shall not name a template-id. */
18807 else
18808 {
18810 {
18811 /* Create the USING_DECL. */
18818 {
18821 }
18822 else
18823 /* Add it to the list of members in this class. */
18825 }
18826 else
18827 {
18829 identifier,
18836 {
18839 }
18842 else
18844 }
18845 }
18849 {
18853 "comma-separated list in using-declaration only available "
18856 }
18858 /* Look for the final `;'. */
18863 "access declarations are deprecated "
18864 "in favour of using-declarations; "
18868 }
18870 /* Parse an alias-declaration.
18872 alias-declaration:
18873 using identifier attribute-specifier-seq [opt] = type-id */
18875 static tree
18877 {
18879 location_t id_location;
18881 cp_decl_specifier_seq decl_specs;
18885 /* Look for the `using' keyword. */
18886 cp_token *using_token
18908 /* Now we are going to parse the type-id of the declaration. */
18910 /*
18911 [dcl.type]/3 says:
18913 "A type-specifier-seq shall not define a class or enumeration
18914 unless it appears in the type-id of an alias-declaration (7.1.3) that
18915 is not the declaration of a template-declaration."
18917 In other words, if we currently are in an alias template, the
18918 type-id should not define a type.
18920 So let's set parser->type_definition_forbidden_message in that
18921 case; cp_parser_check_type_definition (called by
18922 cp_parser_class_specifier) will then emit an error if a type is
18923 defined in the type-id. */
18925 {
18929 }
18933 /* Restore the error message if need be. */
18939 {
18942 }
18944 /* A typedef-name can also be introduced by an alias-declaration. The
18945 identifier following the using keyword becomes a typedef-name. It has
18946 the same semantics as if it were introduced by the typedef
18947 specifier. In particular, it does not define a new type and it shall
18948 not appear in the type-id. */
18953 {
18956 ds_attribute,
18957 attrs_token);
18958 }
18960 ds_typedef,
18961 using_token);
18963 ds_alias,
18964 using_token);
18973 else
18979 // Attach constraints to the alias declaration.
18981 {
18985 }
18992 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18993 added into the symbol table; otherwise, return the TYPE_DECL. */
18997 {
19001 }
19004 }
19006 /* Parse a using-directive.
19008 using-directive:
19009 using namespace :: [opt] nested-name-specifier [opt]
19010 namespace-name ; */
19012 static void
19014 {
19015 tree namespace_decl;
19016 tree attribs;
19018 /* Look for the `using' keyword. */
19020 /* And the `namespace' keyword. */
19022 /* Look for the optional `::' operator. */
19024 /* And the optional nested-name-specifier. */
19030 /* Get the namespace being used. */
19032 /* And any specified attributes. */
19035 /* Update the symbol table. */
19038 else
19041 /* Look for the final `;'. */
19043 }
19045 /* Parse an asm-definition.
19047 asm-definition:
19048 asm ( string-literal ) ;
19050 GNU Extension:
19052 asm-definition:
19053 asm volatile [opt] ( string-literal ) ;
19054 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19055 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19056 : asm-operand-list [opt] ) ;
19057 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19058 : asm-operand-list [opt]
19059 : asm-clobber-list [opt] ) ;
19060 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19061 : asm-clobber-list [opt]
19062 : asm-goto-list ) ; */
19064 static void
19066 {
19067 tree string;
19072 tree asm_stmt;
19080 /* Look for the `asm' keyword. */
19085 {
19088 }
19090 /* See if the next token is `volatile'. */
19093 {
19094 /* Remember that we saw the `volatile' keyword. */
19096 /* Consume the token. */
19098 }
19102 {
19103 /* Remember that we saw the `goto' keyword. */
19105 /* Consume the token. */
19107 }
19108 /* Look for the opening `('. */
19111 /* Look for the string. */
19114 {
19118 }
19120 /* If we're allowing GNU extensions, check for the extended assembly
19121 syntax. Unfortunately, the `:' tokens need not be separated by
19122 a space in C, and so, for compatibility, we tolerate that here
19123 too. Doing that means that we have to treat the `::' operator as
19124 two `:' tokens. */
19129 {
19134 /* The extended syntax was used. */
19137 /* Look for outputs. */
19139 {
19140 /* Consume the `:'. */
19142 /* Parse the output-operands. */
19144 CPP_COLON)
19146 CPP_SCOPE)
19148 CPP_CLOSE_PAREN)
19150 {
19154 }
19155 }
19156 /* If the next token is `::', there are no outputs, and the
19157 next token is the beginning of the inputs. */
19159 /* The inputs are coming next. */
19162 /* Look for inputs. */
19165 {
19166 /* Consume the `:' or `::'. */
19168 /* Parse the output-operands. */
19170 CPP_COLON)
19172 CPP_SCOPE)
19174 CPP_CLOSE_PAREN))
19175 {
19179 }
19180 }
19182 /* The clobbers are coming next. */
19185 /* Look for clobbers. */
19188 {
19190 /* Consume the `:' or `::'. */
19192 /* Parse the clobbers. */
19194 CPP_COLON)
19196 CPP_CLOSE_PAREN))
19198 }
19201 /* The labels are coming next. */
19204 /* Look for labels. */
19207 {
19209 /* Consume the `:' or `::'. */
19211 /* Parse the labels. */
19213 }
19217 }
19221 /* Look for the closing `)'. */
19229 {
19230 /* Create the ASM_EXPR. */
19232 {
19235 /* If the extended syntax was not used, mark the ASM_EXPR. */
19237 {
19243 }
19244 }
19245 else
19247 }
19248 }
19250 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19251 type that comes from the decl-specifier-seq. */
19253 static tree
19255 {
19258 {
19271 }
19274 }
19276 /* Declarators [gram.dcl.decl] */
19278 /* Parse an init-declarator.
19280 init-declarator:
19281 declarator initializer [opt]
19283 GNU Extension:
19285 init-declarator:
19286 declarator asm-specification [opt] attributes [opt] initializer [opt]
19288 function-definition:
19289 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19290 function-body
19291 decl-specifier-seq [opt] declarator function-try-block
19293 GNU Extension:
19295 function-definition:
19296 __extension__ function-definition
19298 TM Extension:
19300 function-definition:
19301 decl-specifier-seq [opt] declarator function-transaction-block
19303 The DECL_SPECIFIERS apply to this declarator. Returns a
19304 representation of the entity declared. If MEMBER_P is TRUE, then
19305 this declarator appears in a class scope. The new DECL created by
19306 this declarator is returned.
19308 The CHECKS are access checks that should be performed once we know
19309 what entity is being declared (and, therefore, what classes have
19310 befriended it).
19312 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19313 for a function-definition here as well. If the declarator is a
19314 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19315 be TRUE upon return. By that point, the function-definition will
19316 have been completely parsed.
19318 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19319 is FALSE.
19321 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19322 parsed declaration if it is an uninitialized single declarator not followed
19323 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19324 if present, will not be consumed. If returned, this declarator will be
19325 created with SD_INITIALIZED but will not call cp_finish_decl.
19327 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19328 and there is an initializer, the pointed location_t is set to the
19329 location of the '=' or `(', or '{' in C++11 token introducing the
19330 initializer. */
19332 static tree
19343 {
19347 tree prefix_attributes;
19349 tree asm_specification;
19350 tree initializer;
19352 tree scope;
19354 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19355 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19356 "(...)". */
19367 /* Gather the attributes that were provided with the
19368 decl-specifiers. */
19371 /* Assume that this is not the declarator for a function
19372 definition. */
19376 /* Default arguments are only permitted for function parameters. */
19380 /* Defer access checks while parsing the declarator; we cannot know
19381 what names are accessible until we know what is being
19382 declared. */
19387 /* Parse the declarator. */
19388 declarator
19393 /* Gather up the deferred checks. */
19398 /* If the DECLARATOR was erroneous, there's no need to go
19399 further. */
19403 /* Check that the number of template-parameter-lists is OK. */
19413 /* Figure out what scope the entity declared by the DECLARATOR is
19414 located in. `grokdeclarator' sometimes changes the scope, so
19415 we compute it now. */
19418 /* Perform any lookups in the declared type which were thought to be
19419 dependent, but are not in the scope of the declarator. */
19420 decl_specifiers->type
19423 /* If we're allowing GNU extensions, look for an
19424 asm-specification. */
19426 {
19427 /* Look for an asm-specification. */
19430 }
19431 else
19434 /* Look for attributes. */
19438 /* Peek at the next token. */
19444 {
19445 /* Handle C++17 deduction guides. */
19449 {
19457 {
19461 }
19462 }
19464 /* Check to see if the token indicates the start of a
19465 function-definition. */
19467 {
19469 {
19470 /* If a function-definition should not appear here, issue an
19471 error message. */
19475 }
19477 location_t func_brace_location
19480 /* Neither attributes nor an asm-specification are allowed
19481 on a function-definition. */
19484 "an asm-specification is not allowed "
19488 "attributes are not allowed "
19490 /* This is a function-definition. */
19493 /* Parse the function definition. */
19496 decl_specifiers,
19497 declarator,
19498 prefix_attributes);
19499 else
19500 decl =
19501 (cp_parser_function_definition_from_specifiers_and_declarator
19505 {
19506 /* This is where the prologue starts... */
19509 }
19512 }
19513 }
19515 {
19516 /* A non-template declaration involving a function parameter list
19517 containing an implicit template parameter will be made into a
19518 template. If the resulting declaration is not going to be an
19519 actual function then finish the template scope here to prevent it.
19520 An error message will be issued once we have a decl to talk about.
19522 FIXME probably we should do type deduction rather than create an
19523 implicit template, but the standard currently doesn't allow it. */
19526 }
19528 /* [dcl.dcl]
19530 Only in function declarations for constructors, destructors, type
19531 conversions, and deduction guides can the decl-specifier-seq be omitted.
19533 We explicitly postpone this check past the point where we handle
19534 function-definitions because we tolerate function-definitions
19535 that are missing their return types in some modes. */
19537 {
19541 }
19543 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19547 {
19558 {
19564 }
19565 }
19566 else
19567 {
19568 /* If the init-declarator isn't initialized and isn't followed by a
19569 `,' or `;', it's not a valid init-declarator. */
19572 {
19575 else
19576 {
19580 }
19581 }
19584 }
19586 /* Because start_decl has side-effects, we should only call it if we
19587 know we're going ahead. By this point, we know that we cannot
19588 possibly be looking at any other construct. */
19591 /* Enter the newly declared entry in the symbol table. If we're
19592 processing a declaration in a class-specifier, we wait until
19593 after processing the initializer. */
19595 {
19603 /* Adjust location of decl if declarator->id_loc is more appropriate:
19604 set, and decl wasn't merged with another decl, in which case its
19605 location would be different from input_location, and more accurate. */
19610 }
19612 /* Enter the SCOPE. That way unqualified names appearing in the
19613 initializer will be looked up in SCOPE. */
19616 /* Perform deferred access control checks, now that we know in which
19617 SCOPE the declared entity resides. */
19619 {
19622 /* If the entity being declared is a function, pretend that we
19623 are in its scope. If it is a `friend', it may have access to
19624 things that would not otherwise be accessible. */
19626 {
19629 }
19631 /* Perform access checks for template parameters. */
19634 /* Perform the access control checks for the declarator and the
19635 decl-specifiers. */
19638 /* Restore the saved value. */
19641 }
19643 /* Parse the initializer. */
19648 {
19650 {
19653 else
19654 {
19655 /* If the declaration was erroneous, we don't really
19656 know what the user intended, so just silently
19657 consume the initializer. */
19664 }
19665 }
19666 else
19667 {
19668 /* We want to record the extra mangling scope for in-class
19669 initializers of class members and initializers of static data
19670 member templates. The former involves deferring
19671 parsing of the initializer until end of class as with default
19672 arguments. So right here we only handle the latter. */
19682 }
19683 }
19685 /* The old parser allows attributes to appear after a parenthesized
19686 initializer. Mark Mitchell proposed removing this functionality
19687 on the GCC mailing lists on 2002-08-13. This parser accepts the
19688 attributes -- but ignores them. Made a permerror in GCC 8. */
19694 {
19697 {
19701 }
19702 }
19704 /* And now complain about a non-function implicit template. */
19709 /* For an in-class declaration, use `grokfield' to create the
19710 declaration. */
19712 {
19714 {
19717 }
19726 }
19728 /* Finish processing the declaration. But, skip member
19729 declarations. */
19731 {
19734 asm_specification,
19735 /* If the initializer is in parentheses, then this is
19736 a direct-initialization, which means that an
19737 `explicit' constructor is OK. Otherwise, an
19738 `explicit' constructor cannot be used. */
19741 }
19744 /* Core issue #226 (C++0x only): A default template-argument
19745 shall not be specified in a friend class template
19746 declaration. */
19755 {
19758 else
19760 }
19767 }
19769 /* Parse a declarator.
19771 declarator:
19772 direct-declarator
19773 ptr-operator declarator
19775 abstract-declarator:
19776 ptr-operator abstract-declarator [opt]
19777 direct-abstract-declarator
19779 GNU Extensions:
19781 declarator:
19782 attributes [opt] direct-declarator
19783 attributes [opt] ptr-operator declarator
19785 abstract-declarator:
19786 attributes [opt] ptr-operator abstract-declarator [opt]
19787 attributes [opt] direct-abstract-declarator
19789 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19790 detect constructors, destructors, deduction guides, or conversion operators.
19791 It is set to -1 if the declarator is a name, and +1 if it is a
19792 function. Otherwise it is set to zero. Usually you just want to
19793 test for >0, but internally the negative value is used.
19795 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19796 a decl-specifier-seq unless it declares a constructor, destructor,
19797 or conversion. It might seem that we could check this condition in
19798 semantic analysis, rather than parsing, but that makes it difficult
19799 to handle something like `f()'. We want to notice that there are
19800 no decl-specifiers, and therefore realize that this is an
19801 expression, not a declaration.)
19803 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19804 the declarator is a direct-declarator of the form "(...)".
19806 MEMBER_P is true iff this declarator is a member-declarator.
19808 FRIEND_P is true iff this declarator is a friend. */
19812 cp_parser_declarator_kind dcl_kind,
19816 {
19819 cp_cv_quals cv_quals;
19820 tree class_type;
19823 /* Assume this is not a constructor, destructor, or type-conversion
19824 operator. */
19831 /* Check for the ptr-operator production. */
19833 /* Parse the ptr-operator. */
19839 /* If that worked, then we have a ptr-operator. */
19841 {
19842 /* If a ptr-operator was found, then this declarator was not
19843 parenthesized. */
19846 /* The dependent declarator is optional if we are parsing an
19847 abstract-declarator. */
19851 /* Parse the dependent declarator. */
19856 friend_p);
19858 /* If we are parsing an abstract-declarator, we must handle the
19859 case where the dependent declarator is absent. */
19864 declarator = cp_parser_make_indirect_declarator
19866 }
19867 /* Everything else is a direct-declarator. */
19868 else
19869 {
19872 CPP_OPEN_PAREN);
19874 ctor_dtor_or_conv_p,
19876 }
19881 }
19883 /* Parse a direct-declarator or direct-abstract-declarator.
19885 direct-declarator:
19886 declarator-id
19887 direct-declarator ( parameter-declaration-clause )
19888 cv-qualifier-seq [opt]
19889 ref-qualifier [opt]
19890 exception-specification [opt]
19891 direct-declarator [ constant-expression [opt] ]
19892 ( declarator )
19894 direct-abstract-declarator:
19895 direct-abstract-declarator [opt]
19896 ( parameter-declaration-clause )
19897 cv-qualifier-seq [opt]
19898 ref-qualifier [opt]
19899 exception-specification [opt]
19900 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19901 ( abstract-declarator )
19903 Returns a representation of the declarator. DCL_KIND is
19904 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19905 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19906 we are parsing a direct-declarator. It is
19907 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19908 of ambiguity we prefer an abstract declarator, as per
19909 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19910 as for cp_parser_declarator. */
19914 cp_parser_declarator_kind dcl_kind,
19917 {
19928 {
19929 /* Peek at the next token. */
19932 {
19933 /* This is either a parameter-declaration-clause, or a
19934 parenthesized declarator. When we know we are parsing a
19935 named declarator, it must be a parenthesized declarator
19936 if FIRST is true. For instance, `(int)' is a
19937 parameter-declaration-clause, with an omitted
19938 direct-abstract-declarator. But `((*))', is a
19939 parenthesized abstract declarator. Finally, when T is a
19940 template parameter `(T)' is a
19941 parameter-declaration-clause, and not a parenthesized
19942 named declarator.
19944 We first try and parse a parameter-declaration-clause,
19945 and then try a nested declarator (if FIRST is true).
19947 It is not an error for it not to be a
19948 parameter-declaration-clause, even when FIRST is
19949 false. Consider,
19951 int i (int);
19952 int i (3);
19954 The first is the declaration of a function while the
19955 second is the definition of a variable, including its
19956 initializer.
19958 Having seen only the parenthesis, we cannot know which of
19959 these two alternatives should be selected. Even more
19960 complex are examples like:
19962 int i (int (a));
19963 int i (int (3));
19965 The former is a function-declaration; the latter is a
19966 variable initialization.
19968 Thus again, we try a parameter-declaration-clause, and if
19969 that fails, we back out and return. */
19972 {
19973 tree params;
19978 /* In a member-declarator, the only valid interpretation
19979 of a parenthesis is the start of a
19980 parameter-declaration-clause. (It is invalid to
19981 initialize a static data member with a parenthesized
19982 initializer; only the "=" form of initialization is
19983 permitted.) */
19987 /* Consume the `('. */
19988 matching_parens parens;
19991 {
19992 /* If this is going to be an abstract declarator, we're
19993 in a declarator and we can't have default args. */
19996 }
20000 /* Parse the parameter-declaration-clause. */
20003 /* Consume the `)'. */
20006 /* If all went well, parse the cv-qualifier-seq,
20007 ref-qualifier and the exception-specification. */
20009 {
20010 cp_cv_quals cv_quals;
20011 cp_virt_specifiers virt_specifiers;
20012 cp_ref_qualifier ref_qual;
20013 tree exception_specification;
20014 tree late_return;
20015 tree attrs;
20025 /* Parse the cv-qualifier-seq. */
20027 /* Parse the ref-qualifier. */
20029 /* Parse the tx-qualifier. */
20031 /* And the exception-specification. */
20032 exception_specification
20037 /* In here, we handle cases where attribute is used after
20038 the function declaration. For example:
20039 void func (int x) __attribute__((vector(..))); */
20042 late_return = (cp_parser_late_return_type_opt
20046 /* Parse the virt-specifier-seq. */
20049 /* Create the function-declarator. */
20051 params,
20052 cv_quals,
20053 virt_specifiers,
20054 ref_qual,
20055 tx_qual,
20056 exception_specification,
20057 late_return,
20058 requires_clause);
20061 /* Any subsequent parameter lists are to do with
20062 return type, so are not those of the declared
20063 function. */
20065 }
20067 /* Remove the function parms from scope. */
20071 /* Repeat the main loop. */
20073 }
20075 /* If this is the first, we can try a parenthesized
20076 declarator. */
20078 {
20085 /* Consume the `('. */
20086 matching_parens parens;
20088 /* Parse the nested declarator. */
20091 declarator
20097 /* Expect a `)'. */
20105 }
20106 /* Otherwise, we must be done. */
20107 else
20109 }
20113 {
20114 /* Parse an array-declarator. */
20124 /* Consume the `['. */
20126 /* Peek at the next token. */
20128 /* If the next token is `]', then there is no
20129 constant-expression. */
20131 {
20133 bounds
20143 {
20144 /* Normally, the array bound must be an integral constant
20145 expression. However, as an extension, we allow VLAs
20146 in function scopes as long as they aren't part of a
20147 parameter declaration. */
20151 }
20154 {
20155 /* Remember this wasn't a constant-expression. */
20158 }
20159 }
20160 else
20162 /* Look for the closing `]'. */
20164 {
20167 }
20172 }
20174 {
20175 {
20176 tree qualifying_scope;
20177 tree unqualified_name;
20178 tree attrs;
20179 special_function_kind sfk;
20184 /* Parse a declarator-id */
20187 {
20190 /* If we see an ellipsis, we should be looking at a
20191 parameter pack. */
20193 {
20194 /* Consume the `...' */
20198 }
20199 }
20202 unqualified_name
20206 {
20210 {
20211 /* Check whether an error occurred. */
20214 /* We already consumed the ellipsis to mark a
20215 parameter pack, but we have no way to report it,
20216 so abort the tentative parse. We will be exiting
20217 immediately anyway. */
20219 }
20220 else
20226 && (qualifying_scope
20228 {
20231 }
20232 }
20237 {
20242 }
20248 {
20249 /* In the declaration of a member of a template class
20250 outside of the class itself, the SCOPE will sometimes
20251 be a TYPENAME_TYPE. For example, given:
20253 template <typename T>
20254 int S<T>::R::i = 3;
20256 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20257 this context, we must resolve S<T>::R to an ordinary
20258 type, rather than a typename type.
20260 The reason we normally avoid resolving TYPENAME_TYPEs
20261 is that a specialization of `S' might render
20262 `S<T>::R' not a type. However, if `S' is
20263 specialized, then this `i' will not be used, so there
20264 is no harm in resolving the types here. */
20265 tree type;
20267 /* Resolve the TYPENAME_TYPE. */
20270 /* If that failed, the declarator is invalid. */
20272 {
20275 "cannot define member of dependent typedef "
20277 else
20282 }
20284 }
20289 {
20290 tree class_type;
20295 else
20299 {
20303 {
20304 /* We do not attempt to print the declarator
20305 here because we do not have enough
20306 information about its original syntactic
20307 form. */
20311 }
20314 {
20318 "use %<%T::%D%> instead of %<%T::%D%> to "
20320 class_type,
20325 }
20327 }
20330 {
20337 for an unnamed type, even if the type
20338 got a name for linkage purposes. */
20340 /* Handle correctly (c++/19200):
20342 struct S {
20343 struct T{};
20344 friend void S(T);
20345 };
20347 and also:
20349 namespace N {
20350 void S();
20351 }
20353 struct S {
20354 friend void N::S();
20355 }; */
20358 class_type))
20367 }
20368 }
20370 unqualified_name,
20371 sfk);
20378 }
20380 handle_declarator:;
20383 {
20384 /* Any names that appear after the declarator-id for a
20385 member are looked up in the containing scope. */
20387 {
20388 /* But declarations with qualified-ids can't appear in a
20389 function. */
20393 }
20395 }
20399 /* Default args are only allowed on function
20400 declarations. */
20402 else
20406 }
20407 /* We're done. */
20408 else
20410 }
20412 /* For an abstract declarator, we might wind up with nothing at this
20413 point. That's an error; the declarator is not optional. */
20417 {
20418 /* Record overly parenthesized declarator so we can give a
20419 diagnostic about confusing decl/expr disambiguation. */
20421 {
20422 /* If the open and close parens are on different lines, this
20423 is probably a formatting thing, so ignore. */
20428 }
20431 }
20433 /* If we entered a scope, we must exit it now. */
20441 }
20443 /* Parse a ptr-operator.
20445 ptr-operator:
20446 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20447 * cv-qualifier-seq [opt]
20448 &
20449 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20450 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20452 GNU Extension:
20454 ptr-operator:
20455 & cv-qualifier-seq [opt]
20457 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20458 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20459 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20460 filled in with the TYPE containing the member. *CV_QUALS is
20461 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20462 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20463 Note that the tree codes returned by this function have nothing
20464 to do with the types of trees that will be eventually be created
20465 to represent the pointer or reference type being parsed. They are
20466 just constants with suggestive names. */
20467 static enum tree_code
20472 {
20477 /* Assume that it's not a pointer-to-member. */
20479 /* And that there are no cv-qualifiers. */
20482 /* Peek at the next token. */
20485 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20495 {
20496 /* Consume the `*', `&' or `&&'. */
20499 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20500 `&', if we are allowing GNU extensions. (The only qualifier
20501 that can legally appear after `&' is `restrict', but that is
20502 enforced during semantic analysis. */
20510 }
20511 else
20512 {
20513 /* Try the pointer-to-member case. */
20515 /* Look for the optional `::' operator. */
20518 /* Look for the nested-name specifier. */
20525 /* If we found it, and the next token is a `*', then we are
20526 indeed looking at a pointer-to-member operator. */
20529 {
20530 /* Indicate that the `*' operator was used. */
20538 else
20539 {
20540 /* The type of which the member is a member is given by the
20541 current SCOPE. */
20543 /* The next name will not be qualified. */
20547 /* Look for optional c++11 attributes. */
20551 /* Look for the optional cv-qualifier-seq. */
20553 }
20554 }
20555 /* If that didn't work we don't have a ptr-operator. */
20558 }
20561 }
20563 /* Parse an (optional) cv-qualifier-seq.
20565 cv-qualifier-seq:
20566 cv-qualifier cv-qualifier-seq [opt]
20568 cv-qualifier:
20569 const
20570 volatile
20572 GNU Extension:
20574 cv-qualifier:
20575 __restrict__
20577 Returns a bitmask representing the cv-qualifiers. */
20579 static cp_cv_quals
20581 {
20585 {
20587 cp_cv_quals cv_qualifier;
20589 /* Peek at the next token. */
20591 /* See if it's a cv-qualifier. */
20593 {
20609 }
20615 {
20620 }
20621 else
20622 {
20625 }
20626 }
20629 }
20631 /* Parse an (optional) ref-qualifier
20633 ref-qualifier:
20634 &
20635 &&
20637 Returns cp_ref_qualifier representing ref-qualifier. */
20639 static cp_ref_qualifier
20641 {
20644 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20649 {
20654 {
20666 }
20671 {
20674 }
20675 else
20676 {
20679 }
20680 }
20683 }
20685 /* Parse an optional tx-qualifier.
20687 tx-qualifier:
20688 transaction_safe
20689 transaction_safe_dynamic */
20691 static tree
20693 {
20696 {
20701 {
20705 {
20708 {
20711 }
20712 else
20714 }
20715 }
20716 }
20718 }
20720 /* Parse an (optional) virt-specifier-seq.
20722 virt-specifier-seq:
20723 virt-specifier virt-specifier-seq [opt]
20725 virt-specifier:
20726 override
20727 final
20729 Returns a bitmask representing the virt-specifiers. */
20731 static cp_virt_specifiers
20733 {
20737 {
20739 cp_virt_specifiers virt_specifier;
20741 /* Peek at the next token. */
20743 /* See if it's a virt-specifier-qualifier. */
20747 {
20750 }
20752 {
20755 }
20757 {
20759 }
20760 else
20764 {
20769 }
20770 else
20771 {
20774 }
20775 }
20777 }
20779 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20780 is in scope even though it isn't real. */
20782 void
20784 {
20785 tree this_parm;
20788 {
20789 /* We don't clear this between NSDMIs. Is it already what we want? */
20796 }
20799 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20801 current_class_ref
20804 }
20806 /* Return true iff our current scope is a non-static data member
20807 initializer. */
20809 bool
20811 {
20812 /* We recognize NSDMI context by the context-less 'this' pointer set up
20813 by the function above. */
20819 }
20821 /* Parse a late-specified return type, if any. This is not a separate
20822 non-terminal, but part of a function declarator, which looks like
20824 -> trailing-type-specifier-seq abstract-declarator(opt)
20826 Returns the type indicated by the type-id.
20828 In addition to this, parse any queued up #pragma omp declare simd
20829 clauses, and #pragma acc routine clauses.
20831 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20832 function. */
20834 static tree
20837 {
20841 && declarator
20845 && declarator
20848 /* Peek at the next token. */
20850 /* A late-specified return type is indicated by an initial '->'. */
20861 {
20862 /* DR 1207: 'this' is in scope in the trailing return type. */
20864 }
20867 {
20868 /* Consume the ->. */
20872 }
20874 /* Function declarations may be followed by a trailing
20875 requires-clause. */
20879 declarator->attributes
20883 declarator->attributes
20888 {
20891 }
20894 }
20896 /* Parse a declarator-id.
20898 declarator-id:
20899 id-expression
20900 :: [opt] nested-name-specifier [opt] type-name
20902 In the `id-expression' case, the value returned is as for
20903 cp_parser_id_expression if the id-expression was an unqualified-id.
20904 If the id-expression was a qualified-id, then a SCOPE_REF is
20905 returned. The first operand is the scope (either a NAMESPACE_DECL
20906 or TREE_TYPE), but the second is still just a representation of an
20907 unqualified-id. */
20909 static tree
20911 {
20912 tree id;
20913 /* The expression must be an id-expression. Assume that qualified
20914 names are the names of types so that:
20916 template <class T>
20917 int S<T>::R::i = 3;
20919 will work; we must treat `S<T>::R' as the name of a type.
20920 Similarly, assume that qualified names are templates, where
20921 required, so that:
20923 template <class T>
20924 int S<T>::R<T>::i = 3;
20926 will work, too. */
20932 optional_p);
20936 }
20938 /* Parse a type-id.
20940 type-id:
20941 type-specifier-seq abstract-declarator [opt]
20943 Returns the TYPE specified. */
20945 static tree
20948 {
20949 cp_decl_specifier_seq type_specifier_seq;
20952 /* Parse the type-specifier-seq. */
20954 is_trailing_return,
20959 /* A bare template name as a template argument is a template template
20960 argument, not a placeholder, so fail parsing it as a type argument. */
20961 {
20965 }
20969 /* There might or might not be an abstract declarator. */
20971 /* Look for the declarator. */
20972 abstract_declarator
20977 /* Check to see if there really was a declarator. */
20982 /* The concepts TS allows 'auto' as a type-id. */
20984 /* None of the valid uses of 'auto' in C++14 involve the type-id
20985 nonterminal, but it is valid in a trailing-return-type. */
20988 {
20989 /* A type-id with type 'auto' is only ok if the abstract declarator
20990 is a function declarator with a late-specified return type.
20992 A type-id with 'auto' is also valid in a trailing-return-type
20993 in a compound-requirement. */
21000 else
21001 {
21004 {
21006 auto_node);
21008 tmpl);
21009 }
21010 else
21013 }
21014 }
21017 is_template_arg);
21018 }
21020 static tree
21022 {
21024 }
21026 static tree
21028 {
21029 tree r;
21031 parser->type_definition_forbidden_message
21036 {
21039 }
21041 }
21043 static tree
21045 {
21047 }
21049 /* Parse a type-specifier-seq.
21051 type-specifier-seq:
21052 type-specifier type-specifier-seq [opt]
21054 GNU extension:
21056 type-specifier-seq:
21057 attributes type-specifier-seq [opt]
21059 If IS_DECLARATION is true, we are at the start of a "condition" or
21060 exception-declaration, so we might be followed by a declarator-id.
21062 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21063 i.e. we've just seen "->".
21065 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21067 static void
21072 {
21077 /* Clear the TYPE_SPECIFIER_SEQ. */
21080 /* In the context of a trailing return type, enum E { } is an
21081 elaborated-type-specifier followed by a function-body, not an
21082 enum-specifier. */
21086 /* Parse the type-specifiers and attributes. */
21088 {
21089 tree type_specifier;
21092 /* Check for attributes first. */
21094 {
21095 type_specifier_seq->attributes
21099 }
21101 /* record the token of the beginning of the type specifier seq,
21102 for error reporting purposes*/
21106 /* Look for the type-specifier. */
21108 flags,
21109 type_specifier_seq,
21111 NULL,
21114 {
21115 /* If the first type-specifier could not be found, this is not a
21116 type-specifier-seq at all. */
21118 {
21119 /* Set in_declarator_p to avoid skipping to the semicolon. */
21131 }
21132 /* If subsequent type-specifiers could not be found, the
21133 type-specifier-seq is complete. */
21135 }
21138 /* The standard says that a condition can be:
21140 type-specifier-seq declarator = assignment-expression
21142 However, given:
21144 struct S {};
21145 if (int S = ...)
21147 we should treat the "S" as a declarator, not as a
21148 type-specifier. The standard doesn't say that explicitly for
21149 type-specifier-seq, but it does say that for
21150 decl-specifier-seq in an ordinary declaration. Perhaps it
21151 would be clearer just to allow a decl-specifier-seq here, and
21152 then add a semantic restriction that if any decl-specifiers
21153 that are not type-specifiers appear, the program is invalid. */
21156 }
21157 }
21159 /* Return whether the function currently being declared has an associated
21160 template parameter list. */
21162 static bool
21164 {
21177 }
21179 /* Parse a parameter-declaration-clause.
21181 parameter-declaration-clause:
21182 parameter-declaration-list [opt] ... [opt]
21183 parameter-declaration-list , ...
21185 Returns a representation for the parameter declarations. A return
21186 value of NULL indicates a parameter-declaration-clause consisting
21187 only of an ellipsis. */
21189 static tree
21191 {
21192 tree parameters;
21201 parser->auto_is_implicit_function_template_parm_p
21203 }
21209 && !processing_template_parmlist
21210 && !processing_explicit_instantiation
21211 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21212 actual function or a random abstract declarator. */
21218 /* Peek at the next token. */
21220 /* Check for trivial parameter-declaration-clauses. */
21222 {
21223 /* Consume the `...' token. */
21226 }
21228 /* There are no parameters. */
21229 {
21230 #ifndef NO_IMPLICIT_EXTERN_C
21235 else
21236 #endif
21238 }
21239 /* Check for `(void)', too, which is a special case. */
21243 {
21244 /* Consume the `void' token. */
21246 /* There are no parameters. */
21248 }
21250 /* Parse the parameter-declaration-list. */
21252 /* If a parse error occurred while parsing the
21253 parameter-declaration-list, then the entire
21254 parameter-declaration-clause is erroneous. */
21258 /* Peek at the next token. */
21260 /* If it's a `,', the clause should terminate with an ellipsis. */
21262 {
21263 /* Consume the `,'. */
21265 /* Expect an ellipsis. */
21266 ellipsis_p
21268 }
21269 /* It might also be `...' if the optional trailing `,' was
21270 omitted. */
21272 {
21273 /* Consume the `...' token. */
21275 /* And remember that we saw it. */
21277 }
21278 else
21281 /* Finish the parameter list. */
21286 }
21288 /* Parse a parameter-declaration-list.
21290 parameter-declaration-list:
21291 parameter-declaration
21292 parameter-declaration-list , parameter-declaration
21294 Returns a representation of the parameter-declaration-list, as for
21295 cp_parser_parameter_declaration_clause. However, the
21296 `void_list_node' is never appended to the list. Upon return,
21297 *IS_ERROR will be true iff an error occurred. */
21299 static tree
21301 {
21307 /* Assume all will go well. */
21309 /* The special considerations that apply to a function within an
21310 unbraced linkage specifications do not apply to the parameters
21311 to the function. */
21312 saved_in_unbraced_linkage_specification_p
21316 /* Look for more parameters. */
21318 {
21326 /* Parse the parameter. */
21327 parameter
21332 /* We don't know yet if the enclosing context is deprecated, so wait
21333 and warn in grokparms if appropriate. */
21337 {
21338 /* If a function parameter pack was specified and an implicit template
21339 parameter was introduced during cp_parser_parameter_declaration,
21340 change any implicit parameters introduced into packs. */
21344 {
21352 }
21356 PARM,
21361 }
21365 /* If a parse error occurred parsing the parameter declaration,
21366 then the entire parameter-declaration-list is erroneous. */
21368 {
21372 }
21382 {
21386 }
21388 /* Add the new parameter to the list. */
21392 /* Peek at the next token. */
21395 /* These are for Objective-C++ */
21398 /* The parameter-declaration-list is complete. */
21401 {
21404 /* Peek at the next token. */
21406 /* If it's an ellipsis, then the list is complete. */
21409 /* Otherwise, there must be more parameters. Consume the
21410 `,'. */
21412 /* When parsing something like:
21414 int i(float f, double d)
21416 we can tell after seeing the declaration for "f" that we
21417 are not looking at an initialization of a variable "i",
21418 but rather at the declaration of a function "i".
21420 Due to the fact that the parsing of template arguments
21421 (as specified to a template-id) requires backtracking we
21422 cannot use this technique when inside a template argument
21423 list. */
21427 /* However, a parameter-declaration of the form
21428 "float(f)" (which is a valid declaration of a
21429 parameter "f") can also be interpreted as an
21430 expression (the conversion of "f" to "float"). */
21433 }
21434 else
21435 {
21443 }
21444 }
21446 parser->in_unbraced_linkage_specification_p
21449 /* Reset implicit_template_scope if we are about to leave the function
21450 parameter list that introduced it. Note that for out-of-line member
21451 definitions, there will be one or more class scopes before we get to
21452 the template parameter scope. */
21456 {
21460 {
21463 }
21464 }
21467 }
21469 /* Parse a parameter declaration.
21471 parameter-declaration:
21472 decl-specifier-seq ... [opt] declarator
21473 decl-specifier-seq declarator = assignment-expression
21474 decl-specifier-seq ... [opt] abstract-declarator [opt]
21475 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21477 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21478 declares a template parameter. (In that case, a non-nested `>'
21479 token encountered during the parsing of the assignment-expression
21480 is not interpreted as a greater-than operator.)
21482 Returns a representation of the parameter, or NULL if an error
21483 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21484 true iff the declarator is of the form "(p)". */
21490 {
21492 cp_decl_specifier_seq decl_specifiers;
21494 tree default_argument;
21499 /* In a template parameter, `>' is not an operator.
21501 [temp.param]
21503 When parsing a default template-argument for a non-type
21504 template-parameter, the first non-nested `>' is taken as the end
21505 of the template parameter-list rather than a greater-than
21506 operator. */
21508 /* Type definitions may not appear in parameter types. */
21510 parser->type_definition_forbidden_message
21513 /* Parse the declaration-specifiers. */
21516 CP_PARSER_FLAGS_NONE,
21520 /* Complain about missing 'typename' or other invalid type names. */
21525 /* If an error occurred, there's no reason to attempt to parse the
21526 rest of the declaration. */
21528 {
21531 }
21533 /* Peek at the next token. */
21536 /* If the next token is a `)', `,', `=', `>', or `...', then there
21537 is no declarator. However, when variadic templates are enabled,
21538 there may be a declarator following `...'. */
21543 {
21547 }
21548 /* Otherwise, there should be a declarator. */
21549 else
21550 {
21554 /* After seeing a decl-specifier-seq, if the next token is not a
21555 "(", there is no possibility that the code is a valid
21556 expression. Therefore, if parsing tentatively, we commit at
21557 this point. */
21559 /* In an expression context, having seen:
21561 (int((char ...
21563 we cannot be sure whether we are looking at a
21564 function-type (taking a "char" as a parameter) or a cast
21565 of some object of type "char" to "int". */
21571 /* Parse the declarator. */
21574 CP_PARSER_DECLARATOR_EITHER,
21576 parenthesized_p,
21580 /* After the declarator, allow more attributes. */
21581 decl_specifiers.attributes
21585 /* If the declarator is a template parameter pack, remember that and
21586 clear the flag in the declarator itself so we don't get errors
21587 from grokdeclarator. */
21589 {
21592 }
21593 }
21595 /* If the next token is an ellipsis, and we have not seen a declarator
21596 name, and if either the type of the declarator contains parameter
21597 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21598 for, eg, abbreviated integral type names), then we actually have a
21599 parameter pack expansion expression. Otherwise, leave the ellipsis
21600 for a C-style variadic function. */
21603 {
21614 {
21615 /* Consume the `...'. */
21619 /* Build a pack expansion type */
21624 else
21626 }
21627 }
21629 /* The restriction on defining new types applies only to the type
21630 of the parameter, not to the default argument. */
21633 /* If the next token is `=', then process a default argument. */
21635 {
21638 /* If we are defining a class, then the tokens that make up the
21639 default argument must be saved and processed later. */
21645 // A constrained-type-specifier may declare a type template-parameter.
21647 default_argument
21650 // A constrained-type-specifier may declare a template-template-parameter.
21652 default_argument
21655 /* Outside of a class definition, we can just parse the
21656 assignment-expression. */
21657 else
21658 default_argument
21662 {
21664 "default arguments are only "
21666 }
21668 || template_parameter_pack_p
21671 {
21672 /* Find the name of the parameter pack. */
21679 template_parm_p
21685 else
21687 template_parm_p
21694 }
21695 }
21696 else
21699 /* Generate a location for the parameter, ranging from the start of the
21700 initial token to the end of the final token (using input_location for
21701 the latter, set up by cp_lexer_set_source_position_from_token when
21702 consuming tokens).
21704 If we have a identifier, then use it for the caret location, e.g.
21706 extern int callee (int one, int (*two)(int, int), float three);
21707 ~~~~~~^~~~~~~~~~~~~~
21709 otherwise, reuse the start location for the caret location e.g.:
21711 extern int callee (int one, int (*)(int, int), float three);
21712 ^~~~~~~~~~~~~~~~~
21714 */
21720 input_location);
21723 declarator,
21724 default_argument,
21725 param_loc,
21726 template_parameter_pack_p);
21727 }
21729 /* Parse a default argument and return it.
21731 TEMPLATE_PARM_P is true if this is a default argument for a
21732 non-type template parameter. */
21733 static tree
21735 {
21741 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21742 set correctly. */
21745 /* Local variable names (and the `this' keyword) may not
21746 appear in a default argument. */
21749 /* Parse the assignment-expression. */
21754 /* The "this" pointer is not valid in a default argument. */
21756 {
21761 }
21762 default_argument
21764 /* Restore the "this" pointer. */
21766 {
21769 }
21778 }
21780 /* Parse a function-body.
21782 function-body:
21783 compound_statement */
21785 static void
21787 {
21791 }
21793 /* Parse a ctor-initializer-opt followed by a function-body. Return
21794 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21795 is true we are parsing a function-try-block. */
21797 static void
21800 {
21807 /* Begin the function body. */
21809 /* Parse the optional ctor-initializer. */
21812 /* If we're parsing a constexpr constructor definition, we need
21813 to check that the constructor body is indeed empty. However,
21814 before we get to cp_parser_function_body lot of junk has been
21815 generated, so we can't just check that we have an empty block.
21816 Rather we take a snapshot of the outermost block, and check whether
21817 cp_parser_function_body changed its state. */
21819 {
21823 }
21824 /* Parse the function-body. */
21828 /* Finish the function body. */
21830 }
21832 /* Parse an initializer.
21834 initializer:
21835 = initializer-clause
21836 ( expression-list )
21838 Returns an expression representing the initializer. If no
21839 initializer is present, NULL_TREE is returned.
21841 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21842 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21843 set to TRUE if there is no initializer present. If there is an
21844 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21845 is set to true; otherwise it is set to false. */
21847 static tree
21850 {
21852 tree init;
21854 /* Peek at the next token. */
21857 /* Let our caller know whether or not this initializer was
21858 parenthesized. */
21860 /* Assume that the initializer is constant. */
21864 {
21865 /* Consume the `='. */
21867 /* Parse the initializer-clause. */
21869 }
21871 {
21876 non_constant_p);
21881 }
21883 {
21888 }
21889 else
21890 {
21891 /* Anything else is an error. */
21894 }
21900 }
21902 /* Parse an initializer-clause.
21904 initializer-clause:
21905 assignment-expression
21906 braced-init-list
21908 Returns an expression representing the initializer.
21910 If the `assignment-expression' production is used the value
21911 returned is simply a representation for the expression.
21913 Otherwise, calls cp_parser_braced_list. */
21915 static cp_expr
21917 {
21918 cp_expr initializer;
21920 /* Assume the expression is constant. */
21923 /* If it is not a `{', then we are looking at an
21924 assignment-expression. */
21926 {
21927 initializer
21930 non_constant_p);
21931 }
21932 else
21936 }
21938 /* Parse a brace-enclosed initializer list.
21940 braced-init-list:
21941 { initializer-list , [opt] }
21942 { designated-initializer-list , [opt] }
21943 { }
21945 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21946 the elements of the initializer-list (or NULL, if the last
21947 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21948 NULL_TREE. There is no way to detect whether or not the optional
21949 trailing `,' was provided. NON_CONSTANT_P is as for
21950 cp_parser_initializer. */
21952 static cp_expr
21954 {
21955 tree initializer;
21958 /* Consume the `{' token. */
21959 matching_braces braces;
21961 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21963 /* If it's not a `}', then there is a non-trivial initializer. */
21965 {
21966 /* Parse the initializer list. */
21969 /* A trailing `,' token is allowed. */
21972 }
21973 else
21975 /* Now, there should be a trailing `}'. */
21981 /* Build a location of the form:
21982 { ... }
21983 ^~~~~~~
21984 with caret==start at the open brace, finish at the close brace. */
21988 }
21990 /* Consume tokens up to, and including, the next non-nested closing `]'.
21991 Returns true iff we found a closing `]'. */
21993 static bool
21995 {
21999 {
22003 {
22006 /* If we've run out of tokens, then there is no closing `]'. */
22015 {
22018 }
22023 }
22025 /* Consume the token. */
22027 }
22028 }
22030 /* Return true if we are looking at an array-designator, false otherwise. */
22032 static bool
22034 {
22035 /* Consume the `['. */
22040 /* Skip tokens until the next token is a closing square bracket.
22041 If we find the closing `]', and the next token is a `=', then
22042 we are looking at an array designator. */
22043 bool array_designator_p
22047 /* Roll back the tokens we skipped. */
22051 }
22053 /* Parse an initializer-list.
22055 initializer-list:
22056 initializer-clause ... [opt]
22057 initializer-list , initializer-clause ... [opt]
22059 C++2A Extension:
22061 designated-initializer-list:
22062 designated-initializer-clause
22063 designated-initializer-list , designated-initializer-clause
22065 designated-initializer-clause:
22066 designator brace-or-equal-initializer
22068 designator:
22069 . identifier
22071 GNU Extension:
22073 initializer-list:
22074 designation initializer-clause ...[opt]
22075 initializer-list , designation initializer-clause ...[opt]
22077 designation:
22078 . identifier =
22079 identifier :
22080 [ constant-expression ] =
22082 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22083 for the initializer. If the INDEX of the elt is non-NULL, it is the
22084 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22085 as for cp_parser_initializer. */
22089 {
22094 /* Assume all of the expressions are constant. */
22097 /* Parse the rest of the list. */
22099 {
22101 tree designator;
22102 tree initializer;
22106 /* Handle the C++2A syntax, '. id ='. */
22114 {
22117 "C++ designated initializers only available with "
22119 /* Consume the `.'. */
22121 /* Consume the identifier. */
22124 /* Consume the `='. */
22126 }
22127 /* Also, if the next token is an identifier and the following one is a
22128 colon, we are looking at the GNU designated-initializer
22129 syntax. */
22134 {
22135 /* Warn the user that they are using an extension. */
22138 /* Consume the identifier. */
22140 /* Consume the `:'. */
22142 }
22143 /* Also handle C99 array designators, '[ const ] ='. */
22147 {
22148 /* In C++11, [ could start a lambda-introducer. */
22154 {
22157 }
22158 else
22159 {
22164 }
22169 && (!require_potential_rvalue_constant_expression
22173 /* Warn the user that they are using an extension. */
22176 }
22177 else
22181 {
22184 }
22188 {
22192 }
22196 /* Parse the initializer. */
22199 /* If any clause is non-constant, so is the entire initializer. */
22203 /* If we have an ellipsis, this is an initializer pack
22204 expansion. */
22206 {
22209 /* Consume the `...'. */
22216 /* Turn the initializer into an initializer expansion. */
22218 }
22220 /* Add it to the vector. */
22223 /* If the next token is not a comma, we have reached the end of
22224 the list. */
22228 /* Peek at the next token. */
22230 /* If the next token is a `}', then we're still done. An
22231 initializer-clause can have a trailing `,' after the
22232 initializer-list and before the closing `}'. */
22236 /* Consume the `,' token. */
22238 }
22240 /* The same identifier shall not appear in multiple designators
22241 of a designated-initializer-list. */
22243 {
22248 {
22250 {
22252 "%<.%s%> designator used multiple times in "
22256 }
22257 else
22259 }
22263 }
22266 }
22268 /* Classes [gram.class] */
22270 /* Parse a class-name.
22272 class-name:
22273 identifier
22274 template-id
22276 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22277 to indicate that names looked up in dependent types should be
22278 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22279 keyword has been used to indicate that the name that appears next
22280 is a template. TAG_TYPE indicates the explicit tag given before
22281 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22282 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22283 is the class being defined in a class-head. If ENUM_OK is TRUE,
22284 enum-names are also accepted.
22286 Returns the TYPE_DECL representing the class. */
22288 static tree
22297 {
22298 tree decl;
22299 tree scope;
22304 /* All class-names start with an identifier. */
22307 {
22310 }
22312 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22313 to a template-id, so we save it here. */
22318 /* Any name names a type if we're following the `typename' keyword
22319 in a qualified name where the enclosing scope is type-dependent. */
22322 /* Handle the common case (an identifier, but not a template-id)
22323 efficiently. */
22326 {
22330 /* Look for the identifier. */
22334 /* If the next token isn't an identifier, we are certainly not
22335 looking at a class-name. */
22338 /* If we know this is a type-name, there's no need to look it
22339 up. */
22342 else
22343 {
22344 tree ambiguous_decls;
22345 /* If we already know that this lookup is ambiguous, then
22346 we've already issued an error message; there's no reason
22347 to check again. */
22349 {
22352 }
22353 /* If the next token is a `::', then the name must be a type
22354 name.
22356 [basic.lookup.qual]
22358 During the lookup for a name preceding the :: scope
22359 resolution operator, object, function, and enumerator
22360 names are ignored. */
22363 /* Look up the name. */
22365 tag_type,
22368 check_dependency_p,
22372 {
22376 }
22377 }
22378 }
22379 else
22380 {
22381 /* Try a template-id. */
22383 check_dependency_p,
22384 tag_type,
22385 is_declaration);
22388 }
22392 /* If this is a typename, create a TYPENAME_TYPE. */
22394 {
22399 }
22403 /* Check to see that it is really the name of a class. */
22407 /* Situations like this:
22409 template <typename T> struct A {
22410 typename T::template X<int>::I i;
22411 };
22413 are problematic. Is `T::template X<int>' a class-name? The
22414 standard does not seem to be definitive, but there is no other
22415 valid interpretation of the following `::'. Therefore, those
22416 names are considered class-names. */
22417 {
22421 }
22426 /* In Objective-C 2.0, a classname followed by '.' starts a
22427 dot-syntax expression, and it's not a type-name. */
22439 }
22441 /* Parse a class-specifier.
22443 class-specifier:
22444 class-head { member-specification [opt] }
22446 Returns the TREE_TYPE representing the class. */
22448 static tree
22450 {
22451 tree type;
22465 /* Parse the class-head. */
22468 /* If the class-head was a semantic disaster, skip the entire body
22469 of the class. */
22471 {
22475 }
22477 /* Look for the `{'. */
22478 matching_braces braces;
22480 {
22483 }
22488 /* Issue an error message if type-definitions are forbidden here. */
22490 /* Remember that we are defining one more class. */
22492 /* Inside the class, surrounding template-parameter-lists do not
22493 apply. */
22494 saved_num_template_parameter_lists
22497 /* We are not in a function body. */
22500 /* Or in a loop. */
22503 /* Or in a switch. */
22506 /* We are not immediately inside an extern "lang" block. */
22507 saved_in_unbraced_linkage_specification_p
22511 // Associate constraints with the type.
22515 /* Start the class. */
22517 {
22520 }
22524 /* If the type is erroneous, skip the entire body of the class. */
22526 else
22527 /* Parse the member-specification. */
22530 /* Look for the trailing `}'. */
22532 /* Look for trailing attributes to apply to this class. */
22540 /* We've finished a type definition. Check for the common syntax
22541 error of forgetting a semicolon after the definition. We need to
22542 be careful, as we can't just check for not-a-semicolon and be done
22543 with it; the user might have typed:
22545 class X { } c = ...;
22546 class X { } *p = ...;
22548 and so forth. Instead, enumerate all the possible tokens that
22549 might follow this production; if we don't see one of them, then
22550 complain and silently insert the semicolon. */
22551 {
22556 /* Don't try to parse c++11 attributes here. As per the
22557 grammar, that should be a task for
22558 cp_parser_decl_specifier_seq. */
22562 {
22573 /* While it's legal for type qualifiers and storage class
22574 specifiers to follow type definitions in the grammar, only
22575 compiler testsuites contain code like that. Assume that if
22576 we see such code, then what we're really seeing is a case
22577 like:
22579 class X { }
22580 const <type> var = ...;
22582 or
22584 class Y { }
22585 static <type> func (...) ...
22587 i.e. the qualifier or specifier applies to the next
22588 declaration. To do so, however, we need to look ahead one
22589 more token to see if *that* token is a type specifier.
22591 This code could be improved to handle:
22593 class Z { }
22594 static const <type> var = ...; */
22597 {
22600 /* Handling user-defined types here would be nice, but very
22601 tricky. */
22602 want_semicolon
22605 }
22609 }
22611 /* If we don't have a type, then something is very wrong and we
22612 shouldn't try to do anything clever. Likewise for not seeing the
22613 closing brace. */
22615 {
22616 /* Locate the closing brace. */
22617 cp_token_position prev
22622 /* We want to suggest insertion of a ';' immediately *after* the
22623 closing brace, so, if we can, offset the location by 1 column. */
22630 /* If we successfully offset the location, suggest the fix-it. */
22643 else
22646 /* Unget one token and smash it to look as though we encountered
22647 a semicolon in the input stream. */
22652 }
22653 }
22655 /* If this class is not itself within the scope of another class,
22656 then we need to parse the bodies of all of the queued function
22657 definitions. Note that the queued functions defined in a class
22658 are not always processed immediately following the
22659 class-specifier for that class. Consider:
22661 struct A {
22662 struct B { void f() { sizeof (A); } };
22663 };
22665 If `f' were processed before the processing of `A' were
22666 completed, there would be no way to compute the size of `A'.
22667 Note that the nesting we are interested in here is lexical --
22668 not the semantic nesting given by TYPE_CONTEXT. In particular,
22669 for:
22671 struct A { struct B; };
22672 struct A::B { void f() { } };
22674 there is no need to delay the parsing of `A::B::f'. */
22676 {
22677 tree decl;
22685 {
22686 /* Skip default arguments, NSDMIs, etc, in order to improve
22687 error recovery (c++/71169, c++/71832). */
22692 }
22694 /* In a first pass, parse default arguments to the functions.
22695 Then, in a second pass, parse the bodies of the functions.
22696 This two-phased approach handles cases like:
22698 struct S {
22699 void f() { g(); }
22700 void g(int i = 3);
22701 };
22703 */
22705 {
22707 /* If there are default arguments that have not yet been processed,
22708 take care of them now. */
22710 {
22715 }
22716 /* Make sure that any template parameters are in scope. */
22718 /* Parse the default argument expressions. */
22720 /* Remove any template parameters from the symbol table. */
22722 }
22724 /* Now parse any NSDMIs. */
22728 {
22730 {
22735 }
22738 }
22745 /* Now do some post-NSDMI bookkeeping. */
22751 /* Now parse the body of the functions. */
22753 {
22754 /* OpenMP UDRs need to be parsed before all other functions. */
22761 }
22762 else
22766 }
22767 else
22770 /* Put back any saved access checks. */
22773 /* Restore saved state. */
22777 parser->num_template_parameter_lists
22779 parser->in_unbraced_linkage_specification_p
22783 }
22785 static tree
22787 {
22788 tree ret;
22793 }
22795 /* Parse a class-head.
22797 class-head:
22798 class-key identifier [opt] base-clause [opt]
22799 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22800 class-key nested-name-specifier [opt] template-id
22801 base-clause [opt]
22803 class-virt-specifier:
22804 final
22806 GNU Extensions:
22807 class-key attributes identifier [opt] base-clause [opt]
22808 class-key attributes nested-name-specifier identifier base-clause [opt]
22809 class-key attributes nested-name-specifier [opt] template-id
22810 base-clause [opt]
22812 Upon return BASES is initialized to the list of base classes (or
22813 NULL, if there are none) in the same form returned by
22814 cp_parser_base_clause.
22816 Returns the TYPE of the indicated class. Sets
22817 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22818 involving a nested-name-specifier was used, and FALSE otherwise.
22820 Returns error_mark_node if this is not a class-head.
22822 Returns NULL_TREE if the class-head is syntactically valid, but
22823 semantically invalid in a way that means we should skip the entire
22824 body of the class. */
22826 static tree
22829 {
22830 tree nested_name_specifier;
22834 tree attributes;
22835 tree bases;
22845 /* Assume no nested-name-specifier will be present. */
22847 /* Assume no template parameter lists will be used in defining the
22848 type. */
22852 /* Look for the class-key. */
22859 /* Parse the attributes. */
22862 /* If the next token is `::', that is invalid -- but sometimes
22863 people do try to write:
22865 struct ::S {};
22867 Handle this gracefully by accepting the extra qualifier, and then
22868 issuing an error about it later if this really is a
22869 class-head. If it turns out just to be an elaborated type
22870 specifier, remain silent. */
22876 /* Determine the name of the class. Begin by looking for an
22877 optional nested-name-specifier. */
22879 nested_name_specifier
22885 /* If there was a nested-name-specifier, then there *must* be an
22886 identifier. */
22891 {
22893 /* Although the grammar says `identifier', it really means
22894 `class-name' or `template-name'. You are only allowed to
22895 define a class that has already been declared with this
22896 syntax.
22898 The proposed resolution for Core Issue 180 says that wherever
22899 you see `class T::X' you should treat `X' as a type-name.
22901 It is OK to define an inaccessible class; for example:
22903 class A { class B; };
22904 class A::B {};
22906 We do not know if we will see a class-name, or a
22907 template-name. We look for a class-name first, in case the
22908 class-name is a template-id; if we looked for the
22909 template-name first we would stop after the template-name. */
22916 class_type,
22920 /* If that didn't work, ignore the nested-name-specifier. */
22922 {
22928 }
22929 /* If we could not find a corresponding TYPE, treat this
22930 declaration like an unqualified declaration. */
22933 /* Otherwise, count the number of templates used in TYPE and its
22934 containing scopes. */
22935 else
22936 {
22937 tree scope;
22949 }
22950 }
22951 /* Otherwise, the identifier is optional. */
22952 else
22953 {
22954 /* We don't know whether what comes next is a template-id,
22955 an identifier, or nothing at all. */
22957 /* Check for a template-id. */
22962 class_key,
22964 /* If that didn't work, it could still be an identifier. */
22966 {
22968 {
22971 }
22972 else
22974 }
22975 else
22976 {
22979 }
22980 }
22985 {
22987 class_key,
22989 }
22992 /* If it's not a `:' or a `{' then we can't really be looking at a
22993 class-head, since a class-head only appears as part of a
22994 class-specifier. We have to detect this situation before calling
22995 xref_tag, since that has irreversible side-effects. */
22997 {
23001 }
23003 /* At this point, we're going ahead with the class-specifier, even
23004 if some other problem occurs. */
23007 {
23012 }
23013 /* Issue the error about the overly-qualified name now. */
23015 {
23020 }
23022 {
23027 }
23029 {
23030 tree scope;
23033 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23034 keyword template shall not appear at the top level. */
23038 /* Reject typedef-names in class heads. */
23040 {
23043 type);
23046 }
23048 /* Figure out in what scope the declaration is being placed. */
23050 /* If that scope does not contain the scope in which the
23051 class was originally declared, the program is invalid. */
23053 {
23056 "declaration of %qD in namespace %qD which does not "
23059 else
23065 }
23066 /* [dcl.meaning]
23068 A declarator-id shall not be qualified except for the
23069 definition of a ... nested class outside of its class
23070 ... [or] the definition or explicit instantiation of a
23071 class member of a namespace outside of its namespace. */
23073 {
23078 }
23079 }
23080 /* An explicit-specialization must be preceded by "template <>". If
23081 it is not, try to recover gracefully. */
23084 && !processing_template_parmlist
23086 {
23087 /* Build a location of this form:
23088 struct typename <ARGS>
23089 ^~~~~~~~~~~~~~~~~~~~~~
23090 with caret==start at the start token, and
23091 finishing at the end of the type. */
23092 location_t reported_loc
23094 class_head_start_location,
23100 "an explicit specialization must be preceded by"
23103 /* Take the same action that would have been taken by
23104 cp_parser_explicit_specialization. */
23107 }
23108 /* There must be no "return" statements between this point and the
23109 end of this function; set "type "to the correct return value and
23110 use "goto done;" to return. */
23111 /* Make sure that the right number of template parameters were
23112 present. */
23116 {
23117 /* If something went wrong, there is no point in even trying to
23118 process the class-definition. */
23121 }
23123 /* Look up the type. */
23125 {
23129 {
23133 }
23134 else
23135 {
23139 /* Check the scope while we still know whether or not we had a
23140 nested-name-specifier. */
23143 }
23146 }
23148 {
23149 tree class_type;
23151 /* Given:
23153 template <typename T> struct S { struct T };
23154 template <typename T> struct S<T>::T { };
23156 we will get a TYPENAME_TYPE when processing the definition of
23157 `S::T'. We need to resolve it to the actual type before we
23158 try to define it. */
23160 {
23165 else
23166 {
23169 }
23170 }
23174 {
23177 }
23180 /* Enter the scope indicated by the nested-name-specifier. */
23182 /* Get the canonical version of this type. */
23184 /* Call push_template_decl if it seems like we should be defining a
23185 template either from the template headers or the type we're
23186 defining, so that we diagnose both extra and missing headers. */
23190 {
23193 {
23196 }
23197 }
23201 }
23203 {
23204 /* If the class was unnamed, create a dummy name. */
23208 ? ts_within_enclosing_non_class
23212 }
23214 /* Indicate whether this class was declared as a `class' or as a
23215 `struct'. */
23220 /* If this type was already complete, and we see another definition,
23221 that's an error. */
23223 {
23225 type);
23227 type);
23230 }
23235 {
23236 /* Apply attributes now, before any use of the class as a template
23237 argument in its base list. */
23240 }
23242 /* We will have entered the scope containing the class; the names of
23243 base classes should be looked up in that context. For example:
23245 struct A { struct B {}; struct C; };
23246 struct A::C : B {};
23248 is valid. */
23250 /* Get the list of base-classes, if there is one. */
23252 {
23253 /* PR59482: enter the class scope so that base-specifiers are looked
23254 up correctly. */
23258 /* PR59482: get out of the previously pushed class scope so that the
23259 subsequent pops pop the right thing. */
23262 }
23263 else
23266 /* If we're really defining a class, process the base classes.
23267 If they're invalid, fail. */
23271 done:
23272 /* Leave the scope given by the nested-name-specifier. We will
23273 enter the class scope itself while processing the members. */
23278 {
23281 }
23287 out:
23290 }
23292 /* Parse a class-key.
23294 class-key:
23295 class
23296 struct
23297 union
23299 Returns the kind of class-key specified, or none_type to indicate
23300 error. */
23302 static enum tag_types
23304 {
23308 /* Look for the class-key. */
23313 /* Check to see if the TOKEN is a class-key. */
23318 }
23320 /* Parse a type-parameter-key.
23322 type-parameter-key:
23323 class
23324 typename
23325 */
23327 static void
23329 {
23330 /* Look for the type-parameter-key. */
23334 {
23337 /* typename is not allowed in a template template parameter
23338 by the standard until C++17. */
23340 "ISO C++ forbids typename key in template template parameter;"
23342 }
23343 else
23347 }
23349 /* Parse an (optional) member-specification.
23351 member-specification:
23352 member-declaration member-specification [opt]
23353 access-specifier : member-specification [opt] */
23355 static void
23357 {
23359 {
23363 /* Peek at the next token. */
23365 /* If it's a `}', or EOF then we've seen all the members. */
23371 /* See if this token is a keyword. */
23374 {
23378 /* Consume the access-specifier. */
23380 /* Remember which access-specifier is active. */
23382 /* Look for the `:'. */
23387 /* Accept #pragmas at class scope. */
23389 {
23392 }
23394 /* Otherwise, the next construction must be a
23395 member-declaration. */
23397 }
23398 }
23399 }
23401 /* Parse a member-declaration.
23403 member-declaration:
23404 decl-specifier-seq [opt] member-declarator-list [opt] ;
23405 function-definition ; [opt]
23406 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23407 using-declaration
23408 template-declaration
23409 alias-declaration
23411 member-declarator-list:
23412 member-declarator
23413 member-declarator-list , member-declarator
23415 member-declarator:
23416 declarator pure-specifier [opt]
23417 declarator constant-initializer [opt]
23418 identifier [opt] : constant-expression
23420 GNU Extensions:
23422 member-declaration:
23423 __extension__ member-declaration
23425 member-declarator:
23426 declarator attributes [opt] pure-specifier [opt]
23427 declarator attributes [opt] constant-initializer [opt]
23428 identifier [opt] attributes [opt] : constant-expression
23430 C++0x Extensions:
23432 member-declaration:
23433 static_assert-declaration */
23435 static void
23437 {
23438 cp_decl_specifier_seq decl_specifiers;
23439 tree prefix_attributes;
23440 tree decl;
23449 /* Check for the `__extension__' keyword. */
23451 {
23452 /* Recurse. */
23454 /* Restore the old value of the PEDANTIC flag. */
23458 }
23460 /* Check for a template-declaration. */
23462 {
23463 /* An explicit specialization here is an error condition, and we
23464 expect the specialization handler to detect and report this. */
23468 else
23472 }
23473 /* Check for a template introduction. */
23477 /* Check for a using-declaration. */
23479 {
23481 {
23482 /* Parse the using-declaration. */
23486 }
23487 else
23488 {
23489 tree decl;
23493 /* Note that if we actually see the '=' token after the
23494 identifier, cp_parser_alias_declaration commits the
23495 tentative parse. In that case, we really expect an
23496 alias-declaration. Otherwise, we expect a using
23497 declaration. */
23498 alias_decl_expected =
23504 else
23508 }
23509 }
23511 /* Check for @defs. */
23513 {
23518 {
23523 }
23525 }
23527 /* If the next token is `static_assert' we have a static assertion. */
23529 {
23532 }
23539 /* Parse the decl-specifier-seq. */
23542 CP_PARSER_FLAGS_OPTIONAL,
23545 /* Check for an invalid type-name. */
23549 /* If there is no declarator, then the decl-specifier-seq should
23550 specify a type. */
23552 {
23553 /* If there was no decl-specifier-seq, and the next token is a
23554 `;', then we have something like:
23556 struct S { ; };
23558 [class.mem]
23560 Each member-declaration shall declare at least one member
23561 name of the class. */
23563 {
23566 {
23570 }
23571 }
23572 else
23573 {
23574 tree type;
23576 /* See if this declaration is a friend. */
23578 /* If there were decl-specifiers, check to see if there was
23579 a class-declaration. */
23582 /* Nested classes have already been added to the class, but
23583 a `friend' needs to be explicitly registered. */
23585 {
23586 /* If the `friend' keyword was present, the friend must
23587 be introduced with a class-key. */
23590 "in C++03 a class-key must be used "
23592 /* In this case:
23594 template <typename T> struct A {
23595 friend struct A<T>::B;
23596 };
23598 A<T>::B will be represented by a TYPENAME_TYPE, and
23599 therefore not recognized by check_tag_decl. */
23601 {
23605 }
23608 "friend declaration does not name a class or "
23610 else
23613 }
23614 /* If there is no TYPE, an error message will already have
23615 been issued. */
23617 ;
23618 /* An anonymous aggregate has to be handled specially; such
23619 a declaration really declares a data member (with a
23620 particular type), as opposed to a nested class. */
23622 {
23623 /* C++11 9.5/6. */
23626 "a storage class on an anonymous aggregate "
23629 /* Remove constructors and such from TYPE, now that we
23630 know it is an anonymous aggregate. */
23632 /* And make the corresponding data member. */
23635 /* Add it to the class. */
23637 }
23638 else
23639 cp_parser_check_access_in_redeclaration
23642 }
23643 }
23644 else
23645 {
23648 /* Clear attributes from the decl_specifiers but keep them
23649 around as prefix attributes that apply them to the entity
23650 being declared. */
23654 /* See if these declarations will be friends. */
23657 /* Keep going until we hit the `;' at the end of the
23658 declaration. */
23660 {
23662 tree first_attribute;
23663 tree initializer;
23666 /* Peek at the next token. */
23669 /* The following code wants to know early if it is a bit-field
23670 or some other declaration. Attributes can appear before
23671 the `:' token. Skip over them without consuming any tokens
23672 to peek if they are followed by `:'. */
23677 {
23678 size_t n
23681 }
23683 /* Check for a bitfield declaration. */
23689 {
23690 tree identifier;
23691 tree width;
23696 else
23699 /* Look for attributes that apply to the bitfield. */
23702 /* Consume the `:' token. */
23705 /* Get the width of the bitfield. */
23709 /* In C++2A and as extension for C++11 and above we allow
23710 default member initializers for bit-fields. */
23715 CPP_OPEN_BRACE)))
23716 {
23717 location_t loc
23723 "default member initializers for bit-fields "
23724 "only available with -std=c++2a or "
23729 {
23733 }
23734 }
23735 else
23736 {
23737 /* Look for attributes that apply to the bitfield after
23738 the `:' token and width. This is where GCC used to
23739 parse attributes in the past, pedwarn if there is
23740 a std attribute. */
23743 "ISO C++ allows bit-field attributes only "
23747 }
23751 /* Remember which attributes are prefix attributes and
23752 which are not. */
23754 /* Combine the attributes. */
23757 /* Create the bitfield declaration. */
23760 identifier,
23761 sfk_none)
23765 attributes);
23766 }
23767 else
23768 {
23770 tree asm_specification;
23773 /* Parse the declarator. */
23774 declarator
23779 friend_p);
23781 /* If something went wrong parsing the declarator, make sure
23782 that we at least consume some tokens. */
23784 {
23785 /* Skip to the end of the statement. */
23787 /* If the next token is not a semicolon, that is
23788 probably because we just skipped over the body of
23789 a function. So, we consume a semicolon if
23790 present, but do not issue an error message if it
23791 is not present. */
23793 CPP_SEMICOLON))
23796 }
23799 cp_parser_check_for_definition_in_return_type
23803 /* Look for an asm-specification. */
23805 /* Look for attributes that apply to the declaration. */
23807 /* Remember which attributes are prefix attributes and
23808 which are not. */
23810 /* Combine the attributes. */
23813 /* If it's an `=', then we have a constant-initializer or a
23814 pure-specifier. It is not correct to parse the
23815 initializer before registering the member declaration
23816 since the member declaration should be in scope while
23817 its initializer is processed. However, the rest of the
23818 front end does not yet provide an interface that allows
23819 us to handle this correctly. */
23821 {
23822 /* In [class.mem]:
23824 A pure-specifier shall be used only in the declaration of
23825 a virtual function.
23827 A member-declarator can contain a constant-initializer
23828 only if it declares a static member of integral or
23829 enumeration type.
23831 Therefore, if the DECLARATOR is for a function, we look
23832 for a pure-specifier; otherwise, we look for a
23833 constant-initializer. When we call `grokfield', it will
23834 perform more stringent semantics checks. */
23846 {
23848 /* Don't require a constant rvalue in C++11, since we
23849 might want a reference constant. We'll enforce
23850 constancy later. */
23852 /* Parse the initializer. */
23855 }
23856 else
23857 /* Parse the initializer. */
23859 }
23862 {
23866 else
23868 }
23869 /* Otherwise, there is no initializer. */
23870 else
23873 /* See if we are probably looking at a function
23874 definition. We are certainly not looking at a
23875 member-declarator. Calling `grokfield' has
23876 side-effects, so we must not do it unless we are sure
23877 that we are looking at a member-declarator. */
23880 {
23881 /* The grammar does not allow a pure-specifier to be
23882 used when a member function is defined. (It is
23883 possible that this fact is an oversight in the
23884 standard, since a pure function may be defined
23885 outside of the class-specifier. */
23891 declarator,
23892 attributes);
23895 /* If the member was not a friend, declare it here. */
23898 /* Peek at the next token. */
23900 /* If the next token is a semicolon, consume it. */
23902 {
23903 location_t semicolon_loc
23908 "extra %<;%> after in-class "
23910 }
23912 }
23913 else
23916 /* Create the declaration. */
23921 {
23924 else
23926 }
23927 }
23932 /* Reset PREFIX_ATTRIBUTES. */
23934 {
23939 }
23941 /* If there is any qualification still in effect, clear it
23942 now; we will be starting fresh with the next declarator. */
23946 /* If it's a `,', then there are more declarators. */
23948 {
23951 {
23957 }
23958 }
23959 /* If the next token isn't a `;', then we have a parse error. */
23961 CPP_SEMICOLON))
23962 {
23963 /* The next token might be a ways away from where the
23964 actual semicolon is missing. Find the previous token
23965 and use that for our error position. */
23972 /* Assume that the user meant to provide a semicolon. If
23973 we were to cp_parser_skip_to_end_of_statement, we might
23974 skip to a semicolon inside a member function definition
23975 and issue nonsensical error messages. */
23977 }
23980 {
23981 /* Add DECL to the list of members. */
23983 /* Explicitly include, eg, NSDMIs, for better error
23984 recovery (c++/58650). */
23992 /* Add DECL to the queue of NSDMI to be parsed later. */
23994 }
23998 }
23999 }
24002 out:
24004 }
24006 /* Parse a pure-specifier.
24008 pure-specifier:
24009 = 0
24011 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24012 Otherwise, ERROR_MARK_NODE is returned. */
24014 static tree
24016 {
24019 /* Look for the `=' token. */
24022 /* Look for the `0' token. */
24031 /* Accept = default or = delete in c++0x mode. */
24034 {
24037 }
24039 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24041 {
24046 }
24048 {
24051 }
24054 }
24056 /* Parse a constant-initializer.
24058 constant-initializer:
24059 = constant-expression
24061 Returns a representation of the constant-expression. */
24063 static tree
24065 {
24066 /* Look for the `=' token. */
24070 /* It is invalid to write:
24072 struct S { static const int i = { 7 }; };
24074 */
24076 {
24079 /* Consume the opening brace. */
24080 matching_braces braces;
24082 /* Skip the initializer. */
24084 /* Look for the trailing `}'. */
24088 }
24091 }
24093 /* Derived classes [gram.class.derived] */
24095 /* Parse a base-clause.
24097 base-clause:
24098 : base-specifier-list
24100 base-specifier-list:
24101 base-specifier ... [opt]
24102 base-specifier-list , base-specifier ... [opt]
24104 Returns a TREE_LIST representing the base-classes, in the order in
24105 which they were declared. The representation of each node is as
24106 described by cp_parser_base_specifier.
24108 In the case that no bases are specified, this function will return
24109 NULL_TREE, not ERROR_MARK_NODE. */
24111 static tree
24113 {
24116 /* Look for the `:' that begins the list. */
24119 /* Scan the base-specifier-list. */
24121 {
24123 tree base;
24126 /* Look for the base-specifier. */
24128 /* Look for the (optional) ellipsis. */
24130 {
24131 /* Consume the `...'. */
24135 }
24137 /* Add BASE to the front of the list. */
24139 {
24141 /* Make this a pack expansion type. */
24145 {
24148 }
24149 }
24150 /* Peek at the next token. */
24152 /* If it's not a comma, then the list is complete. */
24155 /* Consume the `,'. */
24157 }
24159 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24160 base class had a qualified name. However, the next name that
24161 appears is certainly not qualified. */
24167 }
24169 /* Parse a base-specifier.
24171 base-specifier:
24172 :: [opt] nested-name-specifier [opt] class-name
24173 virtual access-specifier [opt] :: [opt] nested-name-specifier
24174 [opt] class-name
24175 access-specifier virtual [opt] :: [opt] nested-name-specifier
24176 [opt] class-name
24178 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24179 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24180 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24181 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24183 static tree
24185 {
24193 tree type;
24195 /* Process the optional `virtual' and `access-specifier'. */
24197 {
24198 /* Peek at the next token. */
24200 /* Process `virtual'. */
24202 {
24204 /* If `virtual' appears more than once, issue an error. */
24206 {
24210 }
24214 /* Consume the `virtual' token. */
24222 /* If more than one access specifier appears, issue an
24223 error. */
24226 {
24230 }
24234 /* Consume the access-specifier. */
24242 }
24243 }
24244 /* It is not uncommon to see programs mechanically, erroneously, use
24245 the 'typename' keyword to denote (dependent) qualified types
24246 as base classes. */
24248 {
24253 else
24255 "keyword %<typename%> not allowed in this context "
24258 }
24260 /* Look for the optional `::' operator. */
24262 /* Look for the nested-name-specifier. The simplest way to
24263 implement:
24265 [temp.res]
24267 The keyword `typename' is not permitted in a base-specifier or
24268 mem-initializer; in these contexts a qualified name that
24269 depends on a template-parameter is implicitly assumed to be a
24270 type name.
24272 is to pretend that we have seen the `typename' keyword at this
24273 point. */
24279 /* If the base class is given by a qualified name, assume that names
24280 we see are type names or templates, as appropriate. */
24286 /* DR 950 allows decltype as a base-specifier. */
24288 else
24289 {
24290 /* Otherwise, look for the class-name. */
24292 class_scope_p,
24293 template_p,
24294 typename_type,
24299 }
24305 }
24307 /* Exception handling [gram.exception] */
24309 /* Parse an (optional) noexcept-specification.
24311 noexcept-specification:
24312 noexcept ( constant-expression ) [opt]
24314 If no noexcept-specification is present, returns NULL_TREE.
24315 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24316 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24317 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24318 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24319 in which case a boolean condition is returned instead. */
24321 static tree
24326 {
24330 /* Peek at the next token. */
24333 /* Is it a noexcept-specification? */
24335 {
24336 tree expr;
24340 {
24341 matching_parens parens;
24345 {
24346 /* Types may not be defined in an exception-specification. */
24348 parser->type_definition_forbidden_message
24353 /* Restore the saved message. */
24355 }
24356 else
24357 {
24360 }
24363 }
24364 else
24365 {
24369 }
24371 /* We cannot build a noexcept-spec right away because this will check
24372 that expr is a constexpr. */
24375 else
24377 }
24378 else
24380 }
24382 /* Parse an (optional) exception-specification.
24384 exception-specification:
24385 throw ( type-id-list [opt] )
24387 Returns a TREE_LIST representing the exception-specification. The
24388 TREE_VALUE of each node is a type. */
24390 static tree
24392 {
24394 tree type_id_list;
24397 /* Peek at the next token. */
24400 /* Is it a noexcept-specification? */
24406 /* If it's not `throw', then there's no exception-specification. */
24412 /* Consume the `throw'. */
24415 /* Look for the `('. */
24416 matching_parens parens;
24419 /* Peek at the next token. */
24421 /* If it's not a `)', then there is a type-id-list. */
24423 {
24424 /* Types may not be defined in an exception-specification. */
24426 parser->type_definition_forbidden_message
24428 /* Parse the type-id-list. */
24430 /* Restore the saved message. */
24434 {
24438 }
24441 "dynamic exception specifications are deprecated in "
24443 }
24444 /* In C++17, throw() is equivalent to noexcept (true). throw()
24445 is deprecated in C++11 and above as well, but is still widely used,
24446 so don't warn about it yet. */
24449 else
24452 /* Look for the `)'. */
24456 }
24458 /* Parse an (optional) type-id-list.
24460 type-id-list:
24461 type-id ... [opt]
24462 type-id-list , type-id ... [opt]
24464 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24465 in the order that the types were presented. */
24467 static tree
24469 {
24473 {
24475 tree type;
24479 /* Get the next type-id. */
24481 /* Check for invalid 'auto'. */
24483 {
24487 }
24488 /* Parse the optional ellipsis. */
24490 {
24491 /* Consume the `...'. */
24494 /* Turn the type into a pack expansion expression. */
24496 }
24497 /* Add it to the list. */
24499 /* Peek at the next token. */
24501 /* If it is not a `,', we are done. */
24504 /* Consume the `,'. */
24506 }
24509 }
24511 /* Parse a try-block.
24513 try-block:
24514 try compound-statement handler-seq */
24516 static tree
24518 {
24519 tree try_block;
24533 }
24535 /* Parse a function-try-block.
24537 function-try-block:
24538 try ctor-initializer [opt] function-body handler-seq */
24540 static void
24542 {
24543 tree compound_stmt;
24544 tree try_block;
24546 /* Look for the `try' keyword. */
24549 /* Let the rest of the front end know where we are. */
24551 /* Parse the function-body. */
24552 cp_parser_ctor_initializer_opt_and_function_body
24554 /* We're done with the `try' part. */
24556 /* Parse the handlers. */
24558 /* We're done with the handlers. */
24560 }
24562 /* Parse a handler-seq.
24564 handler-seq:
24565 handler handler-seq [opt] */
24567 static void
24569 {
24571 {
24574 /* Parse the handler. */
24576 /* Peek at the next token. */
24578 /* If it's not `catch' then there are no more handlers. */
24581 }
24582 }
24584 /* Parse a handler.
24586 handler:
24587 catch ( exception-declaration ) compound-statement */
24589 static void
24591 {
24592 tree handler;
24593 tree declaration;
24597 matching_parens parens;
24604 }
24606 /* Parse an exception-declaration.
24608 exception-declaration:
24609 type-specifier-seq declarator
24610 type-specifier-seq abstract-declarator
24611 type-specifier-seq
24612 ...
24614 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24615 ellipsis variant is used. */
24617 static tree
24619 {
24620 cp_decl_specifier_seq type_specifiers;
24624 /* If it's an ellipsis, it's easy to handle. */
24626 {
24627 /* Consume the `...' token. */
24630 }
24632 /* Types may not be defined in exception-declarations. */
24634 parser->type_definition_forbidden_message
24637 /* Parse the type-specifier-seq. */
24641 /* If it's a `)', then there is no declarator. */
24644 else
24651 /* Restore the saved message. */
24658 }
24660 /* Parse a throw-expression.
24662 throw-expression:
24663 throw assignment-expression [opt]
24665 Returns a THROW_EXPR representing the throw-expression. */
24667 static tree
24669 {
24670 tree expression;
24675 /* Figure out whether or not there is an assignment-expression
24676 following the "throw" keyword. */
24684 else
24688 }
24690 /* GNU Extensions */
24692 /* Parse an (optional) asm-specification.
24694 asm-specification:
24695 asm ( string-literal )
24697 If the asm-specification is present, returns a STRING_CST
24698 corresponding to the string-literal. Otherwise, returns
24699 NULL_TREE. */
24701 static tree
24703 {
24705 tree asm_specification;
24707 /* Peek at the next token. */
24709 /* If the next token isn't the `asm' keyword, then there's no
24710 asm-specification. */
24714 /* Consume the `asm' token. */
24716 /* Look for the `('. */
24717 matching_parens parens;
24720 /* Look for the string-literal. */
24723 /* Look for the `)'. */
24727 }
24729 /* Parse an asm-operand-list.
24731 asm-operand-list:
24732 asm-operand
24733 asm-operand-list , asm-operand
24735 asm-operand:
24736 string-literal ( expression )
24737 [ string-literal ] string-literal ( expression )
24739 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24740 each node is the expression. The TREE_PURPOSE is itself a
24741 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24742 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24743 is a STRING_CST for the string literal before the parenthesis. Returns
24744 ERROR_MARK_NODE if any of the operands are invalid. */
24746 static tree
24748 {
24753 {
24754 tree string_literal;
24755 tree expression;
24756 tree name;
24759 {
24760 /* Consume the `[' token. */
24762 /* Read the operand name. */
24767 /* Look for the closing `]'. */
24769 }
24770 else
24772 /* Look for the string-literal. */
24775 /* Look for the `('. */
24776 matching_parens parens;
24778 /* Parse the expression. */
24780 /* Look for the `)'. */
24788 /* Add this operand to the list. */
24790 expression,
24791 asm_operands);
24792 /* If the next token is not a `,', there are no more
24793 operands. */
24796 /* Consume the `,'. */
24798 }
24801 }
24803 /* Parse an asm-clobber-list.
24805 asm-clobber-list:
24806 string-literal
24807 asm-clobber-list , string-literal
24809 Returns a TREE_LIST, indicating the clobbers in the order that they
24810 appeared. The TREE_VALUE of each node is a STRING_CST. */
24812 static tree
24814 {
24818 {
24819 tree string_literal;
24821 /* Look for the string literal. */
24823 /* Add it to the list. */
24825 /* If the next token is not a `,', then the list is
24826 complete. */
24829 /* Consume the `,' token. */
24831 }
24834 }
24836 /* Parse an asm-label-list.
24838 asm-label-list:
24839 identifier
24840 asm-label-list , identifier
24842 Returns a TREE_LIST, indicating the labels in the order that they
24843 appeared. The TREE_VALUE of each node is a label. */
24845 static tree
24847 {
24851 {
24854 /* Look for the identifier. */
24857 {
24860 {
24866 }
24867 }
24868 /* If the next token is not a `,', then the list is
24869 complete. */
24872 /* Consume the `,' token. */
24874 }
24877 }
24879 /* Return TRUE iff the next tokens in the stream are possibly the
24880 beginning of a GNU extension attribute. */
24882 static bool
24884 {
24886 }
24888 /* Return TRUE iff the next tokens in the stream are possibly the
24889 beginning of a standard C++-11 attribute specifier. */
24891 static bool
24893 {
24895 }
24897 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24898 beginning of a standard C++-11 attribute specifier. */
24900 static bool
24902 {
24910 }
24912 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24913 beginning of a GNU extension attribute. */
24915 static bool
24917 {
24921 }
24923 /* Return true iff the next tokens can be the beginning of either a
24924 GNU attribute list, or a standard C++11 attribute sequence. */
24926 static bool
24928 {
24931 }
24933 /* Return true iff the next Nth tokens can be the beginning of either
24934 a GNU attribute list, or a standard C++11 attribute sequence. */
24936 static bool
24938 {
24941 }
24943 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24944 of GNU attributes, or return NULL. */
24946 static tree
24948 {
24952 }
24954 /* Parse an (optional) series of attributes.
24956 attributes:
24957 attributes attribute
24959 attribute:
24960 __attribute__ (( attribute-list [opt] ))
24962 The return value is as for cp_parser_gnu_attribute_list. */
24964 static tree
24966 {
24970 {
24972 tree attribute_list;
24975 /* Peek at the next token. */
24977 /* If it's not `__attribute__', then we're done. */
24981 /* Consume the `__attribute__' keyword. */
24983 /* Look for the two `(' tokens. */
24984 matching_parens outer_parens;
24986 matching_parens inner_parens;
24989 /* Peek at the next token. */
24992 /* Parse the attribute-list. */
24994 else
24995 /* If the next token is a `)', then there is no attribute
24996 list. */
24999 /* Look for the two `)' tokens. */
25007 /* Add these new attributes to the list. */
25009 }
25012 }
25014 /* Parse a GNU attribute-list.
25016 attribute-list:
25017 attribute
25018 attribute-list , attribute
25020 attribute:
25021 identifier
25022 identifier ( identifier )
25023 identifier ( identifier , expression-list )
25024 identifier ( expression-list )
25026 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25027 to an attribute. The TREE_PURPOSE of each node is the identifier
25028 indicating which attribute is in use. The TREE_VALUE represents
25029 the arguments, if any. */
25031 static tree
25033 {
25039 {
25041 tree identifier;
25042 tree attribute;
25044 /* Look for the identifier. We also allow keywords here; for
25045 example `__attribute__ ((const))' is legal. */
25049 {
25052 /* Consume the token, but save it since we need it for the
25053 SIMD enabled function parsing. */
25056 /* Save away the identifier that indicates which attribute
25057 this is. */
25059 /* For keywords, use the canonical spelling, not the
25060 parsed identifier. */
25067 /* Peek at the next token. */
25069 /* If it's an `(', then parse the attribute arguments. */
25071 {
25075 vec = cp_parser_parenthesized_expression_list
25081 else
25082 {
25085 }
25086 /* Save the arguments away. */
25088 }
25091 {
25092 /* Add this attribute to the list. */
25095 }
25098 }
25099 /* Now, look for more attributes. If the next token isn't a
25100 `,', we're done. */
25104 /* Consume the comma and keep going. */
25106 }
25109 /* We built up the list in reverse order. */
25111 }
25113 /* Parse a standard C++11 attribute.
25115 The returned representation is a TREE_LIST which TREE_PURPOSE is
25116 the scoped name of the attribute, and the TREE_VALUE is its
25117 arguments list.
25119 Note that the scoped name of the attribute is itself a TREE_LIST
25120 which TREE_PURPOSE is the namespace of the attribute, and
25121 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25122 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25123 and which TREE_PURPOSE is directly the attribute name.
25125 Clients of the attribute code should use get_attribute_namespace
25126 and get_attribute_name to get the actual namespace and name of
25127 attributes, regardless of their being GNU or C++11 attributes.
25129 attribute:
25130 attribute-token attribute-argument-clause [opt]
25132 attribute-token:
25133 identifier
25134 attribute-scoped-token
25136 attribute-scoped-token:
25137 attribute-namespace :: identifier
25139 attribute-namespace:
25140 identifier
25142 attribute-argument-clause:
25143 ( balanced-token-seq )
25145 balanced-token-seq:
25146 balanced-token [opt]
25147 balanced-token-seq balanced-token
25149 balanced-token:
25150 ( balanced-token-seq )
25151 [ balanced-token-seq ]
25152 { balanced-token-seq }. */
25154 static tree
25156 {
25160 /* First, parse name of the attribute, a.k.a attribute-token. */
25177 {
25178 /* We are seeing a scoped attribute token. */
25193 else
25194 {
25198 }
25202 NULL_TREE);
25204 }
25207 NULL_TREE);
25208 else
25209 {
25212 NULL_TREE);
25213 /* C++11 noreturn attribute is equivalent to GNU's. */
25216 /* C++14 deprecated attribute is equivalent to GNU's. */
25219 /* C++17 fallthrough attribute is equivalent to GNU's. */
25222 /* Transactional Memory TS optimize_for_synchronized attribute is
25223 equivalent to GNU transaction_callable. */
25227 /* Transactional Memory attributes are GNU attributes. */
25230 }
25232 /* Now parse the optional argument clause of the attribute. */
25237 {
25243 /* A GNU attribute that takes an identifier in parameter. */
25246 vec = cp_parser_parenthesized_expression_list
25252 else
25253 {
25256 }
25260 else
25262 }
25265 }
25267 /* Check that the attribute ATTRIBUTE appears at most once in the
25268 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25269 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25270 isn't implemented yet in GCC. */
25272 static void
25274 {
25276 {
25286 }
25287 }
25289 /* Parse a list of standard C++-11 attributes.
25291 attribute-list:
25292 attribute [opt]
25293 attribute-list , attribute[opt]
25294 attribute ...
25295 attribute-list , attribute ...
25296 */
25298 static tree
25300 {
25305 {
25310 {
25314 }
25317 {
25322 else
25323 {
25328 }
25330 }
25334 }
25337 }
25339 /* Parse a standard C++-11 attribute specifier.
25341 attribute-specifier:
25342 [ [ attribute-using-prefix [opt] attribute-list ] ]
25343 alignment-specifier
25345 attribute-using-prefix:
25346 using attribute-namespace :
25348 alignment-specifier:
25349 alignas ( type-id ... [opt] )
25350 alignas ( alignment-expression ... [opt] ). */
25352 static tree
25354 {
25360 {
25367 {
25378 {
25382 "attribute using prefix only available "
25388 }
25389 else
25391 }
25398 else
25399 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25400 when we are sure that we have actually parsed them. */
25402 }
25403 else
25404 {
25405 tree alignas_expr;
25407 /* Look for an alignment-specifier. */
25418 matching_parens parens;
25426 {
25433 }
25438 /* Handle alignas (pack...). */
25440 {
25443 }
25445 /* Something went wrong, so don't build the attribute. */
25452 /* Build the C++-11 representation of an 'aligned'
25453 attribute. */
25454 attributes =
25457 alignas_expr);
25458 }
25461 }
25463 /* Parse a standard C++-11 attribute-specifier-seq.
25465 attribute-specifier-seq:
25466 attribute-specifier-seq [opt] attribute-specifier
25467 */
25469 static tree
25471 {
25476 {
25485 else
25488 }
25491 }
25493 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25494 return index of the first token after balanced-token, or N on failure. */
25496 static size_t
25498 {
25501 do
25503 {
25506 /* Ran out of tokens. */
25528 }
25531 }
25533 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25534 return index of the first token after the GNU attribute tokens, or N on
25535 failure. */
25537 static size_t
25539 {
25541 {
25553 }
25555 }
25557 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25558 next token), return index of the first token after the standard C++11
25559 attribute tokens, or N on failure. */
25561 static size_t
25563 {
25565 {
25568 {
25575 }
25578 {
25583 }
25584 else
25586 }
25588 }
25590 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25591 as the next token), return index of the first token after the attribute
25592 tokens, or N on failure. */
25594 static size_t
25596 {
25600 }
25602 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25603 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25604 current value of the PEDANTIC flag, regardless of whether or not
25605 the `__extension__' keyword is present. The caller is responsible
25606 for restoring the value of the PEDANTIC flag. */
25608 static bool
25610 {
25611 /* Save the old value of the PEDANTIC flag. */
25615 {
25616 /* Consume the `__extension__' token. */
25618 /* We're not being pedantic while the `__extension__' keyword is
25619 in effect. */
25623 }
25626 }
25628 /* Parse a label declaration.
25630 label-declaration:
25631 __label__ label-declarator-seq ;
25633 label-declarator-seq:
25634 identifier , label-declarator-seq
25635 identifier */
25637 static void
25639 {
25640 /* Look for the `__label__' keyword. */
25644 {
25645 tree identifier;
25647 /* Look for an identifier. */
25649 /* If we failed, stop. */
25652 /* Declare it as a label. */
25654 /* If the next token is a `;', stop. */
25657 /* Look for the `,' separating the label declarations. */
25659 }
25661 /* Look for the final `;'. */
25663 }
25665 // -------------------------------------------------------------------------- //
25666 // Requires Clause
25668 // Parse a requires clause.
25669 //
25670 // requires-clause:
25671 // 'requires' logical-or-expression
25672 //
25673 // The required logical-or-expression must be a constant expression. Note
25674 // that we don't check that the expression is constepxr here. We defer until
25675 // we analyze constraints and then, we only check atomic constraints.
25676 static tree
25678 {
25679 // Parse the requires clause so that it is not automatically folded.
25687 }
25689 // Optionally parse a requires clause:
25690 static tree
25692 {
25695 {
25698 {
25701 /* Parse and discard the requires-clause. */
25704 }
25706 }
25709 }
25712 /*---------------------------------------------------------------------------
25713 Requires expressions
25714 ---------------------------------------------------------------------------*/
25716 /* Parse a requires expression
25718 requirement-expression:
25719 'requires' requirement-parameter-list [opt] requirement-body */
25720 static tree
25722 {
25726 /* A requires-expression shall appear only within a concept
25727 definition or a requires-clause.
25729 TODO: Implement this diagnostic correctly. */
25731 {
25735 }
25738 {
25739 /* Local parameters are delared as variables within the scope
25740 of the expression. They are not visible past the end of
25741 the expression. Expressions within the requires-expression
25742 are unevaluated. */
25743 struct scope_sentinel
25744 {
25746 {
25749 }
25752 {
25755 }
25758 /* Parse the optional parameter list. */
25760 {
25764 }
25765 else
25768 /* Parse the requirement body. */
25772 }
25774 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25775 the parm chain. */
25778 }
25780 /* Parse a parameterized requirement.
25782 requirement-parameter-list:
25783 '(' parameter-declaration-clause ')' */
25784 static tree
25786 {
25787 matching_parens parens;
25797 }
25799 /* Parse the body of a requirement.
25801 requirement-body:
25802 '{' requirement-list '}' */
25803 static tree
25805 {
25806 matching_braces braces;
25816 }
25818 /* Parse a list of requirements.
25820 requirement-list:
25821 requirement
25822 requirement-list ';' requirement[opt] */
25823 static tree
25825 {
25828 {
25835 /* If we see a semi-colon, consume it. */
25839 /* Stop processing at the end of the list. */
25842 }
25844 /* Reverse the order of requirements so they are analyzed in
25845 declaration order. */
25847 }
25849 /* Parse a syntactic requirement or type requirement.
25851 requirement:
25852 simple-requirement
25853 compound-requirement
25854 type-requirement
25855 nested-requirement */
25856 static tree
25858 {
25865 else
25867 }
25869 /* Parse a simple requirement.
25871 simple-requirement:
25872 expression ';' */
25873 static tree
25875 {
25884 }
25886 /* Parse a type requirement
25888 type-requirement
25889 nested-name-specifier [opt] required-type-name ';'
25891 required-type-name:
25892 type-name
25893 'template' [opt] simple-template-id */
25894 static tree
25896 {
25899 // Save the scope before parsing name specifiers.
25910 tree type;
25912 {
25921 }
25922 else
25941 }
25943 /* Parse a compound requirement
25945 compound-requirement:
25946 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25947 static tree
25949 {
25950 /* Parse an expression enclosed in '{ }'s. */
25951 matching_braces braces;
25962 /* Parse the optional noexcept. */
25965 {
25968 }
25970 /* Parse the optional trailing return type. */
25973 {
25981 }
25984 }
25986 /* Parse a nested requirement. This is the same as a requires clause.
25988 nested-requirement:
25989 requires-clause */
25990 static tree
25992 {
25998 }
26000 /* Support Functions */
26002 /* Return the appropriate prefer_type argument for lookup_name_real based on
26003 tag_type and template_mem_access. */
26007 {
26008 /* DR 141: When looking in the current enclosing context for a template-name
26009 after -> or ., only consider class templates. */
26013 {
26017 }
26018 }
26020 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26021 NAME should have one of the representations used for an
26022 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26023 is returned. If PARSER->SCOPE is a dependent type, then a
26024 SCOPE_REF is returned.
26026 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26027 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26028 was formed. Abstractly, such entities should not be passed to this
26029 function, because they do not need to be looked up, but it is
26030 simpler to check for this special case here, rather than at the
26031 call-sites.
26033 In cases not explicitly covered above, this function returns a
26034 DECL, OVERLOAD, or baselink representing the result of the lookup.
26035 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26036 is returned.
26038 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26039 (e.g., "struct") that was used. In that case bindings that do not
26040 refer to types are ignored.
26042 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26043 ignored.
26045 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26046 are ignored.
26048 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26049 types.
26051 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26052 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26053 NULL_TREE otherwise. */
26055 static cp_expr
26062 location_t name_location)
26063 {
26064 tree decl;
26067 /* Assume that the lookup will be unambiguous. */
26071 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26072 no longer valid. Note that if we are parsing tentatively, and
26073 the parse fails, OBJECT_TYPE will be automatically restored. */
26079 /* A template-id has already been resolved; there is no lookup to
26080 do. */
26084 {
26088 }
26090 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26091 it should already have been checked to make sure that the name
26092 used matches the type being destroyed. */
26094 {
26095 tree type;
26097 /* Figure out to which type this destructor applies. */
26102 else
26104 /* If that's not a class type, there is no destructor. */
26115 }
26117 /* By this point, the NAME should be an ordinary identifier. If
26118 the id-expression was a qualified name, the qualifying scope is
26119 stored in PARSER->SCOPE at this point. */
26122 /* Perform the lookup. */
26124 {
26130 /* If the SCOPE is dependent, the lookup must be deferred until
26131 the template is instantiated -- unless we are explicitly
26132 looking up names in uninstantiated templates. Even then, we
26133 cannot look up the name if the scope is not a class type; it
26134 might, for example, be a template type parameter. */
26139 /* Defer lookup. */
26141 else
26142 {
26145 /* If PARSER->SCOPE is a dependent type, then it must be a
26146 class type, and we must not be checking dependencies;
26147 otherwise, we would have processed this lookup above. So
26148 that PARSER->SCOPE is not considered a dependent base by
26149 lookup_member, we must enter the scope here. */
26153 /* If the PARSER->SCOPE is a template specialization, it
26154 may be instantiated during name lookup. In that case,
26155 errors may be issued. Even if we rollback the current
26156 tentative parse, those errors are valid. */
26161 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26162 lookup result and the nested-name-specifier nominates a class C:
26163 * if the name specified after the nested-name-specifier, when
26164 looked up in C, is the injected-class-name of C (Clause 9), or
26165 * if the name specified after the nested-name-specifier is the
26166 same as the identifier or the simple-template-id's template-
26167 name in the last component of the nested-name-specifier,
26168 the name is instead considered to name the constructor of
26169 class C. [ Note: for example, the constructor is not an
26170 acceptable lookup result in an elaborated-type-specifier so
26171 the constructor would not be used in place of the
26172 injected-class-name. --end note ] Such a constructor name
26173 shall be used only in the declarator-id of a declaration that
26174 names a constructor or in a using-declaration. */
26182 /* If we have a single function from a using decl, pull it out. */
26189 }
26191 /* If the scope is a dependent type and either we deferred lookup or
26192 we did lookup but didn't find the name, rememeber the name. */
26195 {
26197 {
26198 tree type;
26200 /* The resolution to Core Issue 180 says that `struct
26201 A::B' should be considered a type-name, even if `A'
26202 is dependent. */
26207 }
26211 CPP_CLOSE_PAREN)))
26215 else
26218 is_template);
26219 }
26222 }
26224 {
26225 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26226 OBJECT_TYPE is not a class. */
26228 /* If the OBJECT_TYPE is a template specialization, it may
26229 be instantiated during name lookup. In that case, errors
26230 may be issued. Even if we rollback the current tentative
26231 parse, those errors are valid. */
26233 name,
26236 tf_warning_or_error);
26237 else
26241 /* Look it up in the enclosing context. DR 141: When looking for a
26242 template-name after -> or ., only consider class templates. */
26247 /* The object is type-dependent, so we can't look anything up; we used
26248 this to get the DR 141 behavior. */
26252 }
26253 else
26254 {
26260 }
26262 /* If the lookup failed, let our caller know. */
26266 /* Pull out the template from an injected-class-name (or multiple). */
26270 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26272 {
26275 /* The error message we have to print is too complicated for
26276 cp_parser_error, so we incorporate its actions directly. */
26278 {
26280 name);
26282 }
26284 }
26292 /* If we have resolved the name of a member declaration, check to
26293 see if the declaration is accessible. When the name resolves to
26294 set of overloaded functions, accessibility is checked when
26295 overload resolution is done.
26297 During an explicit instantiation, access is not checked at all,
26298 as per [temp.explicit]. */
26305 }
26307 /* Like cp_parser_lookup_name, but for use in the typical case where
26308 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26309 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26311 static tree
26313 {
26315 none_type,
26320 location);
26321 }
26323 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26324 the current context, return the TYPE_DECL. If TAG_NAME_P is
26325 true, the DECL indicates the class being defined in a class-head,
26326 or declared in an elaborated-type-specifier.
26328 Otherwise, return DECL. */
26330 static tree
26332 {
26333 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26334 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26336 struct A {
26337 template <typename T> struct B;
26338 };
26340 template <typename T> struct A::B {};
26342 Similarly, in an elaborated-type-specifier:
26344 namespace N { struct X{}; }
26346 struct A {
26347 template <typename T> friend struct N::X;
26348 };
26350 However, if the DECL refers to a class type, and we are in
26351 the scope of the class, then the name lookup automatically
26352 finds the TYPE_DECL created by build_self_reference rather
26353 than a TEMPLATE_DECL. For example, in:
26355 template <class T> struct S {
26356 S s;
26357 };
26359 there is no need to handle such case. */
26365 }
26367 /* If too many, or too few, template-parameter lists apply to the
26368 declarator, issue an error message. Returns TRUE if all went well,
26369 and FALSE otherwise. */
26371 static bool
26374 location_t declarator_location)
26375 {
26377 {
26379 {
26387 /* If the DECLARATOR has the form `X<y>' then it uses one
26388 additional level of template parameters. */
26391 return cp_parser_check_template_parameters
26393 }
26409 }
26411 }
26413 /* NUM_TEMPLATES were used in the current declaration. If that is
26414 invalid, return FALSE and issue an error messages. Otherwise,
26415 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26416 declarator and we can print more accurate diagnostics. */
26418 static bool
26421 location_t location,
26423 {
26424 /* If there are the same number of template classes and parameter
26425 lists, that's OK. */
26428 /* If there are more, but only one more, then we are referring to a
26429 member template. That's OK too. */
26432 /* If there are more template classes than parameter lists, we have
26433 something like:
26435 template <class T> void S<T>::R<T>::f (); */
26437 {
26447 else
26450 }
26451 /* Otherwise, there are too many template parameter lists. We have
26452 something like:
26454 template <class T> template <class U> void S::f(); */
26457 }
26459 /* Parse an optional `::' token indicating that the following name is
26460 from the global namespace. If so, PARSER->SCOPE is set to the
26461 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26462 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26463 Returns the new value of PARSER->SCOPE, if the `::' token is
26464 present, and NULL_TREE otherwise. */
26466 static tree
26468 {
26471 /* Peek at the next token. */
26473 /* If we're looking at a `::' token then we're starting from the
26474 global namespace, not our current location. */
26476 {
26477 /* Consume the `::' token. */
26479 /* Set the SCOPE so that we know where to start the lookup. */
26485 }
26487 {
26491 }
26494 }
26496 /* Returns TRUE if the upcoming token sequence is the start of a
26497 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26498 declarator is preceded by the `friend' specifier. */
26500 static bool
26502 {
26505 tree nested_name_specifier;
26508 /* The common case is that this is not a constructor declarator, so
26509 try to avoid doing lots of work if at all possible. It's not
26510 valid declare a constructor at function scope. */
26513 /* And only certain tokens can begin a constructor declarator. */
26521 /* Parse tentatively; we are going to roll back all of the tokens
26522 consumed here. */
26524 /* Assume that we are looking at a constructor declarator. */
26527 /* Look for the optional `::' operator. */
26530 /* Look for the nested-name-specifier. */
26531 nested_name_specifier
26542 /* Outside of a class-specifier, there must be a
26543 nested-name-specifier. Except in C++17 mode, where we
26544 might be declaring a guiding declaration. */
26551 /* If we have a class scope, this is easy; DR 147 says that S::S always
26552 names the constructor, and no other qualified name could. */
26555 {
26565 }
26566 /* If we still think that this might be a constructor-declarator,
26567 look for a class-name. */
26569 {
26570 /* If we have:
26572 template <typename T> struct S {
26573 S();
26574 };
26576 we must recognize that the nested `S' names a class. */
26580 tree type_decl;
26584 none_type,
26591 {
26597 none_type,
26602 else
26604 }
26606 /* If there was no class-name, then this is not a constructor.
26607 Otherwise, if we are in a class-specifier and we aren't
26608 handling a friend declaration, check that its type matches
26609 current_class_type (c++/38313). Note: error_mark_node
26610 is left alone for error recovery purposes. */
26612 && (outside_class_specifier_p
26618 /* If we're still considering a constructor, we have to see a `(',
26619 to begin the parameter-declaration-clause, followed by either a
26620 `)', an `...', or a decl-specifier. We need to check for a
26621 type-specifier to avoid being fooled into thinking that:
26623 S (f) (int);
26625 is a constructor. (It is actually a function named `f' that
26626 takes one parameter (of type `int') and returns a value of type
26627 `S'. */
26635 /* A parameter declaration begins with a decl-specifier,
26636 which is either the "attribute" keyword, a storage class
26637 specifier, or (usually) a type-specifier. */
26639 {
26640 tree type;
26644 /* Names appearing in the type-specifier should be looked up
26645 in the scope of the class. */
26649 {
26652 {
26656 {
26659 }
26660 }
26662 }
26664 /* Inside the constructor parameter list, surrounding
26665 template-parameter-lists do not apply. */
26666 saved_num_template_parameter_lists
26670 /* Look for the type-specifier. */
26672 CP_PARSER_FLAGS_NONE,
26678 parser->num_template_parameter_lists
26681 /* Leave the scope of the class. */
26686 }
26687 }
26689 /* We did not really want to consume any tokens. */
26693 }
26695 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26696 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26697 they must be performed once we are in the scope of the function.
26699 Returns the function defined. */
26701 static tree
26702 cp_parser_function_definition_from_specifiers_and_declarator
26705 tree attributes,
26707 {
26708 tree fn;
26711 /* Begin the function-definition. */
26714 /* The things we're about to see are not directly qualified by any
26715 template headers we've seen thus far. */
26718 /* If there were names looked up in the decl-specifier-seq that we
26719 did not check, check them now. We must wait until we are in the
26720 scope of the function to perform the checks, since the function
26721 might be a friend. */
26725 {
26730 }
26733 {
26734 /* Skip the entire function. */
26737 }
26739 {
26740 /* Seen already, skip it. An error message has already been output. */
26744 /* If this is a function from a class, pop the nested class. */
26747 }
26748 else
26749 {
26750 timevar_id_t tv;
26753 else
26759 }
26762 }
26764 /* Parse the part of a function-definition that follows the
26765 declarator. INLINE_P is TRUE iff this function is an inline
26766 function defined within a class-specifier.
26768 Returns the function defined. */
26770 static tree
26773 {
26774 tree fn;
26779 bool fully_implicit_function_template_p
26782 tree implicit_template_parms
26785 cp_binding_level* implicit_template_scope
26791 /* If the next token is `return', then the code may be trying to
26792 make use of the "named return value" extension that G++ used to
26793 support. */
26796 {
26797 /* Consume the `return' keyword. */
26799 /* Look for the identifier that indicates what value is to be
26800 returned. */
26802 /* Issue an error message. */
26805 /* Skip tokens until we reach the start of the function body. */
26807 {
26814 }
26815 }
26816 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26817 anything declared inside `f'. */
26818 saved_in_unbraced_linkage_specification_p
26821 /* Inside the function, surrounding template-parameter-lists do not
26822 apply. */
26823 saved_num_template_parameter_lists
26827 /* If the next token is `try', `__transaction_atomic', or
26828 `__transaction_relaxed`, then we are looking at either function-try-block
26829 or function-transaction-block. Note that all of these include the
26830 function-body. */
26834 RID_TRANSACTION_RELAXED))
26838 else
26839 cp_parser_ctor_initializer_opt_and_function_body
26842 /* Finish the function. */
26844 /* Generate code for it, if necessary. */
26846 /* Restore the saved values. */
26847 parser->in_unbraced_linkage_specification_p
26849 parser->num_template_parameter_lists
26853 parser->fully_implicit_function_template_p
26855 parser->implicit_template_parms
26857 parser->implicit_template_scope
26864 }
26866 /* Parse a template-declaration body (following argument list). */
26868 static void
26870 tree parameter_list,
26872 {
26876 /* We just processed one more parameter list. */
26879 /* Get the deferred access checks from the parameter list. These
26880 will be checked once we know what is being declared, as for a
26881 member template the checks must be performed in the scope of the
26882 class containing the member. */
26885 /* Tentatively parse for a new template parameter list, which can either be
26886 the template keyword or a template introduction. */
26892 else
26893 {
26894 /* There are no access checks when parsing a template, as we do not
26895 know if a specialization will be a friend. */
26899 checks,
26900 member_p,
26905 /* If this is a member template declaration, let the front
26906 end know. */
26908 {
26913 }
26918 }
26919 /* We are done with the current parameter list. */
26924 /* Finish up. */
26927 /* Check the template arguments for a literal operator template. */
26931 {
26935 else
26936 {
26939 {
26945 }
26947 {
26956 }
26957 else
26959 }
26961 {
26964 " Expected non-type template argument pack <char...>"
26966 decl);
26967 else
26970 decl);
26971 }
26972 }
26974 /* Register member declarations. */
26977 /* If DECL is a function template, we must return to parse it later.
26978 (Even though there is no definition, there might be default
26979 arguments that need handling.) */
26983 }
26985 /* Parse a template introduction header for a template-declaration. Returns
26986 false if tentative parse fails. */
26988 static bool
26990 {
26997 /* Look for the optional `::' operator. */
27000 /* Look for the nested-name-specifier. */
27010 /* Look up the concept for which we will be matching
27011 template parameters. */
27021 /* Look for opening brace for introduction. */
27022 matching_braces braces;
27030 /* Build vector of placeholder parameters and grab
27031 matching identifiers. */
27034 /* The introduction-list shall not be empty. */
27037 {
27040 }
27042 /* Look for closing brace for introduction. */
27047 {
27051 }
27053 /* Build and associate the constraint. */
27056 {
27058 member_p);
27060 }
27064 }
27066 /* Parse a normal template-declaration following the template keyword. */
27068 static void
27070 {
27071 tree parameter_list;
27075 /* Look for the `<' token. */
27079 {
27080 /* 14.5.2.2 [temp.mem]
27082 A local class shall not have member templates. */
27087 }
27088 /* [temp]
27090 A template ... shall not have C linkage. */
27092 {
27095 /* Give it C++ linkage to avoid confusing other parts of the
27096 front end. */
27099 }
27100 else
27103 /* We cannot perform access checks on the template parameter
27104 declarations until we know what is being declared, just as we
27105 cannot check the decl-specifier list. */
27108 /* If the next token is `>', then we have an invalid
27109 specialization. Rather than complain about an invalid template
27110 parameter, issue an error message here. */
27112 {
27116 }
27117 else
27118 {
27119 /* Parse the template parameters. */
27121 }
27123 /* Look for the `>'. */
27126 /* Manage template requirements */
27128 {
27133 }
27136 member_p);
27138 /* For the erroneous case of a template with C linkage, we pushed an
27139 implicit C++ linkage scope; exit that scope now. */
27142 }
27144 /* Parse a template-declaration, assuming that the `export' (and
27145 `extern') keywords, if present, has already been scanned. MEMBER_P
27146 is as for cp_parser_template_declaration. */
27148 static bool
27150 {
27152 {
27156 }
27161 }
27163 /* Perform the deferred access checks from a template-parameter-list.
27164 CHECKS is a TREE_LIST of access checks, as returned by
27165 get_deferred_access_checks. */
27167 static void
27168 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27169 {
27173 }
27175 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27176 `function-definition' sequence that follows a template header.
27177 If MEMBER_P is true, this declaration appears in a class scope.
27179 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27180 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27182 static tree
27188 {
27191 cp_decl_specifier_seq decl_specifiers;
27195 /* This function is only used when processing a template
27196 declaration. */
27200 /* Defer access checks until we know what is being declared. */
27203 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27204 alternative. */
27207 CP_PARSER_FLAGS_OPTIONAL,
27213 /* There are no template typedefs. */
27215 {
27219 }
27221 /* Gather up the access checks that occurred the
27222 decl-specifier-seq. */
27225 /* Check for the declaration of a template class. */
27227 {
27230 {
27231 // If this is a declaration, but not a definition, associate
27232 // any constraints with the type declaration. Constraints
27233 // are associated with definitions in cp_parser_class_specifier.
27239 /* In this case:
27241 struct C {
27242 friend template <typename T> struct A<T>::B;
27243 };
27245 A<T>::B will be represented by a TYPENAME_TYPE, and
27246 therefore not recognized by shadow_tag. */
27248 && !decl
27255 else
27258 /* Perform access checks for template parameters. */
27261 /* Give a helpful diagnostic for
27262 template <class T> struct A { } a;
27263 if we aren't already recovering from an error. */
27266 {
27268 "a class template declaration must not declare "
27272 }
27273 }
27274 }
27276 /* Complain about missing 'typename' or other invalid type names. */
27279 {
27280 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27281 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27282 the rest of this declaration. */
27285 }
27287 /* If it's not a template class, try for a template function. If
27288 the next token is a `;', then this declaration does not declare
27289 anything. But, if there were errors in the decl-specifiers, then
27290 the error might well have come from an attempted class-specifier.
27291 In that case, there's no need to warn about a missing declarator. */
27295 {
27298 checks,
27300 member_p,
27301 declares_class_or_enum,
27305 /* 7.1.1-1 [dcl.stc]
27307 A storage-class-specifier shall not be specified in an explicit
27308 specialization... */
27310 && explicit_specialization_p
27312 {
27316 }
27320 }
27322 /* Look for a trailing `;' after the declaration. */
27328 out:
27331 /* Clear any current qualification; whatever comes next is the start
27332 of something new. */
27338 }
27340 /* Parse a cast-expression that is not the operand of a unary "&". */
27342 static cp_expr
27344 {
27347 }
27349 /* Parse a functional cast to TYPE. Returns an expression
27350 representing the cast. */
27352 static cp_expr
27354 {
27356 tree expression_list;
27357 cp_expr cast;
27366 {
27376 /* Create a location of the form:
27377 type_name{i, f}
27378 ^~~~~~~~~~~~~~~
27379 with caret == start at the start of the type name,
27380 finishing at the closing brace. */
27381 location_t finish_loc
27384 finish_loc);
27387 }
27396 else
27397 {
27400 }
27403 tf_warning_or_error);
27404 /* [expr.const]/1: In an integral constant expression "only type
27405 conversions to integral or enumeration type can be used". */
27411 NIC_CONSTRUCTOR))
27414 /* Create a location of the form:
27415 float(i)
27416 ^~~~~~~~
27417 with caret == start at the start of the type name,
27418 finishing at the closing paren. */
27419 location_t finish_loc
27424 }
27426 /* Save the tokens that make up the body of a member function defined
27427 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27428 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27429 specifiers applied to the declaration. Returns the FUNCTION_DECL
27430 for the member function. */
27432 static tree
27436 tree attributes)
27437 {
27440 tree fn;
27443 /* Create the FUNCTION_DECL. */
27447 /* If something went badly wrong, bail out now. */
27449 {
27450 /* If there's a function-body, skip it. */
27455 }
27457 /* Remember it, if there default args to post process. */
27460 /* Save away the tokens that make up the body of the
27461 function. */
27467 RID_TRANSACTION_ATOMIC))
27468 {
27470 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27477 {
27483 }
27484 else
27487 {
27491 }
27492 }
27494 /* Handle function try blocks. */
27496 {
27499 }
27500 /* We can have braced-init-list mem-initializers before the fn body. */
27502 {
27505 {
27506 /* cache_group will stop after an un-nested { } pair, too. */
27510 /* variadic mem-inits have ... after the ')'. */
27513 }
27514 }
27516 /* Handle function try blocks. */
27522 /* Save away the inline definition; we will process it when the
27523 class is complete. */
27527 /* We need to know that this was defined in the class, so that
27528 friend templates are handled correctly. */
27531 /* Add FN to the queue of functions to be parsed later. */
27535 }
27537 /* Save the tokens that make up the in-class initializer for a non-static
27538 data member. Returns a DEFAULT_ARG. */
27540 static tree
27542 {
27544 }
27546 /* Parse a template-argument-list, as well as the trailing ">" (but
27547 not the opening "<"). See cp_parser_template_argument_list for the
27548 return value. */
27550 static tree
27552 {
27553 tree arguments;
27554 tree saved_scope;
27555 tree saved_qualifying_scope;
27556 tree saved_object_scope;
27561 /* [temp.names]
27563 When parsing a template-id, the first non-nested `>' is taken as
27564 the end of the template-argument-list rather than a greater-than
27565 operator. */
27566 saved_greater_than_is_operator_p
27569 /* Parsing the argument list may modify SCOPE, so we save it
27570 here. */
27574 /* We need to evaluate the template arguments, even though this
27575 template-id may be nested within a "sizeof". */
27580 /* Parse the template-argument-list itself. */
27584 else
27586 /* Look for the `>' that ends the template-argument-list. If we find
27587 a '>>' instead, it's probably just a typo. */
27589 {
27591 {
27592 /* In C++0x, a `>>' in a template argument list or cast
27593 expression is considered to be two separate `>'
27594 tokens. So, change the current token to a `>', but don't
27595 consume it: it will be consumed later when the outer
27596 template argument list (or cast expression) is parsed.
27597 Note that this replacement of `>' for `>>' is necessary
27598 even if we are parsing tentatively: in the tentative
27599 case, after calling
27600 cp_parser_enclosed_template_argument_list we will always
27601 throw away all of the template arguments and the first
27602 closing `>', either because the template argument list
27603 was erroneous or because we are replacing those tokens
27604 with a CPP_TEMPLATE_ID token. The second `>' (which will
27605 not have been thrown away) is needed either to close an
27606 outer template argument list or to complete a new-style
27607 cast. */
27610 }
27612 {
27613 /* If we're in a nested template argument list, the '>>' has
27614 to be a typo for '> >'. We emit the error message, but we
27615 continue parsing and we push a '>' as next token, so that
27616 the argument list will be parsed correctly. Note that the
27617 global source location is still on the token before the
27618 '>>', so we need to say explicitly where we want it. */
27626 }
27627 else
27628 {
27629 /* If this is not a nested template argument list, the '>>'
27630 is a typo for '>'. Emit an error message and continue.
27631 Same deal about the token location, but here we can get it
27632 right by consuming the '>>' before issuing the diagnostic. */
27635 "spurious %<>>%>, use %<>%> to terminate "
27637 }
27638 }
27639 else
27641 /* The `>' token might be a greater-than operator again now. */
27642 parser->greater_than_is_operator_p
27644 /* Restore the SAVED_SCOPE. */
27652 }
27654 /* MEMBER_FUNCTION is a member function, or a friend. If default
27655 arguments, or the body of the function have not yet been parsed,
27656 parse them now. */
27658 static void
27660 {
27662 /* If this member is a template, get the underlying
27663 FUNCTION_DECL. */
27667 /* There should not be any class definitions in progress at this
27668 point; the bodies of members are only parsed outside of all class
27669 definitions. */
27671 /* While we're parsing the member functions we might encounter more
27672 classes. We want to handle them right away, but we don't want
27673 them getting mixed up with functions that are currently in the
27674 queue. */
27677 /* Make sure that any template parameters are in scope. */
27680 /* If the body of the function has not yet been parsed, parse it
27681 now. */
27683 {
27684 tree function_scope;
27687 /* The function is no longer pending; we are processing it. */
27692 /* If this is a local class, enter the scope of the containing
27693 function. */
27698 /* Push the body of the function onto the lexer stack. */
27701 /* Let the front end know that we going to be defining this
27702 function. */
27706 /* Don't do access checking if it is a templated function. */
27710 /* #pragma omp declare reduction needs special parsing. */
27712 {
27717 }
27718 else
27719 /* Now, parse the body of the function. */
27726 /* Leave the scope of the containing function. */
27730 }
27732 /* Remove any template parameters from the symbol table. */
27735 /* Restore the queue. */
27738 }
27740 /* If DECL contains any default args, remember it on the unparsed
27741 functions queue. */
27743 static void
27745 {
27746 tree probe;
27749 probe;
27752 {
27756 }
27757 }
27759 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27760 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27761 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27762 from the parameter-type-list. */
27764 static tree
27767 {
27769 tree parsed_arg;
27775 /* Push the saved tokens for the default argument onto the parser's
27776 lexer stack. */
27782 /* Parse the default argument. */
27793 {
27794 /* In a non-template class, check conversions now. In a template,
27795 we'll wait and instantiate these as needed. */
27798 tf_warning_or_error);
27801 else
27803 }
27805 /* If the token stream has not been completely used up, then
27806 there was extra junk after the end of the default
27807 argument. */
27809 {
27812 else
27814 }
27816 /* Revert to the main lexer. */
27820 }
27822 /* FIELD is a non-static data member with an initializer which we saved for
27823 later; parse it now. */
27825 static void
27827 {
27828 tree def;
27835 NULL_TREE);
27841 }
27843 /* FN is a FUNCTION_DECL which may contains a parameter with an
27844 unparsed DEFAULT_ARG. Parse the default args now. This function
27845 assumes that the current scope is the scope in which the default
27846 argument should be processed. */
27848 static void
27850 {
27854 /* While we're parsing the default args, we might (due to the
27855 statement expression extension) encounter more classes. We want
27856 to handle them right away, but we don't want them getting mixed
27857 up with default args that are currently in the queue. */
27860 /* Local variable names (and the `this' keyword) may not appear
27861 in a default argument. */
27872 {
27874 tree parsed_arg;
27876 tree copy;
27883 /* This can happen for a friend declaration for a function
27884 already declared with default arguments. */
27887 parsed_arg
27889 default_arg,
27893 /* Update any instantiations we've already created. */
27897 }
27901 /* Make sure no default arg is missing. */
27904 /* Restore the state of local_variables_forbidden_p. */
27907 /* Restore the queue. */
27909 }
27911 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27913 sizeof ... ( identifier )
27915 where the 'sizeof' token has already been consumed. */
27917 static tree
27919 {
27920 /* Consume the `...'. */
27924 matching_parens parens;
27928 else
27936 /* The name is not qualified. */
27955 }
27957 /* Parse the operand of `sizeof' (or a similar operator). Returns
27958 either a TYPE or an expression, depending on the form of the
27959 input. The KEYWORD indicates which kind of expression we have
27960 encountered. */
27962 static tree
27964 {
27971 /* If it's a `...', then we are computing the length of a parameter
27972 pack. */
27977 /* Types cannot be defined in a `sizeof' expression. Save away the
27978 old message. */
27980 /* And create the new one. */
27986 /* The restrictions on constant-expressions do not apply inside
27987 sizeof expressions. */
27988 saved_integral_constant_expression_p
27990 saved_non_integral_constant_expression_p
27994 /* Do not actually evaluate the expression. */
27997 /* If it's a `(', then we might be looking at the type-id
27998 construction. */
28000 {
28003 /* We can't be sure yet whether we're looking at a type-id or an
28004 expression. */
28007 matching_parens parens;
28010 /* Note: as a GNU Extension, compound literals are considered
28011 postfix-expressions as they are in C99, so they are valid
28012 arguments to sizeof. See comment in cp_parser_cast_expression
28013 for details. */
28016 else
28017 {
28020 /* Look for the type-id. */
28022 /* Look for the closing `)'. */
28025 }
28027 /* If all went well, then we're done. */
28029 {
28030 cp_decl_specifier_seq decl_specs;
28032 /* Build a trivial decl-specifier-seq. */
28036 /* Call grokdeclarator to figure out what type this is. */
28039 TYPENAME,
28042 }
28043 }
28045 /* If the type-id production did not work out, then we must be
28046 looking at the unary-expression production. */
28050 /* Go back to evaluating expressions. */
28054 /* Free the message we created. */
28056 /* And restore the old one. */
28058 parser->integral_constant_expression_p
28060 parser->non_integral_constant_expression_p
28064 }
28066 /* If the current declaration has no declarator, return true. */
28068 static bool
28070 {
28071 /* If the next token is a `;' or a `,' then there is no
28072 declarator. */
28075 }
28077 /* Update the DECL_SPECS to reflect the storage class indicated by
28078 KEYWORD. */
28080 static void
28085 {
28086 cp_storage_class storage_class;
28089 {
28093 }
28095 {
28098 }
28103 {
28106 }
28109 {
28127 }
28131 /* A storage class specifier cannot be applied alongside a typedef
28132 specifier. If there is a typedef specifier present then set
28133 conflicting_specifiers_p which will trigger an error later
28134 on in grokdeclarator. */
28137 }
28139 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28140 is true, the type is a class or enum definition. */
28142 static void
28144 tree type_spec,
28147 {
28150 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28151 (with, for example, in "typedef int wchar_t;") we remember that
28152 this is what happened. In system headers, we ignore these
28153 declarations so that G++ can work with system headers that are not
28154 C++-safe. */
28156 && !type_definition_p
28166 {
28169 ds_redefined_builtin_type_spec,
28170 token);
28172 {
28176 }
28177 }
28180 else
28181 {
28186 }
28187 }
28189 /* True iff TOKEN is the GNU keyword __thread. */
28191 static bool
28193 {
28196 }
28198 /* Set the location for a declarator specifier and check if it is
28199 duplicated.
28201 DECL_SPECS is the sequence of declarator specifiers onto which to
28202 set the location.
28204 DS is the single declarator specifier to set which location is to
28205 be set onto the existing sequence of declarators.
28207 LOCATION is the location for the declarator specifier to
28208 consider. */
28210 static void
28213 {
28222 {
28226 }
28227 else
28228 {
28230 {
28234 else
28235 {
28238 OPT_Wlong_long,
28240 }
28241 }
28243 {
28248 else
28249 {
28253 }
28254 }
28255 else
28256 {
28272 "__complex"
28273 };
28277 }
28278 }
28279 }
28281 /* Return true iff the declarator specifier DS is present in the
28282 sequence of declarator specifiers DECL_SPECS. */
28284 bool
28286 cp_decl_spec ds)
28287 {
28294 }
28296 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28297 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28299 static bool
28301 {
28303 }
28305 /* Issue an error message indicating that TOKEN_DESC was expected.
28306 If KEYWORD is true, it indicated this function is called by
28307 cp_parser_require_keword and the required token can only be
28308 a indicated keyword.
28310 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28311 within any error as the location of an "opening" token matching
28312 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28313 RT_CLOSE_PAREN). */
28315 static void
28317 required_token token_desc,
28319 location_t matching_location)
28320 {
28326 {
28395 }
28398 {
28400 {
28478 }
28479 }
28483 }
28486 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28487 issue an error message indicating that TOKEN_DESC was expected.
28489 Returns the token consumed, if the token had the appropriate type.
28490 Otherwise, returns NULL.
28492 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28493 within any error as the location of an "opening" token matching
28494 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28495 RT_CLOSE_PAREN). */
28500 required_token token_desc,
28501 location_t matching_location)
28502 {
28505 else
28506 {
28507 /* Output the MESSAGE -- unless we're parsing tentatively. */
28510 matching_location);
28512 }
28513 }
28515 /* An error message is produced if the next token is not '>'.
28516 All further tokens are skipped until the desired token is
28517 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28519 static void
28521 {
28522 /* Current level of '< ... >'. */
28524 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28527 /* Are we ready, yet? If not, issue error message. */
28531 /* Skip tokens until the desired token is found. */
28533 {
28534 /* Peek at the next token. */
28536 {
28544 /* C++0x views the `>>' operator as two `>' tokens, but
28545 C++98 does not. */
28548 {
28549 /* We've hit a `>>' where the first `>' closes the
28550 template argument list, and the second `>' is
28551 spurious. Just consume the `>>' and stop; we've
28552 already produced at least one error. */
28555 }
28556 /* Fall through for C++0x, so we handle the second `>' in
28557 the `>>'. */
28562 {
28563 /* We've reached the token we want, consume it and stop. */
28566 }
28585 /* The '>' was probably forgotten, don't look further. */
28590 }
28592 /* Consume this token. */
28594 }
28595 }
28597 /* If the next token is the indicated keyword, consume it. Otherwise,
28598 issue an error message indicating that TOKEN_DESC was expected.
28600 Returns the token consumed, if the token had the appropriate type.
28601 Otherwise, returns NULL. */
28606 required_token token_desc)
28607 {
28611 {
28613 UNKNOWN_LOCATION);
28615 }
28618 }
28620 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28621 function-definition. */
28623 static bool
28625 {
28628 /* A ctor-initializer begins with a `:'. */
28630 /* A function-try-block begins with `try'. */
28632 /* A function-transaction-block begins with `__transaction_atomic'
28633 or `__transaction_relaxed'. */
28636 /* The named return value extension begins with `return'. */
28638 }
28640 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28641 definition. */
28643 static bool
28645 {
28652 }
28654 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28655 C++0x) ending a template-argument. */
28657 static bool
28659 {
28667 }
28669 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28670 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28672 static bool
28675 {
28681 /* Check for the sequence `<::' in the original code. It would be lexed as
28682 `[:', where `[' is a digraph, and there is no whitespace before
28683 `:'. */
28685 {
28690 }
28692 }
28694 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28695 or none_type otherwise. */
28697 static enum tag_types
28699 {
28701 {
28711 }
28712 }
28714 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28715 or none_type otherwise or if the token is null. */
28717 static enum tag_types
28719 {
28724 {
28732 }
28733 }
28735 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28737 static void
28739 {
28743 {
28747 type))
28750 }
28751 }
28753 /* Issue an error message if DECL is redeclared with different
28754 access than its original declaration [class.access.spec/3].
28755 This applies to nested classes, nested class templates and
28756 enumerations [class.mem/1]. */
28758 static void
28760 {
28771 }
28773 /* Look for the `template' keyword, as a syntactic disambiguator.
28774 Return TRUE iff it is present, in which case it will be
28775 consumed. */
28777 static bool
28779 {
28781 {
28782 /* In C++98 the `template' keyword can only be used within templates;
28783 outside templates the parser can always figure out what is a
28784 template and what is not. In C++11, per the resolution of DR 468,
28785 `template' is allowed in cases where it is not strictly necessary. */
28788 {
28791 "in C++98 %<template%> (as a disambiguator) is only "
28793 /* If this part of the token stream is rescanned, the same
28794 error message would be generated. So, we purge the token
28795 from the stream. */
28798 }
28799 else
28800 {
28801 /* Consume the `template' keyword. */
28804 }
28805 }
28807 }
28809 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28810 set PARSER->SCOPE, and perform other related actions. */
28812 static void
28814 {
28817 /* Get the stored value. */
28819 /* Set the scope from the stored value. */
28823 }
28825 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28826 encounter the end of a block before what we were looking for. */
28828 static bool
28832 {
28834 {
28837 /* Abort a parenthesized expression if we encounter a semicolon. */
28841 /* If we've reached the end of the file, stop. */
28847 /* We've hit the end of an enclosing block, so there's been some
28848 kind of syntax error. */
28851 /* Consume the token. */
28853 /* See if it starts a new group. */
28855 {
28857 /* In theory this should probably check end == '}', but
28858 cp_parser_save_member_function_body needs it to exit
28859 after either '}' or ')' when called with ')'. */
28862 }
28864 {
28868 }
28873 }
28874 }
28876 /* Like above, for caching a default argument or NSDMI. Both of these are
28877 terminated by a non-nested comma, but it can be unclear whether or not a
28878 comma is nested in a template argument list unless we do more parsing.
28879 In order to handle this ambiguity, when we encounter a ',' after a '<'
28880 we try to parse what follows as a parameter-declaration-list (in the
28881 case of a default argument) or a member-declarator (in the case of an
28882 NSDMI). If that succeeds, then we stop caching. */
28884 static tree
28886 {
28891 tree default_argument;
28893 /* Add tokens until we have processed the entire default
28894 argument. We add the range [first_token, token). */
28897 {
28898 /* For list-initialization, this is straightforward. */
28901 }
28903 {
28906 /* Peek at the next token. */
28908 /* What we do depends on what token we have. */
28910 {
28911 /* In valid code, a default argument must be
28912 immediately followed by a `,' `)', or `...'. */
28915 {
28916 /* If we've seen a '<', we might be in a
28917 template-argument-list. Until Core issue 325 is
28918 resolved, we don't know how this situation ought
28919 to be handled, so try to DTRT. We check whether
28920 what comes after the comma is a valid parameter
28921 declaration list. If it is, then the comma ends
28922 the default argument; otherwise the default
28923 argument continues. */
28927 /* Set ITALP so cp_parser_parameter_declaration_list
28928 doesn't decide to commit to this parse. */
28935 {
28936 /* Parse declarators until we reach a non-comma or
28937 somthing that cannot be an initializer.
28938 Just checking whether we're looking at a single
28939 declarator is insufficient. Consider:
28940 int var = tuple<T,U>::x;
28941 The template parameter 'U' looks exactly like a
28942 declarator. */
28943 do
28944 {
28955 }
28957 /* If we met an '=' or ';' then the original comma
28958 was the end of the NSDMI. Otherwise assume
28959 we're still in the NSDMI. */
28962 }
28963 else
28964 {
28969 }
28976 }
28977 /* FALLTHRU */
28980 /* If we run into a non-nested `;', `}', or `]',
28981 then the code is invalid -- but the default
28982 argument is certainly over. */
28987 /* Handle correctly int n = sizeof ... ( p ); */
28990 /* Update DEPTH, if necessary. */
29005 /* This might be the comparison operator, or it might
29006 start a template argument list. */
29013 /* Fall through for C++0x, which treats the `>>'
29014 operator like two `>' tokens in certain
29015 cases. */
29020 {
29021 /* This might be an operator, or it might close a
29022 template argument list. But if a previous '<'
29023 started a template argument list, this will have
29024 closed it, so we can't be in one anymore. */
29028 }
29031 /* If we run out of tokens, issue an error message. */
29039 /* In these cases, we should look for template-ids.
29040 For example, if the default argument is
29041 `X<int, double>()', we need to do name lookup to
29042 figure out whether or not `X' is a template; if
29043 so, the `,' does not end the default argument.
29045 That is not yet done. */
29050 }
29052 /* If we've reached the end, stop. */
29056 /* Add the token to the token block. */
29058 }
29060 /* Create a DEFAULT_ARG to represent the unparsed default
29061 argument. */
29068 }
29070 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29072 location_t
29074 {
29079 }
29081 /* Begin parsing tentatively. We always save tokens while parsing
29082 tentatively so that if the tentative parsing fails we can restore the
29083 tokens. */
29085 static void
29087 {
29088 /* Enter a new parsing context. */
29090 /* Begin saving tokens. */
29092 /* In order to avoid repetitive access control error messages,
29093 access checks are queued up until we are no longer parsing
29094 tentatively. */
29096 }
29098 /* Commit to the currently active tentative parse. */
29100 static void
29102 {
29106 /* Mark all of the levels as committed. */
29109 {
29116 }
29117 }
29119 /* Commit to the topmost currently active tentative parse.
29121 Note that this function shouldn't be called when there are
29122 irreversible side-effects while in a tentative state. For
29123 example, we shouldn't create a permanent entry in the symbol
29124 table, or issue an error message that might not apply if the
29125 tentative parse is aborted. */
29127 static void
29129 {
29134 {
29142 }
29143 }
29145 /* Abort the currently active tentative parse. All consumed tokens
29146 will be rolled back, and no diagnostics will be issued. */
29148 static void
29150 {
29154 /* Now, pretend that we want to see if the construct was
29155 successfully parsed. */
29157 }
29159 /* Stop parsing tentatively. If a parse error has occurred, restore the
29160 token stream. Otherwise, commit to the tokens we have consumed.
29161 Returns true if no error occurred; false otherwise. */
29163 static bool
29165 {
29169 /* Remember whether or not an error occurred, since we are about to
29170 destroy that information. */
29172 /* Remove the topmost context from the stack. */
29175 /* If no parse errors occurred, commit to the tentative parse. */
29177 {
29178 /* Commit to the tokens read tentatively, unless that was
29179 already done. */
29184 }
29185 /* Otherwise, if errors occurred, roll back our state so that things
29186 are just as they were before we began the tentative parse. */
29187 else
29188 {
29191 }
29192 /* Add the context to the front of the free list. */
29197 }
29199 /* Returns true if we are parsing tentatively and are not committed to
29200 this tentative parse. */
29202 static bool
29204 {
29207 }
29209 /* Returns nonzero iff an error has occurred during the most recent
29210 tentative parse. */
29212 static bool
29214 {
29217 }
29219 /* Returns nonzero if GNU extensions are allowed. */
29221 static bool
29223 {
29225 }
29226 \f
29227 /* Objective-C++ Productions */
29230 /* Parse an Objective-C expression, which feeds into a primary-expression
29231 above.
29233 objc-expression:
29234 objc-message-expression
29235 objc-string-literal
29236 objc-encode-expression
29237 objc-protocol-expression
29238 objc-selector-expression
29240 Returns a tree representation of the expression. */
29242 static cp_expr
29244 {
29245 /* Try to figure out what kind of declaration is present. */
29249 {
29259 {
29271 }
29272 /* FALLTHRU */
29278 }
29281 }
29283 /* Parse an Objective-C message expression.
29285 objc-message-expression:
29286 [ objc-message-receiver objc-message-args ]
29288 Returns a representation of an Objective-C message. */
29290 static tree
29292 {
29304 /* Construct a location e.g.
29305 [self func1:5]
29306 ^~~~~~~~~~~~~~
29307 ranging from the '[' to the ']', with the caret at the start. */
29312 }
29314 /* Parse an objc-message-receiver.
29316 objc-message-receiver:
29317 expression
29318 simple-type-specifier
29320 Returns a representation of the type or expression. */
29322 static tree
29324 {
29325 tree rcv;
29327 /* An Objective-C message receiver may be either (1) a type
29328 or (2) an expression. */
29332 /* If that worked out, fine. */
29339 CP_PARSER_FLAGS_NONE);
29346 }
29348 /* Parse the arguments and selectors comprising an Objective-C message.
29350 objc-message-args:
29351 objc-selector
29352 objc-selector-args
29353 objc-selector-args , objc-comma-args
29355 objc-selector-args:
29356 objc-selector [opt] : assignment-expression
29357 objc-selector-args objc-selector [opt] : assignment-expression
29359 objc-comma-args:
29360 assignment-expression
29361 objc-comma-args , assignment-expression
29363 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29364 selector arguments and TREE_VALUE containing a list of comma
29365 arguments. */
29367 static tree
29369 {
29375 {
29381 /* Detect if we have a unary selector. */
29390 sel_args
29395 }
29397 /* Handle non-selector arguments, if any. */
29399 {
29400 tree arg;
29405 addl_args
29410 }
29413 {
29416 }
29419 }
29421 /* Parse an Objective-C encode expression.
29423 objc-encode-expression:
29424 @encode objc-typename
29426 Returns an encoded representation of the type argument. */
29428 static cp_expr
29430 {
29431 tree type;
29436 matching_parens parens;
29443 {
29447 }
29449 /* This happens if we find @encode(T) (where T is a template
29450 typename or something dependent on a template typename) when
29451 parsing a template. In that case, we can't compile it
29452 immediately, but we rather create an AT_ENCODE_EXPR which will
29453 need to be instantiated when the template is used.
29454 */
29456 {
29460 }
29463 /* Build a location of the form:
29464 @encode(int)
29465 ^~~~~~~~~~~~
29466 with caret==start at the @ token, finishing at the close paren. */
29467 location_t combined_loc
29472 }
29474 /* Parse an Objective-C @defs expression. */
29476 static tree
29478 {
29479 tree name;
29482 matching_parens parens;
29488 }
29490 /* Parse an Objective-C protocol expression.
29492 objc-protocol-expression:
29493 @protocol ( identifier )
29495 Returns a representation of the protocol expression. */
29497 static tree
29499 {
29500 tree proto;
29504 matching_parens parens;
29509 /* Build a location of the form:
29510 @protocol(prot)
29511 ^~~~~~~~~~~~~~~
29512 with caret==start at the @ token, finishing at the close paren. */
29513 location_t combined_loc
29519 }
29521 /* Parse an Objective-C selector expression.
29523 objc-selector-expression:
29524 @selector ( objc-method-signature )
29526 objc-method-signature:
29527 objc-selector
29528 objc-selector-seq
29530 objc-selector-seq:
29531 objc-selector :
29532 objc-selector-seq objc-selector :
29534 Returns a representation of the method selector. */
29536 static tree
29538 {
29545 matching_parens parens;
29551 {
29560 {
29561 /* Detect if we have a unary selector. */
29563 {
29566 }
29567 else
29568 {
29570 }
29571 }
29576 {
29577 sel_seq
29580 sel_seq
29583 }
29584 else
29585 sel_seq
29590 }
29592 finish_selector:
29596 /* Build a location of the form:
29597 @selector(func)
29598 ^~~~~~~~~~~~~~~
29599 with caret==start at the @ token, finishing at the close paren. */
29600 location_t combined_loc
29604 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29607 }
29609 /* Parse a list of identifiers.
29611 objc-identifier-list:
29612 identifier
29613 objc-identifier-list , identifier
29615 Returns a TREE_LIST of identifier nodes. */
29617 static tree
29619 {
29620 tree identifier;
29621 tree list;
29632 {
29639 identifier));
29641 }
29644 }
29646 /* Parse an Objective-C alias declaration.
29648 objc-alias-declaration:
29649 @compatibility_alias identifier identifier ;
29651 This function registers the alias mapping with the Objective-C front end.
29652 It returns nothing. */
29654 static void
29656 {
29664 }
29666 /* Parse an Objective-C class forward-declaration.
29668 objc-class-declaration:
29669 @class objc-identifier-list ;
29671 The function registers the forward declarations with the Objective-C
29672 front end. It returns nothing. */
29674 static void
29676 {
29679 {
29680 tree id;
29690 else
29692 }
29694 }
29696 /* Parse a list of Objective-C protocol references.
29698 objc-protocol-refs-opt:
29699 objc-protocol-refs [opt]
29701 objc-protocol-refs:
29702 < objc-identifier-list >
29704 Returns a TREE_LIST of identifiers, if any. */
29706 static tree
29708 {
29712 {
29716 }
29719 }
29721 /* Parse a Objective-C visibility specification. */
29723 static void
29725 {
29729 {
29744 }
29746 /* Eat '@private'/'@protected'/'@public'. */
29748 }
29750 /* Parse an Objective-C method type. Return 'true' if it is a class
29751 (+) method, and 'false' if it is an instance (-) method. */
29755 {
29758 else
29760 }
29762 /* Parse an Objective-C protocol qualifier. */
29764 static tree
29766 {
29779 {
29784 }
29787 }
29789 /* Parse an Objective-C typename. */
29791 static tree
29793 {
29797 {
29800 matching_parens parens;
29804 /* An ObjC type name may consist of just protocol qualifiers, in which
29805 case the type shall default to 'id'. */
29807 {
29810 /* If the type could not be parsed, an error has already
29811 been produced. For error recovery, behave as if it had
29812 not been specified, which will use the default type
29813 'id'. */
29815 {
29817 /* We need to skip to the closing parenthesis as
29818 cp_parser_type_id() does not seem to do it for
29819 us. */
29824 }
29825 }
29829 }
29832 }
29834 /* Check to see if TYPE refers to an Objective-C selector name. */
29836 static bool
29838 {
29844 }
29846 /* Parse an Objective-C selector. */
29848 static tree
29850 {
29854 {
29857 }
29859 /* C++ operator names are allowed to appear in ObjC selectors. */
29861 {
29874 }
29875 }
29877 /* Parse an Objective-C params list. */
29879 static tree
29881 {
29887 {
29897 /* Detect if we have a unary selector. */
29900 {
29903 }
29907 {
29908 /* Something went quite wrong. There should be a colon
29909 here, but there is not. Stop parsing parameters. */
29911 }
29913 /* New ObjC allows attributes on parameters too. */
29918 params
29921 type_name,
29922 identifier,
29923 parm_attr));
29926 }
29929 {
29932 }
29934 /* We allow tail attributes for the method. */
29936 {
29944 }
29947 {
29950 }
29952 }
29954 /* Parse the non-keyword Objective-C params. */
29956 static tree
29959 {
29965 {
29967 tree parm;
29973 {
29978 }
29980 /* TODO: parse attributes for tail parameters. */
29989 }
29991 /* We allow tail attributes for the method. */
29993 {
29995 {
30000 }
30001 else
30002 /* We have an error, but parse the attributes, so that we can
30003 carry on. */
30009 }
30012 }
30014 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30016 static void
30018 {
30021 /* If the next token is `extern' and the following token is a string
30022 literal, then we have a linkage specification. */
30024 && cp_parser_is_pure_string_literal
30027 /* Handle #pragma, if any. */
30030 /* Allow stray semicolons. */
30033 /* Mark methods as optional or required, when building protocols. */
30035 {
30038 }
30040 {
30043 }
30046 /* Other stray characters must generate errors. */
30048 {
30052 }
30053 /* Finally, try to parse a block-declaration, or a function-definition. */
30054 else
30056 }
30058 /* Parse a method signature. */
30060 static tree
30062 {
30078 }
30080 static bool
30082 {
30083 tree tattr;
30088 /* If the attributes are followed by a method introducer, this is not allowed.
30089 Dump the attributes and flag the situation. */
30094 /* Otherwise, the attributes introduce some interstitial code, possibly so
30095 rewind to allow that check. */
30098 }
30100 /* Parse an Objective-C method prototype list. */
30102 static void
30104 {
30108 {
30110 {
30115 else
30119 {
30123 }
30126 }
30132 OPT_Wattributes,
30134 else
30135 /* Allow for interspersed non-ObjC++ code. */
30139 }
30143 else
30147 }
30149 /* Parse an Objective-C method definition list. */
30151 static void
30153 {
30157 {
30158 tree meth;
30161 {
30167 else
30172 {
30176 }
30178 NULL_TREE);
30180 /* For historical reasons, we accept an optional semicolon. */
30187 {
30194 }
30195 }
30196 /* The following case will be removed once @synthesize is
30197 completely implemented. */
30208 else
30209 /* Allow for interspersed non-ObjC++ code. */
30213 }
30217 else
30221 }
30223 /* Parse Objective-C ivars. */
30225 static void
30227 {
30238 {
30239 cp_decl_specifier_seq declspecs;
30241 tree prefix_attributes;
30249 CP_PARSER_FLAGS_OPTIONAL,
30253 /* auto, register, static, extern, mutable. */
30255 {
30258 }
30260 /* thread_local. */
30262 {
30265 }
30267 /* typedef. */
30269 {
30272 }
30277 /* Keep going until we hit the `;' at the end of the
30278 declaration. */
30280 {
30285 /* Check for a (possibly unnamed) bitfield declaration. */
30293 {
30294 /* Get the name of the bitfield. */
30297 sfk_none);
30299 eat_colon:
30301 /* Get the width of the bitfield. */
30302 width
30304 }
30305 else
30306 {
30307 /* Parse the declarator. */
30308 declarator
30314 }
30316 /* Look for attributes that apply to the ivar. */
30318 /* Remember which attributes are prefix attributes and
30319 which are not. */
30321 /* Combine the attributes. */
30325 /* Create the bitfield declaration. */
30328 else
30333 /* Add the instance variable. */
30337 /* Reset PREFIX_ATTRIBUTES. */
30339 {
30344 }
30349 {
30352 }
30354 }
30358 }
30363 /* Do not consume the RID_AT_END, so it will be read again as terminating
30364 the @interface of @implementation. */
30368 /* For historical reasons, we accept an optional semicolon. */
30371 }
30373 /* Parse an Objective-C protocol declaration. */
30375 static void
30377 {
30383 {
30388 }
30390 /* See if we have a forward declaration or a definition. */
30393 /* Try a forward declaration first. */
30395 {
30397 {
30398 tree id;
30408 else
30410 }
30412 }
30414 /* Ok, we got a full-fledged definition (or at least should). */
30415 else
30416 {
30421 }
30422 }
30424 /* Parse an Objective-C superclass or category. */
30426 static void
30431 {
30437 {
30440 }
30442 {
30443 matching_parens parens;
30446 /* If there is no category name, and this is an @interface, we
30447 have a class extension. */
30449 {
30452 }
30453 else
30457 }
30458 }
30460 /* Parse an Objective-C class interface. */
30462 static void
30464 {
30471 {
30472 /* It's hard to recover because even if valid @interface stuff
30473 is to follow, we can't compile it (or validate it) if we
30474 don't even know which class it refers to. Let's assume this
30475 was a stray '@interface' token in the stream and skip it.
30476 */
30478 }
30483 /* We have either a class or a category on our hands. */
30486 else
30487 {
30489 /* Handle instance variable declarations, if any. */
30492 }
30495 }
30497 /* Parse an Objective-C class implementation. */
30499 static void
30501 {
30508 {
30509 /* It's hard to recover because even if valid @implementation
30510 stuff is to follow, we can't compile it (or validate it) if
30511 we don't even know which class it refers to. Let's assume
30512 this was a stray '@implementation' token in the stream and
30513 skip it.
30514 */
30516 }
30520 /* We have either a class or a category on our hands. */
30523 else
30524 {
30526 /* Handle instance variable declarations, if any. */
30529 }
30532 }
30534 /* Consume the @end token and finish off the implementation. */
30536 static void
30538 {
30541 }
30543 /* Parse an Objective-C declaration. */
30545 static void
30547 {
30548 /* Try to figure out what kind of declaration is present. */
30553 {
30569 }
30572 {
30595 }
30596 }
30598 /* Parse an Objective-C try-catch-finally statement.
30600 objc-try-catch-finally-stmt:
30601 @try compound-statement objc-catch-clause-seq [opt]
30602 objc-finally-clause [opt]
30604 objc-catch-clause-seq:
30605 objc-catch-clause objc-catch-clause-seq [opt]
30607 objc-catch-clause:
30608 @catch ( objc-exception-declaration ) compound-statement
30610 objc-finally-clause:
30611 @finally compound-statement
30613 objc-exception-declaration:
30614 parameter-declaration
30615 '...'
30617 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30619 Returns NULL_TREE.
30621 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30622 for C. Keep them in sync. */
30624 static tree
30626 {
30627 location_t location;
30628 tree stmt;
30633 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30634 node, lest it get absorbed into the surrounding block. */
30640 {
30644 matching_parens parens;
30650 {
30651 /* We have "@catch (...)" (where the '...' are literally
30652 what is in the code). Skip the '...'.
30653 parameter_declaration is set to NULL_TREE, and
30654 objc_being_catch_clauses() knows that that means
30655 '...'. */
30658 }
30659 else
30660 {
30661 /* We have "@catch (NSException *exception)" or something
30662 like that. Parse the parameter declaration. */
30666 else
30671 }
30674 else
30675 {
30676 /* If there was no open parenthesis, we are recovering from
30677 an error, and we are trying to figure out what mistake
30678 the user has made. */
30680 /* If there is an immediate closing parenthesis, the user
30681 probably forgot the opening one (ie, they typed "@catch
30682 NSException *e)". Parse the closing parenthesis and keep
30683 going. */
30687 /* If these is no immediate closing parenthesis, the user
30688 probably doesn't know that parenthesis are required at
30689 all (ie, they typed "@catch NSException *e"). So, just
30690 forget about the closing parenthesis and keep going. */
30691 }
30695 }
30697 {
30700 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30701 node, lest it get absorbed into the surrounding block. */
30705 }
30708 }
30710 /* Parse an Objective-C synchronized statement.
30712 objc-synchronized-stmt:
30713 @synchronized ( expression ) compound-statement
30715 Returns NULL_TREE. */
30717 static tree
30719 {
30720 location_t location;
30727 matching_parens parens;
30732 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30733 node, lest it get absorbed into the surrounding block. */
30738 }
30740 /* Parse an Objective-C throw statement.
30742 objc-throw-stmt:
30743 @throw assignment-expression [opt] ;
30745 Returns a constructed '@throw' statement. */
30747 static tree
30749 {
30761 }
30763 /* Parse an Objective-C statement. */
30765 static tree
30767 {
30768 /* Try to figure out what kind of declaration is present. */
30772 {
30783 }
30786 }
30788 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30789 look ahead to see if an objc keyword follows the attributes. This
30790 is to detect the use of prefix attributes on ObjC @interface and
30791 @protocol. */
30793 static bool
30795 {
30800 {
30803 }
30806 }
30808 /* This routine is a minimal replacement for
30809 c_parser_struct_declaration () used when parsing the list of
30810 types/names or ObjC++ properties. For example, when parsing the
30811 code
30813 @property (readonly) int a, b, c;
30815 this function is responsible for parsing "int a, int b, int c" and
30816 returning the declarations as CHAIN of DECLs.
30818 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30819 similar parsing. */
30820 static tree
30822 {
30824 cp_decl_specifier_seq declspecs;
30826 tree prefix_attributes;
30829 CP_PARSER_FLAGS_NONE,
30836 /* auto, register, static, extern, mutable. */
30838 {
30841 }
30843 /* thread_local. */
30845 {
30848 }
30850 /* typedef. */
30852 {
30855 }
30860 /* Keep going until we hit the `;' at the end of the declaration. */
30862 {
30867 /* Parse the declarator. */
30871 /* Look for attributes that apply to the ivar. */
30873 /* Remember which attributes are prefix attributes and
30874 which are not. */
30876 /* Combine the attributes. */
30886 /* Reset PREFIX_ATTRIBUTES. */
30888 {
30893 }
30900 {
30903 }
30904 else
30906 }
30908 }
30910 /* Parse an Objective-C @property declaration. The syntax is:
30912 objc-property-declaration:
30913 '@property' objc-property-attributes[opt] struct-declaration ;
30915 objc-property-attributes:
30916 '(' objc-property-attribute-list ')'
30918 objc-property-attribute-list:
30919 objc-property-attribute
30920 objc-property-attribute-list, objc-property-attribute
30922 objc-property-attribute
30923 'getter' = identifier
30924 'setter' = identifier
30925 'readonly'
30926 'readwrite'
30927 'assign'
30928 'retain'
30929 'copy'
30930 'nonatomic'
30932 For example:
30933 @property NSString *name;
30934 @property (readonly) id object;
30935 @property (retain, nonatomic, getter=getTheName) id name;
30936 @property int a, b, c;
30938 PS: This function is identical to
30939 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30940 static void
30942 {
30943 /* The following variables hold the attributes of the properties as
30944 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30945 seen. When we see an attribute, we set them to 'true' (if they
30946 are boolean properties) or to the identifier (if they have an
30947 argument, ie, for getter and setter). Note that here we only
30948 parse the list of attributes, check the syntax and accumulate the
30949 attributes that we find. objc_add_property_declaration() will
30950 then process the information. */
30960 /* 'properties' is the list of properties that we read. Usually a
30961 single one, but maybe more (eg, in "@property int a, b, c;" there
30962 are three). */
30963 tree properties;
30964 location_t loc;
30970 /* Parse the optional attribute list... */
30972 {
30973 /* Eat the '('. */
30974 matching_parens parens;
30978 {
30984 {
30987 }
30991 {
31002 {
31006 else
31011 }
31014 {
31018 }
31020 {
31022 {
31025 }
31026 else
31030 else
31032 }
31033 else
31034 {
31036 {
31039 }
31040 else
31042 }
31048 }
31055 else
31057 }
31059 /* FIXME: "@property (setter, assign);" will generate a spurious
31060 "error: expected ‘)’ before ‘,’ token". This is because
31061 cp_parser_require, unlike the C counterpart, will produce an
31062 error even if we are in error recovery. */
31064 {
31069 }
31070 }
31072 /* ... and the property declaration(s). */
31076 {
31078 /* If the next token is now a `;', consume it. */
31082 }
31086 else
31087 {
31088 /* Comma-separated properties are chained together in
31089 reverse order; add them one by one. */
31098 }
31101 }
31103 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31105 objc-synthesize-declaration:
31106 @synthesize objc-synthesize-identifier-list ;
31108 objc-synthesize-identifier-list:
31109 objc-synthesize-identifier
31110 objc-synthesize-identifier-list, objc-synthesize-identifier
31112 objc-synthesize-identifier
31113 identifier
31114 identifier = identifier
31116 For example:
31117 @synthesize MyProperty;
31118 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31120 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31121 for C. Keep them in sync.
31122 */
31123 static void
31125 {
31127 location_t loc;
31132 {
31136 {
31139 }
31141 {
31145 {
31148 }
31149 }
31150 else
31155 else
31157 }
31160 }
31162 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31164 objc-dynamic-declaration:
31165 @dynamic identifier-list ;
31167 For example:
31168 @dynamic MyProperty;
31169 @dynamic MyProperty, AnotherProperty;
31171 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31172 for C. Keep them in sync.
31173 */
31174 static void
31176 {
31178 location_t loc;
31183 {
31184 tree property;
31187 {
31190 }
31194 else
31196 }
31199 }
31201 \f
31202 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31204 /* Returns name of the next clause.
31205 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31206 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31207 returned and the token is consumed. */
31209 static pragma_omp_clause
31211 {
31227 {
31232 {
31409 }
31410 }
31416 }
31418 /* Validate that a clause of the given type does not already exist. */
31420 static void
31423 {
31424 tree c;
31428 {
31431 }
31432 }
31434 /* OpenMP 2.5:
31435 variable-list:
31436 identifier
31437 variable-list , identifier
31439 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31440 colon). An opening parenthesis will have been consumed by the caller.
31442 If KIND is nonzero, create the appropriate node and install the decl
31443 in OMP_CLAUSE_DECL and add the node to the head of the list.
31445 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31446 return the list created.
31448 COLON can be NULL if only closing parenthesis should end the list,
31449 or pointer to bool which will receive false if the list is terminated
31450 by closing parenthesis or true if the list is terminated by colon. */
31452 static tree
31455 {
31459 {
31462 }
31464 {
31469 && current_class_ptr
31471 {
31477 }
31478 else
31479 {
31490 else
31495 }
31497 ;
31499 {
31501 {
31503 /* The OpenACC cache directive explicitly only allows "array
31504 elements or subarrays". */
31506 {
31510 }
31511 /* FALLTHROUGH. */
31516 {
31517 location_t loc
31522 decl
31526 }
31527 /* FALLTHROUGH. */
31531 {
31539 parser->colon_corrects_to_scope_p
31543 else
31544 {
31545 /* Look for `:'. */
31549 CPP_CLOSE_SQUARE))
31551 }
31552 /* Look for the closing `]'. */
31554 RT_CLOSE_SQUARE))
31558 }
31562 }
31568 }
31569 else
31572 get_comma:
31576 }
31582 {
31586 }
31589 {
31592 /* Try to resync to an unnested comma. Copied from
31593 cp_parser_parenthesized_expression_list. */
31594 skip_comma:
31603 }
31606 }
31608 /* Similarly, but expect leading and trailing parenthesis. This is a very
31609 common case for omp clauses. */
31611 static tree
31613 {
31617 }
31619 /* OpenACC 2.0:
31620 copy ( variable-list )
31621 copyin ( variable-list )
31622 copyout ( variable-list )
31623 create ( variable-list )
31624 delete ( variable-list )
31625 present ( variable-list )
31626 present_or_copy ( variable-list )
31627 pcopy ( variable-list )
31628 present_or_copyin ( variable-list )
31629 pcopyin ( variable-list )
31630 present_or_copyout ( variable-list )
31631 pcopyout ( variable-list )
31632 present_or_create ( variable-list )
31633 pcreate ( variable-list ) */
31635 static tree
31637 tree list)
31638 {
31641 {
31687 }
31695 }
31697 /* OpenACC 2.0:
31698 deviceptr ( variable-list ) */
31700 static tree
31702 {
31706 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31707 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31708 variable-list must only allow for pointer variables. */
31711 {
31718 }
31721 }
31723 /* OpenACC 2.0:
31724 auto
31725 independent
31726 nohost
31727 seq */
31729 static tree
31733 {
31738 }
31740 /* OpenACC:
31741 num_gangs ( expression )
31742 num_workers ( expression )
31743 vector_length ( expression ) */
31745 static tree
31748 {
31751 matching_parens parens;
31759 {
31764 }
31772 }
31774 /* OpenACC:
31776 gang [( gang-arg-list )]
31777 worker [( [num:] int-expr )]
31778 vector [( [length:] int-expr )]
31780 where gang-arg is one of:
31782 [num:] int-expr
31783 static: size-expr
31785 and size-expr may be:
31787 *
31788 int-expr
31789 */
31791 static tree
31794 {
31804 {
31805 matching_parens parens;
31808 do
31809 {
31813 /* Gang static argument. */
31816 {
31824 {
31827 }
31829 /* Check for the '*' argument. */
31833 CPP_CLOSE_PAREN)))
31834 {
31839 {
31842 }
31844 }
31845 }
31846 /* Worker num: argument and vector length: arguments. */
31850 {
31853 }
31855 /* Now collect the actual argument. */
31857 {
31860 }
31872 {
31875 }
31877 }
31882 }
31896 cleanup_error:
31899 }
31901 /* OpenACC 2.0:
31902 tile ( size-expr-list ) */
31904 static tree
31906 {
31910 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31911 so, but the spec authors never considered such a case and have
31912 differing opinions on what it might mean, including 'not
31913 allowed'.) */
31916 clause_loc);
31921 do
31922 {
31929 {
31932 }
31933 else
31937 }
31940 /* Consume the trailing ')'. */
31948 }
31950 /* OpenACC 2.0
31951 Parse wait clause or directive parameters. */
31953 static tree
31955 {
31965 {
31970 }
31977 {
31981 {
31984 else
31985 {
31992 }
31993 }
31994 }
31997 }
31999 /* OpenACC:
32000 wait ( int-expr-list ) */
32002 static tree
32004 {
32013 }
32015 /* OpenMP 3.0:
32016 collapse ( constant-expression ) */
32018 static tree
32020 {
32022 location_t loc;
32023 HOST_WIDE_INT n;
32026 matching_parens parens;
32044 {
32047 }
32056 }
32058 /* OpenMP 2.5:
32059 default ( none | shared )
32061 OpenACC:
32062 default ( none | present ) */
32064 static tree
32067 {
32069 tree c;
32071 matching_parens parens;
32075 {
32080 {
32101 }
32104 }
32105 else
32106 {
32107 invalid_kind:
32110 else
32112 }
32129 }
32131 /* OpenMP 3.1:
32132 final ( expression ) */
32134 static tree
32136 {
32139 matching_parens parens;
32158 }
32160 /* OpenMP 2.5:
32161 if ( expression )
32163 OpenMP 4.5:
32164 if ( directive-name-modifier : expression )
32166 directive-name-modifier:
32167 parallel | task | taskloop | target data | target | target update
32168 | target enter data | target exit data */
32170 static tree
32173 {
32177 matching_parens parens;
32182 {
32194 {
32197 {
32210 else
32211 {
32212 location_t loc
32217 }
32220 {
32222 {
32227 }
32229 {
32230 location_t loc
32234 }
32235 }
32236 }
32237 }
32239 {
32241 {
32244 }
32245 else
32246 {
32248 {
32249 location_t loc
32252 }
32254 }
32255 }
32256 }
32268 {
32271 {
32274 {
32284 }
32286 p);
32288 }
32290 {
32293 else
32296 }
32299 {
32303 }
32304 }
32312 }
32314 /* OpenMP 3.1:
32315 mergeable */
32317 static tree
32320 {
32321 tree c;
32324 location);
32329 }
32331 /* OpenMP 2.5:
32332 nowait */
32334 static tree
32337 {
32338 tree c;
32345 }
32347 /* OpenMP 2.5:
32348 num_threads ( expression ) */
32350 static tree
32352 location_t location)
32353 {
32356 matching_parens parens;
32376 }
32378 /* OpenMP 4.5:
32379 num_tasks ( expression ) */
32381 static tree
32383 location_t location)
32384 {
32387 matching_parens parens;
32407 }
32409 /* OpenMP 4.5:
32410 grainsize ( expression ) */
32412 static tree
32414 location_t location)
32415 {
32418 matching_parens parens;
32438 }
32440 /* OpenMP 4.5:
32441 priority ( expression ) */
32443 static tree
32445 location_t location)
32446 {
32449 matching_parens parens;
32469 }
32471 /* OpenMP 4.5:
32472 hint ( expression ) */
32474 static tree
32476 location_t location)
32477 {
32480 matching_parens parens;
32499 }
32501 /* OpenMP 4.5:
32502 defaultmap ( tofrom : scalar ) */
32504 static tree
32506 location_t location)
32507 {
32511 matching_parens parens;
32516 {
32519 }
32523 {
32526 }
32532 {
32535 }
32539 {
32542 }
32548 location);
32554 out_err:
32559 }
32561 /* OpenMP 2.5:
32562 ordered
32564 OpenMP 4.5:
32565 ordered ( constant-expression ) */
32567 static tree
32570 {
32572 HOST_WIDE_INT n;
32578 {
32579 matching_parens parens;
32596 {
32598 "ordered argument needs positive constant integer "
32601 }
32602 }
32608 }
32610 /* OpenMP 2.5:
32611 reduction ( reduction-operator : variable-list )
32613 reduction-operator:
32614 One of: + * - & ^ | && ||
32616 OpenMP 3.1:
32618 reduction-operator:
32619 One of: + * - & ^ | && || min max
32621 OpenMP 4.0:
32623 reduction-operator:
32624 One of: + * - & ^ | && ||
32625 id-expression */
32627 static tree
32629 {
32637 {
32647 }
32651 else
32652 {
32663 {
32693 }
32694 else
32695 {
32697 resync_fail:
32702 }
32703 }
32709 NULL);
32711 {
32714 }
32717 }
32719 /* OpenMP 2.5:
32720 schedule ( schedule-kind )
32721 schedule ( schedule-kind , expression )
32723 schedule-kind:
32724 static | dynamic | guided | runtime | auto
32726 OpenMP 4.5:
32727 schedule ( schedule-modifier : schedule-kind )
32728 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32730 schedule-modifier:
32731 simd
32732 monotonic
32733 nonmonotonic */
32735 static tree
32737 {
32741 matching_parens parens;
32748 {
32757 else
32763 else
32764 {
32767 }
32768 }
32771 {
32776 {
32797 }
32798 }
32803 else
32809 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32811 {
32815 }
32818 {
32833 else
32838 }
32850 invalid_kind:
32852 resync_fail:
32857 }
32859 /* OpenMP 3.0:
32860 untied */
32862 static tree
32865 {
32866 tree c;
32873 }
32875 /* OpenMP 4.0:
32876 inbranch
32877 notinbranch */
32879 static tree
32882 {
32887 }
32889 /* OpenMP 4.0:
32890 parallel
32891 for
32892 sections
32893 taskgroup */
32895 static tree
32899 {
32903 }
32905 /* OpenMP 4.5:
32906 nogroup */
32908 static tree
32911 {
32916 }
32918 /* OpenMP 4.5:
32919 simd
32920 threads */
32922 static tree
32926 {
32931 }
32933 /* OpenMP 4.0:
32934 num_teams ( expression ) */
32936 static tree
32938 location_t location)
32939 {
32942 matching_parens parens;
32962 }
32964 /* OpenMP 4.0:
32965 thread_limit ( expression ) */
32967 static tree
32969 location_t location)
32970 {
32973 matching_parens parens;
32993 }
32995 /* OpenMP 4.0:
32996 aligned ( variable-list )
32997 aligned ( variable-list : constant-expression ) */
32999 static tree
33001 {
33005 matching_parens parens;
33013 {
33023 }
33029 }
33031 /* OpenMP 4.0:
33032 linear ( variable-list )
33033 linear ( variable-list : expression )
33035 OpenMP 4.5:
33036 linear ( modifier ( variable-list ) )
33037 linear ( modifier ( variable-list ) : expression ) */
33039 static tree
33042 {
33047 matching_parens parens;
33052 {
33064 else
33066 }
33071 else
33072 {
33081 }
33084 {
33089 {
33100 {
33103 }
33106 }
33117 }
33120 {
33123 }
33126 }
33128 /* OpenMP 4.0:
33129 safelen ( constant-expression ) */
33131 static tree
33133 location_t location)
33134 {
33137 matching_parens parens;
33156 }
33158 /* OpenMP 4.0:
33159 simdlen ( constant-expression ) */
33161 static tree
33163 location_t location)
33164 {
33167 matching_parens parens;
33186 }
33188 /* OpenMP 4.5:
33189 vec:
33190 identifier [+/- integer]
33191 vec , identifier [+/- integer]
33192 */
33194 static tree
33196 tree list)
33197 {
33201 {
33204 }
33207 {
33214 else
33215 {
33216 t = cp_parser_lookup_name_simple
33221 id_loc);
33222 }
33228 {
33231 }
33235 {
33238 }
33242 {
33245 }
33248 add_to_vector:
33250 {
33254 }
33260 }
33263 {
33269 }
33271 }
33273 /* OpenMP 4.0:
33274 depend ( depend-kind : variable-list )
33276 depend-kind:
33277 in | out | inout
33279 OpenMP 4.5:
33280 depend ( source )
33282 depend ( sink : vec ) */
33284 static tree
33286 {
33290 matching_parens parens;
33295 {
33309 else
33311 }
33312 else
33318 {
33328 }
33335 else
33336 {
33342 }
33345 invalid_kind:
33347 resync_fail:
33352 }
33354 /* OpenMP 4.0:
33355 map ( map-kind : variable-list )
33356 map ( variable-list )
33358 map-kind:
33359 alloc | to | from | tofrom
33361 OpenMP 4.5:
33362 map-kind:
33363 alloc | to | from | tofrom | release | delete
33365 map ( always [,] map-kind: variable-list ) */
33367 static tree
33369 {
33378 {
33383 {
33386 nth++;
33392 {
33397 }
33398 }
33399 }
33403 {
33417 else
33418 {
33424 }
33427 }
33430 {
33434 }
33437 NULL);
33443 }
33445 /* OpenMP 4.0:
33446 device ( expression ) */
33448 static tree
33450 location_t location)
33451 {
33454 matching_parens parens;
33474 }
33476 /* OpenMP 4.0:
33477 dist_schedule ( static )
33478 dist_schedule ( static , expression ) */
33480 static tree
33482 location_t location)
33483 {
33486 matching_parens parens;
33497 {
33508 }
33513 location);
33517 invalid_kind:
33519 resync_fail:
33524 }
33526 /* OpenMP 4.0:
33527 proc_bind ( proc-bind-kind )
33529 proc-bind-kind:
33530 master | close | spread */
33532 static tree
33534 location_t location)
33535 {
33536 tree c;
33543 {
33553 else
33555 }
33556 else
33565 location);
33570 invalid_kind:
33572 resync_fail:
33577 }
33579 /* OpenACC:
33580 async [( int-expr )] */
33582 static tree
33584 {
33591 {
33592 matching_parens parens;
33601 }
33611 }
33613 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33614 is a bitmask in MASK. Return the list of clauses found. */
33616 static tree
33620 {
33625 {
33626 location_t here;
33627 pragma_omp_clause c_kind;
33628 omp_clause_code code;
33639 {
33691 clauses);
33709 OMP_CLAUSE_INDEPENDENT,
33721 clauses);
33727 clauses);
33751 clauses);
33773 clauses);
33785 clauses);
33799 }
33804 {
33805 /* Remove the invalid clause(s) from the list to avoid
33806 confusing the rest of the compiler. */
33809 }
33810 }
33812 saw_error:
33819 }
33821 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33822 is a bitmask in MASK. Return the list of clauses found; the result
33823 of clause default goes in *pdefault. */
33825 static tree
33829 {
33835 {
33836 pragma_omp_clause c_kind;
33847 {
33859 clauses);
33873 clauses);
33893 clauses);
33898 clauses);
33908 clauses);
33942 clauses);
33956 clauses);
33971 OMP_CLAUSE_NOTINBRANCH,
33980 {
33981 clause_not_first:
33985 }
34015 clauses);
34016 else
34026 clauses);
34044 {
34049 }
34092 clauses
34098 clauses
34106 }
34111 {
34112 /* Remove the invalid clause(s) from the list to avoid
34113 confusing the rest of the compiler. */
34116 }
34117 }
34118 saw_error:
34121 {
34124 else
34126 }
34128 }
34130 /* OpenMP 2.5:
34131 structured-block:
34132 statement
34134 In practice, we're also interested in adding the statement to an
34135 outer node. So it is convenient if we work around the fact that
34136 cp_parser_statement calls add_stmt. */
34138 static unsigned
34140 {
34143 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34144 This preserves the "not within loop or switch" style error messages
34145 for nonsense cases like
34146 void foo() {
34147 #pragma omp single
34148 break;
34149 }
34150 */
34155 }
34157 static void
34159 {
34161 }
34163 static tree
34165 {
34173 }
34175 /* OpenMP 2.5:
34176 # pragma omp atomic new-line
34177 expression-stmt
34179 expression-stmt:
34180 x binop= expr | x++ | ++x | x-- | --x
34181 binop:
34182 +, *, -, /, &, ^, |, <<, >>
34184 where x is an lvalue expression with scalar type.
34186 OpenMP 3.1:
34187 # pragma omp atomic new-line
34188 update-stmt
34190 # pragma omp atomic read new-line
34191 read-stmt
34193 # pragma omp atomic write new-line
34194 write-stmt
34196 # pragma omp atomic update new-line
34197 update-stmt
34199 # pragma omp atomic capture new-line
34200 capture-stmt
34202 # pragma omp atomic capture new-line
34203 capture-block
34205 read-stmt:
34206 v = x
34207 write-stmt:
34208 x = expr
34209 update-stmt:
34210 expression-stmt | x = x binop expr
34211 capture-stmt:
34212 v = expression-stmt
34213 capture-block:
34214 { v = x; update-stmt; } | { update-stmt; v = x; }
34216 OpenMP 4.0:
34217 update-stmt:
34218 expression-stmt | x = x binop expr | x = expr binop x
34219 capture-stmt:
34220 v = update-stmt
34221 capture-block:
34222 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34224 where x and v are lvalue expressions with scalar type. */
34226 static void
34228 {
34236 {
34241 {
34247 }
34248 }
34250 {
34262 else
34266 }
34268 {
34274 {
34279 {
34282 }
34283 }
34284 }
34288 {
34298 else
34303 {
34304 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34305 opcode. */
34310 }
34314 {
34317 }
34318 else
34319 {
34325 }
34328 }
34330 restart:
34334 {
34341 /* FALLTHROUGH */
34351 /* FALLTHROUGH */
34366 /* Undo effects of boolean_increment for post {in,de}crement. */
34368 /* FALLTHRU */
34372 {
34373 /* Undo effects of boolean_increment. */
34375 {
34376 /* This is pre or post increment. */
34381 && !structured_block
34385 }
34386 }
34387 /* FALLTHRU */
34390 {
34425 {
34429 }
34432 {
34438 {
34443 }
34445 {
34457 {
34459 {
34464 }
34465 else
34467 }
34471 }
34474 {
34481 }
34485 }
34489 {
34492 {
34500 }
34502 {
34507 }
34542 }
34553 /* FALLTHROUGH */
34558 }
34565 }
34566 stmt_done:
34568 {
34579 }
34581 {
34584 }
34585 done:
34591 saw_error:
34594 {
34598 {
34602 }
34603 }
34604 }
34607 /* OpenMP 2.5:
34608 # pragma omp barrier new-line */
34610 static void
34612 {
34615 }
34617 /* OpenMP 2.5:
34618 # pragma omp critical [(name)] new-line
34619 structured-block
34621 OpenMP 4.5:
34622 # pragma omp critical [(name) [hint(expression)]] new-line
34623 structured-block */
34625 #define OMP_CRITICAL_CLAUSE_MASK \
34626 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34628 static tree
34630 {
34634 {
34635 matching_parens parens;
34649 OMP_CRITICAL_CLAUSE_MASK,
34651 }
34652 else
34657 }
34659 /* OpenMP 2.5:
34660 # pragma omp flush flush-vars[opt] new-line
34662 flush-vars:
34663 ( variable-list ) */
34665 static void
34667 {
34673 }
34675 /* Helper function, to parse omp for increment expression. */
34677 static tree
34679 {
34684 {
34687 }
34690 {
34697 /* Fall through: OpenMP disallows NE_EXPR. */
34701 }
34703 /* If decl is an iterator, preserve LHS and RHS of the relational
34704 expr until finish_omp_for. */
34715 }
34717 /* Helper function, to parse omp for increment expression. */
34719 static tree
34721 {
34725 cp_id_kind idk;
34729 {
34738 }
34747 {
34752 }
34759 {
34763 }
34776 do
34777 {
34784 {
34786 {
34789 else
34791 tf_warning_or_error);
34792 }
34793 else
34796 }
34797 }
34801 {
34807 }
34808 else
34812 }
34814 /* Parse the initialization statement of an OpenMP for loop.
34816 Return true if the resulting construct should have an
34817 OMP_CLAUSE_PRIVATE added to it. */
34819 static tree
34827 {
34833 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34835 init-expr:
34836 var = lb
34837 integer-type var = lb
34838 random-access-iterator-type var = lb
34839 pointer-type var = lb
34840 */
34841 cp_decl_specifier_seq type_specifiers;
34843 /* First, try to parse as an initialized declaration. See
34844 cp_parser_condition, from whence the bulk of this is copied. */
34851 {
34852 /* If parsing a type specifier seq succeeded, then this
34853 MUST be a initialized declaration. */
34858 CP_PARSER_DECLARATOR_NAMED,
34869 else
34870 {
34880 {
34882 CPP_OPEN_PAREN))
34885 else
34886 /* Trigger an error. */
34891 }
34895 {
34903 {
34906 auto_node);
34911 }
34914 asm_specification,
34915 LOOKUP_ONLYCONVERTING);
34918 {
34921 }
34922 else
34923 {
34926 {
34928 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34930 {
34934 {
34938 }
34940 }
34942 {
34947 }
34948 }
34949 }
34951 }
34952 else
34953 {
34954 /* Consume '='. */
34958 non_class:
34961 else
34964 asm_specification,
34965 LOOKUP_ONLYCONVERTING);
34966 }
34970 }
34971 }
34972 else
34973 {
34974 cp_id_kind idk;
34975 /* If parsing a type specifier sequence failed, then
34976 this MUST be a simple expression. */
34982 && decl
34985 {
34996 {
35001 }
35006 }
35008 && decl
35011 {
35012 tree rhs;
35020 rhs,
35021 tf_warning_or_error));
35024 }
35025 else
35026 {
35031 {
35035 }
35036 }
35037 }
35039 }
35041 /* Parse the restricted form of the for statement allowed by OpenMP. */
35043 static tree
35046 {
35050 location_t loc_first;
35061 {
35064 }
35067 {
35070 }
35073 {
35079 }
35081 {
35084 {
35086 "%<linear%> clause may not be specified together "
35089 }
35090 else
35092 }
35105 {
35108 location_t loc;
35111 {
35115 }
35118 matching_parens parens;
35125 add_private_clause
35131 {
35134 {
35140 }
35141 else
35143 }
35150 {
35155 {
35159 }
35162 {
35163 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35167 {
35170 }
35171 else
35172 {
35175 }
35177 }
35178 else
35179 {
35184 }
35185 }
35188 {
35189 tree c;
35191 {
35200 decl);
35204 decl);
35205 }
35207 {
35212 else
35217 {
35220 /* For linear, signal that we need to fill up
35221 the so far unknown linear step. */
35224 }
35225 }
35226 }
35235 {
35236 /* If decl is an iterator, preserve the operator on decl
35237 until finish_omp_for. */
35239 && ((processing_template_decl
35244 else
35248 }
35260 {
35263 }
35268 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35269 in between the collapsed for loops to be still considered perfectly
35270 nested. Hopefully the final version clarifies this.
35271 For now handle (multiple) {'s and empty statements. */
35274 {
35278 {
35280 bracecount++;
35281 }
35285 else
35286 {
35293 }
35294 }
35297 {
35300 }
35301 }
35306 /* Note that we saved the original contents of this flag when we entered
35307 the structured block, and so we don't need to re-save it here. */
35310 /* Note that the grammar doesn't call for a structured block here,
35311 though the loop as a whole is a structured block. */
35318 else
35323 {
35325 {
35327 nbraces--;
35328 }
35331 else
35332 {
35334 {
35337 }
35342 }
35343 }
35346 {
35350 else
35352 }
35356 }
35358 /* Helper function for OpenMP parsing, split clauses and call
35359 finish_omp_clauses on each of the set of clauses afterwards. */
35361 static void
35364 {
35370 }
35372 /* OpenMP 4.0:
35373 #pragma omp simd simd-clause[optseq] new-line
35374 for-loop */
35376 #define OMP_SIMD_CLAUSE_MASK \
35377 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35386 static tree
35390 {
35401 {
35405 OMP_CLAUSE_ORDERED);
35407 {
35409 "%<ordered%> clause with parameter may not be specified "
35412 }
35413 }
35424 }
35426 /* OpenMP 2.5:
35427 #pragma omp for for-clause[optseq] new-line
35428 for-loop
35430 OpenMP 4.0:
35431 #pragma omp for simd for-simd-clause[optseq] new-line
35432 for-loop */
35434 #define OMP_FOR_CLAUSE_MASK \
35435 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35445 static tree
35449 {
35456 /* parallel for{, simd} disallows nowait clause, but for
35457 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35460 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35465 {
35470 {
35494 }
35495 }
35497 {
35500 }
35502 /* Composite distribute parallel for disallows linear clause. */
35509 {
35512 }
35523 }
35525 /* OpenMP 2.5:
35526 # pragma omp master new-line
35527 structured-block */
35529 static tree
35531 {
35535 }
35537 /* OpenMP 2.5:
35538 # pragma omp ordered new-line
35539 structured-block
35541 OpenMP 4.5:
35542 # pragma omp ordered ordered-clauses new-line
35543 structured-block */
35545 #define OMP_ORDERED_CLAUSE_MASK \
35546 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35549 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35550 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35552 static bool
35555 {
35559 {
35564 {
35566 {
35569 }
35571 {
35573 "%<depend%> clause may only be used in compound "
35577 }
35578 tree clauses
35580 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35584 }
35585 }
35587 tree clauses
35598 }
35600 /* OpenMP 2.5:
35602 section-scope:
35603 { section-sequence }
35605 section-sequence:
35606 section-directive[opt] structured-block
35607 section-sequence section-directive structured-block */
35609 static tree
35611 {
35616 matching_braces braces;
35624 {
35628 }
35631 {
35639 {
35643 }
35645 {
35648 }
35653 }
35664 }
35666 /* OpenMP 2.5:
35667 # pragma omp sections sections-clause[optseq] newline
35668 sections-scope */
35670 #define OMP_SECTIONS_CLAUSE_MASK \
35671 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35677 static tree
35680 {
35692 {
35695 }
35702 }
35704 /* OpenMP 2.5:
35705 # pragma omp parallel parallel-clause[optseq] new-line
35706 structured-block
35707 # pragma omp parallel for parallel-for-clause[optseq] new-line
35708 structured-block
35709 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35710 structured-block
35712 OpenMP 4.0:
35713 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35714 structured-block */
35716 #define OMP_PARALLEL_CLAUSE_MASK \
35717 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35727 static tree
35731 {
35738 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35744 {
35752 if_p);
35756 if_p);
35759 block);
35764 }
35765 /* When combined with distribute, parallel has to be followed by for.
35766 #pragma omp target parallel is allowed though. */
35770 {
35774 }
35776 {
35779 }
35781 {
35785 {
35795 block);
35798 }
35799 }
35804 {
35807 }
35815 }
35817 /* OpenMP 2.5:
35818 # pragma omp single single-clause[optseq] new-line
35819 structured-block */
35821 #define OMP_SINGLE_CLAUSE_MASK \
35822 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35827 static tree
35829 {
35839 }
35841 /* OpenMP 3.0:
35842 # pragma omp task task-clause[optseq] new-line
35843 structured-block */
35845 #define OMP_TASK_CLAUSE_MASK \
35846 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35857 static tree
35859 {
35870 }
35872 /* OpenMP 3.0:
35873 # pragma omp taskwait new-line */
35875 static void
35877 {
35880 }
35882 /* OpenMP 3.1:
35883 # pragma omp taskyield new-line */
35885 static void
35887 {
35890 }
35892 /* OpenMP 4.0:
35893 # pragma omp taskgroup new-line
35894 structured-block */
35896 static tree
35898 {
35902 if_p));
35903 }
35906 /* OpenMP 2.5:
35907 # pragma omp threadprivate (variable-list) */
35909 static void
35911 {
35912 tree vars;
35918 }
35920 /* OpenMP 4.0:
35921 # pragma omp cancel cancel-clause[optseq] new-line */
35923 #define OMP_CANCEL_CLAUSE_MASK \
35924 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35930 static void
35932 {
35936 }
35938 /* OpenMP 4.0:
35939 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35941 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35942 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35947 static void
35950 {
35951 tree clauses;
35955 {
35960 {
35963 }
35964 }
35966 {
35970 }
35973 {
35978 else
35982 }
35985 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35987 pragma_tok);
35989 }
35991 /* OpenMP 4.0:
35992 #pragma omp distribute distribute-clause[optseq] new-line
35993 for-loop */
35995 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35996 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36002 static tree
36006 {
36015 {
36023 else
36026 {
36032 {
36036 else
36039 }
36045 else
36059 }
36060 }
36062 {
36065 }
36070 {
36073 }
36084 }
36086 /* OpenMP 4.0:
36087 # pragma omp teams teams-clause[optseq] new-line
36088 structured-block */
36090 #define OMP_TEAMS_CLAUSE_MASK \
36091 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36099 static tree
36103 {
36112 {
36116 {
36141 }
36142 }
36144 {
36147 }
36152 {
36155 }
36164 }
36166 /* OpenMP 4.0:
36167 # pragma omp target data target-data-clause[optseq] new-line
36168 structured-block */
36170 #define OMP_TARGET_DATA_CLAUSE_MASK \
36171 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36176 static tree
36178 {
36179 tree clauses
36184 {
36187 {
36204 "%<#pragma omp target data%> with map-type other "
36205 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36209 }
36211 }
36214 {
36217 "%<#pragma omp target data%> must contain at least "
36220 }
36231 }
36233 /* OpenMP 4.5:
36234 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36235 structured-block */
36237 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36238 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36244 static tree
36247 {
36250 {
36255 {
36258 }
36259 }
36261 {
36265 }
36268 {
36274 }
36276 tree clauses
36281 {
36284 {
36297 "%<#pragma omp target enter data%> with map-type other "
36301 }
36303 }
36306 {
36309 "%<#pragma omp target enter data%> must contain at least "
36312 }
36319 }
36321 /* OpenMP 4.5:
36322 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36323 structured-block */
36325 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36326 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36332 static tree
36335 {
36338 {
36343 {
36346 }
36347 }
36349 {
36353 }
36356 {
36362 }
36364 tree clauses
36369 {
36372 {
36386 "%<#pragma omp target exit data%> with map-type other "
36387 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36391 }
36393 }
36396 {
36399 "%<#pragma omp target exit data%> must contain at least "
36402 }
36409 }
36411 /* OpenMP 4.0:
36412 # pragma omp target update target-update-clause[optseq] new-line */
36414 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36415 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36422 static bool
36425 {
36427 {
36433 }
36435 tree clauses
36440 {
36442 "%<#pragma omp target update%> must contain at least one "
36445 }
36453 }
36455 /* OpenMP 4.0:
36456 # pragma omp target target-clause[optseq] new-line
36457 structured-block */
36459 #define OMP_TARGET_CLAUSE_MASK \
36460 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36470 static bool
36473 {
36477 {
36489 {
36497 {
36498 tree stmt;
36500 {
36503 OMP_TARGET_CLAUSE_MASK,
36508 OMP_TARGET_CLAUSE_MASK,
36513 OMP_TARGET_CLAUSE_MASK,
36518 }
36520 }
36525 {
36529 if_p);
36534 if_p);
36539 if_p);
36543 }
36549 {
36550 /* For combined target teams, ensure the num_teams and
36551 thread_limit clause expressions are evaluated on the host,
36552 before entering the target construct. */
36553 tree c;
36559 {
36568 OMP_CLAUSE_FIRSTPRIVATE);
36573 }
36574 }
36584 }
36586 {
36589 }
36591 {
36595 }
36597 {
36601 }
36603 {
36607 }
36609 {
36612 }
36613 }
36615 {
36618 }
36633 check_clauses:
36635 {
36638 {
36652 "%<#pragma omp target%> with map-type other "
36653 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36657 }
36659 }
36661 }
36663 /* OpenACC 2.0:
36664 # pragma acc cache (variable-list) new-line
36665 */
36667 static tree
36669 {
36684 }
36686 /* OpenACC 2.0:
36687 # pragma acc data oacc-data-clause[optseq] new-line
36688 structured-block */
36690 #define OACC_DATA_CLAUSE_MASK \
36691 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36703 static tree
36705 {
36718 }
36720 /* OpenACC 2.0:
36721 # pragma acc host_data <clauses> new-line
36722 structured-block */
36724 #define OACC_HOST_DATA_CLAUSE_MASK \
36725 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36727 static tree
36729 {
36742 }
36744 /* OpenACC 2.0:
36745 # pragma acc declare oacc-data-clause[optseq] new-line
36746 */
36748 #define OACC_DECLARE_CLAUSE_MASK \
36749 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36762 static tree
36764 {
36773 {
36777 }
36780 {
36784 {
36788 }
36791 {
36803 {
36805 "%qD must be a global variable in "
36807 decl);
36810 }
36815 {
36819 }
36821 {
36823 "invalid use of %<extern%> variable %qD "
36827 }
36829 {
36831 "invalid use of %<global%> variable %qD "
36835 }
36837 }
36842 {
36847 }
36850 {
36851 tree id;
36855 else
36861 {
36864 {
36867 {
36871 }
36872 }
36873 }
36874 }
36875 }
36888 }
36890 /* OpenACC 2.0:
36891 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36893 or
36895 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36897 LOC is the location of the #pragma token.
36898 */
36900 #define OACC_ENTER_DATA_CLAUSE_MASK \
36901 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36909 #define OACC_EXIT_DATA_CLAUSE_MASK \
36910 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36916 static tree
36919 {
36928 {
36933 }
36940 else
36945 {
36949 }
36957 }
36959 /* OpenACC 2.0:
36960 # pragma acc loop oacc-loop-clause[optseq] new-line
36961 structured-block */
36963 #define OACC_LOOP_CLAUSE_MASK \
36964 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36975 static tree
36978 {
36987 {
36993 }
37002 }
37004 /* OpenACC 2.0:
37005 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37006 structured-block
37008 or
37010 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37011 structured-block
37012 */
37014 #define OACC_KERNELS_CLAUSE_MASK \
37015 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37033 #define OACC_PARALLEL_CLAUSE_MASK \
37034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37055 static tree
37058 {
37059 omp_clause_mask mask;
37062 {
37075 }
37078 {
37082 {
37085 tree clauses;
37087 if_p);
37089 }
37090 }
37099 }
37101 /* OpenACC 2.0:
37102 # pragma acc update oacc-update-clause[optseq] new-line
37103 */
37105 #define OACC_UPDATE_CLAUSE_MASK \
37106 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37113 static tree
37115 {
37122 {
37124 "%<#pragma acc update%> must contain at least one "
37127 }
37135 }
37137 /* OpenACC 2.0:
37138 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37140 LOC is the location of the #pragma token.
37141 */
37143 #define OACC_WAIT_CLAUSE_MASK \
37144 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37146 static tree
37148 {
37162 }
37164 /* OpenMP 4.0:
37165 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37167 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37168 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37175 static void
37178 {
37180 cp_omp_declare_simd_data data;
37182 {
37187 /* It is safe to take the address of a local variable; it will only be
37188 used while this scope is live. */
37190 }
37192 /* Store away all pragma tokens. */
37204 {
37208 {
37221 }
37226 "%<#pragma omp declare simd%> not immediately followed by "
37230 }
37231 }
37233 /* Finalize #pragma omp declare simd clauses after direct declarator has
37234 been parsed, and put that into "omp declare simd" attribute. */
37236 static tree
37238 {
37244 {
37248 }
37253 {
37271 }
37275 }
37278 /* OpenMP 4.0:
37279 # pragma omp declare target new-line
37280 declarations and definitions
37281 # pragma omp end declare target new-line
37283 OpenMP 4.5:
37284 # pragma omp declare target ( extended-list ) new-line
37286 # pragma omp declare target declare-target-clauses[seq] new-line */
37288 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37289 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37292 static void
37294 {
37297 clauses
37301 {
37303 clauses);
37306 }
37307 else
37308 {
37312 }
37315 "%<#pragma omp declare target%> with clauses in between "
37316 "%<#pragma omp declare target%> without clauses and "
37319 {
37325 {
37328 }
37329 else
37332 {
37334 "%qD specified both in declare target %<link%> and %<to%>"
37337 }
37339 {
37346 {
37349 {
37353 }
37354 }
37355 }
37356 }
37357 }
37359 static void
37361 {
37364 {
37367 }
37369 {
37373 {
37376 }
37379 else
37380 {
37384 }
37385 }
37386 else
37387 {
37391 }
37395 "%<#pragma omp end declare target%> without corresponding "
37397 else
37399 }
37401 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37402 expression and optional initializer clause of
37403 #pragma omp declare reduction. We store the expression(s) as
37404 either 3, 6 or 7 special statements inside of the artificial function's
37405 body. The first two statements are DECL_EXPRs for the artificial
37406 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37407 expression that uses those variables.
37408 If there was any INITIALIZER clause, this is followed by further statements,
37409 the fourth and fifth statements are DECL_EXPRs for the artificial
37410 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37411 constructor variant (first token after open paren is not omp_priv),
37412 then the sixth statement is a statement with the function call expression
37413 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37414 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37415 to initialize the OMP_PRIV artificial variable and there is seventh
37416 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37418 static bool
37420 {
37432 tree combiner;
37447 {
37450 }
37453 {
37455 matching_parens parens;
37461 {
37464 }
37480 {
37484 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37488 == CPP_CLOSE_PAREN
37491 {
37495 }
37500 }
37501 else
37502 {
37518 {
37523 }
37525 tree arg;
37538 }
37549 }
37553 UNKNOWN_LOCATION);
37556 }
37558 /* OpenMP 4.0
37559 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37560 initializer-clause[opt] new-line
37562 initializer-clause:
37563 initializer (omp_priv initializer)
37564 initializer (function-name (argument-list)) */
37566 static void
37569 {
37579 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37586 {
37618 }
37630 /* Types may not be defined in declare reduction type list. */
37633 parser->type_definition_forbidden_message
37639 saved_colon_doesnt_start_class_def_p
37644 {
37648 ;
37667 else
37672 else
37674 }
37676 /* Restore the saved message. */
37679 parser->colon_doesnt_start_class_def_p
37684 {
37685 fail:
37688 }
37694 {
37695 tree fntype
37698 NULL_TREE);
37718 {
37723 }
37725 {
37727 {
37736 }
37743 }
37744 else
37745 {
37748 }
37751 else
37754 {
37757 }
37759 {
37762 else
37767 }
37772 else
37773 {
37782 }
37789 }
37793 done:
37794 /* Free any declarators allocated. */
37796 }
37798 /* OpenMP 4.0
37799 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37800 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37801 initializer-clause[opt] new-line
37802 #pragma omp declare target new-line */
37804 static bool
37807 {
37809 {
37814 {
37817 context);
37819 }
37822 {
37825 context);
37827 }
37829 {
37832 }
37834 {
37838 }
37839 }
37844 }
37846 /* OpenMP 4.5:
37847 #pragma omp taskloop taskloop-clause[optseq] new-line
37848 for-loop
37850 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37851 for-loop */
37853 #define OMP_TASKLOOP_CLAUSE_MASK \
37854 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37869 static tree
37873 {
37882 {
37887 {
37911 }
37912 }
37914 {
37917 }
37922 {
37925 }
37931 if_p);
37937 }
37940 /* OpenACC 2.0:
37941 # pragma acc routine oacc-routine-clause[optseq] new-line
37942 function-definition
37944 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37945 */
37947 #define OACC_ROUTINE_CLAUSE_MASK \
37948 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37951 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37954 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37955 component, which must resolve to a declared namespace-scope
37956 function. The clauses are either processed directly (for a named
37957 function), or defered until the immediatley following declaration
37958 is parsed. */
37960 static void
37963 {
37965 /* The checking for "another pragma following this one" in the "no optional
37966 '( name )'" case makes sure that we dont re-enter. */
37969 cp_oacc_routine_data data;
37975 /* It is safe to take the address of a local variable; it will only be
37976 used while this scope is live. */
37979 /* Look for optional '( name )'. */
37981 {
37982 matching_parens parens;
37985 /* We parse the name as an id-expression. If it resolves to
37986 anything other than a non-overloaded function at namespace
37987 scope, it's an error. */
38003 {
38007 }
38009 data.clauses
38017 {
38022 }
38024 /* Perhaps we should use the same rule as declarations in different
38025 namespaces? */
38027 {
38032 }
38035 {
38039 }
38043 }
38045 {
38046 /* Store away all pragma tokens. */
38057 /* Emit a helpful diagnostic if there's another pragma following this
38058 one. */
38060 {
38063 /* ..., and then just keep going. */
38065 }
38067 /* We only have to consider the pragma_external case here. */
38072 else
38075 }
38076 }
38078 /* Finalize #pragma acc routine clauses after direct declarator has
38079 been parsed. */
38081 static tree
38083 {
38088 {
38090 "%<#pragma acc routine%> not immediately followed by "
38093 }
38110 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38111 fndecl_seen. */
38114 }
38116 /* Apply any saved OpenACC routine clauses to a just-parsed
38117 declaration. */
38119 static void
38121 {
38123 {
38124 /* Keep going if we're in error reporting mode. */
38130 {
38132 "%<#pragma acc routine%> not immediately followed by"
38136 }
38138 {
38141 }
38144 {
38149 }
38152 {
38160 }
38162 /* Process the routine's dimension clauses. */
38166 /* Add an "omp declare target" attribute. */
38171 /* Don't unset parser->oacc_routine here: we may still need it to
38172 diagnose wrong usage. But, remember that we've used this "#pragma acc
38173 routine". */
38175 }
38176 }
38178 /* Main entry point to OpenMP statement pragmas. */
38180 static void
38182 {
38183 tree stmt;
38188 {
38211 if_p);
38216 if_p);
38233 if_p);
38238 if_p);
38246 if_p);
38255 if_p);
38269 if_p);
38274 if_p);
38278 }
38281 }
38282 \f
38283 /* Transactional Memory parsing routines. */
38285 /* Parse a transaction attribute.
38287 txn-attribute:
38288 attribute
38289 [ [ identifier ] ]
38291 We use this instead of cp_parser_attributes_opt for transactions to avoid
38292 the pedwarn in C++98 mode. */
38294 static tree
38296 {
38311 {
38315 /* For keywords, use the canonical spelling,
38316 not the parsed identifier. */
38320 }
38321 else
38325 error1:
38328 }
38330 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38332 transaction-statement:
38333 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38334 compound-statement
38335 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38336 */
38338 static tree
38340 {
38351 else
38352 {
38356 }
38358 /* Parse a noexcept specification. */
38362 {
38363 /* cancel-and-throw is unimplemented. */
38366 }
38367 else
38370 /* Keep track if we're in the lexical scope of an outer transaction. */
38382 }
38384 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38386 transaction-expression:
38387 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38388 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38389 */
38391 static tree
38393 {
38406 keyword == RID_TRANSACTION_RELAXED
38420 /* Set this early. This might mean that we allow transaction_cancel in
38421 an expression that we find out later actually has to be a constexpr.
38422 However, we expect that cxx_constant_value will be able to deal with
38423 this; also, if the noexcept has no constexpr, then what we parse next
38424 really is a transaction's body. */
38427 /* Parse a noexcept specification. */
38433 {
38434 matching_parens parens;
38441 }
38442 else
38443 {
38444 /* The only expression that is available got parsed for the noexcept
38445 already. noexcept is true then. */
38448 }
38457 }
38459 /* Parse a function-transaction-block.
38461 function-transaction-block:
38462 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38463 function-body
38464 __transaction_atomic txn-attribute[opt] function-try-block
38465 __transaction_relaxed ctor-initializer[opt] function-body
38466 __transaction_relaxed function-try-block
38467 */
38469 static void
38471 {
38486 else
38487 {
38491 }
38499 else
38500 cp_parser_ctor_initializer_opt_and_function_body
38506 }
38508 /* Parse a __transaction_cancel statement.
38510 cancel-statement:
38511 __transaction_cancel txn-attribute[opt] ;
38512 __transaction_cancel txn-attribute[opt] throw-expression ;
38514 ??? Cancel and throw is not yet implemented. */
38516 static tree
38518 {
38524 RT_TRANSACTION_CANCEL);
38531 /* ??? Parse cancel-and-throw here. */
38536 {
38540 }
38542 {
38546 }
38548 {
38551 {
38557 }
38558 }
38560 {
38564 }
38570 }
38571 \f
38572 /* The parser. */
38576 \f
38577 /* Special handling for the first token or line in the file. The first
38578 thing in the file might be #pragma GCC pch_preprocess, which loads a
38579 PCH file, which is a GC collection point. So we need to handle this
38580 first pragma without benefit of an existing lexer structure.
38582 Always returns one token to the caller in *FIRST_TOKEN. This is
38583 either the true first token of the file, or the first token after
38584 the initial pragma. */
38586 static void
38588 {
38597 {
38604 }
38605 else
38608 /* Skip to the end of the pragma. */
38612 /* Now actually load the PCH file. */
38616 /* Read one more token to return to our caller. We have to do this
38617 after reading the PCH file in, since its pointers have to be
38618 live. */
38620 }
38622 /* Parse a pragma GCC ivdep. */
38624 static bool
38626 {
38629 }
38631 /* Parse a pragma GCC unroll. */
38633 static unsigned short
38635 {
38645 {
38647 " assignment-expression that evaluates to a non-negative"
38650 }
38651 else
38652 {
38656 }
38659 }
38661 /* Normal parsing of a pragma token. Here we can (and must) use the
38662 regular lexer. */
38664 static bool
38666 {
38669 tree stmt;
38680 {
38688 {
38698 }
38703 {
38713 }
38718 {
38729 }
38734 {
38745 }
38750 {
38761 }
38781 {
38786 }
38794 {
38799 }
38807 {
38811 }
38817 {
38822 }
38830 {
38835 }
38890 "%<#pragma omp section%> may only be used in "
38895 {
38897 {
38901 }
38907 {
38911 }
38912 else
38918 {
38921 }
38924 }
38927 {
38929 {
38933 }
38934 const unsigned short unroll
38940 {
38944 }
38945 else
38951 {
38954 }
38957 }
38964 bad_stmt:
38967 }
38971 }
38973 /* The interface the pragma parsers have to the lexer. */
38975 enum cpp_ttype
38977 {
38989 else
38990 {
38994 }
38997 }
38999 \f
39000 /* External interface. */
39002 /* Parse one entire translation unit. */
39004 void
39006 {
39019 }
39021 /* Create an identifier for a generic parameter type (a synthesized
39022 template parameter implied by `auto' or a concept identifier). */
39025 static tree
39027 {
39031 }
39033 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39034 (creating a new template parameter list if necessary). Returns the newly
39035 created template type parm. */
39037 static tree
39039 {
39042 /* Before committing to modifying any scope, if we're in an
39043 implicit template scope, and we're trying to synthesize a
39044 constrained parameter, try to find a previous parameter with
39045 the same name. This is the same-type rule for abbreviated
39046 function templates.
39048 NOTE: We can generate implicit parameters when tentatively
39049 parsing a nested name specifier, only to reject that parse
39050 later. However, matching the same template-id as part of a
39051 direct-declarator should generate an identical template
39052 parameter, so this rule will merge them. */
39054 {
39057 {
39059 {
39062 /* Return the TEMPLATE_PARM_INDEX. */
39065 }
39067 }
39068 }
39070 /* We are either continuing a function template that already contains implicit
39071 template parameters, creating a new fully-implicit function template, or
39072 extending an existing explicit function template with implicit template
39073 parameters. */
39081 {
39085 }
39086 else
39087 {
39088 /* Roll back to the existing template parameter scope (in the case of
39089 extending an explicit function template) or introduce a new template
39090 parameter scope ahead of the function parameter scope (or class scope
39091 in the case of out-of-line member definitions). The function scope is
39092 added back after template parameter synthesis below. */
39097 {
39100 }
39102 {
39103 /* If not defining a class, then any class scope is a scope level in
39104 an out-of-line member definition. In this case simply wind back
39105 beyond the first such scope to inject the template parameter list.
39106 Otherwise wind back to the class being defined. The latter can
39107 occur in class member friend declarations such as:
39109 class A {
39110 void foo (auto);
39111 };
39112 class B {
39113 friend void A::foo (auto);
39114 };
39116 The template parameter list synthesized for the friend declaration
39117 must be injected in the scope of 'B'. This can also occur in
39118 erroneous cases such as:
39120 struct A {
39121 struct B {
39122 void foo (auto);
39123 };
39124 void B::foo (auto) {}
39125 };
39127 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39128 but, nevertheless, the template parameter list synthesized for the
39129 declarator should be injected into the scope of 'A' as if the
39130 ill-formed template was specified explicitly. */
39133 {
39136 }
39137 }
39143 {
39144 /* Introduce a new template parameter list for implicit template
39145 parameters. */
39149 parser->implicit_template_scope
39156 }
39157 else
39158 {
39159 /* Synthesize implicit template parameters at the end of the explicit
39160 template parameter list. */
39167 parser->implicit_template_parms
39169 }
39170 }
39172 /* Synthesize a new template parameter and track the current template
39173 parameter chain with implicit_template_parms. */
39177 tree synth_tmpl_parm;
39181 synth_tmpl_parm
39184 synth_tmpl_parm
39186 else
39187 {
39191 }
39193 // Attach the constraint to the parm before processing.
39196 tree new_parm
39198 input_location,
39199 node,
39203 // Chain the new parameter to the list of implicit parameters.
39205 parser->implicit_template_parms
39207 else
39212 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39215 /* If creating a fully implicit function template, start the new implicit
39216 template parameter list with this synthesized type, otherwise grow the
39217 current template parameter list. */
39220 {
39227 }
39228 else
39229 {
39234 }
39236 // If the new parameter was constrained, we need to add that to the
39237 // constraints in the template parameter list.
39239 {
39243 }
39248 }
39250 /* Finish the declaration of a fully implicit function template. Such a
39251 template has no explicit template parameter list so has not been through the
39252 normal template head and tail processing. synthesize_implicit_template_parm
39253 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39254 provided if the declaration is a class member such that its template
39255 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39256 form is returned. Otherwise NULL_TREE is returned. */
39258 static tree
39260 {
39265 {
39269 }
39279 }
39281 /* Helper function for diagnostics that have complained about things
39282 being used with 'extern "C"' linkage.
39284 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39286 void
39288 {
39292 }