| blob | 49d476b383fb37f38d9191ac9d50373b37331a7f |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2267 static void abort_fully_implicit_template
2270 /* Classes [gram.class] */
2272 static tree cp_parser_class_name
2274 static tree cp_parser_class_specifier
2276 static tree cp_parser_class_head
2278 static enum tag_types cp_parser_class_key
2280 static void cp_parser_type_parameter_key
2282 static void cp_parser_member_specification_opt
2284 static void cp_parser_member_declaration
2286 static tree cp_parser_pure_specifier
2288 static tree cp_parser_constant_initializer
2291 /* Derived classes [gram.class.derived] */
2293 static tree cp_parser_base_clause
2295 static tree cp_parser_base_specifier
2298 /* Special member functions [gram.special] */
2300 static tree cp_parser_conversion_function_id
2302 static tree cp_parser_conversion_type_id
2306 static void cp_parser_ctor_initializer_opt
2308 static void cp_parser_mem_initializer_list
2310 static tree cp_parser_mem_initializer
2312 static tree cp_parser_mem_initializer_id
2315 /* Overloading [gram.over] */
2317 static cp_expr cp_parser_operator_function_id
2319 static cp_expr cp_parser_operator
2322 /* Templates [gram.temp] */
2324 static void cp_parser_template_declaration
2326 static tree cp_parser_template_parameter_list
2328 static tree cp_parser_template_parameter
2330 static tree cp_parser_type_parameter
2332 static tree cp_parser_template_id
2334 static tree cp_parser_template_name
2336 static tree cp_parser_template_argument_list
2338 static tree cp_parser_template_argument
2340 static void cp_parser_explicit_instantiation
2342 static void cp_parser_explicit_specialization
2345 /* Exception handling [gram.exception] */
2347 static tree cp_parser_try_block
2349 static void cp_parser_function_try_block
2351 static void cp_parser_handler_seq
2353 static void cp_parser_handler
2355 static tree cp_parser_exception_declaration
2357 static tree cp_parser_throw_expression
2359 static tree cp_parser_exception_specification_opt
2361 static tree cp_parser_type_id_list
2364 /* GNU Extensions */
2366 static tree cp_parser_asm_specification_opt
2368 static tree cp_parser_asm_operand_list
2370 static tree cp_parser_asm_clobber_list
2372 static tree cp_parser_asm_label_list
2374 static bool cp_next_tokens_can_be_attribute_p
2376 static bool cp_next_tokens_can_be_gnu_attribute_p
2378 static bool cp_next_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_gnu_attribute_p
2384 static bool cp_nth_tokens_can_be_attribute_p
2386 static tree cp_parser_attributes_opt
2388 static tree cp_parser_gnu_attributes_opt
2390 static tree cp_parser_gnu_attribute_list
2392 static tree cp_parser_std_attribute
2394 static tree cp_parser_std_attribute_spec
2396 static tree cp_parser_std_attribute_spec_seq
2398 static size_t cp_parser_skip_attributes_opt
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static void cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static cp_expr cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2769 RT_CLOSE_PAREN. */
2773 {
2775 {
2783 }
2784 }
2786 /* Attempt to convert TOKEN_DESC from a required_token to an
2787 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2789 static enum cpp_ttype
2791 {
2793 {
2814 /* Use CPP_EOF as a "no completions possible" code. */
2816 }
2817 }
2820 /* Subroutine of cp_parser_error and cp_parser_required_error.
2822 Issue a diagnostic of the form
2823 FILE:LINE: MESSAGE before TOKEN
2824 where TOKEN is the next token in the input stream. MESSAGE
2825 (specified by the caller) is usually of the form "expected
2826 OTHER-TOKEN".
2828 This bypasses the check for tentative passing, and potentially
2829 adds material needed by cp_parser_required_error.
2831 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2832 suggesting insertion of the missing token.
2834 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2835 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2836 location. */
2838 static void
2840 required_token missing_token_desc,
2841 location_t matching_location)
2842 {
2844 /* This diagnostic makes more sense if it is tagged to the line
2845 of the token we just peeked at. */
2849 {
2854 }
2856 /* If this is actually a conflict marker, report it as such. */
2860 {
2861 location_t loc;
2863 {
2866 /* Consume tokens until the end of the source line. */
2868 {
2878 }
2880 }
2881 }
2888 {
2889 /* Potentially supply a fix-it hint, suggesting to add the
2890 missing token immediately after the *previous* token.
2891 This may move the primary location within richloc. */
2893 location_t prev_token_loc
2897 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2898 Attempt to consolidate diagnostics by printing it as a
2899 secondary range within the main diagnostic. */
2901 added_matching_location
2903 }
2905 /* Actually emit the error. */
2907 /* Because c_parser_error does not understand
2908 CPP_KEYWORD, keywords are treated like
2909 identifiers. */
2914 {
2915 /* If we weren't able to consolidate matching_location, then
2916 print it as a secondary diagnostic. */
2921 }
2922 }
2924 /* If not parsing tentatively, issue a diagnostic of the form
2925 FILE:LINE: MESSAGE before TOKEN
2926 where TOKEN is the next token in the input stream. MESSAGE
2927 (specified by the caller) is usually of the form "expected
2928 OTHER-TOKEN". */
2930 static void
2932 {
2935 }
2937 /* Issue an error about name-lookup failing. NAME is the
2938 IDENTIFIER_NODE DECL is the result of
2939 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2940 the thing that we hoped to find. */
2942 static void
2944 tree name,
2945 tree decl,
2946 name_lookup_error desired,
2947 location_t location)
2948 {
2949 /* If name lookup completely failed, tell the user that NAME was not
2950 declared. */
2952 {
2965 else
2967 }
2969 {
2971 {
2988 }
2989 }
2991 {
2993 {
3003 name);
3007 }
3008 }
3009 else
3010 {
3012 {
3025 }
3026 }
3027 }
3029 /* If we are parsing tentatively, remember that an error has occurred
3030 during this tentative parse. Returns true if the error was
3031 simulated; false if a message should be issued by the caller. */
3033 static bool
3035 {
3037 {
3040 }
3042 }
3044 /* This function is called when a type is defined. If type
3045 definitions are forbidden at this point, an error message is
3046 issued. */
3048 static bool
3050 {
3051 /* If types are forbidden here, issue a message. */
3053 {
3054 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3055 in the message need to be interpreted. */
3058 }
3060 }
3062 /* This function is called when the DECLARATOR is processed. The TYPE
3063 was a type defined in the decl-specifiers. If it is invalid to
3064 define a type in the decl-specifiers for DECLARATOR, an error is
3065 issued. TYPE_LOCATION is the location of TYPE and is used
3066 for error reporting. */
3068 static void
3071 {
3072 /* [dcl.fct] forbids type definitions in return types.
3073 Unfortunately, it's not easy to know whether or not we are
3074 processing a return type until after the fact. */
3082 {
3087 type);
3088 }
3089 }
3091 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3092 "<" in any valid C++ program. If the next token is indeed "<",
3093 issue a message warning the user about what appears to be an
3094 invalid attempt to form a template-id. LOCATION is the location
3095 of the type-specifier (TYPE) */
3097 static void
3099 tree type,
3101 location_t location)
3102 {
3106 {
3112 {
3115 else
3117 }
3118 else
3120 /* Remember the location of the invalid "<". */
3123 /* Consume the "<". */
3125 /* Parse the template arguments. */
3127 /* Permanently remove the invalid template arguments so that
3128 this error message is not issued again. */
3131 }
3132 }
3134 /* If parsing an integral constant-expression, issue an error message
3135 about the fact that THING appeared and return true. Otherwise,
3136 return false. In either case, set
3137 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3139 static bool
3141 non_integral_constant thing)
3142 {
3145 {
3147 {
3150 {
3153 "ISO C++ forbids using a floating-point literal "
3158 "enumeration type cannot appear in a "
3249 }
3253 }
3254 }
3256 }
3258 /* Emit a diagnostic for an invalid type name. This function commits
3259 to the current active tentative parse, if any. (Otherwise, the
3260 problematic construct might be encountered again later, resulting
3261 in duplicate error messages.) LOCATION is the location of ID. */
3263 static void
3265 location_t location)
3266 {
3269 /* Try to lookup the identifier. */
3276 /* If the lookup was ambiguous, an error will already have
3277 been issued. */
3279 /* If the lookup found a template-name, it means that the user forgot
3280 to specify an argument list. Emit a useful error message. */
3282 {
3283 auto_diagnostic_group d;
3286 decl);
3291 }
3295 /* Something like 'unsigned A a;' */
3298 {
3299 /* Issue an error message. */
3300 auto_diagnostic_group d;
3301 name_hint hint;
3305 {
3311 }
3312 else
3314 /* If we're in a template class, it's possible that the user was
3315 referring to a type from a base class. For example:
3317 template <typename T> struct A { typedef T X; };
3318 template <typename T> struct B : public A<T> { X x; };
3320 The user should have said "typename A<T>::X". */
3336 {
3337 tree b;
3340 b;
3342 {
3346 {
3347 tree field;
3348 /* Go from a particular instantiation of the
3349 template (which will have an empty TYPE_FIELDs),
3350 to the main version. */
3353 field;
3357 {
3362 }
3365 }
3366 }
3367 }
3368 }
3369 /* Here we diagnose qualified-ids where the scope is actually correct,
3370 but the identifier does not resolve to a valid type name. */
3372 {
3374 {
3375 auto_diagnostic_group d;
3384 else
3393 }
3396 {
3397 /* A<T>::A<T>() */
3398 auto_diagnostic_group d;
3404 }
3407 {
3410 "need %<typename%> before %<%T::%D::%E%> because "
3414 id,
3417 else
3421 }
3423 {
3424 auto_diagnostic_group d;
3436 else
3442 }
3443 else
3445 }
3446 }
3448 /* Check for a common situation where a type-name should be present,
3449 but is not, and issue a sensible error message. Returns true if an
3450 invalid type-name was detected.
3452 The situation handled by this function are variable declarations of the
3453 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3454 Usually, `ID' should name a type, but if we got here it means that it
3455 does not. We try to emit the best possible error message depending on
3456 how exactly the id-expression looks like. */
3458 static bool
3460 {
3461 tree id;
3464 /* Avoid duplicate error about ambiguous lookup. */
3466 {
3470 }
3479 /* If the next token is a (, this is a function with no explicit return
3480 type, i.e. constructor, destructor or conversion op. */
3483 {
3486 }
3490 /* Emit a diagnostic for the invalid type. */
3492 out:
3493 /* If we aren't in the middle of a declarator (i.e. in a
3494 parameter-declaration-clause), skip to the end of the declaration;
3495 there's no point in trying to process it. */
3499 }
3501 /* Consume tokens up to, and including, the next non-nested closing `)'.
3502 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3503 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3504 found an unnested token of that type. */
3506 static int
3509 cpp_ttype or_ttype,
3511 {
3522 {
3525 /* Have we found what we're looking for before the closing paren? */
3531 {
3534 /* If we've run out of tokens, then there is no closing `)'. */
3537 /* This is good for lambda expression capture-lists. */
3547 /* This matches the processing in skip_to_end_of_statement. */
3567 {
3571 }
3581 condop_depth--;
3586 }
3588 /* Consume the token. */
3590 }
3591 }
3593 /* Consume tokens up to, and including, the next non-nested closing `)'.
3594 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3595 are doing error recovery. Returns -1 if OR_COMMA is true and we
3596 found an unnested token of that type. */
3598 static int
3603 {
3607 }
3609 /* Consume tokens until we reach the end of the current statement.
3610 Normally, that will be just before consuming a `;'. However, if a
3611 non-nested `}' comes first, then we stop before consuming that. */
3613 static void
3615 {
3618 /* Unwind generic function template scope if necessary. */
3623 {
3627 {
3630 /* If we've run out of tokens, stop. */
3634 /* If the next token is a `;', we have reached the end of the
3635 statement. */
3641 /* If this is a non-nested '}', stop before consuming it.
3642 That way, when confronted with something like:
3644 { 3 + }
3646 we stop before consuming the closing '}', even though we
3647 have not yet reached a `;'. */
3651 /* If it is the closing '}' for a block that we have
3652 scanned, stop -- but only after consuming the token.
3653 That way given:
3655 void f g () { ... }
3656 typedef int I;
3658 we will stop after the body of the erroneously declared
3659 function, but before consuming the following `typedef'
3660 declaration. */
3662 {
3665 }
3674 }
3676 /* Consume the token. */
3678 }
3679 }
3681 /* This function is called at the end of a statement or declaration.
3682 If the next token is a semicolon, it is consumed; otherwise, error
3683 recovery is attempted. */
3685 static void
3687 {
3688 /* Look for the trailing `;'. */
3690 {
3691 /* If there is additional (erroneous) input, skip to the end of
3692 the statement. */
3694 /* If the next token is now a `;', consume it. */
3697 }
3698 }
3700 /* Skip tokens until we have consumed an entire block, or until we
3701 have consumed a non-nested `;'. */
3703 static void
3705 {
3708 /* Unwind generic function template scope if necessary. */
3713 {
3717 {
3720 /* If we've run out of tokens, stop. */
3724 /* Stop if this is an unnested ';'. */
3730 /* Stop if this is an unnested '}', or closes the outermost
3731 nesting level. */
3732 nesting_depth--;
3740 /* Nest. */
3741 nesting_depth++;
3746 }
3748 /* Consume the token. */
3750 }
3751 }
3753 /* Skip tokens until a non-nested closing curly brace is the next
3754 token, or there are no more tokens. Return true in the first case,
3755 false otherwise. */
3757 static bool
3759 {
3763 {
3767 {
3770 /* If we've run out of tokens, stop. */
3774 /* If the next token is a non-nested `}', then we have reached
3775 the end of the current block. */
3781 /* If it the next token is a `{', then we are entering a new
3782 block. Consume the entire block. */
3788 }
3790 /* Consume the token. */
3792 }
3793 }
3795 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3796 parameter is the PRAGMA token, allowing us to purge the entire pragma
3797 sequence. */
3799 static void
3801 {
3806 do
3810 /* Ensure that the pragma is not parsed again. */
3812 }
3814 /* Require pragma end of line, resyncing with it as necessary. The
3815 arguments are as for cp_parser_skip_to_pragma_eol. */
3817 static void
3819 {
3823 }
3825 /* This is a simple wrapper around make_typename_type. When the id is
3826 an unresolved identifier node, we can provide a superior diagnostic
3827 using cp_parser_diagnose_invalid_type_name. */
3829 static tree
3831 location_t id_location)
3832 {
3833 tree result;
3835 {
3841 }
3843 }
3845 /* This is a wrapper around the
3846 make_{pointer,ptrmem,reference}_declarator functions that decides
3847 which one to call based on the CODE and CLASS_TYPE arguments. The
3848 CODE argument should be one of the values returned by
3849 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3850 appertain to the pointer or reference. */
3854 cp_cv_quals cv_qualifiers,
3856 tree attributes)
3857 {
3864 else
3874 }
3876 /* Create a new C++ parser. */
3880 {
3885 /* cp_lexer_new_main is called before doing GC allocation because
3886 cp_lexer_new_main might load a PCH file. */
3889 /* Initialize the binops_by_token so that we can get the tree
3890 directly from the token. */
3898 /* For now, we always accept GNU extensions. */
3901 /* The `>' token is a greater-than operator, not the end of a
3902 template-id. */
3907 /* We are not parsing a constant-expression. */
3912 /* Local variable names are not forbidden. */
3915 /* We are not processing an `extern "C"' declaration. */
3918 /* We are not processing a declarator. */
3921 /* We are not processing a template-argument-list. */
3924 /* We are not in an iteration statement. */
3927 /* We are not in a switch statement. */
3930 /* We are not parsing a type-id inside an expression. */
3933 /* Declarations aren't implicitly extern "C". */
3936 /* String literals should be translated to the execution character set. */
3939 /* We are not parsing a function body. */
3942 /* We can correct until told otherwise. */
3945 /* The unparsed function queue is empty. */
3948 /* There are no classes being defined. */
3951 /* No template parameters apply. */
3954 /* Special parsing data structures. */
3958 /* Not declaring an implicit function template. */
3964 /* Allow constrained-type-specifiers. */
3967 /* We haven't yet seen an 'extern "C"'. */
3971 }
3973 /* Create a cp_lexer structure which will emit the tokens in CACHE
3974 and push it onto the parser's lexer stack. This is used for delayed
3975 parsing of in-class method bodies and default arguments, and should
3976 not be confused with tentative parsing. */
3977 static void
3979 {
3984 /* Move the current source position to that of the first token in the
3985 new lexer. */
3987 }
3989 /* Pop the top lexer off the parser stack. This is never used for the
3990 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3991 static void
3993 {
3998 /* Put the current source position back where it was before this
3999 lexer was pushed. */
4001 }
4003 /* Lexical conventions [gram.lex] */
4005 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4006 identifier. */
4008 static cp_expr
4010 {
4013 /* Look for the identifier. */
4015 /* Return the value. */
4018 else
4020 }
4022 /* Parse a sequence of adjacent string constants. Returns a
4023 TREE_STRING representing the combined, nul-terminated string
4024 constant. If TRANSLATE is true, translate the string to the
4025 execution character set. If WIDE_OK is true, a wide string is
4026 invalid here.
4028 C++98 [lex.string] says that if a narrow string literal token is
4029 adjacent to a wide string literal token, the behavior is undefined.
4030 However, C99 6.4.5p4 says that this results in a wide string literal.
4031 We follow C99 here, for consistency with the C front end.
4033 This code is largely lifted from lex_string() in c-lex.c.
4035 FUTURE: ObjC++ will need to handle @-strings here. */
4036 static cp_expr
4039 {
4040 tree value;
4047 tree string_tree;
4053 {
4056 }
4061 {
4065 }
4066 else
4067 {
4070 }
4073 /* Try to avoid the overhead of creating and destroying an obstack
4074 for the common case of just one string. */
4077 {
4085 {
4089 }
4090 else
4094 }
4095 else
4096 {
4101 do
4102 {
4104 count++;
4109 {
4112 {
4115 }
4118 {
4123 }
4125 }
4126 else
4130 {
4134 {
4138 "unsupported non-standard concatenation "
4140 }
4141 }
4149 {
4153 }
4154 else
4155 {
4159 }
4160 }
4163 /* A string literal built by concatenation has its caret=start at
4164 the start of the initial string, and its finish at the finish of
4165 the final string literal. */
4169 }
4172 {
4175 }
4179 {
4184 {
4199 }
4204 {
4209 else
4211 }
4212 }
4213 else
4214 /* cpp_interpret_string has issued an error. */
4221 }
4223 /* Look up a literal operator with the name and the exact arguments. */
4225 static tree
4227 {
4228 tree decl;
4234 {
4240 {
4243 {
4253 }
4256 /* May be this should be sufficient_parms_p instead,
4257 depending on how exactly should user-defined literals
4258 work in presence of default arguments on the literal
4259 operator parameters. */
4262 }
4263 }
4266 }
4268 /* Parse a user-defined char constant. Returns a call to a user-defined
4269 literal operator taking the character as an argument. */
4271 static cp_expr
4273 {
4281 /* Build up a call to the user-defined operator */
4282 /* Lookup the name we got back from the id-expression. */
4287 {
4292 }
4296 }
4298 /* A subroutine of cp_parser_userdef_numeric_literal to
4299 create a char... template parameter pack from a string node. */
4301 static tree
4303 {
4304 tree charvec;
4310 /* Fill in CHARVEC with all of the parameters. */
4313 {
4322 }
4324 /* Build the argument packs. */
4330 }
4332 /* A subroutine of cp_parser_userdef_numeric_literal to
4333 create a char... template parameter pack from a string node. */
4335 static tree
4337 {
4338 tree charvec;
4349 /* First template parm is character type. */
4352 /* Fill in CHARVEC with all of the parameters. */
4359 /* Build the argument packs. */
4365 }
4367 /* Parse a user-defined numeric constant. returns a call to a user-defined
4368 literal operator. */
4370 static cp_expr
4372 {
4383 /* Look for a literal operator taking the exact type of numeric argument
4384 as the literal value. */
4389 {
4391 tf_warning_or_error);
4394 {
4397 long_long_unsigned_type_node);
4398 }
4399 else
4400 {
4404 long_double_type_node);
4408 }
4412 }
4415 /* If the numeric argument didn't work, look for a raw literal
4416 operator taking a const char* argument consisting of the number
4417 in string format. */
4422 {
4424 tf_warning_or_error);
4427 }
4430 /* If the raw literal didn't work, look for a non-type template
4431 function with parameter pack char.... Call the function with
4432 template parameter characters representing the number. */
4436 {
4439 {
4441 num_string);
4443 }
4446 tf_warning_or_error);
4449 }
4453 /* In C++14 the standard library defines complex number suffixes that
4454 conflict with GNU extensions. Prefer them if <complex> is #included. */
4464 {
4469 {
4470 /* No <complex>, so pedwarn and use GNU semantics. */
4473 }
4474 }
4476 bool complained
4483 {
4485 "(from <complex>) to enable the C++14 user-defined literal "
4490 }
4497 else
4498 {
4499 /* Use the built-in semantics. */
4500 tree type;
4502 {
4505 else
4507 }
4516 }
4519 /* Avoid repeated diagnostics. */
4522 }
4524 /* Parse a user-defined string constant. Returns a call to a user-defined
4525 literal operator taking a character pointer and the length of the string
4526 as arguments. */
4528 static tree
4530 {
4539 /* Build up a call to the user-defined operator. */
4540 /* Lookup the name we got back from the id-expression. */
4547 {
4549 tf_warning_or_error);
4552 }
4555 /* Look for a template function with typename parameter CharT
4556 and parameter pack CharT... Call the function with
4557 template parameter characters representing the string. */
4561 {
4565 tf_warning_or_error);
4568 }
4574 }
4577 /* Basic concepts [gram.basic] */
4579 /* Parse a translation-unit.
4581 translation-unit:
4582 declaration-seq [opt]
4584 Returns TRUE if all went well. */
4586 static bool
4588 {
4589 /* The address of the first non-permanent object on the declarator
4590 obstack. */
4595 /* Create the declarator obstack, if necessary. */
4597 {
4599 /* Create the error declarator. */
4601 /* Create the empty parameter list. */
4603 UNKNOWN_LOCATION);
4604 /* Remember where the base of the declarator obstack lies. */
4606 }
4610 /* If there are no tokens left then all went well. */
4612 {
4613 /* Get rid of the token array; we don't need it any more. */
4617 /* This file might have been a context that's implicitly extern
4618 "C". If so, pop the lang context. (Only relevant for PCH.) */
4620 {
4623 }
4625 /* Finish up. */
4629 }
4630 else
4631 {
4634 }
4636 /* Make sure the declarator obstack was fully cleaned up. */
4640 /* All went well. */
4642 }
4644 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4645 decltype context. */
4649 {
4654 }
4656 /* We're about to parse a collection of statements. If we're currently
4657 parsing tentatively, set up a firewall so that any nested
4658 cp_parser_commit_to_tentative_parse won't affect the current context. */
4660 static cp_token_position
4662 {
4669 }
4671 /* We've finished parsing the collection of statements. Wrap up the
4672 firewall and replace the relevant tokens with the parsed form. */
4674 static void
4676 tree expr)
4677 {
4681 /* Finish the firewall level. */
4683 /* And remember the result of the parse for when we try again. */
4689 }
4691 /* Like the above functions, but let the user modify the tokens. Used by
4692 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4693 later parses, so it makes sense to localize the effects of
4694 cp_parser_commit_to_tentative_parse. */
4696 struct tentative_firewall
4697 {
4702 {
4703 /* If we're currently parsing tentatively, start a committed level as a
4704 firewall and then an inner tentative parse. */
4706 {
4710 }
4711 }
4714 {
4716 {
4717 /* Finish the inner tentative parse and the firewall, propagating any
4718 uncommitted error state to the outer tentative parse. */
4724 }
4725 }
4726 };
4728 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4729 This class is for tracking such a matching pair of symbols.
4730 In particular, it tracks the location of the first token,
4731 so that if the second token is missing, we can highlight the
4732 location of the first token when notifying the user about the
4733 problem. */
4736 class token_pair
4737 {
4739 /* token_pair's ctor. */
4742 /* If the next token is the opening symbol for this pair, consume it and
4743 return true.
4744 Otherwise, issue an error and return false.
4745 In either case, record the location of the opening token. */
4748 {
4752 }
4754 /* Consume the next token from PARSER, recording its location as
4755 that of the opening token within the pair. */
4758 {
4763 }
4765 /* If the next token is the closing symbol for this pair, consume it
4766 and return it.
4767 Otherwise, issue an error, highlighting the location of the
4768 corresponding opening token, and return NULL. */
4771 {
4774 m_open_loc);
4775 }
4778 location_t m_open_loc;
4779 };
4781 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4783 struct matching_paren_traits
4784 {
4789 };
4791 /* "matching_parens" is a token_pair<T> class for tracking matching
4792 pairs of parentheses. */
4796 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4798 struct matching_brace_traits
4799 {
4804 };
4806 /* "matching_braces" is a token_pair<T> class for tracking matching
4807 pairs of braces. */
4812 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4813 enclosing parentheses. */
4815 static cp_expr
4817 {
4820 /* Consume the '('. */
4822 matching_parens parens;
4824 /* Start the statement-expression. */
4826 /* Parse the compound-statement. */
4828 /* Finish up. */
4830 /* Consume the ')'. */
4838 }
4840 /* Expressions [gram.expr] */
4842 /* Parse a fold-operator.
4844 fold-operator:
4845 - * / % ^ & | = < > << >>
4846 = -= *= /= %= ^= &= |= <<= >>=
4847 == != <= >= && || , .* ->*
4849 This returns the tree code corresponding to the matched operator
4850 as an int. When the current token matches a compound assignment
4851 opertor, the resulting tree code is the negative value of the
4852 non-assignment operator. */
4854 static int
4856 {
4858 {
4898 }
4899 }
4901 /* Returns true if CODE indicates a binary expression, which is not allowed in
4902 the LHS of a fold-expression. More codes will need to be added to use this
4903 function in other contexts. */
4905 static bool
4907 {
4909 {
4942 }
4943 }
4945 /* If the next token is a suitable fold operator, consume it and return as
4946 the function above. */
4948 static int
4950 {
4956 }
4958 /* Parse a fold-expression.
4960 fold-expression:
4961 ( ... folding-operator cast-expression)
4962 ( cast-expression folding-operator ... )
4963 ( cast-expression folding operator ... folding-operator cast-expression)
4965 Note that the '(' and ')' are matched in primary expression. */
4967 static cp_expr
4969 {
4970 cp_id_kind pidk;
4972 // Left fold.
4974 {
4978 {
4981 }
4988 }
4993 {
4996 }
4999 {
5002 }
5005 /* The operands of a fold-expression are cast-expressions, so binary or
5006 conditional expressions are not allowed. We check this here to avoid
5007 tentative parsing. */
5019 // Right fold.
5024 {
5027 }
5030 // Binary left or right fold.
5035 }
5037 /* Parse a primary-expression.
5039 primary-expression:
5040 literal
5041 this
5042 ( expression )
5043 id-expression
5044 lambda-expression (C++11)
5046 GNU Extensions:
5048 primary-expression:
5049 ( compound-statement )
5050 __builtin_va_arg ( assignment-expression , type-id )
5051 __builtin_offsetof ( type-id , offsetof-expression )
5053 C++ Extensions:
5054 __has_nothrow_assign ( type-id )
5055 __has_nothrow_constructor ( type-id )
5056 __has_nothrow_copy ( type-id )
5057 __has_trivial_assign ( type-id )
5058 __has_trivial_constructor ( type-id )
5059 __has_trivial_copy ( type-id )
5060 __has_trivial_destructor ( type-id )
5061 __has_virtual_destructor ( type-id )
5062 __is_abstract ( type-id )
5063 __is_base_of ( type-id , type-id )
5064 __is_class ( type-id )
5065 __is_empty ( type-id )
5066 __is_enum ( type-id )
5067 __is_final ( type-id )
5068 __is_literal_type ( type-id )
5069 __is_pod ( type-id )
5070 __is_polymorphic ( type-id )
5071 __is_std_layout ( type-id )
5072 __is_trivial ( type-id )
5073 __is_union ( type-id )
5075 Objective-C++ Extension:
5077 primary-expression:
5078 objc-expression
5080 literal:
5081 __null
5083 ADDRESS_P is true iff this expression was immediately preceded by
5084 "&" and therefore might denote a pointer-to-member. CAST_P is true
5085 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5086 true iff this expression is a template argument.
5088 Returns a representation of the expression. Upon return, *IDK
5089 indicates what kind of id-expression (if any) was present. */
5091 static cp_expr
5098 {
5101 /* Assume the primary expression is not an id-expression. */
5104 /* Peek at the next token. */
5107 {
5108 /* literal:
5109 integer-literal
5110 character-literal
5111 floating-literal
5112 string-literal
5113 boolean-literal
5114 pointer-literal
5115 user-defined-literal */
5127 {
5131 }
5132 /* Floating-point literals are only allowed in an integral
5133 constant expression if they are cast to an integral or
5134 enumeration type. */
5138 {
5139 /* CAST_P will be set even in invalid code like "int(2.7 +
5140 ...)". Therefore, we have to check that the next token
5141 is sure to end the cast. */
5143 {
5148 enumerator-definition. */
5150 /* The curly brace at the end of an enum-specifier. */
5152 /* The end of a statement. */
5154 /* The end of the cast-expression. */
5156 /* The end of an array bound. */
5158 /* The closing ">" in a template-argument-list. */
5161 /* C++0x only: A ">>" treated like two ">" tokens,
5162 in a template-argument-list. */
5167 }
5169 /* If we are within a cast, then the constraint that the
5170 cast is to an integral or enumeration type will be
5171 checked at that point. If we are not within a cast, then
5172 this code is invalid. */
5175 }
5195 /* ??? Should wide strings be allowed when parser->translate_strings_p
5196 is false (i.e. in attributes)? If not, we can kill the third
5197 argument to cp_parser_string_literal. */
5203 /* If we see `( { ' then we are looking at the beginning of
5204 a GNU statement-expression. */
5207 {
5208 /* Statement-expressions are not allowed by the standard. */
5212 /* And they're not allowed outside of a function-body; you
5213 cannot, for example, write:
5215 int i = ({ int j = 3; j + 1; });
5217 at class or namespace scope. */
5220 {
5222 "statement-expressions are not allowed outside "
5228 }
5229 else
5231 }
5232 /* Otherwise it's a normal parenthesized expression. */
5233 {
5234 cp_expr expr;
5239 /* Consume the `('. */
5240 matching_parens parens;
5242 /* Within a parenthesized expression, a `>' token is always
5243 the greater-than operator. */
5244 saved_greater_than_is_operator_p
5249 /* Left fold expression. */
5251 else
5252 /* Parse the parenthesized expression. */
5257 {
5264 }
5265 else
5266 /* Let the front end know that this expression was
5267 enclosed in parentheses. This matters in case, for
5268 example, the expression is of the form `A::B', since
5269 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5270 not. */
5273 /* DR 705: Wrapping an unqualified name in parentheses
5274 suppresses arg-dependent lookup. We want to pass back
5275 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5276 (c++/37862), but none of the others. */
5280 /* The `>' token might be the end of a template-id or
5281 template-parameter-list now. */
5282 parser->greater_than_is_operator_p
5285 /* Consume the `)'. */
5294 }
5297 {
5299 {
5300 /* We might have an Objective-C++ message. */
5303 /* If that works out, we're done ... */
5306 /* ... else, fall though to see if it's a lambda. */
5307 }
5309 /* Don't warn about a failed tentative parse. */
5314 }
5318 /* We have an Objective-C++ string literal. */
5325 {
5326 /* These two are the boolean literals. */
5334 /* The `__null' literal. */
5339 /* The `nullptr' literal. */
5344 /* Recognize the `this' keyword. */
5348 {
5352 }
5353 /* Pointers cannot appear in constant-expressions. */
5358 /* The `operator' keyword can be the beginning of an
5359 id-expression. */
5366 {
5367 non_integral_constant name;
5369 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5370 __func__ are the names of variables -- but they are
5371 treated specially. Therefore, they are handled here,
5372 rather than relying on the generic id-expression logic
5373 below. Grammatically, these names are id-expressions.
5375 Consume the token. */
5379 {
5391 }
5396 /* Look up the name. */
5398 }
5401 {
5402 tree expression;
5403 tree type;
5404 source_location type_location;
5405 location_t start_loc
5407 /* The `__builtin_va_arg' construct is used to handle
5408 `va_arg'. Consume the `__builtin_va_arg' token. */
5410 /* Look for the opening `('. */
5411 matching_parens parens;
5413 /* Now, parse the assignment-expression. */
5415 /* Look for the `,'. */
5418 /* Parse the type-id. */
5419 {
5422 }
5423 /* Look for the closing `)'. */
5424 location_t finish_loc
5427 /* Using `va_arg' in a constant-expression is not
5428 allowed. */
5430 NIC_VA_ARG))
5432 /* Construct a location of the form:
5433 __builtin_va_arg (v, int)
5434 ~~~~~~~~~~~~~~~~~~~~~^~~~
5435 with the caret at the type, ranging from the start of the
5436 "__builtin_va_arg" token to the close paren. */
5437 location_t combined_loc
5440 }
5475 // C++ concepts
5479 /* Objective-C++ expressions. */
5489 {
5494 }
5495 /* FALLTHRU */
5499 }
5501 /* An id-expression can start with either an identifier, a
5502 `::' as the beginning of a qualified-id, or the "operator"
5503 keyword. */
5508 {
5509 id_expression:
5510 cp_expr id_expression;
5511 cp_expr decl;
5517 /* Parse the id-expression. */
5518 id_expression
5535 /* If we have a template-id, then no further lookup is
5536 required. If the template-id was for a template-class, we
5537 will sometimes have a TYPE_DECL at this point. */
5541 /* Look up the name. */
5542 else
5543 {
5544 tree ambiguous_decls;
5546 /* If we already know that this lookup is ambiguous, then
5547 we've already issued an error message; there's no reason
5548 to check again. */
5551 {
5554 }
5557 none_type,
5558 template_p,
5563 /* If the lookup was ambiguous, an error will already have
5564 been issued. */
5568 /* In Objective-C++, we may have an Objective-C 2.0
5569 dot-syntax for classes here. */
5574 {
5575 tree component;
5582 component);
5583 /* Build a location of the form:
5584 expr.component
5585 ~~~~~^~~~~~~~~
5586 with caret at the start of the component name (at
5587 input_location), ranging from the start of the id_expression
5588 to the end of the component name. */
5589 location_t combined_loc
5594 }
5596 /* In Objective-C++, an instance variable (ivar) may be preferred
5597 to whatever cp_parser_lookup_name() found.
5598 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5599 rest of c-family, we have to do a little extra work to preserve
5600 any location information in cp_expr "decl". Given that
5601 objc_lookup_ivar is implemented in "c-family" and "objc", we
5602 have a trip through the pure "tree" type, rather than cp_expr.
5603 Naively copying it back to "decl" would implicitly give the
5604 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5605 store an EXPR_LOCATION. Hence we only update "decl" (and
5606 hence its location_t) if we get back a different tree node. */
5608 id_expression);
5612 /* If name lookup gives us a SCOPE_REF, then the
5613 qualifying scope was dependent. */
5615 {
5616 /* At this point, we do not know if DECL is a valid
5617 integral constant expression. We assume that it is
5618 in fact such an expression, so that code like:
5620 template <int N> struct A {
5621 int a[B<N>::i];
5622 };
5624 is accepted. At template-instantiation time, we
5625 will check that B<N>::i is actually a constant. */
5627 }
5628 /* Check to see if DECL is a local variable in a context
5629 where that is forbidden. */
5632 {
5637 }
5638 }
5642 /* It's too difficult to mark ths in all the places where
5643 we know for sure we need to keep the lookup, so do it
5644 now. The cost is extra GC to recycle the lookups
5645 resolved at parse time. */
5648 decl = (finish_id_expression
5650 idk,
5655 template_arg_p,
5662 }
5664 /* Anything else is an error. */
5668 }
5669 }
5677 {
5680 }
5682 /* Parse an id-expression.
5684 id-expression:
5685 unqualified-id
5686 qualified-id
5688 qualified-id:
5689 :: [opt] nested-name-specifier template [opt] unqualified-id
5690 :: identifier
5691 :: operator-function-id
5692 :: template-id
5694 Return a representation of the unqualified portion of the
5695 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5696 a `::' or nested-name-specifier.
5698 Often, if the id-expression was a qualified-id, the caller will
5699 want to make a SCOPE_REF to represent the qualified-id. This
5700 function does not do this in order to avoid wastefully creating
5701 SCOPE_REFs when they are not required.
5703 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5704 `template' keyword.
5706 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5707 uninstantiated templates.
5709 If *TEMPLATE_P is non-NULL, it is set to true iff the
5710 `template' keyword is used to explicitly indicate that the entity
5711 named is a template.
5713 If DECLARATOR_P is true, the id-expression is appearing as part of
5714 a declarator, rather than as part of an expression. */
5716 static cp_expr
5723 {
5727 /* Assume the `template' keyword was not used. */
5731 /* Look for the optional `::' operator. */
5732 global_scope_p
5733 = (!template_keyword_p
5738 /* Look for the optional nested-name-specifier. */
5739 nested_name_specifier_p
5742 check_dependency_p,
5744 declarator_p,
5745 template_keyword_p)
5748 /* If there is a nested-name-specifier, then we are looking at
5749 the first qualified-id production. */
5751 {
5752 tree saved_scope;
5753 tree saved_object_scope;
5754 tree saved_qualifying_scope;
5755 cp_expr unqualified_id;
5758 /* See if the next token is the `template' keyword. */
5762 /* Name lookup we do during the processing of the
5763 unqualified-id might obliterate SCOPE. */
5767 /* Process the final unqualified-id. */
5769 check_dependency_p,
5770 declarator_p,
5772 /* Restore the SAVED_SCOPE for our caller. */
5778 }
5779 /* Otherwise, if we are in global scope, then we are looking at one
5780 of the other qualified-id productions. */
5782 {
5784 tree id;
5786 /* Peek at the next token. */
5789 /* If it's an identifier, and the next token is not a "<", then
5790 we can avoid the template-id case. This is an optimization
5791 for this common case. */
5793 && !cp_parser_nth_token_starts_template_argument_list_p
5798 /* Try a template-id. */
5802 none_type,
5803 declarator_p);
5804 /* If that worked, we're done. */
5808 /* Peek at the next token. (Changes in the token buffer may
5809 have invalidated the pointer obtained above.) */
5813 {
5820 /* Fall through. */
5825 }
5826 }
5827 else
5830 declarator_p,
5831 optional_p);
5832 }
5834 /* Parse an unqualified-id.
5836 unqualified-id:
5837 identifier
5838 operator-function-id
5839 conversion-function-id
5840 ~ class-name
5841 template-id
5843 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5844 keyword, in a construct like `A::template ...'.
5846 Returns a representation of unqualified-id. For the `identifier'
5847 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5848 production a BIT_NOT_EXPR is returned; the operand of the
5849 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5850 other productions, see the documentation accompanying the
5851 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5852 names are looked up in uninstantiated templates. If DECLARATOR_P
5853 is true, the unqualified-id is appearing as part of a declarator,
5854 rather than as part of an expression. */
5856 static cp_expr
5862 {
5865 /* Peek at the next token. */
5869 {
5871 {
5872 tree id;
5874 /* We don't know yet whether or not this will be a
5875 template-id. */
5877 /* Try a template-id. */
5879 check_dependency_p,
5880 none_type,
5881 declarator_p);
5882 /* If it worked, we're done. */
5885 /* Otherwise, it's an ordinary identifier. */
5887 }
5891 check_dependency_p,
5892 none_type,
5893 declarator_p);
5896 {
5897 tree type_decl;
5898 tree qualifying_scope;
5899 tree object_scope;
5900 tree scope;
5903 /* Consume the `~' token. */
5905 /* Parse the class-name. The standard, as written, seems to
5906 say that:
5908 template <typename T> struct S { ~S (); };
5909 template <typename T> S<T>::~S() {}
5911 is invalid, since `~' must be followed by a class-name, but
5912 `S<T>' is dependent, and so not known to be a class.
5913 That's not right; we need to look in uninstantiated
5914 templates. A further complication arises from:
5916 template <typename T> void f(T t) {
5917 t.T::~T();
5918 }
5920 Here, it is not possible to look up `T' in the scope of `T'
5921 itself. We must look in both the current scope, and the
5922 scope of the containing complete expression.
5924 Yet another issue is:
5926 struct S {
5927 int S;
5928 ~S();
5929 };
5931 S::~S() {}
5933 The standard does not seem to say that the `S' in `~S'
5934 should refer to the type `S' and not the data member
5935 `S::S'. */
5937 /* DR 244 says that we look up the name after the "~" in the
5938 same scope as we looked up the qualifying name. That idea
5939 isn't fully worked out; it's more complicated than that. */
5944 /* Check for invalid scopes. */
5946 {
5950 }
5952 {
5956 scope);
5961 }
5964 /* If the name is of the form "X::~X" it's OK even if X is a
5965 typedef. */
5974 {
5977 }
5979 /* ~auto means the destructor of whatever the object is. */
5981 {
5984 "%<~auto%> only available with "
5988 }
5990 /* If there was an explicit qualification (S::~T), first look
5991 in the scope given by the qualification (i.e., S).
5993 Note: in the calls to cp_parser_class_name below we pass
5994 typename_type so that lookup finds the injected-class-name
5995 rather than the constructor. */
5999 {
6004 typename_type,
6007 declarator_p);
6010 }
6011 /* In "N::S::~S", look in "N" as well. */
6013 {
6018 type_decl
6022 typename_type,
6025 declarator_p);
6028 }
6029 /* In "p->S::~T", look in the scope given by "*p" as well. */
6031 {
6036 type_decl
6040 typename_type,
6043 declarator_p);
6046 }
6047 /* Look in the surrounding context. */
6049 {
6055 type_decl
6059 typename_type,
6062 declarator_p);
6065 {
6066 /* We couldn't find a type with this name. If we're parsing
6067 tentatively, fail and try something else. */
6069 {
6072 }
6073 /* Otherwise, accept it and check for a match at instantiation
6074 time. */
6079 }
6080 }
6081 /* If an error occurred, assume that the name of the
6082 destructor is the same as the name of the qualifying
6083 class. That allows us to keep parsing after running
6084 into ill-formed destructor names. */
6090 /* Check that destructor name and scope match. */
6092 {
6099 }
6101 /* [class.dtor]
6103 A typedef-name that names a class shall not be used as the
6104 identifier in the declarator for a destructor declaration. */
6111 type_decl);
6114 }
6118 {
6119 cp_expr id;
6121 /* This could be a template-id, so we try that first. */
6123 /* Try a template-id. */
6126 none_type,
6127 declarator_p);
6128 /* If that worked, we're done. */
6131 /* We still don't know whether we're looking at an
6132 operator-function-id or a conversion-function-id. */
6134 /* Try an operator-function-id. */
6136 /* If that didn't work, try a conversion-function-id. */
6141 }
6142 /* Fall through. */
6149 }
6150 }
6152 /* Parse an (optional) nested-name-specifier.
6154 nested-name-specifier: [C++98]
6155 class-or-namespace-name :: nested-name-specifier [opt]
6156 class-or-namespace-name :: template nested-name-specifier [opt]
6158 nested-name-specifier: [C++0x]
6159 type-name ::
6160 namespace-name ::
6161 nested-name-specifier identifier ::
6162 nested-name-specifier template [opt] simple-template-id ::
6164 PARSER->SCOPE should be set appropriately before this function is
6165 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6166 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6167 in name lookups.
6169 Sets PARSER->SCOPE to the class (TYPE) or namespace
6170 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6171 it unchanged if there is no nested-name-specifier. Returns the new
6172 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6174 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6175 part of a declaration and/or decl-specifier. */
6177 static tree
6184 {
6189 /* Remember where the nested-name-specifier starts. */
6191 {
6194 }
6197 {
6198 tree new_scope;
6199 tree old_scope;
6200 tree saved_qualifying_scope;
6202 /* Spot cases that cannot be the beginning of a
6203 nested-name-specifier. */
6206 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6207 the already parsed nested-name-specifier. */
6209 {
6210 /* Grab the nested-name-specifier and continue the loop. */
6212 /* If we originally encountered this nested-name-specifier
6213 with IS_DECLARATION set to false, we will not have
6214 resolved TYPENAME_TYPEs, so we must do so here. */
6217 {
6222 }
6225 }
6227 /* Spot cases that cannot be the beginning of a
6228 nested-name-specifier. On the second and subsequent times
6229 through the loop, we look for the `template' keyword. */
6231 ;
6232 /* A template-id can start a nested-name-specifier. */
6234 ;
6235 /* DR 743: decltype can be used in a nested-name-specifier. */
6237 ;
6238 else
6239 {
6240 /* If the next token is not an identifier, then it is
6241 definitely not a type-name or namespace-name. */
6244 /* If the following token is neither a `<' (to begin a
6245 template-id), nor a `::', then we are not looking at a
6246 nested-name-specifier. */
6252 {
6256 "found %<:%> in nested-name-specifier, "
6259 }
6262 && !cp_parser_nth_token_starts_template_argument_list_p
6265 }
6267 /* The nested-name-specifier is optional, so we parse
6268 tentatively. */
6271 /* Look for the optional `template' keyword, if this isn't the
6272 first time through the loop. */
6276 /* Save the old scope since the name lookup we are about to do
6277 might destroy it. */
6280 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6281 look up names in "X<T>::I" in order to determine that "Y" is
6282 a template. So, if we have a typename at this point, we make
6283 an effort to look through it. */
6285 && !typename_keyword_p
6290 /* Parse the qualifying entity. */
6291 new_scope
6293 typename_keyword_p,
6294 template_keyword_p,
6295 check_dependency_p,
6296 type_p,
6297 is_declaration);
6298 /* Look for the `::' token. */
6301 /* If we found what we wanted, we keep going; otherwise, we're
6302 done. */
6304 {
6307 /* Restore the OLD_SCOPE since it was valid before the
6308 failed attempt at finding the last
6309 class-or-namespace-name. */
6313 /* If the next token is a decltype, and the one after that is a
6314 `::', then the decltype has failed to resolve to a class or
6315 enumeration type. Give this error even when parsing
6316 tentatively since it can't possibly be valid--and we're going
6317 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6318 won't get another chance.*/
6322 {
6329 /* As below. */
6332 }
6336 {
6337 /* If we have a non-type template-id followed by ::, it can't
6338 possibly be valid. */
6343 {
6346 {
6352 }
6353 else
6354 {
6355 /* Variable template. */
6360 }
6367 /* As below. */
6371 }
6372 }
6376 /* If the next token is an identifier, and the one after
6377 that is a `::', then any valid interpretation would have
6378 found a class-or-namespace-name. */
6384 {
6387 {
6389 {
6390 tree decl;
6391 tree ambiguous_decls;
6394 none_type,
6403 decl);
6405 {
6406 // cp_parser_lookup_name has the same diagnostic,
6407 // thus make sure to emit it at most once.
6410 {
6415 }
6417 }
6418 else
6419 {
6421 cp_parser_name_lookup_error
6424 else
6425 cp_parser_name_lookup_error
6428 }
6429 }
6432 /* Treat this as a successful nested-name-specifier
6433 due to:
6435 [basic.lookup.qual]
6437 If the name found is not a class-name (clause
6438 _class_) or namespace-name (_namespace.def_), the
6439 program is ill-formed. */
6441 }
6443 }
6445 }
6446 /* We've found one valid nested-name-specifier. */
6448 /* Name lookup always gives us a DECL. */
6451 /* Uses of "template" must be followed by actual templates. */
6463 new_scope);
6464 /* If it is a class scope, try to complete it; we are about to
6465 be looking up names inside the class. */
6467 /* Since checking types for dependency can be expensive,
6468 avoid doing it if the type is already complete. */
6470 /* Do not try to complete dependent types. */
6472 {
6474 /* If it is a typedef to current class, use the current
6475 class instead, as the typedef won't have any names inside
6476 it yet. */
6480 }
6481 /* Make sure we look in the right scope the next time through
6482 the loop. */
6484 }
6486 /* If parsing tentatively, replace the sequence of tokens that makes
6487 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6488 token. That way, should we re-parse the token stream, we will
6489 not have to repeat the effort required to do the parse, nor will
6490 we issue duplicate error messages. */
6492 {
6496 /* Reset the contents of the START token. */
6498 /* Retrieve any deferred checks. Do not pop this access checks yet
6499 so the memory will not be reclaimed during token replacing below. */
6507 /* Purge all subsequent tokens. */
6509 }
6515 }
6517 /* Parse a nested-name-specifier. See
6518 cp_parser_nested_name_specifier_opt for details. This function
6519 behaves identically, except that it will an issue an error if no
6520 nested-name-specifier is present. */
6522 static tree
6528 {
6529 tree scope;
6531 /* Look for the nested-name-specifier. */
6533 typename_keyword_p,
6534 check_dependency_p,
6535 type_p,
6536 is_declaration);
6537 /* If it was not present, issue an error message. */
6539 {
6542 }
6545 }
6547 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6548 this is either a class-name or a namespace-name (which corresponds
6549 to the class-or-namespace-name production in the grammar). For
6550 C++0x, it can also be a type-name that refers to an enumeration
6551 type or a simple-template-id.
6553 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6554 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6555 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6556 TYPE_P is TRUE iff the next name should be taken as a class-name,
6557 even the same name is declared to be another entity in the same
6558 scope.
6560 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6561 specified by the class-or-namespace-name. If neither is found the
6562 ERROR_MARK_NODE is returned. */
6564 static tree
6571 {
6572 tree saved_scope;
6573 tree saved_qualifying_scope;
6574 tree saved_object_scope;
6575 tree scope;
6579 /* DR 743: decltype can appear in a nested-name-specifier. */
6581 {
6585 {
6588 }
6592 }
6594 /* Before we try to parse the class-name, we must save away the
6595 current PARSER->SCOPE since cp_parser_class_name will destroy
6596 it. */
6600 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6601 there is no need to look for a namespace-name. */
6602 only_class_p = template_keyword_p
6607 typename_keyword_p,
6608 template_keyword_p,
6610 check_dependency_p,
6612 is_declaration,
6615 /* If that didn't work, try for a namespace-name. */
6617 {
6618 /* Restore the saved scope. */
6622 /* If we are not looking at an identifier followed by the scope
6623 resolution operator, then this is not part of a
6624 nested-name-specifier. (Note that this function is only used
6625 to parse the components of a nested-name-specifier.) */
6630 }
6633 }
6635 /* Return true if we are looking at a compound-literal, false otherwise. */
6637 static bool
6639 {
6642 /* Skip tokens until the next token is a closing parenthesis.
6643 If we find the closing `)', and the next token is a `{', then
6644 we are looking at a compound-literal. */
6645 bool compound_literal_p
6650 /* Roll back the tokens we skipped. */
6654 }
6656 /* Return true if EXPR is the integer constant zero or a complex constant
6657 of zero, without any folding, but ignoring location wrappers. */
6659 bool
6661 {
6664 }
6666 /* Parse a postfix-expression.
6668 postfix-expression:
6669 primary-expression
6670 postfix-expression [ expression ]
6671 postfix-expression ( expression-list [opt] )
6672 simple-type-specifier ( expression-list [opt] )
6673 typename :: [opt] nested-name-specifier identifier
6674 ( expression-list [opt] )
6675 typename :: [opt] nested-name-specifier template [opt] template-id
6676 ( expression-list [opt] )
6677 postfix-expression . template [opt] id-expression
6678 postfix-expression -> template [opt] id-expression
6679 postfix-expression . pseudo-destructor-name
6680 postfix-expression -> pseudo-destructor-name
6681 postfix-expression ++
6682 postfix-expression --
6683 dynamic_cast < type-id > ( expression )
6684 static_cast < type-id > ( expression )
6685 reinterpret_cast < type-id > ( expression )
6686 const_cast < type-id > ( expression )
6687 typeid ( expression )
6688 typeid ( type-id )
6690 GNU Extension:
6692 postfix-expression:
6693 ( type-id ) { initializer-list , [opt] }
6695 This extension is a GNU version of the C99 compound-literal
6696 construct. (The C99 grammar uses `type-name' instead of `type-id',
6697 but they are essentially the same concept.)
6699 If ADDRESS_P is true, the postfix expression is the operand of the
6700 `&' operator. CAST_P is true if this expression is the target of a
6701 cast.
6703 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6704 class member access expressions [expr.ref].
6706 Returns a representation of the expression. */
6708 static cp_expr
6712 {
6714 location_t loc;
6720 /* Peek at the next token. */
6725 /* Some of the productions are determined by keywords. */
6728 {
6733 {
6734 tree type;
6735 cp_expr expression;
6739 /* All of these can be handled in the same way from the point
6740 of view of parsing. Begin by consuming the token
6741 identifying the cast. */
6744 /* New types cannot be defined in the cast. */
6746 parser->type_definition_forbidden_message
6749 /* Look for the opening `<'. */
6751 /* Parse the type to which we are casting. */
6756 /* Look for the closing `>'. */
6758 /* Restore the old message. */
6761 bool saved_greater_than_is_operator_p
6765 /* And the expression which is being cast. */
6766 matching_parens parens;
6770 RT_CLOSE_PAREN);
6774 parser->greater_than_is_operator_p
6777 /* Only type conversions to integral or enumeration types
6778 can be used in constant-expressions. */
6781 {
6784 }
6787 {
6789 postfix_expression
6793 postfix_expression
6797 postfix_expression
6799 tf_warning_or_error);
6802 postfix_expression
6807 }
6809 /* Construct a location e.g. :
6810 reinterpret_cast <int *> (expr)
6811 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6812 ranging from the start of the "*_cast" token to the final closing
6813 paren, with the caret at the start. */
6816 }
6820 {
6821 tree type;
6825 /* Consume the `typeid' token. */
6827 /* Look for the `(' token. */
6828 matching_parens parens;
6830 /* Types cannot be defined in a `typeid' expression. */
6832 parser->type_definition_forbidden_message
6834 /* We can't be sure yet whether we're looking at a type-id or an
6835 expression. */
6837 /* Try a type-id first. */
6842 /* Look for the `)' token. Otherwise, we can't be sure that
6843 we're not looking at an expression: consider `typeid (int
6844 (3))', for example. */
6846 /* If all went well, simply lookup the type-id. */
6849 /* Otherwise, fall back to the expression variant. */
6850 else
6851 {
6852 tree expression;
6854 /* Look for an expression. */
6856 /* Compute its typeid. */
6858 /* Look for the `)' token. */
6860 }
6861 /* Restore the saved message. */
6863 /* `typeid' may not appear in an integral constant expression. */
6867 /* Construct a location e.g. :
6868 typeid (expr)
6869 ^~~~~~~~~~~~~
6870 ranging from the start of the "typeid" token to the final closing
6871 paren, with the caret at the start. */
6873 {
6874 location_t typeid_loc
6878 }
6879 }
6883 {
6884 tree type;
6885 /* The syntax permitted here is the same permitted for an
6886 elaborated-type-specifier. */
6893 }
6899 {
6902 tree p;
6909 {
6912 }
6918 {
6921 postfix_expression
6923 else
6924 {
6928 }
6934 tf_warning_or_error);
6935 else
6936 {
6940 }
6945 postfix_expression
6949 postfix_expression
6952 else
6953 {
6957 }
6962 }
6964 }
6967 {
6968 tree type;
6970 /* If the next thing is a simple-type-specifier, we may be
6971 looking at a functional cast. We could also be looking at
6972 an id-expression. So, we try the functional cast, and if
6973 that doesn't work we fall back to the primary-expression. */
6975 /* Look for the simple-type-specifier. */
6979 CP_PARSER_FLAGS_NONE);
6981 /* Parse the cast itself. */
6983 postfix_expression
6985 /* If that worked, we're done. */
6989 /* If the functional-cast didn't work out, try a
6990 compound-literal. */
6993 {
6998 matching_parens parens;
7001 /* Avoid calling cp_parser_type_id pointlessly, see comment
7002 in cp_parser_cast_expression about c++/29234. */
7005 else
7006 {
7007 /* Parse the type. */
7013 }
7015 /* If things aren't going well, there's no need to
7016 keep going. */
7018 {
7020 /* Parse the brace-enclosed initializer list. */
7023 }
7024 /* If that worked, we're definitely looking at a
7025 compound-literal expression. */
7027 {
7028 /* Warn the user that a compound literal is not
7029 allowed in standard C++. */
7032 /* For simplicity, we disallow compound literals in
7033 constant-expressions. We could
7034 allow compound literals of integer type, whose
7035 initializer was a constant, in constant
7036 expressions. Permitting that usage, as a further
7037 extension, would not change the meaning of any
7038 currently accepted programs. (Of course, as
7039 compound literals are not part of ISO C++, the
7040 standard has nothing to say.) */
7042 NIC_NCC))
7043 {
7046 }
7047 /* Form the representation of the compound-literal. */
7048 postfix_expression
7053 }
7054 }
7056 /* It must be a primary-expression. */
7057 postfix_expression
7060 decltype_p,
7062 }
7064 }
7066 /* Note that we don't need to worry about calling build_cplus_new on a
7067 class-valued CALL_EXPR in decltype when it isn't the end of the
7068 postfix-expression; unary_complex_lvalue will take care of that for
7069 all these cases. */
7071 /* Keep looping until the postfix-expression is complete. */
7073 {
7077 /* It is not a Koenig lookup function call. */
7078 postfix_expression
7081 /* Peek at the next token. */
7085 {
7088 {
7090 "two consecutive %<[%> shall "
7093 }
7094 postfix_expression
7096 postfix_expression,
7098 decltype_p);
7107 /* postfix-expression ( expression-list [opt] ) */
7108 {
7119 is_builtin_constant_p
7122 {
7123 /* The whole point of __builtin_constant_p is to allow
7124 non-constant expressions to appear as arguments. */
7125 saved_integral_constant_expression_p
7127 saved_non_integral_constant_expression_p
7130 }
7131 args = (cp_parser_parenthesized_expression_list
7138 {
7139 parser->integral_constant_expression_p
7141 parser->non_integral_constant_expression_p
7143 }
7146 {
7149 }
7151 /* Function calls are not permitted in
7152 constant-expressions. */
7155 NIC_FUNC_CALL))
7156 {
7160 }
7165 {
7167 {
7169 {
7172 postfix_expression
7174 complain);
7175 }
7176 else
7177 postfix_expression
7179 }
7180 /* We do not perform argument-dependent lookup if
7181 normal lookup finds a non-function, in accordance
7182 with the expected resolution of DR 218. */
7185 {
7189 /* Do not do argument dependent lookup if regular
7190 lookup finds a member function or a block-scope
7191 function declaration. [basic.lookup.argdep]/3 */
7194 {
7197 postfix_expression
7199 complain);
7200 }
7201 }
7202 }
7205 {
7215 {
7217 postfix_expression
7221 }
7224 {
7225 postfix_expression
7226 = (build_new_method_call
7232 complain));
7233 }
7234 else
7235 postfix_expression
7239 complain);
7240 }
7244 postfix_expression = (build_offset_ref_call_from_tree
7246 complain));
7248 /* A call to a static class member, or a namespace-scope
7249 function. */
7250 postfix_expression
7253 koenig_p,
7254 complain);
7255 else
7256 /* All other function calls. */
7257 postfix_expression
7260 koenig_p,
7261 complain);
7264 {
7266 start_loc,
7267 close_paren_loc);
7269 }
7271 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7275 }
7280 /* postfix-expression . template [opt] id-expression
7281 postfix-expression . pseudo-destructor-name
7282 postfix-expression -> template [opt] id-expression
7283 postfix-expression -> pseudo-destructor-name */
7285 /* Consume the `.' or `->' operator. */
7288 postfix_expression
7290 postfix_expression,
7297 /* postfix-expression ++ */
7298 /* Consume the `++' token. */
7300 /* Generate a representation for the complete expression. */
7301 postfix_expression
7303 POSTINCREMENT_EXPR);
7304 /* Increments may not appear in constant-expressions. */
7312 /* postfix-expression -- */
7313 /* Consume the `--' token. */
7315 /* Generate a representation for the complete expression. */
7316 postfix_expression
7318 POSTDECREMENT_EXPR);
7319 /* Decrements may not appear in constant-expressions. */
7330 return is_member_access
7331 ? postfix_expression
7333 else
7335 }
7336 }
7338 /* We should never get here. */
7341 }
7343 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7344 by cp_parser_builtin_offsetof. We're looking for
7346 postfix-expression [ expression ]
7347 postfix-expression [ braced-init-list ] (C++11)
7349 FOR_OFFSETOF is set if we're being called in that context, which
7350 changes how we deal with integer constant expressions. */
7352 static tree
7354 tree postfix_expression,
7357 {
7362 /* Consume the `[' token. */
7368 /* Parse the index expression. */
7369 /* ??? For offsetof, there is a question of what to allow here. If
7370 offsetof is not being used in an integral constant expression context,
7371 then we *could* get the right answer by computing the value at runtime.
7372 If we are in an integral constant expression context, then we might
7373 could accept any constant expression; hard to say without analysis.
7374 Rather than open the barn door too wide right away, allow only integer
7375 constant expressions here. */
7378 else
7379 {
7381 {
7386 }
7387 else
7389 }
7393 /* Look for the closing `]'. */
7396 /* Build the ARRAY_REF. */
7400 /* When not doing offsetof, array references are not permitted in
7401 constant-expressions. */
7407 }
7409 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7410 dereference of incomplete type, returns true if error_mark_node should
7411 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7412 and *DEPENDENT_P. */
7414 bool
7417 {
7418 /* In a template, be permissive by treating an object expression
7419 of incomplete type as dependent (after a pedwarn). */
7420 diagnostic_t kind = (processing_template_decl
7424 {
7436 /* Don't emit any diagnostic for OVERLOADs. */
7440 /* Avoid clobbering e.g. DECLs. */
7444 }
7456 {
7459 }
7461 }
7463 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7464 by cp_parser_builtin_offsetof. We're looking for
7466 postfix-expression . template [opt] id-expression
7467 postfix-expression . pseudo-destructor-name
7468 postfix-expression -> template [opt] id-expression
7469 postfix-expression -> pseudo-destructor-name
7471 FOR_OFFSETOF is set if we're being called in that context. That sorta
7472 limits what of the above we'll actually accept, but nevermind.
7473 TOKEN_TYPE is the "." or "->" token, which will already have been
7474 removed from the stream. */
7476 static tree
7479 cp_expr postfix_expression,
7481 location_t location)
7482 {
7483 tree name;
7489 /* If this is a `->' operator, dereference the pointer. */
7492 tf_warning_or_error);
7493 /* Check to see whether or not the expression is type-dependent and
7494 not the current instantiation. */
7496 /* The identifier following the `->' or `.' is not qualified. */
7502 /* Enter the scope corresponding to the type of the object
7503 given by the POSTFIX_EXPRESSION. */
7505 {
7507 /* According to the standard, no expression should ever have
7508 reference type. Unfortunately, we do not currently match
7509 the standard in this respect in that our internal representation
7510 of an expression may have reference type even when the standard
7511 says it does not. Therefore, we have to manually obtain the
7512 underlying type here. */
7514 /* The type of the POSTFIX_EXPRESSION must be complete. */
7515 /* Unlike the object expression in other contexts, *this is not
7516 required to be of complete type for purposes of class member
7517 access (5.2.5) outside the member function body. */
7521 {
7527 }
7530 {
7531 /* Let the name lookup machinery know that we are processing a
7532 class member access expression. */
7534 /* If something went wrong, we want to be able to discern that case,
7535 as opposed to the case where there was no SCOPE due to the type
7536 of expression being dependent. */
7539 /* If the SCOPE was erroneous, make the various semantic analysis
7540 functions exit quickly -- and without issuing additional error
7541 messages. */
7544 }
7545 }
7548 /* Tell cp_parser_lookup_name that there was an object, even though it's
7549 type-dependent. */
7552 /* Assume this expression is not a pseudo-destructor access. */
7555 /* If the SCOPE is a scalar type, then, if this is a valid program,
7556 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7557 is type dependent, it can be pseudo-destructor-name or something else.
7558 Try to parse it as pseudo-destructor-name first. */
7560 {
7561 tree s;
7562 tree type;
7565 /* Parse the pseudo-destructor-name. */
7574 {
7576 postfix_expression
7579 }
7580 }
7583 {
7584 /* If the SCOPE is not a scalar type, we are looking at an
7585 ordinary class member access expression, rather than a
7586 pseudo-destructor-name. */
7589 /* Parse the id-expression. */
7590 name = (cp_parser_id_expression
7597 /* In general, build a SCOPE_REF if the member name is qualified.
7598 However, if the name was not dependent and has already been
7599 resolved; there is no need to build the SCOPE_REF. For example;
7601 struct X { void f(); };
7602 template <typename T> void f(T* t) { t->X::f(); }
7604 Even though "t" is dependent, "X::f" is not and has been resolved
7605 to a BASELINK; there is no need to include scope information. */
7607 /* But we do need to remember that there was an explicit scope for
7608 virtual function calls. */
7612 /* If the name is a template-id that names a type, we will get a
7613 TYPE_DECL here. That is invalid code. */
7615 {
7618 }
7619 else
7620 {
7622 {
7624 {
7628 }
7629 else
7632 name,
7633 template_p);
7637 }
7639 adjust_result_of_qualified_name_lookup
7641 postfix_expression
7643 template_p,
7644 tf_warning_or_error);
7645 /* Build a location e.g.:
7646 ptr->access_expr
7647 ~~~^~~~~~~~~~~~~
7648 where the caret is at the deref token, ranging from
7649 the start of postfix_expression to the end of the access expr. */
7650 location_t end_loc
7652 location_t combined_loc
7655 }
7656 }
7658 /* We no longer need to look up names in the scope of the object on
7659 the left-hand side of the `.' or `->' operator. */
7662 /* Outside of offsetof, these operators may not appear in
7663 constant-expressions. */
7665 && (cp_parser_non_integral_constant_expression
7670 }
7672 /* Parse a parenthesized expression-list.
7674 expression-list:
7675 assignment-expression
7676 expression-list, assignment-expression
7678 attribute-list:
7679 expression-list
7680 identifier
7681 identifier, expression-list
7683 CAST_P is true if this expression is the target of a cast.
7685 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7686 argument pack.
7688 WRAP_LOCATIONS_P is true if expressions within this list for which
7689 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7690 their source locations.
7692 Returns a vector of trees. Each element is a representation of an
7693 assignment-expression. NULL is returned if the ( and or ) are
7694 missing. An empty, but allocated, vector is returned on no
7695 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7696 if we are parsing an attribute list for an attribute that wants a
7697 plain identifier argument, normal_attr for an attribute that wants
7698 an expression, or non_attr if we aren't parsing an attribute list. If
7699 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7700 not all of the expressions in the list were constant.
7701 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7702 will be written to with the location of the closing parenthesis. If
7703 an error occurs, it may or may not be written to. */
7713 {
7719 /* Assume all the expressions will be constant. */
7723 matching_parens parens;
7729 /* Within a parenthesized expression, a `>' token is always
7730 the greater-than operator. */
7731 saved_greater_than_is_operator_p
7737 /* Consume expressions until there are no more. */
7740 {
7741 /* At the beginning of attribute lists, check to see if the
7742 next token is an identifier. */
7745 {
7748 /* Consume the identifier. */
7750 /* Save the identifier. */
7752 }
7753 else
7754 {
7757 /* Parse the next assignment-expression. */
7759 {
7760 /* A braced-init-list. */
7766 }
7768 {
7769 expr = (cp_parser_constant_expression
7774 }
7775 else
7777 cast_p);
7782 /* If we have an ellipsis, then this is an expression
7783 expansion. */
7786 {
7787 /* Consume the `...'. */
7790 /* Build the argument pack. */
7792 }
7797 /* Add it to the list. We add error_mark_node
7798 expressions to the list, so that we can still tell if
7799 the correct form for a parenthesized expression-list
7800 is found. That gives better errors. */
7805 }
7807 /* After the first item, attribute lists look the same as
7808 expression lists. */
7811 get_comma:;
7812 /* If the next token isn't a `,', then we are done. */
7816 /* Otherwise, consume the `,' and keep going. */
7818 }
7824 {
7827 skip_comma:;
7828 /* We try and resync to an unnested comma, as that will give the
7829 user better diagnostics. */
7837 {
7838 parser->greater_than_is_operator_p
7841 }
7842 }
7844 parser->greater_than_is_operator_p
7851 }
7853 /* Parse a pseudo-destructor-name.
7855 pseudo-destructor-name:
7856 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7857 :: [opt] nested-name-specifier template template-id :: ~ type-name
7858 :: [opt] nested-name-specifier [opt] ~ type-name
7860 If either of the first two productions is used, sets *SCOPE to the
7861 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7862 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7863 or ERROR_MARK_NODE if the parse fails. */
7865 static void
7867 tree object,
7870 {
7873 /* Handle ~auto. */
7877 {
7880 "%<~auto%> only available with "
7887 }
7889 /* Assume that things will not work out. */
7892 /* Look for the optional `::' operator. */
7894 /* Look for the optional nested-name-specifier. */
7895 nested_name_specifier_p
7902 /* Now, if we saw a nested-name-specifier, we might be doing the
7903 second production. */
7906 {
7907 /* Consume the `template' keyword. */
7909 /* Parse the template-id. */
7913 class_type,
7915 /* Look for the `::' token. */
7917 }
7918 /* If the next token is not a `~', then there might be some
7919 additional qualification. */
7921 {
7922 /* At this point, we're looking for "type-name :: ~". The type-name
7923 must not be a class-name, since this is a pseudo-destructor. So,
7924 it must be either an enum-name, or a typedef-name -- both of which
7925 are just identifiers. So, we peek ahead to check that the "::"
7926 and "~" tokens are present; if they are not, then we can avoid
7927 calling type_name. */
7931 {
7934 }
7936 /* Look for the type-name. */
7941 /* Look for the `::' token. */
7943 }
7944 else
7947 /* Look for the `~'. */
7950 /* Once we see the ~, this has to be a pseudo-destructor. */
7954 /* Look for the type-name again. We are not responsible for
7955 checking that it matches the first type-name. */
7957 }
7959 /* Parse a unary-expression.
7961 unary-expression:
7962 postfix-expression
7963 ++ cast-expression
7964 -- cast-expression
7965 unary-operator cast-expression
7966 sizeof unary-expression
7967 sizeof ( type-id )
7968 alignof ( type-id ) [C++0x]
7969 new-expression
7970 delete-expression
7972 GNU Extensions:
7974 unary-expression:
7975 __extension__ cast-expression
7976 __alignof__ unary-expression
7977 __alignof__ ( type-id )
7978 alignof unary-expression [C++0x]
7979 __real__ cast-expression
7980 __imag__ cast-expression
7981 && identifier
7982 sizeof ( type-id ) { initializer-list , [opt] }
7983 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7984 __alignof__ ( type-id ) { initializer-list , [opt] }
7986 ADDRESS_P is true iff the unary-expression is appearing as the
7987 operand of the `&' operator. CAST_P is true if this expression is
7988 the target of a cast.
7990 Returns a representation of the expression. */
7992 static cp_expr
7995 {
7999 /* Peek at the next token. */
8001 /* Some keywords give away the kind of expression. */
8003 {
8007 {
8010 {
8018 /* Consume the token. */
8020 /* Parse the operand. */
8026 else
8027 {
8028 /* ISO C++ defines alignof only with types, not with
8029 expressions. So pedwarn if alignof is used with a non-
8030 type expression. However, __alignof__ is ok. */
8033 "ISO C++ does not allow %<alignof%> "
8037 }
8038 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8039 SIZEOF_EXPR with the original operand. */
8041 {
8043 {
8045 {
8048 error_mark_node));
8050 }
8051 else
8055 }
8056 }
8058 /* Construct a location e.g. :
8059 alignof (expr)
8060 ^~~~~~~~~~~~~~
8061 with start == caret at the start of the "alignof"/"sizeof"
8062 token, with the endpoint at the final closing paren. */
8063 location_t finish_loc
8065 location_t compound_loc
8072 }
8081 {
8082 /* The saved value of the PEDANTIC flag. */
8084 tree expr;
8086 /* Save away the PEDANTIC flag. */
8088 /* Parse the cast-expression. */
8090 /* Restore the PEDANTIC flag. */
8094 }
8098 {
8099 tree expression;
8101 /* Consume the `__real__' or `__imag__' token. */
8103 /* Parse the cast-expression. */
8105 /* Create the complete representation. */
8109 expression,
8110 tf_warning_or_error);
8111 }
8119 {
8120 tree expr;
8129 matching_parens parens;
8133 parser->type_definition_forbidden_message
8136 saved_integral_constant_expression_p
8138 saved_non_integral_constant_expression_p
8142 saved_greater_than_is_operator_p
8154 parser->greater_than_is_operator_p
8157 parser->integral_constant_expression_p
8159 parser->non_integral_constant_expression_p
8164 location_t finish_loc
8168 /* Construct a location of the form:
8169 noexcept (expr)
8170 ^~~~~~~~~~~~~~~
8171 with start == caret, finishing at the close-paren. */
8172 location_t noexcept_loc
8176 noexcept_loc);
8177 }
8181 }
8182 }
8184 /* Look for the `:: new' and `:: delete', which also signal the
8185 beginning of a new-expression, or delete-expression,
8186 respectively. If the next token is `::', then it might be one of
8187 these. */
8189 {
8192 /* See if the token after the `::' is one of the keywords in
8193 which we're interested. */
8195 /* If it's `new', we have a new-expression. */
8198 /* Similarly, for `delete'. */
8201 }
8203 /* Look for a unary operator. */
8205 /* The `++' and `--' operators can be handled similarly, even though
8206 they are not technically unary-operators in the grammar. */
8208 {
8213 /* Handle the GNU address-of-label extension. */
8216 {
8217 tree identifier;
8218 tree expression;
8221 /* Consume the '&&' token. */
8223 /* Look for the identifier. */
8224 location_t finish_loc
8227 /* Construct a location of the form:
8228 &&label
8229 ^~~~~~~
8230 with caret==start at the "&&", finish at the end of the label. */
8231 location_t combined_loc
8233 /* Create an expression representing the address. */
8236 NIC_ADDR_LABEL))
8239 }
8240 }
8242 {
8243 cp_expr cast_expression;
8249 /* Consume the operator token. */
8253 /* Parse the cast-expression. */
8254 cast_expression
8259 pidk);
8261 /* Make a location:
8262 OP_TOKEN CAST_EXPRESSION
8263 ^~~~~~~~~~~~~~~~~~~~~~~~~
8264 with start==caret at the operator token, and
8265 extending to the end of the cast_expression. */
8268 /* Now, build an appropriate representation. */
8270 {
8274 RO_UNARY_STAR,
8275 complain);
8276 /* TODO: build_x_indirect_ref does not always honor the
8277 location, so ensure it is set. */
8283 /* Fall through. */
8286 cast_expression,
8287 complain);
8288 /* TODO: build_x_unary_op does not always honor the location,
8289 so ensure it is set. */
8297 /* Fall through. */
8299 /* Immediately fold negation of a constant, unless the constant is 0
8300 (since -0 == 0) or it would overflow. */
8305 {
8308 cast_expression);
8310 {
8313 }
8314 }
8315 /* Fall through. */
8324 }
8328 non_constant_p))
8332 }
8336 decltype_p,
8337 pidk);
8338 }
8340 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8341 unary-operator, the corresponding tree code is returned. */
8343 static enum tree_code
8345 {
8347 {
8368 }
8369 }
8371 /* Parse a new-expression.
8373 new-expression:
8374 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8375 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8377 Returns a representation of the expression. */
8379 static tree
8381 {
8384 tree type;
8387 tree ret;
8391 /* Look for the optional `::' operator. */
8392 global_scope_p
8396 /* Look for the `new' operator. */
8398 /* There's no easy way to tell a new-placement from the
8399 `( type-id )' construct. */
8401 /* Look for a new-placement. */
8403 /* If that didn't work out, there's no new-placement. */
8405 {
8409 }
8411 /* If the next token is a `(', then we have a parenthesized
8412 type-id. */
8414 {
8418 /* Consume the `('. */
8419 matching_parens parens;
8422 /* Parse the type-id. */
8423 parser->type_definition_forbidden_message
8425 {
8428 }
8431 /* Look for the closing `)'. */
8434 /* There should not be a direct-new-declarator in this production,
8435 but GCC used to allowed this, so we check and emit a sensible error
8436 message for this case. */
8438 {
8444 }
8445 }
8446 /* Otherwise, there must be a new-type-id. */
8447 else
8450 /* If the next token is a `(' or '{', then we have a new-initializer. */
8455 else
8458 /* A new-expression may not appear in an integral constant
8459 expression. */
8462 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8463 of a new-type-id or type-id of a new-expression, the new-expression shall
8464 contain a new-initializer of the form ( assignment-expression )".
8465 Additionally, consistently with the spirit of DR 1467, we want to accept
8466 'new auto { 2 }' too. */
8472 {
8474 "initialization of new-expression for type %<auto%> "
8477 }
8478 else
8479 {
8480 /* Construct a location e.g.:
8481 ptr = new int[100]
8482 ^~~~~~~~~~~~
8483 with caret == start at the start of the "new" token, and the end
8484 at the end of the final token we consumed. */
8489 /* Create a representation of the new-expression. */
8491 tf_warning_or_error);
8493 }
8501 }
8503 /* Parse a new-placement.
8505 new-placement:
8506 ( expression-list )
8508 Returns the same representation as for an expression-list. */
8512 {
8515 /* Parse the expression-list. */
8516 expression_list = (cp_parser_parenthesized_expression_list
8525 }
8527 /* Parse a new-type-id.
8529 new-type-id:
8530 type-specifier-seq new-declarator [opt]
8532 Returns the TYPE allocated. If the new-type-id indicates an array
8533 type, *NELTS is set to the number of elements in the last array
8534 bound; the TYPE will not include the last array bound. */
8536 static tree
8538 {
8539 cp_decl_specifier_seq type_specifier_seq;
8545 /* The type-specifier sequence must not contain type definitions.
8546 (It cannot contain declarations of new types either, but if they
8547 are not definitions we will catch that because they are not
8548 complete.) */
8550 parser->type_definition_forbidden_message
8552 /* Parse the type-specifier-seq. */
8556 /* Restore the old message. */
8562 /* Parse the new-declarator. */
8565 /* Determine the number of elements in the last array dimension, if
8566 any. */
8568 /* Skip down to the last array dimension. */
8573 {
8576 }
8581 {
8584 }
8587 {
8594 else
8596 }
8599 }
8601 /* Parse an (optional) new-declarator.
8603 new-declarator:
8604 ptr-operator new-declarator [opt]
8605 direct-new-declarator
8607 Returns the declarator. */
8611 {
8614 cp_cv_quals cv_quals;
8616 /* We don't know if there's a ptr-operator next, or not. */
8618 /* Look for a ptr-operator. */
8620 /* If that worked, look for more new-declarators. */
8622 {
8625 /* Parse another optional declarator. */
8628 declarator = cp_parser_make_indirect_declarator
8632 }
8634 /* If the next token is a `[', there is a direct-new-declarator. */
8639 }
8641 /* Parse a direct-new-declarator.
8643 direct-new-declarator:
8644 [ expression ]
8645 direct-new-declarator [constant-expression]
8647 */
8651 {
8655 {
8656 tree expression;
8659 /* Look for the opening `['. */
8664 /* The standard requires that the expression have integral
8665 type. DR 74 adds enumeration types. We believe that the
8666 real intent is that these expressions be handled like the
8667 expression in a `switch' condition, which also allows
8668 classes with a single conversion to integral or
8669 enumeration type. */
8671 {
8672 expression
8674 expression,
8677 {
8679 "expression in new-declarator must have integral "
8682 }
8683 }
8685 /* Look for the closing `]'. */
8688 /* Add this bound to the declarator. */
8691 /* If the next token is not a `[', then there are no more
8692 bounds. */
8695 }
8698 }
8700 /* Parse a new-initializer.
8702 new-initializer:
8703 ( expression-list [opt] )
8704 braced-init-list
8706 Returns a representation of the expression-list. */
8710 {
8714 {
8715 tree t;
8722 }
8723 else
8724 expression_list = (cp_parser_parenthesized_expression_list
8730 }
8732 /* Parse a delete-expression.
8734 delete-expression:
8735 :: [opt] delete cast-expression
8736 :: [opt] delete [ ] cast-expression
8738 Returns a representation of the expression. */
8740 static tree
8742 {
8745 tree expression;
8747 /* Look for the optional `::' operator. */
8748 global_scope_p
8752 /* Look for the `delete' keyword. */
8754 /* See if the array syntax is in use. */
8756 {
8757 /* Consume the `[' token. */
8759 /* Look for the `]' token. */
8761 /* Remember that this is the `[]' construct. */
8763 }
8764 else
8767 /* Parse the cast-expression. */
8770 /* A delete-expression may not appear in an integral constant
8771 expression. */
8776 tf_warning_or_error);
8777 }
8779 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8780 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8781 0 otherwise. */
8783 static int
8785 {
8788 {
8830 /* In ((type ()) () the last () isn't a valid cast-expression,
8831 so the whole must be parsed as postfix-expression. */
8836 /* '[' may start a primary-expression in obj-c++ and in C++11,
8837 as a lambda-expression, eg, '(void)[]{}'. */
8844 /* '++' and '--' may or may not start a cast-expression:
8846 struct T { void operator++(int); };
8847 void f() { (T())++; }
8849 vs
8851 int a;
8852 (int)++a; */
8857 }
8858 }
8860 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8861 in the order: const_cast, static_cast, reinterpret_cast.
8863 Don't suggest dynamic_cast.
8865 Return the first legal cast kind found, or NULL otherwise. */
8869 {
8870 tree trial;
8872 /* Reuse the parser logic by attempting to build the various kinds of
8873 cast, with "complain" disabled.
8874 Identify the first such cast that is valid. */
8876 /* Don't attempt to run such logic within template processing. */
8880 /* First try const_cast. */
8885 /* If that fails, try static_cast. */
8890 /* Finally, try reinterpret_cast. */
8895 /* No such cast possible. */
8897 }
8899 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8900 suggesting how to convert a C-style cast of the form:
8902 (DST_TYPE)ORIG_EXPR
8904 to a C++-style cast.
8906 The primary range of RICHLOC is asssumed to be that of the original
8907 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8908 of the parens in the C-style cast. */
8910 static void
8913 tree dst_type)
8914 {
8915 /* This function is non-trivial, so bail out now if the warning isn't
8916 going to be emitted. */
8920 /* Try to find a legal C++ cast, trying them in order:
8921 const_cast, static_cast, reinterpret_cast. */
8926 /* Replace the open paren with "CAST_SUGGESTION<". */
8927 pretty_printer pp;
8931 /* Replace the close paren with "> (". */
8934 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8936 }
8939 /* Parse a cast-expression.
8941 cast-expression:
8942 unary-expression
8943 ( type-id ) cast-expression
8945 ADDRESS_P is true iff the unary-expression is appearing as the
8946 operand of the `&' operator. CAST_P is true if this expression is
8947 the target of a cast.
8949 Returns a representation of the expression. */
8951 static cp_expr
8954 {
8955 /* If it's a `(', then we might be looking at a cast. */
8957 {
8963 /* There's no way to know yet whether or not this is a cast.
8964 For example, `(int (3))' is a unary-expression, while `(int)
8965 3' is a cast. So, we resort to parsing tentatively. */
8967 /* Types may not be defined in a cast. */
8969 parser->type_definition_forbidden_message
8971 /* Consume the `('. */
8972 matching_parens parens;
8977 /* A very tricky bit is that `(struct S) { 3 }' is a
8978 compound-literal (which we permit in C++ as an extension).
8979 But, that construct is not a cast-expression -- it is a
8980 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8981 is legal; if the compound-literal were a cast-expression,
8982 you'd need an extra set of parentheses.) But, if we parse
8983 the type-id, and it happens to be a class-specifier, then we
8984 will commit to the parse at that point, because we cannot
8985 undo the action that is done when creating a new class. So,
8986 then we cannot back up and do a postfix-expression.
8988 Another tricky case is the following (c++/29234):
8990 struct S { void operator () (); };
8992 void foo ()
8993 {
8994 ( S()() );
8995 }
8997 As a type-id we parse the parenthesized S()() as a function
8998 returning a function, groktypename complains and we cannot
8999 back up in this case either.
9001 Therefore, we scan ahead to the closing `)', and check to see
9002 if the tokens after the `)' can start a cast-expression. Otherwise
9003 we are dealing with an unary-expression, a postfix-expression
9004 or something else.
9006 Yet another tricky case, in C++11, is the following (c++/54891):
9008 (void)[]{};
9010 The issue is that usually, besides the case of lambda-expressions,
9011 the parenthesized type-id cannot be followed by '[', and, eg, we
9012 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9013 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9014 we don't commit, we try a cast-expression, then an unary-expression.
9016 Save tokens so that we can put them back. */
9019 /* We may be looking at a cast-expression. */
9022 cast_expression
9025 /* Roll back the tokens we skipped. */
9027 /* If we aren't looking at a cast-expression, simulate an error so
9028 that the call to cp_parser_error_occurred below returns true. */
9031 else
9032 {
9035 /* Look for the type-id. */
9037 /* Look for the closing `)'. */
9042 }
9044 /* Restore the saved message. */
9047 /* At this point this can only be either a cast or a
9048 parenthesized ctor such as `(T ())' that looks like a cast to
9049 function returning T. */
9051 {
9052 /* Only commit if the cast-expression doesn't start with
9053 '++', '--', or '[' in C++11. */
9061 pidk);
9064 {
9065 /* Warn about old-style casts, if so requested. */
9070 {
9076 }
9078 /* Only type conversions to integral or enumeration types
9079 can be used in constant-expressions. */
9082 NIC_CAST))
9085 /* Perform the cast. */
9086 /* Make a location:
9087 (TYPE) EXPR
9088 ^~~~~~~~~~~
9089 with start==caret at the open paren, extending to the
9090 end of "expr". */
9092 open_paren_loc,
9096 }
9097 }
9098 else
9100 }
9102 /* If we get here, then it's not a cast, so it must be a
9103 unary-expression. */
9106 }
9108 /* Parse a binary expression of the general form:
9110 pm-expression:
9111 cast-expression
9112 pm-expression .* cast-expression
9113 pm-expression ->* cast-expression
9115 multiplicative-expression:
9116 pm-expression
9117 multiplicative-expression * pm-expression
9118 multiplicative-expression / pm-expression
9119 multiplicative-expression % pm-expression
9121 additive-expression:
9122 multiplicative-expression
9123 additive-expression + multiplicative-expression
9124 additive-expression - multiplicative-expression
9126 shift-expression:
9127 additive-expression
9128 shift-expression << additive-expression
9129 shift-expression >> additive-expression
9131 relational-expression:
9132 shift-expression
9133 relational-expression < shift-expression
9134 relational-expression > shift-expression
9135 relational-expression <= shift-expression
9136 relational-expression >= shift-expression
9138 GNU Extension:
9140 relational-expression:
9141 relational-expression <? shift-expression
9142 relational-expression >? shift-expression
9144 equality-expression:
9145 relational-expression
9146 equality-expression == relational-expression
9147 equality-expression != relational-expression
9149 and-expression:
9150 equality-expression
9151 and-expression & equality-expression
9153 exclusive-or-expression:
9154 and-expression
9155 exclusive-or-expression ^ and-expression
9157 inclusive-or-expression:
9158 exclusive-or-expression
9159 inclusive-or-expression | exclusive-or-expression
9161 logical-and-expression:
9162 inclusive-or-expression
9163 logical-and-expression && inclusive-or-expression
9165 logical-or-expression:
9166 logical-and-expression
9167 logical-or-expression || logical-and-expression
9169 All these are implemented with a single function like:
9171 binary-expression:
9172 simple-cast-expression
9173 binary-expression <token> binary-expression
9175 CAST_P is true if this expression is the target of a cast.
9177 The binops_by_token map is used to get the tree codes for each <token> type.
9178 binary-expressions are associated according to a precedence table. */
9180 #define TOKEN_PRECEDENCE(token) \
9181 (((token->type == CPP_GREATER \
9182 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9183 && !parser->greater_than_is_operator_p) \
9184 ? PREC_NOT_OPERATOR \
9185 : binops_by_token[token->type].prec)
9187 static cp_expr
9193 {
9194 cp_parser_expression_stack stack;
9196 cp_parser_expression_stack_entry current;
9197 cp_expr rhs;
9201 tree overload;
9203 /* Parse the first expression. */
9214 {
9215 /* Get an operator token. */
9221 {
9223 "%<>>%> operator is treated"
9227 }
9232 /* This is a fold-expression; handle it later. */
9235 /* Popping an entry off the stack means we completed a subexpression:
9236 - either we found a token which is not an operator (`>' where it is not
9237 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9238 will happen repeatedly;
9239 - or, we found an operator which has lower priority. This is the case
9240 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9241 parsing `3 * 4'. */
9243 {
9246 else
9248 }
9250 get_rhs:
9254 /* We used the operator token. */
9257 /* For "false && x" or "true || x", x will never be executed;
9258 disable warnings while evaluating it. */
9260 c_inhibit_evaluation_warnings +=
9263 c_inhibit_evaluation_warnings +=
9266 /* Extract another operand. It may be the RHS of this expression
9267 or the LHS of a new, higher priority expression. */
9272 /* Get another operator token. Look up its precedence to avoid
9273 building a useless (immediately popped) stack entry for common
9274 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9281 {
9282 /* ... and prepare to parse the RHS of the new, higher priority
9283 expression. Since precedence levels on the stack are
9284 monotonically increasing, we do not have to care about
9285 stack overflows. */
9294 pop:
9296 /* If the stack is not empty, we have parsed into LHS the right side
9297 (`4' in the example above) of an expression we had suspended.
9298 We can use the information on the stack to recover the LHS (`3')
9299 from the stack together with the tree code (`MULT_EXPR'), and
9300 the precedence of the higher level subexpression
9301 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9302 which will be used to actually build the additive expression. */
9307 }
9309 /* Undo the disabling of warnings done above. */
9311 c_inhibit_evaluation_warnings -=
9314 c_inhibit_evaluation_warnings -=
9320 /* Avoid warning for !!x == y. */
9325 /* Avoid warning for !b == y where b is boolean. */
9329 /* Avoid warning for !!b == y where b is boolean. */
9342 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9343 ERROR_MARK for everything that is not a binary expression.
9344 This makes warn_about_parentheses miss some warnings that
9345 involve unary operators. For unary expressions we should
9346 pass the correct tree_code unless the unary expression was
9347 surrounded by parentheses.
9348 */
9352 {
9355 else
9356 {
9357 current.lhs
9360 == tcc_comparison
9364 }
9365 }
9366 else
9367 {
9372 /* TODO: build_x_binary_op doesn't always honor the location. */
9374 }
9377 /* If the binary operator required the use of an overloaded operator,
9378 then this expression cannot be an integral constant-expression.
9379 An overloaded operator can be used even if both operands are
9380 otherwise permissible in an integral constant-expression if at
9381 least one of the operands is of enumeration type. */
9385 NIC_OVERLOADED))
9387 }
9390 }
9392 static cp_expr
9397 {
9400 }
9402 /* Parse the `? expression : assignment-expression' part of a
9403 conditional-expression. The LOGICAL_OR_EXPR is the
9404 logical-or-expression that started the conditional-expression.
9405 Returns a representation of the entire conditional-expression.
9407 This routine is used by cp_parser_assignment_expression.
9409 ? expression : assignment-expression
9411 GNU Extensions:
9413 ? : assignment-expression */
9415 static tree
9417 {
9419 cp_expr assignment_expr;
9423 /* Consume the `?' token. */
9428 {
9431 /* Implicit true clause. */
9433 c_inhibit_evaluation_warnings +=
9436 }
9437 else
9438 {
9441 /* Parse the expression. */
9442 c_inhibit_evaluation_warnings +=
9445 c_inhibit_evaluation_warnings +=
9449 }
9451 /* The next token should be a `:'. */
9453 /* Parse the assignment-expression. */
9455 c_inhibit_evaluation_warnings -=
9458 /* Make a location:
9459 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9460 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9461 with the caret at the "?", ranging from the start of
9462 the logical_or_expr to the end of the assignment_expr. */
9467 /* Build the conditional-expression. */
9469 expr,
9470 assignment_expr,
9471 tf_warning_or_error);
9472 }
9474 /* Parse an assignment-expression.
9476 assignment-expression:
9477 conditional-expression
9478 logical-or-expression assignment-operator assignment_expression
9479 throw-expression
9481 CAST_P is true if this expression is the target of a cast.
9482 DECLTYPE_P is true if this expression is the operand of decltype.
9484 Returns a representation for the expression. */
9486 static cp_expr
9489 {
9490 cp_expr expr;
9492 /* If the next token is the `throw' keyword, then we're looking at
9493 a throw-expression. */
9496 /* Otherwise, it must be that we are looking at a
9497 logical-or-expression. */
9498 else
9499 {
9500 /* Parse the binary expressions (logical-or-expression). */
9502 decltype_p,
9504 /* If the next token is a `?' then we're actually looking at a
9505 conditional-expression. */
9508 else
9509 {
9512 /* If it's an assignment-operator, we're using the second
9513 production. */
9514 enum tree_code assignment_operator
9517 {
9520 /* Parse the right-hand side of the assignment. */
9527 /* An assignment may not appear in a
9528 constant-expression. */
9530 NIC_ASSIGNMENT))
9532 /* Build the assignment expression. Its default
9533 location:
9534 LHS = RHS
9535 ~~~~^~~~~
9536 is the location of the '=' token as the
9537 caret, ranging from the start of the lhs to the
9538 end of the rhs. */
9543 assignment_operator,
9544 rhs,
9546 /* TODO: build_x_modify_expr doesn't honor the location,
9547 so we must set it here. */
9549 }
9550 }
9551 }
9554 }
9556 /* Parse an (optional) assignment-operator.
9558 assignment-operator: one of
9559 = *= /= %= += -= >>= <<= &= ^= |=
9561 GNU Extension:
9563 assignment-operator: one of
9564 <?= >?=
9566 If the next token is an assignment operator, the corresponding tree
9567 code is returned, and the token is consumed. For example, for
9568 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9569 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9570 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9571 operator, ERROR_MARK is returned. */
9573 static enum tree_code
9575 {
9579 /* Peek at the next token. */
9583 {
9629 /* Nothing else is an assignment operator. */
9631 }
9633 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9638 /* If it was an assignment operator, consume it. */
9643 }
9645 /* Parse an expression.
9647 expression:
9648 assignment-expression
9649 expression , assignment-expression
9651 CAST_P is true if this expression is the target of a cast.
9652 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9653 except possibly parenthesized or on the RHS of a comma (N3276).
9655 Returns a representation of the expression. */
9657 static cp_expr
9660 {
9665 {
9666 cp_expr assignment_expression;
9668 /* Parse the next assignment-expression. */
9669 assignment_expression
9672 /* We don't create a temporary for a call that is the immediate operand
9673 of decltype or on the RHS of a comma. But when we see a comma, we
9674 need to create a temporary for a call on the LHS. */
9679 assignment_expression
9683 /* If this is the first assignment-expression, we can just
9684 save it away. */
9687 else
9688 {
9689 /* Create a location with caret at the comma, ranging
9690 from the start of the LHS to the end of the RHS. */
9695 assignment_expression,
9698 }
9699 /* If the next token is not a comma, or we're in a fold-expression, then
9700 we are done with the expression. */
9704 /* Consume the `,'. */
9707 /* A comma operator cannot appear in a constant-expression. */
9710 }
9713 }
9715 /* Parse a constant-expression.
9717 constant-expression:
9718 conditional-expression
9720 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9721 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9722 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9723 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9724 only parse a conditional-expression, otherwise parse an
9725 assignment-expression. See below for rationale. */
9727 static cp_expr
9732 {
9736 cp_expr expression;
9738 /* It might seem that we could simply parse the
9739 conditional-expression, and then check to see if it were
9740 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9741 one that the compiler can figure out is constant, possibly after
9742 doing some simplifications or optimizations. The standard has a
9743 precise definition of constant-expression, and we must honor
9744 that, even though it is somewhat more restrictive.
9746 For example:
9748 int i[(2, 3)];
9750 is not a legal declaration, because `(2, 3)' is not a
9751 constant-expression. The `,' operator is forbidden in a
9752 constant-expression. However, GCC's constant-folding machinery
9753 will fold this operation to an INTEGER_CST for `3'. */
9755 /* Save the old settings. */
9757 saved_allow_non_integral_constant_expression_p
9760 /* We are now parsing a constant-expression. */
9762 parser->allow_non_integral_constant_expression_p
9765 /* Although the grammar says "conditional-expression", when not STRICT_P,
9766 we parse an "assignment-expression", which also permits
9767 "throw-expression" and the use of assignment operators. In the case
9768 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9769 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9770 actually essential that we look for an assignment-expression.
9771 For example, cp_parser_initializer_clauses uses this function to
9772 determine whether a particular assignment-expression is in fact
9773 constant. */
9775 {
9776 /* Parse the binary expressions (logical-or-expression). */
9779 /* If the next token is a `?' then we're actually looking at
9780 a conditional-expression; otherwise we're done. */
9783 }
9784 else
9786 /* Restore the old settings. */
9787 parser->integral_constant_expression_p
9789 parser->allow_non_integral_constant_expression_p
9792 {
9793 /* Require an rvalue constant expression here; that's what our
9794 callers expect. Reference constant expressions are handled
9795 separately in e.g. cp_parser_template_argument. */
9804 }
9807 parser->non_integral_constant_expression_p
9811 }
9813 /* Parse __builtin_offsetof.
9815 offsetof-expression:
9816 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9818 offsetof-member-designator:
9819 id-expression
9820 | offsetof-member-designator "." id-expression
9821 | offsetof-member-designator "[" expression "]"
9822 | offsetof-member-designator "->" id-expression */
9824 static cp_expr
9826 {
9828 tree type;
9829 cp_expr expr;
9830 cp_id_kind dummy;
9832 location_t finish_loc;
9834 /* We're about to accept non-integral-constant things, but will
9835 definitely yield an integral constant expression. Save and
9836 restore these values around our local parsing. */
9842 /* Consume the "__builtin_offsetof" token. */
9844 /* Consume the opening `('. */
9845 matching_parens parens;
9847 /* Parse the type-id. */
9849 {
9851 parser->type_definition_forbidden_message
9855 }
9856 /* Look for the `,'. */
9860 /* Build the (type *)null that begins the traditional offsetof macro. */
9861 tree object_ptr
9863 tf_warning_or_error);
9865 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9869 {
9872 {
9874 /* offsetof-member-designator "[" expression "]" */
9880 /* offsetof-member-designator "->" identifier */
9883 /* FALLTHRU */
9886 /* offsetof-member-designator "." identifier */
9894 /* Consume the ")" token. */
9900 /* Error. We know the following require will fail, but
9901 that gives the proper error message. */
9906 }
9907 }
9909 success:
9910 /* Make a location of the form:
9911 __builtin_offsetof (struct s, f)
9912 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9913 with caret at the type-id, ranging from the start of the
9914 "_builtin_offsetof" token to the close paren. */
9916 /* The result will be an INTEGER_CST, so we need to explicitly
9917 preserve the location. */
9920 failure:
9926 }
9928 /* Parse a trait expression.
9930 Returns a representation of the expression, the underlying type
9931 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9933 static cp_expr
9935 {
9936 cp_trait_kind kind;
9942 {
10044 }
10046 /* Get location of initial token. */
10049 /* Consume the token. */
10052 matching_parens parens;
10055 {
10058 }
10064 {
10067 {
10070 }
10074 }
10076 {
10078 {
10082 {
10085 }
10089 }
10090 }
10095 /* Construct a location of the form:
10096 __is_trivially_copyable(_Tp)
10097 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10098 with start == caret, finishing at the close-paren. */
10101 /* Complete the trait expression, which may mean either processing
10102 the trait expr now or saving it for template instantiation. */
10104 {
10113 }
10114 }
10116 /* Parse a lambda expression.
10118 lambda-expression:
10119 lambda-introducer lambda-declarator [opt] compound-statement
10121 Returns a representation of the expression. */
10123 static cp_expr
10125 {
10127 tree type;
10135 {
10137 {
10141 }
10143 }
10145 {
10147 {
10150 }
10152 }
10154 /* We may be in the middle of deferred access check. Disable
10155 it now. */
10166 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10169 /* Now that we've started the type, add the capture fields for any
10170 explicit captures. */
10173 {
10174 /* Inside the class, surrounding template-parameter-lists do not apply. */
10175 unsigned int saved_num_template_parameter_lists
10179 bool fully_implicit_function_template_p
10183 bool auto_is_implicit_function_template_parm_p
10194 /* By virtue of defining a local class, a lambda expression has access to
10195 the private variables of enclosing classes. */
10203 {
10208 }
10210 {
10213 }
10215 /* The capture list was built up in reverse order; fix that now. */
10227 parser->fully_implicit_function_template_p
10231 parser->auto_is_implicit_function_template_parm_p
10233 }
10235 /* This field is only used during parsing of the lambda. */
10238 /* This lambda shouldn't have any proxies left at this point. */
10240 /* And now that we're done, push proxies for an enclosing lambda. */
10243 /* Update the lambda expression to a range. */
10251 else
10259 }
10261 /* Parse the beginning of a lambda expression.
10263 lambda-introducer:
10264 [ lambda-capture [opt] ]
10266 LAMBDA_EXPR is the current representation of the lambda expression. */
10268 static void
10270 {
10271 /* Need commas after the first capture. */
10274 /* Eat the leading `['. */
10277 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10285 {
10291 }
10294 {
10296 tree capture_id;
10297 tree capture_init_expr;
10301 enum capture_kind_type
10302 {
10303 BY_COPY,
10304 BY_REFERENCE
10305 };
10309 {
10312 }
10316 else
10319 /* Possibly capture `this'. */
10321 {
10332 explicit_init_p);
10334 }
10336 /* Possibly capture `*this'. */
10339 {
10350 explicit_init_p);
10352 }
10354 /* Remember whether we want to capture as a reference or not. */
10356 {
10359 }
10361 /* Get the identifier. */
10366 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10367 delimiters, but I modified this to stop on unnested ']' as well. It
10368 was already changed to stop on unnested '}', so the
10369 "closing_parenthesis" name is no more misleading with my change. */
10370 {
10376 }
10378 /* Find the initializer for this capture. */
10382 {
10384 /* An explicit initializer exists. */
10387 "lambda capture initializers "
10393 {
10396 }
10397 }
10398 else
10399 {
10402 /* Turn the identifier into an id-expression. */
10403 capture_init_expr
10408 {
10411 }
10414 {
10417 capture_init_expr);
10422 }
10425 {
10428 capture_init_expr))
10432 }
10434 capture_init_expr
10435 = finish_id_expression
10437 capture_init_expr,
10451 {
10454 }
10455 }
10459 {
10464 capture_id);
10468 "capture of %qD redundant with by-reference capture "
10470 }
10473 capture_id,
10474 capture_init_expr,
10476 explicit_init_p);
10478 /* If there is any qualification still in effect, clear it
10479 now; we will be starting fresh with the next capture. */
10483 }
10486 }
10488 /* Parse the (optional) middle of a lambda expression.
10490 lambda-declarator:
10491 < template-parameter-list [opt] >
10492 ( parameter-declaration-clause [opt] )
10493 attribute-specifier [opt]
10494 decl-specifier-seq [opt]
10495 exception-specification [opt]
10496 lambda-return-type-clause [opt]
10498 LAMBDA_EXPR is the current representation of the lambda expression. */
10500 static bool
10502 {
10503 /* 5.1.1.4 of the standard says:
10504 If a lambda-expression does not include a lambda-declarator, it is as if
10505 the lambda-declarator were ().
10506 This means an empty parameter list, no attributes, and no exception
10507 specification. */
10514 cp_decl_specifier_seq lambda_specs;
10517 /* The template-parameter-list is optional, but must begin with
10518 an opening angle if present. */
10520 {
10523 "lambda templates are only available with "
10527 "lambda templates are only available with "
10536 /* We just processed one more parameter list. */
10538 }
10540 /* The parameter-declaration-clause is optional (unless
10541 template-parameter-list was given), but must begin with an
10542 opening parenthesis if present. */
10544 {
10545 matching_parens parens;
10550 /* Parse parameters. */
10553 /* Default arguments shall not be specified in the
10554 parameter-declaration-clause of a lambda-declarator. */
10565 /* In the decl-specifier-seq of the lambda-declarator, each
10566 decl-specifier shall either be mutable or constexpr. */
10570 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10573 {
10578 }
10582 /* Parse optional exception specification. */
10585 /* Parse optional trailing return type. */
10587 {
10590 }
10592 /* The function parameters must be in scope all the way until after the
10593 trailing-return-type in case of decltype. */
10595 }
10599 /* Create the function call operator.
10601 Messing with declarators like this is no uglier than building up the
10602 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10603 other code. */
10604 {
10605 cp_decl_specifier_seq return_type_specs;
10607 tree fco;
10615 {
10619 else
10622 }
10631 VIRT_SPEC_UNSPECIFIED,
10632 REF_QUAL_NONE,
10633 tx_qual,
10634 exception_spec,
10642 declarator,
10643 attributes);
10645 {
10648 /* Give the object parameter a different name. */
10650 }
10652 {
10656 }
10665 }
10666 }
10668 /* Parse the body of a lambda expression, which is simply
10670 compound-statement
10672 but which requires special handling.
10673 LAMBDA_EXPR is the current representation of the lambda expression. */
10675 static void
10677 {
10684 else
10685 /* Still increment function_depth so that we don't GC in the
10686 middle of an expression. */
10691 /* Clear this in case we're in the middle of a default argument. */
10695 {
10699 matching_braces braces;
10702 {
10705 /* Originally C++11 required us to peek for 'return expr'; and
10706 process it specially here to deduce the return type. N3638
10707 removed the need for that. */
10715 }
10718 }
10725 else
10727 }
10729 /* Statements [gram.stmt.stmt] */
10731 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10733 static void
10735 {
10739 /* A concept is never expanded normally. */
10745 }
10747 /* Parse a statement.
10749 statement:
10750 labeled-statement
10751 expression-statement
10752 compound-statement
10753 selection-statement
10754 iteration-statement
10755 jump-statement
10756 declaration-statement
10757 try-block
10759 C++11:
10761 statement:
10762 labeled-statement
10763 attribute-specifier-seq (opt) expression-statement
10764 attribute-specifier-seq (opt) compound-statement
10765 attribute-specifier-seq (opt) selection-statement
10766 attribute-specifier-seq (opt) iteration-statement
10767 attribute-specifier-seq (opt) jump-statement
10768 declaration-statement
10769 attribute-specifier-seq (opt) try-block
10771 init-statement:
10772 expression-statement
10773 simple-declaration
10775 TM Extension:
10777 statement:
10778 atomic-statement
10780 IN_COMPOUND is true when the statement is nested inside a
10781 cp_parser_compound_statement; this matters for certain pragmas.
10783 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10784 is a (possibly labeled) if statement which is not enclosed in braces
10785 and has an else clause. This is used to implement -Wparentheses.
10787 CHAIN is a vector of if-else-if conditions. */
10789 static void
10793 {
10798 restart:
10801 /* There is no statement yet. */
10807 /* In obj-c++, seeing '[[' might be the either the beginning of
10808 c++11 attributes, or a nested objc-message-expression. So
10809 let's parse the c++11 attributes tentatively. */
10813 {
10816 }
10818 /* Peek at the next token. */
10820 /* Remember the location of the first token in the statement. */
10823 /* If this is a keyword, then that will often determine what kind of
10824 statement we have. */
10826 {
10830 {
10833 /* Looks like a labeled-statement with a case label.
10834 Parse the label, and then use tail recursion to parse
10835 the statement. */
10858 /* Objective-C++ exception-handling constructs. */
10872 /* This must be a namespace alias definition. */
10888 /* It might be a keyword like `int' that can start a
10889 declaration-statement. */
10891 }
10892 }
10894 {
10895 /* If the next token is a `:', then we are looking at a
10896 labeled-statement. */
10899 {
10900 /* Looks like a labeled-statement with an ordinary label.
10901 Parse the label, and then use tail recursion to parse
10902 the statement. */
10907 }
10908 }
10909 /* Anything that starts with a `{' must be a compound-statement. */
10912 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10913 a statement all its own. */
10915 {
10916 /* Only certain OpenMP pragmas are attached to statements, and thus
10917 are considered statements themselves. All others are not. In
10918 the context of a compound, accept the pragma as a "statement" and
10919 return so that we can check for a close brace. Otherwise we
10920 require a real statement and must go back and read one. */
10926 }
10928 {
10931 }
10933 /* Everything else must be a declaration-statement or an
10934 expression-statement. Try for the declaration-statement
10935 first, unless we are looking at a `;', in which case we know that
10936 we have an expression-statement. */
10938 {
10940 {
10942 {
10943 /* Attributes should be parsed as part of the the
10944 declaration, so let's un-parse them. */
10947 }
10950 /* Try to parse the declaration-statement. */
10952 /* If that worked, we're done. */
10955 }
10956 /* All preceding labels have been parsed at this point. */
10960 /* Look for an expression-statement instead. */
10963 /* Handle [[fallthrough]];. */
10965 {
10966 /* The next token after the fallthrough attribute is ';'. */
10968 {
10969 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10971 IFN_FALLTHROUGH,
10974 }
10975 else
10979 }
10980 }
10982 /* Set the line number for the statement. */
10986 /* Allow "[[fallthrough]];", but warn otherwise. */
10989 OPT_Wattributes,
10991 }
10993 /* Append ATTR to attribute list ATTRS. */
10995 static tree
10997 {
11003 }
11005 /* Parse the label for a labeled-statement, i.e.
11007 identifier :
11008 case constant-expression :
11009 default :
11011 GNU Extension:
11012 case constant-expression ... constant-expression : statement
11014 When a label is parsed without errors, the label is added to the
11015 parse tree by the finish_* functions, so this function doesn't
11016 have to return the label. */
11018 static void
11020 {
11025 /* The next token should be an identifier. */
11029 {
11032 }
11034 /* Remember whether this case or a user-defined label is allowed to fall
11035 through to. */
11040 {
11042 {
11046 /* Consume the `case' token. */
11048 /* Parse the constant-expression. */
11055 {
11056 /* Consume the `...' token. */
11062 /* We don't need to emit warnings here, as the common code
11063 will do this for us. */
11064 }
11065 else
11069 {
11073 }
11074 else
11077 expr);
11078 }
11082 /* Consume the `default' token. */
11086 {
11090 }
11091 else
11096 /* Anything else must be an ordinary label. */
11101 }
11103 /* Require the `:' token. */
11106 /* An ordinary label may optionally be followed by attributes.
11107 However, this is only permitted if the attributes are then
11108 followed by a semicolon. This is because, for backward
11109 compatibility, when parsing
11110 lab: __attribute__ ((unused)) int i;
11111 we want the attribute to attach to "i", not "lab". */
11114 {
11115 tree attrs;
11122 ;
11123 else
11125 }
11131 }
11133 /* Parse an expression-statement.
11135 expression-statement:
11136 expression [opt] ;
11138 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11139 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11140 indicates whether this expression-statement is part of an
11141 expression statement. */
11143 static tree
11145 {
11150 /* There might be attribute fallthrough. */
11153 /* If the next token is a ';', then there is no expression
11154 statement. */
11156 {
11160 {
11163 }
11164 }
11166 /* Handle [[fallthrough]];. */
11168 {
11169 /* The next token after the fallthrough attribute is ';'. */
11171 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11174 else
11178 }
11180 /* Allow "[[fallthrough]];", but warn otherwise. */
11185 /* Give a helpful message for "A<T>::type t;" and the like. */
11188 {
11195 {
11196 /* A::A a; */
11201 }
11202 }
11204 /* Consume the final `;'. */
11209 /* This is the final expression statement of a statement
11210 expression. */
11216 }
11218 /* Parse a compound-statement.
11220 compound-statement:
11221 { statement-seq [opt] }
11223 GNU extension:
11225 compound-statement:
11226 { label-declaration-seq [opt] statement-seq [opt] }
11228 label-declaration-seq:
11229 label-declaration
11230 label-declaration-seq label-declaration
11232 Returns a tree representing the statement. */
11234 static tree
11237 {
11238 tree compound_stmt;
11239 matching_braces braces;
11241 /* Consume the `{'. */
11248 /* Begin the compound-statement. */
11250 /* If the next keyword is `__label__' we have a label declaration. */
11253 /* Parse an (optional) statement-seq. */
11255 /* Finish the compound-statement. */
11257 /* Consume the `}'. */
11261 }
11263 /* Parse an (optional) statement-seq.
11265 statement-seq:
11266 statement
11267 statement-seq [opt] statement */
11269 static void
11271 {
11272 /* Scan statements until there aren't any more. */
11274 {
11277 /* If we are looking at a `}', then we have run out of
11278 statements; the same is true if we have reached the end
11279 of file, or have stumbled upon a stray '@end'. */
11286 /* If we are in a compound statement and find 'else' then
11287 something went wrong. */
11289 {
11292 else
11293 {
11296 }
11297 }
11299 /* Parse the statement. */
11301 }
11302 }
11304 /* Return true if this is the C++20 version of range-based-for with
11305 init-statement. */
11307 static bool
11309 {
11312 /* Save tokens so that we can put them back. */
11315 /* There has to be an unnested ; followed by an unnested :. */
11318 CPP_SEMICOLON,
11322 /* We found the semicolon, eat it now. */
11325 /* Now look for ':' that is not nested in () or {}. */
11328 CPP_COLON,
11331 out:
11332 /* Roll back the tokens we skipped. */
11336 }
11338 /* Return true if we're looking at (init; cond), false otherwise. */
11340 static bool
11342 {
11343 /* Save tokens so that we can put them back. */
11346 /* Look for ';' that is not nested in () or {}. */
11349 CPP_SEMICOLON,
11352 /* Roll back the tokens we skipped. */
11356 }
11358 /* Parse a selection-statement.
11360 selection-statement:
11361 if ( init-statement [opt] condition ) statement
11362 if ( init-statement [opt] condition ) statement else statement
11363 switch ( init-statement [opt] condition ) statement
11365 Returns the new IF_STMT or SWITCH_STMT.
11367 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11368 is a (possibly labeled) if statement which is not enclosed in
11369 braces and has an else clause. This is used to implement
11370 -Wparentheses.
11372 CHAIN is a vector of if-else-if conditions. This is used to implement
11373 -Wduplicated-cond. */
11375 static tree
11378 {
11381 token_indent_info guard_tinfo;
11386 /* Peek at the next token. */
11390 /* See what kind of keyword it is. */
11393 {
11396 {
11397 tree statement;
11398 tree condition;
11403 RID_CONSTEXPR))
11404 {
11410 }
11412 /* Look for the `('. */
11413 matching_parens parens;
11415 {
11418 }
11420 /* Begin the selection-statement. */
11422 {
11425 }
11426 else
11429 /* Parse the optional init-statement. */
11431 {
11432 tree decl;
11435 "init-statement in selection statements only available "
11438 }
11440 /* Parse the condition. */
11442 /* Look for the `)'. */
11448 {
11452 /* Add the condition. */
11459 /* Parse the then-clause. */
11463 /* Outside a template, the non-selected branch of a constexpr
11464 if is a 'discarded statement', i.e. unevaluated. */
11469 {
11472 }
11475 guard_tinfo);
11482 {
11486 }
11488 /* If the next token is `else', parse the else-clause. */
11490 RID_ELSE))
11491 {
11495 {
11498 }
11500 guard_tinfo
11502 /* Consume the `else' keyword. */
11505 {
11507 RID_IF)
11509 {
11510 /* We've got "if (COND) else if (COND2)". Start
11511 the condition chain and add COND as the first
11512 element. */
11516 {
11517 /* Wrap it in a NOP_EXPR so that we can set the
11518 location of the condition. */
11520 condition);
11523 }
11524 }
11526 RID_IF))
11527 {
11528 /* This is if-else without subsequent if. Zap the
11529 condition chain; we would have already warned at
11530 this point. */
11533 }
11534 }
11536 /* Parse the else-clause. */
11542 /* If we are currently parsing a then-clause, then
11543 IF_P will not be NULL. We set it to true to
11544 indicate that this if statement has an else clause.
11545 This may trigger the Wparentheses warning below
11546 when we get back up to the parent if statement. */
11551 {
11555 }
11556 }
11557 else
11558 {
11559 /* This if statement does not have an else clause. If
11560 NESTED_IF is true, then the then-clause has an if
11561 statement which does have an else clause. We warn
11562 about the potential ambiguity. */
11565 "suggest explicit braces to avoid ambiguous"
11568 {
11569 /* We don't need the condition chain anymore. */
11572 }
11573 }
11575 /* Now we're all done with the if-statement. */
11577 }
11578 else
11579 {
11583 /* Add the condition. */
11586 /* Parse the body of the switch-statement. */
11592 guard_tinfo);
11596 /* Now we're all done with the switch-statement. */
11598 }
11601 }
11607 }
11608 }
11610 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11611 If we have seen at least one decl-specifier, and the next token
11612 is not a parenthesis, then we must be looking at a declaration.
11613 (After "int (" we might be looking at a functional cast.) */
11615 static void
11618 {
11624 }
11626 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11627 The declarator shall not specify a function or an array. Returns
11628 TRUE if the declarator is valid, FALSE otherwise. */
11630 static bool
11633 location_t loc)
11634 {
11638 {
11643 else
11651 }
11652 else
11654 }
11656 /* Parse a condition.
11658 condition:
11659 expression
11660 type-specifier-seq declarator = initializer-clause
11661 type-specifier-seq declarator braced-init-list
11663 GNU Extension:
11665 condition:
11666 type-specifier-seq declarator asm-specification [opt]
11667 attributes [opt] = assignment-expression
11669 Returns the expression that should be tested. */
11671 static tree
11673 {
11674 cp_decl_specifier_seq type_specifiers;
11678 /* Try the declaration first. */
11680 /* New types are not allowed in the type-specifier-seq for a
11681 condition. */
11683 parser->type_definition_forbidden_message
11685 /* Parse the type-specifier-seq. */
11687 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11690 /* Restore the saved message. */
11696 /* If all is well, we might be looking at a declaration. */
11698 {
11699 tree decl;
11700 tree asm_specification;
11701 tree attributes;
11706 /* Parse the declarator. */
11712 /* Parse the attributes. */
11714 /* Parse the asm-specification. */
11716 /* If the next token is not an `=' or '{', then we might still be
11717 looking at an expression. For example:
11719 if (A(a).x)
11721 looks like a decl-specifier-seq and a declarator -- but then
11722 there is no `=', so this is an expression. */
11727 /* If we did see an `=' or '{', then we are looking at a declaration
11728 for sure. */
11730 {
11731 tree pushed_scope;
11738 /* Create the declaration. */
11744 /* Parse the initializer. */
11746 {
11750 }
11752 {
11753 /* Consume the `='. */
11757 }
11758 else
11759 {
11762 }
11766 /* Process the initializer. */
11769 asm_specification,
11770 flags);
11776 }
11777 }
11778 /* If we didn't even get past the declarator successfully, we are
11779 definitely not looking at a declaration. */
11780 else
11783 /* Otherwise, we are looking at an expression. */
11785 }
11787 /* Parses a for-statement or range-for-statement until the closing ')',
11788 not included. */
11790 static tree
11792 {
11796 /* Begin the for-statement. */
11799 /* Parse the initialization. */
11804 else
11806 }
11808 static tree
11811 {
11812 /* Normal for loop */
11815 tree stmt;
11818 /* The init-statement has already been parsed in
11819 cp_parser_init_statement, so no work is needed here. */
11822 /* If there's a condition, process it. */
11826 {
11830 }
11832 {
11836 }
11838 /* Look for the `;'. */
11841 /* If there's an expression, process it. */
11847 }
11849 /* Tries to parse a range-based for-statement:
11851 range-based-for:
11852 decl-specifier-seq declarator : expression
11854 The decl-specifier-seq declarator and the `:' are already parsed by
11855 cp_parser_init_statement. If processing_template_decl it returns a
11856 newly created RANGE_FOR_STMT; if not, it is converted to a
11857 regular FOR_STMT. */
11859 static tree
11862 {
11869 /* Get the range declaration momentarily out of the way so that
11870 the range expression doesn't clash with it. */
11872 {
11874 {
11876 /* For decomposition declaration get all of the corresponding
11877 declarations out of the way. */
11881 {
11887 {
11893 }
11894 }
11895 }
11897 {
11902 }
11903 }
11906 {
11909 }
11910 else
11913 /* Put the range declaration(s) back into scope. */
11915 {
11919 }
11921 /* If in template, STMT is converted to a normal for-statement
11922 at instantiation. If not, it is done just ahead. */
11924 {
11934 /* do_auto_deduction doesn't mess with template init-lists. */
11937 }
11938 else
11939 {
11943 unroll);
11944 }
11946 }
11948 /* Subroutine of cp_convert_range_for: given the initializer expression,
11949 builds up the range temporary. */
11951 static tree
11953 {
11956 /* Find out the type deduced by the declaration
11957 `auto &&__range = range_expr'. */
11962 /* Create the __range variable. */
11964 range_type);
11969 }
11971 /* Used by cp_parser_range_for in template context: we aren't going to
11972 do a full conversion yet, but we still need to resolve auto in the
11973 type of the for-range-declaration if present. This is basically
11974 a shortcut version of cp_convert_range_for. */
11976 static void
11978 {
11981 {
11984 iter_type = (cp_parser_perform_range_for_lookup
11987 {
11989 iter_type);
11991 RO_UNARY_STAR,
11992 tf_warning_or_error);
11995 }
11996 }
11997 }
11999 /* Converts a range-based for-statement into a normal
12000 for-statement, as per the definition.
12002 for (RANGE_DECL : RANGE_EXPR)
12003 BLOCK
12005 should be equivalent to:
12007 {
12008 auto &&__range = RANGE_EXPR;
12009 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12010 __begin != __end;
12011 ++__begin)
12012 {
12013 RANGE_DECL = *__begin;
12014 BLOCK
12015 }
12016 }
12018 If RANGE_EXPR is an array:
12019 BEGIN_EXPR = __range
12020 END_EXPR = __range + ARRAY_SIZE(__range)
12021 Else if RANGE_EXPR has a member 'begin' or 'end':
12022 BEGIN_EXPR = __range.begin()
12023 END_EXPR = __range.end()
12024 Else:
12025 BEGIN_EXPR = begin(__range)
12026 END_EXPR = end(__range);
12028 If __range has a member 'begin' but not 'end', or vice versa, we must
12029 still use the second alternative (it will surely fail, however).
12030 When calling begin()/end() in the third alternative we must use
12031 argument dependent lookup, but always considering 'std' as an associated
12032 namespace. */
12034 tree
12038 {
12046 /* If an error happened previously do nothing or else a lot of
12047 unhelpful errors would be issued. */
12049 else
12050 {
12051 tree range_temp;
12055 /* Can't bind a reference to an array of runtime bound. */
12057 else
12058 {
12063 LOOKUP_ONLYCONVERTING);
12065 }
12068 }
12070 /* The new for initialization statement. */
12072 iter_type);
12078 LOOKUP_ONLYCONVERTING);
12088 LOOKUP_ONLYCONVERTING);
12092 /* The new for condition. */
12099 /* The new increment expression. */
12102 tf_warning_or_error);
12108 /* The declaration is initialized with *__begin inside the loop body. */
12111 tf_warning_or_error),
12113 LOOKUP_ONLYCONVERTING);
12118 }
12120 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12121 We need to solve both at the same time because the method used
12122 depends on the existence of members begin or end.
12123 Returns the type deduced for the iterator expression. */
12125 static tree
12127 {
12129 {
12132 }
12135 {
12140 }
12142 {
12143 /* If RANGE is an array, we will use pointer arithmetic. */
12146 range,
12150 }
12151 else
12152 {
12153 /* If it is not an array, we must do a bit of magic. */
12163 tf_warning_or_error);
12166 tf_warning_or_error);
12169 {
12170 /* Use the member functions. */
12173 }
12174 else
12175 {
12176 /* Use global functions with ADL. */
12183 tf_warning_or_error);
12185 tf_warning_or_error);
12187 tf_warning_or_error);
12189 tf_warning_or_error);
12192 }
12194 /* Last common checks. */
12196 {
12197 /* If one of the expressions is an error do no more checks. */
12200 }
12203 /* Can happen, when, eg, in a template context, Koenig lookup
12204 can't resolve begin/end (c++/58503). */
12206 else
12207 {
12209 /* The unqualified type of the __begin and __end temporaries should
12210 be the same, as required by the multiple auto declaration. */
12212 {
12219 /* P0184R0 allows __begin and __end to have different types,
12220 but make sure they are comparable so we can give a better
12222 else
12226 }
12228 }
12229 }
12230 }
12232 /* Helper function for cp_parser_perform_range_for_lookup.
12233 Builds a tree for RANGE.IDENTIFIER(). */
12235 static tree
12237 {
12250 tf_warning_or_error);
12253 }
12255 /* Parse an iteration-statement.
12257 iteration-statement:
12258 while ( condition ) statement
12259 do statement while ( expression ) ;
12260 for ( init-statement condition [opt] ; expression [opt] )
12261 statement
12263 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12265 static tree
12268 {
12271 tree statement;
12273 token_indent_info guard_tinfo;
12275 /* Peek at the next token. */
12282 /* Remember whether or not we are already within an iteration
12283 statement. */
12286 /* See what kind of keyword it is. */
12289 {
12291 {
12292 tree condition;
12294 /* Begin the while-statement. */
12296 /* Look for the `('. */
12297 matching_parens parens;
12299 /* Parse the condition. */
12302 /* Look for the `)'. */
12304 /* Parse the dependent statement. */
12310 /* We're done with the while-statement. */
12312 }
12316 {
12317 tree expression;
12319 /* Begin the do-statement. */
12321 /* Parse the body of the do-statement. */
12328 /* Look for the `while' keyword. */
12330 /* Look for the `('. */
12331 matching_parens parens;
12333 /* Parse the expression. */
12335 /* We're done with the do-statement. */
12337 /* Look for the `)'. */
12339 /* Look for the `;'. */
12341 }
12345 {
12346 /* Look for the `('. */
12347 matching_parens parens;
12352 /* Look for the `)'. */
12355 /* Parse the body of the for-statement. */
12362 /* We're done with the for-statement. */
12364 }
12371 }
12374 }
12376 /* Parse a init-statement or the declarator of a range-based-for.
12377 Returns true if a range-based-for declaration is seen.
12379 init-statement:
12380 expression-statement
12381 simple-declaration */
12383 static bool
12385 {
12386 /* If the next token is a `;', then we have an empty
12387 expression-statement. Grammatically, this is also a
12388 simple-declaration, but an invalid one, because it does not
12389 declare anything. Therefore, if we did not handle this case
12390 specially, we would issue an error message about an invalid
12391 declaration. */
12393 {
12397 /* Try to parse the init-statement. */
12399 {
12400 tree dummy;
12402 /* Parse the declaration. */
12408 /* That didn't work, try to parse it as an expression-statement. */
12412 {
12414 "range-based %<for%> loops with initializer only "
12417 }
12418 }
12420 /* A colon is used in range-based for. */
12423 /* We're going to speculatively look for a declaration, falling back
12424 to an expression, if necessary. */
12426 /* Parse the declaration. */
12429 decl);
12432 {
12433 /* It is a range-for, consume the ':'. */
12438 "range-based %<for%> loops only available with "
12440 }
12441 else
12442 /* The ';' is not consumed yet because we told
12443 cp_parser_simple_declaration not to. */
12448 /* If the tentative parse failed, then we shall need to look for an
12449 expression-statement. */
12450 }
12451 /* If we are here, it is an expression-statement. */
12454 }
12456 /* Parse a jump-statement.
12458 jump-statement:
12459 break ;
12460 continue ;
12461 return expression [opt] ;
12462 return braced-init-list ;
12463 goto identifier ;
12465 GNU extension:
12467 jump-statement:
12468 goto * expression ;
12470 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12472 static tree
12474 {
12480 /* Peek at the next token. */
12485 /* See what kind of keyword it is. */
12488 {
12492 {
12509 }
12515 {
12519 /* Fall through. */
12529 }
12534 {
12535 tree expr;
12539 {
12543 }
12546 else
12547 /* If the next token is a `;', then there is no
12548 expression. */
12550 /* Build the return-statement. */
12553 else
12555 /* Look for the final `;'. */
12557 }
12563 {
12566 }
12568 /* Create the goto-statement. */
12570 {
12571 /* Issue a warning about this use of a GNU extension. */
12573 /* Consume the '*' token. */
12575 /* Parse the dependent expression. */
12577 }
12578 else
12580 /* Look for the final `;'. */
12587 }
12590 }
12592 /* Parse a declaration-statement.
12594 declaration-statement:
12595 block-declaration */
12597 static void
12599 {
12602 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12605 /* Parse the block-declaration. */
12608 /* Free any declarators allocated. */
12610 }
12612 /* Some dependent statements (like `if (cond) statement'), are
12613 implicitly in their own scope. In other words, if the statement is
12614 a single statement (as opposed to a compound-statement), it is
12615 none-the-less treated as if it were enclosed in braces. Any
12616 declarations appearing in the dependent statement are out of scope
12617 after control passes that point. This function parses a statement,
12618 but ensures that is in its own scope, even if it is not a
12619 compound-statement.
12621 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12622 is a (possibly labeled) if statement which is not enclosed in
12623 braces and has an else clause. This is used to implement
12624 -Wparentheses.
12626 CHAIN is a vector of if-else-if conditions. This is used to implement
12627 -Wduplicated-cond.
12629 Returns the new statement. */
12631 static tree
12635 {
12636 tree statement;
12639 token_indent_info body_tinfo
12645 /* Mark if () ; with a special NOP_EXPR. */
12647 {
12658 }
12659 /* if a compound is opened, we simply parse the statement directly. */
12662 /* If the token is not a `{', then we must take special action. */
12663 else
12664 {
12665 /* Create a compound-statement. */
12667 /* Parse the dependent-statement. */
12670 /* Finish the dummy compound-statement. */
12672 }
12674 token_indent_info next_tinfo
12683 /* Return the statement. */
12685 }
12687 /* For some dependent statements (like `while (cond) statement'), we
12688 have already created a scope. Therefore, even if the dependent
12689 statement is a compound-statement, we do not want to create another
12690 scope. */
12692 static void
12695 {
12696 /* If the token is a `{', then we must take special action. */
12698 {
12699 token_indent_info body_tinfo
12705 token_indent_info next_tinfo
12714 }
12715 else
12716 {
12717 /* Avoid calling cp_parser_compound_statement, so that we
12718 don't create a new scope. Do everything else by hand. */
12719 matching_braces braces;
12721 /* If the next keyword is `__label__' we have a label declaration. */
12724 /* Parse an (optional) statement-seq. */
12727 }
12728 }
12730 /* Declarations [gram.dcl.dcl] */
12732 /* Parse an optional declaration-sequence.
12734 declaration-seq:
12735 declaration
12736 declaration-seq declaration */
12738 static void
12740 {
12742 {
12753 {
12754 /* A declaration consisting of a single semicolon is
12755 invalid. Allow it unless we're being pedantic. */
12760 }
12762 /* If we're entering or exiting a region that's implicitly
12763 extern "C", modify the lang context appropriately. */
12765 {
12768 }
12770 {
12773 }
12776 {
12777 /* A top-level declaration can consist solely of a #pragma.
12778 A nested declaration cannot, so this is done here and not
12779 in cp_parser_declaration. (A #pragma at block scope is
12780 handled in cp_parser_statement.) */
12783 }
12785 /* Parse the declaration itself. */
12787 }
12788 }
12790 /* Parse a declaration.
12792 declaration:
12793 block-declaration
12794 function-definition
12795 template-declaration
12796 explicit-instantiation
12797 explicit-specialization
12798 linkage-specification
12799 namespace-definition
12801 C++17:
12802 deduction-guide
12804 GNU extension:
12806 declaration:
12807 __extension__ declaration */
12809 static void
12811 {
12812 cp_token token1;
12813 cp_token token2;
12818 /* Check for the `__extension__' keyword. */
12820 {
12821 /* Parse the qualified declaration. */
12823 /* Restore the PEDANTIC flag. */
12827 }
12829 /* Try to figure out what kind of declaration is present. */
12834 else
12835 {
12838 }
12840 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12843 /* If the next token is `extern' and the following token is a string
12844 literal, then we have a linkage specification. */
12848 /* If the next token is `template', then we have either a template
12849 declaration, an explicit instantiation, or an explicit
12850 specialization. */
12852 {
12853 /* `template <>' indicates a template specialization. */
12857 /* `template <' indicates a template declaration. */
12860 /* Anything else must be an explicit instantiation. */
12861 else
12863 }
12864 /* If the next token is `export', then we have a template
12865 declaration. */
12868 /* If the next token is `extern', 'static' or 'inline' and the one
12869 after that is `template', we have a GNU extended explicit
12870 instantiation directive. */
12877 /* If the next token is `namespace', check for a named or unnamed
12878 namespace definition. */
12887 /* An unnamed namespace definition. */
12891 /* An inline (associated) namespace definition. */
12895 /* Objective-C++ declaration/definition. */
12902 /* At this point we may have a template declared by a concept
12903 introduction. */
12908 else
12909 /* Try to parse a block-declaration, or a function-definition. */
12912 /* Free any declarators allocated. */
12914 }
12916 /* Parse a block-declaration.
12918 block-declaration:
12919 simple-declaration
12920 asm-definition
12921 namespace-alias-definition
12922 using-declaration
12923 using-directive
12925 GNU Extension:
12927 block-declaration:
12928 __extension__ block-declaration
12930 C++0x Extension:
12932 block-declaration:
12933 static_assert-declaration
12935 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12936 part of a declaration-statement. */
12938 static void
12941 {
12945 /* Check for the `__extension__' keyword. */
12947 {
12948 /* Parse the qualified declaration. */
12950 /* Restore the PEDANTIC flag. */
12954 }
12956 /* Peek at the next token to figure out which kind of declaration is
12957 present. */
12960 /* If the next keyword is `asm', we have an asm-definition. */
12962 {
12966 }
12967 /* If the next keyword is `namespace', we have a
12968 namespace-alias-definition. */
12971 /* If the next keyword is `using', we have a
12972 using-declaration, a using-directive, or an alias-declaration. */
12974 {
12979 /* If the token after `using' is `namespace', then we have a
12980 using-directive. */
12984 /* If the second token after 'using' is '=', then we have an
12985 alias-declaration. */
12991 /* Otherwise, it's a using-declaration. */
12992 else
12995 }
12996 /* If the next keyword is `__label__' we have a misplaced label
12997 declaration. */
12999 {
13003 /* If the next token is now a `;', consume it. */
13006 }
13007 /* If the next token is `static_assert' we have a static assertion. */
13010 /* Anything else must be a simple-declaration. */
13011 else
13014 }
13016 /* Parse a simple-declaration.
13018 simple-declaration:
13019 decl-specifier-seq [opt] init-declarator-list [opt] ;
13020 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13021 brace-or-equal-initializer ;
13023 init-declarator-list:
13024 init-declarator
13025 init-declarator-list , init-declarator
13027 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13028 function-definition as a simple-declaration.
13030 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13031 parsed declaration if it is an uninitialized single declarator not followed
13032 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13033 if present, will not be consumed. */
13035 static void
13039 {
13040 cp_decl_specifier_seq decl_specifiers;
13049 /* Defer access checks until we know what is being declared; the
13050 checks for names appearing in the decl-specifier-seq should be
13051 done as if we were in the scope of the thing being declared. */
13054 /* Parse the decl-specifier-seq. We have to keep track of whether
13055 or not the decl-specifier-seq declares a named class or
13056 enumeration type, since that is the only case in which the
13057 init-declarator-list is allowed to be empty.
13059 [dcl.dcl]
13061 In a simple-declaration, the optional init-declarator-list can be
13062 omitted only when declaring a class or enumeration, that is when
13063 the decl-specifier-seq contains either a class-specifier, an
13064 elaborated-type-specifier, or an enum-specifier. */
13066 CP_PARSER_FLAGS_OPTIONAL,
13069 /* We no longer need to defer access checks. */
13072 /* In a block scope, a valid declaration must always have a
13073 decl-specifier-seq. By not trying to parse declarators, we can
13074 resolve the declaration/expression ambiguity more quickly. */
13077 {
13080 }
13082 /* If the next two tokens are both identifiers, the code is
13083 erroneous. The usual cause of this situation is code like:
13085 T t;
13087 where "T" should name a type -- but does not. */
13090 {
13091 /* If parsing tentatively, we should commit; we really are
13092 looking at a declaration. */
13094 /* Give up. */
13096 }
13101 /* Look for C++17 decomposition declaration. */
13109 {
13110 tree decl
13112 maybe_range_for_decl,
13115 /* The next token should be either a `,' or a `;'. */
13117 /* If it's a `;', we are done. */
13121 {
13125 }
13126 /* Anything else is an error. */
13127 else
13128 {
13129 /* If we have already issued an error message we don't need
13130 to issue another one. */
13135 /* Skip tokens until we reach the end of the statement. */
13137 /* If the next token is now a `;', consume it. */
13141 }
13142 }
13143 else
13146 tree last_type;
13148 /* NULL_TREE if both variable and function declaration are allowed,
13149 error_mark_node if function declaration are not allowed and
13150 a FUNCTION_DECL that should be diagnosed if it is followed by
13151 variable declarations. */
13152 tree auto_function_declaration;
13155 auto_specifier_p
13159 /* Keep going until we hit the `;' at the end of the simple
13160 declaration. */
13163 CPP_SEMICOLON))
13164 {
13167 tree decl;
13171 {
13172 /* If we are processing next declarator, comma is expected */
13177 {
13181 }
13182 }
13183 else
13186 /* Parse the init-declarator. */
13189 function_definition_allowed_p,
13191 declares_class_or_enum,
13193 maybe_range_for_decl,
13196 /* If an error occurred while parsing tentatively, exit quickly.
13197 (That usually happens when in the body of a function; each
13198 statement is treated as a declaration-statement until proven
13199 otherwise.) */
13204 {
13205 /* If the init-declarator-list contains more than one
13206 init-declarator, they shall all form declarations of
13207 variables. */
13209 auto_function_declaration
13213 {
13215 "non-variable %qD in declaration with more than one "
13220 }
13221 }
13225 {
13229 {
13230 /* If the list of declarators contains more than one declarator,
13231 the type of each declared variable is determined as described
13232 above. If the type deduced for the template parameter U is not
13233 the same in each deduction, the program is ill-formed. */
13238 }
13239 else
13241 }
13243 /* Handle function definitions specially. */
13245 {
13246 /* If the next token is a `,', then we are probably
13247 processing something like:
13249 void f() {}, *p;
13251 which is erroneous. */
13253 {
13256 "mixing"
13258 }
13259 /* Otherwise, we're done with the list of declarators. */
13260 else
13261 {
13264 }
13265 }
13268 /* The next token should be either a `,' or a `;'. */
13270 /* If it's a `,', there are more declarators to come. */
13273 /* If it's a `;', we are done. */
13277 {
13282 }
13283 /* Anything else is an error. */
13284 else
13285 {
13286 /* If we have already issued an error message we don't need
13287 to issue another one. */
13292 /* Skip tokens until we reach the end of the statement. */
13294 /* If the next token is now a `;', consume it. */
13298 }
13299 /* After the first time around, a function-definition is not
13300 allowed -- even if it was OK at first. For example:
13302 int i, f() {}
13304 is not valid. */
13306 }
13308 /* Issue an error message if no declarators are present, and the
13309 decl-specifier-seq does not itself declare a class or
13310 enumeration: [dcl.dcl]/3. */
13312 {
13314 {
13318 /* Ensure an error is issued anyway when finish_decltype_type,
13319 called via cp_parser_decl_specifier_seq, returns a class or
13320 an enumeration (c++/51786). */
13323 }
13324 /* Perform any deferred access checks. */
13326 }
13328 /* Consume the `;'. */
13329 finish:
13333 {
13339 }
13341 done:
13343 }
13345 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13346 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13347 initializer ; */
13349 static tree
13354 {
13359 /* Parse the identifier-list. */
13363 {
13371 }
13375 {
13381 else
13382 {
13385 }
13386 }
13392 tree pushed_scope;
13399 NULL_TREE);
13406 cp_expr e;
13407 cp_decl_specifier_seq decl_specs;
13412 {
13415 else
13418 tree elt_pushed_scope;
13424 {
13425 /* Ensure we've diagnosed redeclaration if we aren't creating
13426 a new VAR_DECL. */
13429 }
13430 else
13434 }
13437 {
13440 }
13444 {
13452 || (is_direct_init
13455 {
13459 }
13462 {
13467 }
13468 }
13470 {
13472 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13473 the underlying DECL. */
13475 }
13481 {
13484 }
13487 }
13489 /* Parse a decl-specifier-seq.
13491 decl-specifier-seq:
13492 decl-specifier-seq [opt] decl-specifier
13493 decl-specifier attribute-specifier-seq [opt] (C++11)
13495 decl-specifier:
13496 storage-class-specifier
13497 type-specifier
13498 function-specifier
13499 friend
13500 typedef
13502 GNU Extension:
13504 decl-specifier:
13505 attributes
13507 Concepts Extension:
13509 decl-specifier:
13510 concept
13512 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13514 The parser flags FLAGS is used to control type-specifier parsing.
13516 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13517 flags:
13519 1: one of the decl-specifiers is an elaborated-type-specifier
13520 (i.e., a type declaration)
13521 2: one of the decl-specifiers is an enum-specifier or a
13522 class-specifier (i.e., a type definition)
13524 */
13526 static void
13528 cp_parser_flags flags,
13531 {
13535 cp_decl_spec ds;
13537 /* Clear DECL_SPECS. */
13540 /* Assume no class or enumeration type is declared. */
13543 /* Keep reading specifiers until there are no more to read. */
13545 {
13550 /* Peek at the next token. */
13553 /* Save the first token of the decl spec list for error
13554 reporting. */
13557 /* Handle attributes. */
13559 {
13560 /* Parse the attributes. */
13563 /* In a sequence of declaration specifiers, c++11 attributes
13564 appertain to the type that precede them. In that case
13565 [dcl.spec]/1 says:
13567 The attribute-specifier-seq affects the type only for
13568 the declaration it appears in, not other declarations
13569 involving the same type.
13571 But for now let's force the user to position the
13572 attribute either at the beginning of the declaration or
13573 after the declarator-id, which would clearly mean that it
13574 applies to the declarator. */
13576 {
13578 /* The c++11 attribute is at the beginning of the
13579 declaration. It appertains to the entity being
13581 else
13582 {
13584 {
13585 /* This is an attribute following a
13586 class-specifier. */
13591 }
13592 else
13593 {
13594 decl_specs->std_attributes
13598 }
13600 }
13601 }
13603 decl_specs->attributes
13608 }
13609 /* Assume we will find a decl-specifier keyword. */
13611 /* If the next token is an appropriate keyword, we can simply
13612 add it to the list. */
13614 {
13615 /* decl-specifier:
13616 friend
13617 constexpr */
13620 {
13625 }
13626 else
13627 {
13629 /* Consume the token. */
13631 }
13644 /* function-specifier:
13645 inline
13646 virtual
13647 explicit */
13654 /* decl-specifier:
13655 typedef */
13658 /* Consume the token. */
13660 /* A constructor declarator cannot appear in a typedef. */
13662 /* The "typedef" keyword can only occur in a declaration; we
13663 may as well commit at this point. */
13670 /* storage-class-specifier:
13671 auto
13672 register
13673 static
13674 extern
13675 mutable
13677 GNU Extension:
13678 thread */
13681 {
13682 /* Consume the token. */
13685 /* Complain about `auto' as a storage specifier, if
13686 we're complaining about C++0x compatibility. */
13690 "%<auto%> changes meaning in C++11; "
13693 /* Set the storage class anyway. */
13695 token);
13696 }
13697 else
13698 /* C++0x auto type-specifier. */
13706 /* Consume the token. */
13709 token);
13712 /* Consume the token. */
13718 /* We did not yet find a decl-specifier yet. */
13721 }
13738 /* Constructors are a special case. The `S' in `S()' is not a
13739 decl-specifier; it is the beginning of the declarator. */
13740 constructor_p
13741 = (!found_decl_spec
13742 && constructor_possible_p
13743 && (cp_parser_constructor_declarator_p
13746 /* If we don't have a DECL_SPEC yet, then we must be looking at
13747 a type-specifier. */
13749 {
13752 tree type_spec;
13754 type_spec
13756 decl_specs,
13762 /* If this type-specifier referenced a user-defined type
13763 (a typedef, class-name, etc.), then we can't allow any
13764 more such type-specifiers henceforth.
13766 [dcl.spec]
13768 The longest sequence of decl-specifiers that could
13769 possibly be a type name is taken as the
13770 decl-specifier-seq of a declaration. The sequence shall
13771 be self-consistent as described below.
13773 [dcl.type]
13775 As a general rule, at most one type-specifier is allowed
13776 in the complete decl-specifier-seq of a declaration. The
13777 only exceptions are the following:
13779 -- const or volatile can be combined with any other
13780 type-specifier.
13782 -- signed or unsigned can be combined with char, long,
13783 short, or int.
13785 -- ..
13787 Example:
13789 typedef char* Pc;
13790 void g (const int Pc);
13792 Here, Pc is *not* part of the decl-specifier seq; it's
13793 the declarator. Therefore, once we see a type-specifier
13794 (other than a cv-qualifier), we forbid any additional
13795 user-defined types. We *do* still allow things like `int
13796 int' to be considered a decl-specifier-seq, and issue the
13797 error message later. */
13800 /* A constructor declarator cannot follow a type-specifier. */
13802 {
13810 }
13811 }
13813 /* If we still do not have a DECL_SPEC, then there are no more
13814 decl-specifiers. */
13819 /* After we see one decl-specifier, further decl-specifiers are
13820 always optional. */
13822 }
13824 /* Don't allow a friend specifier with a class definition. */
13829 }
13831 /* Parse an (optional) storage-class-specifier.
13833 storage-class-specifier:
13834 auto
13835 register
13836 static
13837 extern
13838 mutable
13840 GNU Extension:
13842 storage-class-specifier:
13843 thread
13845 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13847 static tree
13849 {
13851 {
13855 /* Fall through for C++98. */
13863 /* Consume the token. */
13868 }
13869 }
13871 /* Parse an (optional) function-specifier.
13873 function-specifier:
13874 inline
13875 virtual
13876 explicit
13878 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13879 Updates DECL_SPECS, if it is non-NULL. */
13881 static tree
13884 {
13887 {
13893 /* 14.5.2.3 [temp.mem]
13895 A member function template shall not be virtual. */
13899 else
13909 }
13911 /* Consume the token. */
13913 }
13915 /* Parse a linkage-specification.
13917 linkage-specification:
13918 extern string-literal { declaration-seq [opt] }
13919 extern string-literal declaration */
13921 static void
13923 {
13924 tree linkage;
13926 /* Look for the `extern' keyword. */
13927 cp_token *extern_token
13930 /* Look for the string-literal. */
13934 /* Transform the literal into an identifier. If the literal is a
13935 wide-character string, or contains embedded NULs, then we can't
13936 handle it as the user wants. */
13939 {
13941 /* Assume C++ linkage. */
13943 }
13944 else
13947 /* We're now using the new linkage. */
13950 /* Preserve the location of the the innermost linkage specification,
13951 tracking the locations of nested specifications via a local. */
13952 location_t saved_location
13954 /* Construct a location ranging from the start of the "extern" to
13955 the end of the string-literal, with the caret at the start, e.g.:
13956 extern "C" {
13957 ^~~~~~~~~~
13958 */
13959 parser->innermost_linkage_specification_location
13964 /* If the next token is a `{', then we're using the first
13965 production. */
13967 {
13971 /* Consume the `{' token. */
13972 matching_braces braces;
13974 /* Parse the declarations. */
13976 /* Look for the closing `}'. */
13978 }
13979 /* Otherwise, there's just one declaration. */
13980 else
13981 {
13984 saved_in_unbraced_linkage_specification_p
13988 parser->in_unbraced_linkage_specification_p
13990 }
13992 /* We're done with the linkage-specification. */
13995 /* Restore location of parent linkage specification, if any. */
13997 }
13999 /* Parse a static_assert-declaration.
14001 static_assert-declaration:
14002 static_assert ( constant-expression , string-literal ) ;
14003 static_assert ( constant-expression ) ; (C++17)
14005 If MEMBER_P, this static_assert is a class member. */
14007 static void
14009 {
14010 cp_expr condition;
14011 location_t token_loc;
14012 tree message;
14015 /* Peek at the `static_assert' token so we can keep track of exactly
14016 where the static assertion started. */
14019 /* Look for the `static_assert' keyword. */
14021 RT_STATIC_ASSERT))
14024 /* We know we are in a static assertion; commit to any tentative
14025 parse. */
14029 /* Parse the `(' starting the static assertion condition. */
14030 matching_parens parens;
14033 /* Parse the constant-expression. Allow a non-constant expression
14034 here in order to give better diagnostics in finish_static_assert. */
14035 condition =
14041 {
14044 "static_assert without a message "
14046 /* Eat the ')' */
14051 }
14052 else
14053 {
14054 /* Parse the separating `,'. */
14057 /* Parse the string-literal message. */
14062 /* A `)' completes the static assertion. */
14068 }
14070 /* A semicolon terminates the declaration. */
14073 /* Get the location for the static assertion. Use that of the
14074 condition if available, otherwise, use that of the "static_assert"
14075 token. */
14080 /* Complete the static assertion, which may mean either processing
14081 the static assert now or saving it for template instantiation. */
14083 }
14085 /* Parse the expression in decltype ( expression ). */
14087 static tree
14090 {
14092 tree expr;
14094 /* Since we're going to preserve any side-effects from this parse, set up a
14095 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14096 in the expression. */
14099 /* First, try parsing an id-expression. */
14110 {
14113 cp_id_kind idk;
14117 /* Lookup the name we got back from the id-expression. */
14122 /* A template without args is not a complete id-expression. */
14131 {
14132 /* Complete lookup of the id-expression. */
14133 expr = (finish_id_expression
14146 /* We found an id-expression, but it was something that we
14147 should not have found. This is an error, not something
14148 we can recover from, so note that we found an
14149 id-expression and we'll recover as gracefully as
14150 possible. */
14152 }
14157 /* We have an id-expression. */
14159 }
14162 {
14163 /* Abort the id-expression parse. */
14166 /* Parsing tentatively, again. */
14169 /* Parse a class member access. */
14177 /* We have an id-expression. */
14179 }
14182 /* We have parsed the complete id-expression or member access. */
14184 else
14185 {
14186 /* Abort our attempt to parse an id-expression or member access
14187 expression. */
14190 /* Commit to the tentative_firewall so we get syntax errors. */
14193 /* Parse a full expression. */
14196 }
14199 }
14201 /* Parse a `decltype' type. Returns the type.
14203 simple-type-specifier:
14204 decltype ( expression )
14205 C++14 proposal:
14206 decltype ( auto ) */
14208 static tree
14210 {
14215 {
14216 /* Already parsed. */
14219 }
14221 /* Look for the `decltype' token. */
14225 /* Parse the opening `('. */
14226 matching_parens parens;
14236 /* decltype (auto) */
14238 else
14239 {
14240 /* decltype (expression) */
14242 /* Types cannot be defined in a `decltype' expression. Save away the
14243 old message and set the new one. */
14245 parser->type_definition_forbidden_message
14248 /* The restrictions on constant-expressions do not apply inside
14249 decltype expressions. */
14250 bool saved_integral_constant_expression_p
14252 bool saved_non_integral_constant_expression_p
14256 /* Within a parenthesized expression, a `>' token is always
14257 the greater-than operator. */
14258 bool saved_greater_than_is_operator_p
14262 /* Do not actually evaluate the expression. */
14265 /* Do not warn about problems with the expression. */
14270 /* Go back to evaluating expressions. */
14274 /* The `>' token might be the end of a template-id or
14275 template-parameter-list now. */
14276 parser->greater_than_is_operator_p
14279 /* Restore the old message and the integral constant expression
14280 flags. */
14282 parser->integral_constant_expression_p
14284 parser->non_integral_constant_expression_p
14286 }
14288 /* Parse to the closing `)'. */
14290 {
14295 }
14298 {
14299 /* Build auto. */
14302 }
14303 else
14305 tf_warning_or_error);
14307 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14308 it again. */
14319 }
14321 /* Special member functions [gram.special] */
14323 /* Parse a conversion-function-id.
14325 conversion-function-id:
14326 operator conversion-type-id
14328 Returns an IDENTIFIER_NODE representing the operator. */
14330 static tree
14332 {
14333 tree type;
14334 tree saved_scope;
14335 tree saved_qualifying_scope;
14336 tree saved_object_scope;
14339 /* Look for the `operator' token. */
14342 /* When we parse the conversion-type-id, the current scope will be
14343 reset. However, we need that information in able to look up the
14344 conversion function later, so we save it here. */
14348 /* We must enter the scope of the class so that the names of
14349 entities declared within the class are available in the
14350 conversion-type-id. For example, consider:
14352 struct S {
14353 typedef int I;
14354 operator I();
14355 };
14357 S::operator I() { ... }
14359 In order to see that `I' is a type-name in the definition, we
14360 must be in the scope of `S'. */
14363 /* Parse the conversion-type-id. */
14365 /* Leave the scope of the class, if any. */
14368 /* Restore the saved scope. */
14372 /* If the TYPE is invalid, indicate failure. */
14376 }
14378 /* Parse a conversion-type-id:
14380 conversion-type-id:
14381 type-specifier-seq conversion-declarator [opt]
14383 Returns the TYPE specified. */
14385 static tree
14387 {
14388 tree attributes;
14389 cp_decl_specifier_seq type_specifiers;
14391 tree type_specified;
14394 /* Parse the attributes. */
14398 parser->type_definition_forbidden_message
14401 /* Parse the type-specifiers. */
14408 /* If that didn't work, stop. */
14411 /* Parse the conversion-declarator. */
14419 /* Don't give this error when parsing tentatively. This happens to
14420 work because we always parse this definitively once. */
14423 {
14425 {
14428 }
14432 }
14435 }
14437 /* Parse an (optional) conversion-declarator.
14439 conversion-declarator:
14440 ptr-operator conversion-declarator [opt]
14442 */
14446 {
14449 cp_cv_quals cv_quals;
14451 /* We don't know if there's a ptr-operator next, or not. */
14453 /* Try the ptr-operator. */
14456 /* If it worked, look for more conversion-declarators. */
14458 {
14461 /* Parse another optional declarator. */
14464 declarator = cp_parser_make_indirect_declarator
14468 }
14471 }
14473 /* Parse an (optional) ctor-initializer.
14475 ctor-initializer:
14476 : mem-initializer-list */
14478 static void
14480 {
14481 /* If the next token is not a `:', then there is no
14482 ctor-initializer. */
14484 {
14485 /* Do default initialization of any bases and members. */
14489 }
14491 /* Consume the `:' token. */
14493 /* And the mem-initializer-list. */
14495 }
14497 /* Parse a mem-initializer-list.
14499 mem-initializer-list:
14500 mem-initializer ... [opt]
14501 mem-initializer ... [opt] , mem-initializer-list */
14503 static void
14505 {
14510 /* Let the semantic analysis code know that we are starting the
14511 mem-initializer-list. */
14516 /* Loop through the list. */
14518 {
14519 tree mem_initializer;
14522 /* Parse the mem-initializer. */
14524 /* If the next token is a `...', we're expanding member initializers. */
14530 {
14531 /* Consume the `...'. */
14535 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14536 can be expanded but members cannot. */
14539 {
14544 }
14546 /* Construct the pack expansion type. */
14549 }
14552 {
14556 }
14557 /* Look for a target constructor. */
14561 {
14564 {
14568 }
14570 }
14571 /* Add it to the list, unless it was erroneous. */
14573 {
14576 }
14577 /* If the next token is not a `,', we're done. */
14580 /* Consume the `,' token. */
14582 }
14584 /* Perform semantic analysis. */
14587 }
14589 /* Parse a mem-initializer.
14591 mem-initializer:
14592 mem-initializer-id ( expression-list [opt] )
14593 mem-initializer-id braced-init-list
14595 GNU extension:
14597 mem-initializer:
14598 ( expression-list [opt] )
14600 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14601 class) or FIELD_DECL (for a non-static data member) to initialize;
14602 the TREE_VALUE is the expression-list. An empty initialization
14603 list is represented by void_list_node. */
14605 static tree
14607 {
14608 tree mem_initializer_id;
14609 tree expression_list;
14610 tree member;
14613 /* Find out what is being initialized. */
14615 {
14619 }
14620 else
14621 {
14625 }
14631 {
14638 }
14639 else
14640 {
14650 }
14660 }
14662 /* Parse a mem-initializer-id.
14664 mem-initializer-id:
14665 :: [opt] nested-name-specifier [opt] class-name
14666 decltype-specifier (C++11)
14667 identifier
14669 Returns a TYPE indicating the class to be initialized for the first
14670 production (and the second in C++11). Returns an IDENTIFIER_NODE
14671 indicating the data member to be initialized for the last production. */
14673 static tree
14675 {
14679 tree id;
14683 /* `typename' is not allowed in this context ([temp.res]). */
14685 {
14687 "keyword %<typename%> not allowed in this context (a qualified "
14690 }
14691 /* Look for the optional `::' operator. */
14692 global_scope_p
14696 /* Look for the optional nested-name-specifier. The simplest way to
14697 implement:
14699 [temp.res]
14701 The keyword `typename' is not permitted in a base-specifier or
14702 mem-initializer; in these contexts a qualified name that
14703 depends on a template-parameter is implicitly assumed to be a
14704 type name.
14706 is to assume that we have seen the `typename' keyword at this
14707 point. */
14708 nested_name_specifier_p
14717 /* If there is a `::' operator or a nested-name-specifier, then we
14718 are definitely looking for a class-name. */
14723 typename_type,
14727 /* Otherwise, we could also be looking for an ordinary identifier. */
14730 /* Try a decltype-specifier. */
14732 else
14733 /* Otherwise, try a class-name. */
14737 none_type,
14741 /* If we found one, we're done. */
14744 /* Otherwise, look for an ordinary identifier. */
14746 }
14748 /* Overloading [gram.over] */
14750 /* Parse an operator-function-id.
14752 operator-function-id:
14753 operator operator
14755 Returns an IDENTIFIER_NODE for the operator which is a
14756 human-readable spelling of the identifier, e.g., `operator +'. */
14758 static cp_expr
14760 {
14761 /* Look for the `operator' keyword. */
14764 /* And then the name of the operator itself. */
14766 }
14768 /* Return an identifier node for a user-defined literal operator.
14769 The suffix identifier is chained to the operator name identifier. */
14771 tree
14773 {
14774 tree identifier;
14781 }
14783 /* Parse an operator.
14785 operator:
14786 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14787 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14788 || ++ -- , ->* -> () []
14790 GNU Extensions:
14792 operator:
14793 <? >? <?= >?=
14795 Returns an IDENTIFIER_NODE for the operator which is a
14796 human-readable spelling of the identifier, e.g., `operator +'. */
14798 static cp_expr
14800 {
14805 /* Peek at the next token. */
14810 /* Figure out which operator we have. */
14815 {
14817 {
14818 /* The keyword should be either `new' or `delete'. */
14823 else
14826 /* Consume the `new' or `delete' token. */
14829 /* Peek at the next token. */
14831 /* If it's a `[' token then this is the array variant of the
14832 operator. */
14834 {
14835 /* Consume the `[' token. */
14837 /* Look for the `]' token. */
14842 }
14846 }
15004 {
15005 /* Consume the `('. */
15006 matching_parens parens;
15008 /* Look for the matching `)'. */
15013 }
15016 /* Consume the `['. */
15018 /* Look for the matching `]'. */
15027 /* FALLTHRU */
15036 {
15043 /* Consume the string. */
15049 {
15052 }
15053 else
15054 {
15056 /* Look for the suffix identifier. */
15061 {
15065 }
15066 else
15067 {
15070 }
15071 }
15076 {
15079 }
15082 {
15085 }
15087 {
15090 }
15092 }
15095 /* Anything else is an error. */
15097 }
15099 /* If we have selected an identifier, we need to consume the
15100 operator token. */
15102 {
15106 }
15107 /* Otherwise, no valid operator name was present. */
15108 else
15109 {
15112 }
15115 }
15117 /* Parse a template-declaration.
15119 template-declaration:
15120 export [opt] template < template-parameter-list > declaration
15122 If MEMBER_P is TRUE, this template-declaration occurs within a
15123 class-specifier.
15125 The grammar rule given by the standard isn't correct. What
15126 is really meant is:
15128 template-declaration:
15129 export [opt] template-parameter-list-seq
15130 decl-specifier-seq [opt] init-declarator [opt] ;
15131 export [opt] template-parameter-list-seq
15132 function-definition
15134 template-parameter-list-seq:
15135 template-parameter-list-seq [opt]
15136 template < template-parameter-list >
15138 Concept Extensions:
15140 template-parameter-list-seq:
15141 template < template-parameter-list > requires-clause [opt]
15143 requires-clause:
15144 requires logical-or-expression */
15146 static void
15148 {
15149 /* Check for `export'. */
15151 {
15152 /* Consume the `export' token. */
15154 /* Warn that we do not support `export'. */
15156 }
15159 }
15161 /* Parse a template-parameter-list.
15163 template-parameter-list:
15164 template-parameter
15165 template-parameter-list , template-parameter
15167 Returns a TREE_LIST. Each node represents a template parameter.
15168 The nodes are connected via their TREE_CHAINs. */
15170 static tree
15172 {
15177 /* The loop below parses the template parms. We first need to know
15178 the total number of template parms to be able to compute proper
15179 canonical types of each dependent type. So after the loop, when
15180 we know the total number of template parms,
15181 end_template_parm_list computes the proper canonical types and
15182 fixes up the dependent types accordingly. */
15184 {
15185 tree parameter;
15188 location_t parm_loc;
15190 /* Parse the template-parameter. */
15195 /* Add it to the list. */
15198 parm_loc,
15199 parameter,
15200 is_non_type,
15201 is_parameter_pack);
15202 else
15203 {
15206 }
15208 /* If the next token is not a `,', we're done. */
15211 /* Otherwise, consume the `,' token. */
15213 }
15216 }
15218 /* Parse a introduction-list.
15220 introduction-list:
15221 introduced-parameter
15222 introduction-list , introduced-parameter
15224 introduced-parameter:
15225 ...[opt] identifier
15227 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15228 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15229 WILDCARD_DECL will also have DECL_NAME set and token location in
15230 DECL_SOURCE_LOCATION. */
15232 static tree
15234 {
15238 {
15243 /* Build placeholder. */
15251 /* If the next token is not a `,', we're done. */
15254 /* Otherwise, consume the `,' token. */
15256 }
15258 /* Convert the vec into a TREE_VEC. */
15261 tree parm;
15267 }
15269 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15270 is an abstract declarator. */
15274 {
15279 }
15281 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15282 is an abstract declarator. */
15286 {
15290 else
15292 }
15294 /* Returns true if DECL represents a constrained-parameter. */
15298 {
15303 }
15305 /* Returns true if PARM declares a constrained-parameter. */
15309 {
15311 }
15313 /* Check that the type parameter is only a declarator-id, and that its
15314 type is not cv-qualified. */
15316 bool
15319 {
15324 {
15327 }
15329 /* Don't allow cv-qualified type parameters. */
15332 {
15335 }
15338 }
15340 /* Finish parsing/processing a template type parameter and checking
15341 various restrictions. */
15345 tree id,
15347 {
15350 else
15352 }
15354 static tree
15356 {
15357 /* FIXME: This should probably be copied, and we may need to adjust
15358 the template parameter depths. */
15368 }
15370 /* Finish parsing/processing a template template parameter by borrowing
15371 the template parameter list from the prototype parameter. */
15373 static tree
15375 tree proto,
15376 tree id,
15378 {
15382 }
15384 /* Create a new non-type template parameter from the given PARM
15385 declarator. */
15387 static tree
15390 {
15396 }
15398 /* Build a constrained template parameter based on the PARMDECL
15399 declarator. The type of PARMDECL is the constrained type, which
15400 refers to the prototype template parameter that ultimately
15401 specifies the type of the declared parameter. */
15403 static tree
15408 {
15414 /* A template parameter constrained by a variadic concept shall also
15415 be declared as a template parameter pack. */
15420 /* Build the parameter. Return an error if the declarator was invalid. */
15421 tree parm;
15426 parmdecl);
15427 else
15432 /* Finish the parameter decl and create a node attaching the
15433 default argument and constraint. */
15438 }
15440 /* Returns true if the parsed type actually represents the declaration
15441 of a type template-parameter. */
15445 {
15448 }
15451 /* Returns true if the parsed type actually represents the declaration of
15452 a template template-parameter. */
15454 static bool
15456 {
15459 }
15461 /* Parse a default argument for a type template-parameter.
15462 Note that diagnostics are handled in cp_parser_template_parameter. */
15464 static tree
15466 {
15469 /* Consume the `=' token. */
15474 /* Parse the default-argument. */
15480 {
15484 }
15487 }
15489 /* Parse a default argument for a template template-parameter. */
15491 static tree
15493 {
15498 /* Consume the `='. */
15500 /* Parse the id-expression. */
15502 /* save token before parsing the id-expression, for error
15503 reporting */
15505 tree default_argument
15513 /* If the id-expression was a template-id that refers to
15514 a template-class, we already have the declaration here,
15515 so no further lookup is needed. */
15516 ;
15517 else
15518 /* Look up the name. */
15519 default_argument
15521 none_type,
15527 /* See if the default argument is valid. */
15531 }
15533 /* Parse a template-parameter.
15535 template-parameter:
15536 type-parameter
15537 parameter-declaration
15539 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15540 the parameter. The TREE_PURPOSE is the default value, if any.
15541 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15542 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15543 set to true iff this parameter is a parameter pack. */
15545 static tree
15548 {
15551 tree parm;
15553 /* Assume it is a type parameter or a template parameter. */
15555 /* Assume it not a parameter pack. */
15557 /* Peek at the next token. */
15559 /* If it is `template', we have a type-parameter. */
15562 /* If it is `class' or `typename' we do not know yet whether it is a
15563 type parameter or a non-type parameter. Consider:
15565 template <typename T, typename T::X X> ...
15567 or:
15569 template <class C, class D*> ...
15571 Here, the first parameter is a type parameter, and the second is
15572 a non-type parameter. We can tell by looking at the token after
15573 the identifier -- if it is a `,', `=', or `>' then we have a type
15574 parameter. */
15576 {
15577 /* Peek at the token after `class' or `typename'. */
15579 /* If it's an ellipsis, we have a template type parameter
15580 pack. */
15583 /* If it's an identifier, skip it. */
15586 /* Now, see if the token looks like the end of a template
15587 parameter. */
15592 }
15594 /* Otherwise, it is a non-type parameter or a constrained parameter.
15596 [temp.param]
15598 When parsing a default template-argument for a non-type
15599 template-parameter, the first non-nested `>' is taken as the end
15600 of the template parameter-list rather than a greater-than
15601 operator. */
15602 parameter_declarator
15609 /* If the parameter declaration is marked as a parameter pack, set
15610 *IS_PARAMETER_PACK to notify the caller. */
15615 {
15616 /* Can happen in some cases of erroneous input (c++/34892). */
15618 /* Consume the `...' for better error recovery. */
15620 }
15622 // The parameter may have been constrained.
15625 parameter_declarator,
15626 is_non_type,
15627 is_parameter_pack);
15629 // Now we're sure that the parameter is a non-type parameter.
15640 }
15642 /* Parse a type-parameter.
15644 type-parameter:
15645 class identifier [opt]
15646 class identifier [opt] = type-id
15647 typename identifier [opt]
15648 typename identifier [opt] = type-id
15649 template < template-parameter-list > class identifier [opt]
15650 template < template-parameter-list > class identifier [opt]
15651 = id-expression
15653 GNU Extension (variadic templates):
15655 type-parameter:
15656 class ... identifier [opt]
15657 typename ... identifier [opt]
15659 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15660 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15661 the declaration of the parameter.
15663 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15665 static tree
15667 {
15669 tree parameter;
15671 /* Look for a keyword to tell us what kind of parameter this is. */
15677 {
15680 {
15681 tree identifier;
15682 tree default_argument;
15684 /* If the next token is an ellipsis, we have a template
15685 argument pack. */
15687 {
15688 /* Consume the `...' token. */
15693 }
15695 /* If the next token is an identifier, then it names the
15696 parameter. */
15699 else
15702 /* Create the parameter. */
15705 /* If the next token is an `=', we have a default argument. */
15707 {
15708 default_argument
15711 /* Template parameter packs cannot have default
15712 arguments. */
15714 {
15717 "template parameter pack %qD cannot have a "
15719 else
15721 "template parameter packs cannot have "
15724 }
15727 }
15728 else
15731 /* Create the combined representation of the parameter and the
15732 default argument. */
15734 }
15738 {
15739 tree identifier;
15740 tree default_argument;
15742 /* Look for the `<'. */
15744 /* Parse the template-parameter-list. */
15746 /* Look for the `>'. */
15749 // If template requirements are present, parse them.
15751 {
15756 }
15758 /* Look for the `class' or 'typename' keywords. */
15760 /* If the next token is an ellipsis, we have a template
15761 argument pack. */
15763 {
15764 /* Consume the `...' token. */
15769 }
15770 /* If the next token is an `=', then there is a
15771 default-argument. If the next token is a `>', we are at
15772 the end of the parameter-list. If the next token is a `,',
15773 then we are at the end of this parameter. */
15777 {
15779 /* Treat invalid names as if the parameter were nameless. */
15782 }
15783 else
15786 /* Create the template parameter. */
15788 identifier);
15790 /* If the next token is an `=', then there is a
15791 default-argument. */
15793 {
15794 default_argument
15797 /* Template parameter packs cannot have default
15798 arguments. */
15800 {
15803 "template parameter pack %qD cannot "
15805 identifier);
15806 else
15810 }
15811 }
15812 else
15815 /* Create the combined representation of the parameter and the
15816 default argument. */
15818 }
15824 }
15827 }
15829 /* Parse a template-id.
15831 template-id:
15832 template-name < template-argument-list [opt] >
15834 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15835 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15836 returned. Otherwise, if the template-name names a function, or set
15837 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15838 names a class, returns a TYPE_DECL for the specialization.
15840 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15841 uninstantiated templates. */
15843 static tree
15849 {
15850 tree templ;
15851 tree arguments;
15852 tree template_id;
15857 /* If the next token corresponds to a template-id, there is no need
15858 to reparse it. */
15861 {
15864 }
15866 /* Avoid performing name lookup if there is no possibility of
15867 finding a template-id. */
15870 && !cp_parser_nth_token_starts_template_argument_list_p
15872 {
15875 }
15877 /* Remember where the template-id starts. */
15883 /* Parse the template-name. */
15886 check_dependency_p,
15887 is_declaration,
15888 tag_type,
15891 {
15894 }
15896 /* Since we're going to preserve any side-effects from this parse, set up a
15897 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15898 in the template arguments. */
15901 /* If we find the sequence `[:' after a template-name, it's probably
15902 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15903 parse correctly the argument list. */
15910 {
15912 /* Change `:' into `::'. */
15914 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15915 CPP_LESS. */
15918 /* Parse the arguments. */
15921 {
15922 /* If we couldn't parse an argument list, then we revert our changes
15923 and return simply an error. Maybe this is not a template-id
15924 after all. */
15929 }
15930 /* Otherwise, emit an error about the invalid digraph, but continue
15931 parsing because we got our argument list. */
15934 {
15937 "%<<:%> is an alternate spelling for %<[%>."
15940 {
15942 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15945 }
15946 }
15947 }
15948 else
15949 {
15950 /* Look for the `<' that starts the template-argument-list. */
15952 {
15955 }
15956 /* Parse the arguments. */
15958 }
15960 /* Set the location to be of the form:
15961 template-name < template-argument-list [opt] >
15962 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15963 with caret == start at the start of the template-name,
15964 ranging until the closing '>'. */
15965 location_t finish_loc
15967 location_t combined_loc
15970 /* Check for concepts autos where they don't belong. We could
15971 identify types in some cases of idnetifier TEMPL, looking ahead
15972 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15973 types. We reject them in functions, but if what we have is an
15974 identifier, even with none_type we can't conclude it's NOT a
15975 type, we have to wait for template substitution. */
15978 /* Build a representation of the specialization. */
15981 TEMPLATE_ID_EXPR,
15985 {
15986 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15987 template (rather than some instantiation thereof) only if
15988 is not nested within some other construct. For example, in
15989 "template <typename T> void f(T) { A<T>::", A<T> is just an
15990 instantiation of A. */
15991 bool entering_scope
15994 template_id
15996 }
15997 /* A template-like identifier may be a partial concept id. */
16003 {
16007 }
16008 else
16009 {
16010 /* If it's not a class-template or a template-template, it should be
16011 a function-template. */
16019 }
16021 /* If parsing tentatively, replace the sequence of tokens that makes
16022 up the template-id with a CPP_TEMPLATE_ID token. That way,
16023 should we re-parse the token stream, we will not have to repeat
16024 the effort required to do the parse, nor will we issue duplicate
16025 error messages about problems during instantiation of the
16026 template. */
16028 /* Don't do this if we had a parse error in a declarator; re-parsing
16029 might succeed if a name changes meaning (60361). */
16033 {
16034 /* Reset the contents of the START_OF_ID token. */
16038 /* Retrieve any deferred checks. Do not pop this access checks yet
16039 so the memory will not be reclaimed during token replacing below. */
16045 /* Purge all subsequent tokens. */
16048 /* ??? Can we actually assume that, if template_id ==
16049 error_mark_node, we will have issued a diagnostic to the
16050 user, as opposed to simply marking the tentative parse as
16051 failed? */
16054 }
16058 }
16060 /* Parse a template-name.
16062 template-name:
16063 identifier
16065 The standard should actually say:
16067 template-name:
16068 identifier
16069 operator-function-id
16071 A defect report has been filed about this issue.
16073 A conversion-function-id cannot be a template name because they cannot
16074 be part of a template-id. In fact, looking at this code:
16076 a.operator K<int>()
16078 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16079 It is impossible to call a templated conversion-function-id with an
16080 explicit argument list, since the only allowed template parameter is
16081 the type to which it is converting.
16083 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16084 `template' keyword, in a construction like:
16086 T::template f<3>()
16088 In that case `f' is taken to be a template-name, even though there
16089 is no way of knowing for sure.
16091 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16092 name refers to a set of overloaded functions, at least one of which
16093 is a template, or an IDENTIFIER_NODE with the name of the template,
16094 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16095 names are looked up inside uninstantiated templates. */
16097 static tree
16104 {
16105 tree identifier;
16106 tree decl;
16109 /* If the next token is `operator', then we have either an
16110 operator-function-id or a conversion-function-id. */
16112 {
16113 /* We don't know whether we're looking at an
16114 operator-function-id or a conversion-function-id. */
16116 /* Try an operator-function-id. */
16118 /* If that didn't work, try a conversion-function-id. */
16120 {
16123 }
16124 }
16125 /* Look for the identifier. */
16126 else
16129 /* If we didn't find an identifier, we don't have a template-id. */
16133 /* If the name immediately followed the `template' keyword, then it
16134 is a template-name. However, if the next token is not `<', then
16135 we do not treat it as a template-name, since it is not being used
16136 as part of a template-id. This enables us to handle constructs
16137 like:
16139 template <typename T> struct S { S(); };
16140 template <typename T> S<T>::S();
16142 correctly. We would treat `S' as a template -- if it were `S<T>'
16143 -- but we do not if there is no `<'. */
16147 {
16148 /* In a declaration, in a dependent context, we pretend that the
16149 "template" keyword was present in order to improve error
16150 recovery. For example, given:
16152 template <typename T> void f(T::X<int>);
16154 we want to treat "X<int>" as a template-id. */
16156 && !template_keyword_p
16158 && check_dependency_p
16160 /* Do not do this for dtors (or ctors), since they never
16161 need the template keyword before their name. */
16163 {
16166 /* Explain what went wrong. */
16168 identifier);
16171 /* If parsing tentatively, find the location of the "<" token. */
16174 /* Parse the template arguments so that we can issue error
16175 messages about them. */
16178 /* Skip tokens until we find a good place from which to
16179 continue parsing. */
16184 /* If parsing tentatively, permanently remove the
16185 template argument list. That will prevent duplicate
16186 error messages from being issued about the missing
16187 "template" keyword. */
16194 }
16196 /* If the "template" keyword is present, then there is generally
16197 no point in doing name-lookup, so we just return IDENTIFIER.
16198 But, if the qualifying scope is non-dependent then we can
16199 (and must) do name-lookup normally. */
16201 {
16207 {
16208 /* We're optimizing away the call to cp_parser_lookup_name, but
16209 we still need to do this. */
16212 }
16213 }
16214 }
16216 /* Look up the name. */
16218 tag_type,
16221 check_dependency_p,
16227 /* If DECL is a template, then the name was a template-name. */
16229 {
16233 }
16234 else
16235 {
16236 /* The standard does not explicitly indicate whether a name that
16237 names a set of overloaded declarations, some of which are
16238 templates, is a template-name. However, such a name should
16239 be a template-name; otherwise, there is no way to form a
16240 template-id for the overloaded templates. */
16249 {
16250 /* The name does not name a template. */
16253 }
16254 }
16256 /* If DECL is dependent, and refers to a function, then just return
16257 its name; we will look it up again during template instantiation. */
16259 {
16263 }
16266 }
16268 /* Parse a template-argument-list.
16270 template-argument-list:
16271 template-argument ... [opt]
16272 template-argument-list , template-argument ... [opt]
16274 Returns a TREE_VEC containing the arguments. */
16276 static tree
16278 {
16283 tree vec;
16290 /* Even if the template-id appears in an integral
16291 constant-expression, the contents of the argument list do
16292 not. */
16298 /* Parse the arguments. */
16299 do
16300 {
16301 tree argument;
16304 /* Consume the comma. */
16307 /* Parse the template-argument. */
16310 /* If the next token is an ellipsis, we're expanding a template
16311 argument pack. */
16313 {
16315 {
16319 }
16320 /* Consume the `...' token. */
16323 /* Make the argument into a TYPE_PACK_EXPANSION or
16324 EXPR_PACK_EXPANSION. */
16326 }
16329 {
16333 {
16336 }
16337 else
16339 }
16341 }
16357 }
16359 /* Parse a template-argument.
16361 template-argument:
16362 assignment-expression
16363 type-id
16364 id-expression
16366 The representation is that of an assignment-expression, type-id, or
16367 id-expression -- except that the qualified id-expression is
16368 evaluated, so that the value returned is either a DECL or an
16369 OVERLOAD.
16371 Although the standard says "assignment-expression", it forbids
16372 throw-expressions or assignments in the template argument.
16373 Therefore, we use "conditional-expression" instead. */
16375 static tree
16377 {
16378 tree argument;
16384 cp_id_kind idk;
16386 /* There's really no way to know what we're looking at, so we just
16387 try each alternative in order.
16389 [temp.arg]
16391 In a template-argument, an ambiguity between a type-id and an
16392 expression is resolved to a type-id, regardless of the form of
16393 the corresponding template-parameter.
16395 Therefore, we try a type-id first. */
16398 /* If there was no error parsing the type-id but the next token is a
16399 '>>', our behavior depends on which dialect of C++ we're
16400 parsing. In C++98, we probably found a typo for '> >'. But there
16401 are type-id which are also valid expressions. For instance:
16403 struct X { int operator >> (int); };
16404 template <int V> struct Foo {};
16405 Foo<X () >> 5> r;
16407 Here 'X()' is a valid type-id of a function type, but the user just
16408 wanted to write the expression "X() >> 5". Thus, we remember that we
16409 found a valid type-id, but we still try to parse the argument as an
16410 expression to see what happens.
16412 In C++0x, the '>>' will be considered two separate '>'
16413 tokens. */
16417 {
16420 }
16421 else
16422 {
16423 /* If the next token isn't a `,' or a `>', then this argument wasn't
16424 really finished. This means that the argument is not a valid
16425 type-id. */
16428 /* If that worked, we're done. */
16431 }
16432 /* We're still not sure what the argument will be. */
16434 /* Try a template. */
16442 /* If the next token isn't a `,' or a `>', then this argument wasn't
16443 really finished. */
16447 {
16448 /* Figure out what is being referred to. If the id-expression
16449 was for a class template specialization, then we will have a
16450 TYPE_DECL at this point. There is no need to do name lookup
16451 at this point in that case. */
16454 none_type,
16460 /* Handle a constrained-type-specifier for a non-type template
16461 parameter. */
16467 }
16469 {
16473 }
16474 /* It must be a non-type argument. In C++17 any constant-expression is
16475 allowed. */
16479 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16481 -- an integral constant-expression of integral or enumeration
16482 type; or
16484 -- the name of a non-type template-parameter; or
16486 -- the name of an object or function with external linkage...
16488 -- the address of an object or function with external linkage...
16490 -- a pointer to member... */
16491 /* Look for a non-type template parameter. */
16493 {
16505 }
16507 /* If the next token is "&", the argument must be the address of an
16508 object or function with external linkage. */
16511 {
16514 }
16515 /* See if we might have an id-expression. */
16522 {
16525 address_p,
16532 else
16533 {
16534 tree probe;
16537 {
16538 /* Strip the dereference temporarily. */
16541 }
16543 /* If we're in a template, we represent a qualified-id referring
16544 to a static data member as a SCOPE_REF even if the scope isn't
16545 dependent so that we can check access control later. */
16550 {
16551 /* A variable without external linkage might still be a
16552 valid constant-expression, so no error is issued here
16553 if the external-linkage check fails. */
16556 }
16558 /* All overloaded functions are allowed; if the external
16559 linkage test does not pass, an error will be issued
16560 later. */
16561 ;
16565 /* A pointer-to-member. */
16566 ;
16568 ;
16569 else
16573 {
16576 tf_warning_or_error);
16577 else
16580 }
16581 }
16582 }
16583 /* If the argument started with "&", there are no other valid
16584 alternatives at this point. */
16586 {
16589 }
16591 general_expr:
16592 /* If the argument wasn't successfully parsed as a type-id followed
16593 by '>>', the argument can only be a constant expression now.
16594 Otherwise, we try parsing the constant-expression tentatively,
16595 because the argument could really be a type-id. */
16601 else
16602 {
16603 /* With C++17 generalized non-type template arguments we need to handle
16604 lvalue constant expressions, too. */
16607 }
16615 /* We did our best to parse the argument as a non type-id, but that
16616 was the only alternative that matched (albeit with a '>' after
16617 it). We can assume it's just a typo from the user, and a
16618 diagnostic will then be issued. */
16620 }
16622 /* Parse an explicit-instantiation.
16624 explicit-instantiation:
16625 template declaration
16627 Although the standard says `declaration', what it really means is:
16629 explicit-instantiation:
16630 template decl-specifier-seq [opt] declarator [opt] ;
16632 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16633 supposed to be allowed. A defect report has been filed about this
16634 issue.
16636 GNU Extension:
16638 explicit-instantiation:
16639 storage-class-specifier template
16640 decl-specifier-seq [opt] declarator [opt] ;
16641 function-specifier template
16642 decl-specifier-seq [opt] declarator [opt] ; */
16644 static void
16646 {
16648 cp_decl_specifier_seq decl_specifiers;
16653 /* Look for an (optional) storage-class-specifier or
16654 function-specifier. */
16656 {
16657 extension_specifier
16660 extension_specifier
16663 }
16665 /* Look for the `template' keyword. */
16667 /* Let the front end know that we are processing an explicit
16668 instantiation. */
16670 /* [temp.explicit] says that we are supposed to ignore access
16671 control while processing explicit instantiation directives. */
16673 /* Parse a decl-specifier-seq. */
16675 CP_PARSER_FLAGS_OPTIONAL,
16678 /* If there was exactly one decl-specifier, and it declared a class,
16679 and there's no declarator, then we have an explicit type
16680 instantiation. */
16682 {
16683 tree type;
16687 /* Turn access control back on for names used during
16688 template instantiation. */
16693 }
16694 else
16695 {
16697 tree decl;
16699 /* Parse the declarator. */
16700 declarator
16711 {
16714 "explicit instantiation shall not use"
16718 "explicit instantiation shall not use"
16723 /* Turn access control back on for names used during
16724 template instantiation. */
16726 /* Do the explicit instantiation. */
16728 }
16729 else
16730 {
16732 /* Skip the body of the explicit instantiation. */
16734 }
16735 }
16736 /* We're done with the instantiation. */
16742 }
16744 /* Parse an explicit-specialization.
16746 explicit-specialization:
16747 template < > declaration
16749 Although the standard says `declaration', what it really means is:
16751 explicit-specialization:
16752 template <> decl-specifier [opt] init-declarator [opt] ;
16753 template <> function-definition
16754 template <> explicit-specialization
16755 template <> template-declaration */
16757 static void
16759 {
16763 /* Look for the `template' keyword. */
16765 /* Look for the `<'. */
16767 /* Look for the `>'. */
16769 /* We have processed another parameter list. */
16771 /* [temp]
16773 A template ... explicit specialization ... shall not have C
16774 linkage. */
16776 {
16779 /* Give it C++ linkage to avoid confusing other parts of the
16780 front end. */
16783 }
16784 else
16786 /* Let the front end know that we are beginning a specialization. */
16788 {
16791 }
16793 /* If the next keyword is `template', we need to figure out whether
16794 or not we're looking a template-declaration. */
16796 {
16801 else
16803 }
16804 else
16805 /* Parse the dependent declaration. */
16811 /* We're done with the specialization. */
16813 /* For the erroneous case of a template with C linkage, we pushed an
16814 implicit C++ linkage scope; exit that scope now. */
16817 /* We're done with this parameter list. */
16819 }
16821 /* Parse a type-specifier.
16823 type-specifier:
16824 simple-type-specifier
16825 class-specifier
16826 enum-specifier
16827 elaborated-type-specifier
16828 cv-qualifier
16830 GNU Extension:
16832 type-specifier:
16833 __complex__
16835 Returns a representation of the type-specifier. For a
16836 class-specifier, enum-specifier, or elaborated-type-specifier, a
16837 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16839 The parser flags FLAGS is used to control type-specifier parsing.
16841 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16842 in a decl-specifier-seq.
16844 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16845 class-specifier, enum-specifier, or elaborated-type-specifier, then
16846 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16847 if a type is declared; 2 if it is defined. Otherwise, it is set to
16848 zero.
16850 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16851 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16852 is set to FALSE. */
16854 static tree
16856 cp_parser_flags flags,
16861 {
16867 /* Assume this type-specifier does not declare a new type. */
16870 /* And that it does not specify a cv-qualifier. */
16873 /* Peek at the next token. */
16876 /* If we're looking at a keyword, we can use that to guide the
16877 production we choose. */
16880 {
16885 /* Look for the enum-specifier. */
16887 /* If that worked, we're done. */
16889 {
16894 type_spec,
16895 token,
16898 }
16899 else
16902 /* Any of these indicate either a class-specifier, or an
16903 elaborated-type-specifier. */
16910 /* Parse tentatively so that we can back up if we don't find a
16911 class-specifier. */
16913 /* Look for the class-specifier. */
16916 /* If that worked, we're done. */
16918 {
16923 type_spec,
16924 token,
16927 }
16929 /* Fall through. */
16930 elaborated_type_specifier:
16931 /* We're declaring (not defining) a class or enum. */
16935 /* Fall through. */
16937 /* Look for an elaborated-type-specifier. */
16938 type_spec
16939 = (cp_parser_elaborated_type_specifier
16942 is_declaration));
16945 type_spec,
16946 token,
16969 /* The `__complex__' keyword is a GNU extension. */
16975 }
16977 /* Handle simple keywords. */
16979 {
16981 {
16984 }
16986 }
16988 /* If we do not already have a type-specifier, assume we are looking
16989 at a simple-type-specifier. */
16991 decl_specs,
16992 flags);
16994 /* If we didn't find a type-specifier, and a type-specifier was not
16995 optional in this context, issue an error message. */
16997 {
17000 }
17003 }
17005 /* Parse a simple-type-specifier.
17007 simple-type-specifier:
17008 :: [opt] nested-name-specifier [opt] type-name
17009 :: [opt] nested-name-specifier template template-id
17010 char
17011 wchar_t
17012 bool
17013 short
17014 int
17015 long
17016 signed
17017 unsigned
17018 float
17019 double
17020 void
17022 C++11 Extension:
17024 simple-type-specifier:
17025 auto
17026 decltype ( expression )
17027 char16_t
17028 char32_t
17029 __underlying_type ( type-id )
17031 C++17 extension:
17033 nested-name-specifier(opt) template-name
17035 GNU Extension:
17037 simple-type-specifier:
17038 __int128
17039 __typeof__ unary-expression
17040 __typeof__ ( type-id )
17041 __typeof__ ( type-id ) { initializer-list , [opt] }
17043 Concepts Extension:
17045 simple-type-specifier:
17046 constrained-type-specifier
17048 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17049 appropriately updated. */
17051 static tree
17054 cp_parser_flags flags)
17055 {
17060 /* Peek at the next token. */
17063 /* If we're looking at a keyword, things are easy. */
17065 {
17100 {
17103 }
17132 {
17133 /* The 'auto' might be the placeholder return type for a function decl
17134 with trailing return type. */
17143 {
17145 {
17152 }
17155 {
17158 }
17161 }
17165 {
17168 }
17171 {
17174 }
17175 else
17179 {
17182 "use of %<auto%> in lambda parameter declaration "
17183 "only available with "
17185 }
17188 "use of %<auto%> in parameter declaration "
17189 "only available with "
17193 "use of %<auto%> in parameter declaration "
17195 }
17196 else
17201 /* Since DR 743, decltype can either be a simple-type-specifier by
17202 itself or begin a nested-name-specifier. Parsing it will replace
17203 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17204 handling below decide what to do. */
17210 /* Consume the `typeof' token. */
17212 /* Parse the operand to `typeof'. */
17214 /* If it is not already a TYPE, take its type. */
17220 token,
17229 token,
17239 token,
17244 }
17246 /* If token is an already-parsed decltype not followed by ::,
17247 it's a simple-type-specifier. */
17250 {
17253 {
17255 token,
17257 /* Remember that we are handling a decltype in order to
17258 implement the resolution of DR 1510 when the argument
17259 isn't instantiation dependent. */
17261 }
17264 }
17266 /* If the type-specifier was for a built-in type, we're done. */
17268 {
17269 /* Record the type. */
17276 type,
17277 token,
17282 /* Consume the token. */
17288 /* There is no valid C++ program where a non-template type is
17289 followed by a "<". That usually indicates that the user thought
17290 that the type was a template. */
17295 }
17297 /* The type-specifier must be a user-defined type. */
17299 {
17303 /* Don't gobble tokens or issue error messages if this is an
17304 optional type-specifier. */
17310 /* Look for the optional `::' operator. */
17311 global_p
17315 /* Look for the nested-name specifier. */
17316 qualified_p
17323 /* If we have seen a nested-name-specifier, and the next token
17324 is `template', then we are using the template-id production. */
17327 {
17328 /* Look for the template-id. */
17332 none_type,
17334 /* If the template-id did not name a type, we are out of
17335 luck. */
17337 {
17340 }
17341 }
17342 /* Otherwise, look for a type-name. */
17343 else
17345 /* Keep track of all name-lookups performed in class scopes. */
17347 && !global_p
17348 && !qualified_p
17352 /* If it didn't work out, we don't have a TYPE. */
17357 {
17371 {
17373 none_type,
17383 else
17384 {
17389 }
17390 }
17391 else
17397 }
17400 token,
17402 }
17404 /* If we didn't get a type-name, issue an error message. */
17406 {
17409 }
17412 {
17413 /* See if TYPE is an Objective-C type, and if so, parse and
17414 accept any protocol references following it. Do this before
17415 the cp_parser_check_for_invalid_template_id() call, because
17416 Objective-C types can be followed by '<...>' which would
17417 enclose protocol names rather than template arguments, and so
17418 everything is fine. */
17421 {
17425 /* Clobber the "unqualified" type previously entered into
17426 DECL_SPECS with the new, improved protocol-qualified version. */
17431 }
17433 /* There is no valid C++ program where a non-template type is
17434 followed by a "<". That usually indicates that the user
17435 thought that the type was a template. */
17437 none_type,
17439 }
17442 }
17444 /* Parse a type-name.
17446 type-name:
17447 class-name
17448 enum-name
17449 typedef-name
17450 simple-template-id [in c++0x]
17452 enum-name:
17453 identifier
17455 typedef-name:
17456 identifier
17458 Concepts:
17460 type-name:
17461 concept-name
17462 partial-concept-id
17464 concept-name:
17465 identifier
17467 Returns a TYPE_DECL for the type. */
17469 static tree
17471 {
17473 }
17475 /* See above. */
17476 static tree
17478 {
17479 tree type_decl;
17481 /* We can't know yet whether it is a class-name or not. */
17483 /* Try a class-name. */
17485 typename_keyword_p,
17487 none_type,
17491 /* If it's not a class-name, keep looking. */
17493 {
17495 /* It must be a typedef-name or an enum-name. */
17499 /* It is either a simple-template-id representing an
17500 instantiation of an alias template... */
17504 none_type,
17506 /* Note that this must be an instantiation of an alias template
17507 because [temp.names]/6 says:
17509 A template-id that names an alias template specialization
17510 is a type-name.
17512 Whereas [temp.names]/7 says:
17514 A simple-template-id that names a class template
17515 specialization is a class-name.
17517 With concepts, this could also be a partial-concept-id that
17518 declares a non-type template parameter. */
17525 else
17529 /* ... Or a typedef-name or an enum-name. */
17531 }
17534 }
17536 /* Check if DECL and ARGS can form a constrained-type-specifier.
17537 If ARGS is non-null, we try to form a concept check of the
17538 form DECL<?, ARGS> where ? is a wildcard that matches any
17539 kind of template argument. If ARGS is NULL, then we try to
17540 form a concept check of the form DECL<?>. */
17542 static tree
17545 {
17548 /* If we a constrained-type-specifier cannot be deduced. */
17552 /* A constrained type specifier can only be found in an
17553 overload set or as a reference to a template declaration.
17555 FIXME: This might be masking a bug. It's possible that
17556 that the deduction below is causing template specializations
17557 to be formed with the wildcard as an argument. */
17561 /* Try to build a call expression that evaluates the
17562 concept. This can fail if the overload set refers
17563 only to non-templates. */
17569 /* Deduce the checked constraint and the prototype parameter.
17571 FIXME: In certain cases, failure to deduce should be a
17572 diagnosable error. */
17573 tree conc;
17574 tree proto;
17578 /* In template parameter scope, this results in a constrained
17579 parameter. Return a descriptor of that parm. */
17583 /* In a parameter-declaration-clause, constrained-type
17584 specifiers result in invented template parameters. */
17586 {
17589 }
17590 else
17591 {
17592 /* Otherwise, we're in a context where the constrained
17593 type name is deduced and the constraint applies
17594 after deduction. */
17596 }
17599 }
17601 /* If DECL refers to a concept, return a TYPE_DECL representing
17602 the result of using the constrained type specifier in the
17603 current context. DECL refers to a concept if
17605 - it is an overload set containing a function concept taking a single
17606 type argument, or
17608 - it is a variable concept taking a single type argument. */
17610 static tree
17612 {
17618 else
17620 }
17622 /* Check if DECL and ARGS form a partial-concept-id. If so,
17623 assign ID to the resulting constrained placeholder.
17625 Returns true if the partial-concept-id designates a placeholder
17626 and false otherwise. Note that *id is set to NULL_TREE in
17627 this case. */
17629 static tree
17631 {
17633 }
17635 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17636 or a concept-name.
17638 enum-name:
17639 identifier
17641 typedef-name:
17642 identifier
17644 concept-name:
17645 identifier
17647 Returns a TYPE_DECL for the type. */
17649 static tree
17651 {
17652 tree type_decl;
17653 tree identifier;
17660 /* Look up the type-name. */
17665 /* If we found an overload set, then it may refer to a concept-name. */
17671 {
17672 /* See if this is an Objective-C type. */
17677 }
17679 /* Issue an error if we did not find a type-name. */
17681 /* In Objective-C, we have the complication that class names are
17682 normally type names and start declarations (eg, the
17683 "NSObject" in "NSObject *object;"), but can be used in an
17684 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17685 is an expression. So, a classname followed by a dot is not a
17686 valid type-name. */
17689 {
17694 }
17695 /* Remember that the name was used in the definition of the
17696 current class so that we can check later to see if the
17697 meaning would have been different after the class was
17698 entirely defined. */
17704 }
17706 /* Parse an elaborated-type-specifier. Note that the grammar given
17707 here incorporates the resolution to DR68.
17709 elaborated-type-specifier:
17710 class-key :: [opt] nested-name-specifier [opt] identifier
17711 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17712 enum-key :: [opt] nested-name-specifier [opt] identifier
17713 typename :: [opt] nested-name-specifier identifier
17714 typename :: [opt] nested-name-specifier template [opt]
17715 template-id
17717 GNU extension:
17719 elaborated-type-specifier:
17720 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17721 class-key attributes :: [opt] nested-name-specifier [opt]
17722 template [opt] template-id
17723 enum attributes :: [opt] nested-name-specifier [opt] identifier
17725 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17726 declared `friend'. If IS_DECLARATION is TRUE, then this
17727 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17728 something is being declared.
17730 Returns the TYPE specified. */
17732 static tree
17736 {
17738 tree identifier;
17741 tree globalscope;
17744 /* See if we're looking at the `enum' keyword. */
17746 {
17747 /* Consume the `enum' token. */
17749 /* Remember that it's an enumeration type. */
17751 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17752 enums) is used here. */
17756 {
17763 /* Consume the `struct' or `class' and parse it anyway. */
17765 }
17766 /* Parse the attributes. */
17768 }
17769 /* Or, it might be `typename'. */
17771 RID_TYPENAME))
17772 {
17773 /* Consume the `typename' token. */
17775 /* Remember that it's a `typename' type. */
17777 }
17778 /* Otherwise it must be a class-key. */
17779 else
17780 {
17784 /* Parse the attributes. */
17786 }
17788 /* Look for the `::' operator. */
17791 /* Look for the nested-name-specifier. */
17792 tree nested_name_specifier;
17794 {
17795 nested_name_specifier
17800 is_declaration);
17803 }
17804 else
17805 /* Even though `typename' is not present, the proposed resolution
17806 to Core Issue 180 says that in `class A<T>::B', `B' should be
17807 considered a type-name, even if `A<T>' is dependent. */
17808 nested_name_specifier
17813 is_declaration);
17814 /* For everything but enumeration types, consider a template-id.
17815 For an enumeration type, consider only a plain identifier. */
17817 {
17819 tree decl;
17821 /* Allow the `template' keyword. */
17823 /* If we didn't see `template', we don't know if there's a
17824 template-id or not. */
17827 /* Parse the template-id. */
17831 tag_type,
17832 is_declaration);
17833 /* If we didn't find a template-id, look for an ordinary
17834 identifier. */
17836 ;
17837 /* We can get here when cp_parser_template_id, called by
17838 cp_parser_class_name with tag_type == none_type, succeeds
17839 and caches a BASELINK. Then, when called again here,
17840 instead of failing and returning an error_mark_node
17841 returns it (see template/typename17.C in C++11).
17842 ??? Could we diagnose this earlier? */
17844 {
17847 }
17848 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17849 in effect, then we must assume that, upon instantiation, the
17850 template will correspond to a class. */
17854 typename_type,
17856 /* If the `typename' keyword is in effect and DECL is not a type
17857 decl, then type is non existent. */
17859 ;
17861 {
17865 /* If the next token is a semicolon, this must be a specialization,
17866 instantiation, or friend declaration. Check the scope while we
17867 still know whether or not we had a nested-name-specifier. */
17872 }
17875 }
17878 {
17883 {
17886 }
17888 /* For a `typename', we needn't call xref_tag. */
17894 /* Template parameter lists apply only if we are not within a
17895 function parameter list. */
17896 bool template_parm_lists_apply
17905 /* Look up a qualified name in the usual way. */
17907 {
17908 tree decl;
17909 tree ambiguous_decls;
17912 tag_type,
17919 /* If the lookup was ambiguous, an error will already have been
17920 issued. */
17924 /* If we are parsing friend declaration, DECL may be a
17925 TEMPLATE_DECL tree node here. However, we need to check
17926 whether this TEMPLATE_DECL results in valid code. Consider
17927 the following example:
17929 namespace N {
17930 template <class T> class C {};
17931 }
17932 class X {
17933 template <class T> friend class N::C; // #1, valid code
17934 };
17935 template <class T> class Y {
17936 friend class N::C; // #2, invalid code
17937 };
17939 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17940 name lookup of `N::C'. We see that friend declaration must
17941 be template for the code to be valid. Note that
17942 processing_template_decl does not work here since it is
17943 always 1 for the above two cases. */
17945 decl = (cp_parser_maybe_treat_template_as_class
17950 {
17952 identifier,
17955 }
17958 {
17962 allow_template);
17966 }
17968 /* Forward declarations of nested types, such as
17970 class C1::C2;
17971 class C1::C2::C3;
17973 are invalid unless all components preceding the final '::'
17974 are complete. If all enclosing types are complete, these
17975 declarations become merely pointless.
17977 Invalid forward declarations of nested types are errors
17978 caught elsewhere in parsing. Those that are pointless arrive
17979 here. */
17986 }
17987 else
17988 {
17989 /* An elaborated-type-specifier sometimes introduces a new type and
17990 sometimes names an existing type. Normally, the rule is that it
17991 introduces a new type only if there is not an existing type of
17992 the same name already in scope. For example, given:
17994 struct S {};
17995 void f() { struct S s; }
17997 the `struct S' in the body of `f' is the same `struct S' as in
17998 the global scope; the existing definition is used. However, if
17999 there were no global declaration, this would introduce a new
18000 local class named `S'.
18002 An exception to this rule applies to the following code:
18004 namespace N { struct S; }
18006 Here, the elaborated-type-specifier names a new type
18007 unconditionally; even if there is already an `S' in the
18008 containing scope this declaration names a new type.
18009 This exception only applies if the elaborated-type-specifier
18010 forms the complete declaration:
18012 [class.name]
18014 A declaration consisting solely of `class-key identifier ;' is
18015 either a redeclaration of the name in the current scope or a
18016 forward declaration of the identifier as a class name. It
18017 introduces the name into the current scope.
18019 We are in this situation precisely when the next token is a `;'.
18021 An exception to the exception is that a `friend' declaration does
18022 *not* name a new type; i.e., given:
18024 struct S { friend struct T; };
18026 `T' is not a new type in the scope of `S'.
18028 Also, `new struct S' or `sizeof (struct S)' never results in the
18029 definition of a new type; a new type can only be declared in a
18030 declaration context. */
18032 tag_scope ts;
18036 /* Friends have special name lookup rules. */
18040 CPP_SEMICOLON))
18041 /* This is a `class-key identifier ;' */
18043 else
18046 template_p =
18047 (template_parm_lists_apply
18050 /* An unqualified name was used to reference this type, so
18051 there were no qualifying templates. */
18060 }
18061 }
18066 /* Allow attributes on forward declarations of classes. */
18068 {
18078 else
18081 }
18084 {
18085 /* Indicate whether this class was declared as a `class' or as a
18086 `struct'. */
18090 }
18092 /* A "<" cannot follow an elaborated type specifier. If that
18093 happens, the user was probably trying to form a template-id. */
18098 }
18100 /* Parse an enum-specifier.
18102 enum-specifier:
18103 enum-head { enumerator-list [opt] }
18104 enum-head { enumerator-list , } [C++0x]
18106 enum-head:
18107 enum-key identifier [opt] enum-base [opt]
18108 enum-key nested-name-specifier identifier enum-base [opt]
18110 enum-key:
18111 enum
18112 enum class [C++0x]
18113 enum struct [C++0x]
18115 enum-base: [C++0x]
18116 : type-specifier-seq
18118 opaque-enum-specifier:
18119 enum-key identifier enum-base [opt] ;
18121 GNU Extensions:
18122 enum-key attributes[opt] identifier [opt] enum-base [opt]
18123 { enumerator-list [opt] }attributes[opt]
18124 enum-key attributes[opt] identifier [opt] enum-base [opt]
18125 { enumerator-list, }attributes[opt] [C++0x]
18127 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18128 if the token stream isn't an enum-specifier after all. */
18130 static tree
18132 {
18133 tree identifier;
18135 tree prev_scope;
18137 tree attributes;
18150 /* Parse tentatively so that we can back up if we don't find a
18151 enum-specifier. */
18154 /* Caller guarantees that the current token is 'enum', an identifier
18155 possibly follows, and the token after that is an opening brace.
18156 If we don't have an identifier, fabricate an anonymous name for
18157 the enumeration being defined. */
18160 /* Parse the "class" or "struct", which indicates a scoped
18161 enumeration type in C++0x. */
18164 {
18168 /* Consume the `struct' or `class' token. */
18172 }
18176 /* Clear the qualification. */
18181 /* Figure out in what scope the declaration is being placed. */
18187 nested_name_specifier
18195 {
18196 tree name;
18200 enum_type,
18205 input_location);
18207 {
18210 {
18211 /* Are template enums allowed in ISO? */
18215 /* ignore a typename reference, for it will be solved by name
18216 in start_enum. */
18218 }
18219 }
18222 else
18223 {
18228 }
18229 }
18230 else
18231 {
18234 else
18235 {
18241 }
18242 }
18245 /* Check for the `:' that denotes a specified underlying type in C++0x.
18246 Note that a ':' could also indicate a bitfield width, however. */
18248 {
18249 cp_decl_specifier_seq type_specifiers;
18251 /* Consume the `:'. */
18254 /* Parse the type-specifier-seq. */
18259 /* At this point this is surely not elaborated type specifier. */
18268 /* If that didn't work, stop. */
18270 {
18276 }
18277 }
18279 /* Look for the `{' but don't consume it yet. */
18281 {
18283 {
18286 {
18289 }
18290 }
18291 /* An opaque-enum-specifier must have a ';' here. */
18294 {
18297 {
18300 }
18301 }
18302 }
18308 {
18310 {
18314 }
18316 {
18318 }
18319 }
18321 /* Issue an error message if type-definitions are forbidden here. */
18324 else
18325 /* Create the new type. We do this before consuming the opening
18326 brace so the enum will be recorded as being on the line of its
18327 tag (or the 'enum' keyword, if there is no tag). */
18331 /* If the next token is not '{' it is an opaque-enum-specifier or an
18332 elaborated-type-specifier. */
18334 {
18338 {
18339 /* The following catches invalid code such as:
18340 enum class S<int>::E { A, B, C }; */
18348 {
18352 nested_name_specifier);
18354 }
18357 {
18359 "%qT for enum declaration does not name a class "
18362 }
18363 /* If that scope does not contain the scope in which the
18364 class was originally declared, the program is invalid. */
18366 nested_name_specifier))
18367 {
18370 "declaration of %qD in namespace %qD which does not "
18373 else
18375 "declaration of %qD in %qD which does not "
18379 }
18380 /* If that scope is the scope where the declaration is being placed
18381 the program is invalid. */
18385 {
18389 }
18390 }
18395 /* Consume the opening brace. */
18396 matching_braces braces;
18403 {
18407 }
18408 else
18409 {
18415 }
18419 /* If the next token is not '}', then there are some enumerators. */
18421 {
18425 }
18426 else
18429 /* Consume the final '}'. */
18435 }
18436 else
18437 {
18438 /* If a ';' follows, then it is an opaque-enum-specifier
18439 and additional restrictions apply. */
18441 {
18448 }
18449 }
18451 /* Look for trailing attributes to apply to this enumeration, and
18452 apply them if appropriate. */
18454 {
18457 trailing_attr,
18459 }
18461 /* Finish up the enumeration. */
18463 {
18468 }
18471 {
18473 {
18476 }
18478 {
18480 }
18481 }
18482 out:
18485 }
18487 /* Parse an enumerator-list. The enumerators all have the indicated
18488 TYPE.
18490 enumerator-list:
18491 enumerator-definition
18492 enumerator-list , enumerator-definition */
18494 static void
18496 {
18498 {
18499 /* Parse an enumerator-definition. */
18502 /* If the next token is not a ',', we've reached the end of
18503 the list. */
18506 /* Otherwise, consume the `,' and keep going. */
18508 /* If the next token is a `}', there is a trailing comma. */
18510 {
18515 }
18516 }
18517 }
18519 /* Parse an enumerator-definition. The enumerator has the indicated
18520 TYPE.
18522 enumerator-definition:
18523 enumerator
18524 enumerator = constant-expression
18526 enumerator:
18527 identifier
18529 GNU Extensions:
18531 enumerator-definition:
18532 enumerator attributes [opt]
18533 enumerator attributes [opt] = constant-expression */
18535 static void
18537 {
18538 tree identifier;
18539 tree value;
18540 location_t loc;
18542 /* Save the input location because we are interested in the location
18543 of the identifier and not the location of the explicit value. */
18546 /* Look for the identifier. */
18551 /* Parse any specified attributes. */
18554 /* If the next token is an '=', then there is an explicit value. */
18556 {
18557 /* Consume the `=' token. */
18559 /* Parse the value. */
18561 }
18562 else
18565 /* If we are processing a template, make sure the initializer of the
18566 enumerator doesn't contain any bare template parameter pack. */
18570 /* Create the enumerator. */
18572 }
18574 /* Parse a namespace-name.
18576 namespace-name:
18577 original-namespace-name
18578 namespace-alias
18580 Returns the NAMESPACE_DECL for the namespace. */
18582 static tree
18584 {
18585 tree identifier;
18586 tree namespace_decl;
18590 /* Get the name of the namespace. */
18595 /* Look up the identifier in the currently active scope. Look only
18596 for namespaces, due to:
18598 [basic.lookup.udir]
18600 When looking up a namespace-name in a using-directive or alias
18601 definition, only namespace names are considered.
18603 And:
18605 [basic.lookup.qual]
18607 During the lookup of a name preceding the :: scope resolution
18608 operator, object, function, and enumerator names are ignored.
18610 (Note that cp_parser_qualifying_entity only calls this
18611 function if the token after the name is the scope resolution
18612 operator.) */
18614 none_type,
18620 /* If it's not a namespace, issue an error. */
18623 {
18625 {
18626 auto_diagnostic_group d;
18632 }
18635 }
18638 }
18640 /* Parse a namespace-definition.
18642 namespace-definition:
18643 named-namespace-definition
18644 unnamed-namespace-definition
18646 named-namespace-definition:
18647 original-namespace-definition
18648 extension-namespace-definition
18650 original-namespace-definition:
18651 namespace identifier { namespace-body }
18653 extension-namespace-definition:
18654 namespace original-namespace-name { namespace-body }
18656 unnamed-namespace-definition:
18657 namespace { namespace-body } */
18659 static void
18661 {
18662 tree identifier;
18671 {
18674 }
18676 /* Look for the `namespace' keyword. */
18677 cp_token* token
18680 /* Parse any specified attributes before the identifier. */
18684 {
18688 {
18693 "standard attributes on namespaces must precede "
18696 /* Parse any attributes specified after the identifier. */
18698 }
18705 "nested namespace definitions only available with "
18708 /* Nested namespace names can create new namespaces (unlike
18709 other qualified-ids). */
18712 else
18715 }
18727 /* Start the namespace. */
18734 /* Look for the `{' to validate starting the namespace. */
18735 matching_braces braces;
18737 {
18738 /* Parse the body of the namespace. */
18741 /* Look for the final `}'. */
18743 }
18748 /* Pop the nested namespace definitions. */
18751 }
18753 /* Parse a namespace-body.
18755 namespace-body:
18756 declaration-seq [opt] */
18758 static void
18760 {
18762 }
18764 /* Parse a namespace-alias-definition.
18766 namespace-alias-definition:
18767 namespace identifier = qualified-namespace-specifier ; */
18769 static void
18771 {
18772 tree identifier;
18773 tree namespace_specifier;
18777 /* Look for the `namespace' keyword. */
18779 /* Look for the identifier. */
18783 /* Look for the `=' token. */
18786 {
18788 /* Skip the definition. */
18793 }
18795 /* Look for the qualified-namespace-specifier. */
18796 namespace_specifier
18798 /* Look for the `;' token. */
18801 /* Register the alias in the symbol table. */
18803 }
18805 /* Parse a qualified-namespace-specifier.
18807 qualified-namespace-specifier:
18808 :: [opt] nested-name-specifier [opt] namespace-name
18810 Returns a NAMESPACE_DECL corresponding to the specified
18811 namespace. */
18813 static tree
18815 {
18816 /* Look for the optional `::'. */
18820 /* Look for the optional nested-name-specifier. */
18828 }
18830 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18831 access declaration.
18833 using-declaration:
18834 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18835 using :: unqualified-id ;
18837 access-declaration:
18838 qualified-id ;
18840 */
18842 static bool
18845 {
18849 tree decl;
18850 tree identifier;
18851 tree qscope;
18856 {
18859 }
18860 else
18861 {
18862 /* Look for the `using' keyword. */
18865 again:
18866 /* Peek at the next token. */
18868 /* See if it's `typename'. */
18870 {
18871 /* Remember that we've seen it. */
18873 /* Consume the `typename' token. */
18875 }
18876 }
18878 /* Look for the optional global scope qualification. */
18879 global_scope_p
18884 /* If we saw `typename', or didn't see `::', then there must be a
18885 nested-name-specifier present. */
18887 {
18893 {
18896 }
18897 }
18898 /* Otherwise, we could be in either of the two productions. In that
18899 case, treat the nested-name-specifier as optional. */
18900 else
18912 /* Something has already gone wrong; there's no need to parse
18913 further. Since an error has occurred, the return value of
18914 cp_parser_parse_definitely will be false, as required. */
18918 /* Parse the unqualified-id. */
18926 {
18931 }
18933 {
18938 "pack expansion in using-declaration only available "
18941 }
18943 /* The function we call to handle a using-declaration is different
18944 depending on what scope we are in. */
18946 ;
18949 /* [namespace.udecl]
18951 A using declaration shall not name a template-id. */
18954 else
18955 {
18957 {
18958 /* Create the USING_DECL. */
18965 {
18968 }
18969 else
18970 /* Add it to the list of members in this class. */
18972 }
18973 else
18974 {
18976 identifier,
18983 {
18986 }
18989 else
18991 }
18992 }
18996 {
19000 "comma-separated list in using-declaration only available "
19003 }
19005 /* Look for the final `;'. */
19010 "access declarations are deprecated "
19011 "in favour of using-declarations; "
19015 }
19017 /* Parse an alias-declaration.
19019 alias-declaration:
19020 using identifier attribute-specifier-seq [opt] = type-id */
19022 static tree
19024 {
19026 location_t id_location;
19028 cp_decl_specifier_seq decl_specs;
19032 /* Look for the `using' keyword. */
19033 cp_token *using_token
19055 /* Now we are going to parse the type-id of the declaration. */
19057 /*
19058 [dcl.type]/3 says:
19060 "A type-specifier-seq shall not define a class or enumeration
19061 unless it appears in the type-id of an alias-declaration (7.1.3) that
19062 is not the declaration of a template-declaration."
19064 In other words, if we currently are in an alias template, the
19065 type-id should not define a type.
19067 So let's set parser->type_definition_forbidden_message in that
19068 case; cp_parser_check_type_definition (called by
19069 cp_parser_class_specifier) will then emit an error if a type is
19070 defined in the type-id. */
19072 {
19076 }
19080 /* Restore the error message if need be. */
19086 {
19089 }
19091 /* A typedef-name can also be introduced by an alias-declaration. The
19092 identifier following the using keyword becomes a typedef-name. It has
19093 the same semantics as if it were introduced by the typedef
19094 specifier. In particular, it does not define a new type and it shall
19095 not appear in the type-id. */
19100 {
19103 ds_attribute,
19104 attrs_token);
19105 }
19107 ds_typedef,
19108 using_token);
19110 ds_alias,
19111 using_token);
19117 id_location,
19128 else
19134 // Attach constraints to the alias declaration.
19136 {
19140 }
19147 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19148 added into the symbol table; otherwise, return the TYPE_DECL. */
19152 {
19156 }
19159 }
19161 /* Parse a using-directive.
19163 using-directive:
19164 using namespace :: [opt] nested-name-specifier [opt]
19165 namespace-name ; */
19167 static void
19169 {
19170 tree namespace_decl;
19171 tree attribs;
19173 /* Look for the `using' keyword. */
19175 /* And the `namespace' keyword. */
19177 /* Look for the optional `::' operator. */
19179 /* And the optional nested-name-specifier. */
19185 /* Get the namespace being used. */
19187 /* And any specified attributes. */
19190 /* Update the symbol table. */
19193 else
19196 /* Look for the final `;'. */
19198 }
19200 /* Parse an asm-definition.
19202 asm-definition:
19203 asm ( string-literal ) ;
19205 GNU Extension:
19207 asm-definition:
19208 asm volatile [opt] ( string-literal ) ;
19209 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19210 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19211 : asm-operand-list [opt] ) ;
19212 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19213 : asm-operand-list [opt]
19214 : asm-clobber-list [opt] ) ;
19215 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19216 : asm-clobber-list [opt]
19217 : asm-goto-list ) ; */
19219 static void
19221 {
19222 tree string;
19227 tree asm_stmt;
19235 /* Look for the `asm' keyword. */
19240 {
19243 }
19245 /* See if the next token is `volatile'. */
19248 {
19249 /* Remember that we saw the `volatile' keyword. */
19251 /* Consume the token. */
19253 }
19257 {
19258 /* Remember that we saw the `goto' keyword. */
19260 /* Consume the token. */
19262 }
19263 /* Look for the opening `('. */
19266 /* Look for the string. */
19269 {
19273 }
19275 /* If we're allowing GNU extensions, check for the extended assembly
19276 syntax. Unfortunately, the `:' tokens need not be separated by
19277 a space in C, and so, for compatibility, we tolerate that here
19278 too. Doing that means that we have to treat the `::' operator as
19279 two `:' tokens. */
19284 {
19289 /* The extended syntax was used. */
19292 /* Look for outputs. */
19294 {
19295 /* Consume the `:'. */
19297 /* Parse the output-operands. */
19299 CPP_COLON)
19301 CPP_SCOPE)
19303 CPP_CLOSE_PAREN)
19305 {
19309 }
19310 }
19311 /* If the next token is `::', there are no outputs, and the
19312 next token is the beginning of the inputs. */
19314 /* The inputs are coming next. */
19317 /* Look for inputs. */
19320 {
19321 /* Consume the `:' or `::'. */
19323 /* Parse the output-operands. */
19325 CPP_COLON)
19327 CPP_SCOPE)
19329 CPP_CLOSE_PAREN))
19330 {
19334 }
19335 }
19337 /* The clobbers are coming next. */
19340 /* Look for clobbers. */
19343 {
19345 /* Consume the `:' or `::'. */
19347 /* Parse the clobbers. */
19349 CPP_COLON)
19351 CPP_CLOSE_PAREN))
19353 }
19356 /* The labels are coming next. */
19359 /* Look for labels. */
19362 {
19364 /* Consume the `:' or `::'. */
19366 /* Parse the labels. */
19368 }
19372 }
19376 /* Look for the closing `)'. */
19384 {
19385 /* Create the ASM_EXPR. */
19387 {
19390 /* If the extended syntax was not used, mark the ASM_EXPR. */
19392 {
19398 }
19399 }
19400 else
19402 }
19403 }
19405 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19406 type that comes from the decl-specifier-seq. */
19408 static tree
19410 {
19413 {
19426 }
19429 }
19431 /* Declarators [gram.dcl.decl] */
19433 /* Parse an init-declarator.
19435 init-declarator:
19436 declarator initializer [opt]
19438 GNU Extension:
19440 init-declarator:
19441 declarator asm-specification [opt] attributes [opt] initializer [opt]
19443 function-definition:
19444 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19445 function-body
19446 decl-specifier-seq [opt] declarator function-try-block
19448 GNU Extension:
19450 function-definition:
19451 __extension__ function-definition
19453 TM Extension:
19455 function-definition:
19456 decl-specifier-seq [opt] declarator function-transaction-block
19458 The DECL_SPECIFIERS apply to this declarator. Returns a
19459 representation of the entity declared. If MEMBER_P is TRUE, then
19460 this declarator appears in a class scope. The new DECL created by
19461 this declarator is returned.
19463 The CHECKS are access checks that should be performed once we know
19464 what entity is being declared (and, therefore, what classes have
19465 befriended it).
19467 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19468 for a function-definition here as well. If the declarator is a
19469 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19470 be TRUE upon return. By that point, the function-definition will
19471 have been completely parsed.
19473 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19474 is FALSE.
19476 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19477 parsed declaration if it is an uninitialized single declarator not followed
19478 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19479 if present, will not be consumed. If returned, this declarator will be
19480 created with SD_INITIALIZED but will not call cp_finish_decl.
19482 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19483 and there is an initializer, the pointed location_t is set to the
19484 location of the '=' or `(', or '{' in C++11 token introducing the
19485 initializer. */
19487 static tree
19498 {
19502 tree prefix_attributes;
19504 tree asm_specification;
19505 tree initializer;
19507 tree scope;
19509 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19510 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19511 "(...)". */
19522 /* Gather the attributes that were provided with the
19523 decl-specifiers. */
19526 /* Assume that this is not the declarator for a function
19527 definition. */
19531 /* Default arguments are only permitted for function parameters. */
19535 /* Defer access checks while parsing the declarator; we cannot know
19536 what names are accessible until we know what is being
19537 declared. */
19542 /* Parse the declarator. */
19543 declarator
19548 /* Gather up the deferred checks. */
19553 /* If the DECLARATOR was erroneous, there's no need to go
19554 further. */
19558 /* Check that the number of template-parameter-lists is OK. */
19568 /* Figure out what scope the entity declared by the DECLARATOR is
19569 located in. `grokdeclarator' sometimes changes the scope, so
19570 we compute it now. */
19573 /* Perform any lookups in the declared type which were thought to be
19574 dependent, but are not in the scope of the declarator. */
19575 decl_specifiers->type
19578 /* If we're allowing GNU extensions, look for an
19579 asm-specification. */
19581 {
19582 /* Look for an asm-specification. */
19585 }
19586 else
19589 /* Look for attributes. */
19593 /* Peek at the next token. */
19599 {
19600 /* Handle C++17 deduction guides. */
19604 {
19612 {
19616 }
19617 }
19619 /* Check to see if the token indicates the start of a
19620 function-definition. */
19622 {
19624 {
19625 /* If a function-definition should not appear here, issue an
19626 error message. */
19630 }
19632 location_t func_brace_location
19635 /* Neither attributes nor an asm-specification are allowed
19636 on a function-definition. */
19639 "an asm-specification is not allowed "
19643 "attributes are not allowed "
19645 /* This is a function-definition. */
19648 /* Parse the function definition. */
19651 decl_specifiers,
19652 declarator,
19653 prefix_attributes);
19654 else
19655 decl =
19656 (cp_parser_function_definition_from_specifiers_and_declarator
19660 {
19661 /* This is where the prologue starts... */
19664 }
19667 }
19668 }
19670 {
19671 /* A non-template declaration involving a function parameter list
19672 containing an implicit template parameter will be made into a
19673 template. If the resulting declaration is not going to be an
19674 actual function then finish the template scope here to prevent it.
19675 An error message will be issued once we have a decl to talk about.
19677 FIXME probably we should do type deduction rather than create an
19678 implicit template, but the standard currently doesn't allow it. */
19681 }
19683 /* [dcl.dcl]
19685 Only in function declarations for constructors, destructors, type
19686 conversions, and deduction guides can the decl-specifier-seq be omitted.
19688 We explicitly postpone this check past the point where we handle
19689 function-definitions because we tolerate function-definitions
19690 that are missing their return types in some modes. */
19692 {
19696 }
19698 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19702 {
19713 {
19719 }
19720 }
19721 else
19722 {
19723 /* If the init-declarator isn't initialized and isn't followed by a
19724 `,' or `;', it's not a valid init-declarator. */
19727 {
19730 else
19731 {
19735 }
19736 }
19739 }
19741 /* Because start_decl has side-effects, we should only call it if we
19742 know we're going ahead. By this point, we know that we cannot
19743 possibly be looking at any other construct. */
19746 /* Enter the newly declared entry in the symbol table. If we're
19747 processing a declaration in a class-specifier, we wait until
19748 after processing the initializer. */
19750 {
19758 /* Adjust location of decl if declarator->id_loc is more appropriate:
19759 set, and decl wasn't merged with another decl, in which case its
19760 location would be different from input_location, and more accurate. */
19765 }
19767 /* Enter the SCOPE. That way unqualified names appearing in the
19768 initializer will be looked up in SCOPE. */
19771 /* Perform deferred access control checks, now that we know in which
19772 SCOPE the declared entity resides. */
19774 {
19777 /* If the entity being declared is a function, pretend that we
19778 are in its scope. If it is a `friend', it may have access to
19779 things that would not otherwise be accessible. */
19781 {
19784 }
19786 /* Perform access checks for template parameters. */
19789 /* Perform the access control checks for the declarator and the
19790 decl-specifiers. */
19793 /* Restore the saved value. */
19796 }
19798 /* Parse the initializer. */
19803 {
19805 {
19808 else
19809 {
19810 /* If the declaration was erroneous, we don't really
19811 know what the user intended, so just silently
19812 consume the initializer. */
19819 }
19820 }
19821 else
19822 {
19823 /* We want to record the extra mangling scope for in-class
19824 initializers of class members and initializers of static data
19825 member templates. The former involves deferring
19826 parsing of the initializer until end of class as with default
19827 arguments. So right here we only handle the latter. */
19837 }
19838 }
19840 /* The old parser allows attributes to appear after a parenthesized
19841 initializer. Mark Mitchell proposed removing this functionality
19842 on the GCC mailing lists on 2002-08-13. This parser accepts the
19843 attributes -- but ignores them. Made a permerror in GCC 8. */
19849 {
19852 {
19856 }
19857 }
19859 /* And now complain about a non-function implicit template. */
19864 /* For an in-class declaration, use `grokfield' to create the
19865 declaration. */
19867 {
19869 {
19872 }
19881 }
19883 /* Finish processing the declaration. But, skip member
19884 declarations. */
19886 {
19889 asm_specification,
19890 /* If the initializer is in parentheses, then this is
19891 a direct-initialization, which means that an
19892 `explicit' constructor is OK. Otherwise, an
19893 `explicit' constructor cannot be used. */
19896 }
19899 /* Core issue #226 (C++0x only): A default template-argument
19900 shall not be specified in a friend class template
19901 declaration. */
19910 {
19913 else
19915 }
19922 }
19924 /* Parse a declarator.
19926 declarator:
19927 direct-declarator
19928 ptr-operator declarator
19930 abstract-declarator:
19931 ptr-operator abstract-declarator [opt]
19932 direct-abstract-declarator
19934 GNU Extensions:
19936 declarator:
19937 attributes [opt] direct-declarator
19938 attributes [opt] ptr-operator declarator
19940 abstract-declarator:
19941 attributes [opt] ptr-operator abstract-declarator [opt]
19942 attributes [opt] direct-abstract-declarator
19944 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19945 detect constructors, destructors, deduction guides, or conversion operators.
19946 It is set to -1 if the declarator is a name, and +1 if it is a
19947 function. Otherwise it is set to zero. Usually you just want to
19948 test for >0, but internally the negative value is used.
19950 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19951 a decl-specifier-seq unless it declares a constructor, destructor,
19952 or conversion. It might seem that we could check this condition in
19953 semantic analysis, rather than parsing, but that makes it difficult
19954 to handle something like `f()'. We want to notice that there are
19955 no decl-specifiers, and therefore realize that this is an
19956 expression, not a declaration.)
19958 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19959 the declarator is a direct-declarator of the form "(...)".
19961 MEMBER_P is true iff this declarator is a member-declarator.
19963 FRIEND_P is true iff this declarator is a friend. */
19967 cp_parser_declarator_kind dcl_kind,
19971 {
19974 cp_cv_quals cv_quals;
19975 tree class_type;
19978 /* Assume this is not a constructor, destructor, or type-conversion
19979 operator. */
19986 /* Check for the ptr-operator production. */
19988 /* Parse the ptr-operator. */
19994 /* If that worked, then we have a ptr-operator. */
19996 {
19997 /* If a ptr-operator was found, then this declarator was not
19998 parenthesized. */
20001 /* The dependent declarator is optional if we are parsing an
20002 abstract-declarator. */
20006 /* Parse the dependent declarator. */
20011 friend_p);
20013 /* If we are parsing an abstract-declarator, we must handle the
20014 case where the dependent declarator is absent. */
20019 declarator = cp_parser_make_indirect_declarator
20021 }
20022 /* Everything else is a direct-declarator. */
20023 else
20024 {
20027 CPP_OPEN_PAREN);
20029 ctor_dtor_or_conv_p,
20031 }
20036 }
20038 /* Parse a direct-declarator or direct-abstract-declarator.
20040 direct-declarator:
20041 declarator-id
20042 direct-declarator ( parameter-declaration-clause )
20043 cv-qualifier-seq [opt]
20044 ref-qualifier [opt]
20045 exception-specification [opt]
20046 direct-declarator [ constant-expression [opt] ]
20047 ( declarator )
20049 direct-abstract-declarator:
20050 direct-abstract-declarator [opt]
20051 ( parameter-declaration-clause )
20052 cv-qualifier-seq [opt]
20053 ref-qualifier [opt]
20054 exception-specification [opt]
20055 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20056 ( abstract-declarator )
20058 Returns a representation of the declarator. DCL_KIND is
20059 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20060 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20061 we are parsing a direct-declarator. It is
20062 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20063 of ambiguity we prefer an abstract declarator, as per
20064 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20065 as for cp_parser_declarator. */
20069 cp_parser_declarator_kind dcl_kind,
20072 {
20083 {
20084 /* Peek at the next token. */
20087 {
20088 /* This is either a parameter-declaration-clause, or a
20089 parenthesized declarator. When we know we are parsing a
20090 named declarator, it must be a parenthesized declarator
20091 if FIRST is true. For instance, `(int)' is a
20092 parameter-declaration-clause, with an omitted
20093 direct-abstract-declarator. But `((*))', is a
20094 parenthesized abstract declarator. Finally, when T is a
20095 template parameter `(T)' is a
20096 parameter-declaration-clause, and not a parenthesized
20097 named declarator.
20099 We first try and parse a parameter-declaration-clause,
20100 and then try a nested declarator (if FIRST is true).
20102 It is not an error for it not to be a
20103 parameter-declaration-clause, even when FIRST is
20104 false. Consider,
20106 int i (int);
20107 int i (3);
20109 The first is the declaration of a function while the
20110 second is the definition of a variable, including its
20111 initializer.
20113 Having seen only the parenthesis, we cannot know which of
20114 these two alternatives should be selected. Even more
20115 complex are examples like:
20117 int i (int (a));
20118 int i (int (3));
20120 The former is a function-declaration; the latter is a
20121 variable initialization.
20123 Thus again, we try a parameter-declaration-clause, and if
20124 that fails, we back out and return. */
20127 {
20128 tree params;
20133 /* In a member-declarator, the only valid interpretation
20134 of a parenthesis is the start of a
20135 parameter-declaration-clause. (It is invalid to
20136 initialize a static data member with a parenthesized
20137 initializer; only the "=" form of initialization is
20138 permitted.) */
20142 /* Consume the `('. */
20143 matching_parens parens;
20146 {
20147 /* If this is going to be an abstract declarator, we're
20148 in a declarator and we can't have default args. */
20151 }
20155 /* Parse the parameter-declaration-clause. */
20158 /* Consume the `)'. */
20161 /* If all went well, parse the cv-qualifier-seq,
20162 ref-qualifier and the exception-specification. */
20164 {
20165 cp_cv_quals cv_quals;
20166 cp_virt_specifiers virt_specifiers;
20167 cp_ref_qualifier ref_qual;
20168 tree exception_specification;
20169 tree late_return;
20170 tree attrs;
20180 /* Parse the cv-qualifier-seq. */
20182 /* Parse the ref-qualifier. */
20184 /* Parse the tx-qualifier. */
20186 /* And the exception-specification. */
20187 exception_specification
20192 /* In here, we handle cases where attribute is used after
20193 the function declaration. For example:
20194 void func (int x) __attribute__((vector(..))); */
20197 late_return = (cp_parser_late_return_type_opt
20201 /* Parse the virt-specifier-seq. */
20204 /* Create the function-declarator. */
20206 params,
20207 cv_quals,
20208 virt_specifiers,
20209 ref_qual,
20210 tx_qual,
20211 exception_specification,
20212 late_return,
20213 requires_clause);
20216 /* Any subsequent parameter lists are to do with
20217 return type, so are not those of the declared
20218 function. */
20220 }
20222 /* Remove the function parms from scope. */
20226 /* Repeat the main loop. */
20228 }
20230 /* If this is the first, we can try a parenthesized
20231 declarator. */
20233 {
20240 /* Consume the `('. */
20241 matching_parens parens;
20243 /* Parse the nested declarator. */
20246 declarator
20252 /* Expect a `)'. */
20260 }
20261 /* Otherwise, we must be done. */
20262 else
20264 }
20268 {
20269 /* Parse an array-declarator. */
20279 /* Consume the `['. */
20281 /* Peek at the next token. */
20283 /* If the next token is `]', then there is no
20284 constant-expression. */
20286 {
20288 bounds
20298 {
20299 /* Normally, the array bound must be an integral constant
20300 expression. However, as an extension, we allow VLAs
20301 in function scopes as long as they aren't part of a
20302 parameter declaration. */
20306 }
20309 {
20310 /* Remember this wasn't a constant-expression. */
20313 }
20314 }
20315 else
20317 /* Look for the closing `]'. */
20319 {
20322 }
20327 }
20329 {
20330 {
20331 tree qualifying_scope;
20332 tree unqualified_name;
20333 tree attrs;
20334 special_function_kind sfk;
20339 /* Parse a declarator-id */
20342 {
20345 /* If we see an ellipsis, we should be looking at a
20346 parameter pack. */
20348 {
20349 /* Consume the `...' */
20353 }
20354 }
20357 unqualified_name
20361 {
20365 {
20366 /* Check whether an error occurred. */
20369 /* We already consumed the ellipsis to mark a
20370 parameter pack, but we have no way to report it,
20371 so abort the tentative parse. We will be exiting
20372 immediately anyway. */
20374 }
20375 else
20381 && (qualifying_scope
20383 {
20386 }
20387 }
20392 {
20397 }
20403 {
20404 /* In the declaration of a member of a template class
20405 outside of the class itself, the SCOPE will sometimes
20406 be a TYPENAME_TYPE. For example, given:
20408 template <typename T>
20409 int S<T>::R::i = 3;
20411 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20412 this context, we must resolve S<T>::R to an ordinary
20413 type, rather than a typename type.
20415 The reason we normally avoid resolving TYPENAME_TYPEs
20416 is that a specialization of `S' might render
20417 `S<T>::R' not a type. However, if `S' is
20418 specialized, then this `i' will not be used, so there
20419 is no harm in resolving the types here. */
20420 tree type;
20422 /* Resolve the TYPENAME_TYPE. */
20425 /* If that failed, the declarator is invalid. */
20427 {
20430 "cannot define member of dependent typedef "
20432 else
20437 }
20439 }
20444 {
20445 tree class_type;
20450 else
20454 {
20458 {
20459 /* We do not attempt to print the declarator
20460 here because we do not have enough
20461 information about its original syntactic
20462 form. */
20466 }
20469 {
20473 "use %<%T::%D%> instead of %<%T::%D%> to "
20475 class_type,
20480 }
20482 }
20485 {
20492 for an unnamed type, even if the type
20493 got a name for linkage purposes. */
20495 /* Handle correctly (c++/19200):
20497 struct S {
20498 struct T{};
20499 friend void S(T);
20500 };
20502 and also:
20504 namespace N {
20505 void S();
20506 }
20508 struct S {
20509 friend void N::S();
20510 }; */
20513 class_type))
20522 }
20523 }
20525 unqualified_name,
20526 sfk);
20533 }
20535 handle_declarator:;
20538 {
20539 /* Any names that appear after the declarator-id for a
20540 member are looked up in the containing scope. */
20542 {
20543 /* But declarations with qualified-ids can't appear in a
20544 function. */
20548 }
20550 }
20554 /* Default args are only allowed on function
20555 declarations. */
20557 else
20561 }
20562 /* We're done. */
20563 else
20565 }
20567 /* For an abstract declarator, we might wind up with nothing at this
20568 point. That's an error; the declarator is not optional. */
20572 {
20573 /* Record overly parenthesized declarator so we can give a
20574 diagnostic about confusing decl/expr disambiguation. */
20576 {
20577 /* If the open and close parens are on different lines, this
20578 is probably a formatting thing, so ignore. */
20583 }
20586 }
20588 /* If we entered a scope, we must exit it now. */
20596 }
20598 /* Parse a ptr-operator.
20600 ptr-operator:
20601 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20602 * cv-qualifier-seq [opt]
20603 &
20604 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20605 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20607 GNU Extension:
20609 ptr-operator:
20610 & cv-qualifier-seq [opt]
20612 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20613 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20614 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20615 filled in with the TYPE containing the member. *CV_QUALS is
20616 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20617 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20618 Note that the tree codes returned by this function have nothing
20619 to do with the types of trees that will be eventually be created
20620 to represent the pointer or reference type being parsed. They are
20621 just constants with suggestive names. */
20622 static enum tree_code
20627 {
20632 /* Assume that it's not a pointer-to-member. */
20634 /* And that there are no cv-qualifiers. */
20637 /* Peek at the next token. */
20640 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20650 {
20651 /* Consume the `*', `&' or `&&'. */
20654 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20655 `&', if we are allowing GNU extensions. (The only qualifier
20656 that can legally appear after `&' is `restrict', but that is
20657 enforced during semantic analysis. */
20665 }
20666 else
20667 {
20668 /* Try the pointer-to-member case. */
20670 /* Look for the optional `::' operator. */
20673 /* Look for the nested-name specifier. */
20680 /* If we found it, and the next token is a `*', then we are
20681 indeed looking at a pointer-to-member operator. */
20684 {
20685 /* Indicate that the `*' operator was used. */
20693 else
20694 {
20695 /* The type of which the member is a member is given by the
20696 current SCOPE. */
20698 /* The next name will not be qualified. */
20702 /* Look for optional c++11 attributes. */
20706 /* Look for the optional cv-qualifier-seq. */
20708 }
20709 }
20710 /* If that didn't work we don't have a ptr-operator. */
20713 }
20716 }
20718 /* Parse an (optional) cv-qualifier-seq.
20720 cv-qualifier-seq:
20721 cv-qualifier cv-qualifier-seq [opt]
20723 cv-qualifier:
20724 const
20725 volatile
20727 GNU Extension:
20729 cv-qualifier:
20730 __restrict__
20732 Returns a bitmask representing the cv-qualifiers. */
20734 static cp_cv_quals
20736 {
20740 {
20742 cp_cv_quals cv_qualifier;
20744 /* Peek at the next token. */
20746 /* See if it's a cv-qualifier. */
20748 {
20764 }
20770 {
20775 }
20776 else
20777 {
20780 }
20781 }
20784 }
20786 /* Parse an (optional) ref-qualifier
20788 ref-qualifier:
20789 &
20790 &&
20792 Returns cp_ref_qualifier representing ref-qualifier. */
20794 static cp_ref_qualifier
20796 {
20799 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20804 {
20809 {
20821 }
20826 {
20829 }
20830 else
20831 {
20834 }
20835 }
20838 }
20840 /* Parse an optional tx-qualifier.
20842 tx-qualifier:
20843 transaction_safe
20844 transaction_safe_dynamic */
20846 static tree
20848 {
20851 {
20856 {
20860 {
20863 {
20866 }
20867 else
20869 }
20870 }
20871 }
20873 }
20875 /* Parse an (optional) virt-specifier-seq.
20877 virt-specifier-seq:
20878 virt-specifier virt-specifier-seq [opt]
20880 virt-specifier:
20881 override
20882 final
20884 Returns a bitmask representing the virt-specifiers. */
20886 static cp_virt_specifiers
20888 {
20892 {
20894 cp_virt_specifiers virt_specifier;
20896 /* Peek at the next token. */
20898 /* See if it's a virt-specifier-qualifier. */
20902 {
20905 }
20907 {
20910 }
20912 {
20914 }
20915 else
20919 {
20924 }
20925 else
20926 {
20929 }
20930 }
20932 }
20934 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20935 is in scope even though it isn't real. */
20937 void
20939 {
20940 tree this_parm;
20943 {
20944 /* We don't clear this between NSDMIs. Is it already what we want? */
20951 }
20954 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20956 current_class_ref
20959 }
20961 /* Return true iff our current scope is a non-static data member
20962 initializer. */
20964 bool
20966 {
20967 /* We recognize NSDMI context by the context-less 'this' pointer set up
20968 by the function above. */
20974 }
20976 /* Parse a late-specified return type, if any. This is not a separate
20977 non-terminal, but part of a function declarator, which looks like
20979 -> trailing-type-specifier-seq abstract-declarator(opt)
20981 Returns the type indicated by the type-id.
20983 In addition to this, parse any queued up #pragma omp declare simd
20984 clauses, and #pragma acc routine clauses.
20986 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20987 function. */
20989 static tree
20992 {
20996 && declarator
21000 && declarator
21003 /* Peek at the next token. */
21005 /* A late-specified return type is indicated by an initial '->'. */
21016 {
21017 /* DR 1207: 'this' is in scope in the trailing return type. */
21019 }
21022 {
21023 /* Consume the ->. */
21027 }
21029 /* Function declarations may be followed by a trailing
21030 requires-clause. */
21034 declarator->attributes
21038 declarator->attributes
21043 {
21046 }
21049 }
21051 /* Parse a declarator-id.
21053 declarator-id:
21054 id-expression
21055 :: [opt] nested-name-specifier [opt] type-name
21057 In the `id-expression' case, the value returned is as for
21058 cp_parser_id_expression if the id-expression was an unqualified-id.
21059 If the id-expression was a qualified-id, then a SCOPE_REF is
21060 returned. The first operand is the scope (either a NAMESPACE_DECL
21061 or TREE_TYPE), but the second is still just a representation of an
21062 unqualified-id. */
21064 static tree
21066 {
21067 tree id;
21068 /* The expression must be an id-expression. Assume that qualified
21069 names are the names of types so that:
21071 template <class T>
21072 int S<T>::R::i = 3;
21074 will work; we must treat `S<T>::R' as the name of a type.
21075 Similarly, assume that qualified names are templates, where
21076 required, so that:
21078 template <class T>
21079 int S<T>::R<T>::i = 3;
21081 will work, too. */
21087 optional_p);
21091 }
21093 /* Parse a type-id.
21095 type-id:
21096 type-specifier-seq abstract-declarator [opt]
21098 Returns the TYPE specified. */
21100 static tree
21103 {
21104 cp_decl_specifier_seq type_specifier_seq;
21107 /* Parse the type-specifier-seq. */
21109 is_trailing_return,
21114 /* A bare template name as a template argument is a template template
21115 argument, not a placeholder, so fail parsing it as a type argument. */
21116 {
21120 }
21124 /* There might or might not be an abstract declarator. */
21126 /* Look for the declarator. */
21127 abstract_declarator
21132 /* Check to see if there really was a declarator. */
21137 /* The concepts TS allows 'auto' as a type-id. */
21139 /* None of the valid uses of 'auto' in C++14 involve the type-id
21140 nonterminal, but it is valid in a trailing-return-type. */
21143 {
21144 /* A type-id with type 'auto' is only ok if the abstract declarator
21145 is a function declarator with a late-specified return type.
21147 A type-id with 'auto' is also valid in a trailing-return-type
21148 in a compound-requirement. */
21155 else
21156 {
21159 {
21161 auto_node);
21163 tmpl);
21164 }
21165 else
21168 }
21169 }
21172 is_template_arg);
21173 }
21175 static tree
21177 {
21179 }
21181 static tree
21183 {
21184 tree r;
21186 parser->type_definition_forbidden_message
21191 {
21194 }
21196 }
21198 static tree
21200 {
21202 }
21204 /* Parse a type-specifier-seq.
21206 type-specifier-seq:
21207 type-specifier type-specifier-seq [opt]
21209 GNU extension:
21211 type-specifier-seq:
21212 attributes type-specifier-seq [opt]
21214 If IS_DECLARATION is true, we are at the start of a "condition" or
21215 exception-declaration, so we might be followed by a declarator-id.
21217 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21218 i.e. we've just seen "->".
21220 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21222 static void
21227 {
21232 /* Clear the TYPE_SPECIFIER_SEQ. */
21235 /* In the context of a trailing return type, enum E { } is an
21236 elaborated-type-specifier followed by a function-body, not an
21237 enum-specifier. */
21241 /* Parse the type-specifiers and attributes. */
21243 {
21244 tree type_specifier;
21247 /* Check for attributes first. */
21249 {
21250 type_specifier_seq->attributes
21254 }
21256 /* record the token of the beginning of the type specifier seq,
21257 for error reporting purposes*/
21261 /* Look for the type-specifier. */
21263 flags,
21264 type_specifier_seq,
21266 NULL,
21269 {
21270 /* If the first type-specifier could not be found, this is not a
21271 type-specifier-seq at all. */
21273 {
21274 /* Set in_declarator_p to avoid skipping to the semicolon. */
21286 }
21287 /* If subsequent type-specifiers could not be found, the
21288 type-specifier-seq is complete. */
21290 }
21293 /* The standard says that a condition can be:
21295 type-specifier-seq declarator = assignment-expression
21297 However, given:
21299 struct S {};
21300 if (int S = ...)
21302 we should treat the "S" as a declarator, not as a
21303 type-specifier. The standard doesn't say that explicitly for
21304 type-specifier-seq, but it does say that for
21305 decl-specifier-seq in an ordinary declaration. Perhaps it
21306 would be clearer just to allow a decl-specifier-seq here, and
21307 then add a semantic restriction that if any decl-specifiers
21308 that are not type-specifiers appear, the program is invalid. */
21311 }
21312 }
21314 /* Return whether the function currently being declared has an associated
21315 template parameter list. */
21317 static bool
21319 {
21332 }
21334 /* Parse a parameter-declaration-clause.
21336 parameter-declaration-clause:
21337 parameter-declaration-list [opt] ... [opt]
21338 parameter-declaration-list , ...
21340 Returns a representation for the parameter declarations. A return
21341 value of NULL indicates a parameter-declaration-clause consisting
21342 only of an ellipsis. */
21344 static tree
21346 {
21347 tree parameters;
21355 && !processing_template_parmlist
21356 && !processing_explicit_instantiation
21357 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21358 actual function or a random abstract declarator. */
21364 /* Peek at the next token. */
21366 /* Check for trivial parameter-declaration-clauses. */
21368 {
21369 /* Consume the `...' token. */
21372 }
21374 /* There are no parameters. */
21375 {
21376 #ifdef SYSTEM_IMPLICIT_EXTERN_C
21381 else
21382 #endif
21384 }
21385 /* Check for `(void)', too, which is a special case. */
21389 {
21390 /* Consume the `void' token. */
21392 /* There are no parameters. */
21394 }
21396 /* Parse the parameter-declaration-list. */
21398 /* If a parse error occurred while parsing the
21399 parameter-declaration-list, then the entire
21400 parameter-declaration-clause is erroneous. */
21404 /* Peek at the next token. */
21406 /* If it's a `,', the clause should terminate with an ellipsis. */
21408 {
21409 /* Consume the `,'. */
21411 /* Expect an ellipsis. */
21412 ellipsis_p
21414 }
21415 /* It might also be `...' if the optional trailing `,' was
21416 omitted. */
21418 {
21419 /* Consume the `...' token. */
21421 /* And remember that we saw it. */
21423 }
21424 else
21427 /* Finish the parameter list. */
21432 }
21434 /* Parse a parameter-declaration-list.
21436 parameter-declaration-list:
21437 parameter-declaration
21438 parameter-declaration-list , parameter-declaration
21440 Returns a representation of the parameter-declaration-list, as for
21441 cp_parser_parameter_declaration_clause. However, the
21442 `void_list_node' is never appended to the list. */
21444 static tree
21446 {
21452 /* The special considerations that apply to a function within an
21453 unbraced linkage specifications do not apply to the parameters
21454 to the function. */
21455 saved_in_unbraced_linkage_specification_p
21459 /* Look for more parameters. */
21461 {
21466 /* Parse the parameter. */
21467 parameter
21472 /* We don't know yet if the enclosing context is deprecated, so wait
21473 and warn in grokparms if appropriate. */
21477 {
21480 PARM,
21485 }
21489 /* If a parse error occurred parsing the parameter declaration,
21490 then the entire parameter-declaration-list is erroneous. */
21492 {
21495 }
21505 {
21509 }
21511 /* Add the new parameter to the list. */
21515 /* Peek at the next token. */
21518 /* These are for Objective-C++ */
21521 /* The parameter-declaration-list is complete. */
21524 {
21527 /* Peek at the next token. */
21529 /* If it's an ellipsis, then the list is complete. */
21532 /* Otherwise, there must be more parameters. Consume the
21533 `,'. */
21535 /* When parsing something like:
21537 int i(float f, double d)
21539 we can tell after seeing the declaration for "f" that we
21540 are not looking at an initialization of a variable "i",
21541 but rather at the declaration of a function "i".
21543 Due to the fact that the parsing of template arguments
21544 (as specified to a template-id) requires backtracking we
21545 cannot use this technique when inside a template argument
21546 list. */
21550 /* However, a parameter-declaration of the form
21551 "float(f)" (which is a valid declaration of a
21552 parameter "f") can also be interpreted as an
21553 expression (the conversion of "f" to "float"). */
21556 }
21557 else
21558 {
21566 }
21567 }
21569 parser->in_unbraced_linkage_specification_p
21572 /* Reset implicit_template_scope if we are about to leave the function
21573 parameter list that introduced it. Note that for out-of-line member
21574 definitions, there will be one or more class scopes before we get to
21575 the template parameter scope. */
21579 {
21583 {
21586 }
21587 }
21590 }
21592 /* Parse a parameter declaration.
21594 parameter-declaration:
21595 decl-specifier-seq ... [opt] declarator
21596 decl-specifier-seq declarator = assignment-expression
21597 decl-specifier-seq ... [opt] abstract-declarator [opt]
21598 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21600 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21601 declares a template parameter. (In that case, a non-nested `>'
21602 token encountered during the parsing of the assignment-expression
21603 is not interpreted as a greater-than operator.)
21605 Returns a representation of the parameter, or NULL if an error
21606 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21607 true iff the declarator is of the form "(p)". */
21613 {
21615 cp_decl_specifier_seq decl_specifiers;
21617 tree default_argument;
21622 /* In a template parameter, `>' is not an operator.
21624 [temp.param]
21626 When parsing a default template-argument for a non-type
21627 template-parameter, the first non-nested `>' is taken as the end
21628 of the template parameter-list rather than a greater-than
21629 operator. */
21631 /* Type definitions may not appear in parameter types. */
21633 parser->type_definition_forbidden_message
21640 /* Parse the declaration-specifiers. */
21643 CP_PARSER_FLAGS_NONE,
21647 /* Complain about missing 'typename' or other invalid type names. */
21652 /* If an error occurred, there's no reason to attempt to parse the
21653 rest of the declaration. */
21655 {
21658 }
21660 /* Peek at the next token. */
21663 /* If the next token is a `)', `,', `=', `>', or `...', then there
21664 is no declarator. However, when variadic templates are enabled,
21665 there may be a declarator following `...'. */
21670 {
21674 }
21675 /* Otherwise, there should be a declarator. */
21676 else
21677 {
21681 /* After seeing a decl-specifier-seq, if the next token is not a
21682 "(", there is no possibility that the code is a valid
21683 expression. Therefore, if parsing tentatively, we commit at
21684 this point. */
21686 /* In an expression context, having seen:
21688 (int((char ...
21690 we cannot be sure whether we are looking at a
21691 function-type (taking a "char" as a parameter) or a cast
21692 of some object of type "char" to "int". */
21698 /* Parse the declarator. */
21701 CP_PARSER_DECLARATOR_EITHER,
21703 parenthesized_p,
21707 /* After the declarator, allow more attributes. */
21708 decl_specifiers.attributes
21712 /* If the declarator is a template parameter pack, remember that and
21713 clear the flag in the declarator itself so we don't get errors
21714 from grokdeclarator. */
21716 {
21719 }
21720 }
21722 /* If the next token is an ellipsis, and we have not seen a declarator
21723 name, and if either the type of the declarator contains parameter
21724 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21725 for, eg, abbreviated integral type names), then we actually have a
21726 parameter pack expansion expression. Otherwise, leave the ellipsis
21727 for a C-style variadic function. */
21730 /* If a function parameter pack was specified and an implicit template
21731 parameter was introduced during cp_parser_parameter_declaration,
21732 change any implicit parameters introduced into packs. */
21737 {
21745 }
21748 {
21759 {
21760 /* Consume the `...'. */
21764 /* Build a pack expansion type */
21769 else
21771 }
21772 }
21774 /* The restriction on defining new types applies only to the type
21775 of the parameter, not to the default argument. */
21778 /* If the next token is `=', then process a default argument. */
21780 {
21783 /* If we are defining a class, then the tokens that make up the
21784 default argument must be saved and processed later. */
21790 // A constrained-type-specifier may declare a type template-parameter.
21792 default_argument
21795 // A constrained-type-specifier may declare a template-template-parameter.
21797 default_argument
21800 /* Outside of a class definition, we can just parse the
21801 assignment-expression. */
21802 else
21803 default_argument
21807 {
21809 "default arguments are only "
21811 }
21813 || template_parameter_pack_p
21816 {
21817 /* Find the name of the parameter pack. */
21824 template_parm_p
21830 else
21832 template_parm_p
21839 }
21840 }
21841 else
21844 /* Generate a location for the parameter, ranging from the start of the
21845 initial token to the end of the final token (using input_location for
21846 the latter, set up by cp_lexer_set_source_position_from_token when
21847 consuming tokens).
21849 If we have a identifier, then use it for the caret location, e.g.
21851 extern int callee (int one, int (*two)(int, int), float three);
21852 ~~~~~~^~~~~~~~~~~~~~
21854 otherwise, reuse the start location for the caret location e.g.:
21856 extern int callee (int one, int (*)(int, int), float three);
21857 ^~~~~~~~~~~~~~~~~
21859 */
21865 input_location);
21868 declarator,
21869 default_argument,
21870 param_loc,
21871 template_parameter_pack_p);
21872 }
21874 /* Parse a default argument and return it.
21876 TEMPLATE_PARM_P is true if this is a default argument for a
21877 non-type template parameter. */
21878 static tree
21880 {
21886 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21887 set correctly. */
21890 /* Local variable names (and the `this' keyword) may not
21891 appear in a default argument. */
21894 /* Parse the assignment-expression. */
21899 /* The "this" pointer is not valid in a default argument. */
21901 {
21906 }
21907 default_argument
21909 /* Restore the "this" pointer. */
21911 {
21914 }
21923 }
21925 /* Parse a function-body.
21927 function-body:
21928 compound_statement */
21930 static void
21932 {
21936 }
21938 /* Parse a ctor-initializer-opt followed by a function-body. Return
21939 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21940 is true we are parsing a function-try-block. */
21942 static void
21945 {
21952 /* Begin the function body. */
21954 /* Parse the optional ctor-initializer. */
21957 /* If we're parsing a constexpr constructor definition, we need
21958 to check that the constructor body is indeed empty. However,
21959 before we get to cp_parser_function_body lot of junk has been
21960 generated, so we can't just check that we have an empty block.
21961 Rather we take a snapshot of the outermost block, and check whether
21962 cp_parser_function_body changed its state. */
21964 {
21968 }
21969 /* Parse the function-body. */
21973 /* Finish the function body. */
21975 }
21977 /* Parse an initializer.
21979 initializer:
21980 = initializer-clause
21981 ( expression-list )
21983 Returns an expression representing the initializer. If no
21984 initializer is present, NULL_TREE is returned.
21986 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21987 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21988 set to TRUE if there is no initializer present. If there is an
21989 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21990 is set to true; otherwise it is set to false. */
21992 static tree
21995 {
21997 tree init;
21999 /* Peek at the next token. */
22002 /* Let our caller know whether or not this initializer was
22003 parenthesized. */
22005 /* Assume that the initializer is constant. */
22009 {
22010 /* Consume the `='. */
22012 /* Parse the initializer-clause. */
22014 }
22016 {
22021 non_constant_p);
22026 }
22028 {
22033 }
22034 else
22035 {
22036 /* Anything else is an error. */
22039 }
22045 }
22047 /* Parse an initializer-clause.
22049 initializer-clause:
22050 assignment-expression
22051 braced-init-list
22053 Returns an expression representing the initializer.
22055 If the `assignment-expression' production is used the value
22056 returned is simply a representation for the expression.
22058 Otherwise, calls cp_parser_braced_list. */
22060 static cp_expr
22062 {
22063 cp_expr initializer;
22065 /* Assume the expression is constant. */
22068 /* If it is not a `{', then we are looking at an
22069 assignment-expression. */
22071 {
22072 initializer
22075 non_constant_p);
22076 }
22077 else
22081 }
22083 /* Parse a brace-enclosed initializer list.
22085 braced-init-list:
22086 { initializer-list , [opt] }
22087 { designated-initializer-list , [opt] }
22088 { }
22090 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22091 the elements of the initializer-list (or NULL, if the last
22092 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22093 NULL_TREE. There is no way to detect whether or not the optional
22094 trailing `,' was provided. NON_CONSTANT_P is as for
22095 cp_parser_initializer. */
22097 static cp_expr
22099 {
22100 tree initializer;
22103 /* Consume the `{' token. */
22104 matching_braces braces;
22106 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22108 /* If it's not a `}', then there is a non-trivial initializer. */
22110 {
22111 /* Parse the initializer list. */
22114 /* A trailing `,' token is allowed. */
22117 }
22118 else
22120 /* Now, there should be a trailing `}'. */
22126 /* Build a location of the form:
22127 { ... }
22128 ^~~~~~~
22129 with caret==start at the open brace, finish at the close brace. */
22133 }
22135 /* Consume tokens up to, and including, the next non-nested closing `]'.
22136 Returns true iff we found a closing `]'. */
22138 static bool
22140 {
22144 {
22148 {
22151 /* If we've run out of tokens, then there is no closing `]'. */
22160 {
22163 }
22168 }
22170 /* Consume the token. */
22172 }
22173 }
22175 /* Return true if we are looking at an array-designator, false otherwise. */
22177 static bool
22179 {
22180 /* Consume the `['. */
22185 /* Skip tokens until the next token is a closing square bracket.
22186 If we find the closing `]', and the next token is a `=', then
22187 we are looking at an array designator. */
22188 bool array_designator_p
22192 /* Roll back the tokens we skipped. */
22196 }
22198 /* Parse an initializer-list.
22200 initializer-list:
22201 initializer-clause ... [opt]
22202 initializer-list , initializer-clause ... [opt]
22204 C++2A Extension:
22206 designated-initializer-list:
22207 designated-initializer-clause
22208 designated-initializer-list , designated-initializer-clause
22210 designated-initializer-clause:
22211 designator brace-or-equal-initializer
22213 designator:
22214 . identifier
22216 GNU Extension:
22218 initializer-list:
22219 designation initializer-clause ...[opt]
22220 initializer-list , designation initializer-clause ...[opt]
22222 designation:
22223 . identifier =
22224 identifier :
22225 [ constant-expression ] =
22227 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22228 for the initializer. If the INDEX of the elt is non-NULL, it is the
22229 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22230 as for cp_parser_initializer. */
22234 {
22239 /* Assume all of the expressions are constant. */
22242 /* Parse the rest of the list. */
22244 {
22246 tree designator;
22247 tree initializer;
22251 /* Handle the C++2A syntax, '. id ='. */
22259 {
22262 "C++ designated initializers only available with "
22264 /* Consume the `.'. */
22266 /* Consume the identifier. */
22269 /* Consume the `='. */
22271 }
22272 /* Also, if the next token is an identifier and the following one is a
22273 colon, we are looking at the GNU designated-initializer
22274 syntax. */
22279 {
22280 /* Warn the user that they are using an extension. */
22283 /* Consume the identifier. */
22285 /* Consume the `:'. */
22287 }
22288 /* Also handle C99 array designators, '[ const ] ='. */
22292 {
22293 /* In C++11, [ could start a lambda-introducer. */
22299 {
22302 }
22303 else
22304 {
22309 }
22314 && (!require_potential_rvalue_constant_expression
22318 /* Warn the user that they are using an extension. */
22321 }
22322 else
22326 {
22329 }
22333 {
22337 }
22341 /* Parse the initializer. */
22344 /* If any clause is non-constant, so is the entire initializer. */
22348 /* If we have an ellipsis, this is an initializer pack
22349 expansion. */
22351 {
22354 /* Consume the `...'. */
22361 /* Turn the initializer into an initializer expansion. */
22363 }
22365 /* Add it to the vector. */
22368 /* If the next token is not a comma, we have reached the end of
22369 the list. */
22373 /* Peek at the next token. */
22375 /* If the next token is a `}', then we're still done. An
22376 initializer-clause can have a trailing `,' after the
22377 initializer-list and before the closing `}'. */
22381 /* Consume the `,' token. */
22383 }
22385 /* The same identifier shall not appear in multiple designators
22386 of a designated-initializer-list. */
22388 {
22393 {
22395 {
22397 "%<.%s%> designator used multiple times in "
22401 }
22402 else
22404 }
22408 }
22411 }
22413 /* Classes [gram.class] */
22415 /* Parse a class-name.
22417 class-name:
22418 identifier
22419 template-id
22421 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22422 to indicate that names looked up in dependent types should be
22423 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22424 keyword has been used to indicate that the name that appears next
22425 is a template. TAG_TYPE indicates the explicit tag given before
22426 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22427 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22428 is the class being defined in a class-head. If ENUM_OK is TRUE,
22429 enum-names are also accepted.
22431 Returns the TYPE_DECL representing the class. */
22433 static tree
22442 {
22443 tree decl;
22444 tree scope;
22449 /* All class-names start with an identifier. */
22452 {
22455 }
22457 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22458 to a template-id, so we save it here. */
22463 /* Any name names a type if we're following the `typename' keyword
22464 in a qualified name where the enclosing scope is type-dependent. */
22467 /* Handle the common case (an identifier, but not a template-id)
22468 efficiently. */
22471 {
22475 /* Look for the identifier. */
22479 /* If the next token isn't an identifier, we are certainly not
22480 looking at a class-name. */
22483 /* If we know this is a type-name, there's no need to look it
22484 up. */
22487 else
22488 {
22489 tree ambiguous_decls;
22490 /* If we already know that this lookup is ambiguous, then
22491 we've already issued an error message; there's no reason
22492 to check again. */
22494 {
22497 }
22498 /* If the next token is a `::', then the name must be a type
22499 name.
22501 [basic.lookup.qual]
22503 During the lookup for a name preceding the :: scope
22504 resolution operator, object, function, and enumerator
22505 names are ignored. */
22508 /* Look up the name. */
22510 tag_type,
22513 check_dependency_p,
22517 {
22521 }
22522 }
22523 }
22524 else
22525 {
22526 /* Try a template-id. */
22528 check_dependency_p,
22529 tag_type,
22530 is_declaration);
22533 }
22537 /* If this is a typename, create a TYPENAME_TYPE. */
22539 {
22544 }
22548 /* Check to see that it is really the name of a class. */
22552 /* Situations like this:
22554 template <typename T> struct A {
22555 typename T::template X<int>::I i;
22556 };
22558 are problematic. Is `T::template X<int>' a class-name? The
22559 standard does not seem to be definitive, but there is no other
22560 valid interpretation of the following `::'. Therefore, those
22561 names are considered class-names. */
22562 {
22566 }
22571 /* In Objective-C 2.0, a classname followed by '.' starts a
22572 dot-syntax expression, and it's not a type-name. */
22584 }
22586 /* Parse a class-specifier.
22588 class-specifier:
22589 class-head { member-specification [opt] }
22591 Returns the TREE_TYPE representing the class. */
22593 static tree
22595 {
22596 tree type;
22610 /* Parse the class-head. */
22613 /* If the class-head was a semantic disaster, skip the entire body
22614 of the class. */
22616 {
22620 }
22622 /* Look for the `{'. */
22623 matching_braces braces;
22625 {
22628 }
22633 /* Issue an error message if type-definitions are forbidden here. */
22635 /* Remember that we are defining one more class. */
22637 /* Inside the class, surrounding template-parameter-lists do not
22638 apply. */
22639 saved_num_template_parameter_lists
22642 /* We are not in a function body. */
22645 /* Or in a loop. */
22648 /* Or in a switch. */
22651 /* We are not immediately inside an extern "lang" block. */
22652 saved_in_unbraced_linkage_specification_p
22656 // Associate constraints with the type.
22660 /* Start the class. */
22662 {
22665 }
22669 /* If the type is erroneous, skip the entire body of the class. */
22671 else
22672 /* Parse the member-specification. */
22675 /* Look for the trailing `}'. */
22677 /* Look for trailing attributes to apply to this class. */
22685 /* We've finished a type definition. Check for the common syntax
22686 error of forgetting a semicolon after the definition. We need to
22687 be careful, as we can't just check for not-a-semicolon and be done
22688 with it; the user might have typed:
22690 class X { } c = ...;
22691 class X { } *p = ...;
22693 and so forth. Instead, enumerate all the possible tokens that
22694 might follow this production; if we don't see one of them, then
22695 complain and silently insert the semicolon. */
22696 {
22701 /* Don't try to parse c++11 attributes here. As per the
22702 grammar, that should be a task for
22703 cp_parser_decl_specifier_seq. */
22707 {
22718 /* While it's legal for type qualifiers and storage class
22719 specifiers to follow type definitions in the grammar, only
22720 compiler testsuites contain code like that. Assume that if
22721 we see such code, then what we're really seeing is a case
22722 like:
22724 class X { }
22725 const <type> var = ...;
22727 or
22729 class Y { }
22730 static <type> func (...) ...
22732 i.e. the qualifier or specifier applies to the next
22733 declaration. To do so, however, we need to look ahead one
22734 more token to see if *that* token is a type specifier.
22736 This code could be improved to handle:
22738 class Z { }
22739 static const <type> var = ...; */
22742 {
22745 /* Handling user-defined types here would be nice, but very
22746 tricky. */
22747 want_semicolon
22750 }
22754 }
22756 /* If we don't have a type, then something is very wrong and we
22757 shouldn't try to do anything clever. Likewise for not seeing the
22758 closing brace. */
22760 {
22761 /* Locate the closing brace. */
22762 cp_token_position prev
22767 /* We want to suggest insertion of a ';' immediately *after* the
22768 closing brace, so, if we can, offset the location by 1 column. */
22775 /* If we successfully offset the location, suggest the fix-it. */
22788 else
22791 /* Unget one token and smash it to look as though we encountered
22792 a semicolon in the input stream. */
22797 }
22798 }
22800 /* If this class is not itself within the scope of another class,
22801 then we need to parse the bodies of all of the queued function
22802 definitions. Note that the queued functions defined in a class
22803 are not always processed immediately following the
22804 class-specifier for that class. Consider:
22806 struct A {
22807 struct B { void f() { sizeof (A); } };
22808 };
22810 If `f' were processed before the processing of `A' were
22811 completed, there would be no way to compute the size of `A'.
22812 Note that the nesting we are interested in here is lexical --
22813 not the semantic nesting given by TYPE_CONTEXT. In particular,
22814 for:
22816 struct A { struct B; };
22817 struct A::B { void f() { } };
22819 there is no need to delay the parsing of `A::B::f'. */
22821 {
22822 tree decl;
22830 {
22831 /* Skip default arguments, NSDMIs, etc, in order to improve
22832 error recovery (c++/71169, c++/71832). */
22837 }
22839 /* In a first pass, parse default arguments to the functions.
22840 Then, in a second pass, parse the bodies of the functions.
22841 This two-phased approach handles cases like:
22843 struct S {
22844 void f() { g(); }
22845 void g(int i = 3);
22846 };
22848 */
22850 {
22852 /* If there are default arguments that have not yet been processed,
22853 take care of them now. */
22855 {
22860 }
22861 /* Make sure that any template parameters are in scope. */
22863 /* Parse the default argument expressions. */
22865 /* Remove any template parameters from the symbol table. */
22867 }
22869 /* Now parse any NSDMIs. */
22873 {
22875 {
22880 }
22883 }
22890 /* Now do some post-NSDMI bookkeeping. */
22896 /* Now parse the body of the functions. */
22898 {
22899 /* OpenMP UDRs need to be parsed before all other functions. */
22906 }
22907 else
22911 }
22912 else
22915 /* Put back any saved access checks. */
22918 /* Restore saved state. */
22922 parser->num_template_parameter_lists
22924 parser->in_unbraced_linkage_specification_p
22928 }
22930 static tree
22932 {
22933 tree ret;
22938 }
22940 /* Parse a class-head.
22942 class-head:
22943 class-key identifier [opt] base-clause [opt]
22944 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22945 class-key nested-name-specifier [opt] template-id
22946 base-clause [opt]
22948 class-virt-specifier:
22949 final
22951 GNU Extensions:
22952 class-key attributes identifier [opt] base-clause [opt]
22953 class-key attributes nested-name-specifier identifier base-clause [opt]
22954 class-key attributes nested-name-specifier [opt] template-id
22955 base-clause [opt]
22957 Upon return BASES is initialized to the list of base classes (or
22958 NULL, if there are none) in the same form returned by
22959 cp_parser_base_clause.
22961 Returns the TYPE of the indicated class. Sets
22962 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22963 involving a nested-name-specifier was used, and FALSE otherwise.
22965 Returns error_mark_node if this is not a class-head.
22967 Returns NULL_TREE if the class-head is syntactically valid, but
22968 semantically invalid in a way that means we should skip the entire
22969 body of the class. */
22971 static tree
22974 {
22975 tree nested_name_specifier;
22979 tree attributes;
22980 tree bases;
22990 /* Assume no nested-name-specifier will be present. */
22992 /* Assume no template parameter lists will be used in defining the
22993 type. */
22997 /* Look for the class-key. */
23004 /* Parse the attributes. */
23007 /* If the next token is `::', that is invalid -- but sometimes
23008 people do try to write:
23010 struct ::S {};
23012 Handle this gracefully by accepting the extra qualifier, and then
23013 issuing an error about it later if this really is a
23014 class-head. If it turns out just to be an elaborated type
23015 specifier, remain silent. */
23021 /* Determine the name of the class. Begin by looking for an
23022 optional nested-name-specifier. */
23024 nested_name_specifier
23030 /* If there was a nested-name-specifier, then there *must* be an
23031 identifier. */
23036 {
23038 /* Although the grammar says `identifier', it really means
23039 `class-name' or `template-name'. You are only allowed to
23040 define a class that has already been declared with this
23041 syntax.
23043 The proposed resolution for Core Issue 180 says that wherever
23044 you see `class T::X' you should treat `X' as a type-name.
23046 It is OK to define an inaccessible class; for example:
23048 class A { class B; };
23049 class A::B {};
23051 We do not know if we will see a class-name, or a
23052 template-name. We look for a class-name first, in case the
23053 class-name is a template-id; if we looked for the
23054 template-name first we would stop after the template-name. */
23061 class_type,
23065 /* If that didn't work, ignore the nested-name-specifier. */
23067 {
23073 }
23074 /* If we could not find a corresponding TYPE, treat this
23075 declaration like an unqualified declaration. */
23078 /* Otherwise, count the number of templates used in TYPE and its
23079 containing scopes. */
23080 else
23082 }
23083 /* Otherwise, the identifier is optional. */
23084 else
23085 {
23086 /* We don't know whether what comes next is a template-id,
23087 an identifier, or nothing at all. */
23089 /* Check for a template-id. */
23094 class_key,
23096 /* If that didn't work, it could still be an identifier. */
23098 {
23100 {
23103 }
23104 else
23106 }
23107 else
23108 {
23111 }
23112 }
23117 {
23119 class_key,
23121 }
23124 /* If it's not a `:' or a `{' then we can't really be looking at a
23125 class-head, since a class-head only appears as part of a
23126 class-specifier. We have to detect this situation before calling
23127 xref_tag, since that has irreversible side-effects. */
23129 {
23133 }
23135 /* At this point, we're going ahead with the class-specifier, even
23136 if some other problem occurs. */
23139 {
23144 }
23145 /* Issue the error about the overly-qualified name now. */
23147 {
23152 }
23154 {
23159 }
23161 {
23162 tree scope;
23165 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23166 keyword template shall not appear at the top level. */
23170 /* Reject typedef-names in class heads. */
23172 {
23175 type);
23178 }
23180 /* Figure out in what scope the declaration is being placed. */
23182 /* If that scope does not contain the scope in which the
23183 class was originally declared, the program is invalid. */
23185 {
23188 "declaration of %qD in namespace %qD which does not "
23191 else
23197 }
23198 /* [dcl.meaning]
23200 A declarator-id shall not be qualified except for the
23201 definition of a ... nested class outside of its class
23202 ... [or] the definition or explicit instantiation of a
23203 class member of a namespace outside of its namespace. */
23205 {
23210 }
23211 }
23212 /* An explicit-specialization must be preceded by "template <>". If
23213 it is not, try to recover gracefully. */
23216 && !processing_template_parmlist
23218 {
23219 /* Build a location of this form:
23220 struct typename <ARGS>
23221 ^~~~~~~~~~~~~~~~~~~~~~
23222 with caret==start at the start token, and
23223 finishing at the end of the type. */
23224 location_t reported_loc
23226 class_head_start_location,
23232 "an explicit specialization must be preceded by"
23235 /* Take the same action that would have been taken by
23236 cp_parser_explicit_specialization. */
23239 }
23240 /* There must be no "return" statements between this point and the
23241 end of this function; set "type "to the correct return value and
23242 use "goto done;" to return. */
23243 /* Make sure that the right number of template parameters were
23244 present. */
23246 template_id_p,
23249 {
23250 /* If something went wrong, there is no point in even trying to
23251 process the class-definition. */
23254 }
23256 /* Look up the type. */
23258 {
23262 {
23266 }
23267 else
23268 {
23272 /* Check the scope while we still know whether or not we had a
23273 nested-name-specifier. */
23276 }
23279 }
23281 {
23282 tree class_type;
23284 /* Given:
23286 template <typename T> struct S { struct T };
23287 template <typename T> struct S<T>::T { };
23289 we will get a TYPENAME_TYPE when processing the definition of
23290 `S::T'. We need to resolve it to the actual type before we
23291 try to define it. */
23293 {
23298 else
23299 {
23302 }
23303 }
23307 {
23310 }
23313 /* Enter the scope indicated by the nested-name-specifier. */
23315 /* Get the canonical version of this type. */
23317 /* Call push_template_decl if it seems like we should be defining a
23318 template either from the template headers or the type we're
23319 defining, so that we diagnose both extra and missing headers. */
23323 {
23326 {
23329 }
23330 }
23334 }
23336 {
23337 /* If the class was unnamed, create a dummy name. */
23341 ? ts_within_enclosing_non_class
23345 }
23347 /* Indicate whether this class was declared as a `class' or as a
23348 `struct'. */
23353 /* If this type was already complete, and we see another definition,
23354 that's an error. */
23356 {
23358 type);
23360 type);
23363 }
23368 {
23369 /* Apply attributes now, before any use of the class as a template
23370 argument in its base list. */
23373 }
23375 /* We will have entered the scope containing the class; the names of
23376 base classes should be looked up in that context. For example:
23378 struct A { struct B {}; struct C; };
23379 struct A::C : B {};
23381 is valid. */
23383 /* Get the list of base-classes, if there is one. */
23385 {
23386 /* PR59482: enter the class scope so that base-specifiers are looked
23387 up correctly. */
23391 /* PR59482: get out of the previously pushed class scope so that the
23392 subsequent pops pop the right thing. */
23395 }
23396 else
23399 /* If we're really defining a class, process the base classes.
23400 If they're invalid, fail. */
23404 done:
23405 /* Leave the scope given by the nested-name-specifier. We will
23406 enter the class scope itself while processing the members. */
23411 {
23414 }
23420 out:
23423 }
23425 /* Parse a class-key.
23427 class-key:
23428 class
23429 struct
23430 union
23432 Returns the kind of class-key specified, or none_type to indicate
23433 error. */
23435 static enum tag_types
23437 {
23441 /* Look for the class-key. */
23446 /* Check to see if the TOKEN is a class-key. */
23451 }
23453 /* Parse a type-parameter-key.
23455 type-parameter-key:
23456 class
23457 typename
23458 */
23460 static void
23462 {
23463 /* Look for the type-parameter-key. */
23467 {
23470 /* typename is not allowed in a template template parameter
23471 by the standard until C++17. */
23473 "ISO C++ forbids typename key in template template parameter;"
23475 }
23476 else
23480 }
23482 /* Parse an (optional) member-specification.
23484 member-specification:
23485 member-declaration member-specification [opt]
23486 access-specifier : member-specification [opt] */
23488 static void
23490 {
23492 {
23496 /* Peek at the next token. */
23498 /* If it's a `}', or EOF then we've seen all the members. */
23504 /* See if this token is a keyword. */
23507 {
23511 /* Consume the access-specifier. */
23513 /* Remember which access-specifier is active. */
23515 /* Look for the `:'. */
23520 /* Accept #pragmas at class scope. */
23522 {
23525 }
23527 /* Otherwise, the next construction must be a
23528 member-declaration. */
23530 }
23531 }
23532 }
23534 /* Parse a member-declaration.
23536 member-declaration:
23537 decl-specifier-seq [opt] member-declarator-list [opt] ;
23538 function-definition ; [opt]
23539 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23540 using-declaration
23541 template-declaration
23542 alias-declaration
23544 member-declarator-list:
23545 member-declarator
23546 member-declarator-list , member-declarator
23548 member-declarator:
23549 declarator pure-specifier [opt]
23550 declarator constant-initializer [opt]
23551 identifier [opt] : constant-expression
23553 GNU Extensions:
23555 member-declaration:
23556 __extension__ member-declaration
23558 member-declarator:
23559 declarator attributes [opt] pure-specifier [opt]
23560 declarator attributes [opt] constant-initializer [opt]
23561 identifier [opt] attributes [opt] : constant-expression
23563 C++0x Extensions:
23565 member-declaration:
23566 static_assert-declaration */
23568 static void
23570 {
23571 cp_decl_specifier_seq decl_specifiers;
23572 tree prefix_attributes;
23573 tree decl;
23582 /* Check for the `__extension__' keyword. */
23584 {
23585 /* Recurse. */
23587 /* Restore the old value of the PEDANTIC flag. */
23591 }
23593 /* Check for a template-declaration. */
23595 {
23596 /* An explicit specialization here is an error condition, and we
23597 expect the specialization handler to detect and report this. */
23601 else
23605 }
23606 /* Check for a template introduction. */
23610 /* Check for a using-declaration. */
23612 {
23614 {
23615 /* Parse the using-declaration. */
23619 }
23620 else
23621 {
23622 tree decl;
23626 /* Note that if we actually see the '=' token after the
23627 identifier, cp_parser_alias_declaration commits the
23628 tentative parse. In that case, we really expect an
23629 alias-declaration. Otherwise, we expect a using
23630 declaration. */
23631 alias_decl_expected =
23637 else
23641 }
23642 }
23644 /* Check for @defs. */
23646 {
23651 {
23656 }
23658 }
23660 /* If the next token is `static_assert' we have a static assertion. */
23662 {
23665 }
23672 /* Parse the decl-specifier-seq. */
23675 CP_PARSER_FLAGS_OPTIONAL,
23678 /* Check for an invalid type-name. */
23682 /* If there is no declarator, then the decl-specifier-seq should
23683 specify a type. */
23685 {
23686 /* If there was no decl-specifier-seq, and the next token is a
23687 `;', then we have something like:
23689 struct S { ; };
23691 [class.mem]
23693 Each member-declaration shall declare at least one member
23694 name of the class. */
23696 {
23699 {
23703 }
23704 }
23705 else
23706 {
23707 tree type;
23709 /* See if this declaration is a friend. */
23711 /* If there were decl-specifiers, check to see if there was
23712 a class-declaration. */
23715 /* Nested classes have already been added to the class, but
23716 a `friend' needs to be explicitly registered. */
23718 {
23719 /* If the `friend' keyword was present, the friend must
23720 be introduced with a class-key. */
23723 "in C++03 a class-key must be used "
23725 /* In this case:
23727 template <typename T> struct A {
23728 friend struct A<T>::B;
23729 };
23731 A<T>::B will be represented by a TYPENAME_TYPE, and
23732 therefore not recognized by check_tag_decl. */
23734 {
23738 }
23741 "friend declaration does not name a class or "
23743 else
23746 }
23747 /* If there is no TYPE, an error message will already have
23748 been issued. */
23750 ;
23751 /* An anonymous aggregate has to be handled specially; such
23752 a declaration really declares a data member (with a
23753 particular type), as opposed to a nested class. */
23755 {
23756 /* C++11 9.5/6. */
23759 "a storage class on an anonymous aggregate "
23762 /* Remove constructors and such from TYPE, now that we
23763 know it is an anonymous aggregate. */
23765 /* And make the corresponding data member. */
23768 /* Add it to the class. */
23770 }
23771 else
23772 cp_parser_check_access_in_redeclaration
23775 }
23776 }
23777 else
23778 {
23781 /* Clear attributes from the decl_specifiers but keep them
23782 around as prefix attributes that apply them to the entity
23783 being declared. */
23787 /* See if these declarations will be friends. */
23790 /* Keep going until we hit the `;' at the end of the
23791 declaration. */
23793 {
23795 tree first_attribute;
23796 tree initializer;
23799 /* Peek at the next token. */
23802 /* The following code wants to know early if it is a bit-field
23803 or some other declaration. Attributes can appear before
23804 the `:' token. Skip over them without consuming any tokens
23805 to peek if they are followed by `:'. */
23810 {
23811 size_t n
23814 }
23816 /* Check for a bitfield declaration. */
23822 {
23823 tree identifier;
23824 tree width;
23829 else
23832 /* Look for attributes that apply to the bitfield. */
23835 /* Consume the `:' token. */
23838 /* Get the width of the bitfield. */
23842 /* In C++2A and as extension for C++11 and above we allow
23843 default member initializers for bit-fields. */
23848 CPP_OPEN_BRACE)))
23849 {
23850 location_t loc
23856 "default member initializers for bit-fields "
23857 "only available with -std=c++2a or "
23862 {
23866 }
23867 }
23868 else
23869 {
23870 /* Look for attributes that apply to the bitfield after
23871 the `:' token and width. This is where GCC used to
23872 parse attributes in the past, pedwarn if there is
23873 a std attribute. */
23876 "ISO C++ allows bit-field attributes only "
23880 }
23884 /* Remember which attributes are prefix attributes and
23885 which are not. */
23887 /* Combine the attributes. */
23890 /* Create the bitfield declaration. */
23893 identifier,
23894 sfk_none)
23898 attributes);
23899 }
23900 else
23901 {
23903 tree asm_specification;
23906 /* Parse the declarator. */
23907 declarator
23912 friend_p);
23914 /* If something went wrong parsing the declarator, make sure
23915 that we at least consume some tokens. */
23917 {
23918 /* Skip to the end of the statement. */
23920 /* If the next token is not a semicolon, that is
23921 probably because we just skipped over the body of
23922 a function. So, we consume a semicolon if
23923 present, but do not issue an error message if it
23924 is not present. */
23926 CPP_SEMICOLON))
23929 }
23932 cp_parser_check_for_definition_in_return_type
23936 /* Look for an asm-specification. */
23938 /* Look for attributes that apply to the declaration. */
23940 /* Remember which attributes are prefix attributes and
23941 which are not. */
23943 /* Combine the attributes. */
23946 /* If it's an `=', then we have a constant-initializer or a
23947 pure-specifier. It is not correct to parse the
23948 initializer before registering the member declaration
23949 since the member declaration should be in scope while
23950 its initializer is processed. However, the rest of the
23951 front end does not yet provide an interface that allows
23952 us to handle this correctly. */
23954 {
23955 /* In [class.mem]:
23957 A pure-specifier shall be used only in the declaration of
23958 a virtual function.
23960 A member-declarator can contain a constant-initializer
23961 only if it declares a static member of integral or
23962 enumeration type.
23964 Therefore, if the DECLARATOR is for a function, we look
23965 for a pure-specifier; otherwise, we look for a
23966 constant-initializer. When we call `grokfield', it will
23967 perform more stringent semantics checks. */
23979 {
23981 /* Don't require a constant rvalue in C++11, since we
23982 might want a reference constant. We'll enforce
23983 constancy later. */
23985 /* Parse the initializer. */
23988 }
23989 else
23990 /* Parse the initializer. */
23992 }
23995 {
23999 else
24001 }
24002 /* Otherwise, there is no initializer. */
24003 else
24006 /* See if we are probably looking at a function
24007 definition. We are certainly not looking at a
24008 member-declarator. Calling `grokfield' has
24009 side-effects, so we must not do it unless we are sure
24010 that we are looking at a member-declarator. */
24013 {
24014 /* The grammar does not allow a pure-specifier to be
24015 used when a member function is defined. (It is
24016 possible that this fact is an oversight in the
24017 standard, since a pure function may be defined
24018 outside of the class-specifier. */
24024 declarator,
24025 attributes);
24028 /* If the member was not a friend, declare it here. */
24031 /* Peek at the next token. */
24033 /* If the next token is a semicolon, consume it. */
24035 {
24036 location_t semicolon_loc
24041 "extra %<;%> after in-class "
24043 }
24045 }
24046 else
24049 /* Create the declaration. */
24054 {
24057 else
24059 }
24060 }
24065 /* Reset PREFIX_ATTRIBUTES. */
24067 {
24072 }
24074 /* If there is any qualification still in effect, clear it
24075 now; we will be starting fresh with the next declarator. */
24079 /* If it's a `,', then there are more declarators. */
24081 {
24084 {
24090 }
24091 }
24092 /* If the next token isn't a `;', then we have a parse error. */
24094 CPP_SEMICOLON))
24095 {
24096 /* The next token might be a ways away from where the
24097 actual semicolon is missing. Find the previous token
24098 and use that for our error position. */
24105 /* Assume that the user meant to provide a semicolon. If
24106 we were to cp_parser_skip_to_end_of_statement, we might
24107 skip to a semicolon inside a member function definition
24108 and issue nonsensical error messages. */
24110 }
24113 {
24114 /* Add DECL to the list of members. */
24116 /* Explicitly include, eg, NSDMIs, for better error
24117 recovery (c++/58650). */
24125 /* Add DECL to the queue of NSDMI to be parsed later. */
24127 }
24131 }
24132 }
24135 out:
24137 }
24139 /* Parse a pure-specifier.
24141 pure-specifier:
24142 = 0
24144 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24145 Otherwise, ERROR_MARK_NODE is returned. */
24147 static tree
24149 {
24152 /* Look for the `=' token. */
24155 /* Look for the `0' token. */
24164 /* Accept = default or = delete in c++0x mode. */
24167 {
24170 }
24172 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24174 {
24179 }
24181 {
24184 }
24187 }
24189 /* Parse a constant-initializer.
24191 constant-initializer:
24192 = constant-expression
24194 Returns a representation of the constant-expression. */
24196 static tree
24198 {
24199 /* Look for the `=' token. */
24203 /* It is invalid to write:
24205 struct S { static const int i = { 7 }; };
24207 */
24209 {
24212 /* Consume the opening brace. */
24213 matching_braces braces;
24215 /* Skip the initializer. */
24217 /* Look for the trailing `}'. */
24221 }
24224 }
24226 /* Derived classes [gram.class.derived] */
24228 /* Parse a base-clause.
24230 base-clause:
24231 : base-specifier-list
24233 base-specifier-list:
24234 base-specifier ... [opt]
24235 base-specifier-list , base-specifier ... [opt]
24237 Returns a TREE_LIST representing the base-classes, in the order in
24238 which they were declared. The representation of each node is as
24239 described by cp_parser_base_specifier.
24241 In the case that no bases are specified, this function will return
24242 NULL_TREE, not ERROR_MARK_NODE. */
24244 static tree
24246 {
24249 /* Look for the `:' that begins the list. */
24252 /* Scan the base-specifier-list. */
24254 {
24256 tree base;
24259 /* Look for the base-specifier. */
24261 /* Look for the (optional) ellipsis. */
24263 {
24264 /* Consume the `...'. */
24268 }
24270 /* Add BASE to the front of the list. */
24272 {
24274 /* Make this a pack expansion type. */
24278 {
24281 }
24282 }
24283 /* Peek at the next token. */
24285 /* If it's not a comma, then the list is complete. */
24288 /* Consume the `,'. */
24290 }
24292 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24293 base class had a qualified name. However, the next name that
24294 appears is certainly not qualified. */
24300 }
24302 /* Parse a base-specifier.
24304 base-specifier:
24305 :: [opt] nested-name-specifier [opt] class-name
24306 virtual access-specifier [opt] :: [opt] nested-name-specifier
24307 [opt] class-name
24308 access-specifier virtual [opt] :: [opt] nested-name-specifier
24309 [opt] class-name
24311 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24312 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24313 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24314 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24316 static tree
24318 {
24326 tree type;
24328 /* Process the optional `virtual' and `access-specifier'. */
24330 {
24331 /* Peek at the next token. */
24333 /* Process `virtual'. */
24335 {
24337 /* If `virtual' appears more than once, issue an error. */
24339 {
24343 }
24347 /* Consume the `virtual' token. */
24355 /* If more than one access specifier appears, issue an
24356 error. */
24359 {
24363 }
24367 /* Consume the access-specifier. */
24375 }
24376 }
24377 /* It is not uncommon to see programs mechanically, erroneously, use
24378 the 'typename' keyword to denote (dependent) qualified types
24379 as base classes. */
24381 {
24386 else
24388 "keyword %<typename%> not allowed in this context "
24391 }
24393 /* Look for the optional `::' operator. */
24395 /* Look for the nested-name-specifier. The simplest way to
24396 implement:
24398 [temp.res]
24400 The keyword `typename' is not permitted in a base-specifier or
24401 mem-initializer; in these contexts a qualified name that
24402 depends on a template-parameter is implicitly assumed to be a
24403 type name.
24405 is to pretend that we have seen the `typename' keyword at this
24406 point. */
24412 /* If the base class is given by a qualified name, assume that names
24413 we see are type names or templates, as appropriate. */
24419 /* DR 950 allows decltype as a base-specifier. */
24421 else
24422 {
24423 /* Otherwise, look for the class-name. */
24425 class_scope_p,
24426 template_p,
24427 typename_type,
24432 }
24438 }
24440 /* Exception handling [gram.exception] */
24442 /* Parse an (optional) noexcept-specification.
24444 noexcept-specification:
24445 noexcept ( constant-expression ) [opt]
24447 If no noexcept-specification is present, returns NULL_TREE.
24448 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24449 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24450 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24451 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24452 in which case a boolean condition is returned instead. */
24454 static tree
24459 {
24463 /* Peek at the next token. */
24466 /* Is it a noexcept-specification? */
24468 {
24469 tree expr;
24473 {
24474 matching_parens parens;
24478 {
24479 /* Types may not be defined in an exception-specification. */
24481 parser->type_definition_forbidden_message
24486 /* Restore the saved message. */
24488 }
24489 else
24490 {
24493 }
24496 }
24497 else
24498 {
24502 }
24504 /* We cannot build a noexcept-spec right away because this will check
24505 that expr is a constexpr. */
24508 else
24510 }
24511 else
24513 }
24515 /* Parse an (optional) exception-specification.
24517 exception-specification:
24518 throw ( type-id-list [opt] )
24520 Returns a TREE_LIST representing the exception-specification. The
24521 TREE_VALUE of each node is a type. */
24523 static tree
24525 {
24527 tree type_id_list;
24530 /* Peek at the next token. */
24533 /* Is it a noexcept-specification? */
24539 /* If it's not `throw', then there's no exception-specification. */
24545 /* Consume the `throw'. */
24548 /* Look for the `('. */
24549 matching_parens parens;
24552 /* Peek at the next token. */
24554 /* If it's not a `)', then there is a type-id-list. */
24556 {
24557 /* Types may not be defined in an exception-specification. */
24559 parser->type_definition_forbidden_message
24561 /* Parse the type-id-list. */
24563 /* Restore the saved message. */
24567 {
24571 }
24574 "dynamic exception specifications are deprecated in "
24576 }
24577 /* In C++17, throw() is equivalent to noexcept (true). throw()
24578 is deprecated in C++11 and above as well, but is still widely used,
24579 so don't warn about it yet. */
24582 else
24585 /* Look for the `)'. */
24589 }
24591 /* Parse an (optional) type-id-list.
24593 type-id-list:
24594 type-id ... [opt]
24595 type-id-list , type-id ... [opt]
24597 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24598 in the order that the types were presented. */
24600 static tree
24602 {
24606 {
24608 tree type;
24612 /* Get the next type-id. */
24614 /* Check for invalid 'auto'. */
24616 {
24620 }
24621 /* Parse the optional ellipsis. */
24623 {
24624 /* Consume the `...'. */
24627 /* Turn the type into a pack expansion expression. */
24629 }
24630 /* Add it to the list. */
24632 /* Peek at the next token. */
24634 /* If it is not a `,', we are done. */
24637 /* Consume the `,'. */
24639 }
24642 }
24644 /* Parse a try-block.
24646 try-block:
24647 try compound-statement handler-seq */
24649 static tree
24651 {
24652 tree try_block;
24666 }
24668 /* Parse a function-try-block.
24670 function-try-block:
24671 try ctor-initializer [opt] function-body handler-seq */
24673 static void
24675 {
24676 tree compound_stmt;
24677 tree try_block;
24679 /* Look for the `try' keyword. */
24682 /* Let the rest of the front end know where we are. */
24684 /* Parse the function-body. */
24685 cp_parser_ctor_initializer_opt_and_function_body
24687 /* We're done with the `try' part. */
24689 /* Parse the handlers. */
24691 /* We're done with the handlers. */
24693 }
24695 /* Parse a handler-seq.
24697 handler-seq:
24698 handler handler-seq [opt] */
24700 static void
24702 {
24704 {
24707 /* Parse the handler. */
24709 /* Peek at the next token. */
24711 /* If it's not `catch' then there are no more handlers. */
24714 }
24715 }
24717 /* Parse a handler.
24719 handler:
24720 catch ( exception-declaration ) compound-statement */
24722 static void
24724 {
24725 tree handler;
24726 tree declaration;
24730 matching_parens parens;
24737 }
24739 /* Parse an exception-declaration.
24741 exception-declaration:
24742 type-specifier-seq declarator
24743 type-specifier-seq abstract-declarator
24744 type-specifier-seq
24745 ...
24747 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24748 ellipsis variant is used. */
24750 static tree
24752 {
24753 cp_decl_specifier_seq type_specifiers;
24757 /* If it's an ellipsis, it's easy to handle. */
24759 {
24760 /* Consume the `...' token. */
24763 }
24765 /* Types may not be defined in exception-declarations. */
24767 parser->type_definition_forbidden_message
24770 /* Parse the type-specifier-seq. */
24774 /* If it's a `)', then there is no declarator. */
24777 else
24784 /* Restore the saved message. */
24791 }
24793 /* Parse a throw-expression.
24795 throw-expression:
24796 throw assignment-expression [opt]
24798 Returns a THROW_EXPR representing the throw-expression. */
24800 static tree
24802 {
24803 tree expression;
24808 /* Figure out whether or not there is an assignment-expression
24809 following the "throw" keyword. */
24817 else
24821 }
24823 /* GNU Extensions */
24825 /* Parse an (optional) asm-specification.
24827 asm-specification:
24828 asm ( string-literal )
24830 If the asm-specification is present, returns a STRING_CST
24831 corresponding to the string-literal. Otherwise, returns
24832 NULL_TREE. */
24834 static tree
24836 {
24838 tree asm_specification;
24840 /* Peek at the next token. */
24842 /* If the next token isn't the `asm' keyword, then there's no
24843 asm-specification. */
24847 /* Consume the `asm' token. */
24849 /* Look for the `('. */
24850 matching_parens parens;
24853 /* Look for the string-literal. */
24856 /* Look for the `)'. */
24860 }
24862 /* Parse an asm-operand-list.
24864 asm-operand-list:
24865 asm-operand
24866 asm-operand-list , asm-operand
24868 asm-operand:
24869 string-literal ( expression )
24870 [ string-literal ] string-literal ( expression )
24872 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24873 each node is the expression. The TREE_PURPOSE is itself a
24874 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24875 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24876 is a STRING_CST for the string literal before the parenthesis. Returns
24877 ERROR_MARK_NODE if any of the operands are invalid. */
24879 static tree
24881 {
24886 {
24887 tree string_literal;
24888 tree expression;
24889 tree name;
24892 {
24893 /* Consume the `[' token. */
24895 /* Read the operand name. */
24900 /* Look for the closing `]'. */
24902 }
24903 else
24905 /* Look for the string-literal. */
24908 /* Look for the `('. */
24909 matching_parens parens;
24911 /* Parse the expression. */
24913 /* Look for the `)'. */
24921 /* Add this operand to the list. */
24923 expression,
24924 asm_operands);
24925 /* If the next token is not a `,', there are no more
24926 operands. */
24929 /* Consume the `,'. */
24931 }
24934 }
24936 /* Parse an asm-clobber-list.
24938 asm-clobber-list:
24939 string-literal
24940 asm-clobber-list , string-literal
24942 Returns a TREE_LIST, indicating the clobbers in the order that they
24943 appeared. The TREE_VALUE of each node is a STRING_CST. */
24945 static tree
24947 {
24951 {
24952 tree string_literal;
24954 /* Look for the string literal. */
24956 /* Add it to the list. */
24958 /* If the next token is not a `,', then the list is
24959 complete. */
24962 /* Consume the `,' token. */
24964 }
24967 }
24969 /* Parse an asm-label-list.
24971 asm-label-list:
24972 identifier
24973 asm-label-list , identifier
24975 Returns a TREE_LIST, indicating the labels in the order that they
24976 appeared. The TREE_VALUE of each node is a label. */
24978 static tree
24980 {
24984 {
24987 /* Look for the identifier. */
24990 {
24993 {
24999 }
25000 }
25001 /* If the next token is not a `,', then the list is
25002 complete. */
25005 /* Consume the `,' token. */
25007 }
25010 }
25012 /* Return TRUE iff the next tokens in the stream are possibly the
25013 beginning of a GNU extension attribute. */
25015 static bool
25017 {
25019 }
25021 /* Return TRUE iff the next tokens in the stream are possibly the
25022 beginning of a standard C++-11 attribute specifier. */
25024 static bool
25026 {
25028 }
25030 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25031 beginning of a standard C++-11 attribute specifier. */
25033 static bool
25035 {
25043 }
25045 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25046 beginning of a GNU extension attribute. */
25048 static bool
25050 {
25054 }
25056 /* Return true iff the next tokens can be the beginning of either a
25057 GNU attribute list, or a standard C++11 attribute sequence. */
25059 static bool
25061 {
25064 }
25066 /* Return true iff the next Nth tokens can be the beginning of either
25067 a GNU attribute list, or a standard C++11 attribute sequence. */
25069 static bool
25071 {
25074 }
25076 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25077 of GNU attributes, or return NULL. */
25079 static tree
25081 {
25085 }
25087 /* Parse an (optional) series of attributes.
25089 attributes:
25090 attributes attribute
25092 attribute:
25093 __attribute__ (( attribute-list [opt] ))
25095 The return value is as for cp_parser_gnu_attribute_list. */
25097 static tree
25099 {
25106 {
25108 tree attribute_list;
25111 /* Peek at the next token. */
25113 /* If it's not `__attribute__', then we're done. */
25117 /* Consume the `__attribute__' keyword. */
25119 /* Look for the two `(' tokens. */
25120 matching_parens outer_parens;
25122 matching_parens inner_parens;
25125 /* Peek at the next token. */
25128 /* Parse the attribute-list. */
25130 else
25131 /* If the next token is a `)', then there is no attribute
25132 list. */
25135 /* Look for the two `)' tokens. */
25143 /* Add these new attributes to the list. */
25145 }
25148 }
25150 /* Parse a GNU attribute-list.
25152 attribute-list:
25153 attribute
25154 attribute-list , attribute
25156 attribute:
25157 identifier
25158 identifier ( identifier )
25159 identifier ( identifier , expression-list )
25160 identifier ( expression-list )
25162 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25163 to an attribute. The TREE_PURPOSE of each node is the identifier
25164 indicating which attribute is in use. The TREE_VALUE represents
25165 the arguments, if any. */
25167 static tree
25169 {
25175 {
25177 tree identifier;
25178 tree attribute;
25180 /* Look for the identifier. We also allow keywords here; for
25181 example `__attribute__ ((const))' is legal. */
25185 {
25188 /* Consume the token, but save it since we need it for the
25189 SIMD enabled function parsing. */
25192 /* Save away the identifier that indicates which attribute
25193 this is. */
25195 /* For keywords, use the canonical spelling, not the
25196 parsed identifier. */
25203 /* Peek at the next token. */
25205 /* If it's an `(', then parse the attribute arguments. */
25207 {
25211 vec = cp_parser_parenthesized_expression_list
25217 else
25218 {
25221 }
25222 /* Save the arguments away. */
25224 }
25227 {
25228 /* Add this attribute to the list. */
25231 }
25234 }
25235 /* Now, look for more attributes. If the next token isn't a
25236 `,', we're done. */
25240 /* Consume the comma and keep going. */
25242 }
25245 /* We built up the list in reverse order. */
25247 }
25249 /* Parse a standard C++11 attribute.
25251 The returned representation is a TREE_LIST which TREE_PURPOSE is
25252 the scoped name of the attribute, and the TREE_VALUE is its
25253 arguments list.
25255 Note that the scoped name of the attribute is itself a TREE_LIST
25256 which TREE_PURPOSE is the namespace of the attribute, and
25257 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25258 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25259 and which TREE_PURPOSE is directly the attribute name.
25261 Clients of the attribute code should use get_attribute_namespace
25262 and get_attribute_name to get the actual namespace and name of
25263 attributes, regardless of their being GNU or C++11 attributes.
25265 attribute:
25266 attribute-token attribute-argument-clause [opt]
25268 attribute-token:
25269 identifier
25270 attribute-scoped-token
25272 attribute-scoped-token:
25273 attribute-namespace :: identifier
25275 attribute-namespace:
25276 identifier
25278 attribute-argument-clause:
25279 ( balanced-token-seq )
25281 balanced-token-seq:
25282 balanced-token [opt]
25283 balanced-token-seq balanced-token
25285 balanced-token:
25286 ( balanced-token-seq )
25287 [ balanced-token-seq ]
25288 { balanced-token-seq }. */
25290 static tree
25292 {
25299 /* First, parse name of the attribute, a.k.a attribute-token. */
25316 {
25317 /* We are seeing a scoped attribute token. */
25332 else
25333 {
25337 }
25341 NULL_TREE);
25343 }
25346 NULL_TREE);
25347 else
25348 {
25351 NULL_TREE);
25352 /* C++11 noreturn attribute is equivalent to GNU's. */
25355 /* C++14 deprecated attribute is equivalent to GNU's. */
25358 /* C++17 fallthrough attribute is equivalent to GNU's. */
25361 /* Transactional Memory TS optimize_for_synchronized attribute is
25362 equivalent to GNU transaction_callable. */
25366 /* Transactional Memory attributes are GNU attributes. */
25369 }
25371 /* Now parse the optional argument clause of the attribute. */
25376 {
25382 /* A GNU attribute that takes an identifier in parameter. */
25385 vec = cp_parser_parenthesized_expression_list
25391 else
25392 {
25395 }
25399 else
25401 }
25404 }
25406 /* Check that the attribute ATTRIBUTE appears at most once in the
25407 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25408 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25409 isn't implemented yet in GCC. */
25411 static void
25413 {
25415 {
25425 }
25426 }
25428 /* Parse a list of standard C++-11 attributes.
25430 attribute-list:
25431 attribute [opt]
25432 attribute-list , attribute[opt]
25433 attribute ...
25434 attribute-list , attribute ...
25435 */
25437 static tree
25439 {
25444 {
25449 {
25453 }
25456 {
25461 else
25462 {
25467 }
25469 }
25473 }
25476 }
25478 /* Parse a standard C++-11 attribute specifier.
25480 attribute-specifier:
25481 [ [ attribute-using-prefix [opt] attribute-list ] ]
25482 alignment-specifier
25484 attribute-using-prefix:
25485 using attribute-namespace :
25487 alignment-specifier:
25488 alignas ( type-id ... [opt] )
25489 alignas ( alignment-expression ... [opt] ). */
25491 static tree
25493 {
25499 {
25506 {
25517 {
25521 "attribute using prefix only available "
25527 }
25528 else
25530 }
25537 else
25538 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25539 when we are sure that we have actually parsed them. */
25541 }
25542 else
25543 {
25544 tree alignas_expr;
25546 /* Look for an alignment-specifier. */
25557 matching_parens parens;
25565 {
25572 }
25577 /* Handle alignas (pack...). */
25579 {
25582 }
25584 /* Something went wrong, so don't build the attribute. */
25591 /* Build the C++-11 representation of an 'aligned'
25592 attribute. */
25593 attributes
25596 }
25599 }
25601 /* Parse a standard C++-11 attribute-specifier-seq.
25603 attribute-specifier-seq:
25604 attribute-specifier-seq [opt] attribute-specifier
25605 */
25607 static tree
25609 {
25614 {
25623 else
25626 }
25629 }
25631 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25632 return index of the first token after balanced-token, or N on failure. */
25634 static size_t
25636 {
25639 do
25641 {
25644 /* Ran out of tokens. */
25666 }
25669 }
25671 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25672 return index of the first token after the GNU attribute tokens, or N on
25673 failure. */
25675 static size_t
25677 {
25679 {
25691 }
25693 }
25695 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25696 next token), return index of the first token after the standard C++11
25697 attribute tokens, or N on failure. */
25699 static size_t
25701 {
25703 {
25706 {
25713 }
25716 {
25721 }
25722 else
25724 }
25726 }
25728 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25729 as the next token), return index of the first token after the attribute
25730 tokens, or N on failure. */
25732 static size_t
25734 {
25738 }
25740 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25741 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25742 current value of the PEDANTIC flag, regardless of whether or not
25743 the `__extension__' keyword is present. The caller is responsible
25744 for restoring the value of the PEDANTIC flag. */
25746 static bool
25748 {
25749 /* Save the old value of the PEDANTIC flag. */
25753 {
25754 /* Consume the `__extension__' token. */
25756 /* We're not being pedantic while the `__extension__' keyword is
25757 in effect. */
25761 }
25764 }
25766 /* Parse a label declaration.
25768 label-declaration:
25769 __label__ label-declarator-seq ;
25771 label-declarator-seq:
25772 identifier , label-declarator-seq
25773 identifier */
25775 static void
25777 {
25778 /* Look for the `__label__' keyword. */
25782 {
25783 tree identifier;
25785 /* Look for an identifier. */
25787 /* If we failed, stop. */
25790 /* Declare it as a label. */
25792 /* If the next token is a `;', stop. */
25795 /* Look for the `,' separating the label declarations. */
25797 }
25799 /* Look for the final `;'. */
25801 }
25803 // -------------------------------------------------------------------------- //
25804 // Requires Clause
25806 // Parse a requires clause.
25807 //
25808 // requires-clause:
25809 // 'requires' logical-or-expression
25810 //
25811 // The required logical-or-expression must be a constant expression. Note
25812 // that we don't check that the expression is constepxr here. We defer until
25813 // we analyze constraints and then, we only check atomic constraints.
25814 static tree
25816 {
25817 // Parse the requires clause so that it is not automatically folded.
25825 }
25827 // Optionally parse a requires clause:
25828 static tree
25830 {
25833 {
25836 {
25839 /* Parse and discard the requires-clause. */
25842 }
25844 }
25847 }
25850 /*---------------------------------------------------------------------------
25851 Requires expressions
25852 ---------------------------------------------------------------------------*/
25854 /* Parse a requires expression
25856 requirement-expression:
25857 'requires' requirement-parameter-list [opt] requirement-body */
25858 static tree
25860 {
25864 /* A requires-expression shall appear only within a concept
25865 definition or a requires-clause.
25867 TODO: Implement this diagnostic correctly. */
25869 {
25873 }
25876 {
25877 /* Local parameters are delared as variables within the scope
25878 of the expression. They are not visible past the end of
25879 the expression. Expressions within the requires-expression
25880 are unevaluated. */
25881 struct scope_sentinel
25882 {
25884 {
25887 }
25890 {
25893 }
25896 /* Parse the optional parameter list. */
25898 {
25902 }
25903 else
25906 /* Parse the requirement body. */
25910 }
25912 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25913 the parm chain. */
25916 }
25918 /* Parse a parameterized requirement.
25920 requirement-parameter-list:
25921 '(' parameter-declaration-clause ')' */
25922 static tree
25924 {
25925 matching_parens parens;
25935 }
25937 /* Parse the body of a requirement.
25939 requirement-body:
25940 '{' requirement-list '}' */
25941 static tree
25943 {
25944 matching_braces braces;
25954 }
25956 /* Parse a list of requirements.
25958 requirement-list:
25959 requirement
25960 requirement-list ';' requirement[opt] */
25961 static tree
25963 {
25966 {
25973 /* If we see a semi-colon, consume it. */
25977 /* Stop processing at the end of the list. */
25980 }
25982 /* Reverse the order of requirements so they are analyzed in
25983 declaration order. */
25985 }
25987 /* Parse a syntactic requirement or type requirement.
25989 requirement:
25990 simple-requirement
25991 compound-requirement
25992 type-requirement
25993 nested-requirement */
25994 static tree
25996 {
26003 else
26005 }
26007 /* Parse a simple requirement.
26009 simple-requirement:
26010 expression ';' */
26011 static tree
26013 {
26022 }
26024 /* Parse a type requirement
26026 type-requirement
26027 nested-name-specifier [opt] required-type-name ';'
26029 required-type-name:
26030 type-name
26031 'template' [opt] simple-template-id */
26032 static tree
26034 {
26037 // Save the scope before parsing name specifiers.
26048 tree type;
26050 {
26059 }
26060 else
26079 }
26081 /* Parse a compound requirement
26083 compound-requirement:
26084 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26085 static tree
26087 {
26088 /* Parse an expression enclosed in '{ }'s. */
26089 matching_braces braces;
26100 /* Parse the optional noexcept. */
26103 {
26106 }
26108 /* Parse the optional trailing return type. */
26111 {
26119 }
26122 }
26124 /* Parse a nested requirement. This is the same as a requires clause.
26126 nested-requirement:
26127 requires-clause */
26128 static tree
26130 {
26136 }
26138 /* Support Functions */
26140 /* Return the appropriate prefer_type argument for lookup_name_real based on
26141 tag_type and template_mem_access. */
26145 {
26146 /* DR 141: When looking in the current enclosing context for a template-name
26147 after -> or ., only consider class templates. */
26151 {
26155 }
26156 }
26158 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26159 NAME should have one of the representations used for an
26160 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26161 is returned. If PARSER->SCOPE is a dependent type, then a
26162 SCOPE_REF is returned.
26164 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26165 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26166 was formed. Abstractly, such entities should not be passed to this
26167 function, because they do not need to be looked up, but it is
26168 simpler to check for this special case here, rather than at the
26169 call-sites.
26171 In cases not explicitly covered above, this function returns a
26172 DECL, OVERLOAD, or baselink representing the result of the lookup.
26173 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26174 is returned.
26176 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26177 (e.g., "struct") that was used. In that case bindings that do not
26178 refer to types are ignored.
26180 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26181 ignored.
26183 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26184 are ignored.
26186 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26187 types.
26189 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26190 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26191 NULL_TREE otherwise. */
26193 static cp_expr
26200 location_t name_location)
26201 {
26202 tree decl;
26205 /* Assume that the lookup will be unambiguous. */
26209 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26210 no longer valid. Note that if we are parsing tentatively, and
26211 the parse fails, OBJECT_TYPE will be automatically restored. */
26217 /* A template-id has already been resolved; there is no lookup to
26218 do. */
26222 {
26226 }
26228 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26229 it should already have been checked to make sure that the name
26230 used matches the type being destroyed. */
26232 {
26233 tree type;
26235 /* Figure out to which type this destructor applies. */
26240 else
26242 /* If that's not a class type, there is no destructor. */
26253 }
26255 /* By this point, the NAME should be an ordinary identifier. If
26256 the id-expression was a qualified name, the qualifying scope is
26257 stored in PARSER->SCOPE at this point. */
26260 /* Perform the lookup. */
26262 {
26268 /* If the SCOPE is dependent, the lookup must be deferred until
26269 the template is instantiated -- unless we are explicitly
26270 looking up names in uninstantiated templates. Even then, we
26271 cannot look up the name if the scope is not a class type; it
26272 might, for example, be a template type parameter. */
26277 /* Defer lookup. */
26279 else
26280 {
26283 /* If PARSER->SCOPE is a dependent type, then it must be a
26284 class type, and we must not be checking dependencies;
26285 otherwise, we would have processed this lookup above. So
26286 that PARSER->SCOPE is not considered a dependent base by
26287 lookup_member, we must enter the scope here. */
26291 /* If the PARSER->SCOPE is a template specialization, it
26292 may be instantiated during name lookup. In that case,
26293 errors may be issued. Even if we rollback the current
26294 tentative parse, those errors are valid. */
26299 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26300 lookup result and the nested-name-specifier nominates a class C:
26301 * if the name specified after the nested-name-specifier, when
26302 looked up in C, is the injected-class-name of C (Clause 9), or
26303 * if the name specified after the nested-name-specifier is the
26304 same as the identifier or the simple-template-id's template-
26305 name in the last component of the nested-name-specifier,
26306 the name is instead considered to name the constructor of
26307 class C. [ Note: for example, the constructor is not an
26308 acceptable lookup result in an elaborated-type-specifier so
26309 the constructor would not be used in place of the
26310 injected-class-name. --end note ] Such a constructor name
26311 shall be used only in the declarator-id of a declaration that
26312 names a constructor or in a using-declaration. */
26320 /* If we have a single function from a using decl, pull it out. */
26327 }
26329 /* If the scope is a dependent type and either we deferred lookup or
26330 we did lookup but didn't find the name, rememeber the name. */
26333 {
26335 {
26336 tree type;
26338 /* The resolution to Core Issue 180 says that `struct
26339 A::B' should be considered a type-name, even if `A'
26340 is dependent. */
26345 }
26349 CPP_CLOSE_PAREN)))
26353 else
26356 is_template);
26357 }
26360 }
26362 {
26363 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26364 OBJECT_TYPE is not a class. */
26366 /* If the OBJECT_TYPE is a template specialization, it may
26367 be instantiated during name lookup. In that case, errors
26368 may be issued. Even if we rollback the current tentative
26369 parse, those errors are valid. */
26371 name,
26374 tf_warning_or_error);
26375 else
26379 /* Look it up in the enclosing context. DR 141: When looking for a
26380 template-name after -> or ., only consider class templates. */
26385 /* The object is type-dependent, so we can't look anything up; we used
26386 this to get the DR 141 behavior. */
26390 }
26391 else
26392 {
26398 }
26400 /* If the lookup failed, let our caller know. */
26404 /* Pull out the template from an injected-class-name (or multiple). */
26408 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26410 {
26413 /* The error message we have to print is too complicated for
26414 cp_parser_error, so we incorporate its actions directly. */
26416 {
26418 name);
26420 }
26422 }
26430 /* If we have resolved the name of a member declaration, check to
26431 see if the declaration is accessible. When the name resolves to
26432 set of overloaded functions, accessibility is checked when
26433 overload resolution is done.
26435 During an explicit instantiation, access is not checked at all,
26436 as per [temp.explicit]. */
26443 }
26445 /* Like cp_parser_lookup_name, but for use in the typical case where
26446 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26447 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26449 static tree
26451 {
26453 none_type,
26458 location);
26459 }
26461 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26462 the current context, return the TYPE_DECL. If TAG_NAME_P is
26463 true, the DECL indicates the class being defined in a class-head,
26464 or declared in an elaborated-type-specifier.
26466 Otherwise, return DECL. */
26468 static tree
26470 {
26471 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26472 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26474 struct A {
26475 template <typename T> struct B;
26476 };
26478 template <typename T> struct A::B {};
26480 Similarly, in an elaborated-type-specifier:
26482 namespace N { struct X{}; }
26484 struct A {
26485 template <typename T> friend struct N::X;
26486 };
26488 However, if the DECL refers to a class type, and we are in
26489 the scope of the class, then the name lookup automatically
26490 finds the TYPE_DECL created by build_self_reference rather
26491 than a TEMPLATE_DECL. For example, in:
26493 template <class T> struct S {
26494 S s;
26495 };
26497 there is no need to handle such case. */
26503 }
26505 /* If too many, or too few, template-parameter lists apply to the
26506 declarator, issue an error message. Returns TRUE if all went well,
26507 and FALSE otherwise. */
26509 static bool
26512 location_t declarator_location)
26513 {
26515 {
26517 {
26526 {
26527 /* If the DECLARATOR has the form `X<y>' then it uses one
26528 additional level of template parameters. */
26531 }
26533 return cp_parser_check_template_parameters
26535 declarator);
26536 }
26552 }
26554 }
26556 /* NUM_TEMPLATES were used in the current declaration. If that is
26557 invalid, return FALSE and issue an error messages. Otherwise,
26558 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26559 declarator and we can print more accurate diagnostics. */
26561 static bool
26565 location_t location,
26567 {
26568 /* If there are the same number of template classes and parameter
26569 lists, that's OK. */
26572 /* If there are more, but only one more, and the name ends in an identifier,
26573 then we are declaring a primary template. That's OK too. */
26577 /* If there are more template classes than parameter lists, we have
26578 something like:
26580 template <class T> void S<T>::R<T>::f (); */
26582 {
26592 else
26595 }
26596 /* Otherwise, there are too many template parameter lists. We have
26597 something like:
26599 template <class T> template <class U> void S::f(); */
26602 }
26604 /* Parse an optional `::' token indicating that the following name is
26605 from the global namespace. If so, PARSER->SCOPE is set to the
26606 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26607 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26608 Returns the new value of PARSER->SCOPE, if the `::' token is
26609 present, and NULL_TREE otherwise. */
26611 static tree
26613 {
26616 /* Peek at the next token. */
26618 /* If we're looking at a `::' token then we're starting from the
26619 global namespace, not our current location. */
26621 {
26622 /* Consume the `::' token. */
26624 /* Set the SCOPE so that we know where to start the lookup. */
26630 }
26632 {
26636 }
26639 }
26641 /* Returns TRUE if the upcoming token sequence is the start of a
26642 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26643 declarator is preceded by the `friend' specifier. */
26645 static bool
26647 {
26650 tree nested_name_specifier;
26653 /* The common case is that this is not a constructor declarator, so
26654 try to avoid doing lots of work if at all possible. It's not
26655 valid declare a constructor at function scope. */
26658 /* And only certain tokens can begin a constructor declarator. */
26666 /* Parse tentatively; we are going to roll back all of the tokens
26667 consumed here. */
26669 /* Assume that we are looking at a constructor declarator. */
26672 /* Look for the optional `::' operator. */
26675 /* Look for the nested-name-specifier. */
26676 nested_name_specifier
26687 /* Outside of a class-specifier, there must be a
26688 nested-name-specifier. Except in C++17 mode, where we
26689 might be declaring a guiding declaration. */
26696 /* If we have a class scope, this is easy; DR 147 says that S::S always
26697 names the constructor, and no other qualified name could. */
26700 {
26710 }
26711 /* If we still think that this might be a constructor-declarator,
26712 look for a class-name. */
26714 {
26715 /* If we have:
26717 template <typename T> struct S {
26718 S();
26719 };
26721 we must recognize that the nested `S' names a class. */
26725 tree type_decl;
26729 none_type,
26736 {
26742 none_type,
26747 else
26749 }
26751 /* If there was no class-name, then this is not a constructor.
26752 Otherwise, if we are in a class-specifier and we aren't
26753 handling a friend declaration, check that its type matches
26754 current_class_type (c++/38313). Note: error_mark_node
26755 is left alone for error recovery purposes. */
26757 && (outside_class_specifier_p
26763 /* If we're still considering a constructor, we have to see a `(',
26764 to begin the parameter-declaration-clause, followed by either a
26765 `)', an `...', or a decl-specifier. We need to check for a
26766 type-specifier to avoid being fooled into thinking that:
26768 S (f) (int);
26770 is a constructor. (It is actually a function named `f' that
26771 takes one parameter (of type `int') and returns a value of type
26772 `S'. */
26780 /* A parameter declaration begins with a decl-specifier,
26781 which is either the "attribute" keyword, a storage class
26782 specifier, or (usually) a type-specifier. */
26784 {
26785 tree type;
26789 /* Names appearing in the type-specifier should be looked up
26790 in the scope of the class. */
26794 {
26797 {
26801 {
26804 }
26805 }
26807 }
26809 /* Inside the constructor parameter list, surrounding
26810 template-parameter-lists do not apply. */
26811 saved_num_template_parameter_lists
26815 /* Look for the type-specifier. */
26817 CP_PARSER_FLAGS_NONE,
26823 parser->num_template_parameter_lists
26826 /* Leave the scope of the class. */
26831 }
26832 }
26834 /* We did not really want to consume any tokens. */
26838 }
26840 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26841 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26842 they must be performed once we are in the scope of the function.
26844 Returns the function defined. */
26846 static tree
26847 cp_parser_function_definition_from_specifiers_and_declarator
26850 tree attributes,
26852 {
26853 tree fn;
26856 /* Begin the function-definition. */
26859 /* The things we're about to see are not directly qualified by any
26860 template headers we've seen thus far. */
26863 /* If there were names looked up in the decl-specifier-seq that we
26864 did not check, check them now. We must wait until we are in the
26865 scope of the function to perform the checks, since the function
26866 might be a friend. */
26870 {
26875 }
26878 {
26879 /* Skip the entire function. */
26882 }
26884 {
26885 /* Seen already, skip it. An error message has already been output. */
26889 /* If this is a function from a class, pop the nested class. */
26892 }
26893 else
26894 {
26895 timevar_id_t tv;
26898 else
26904 }
26907 }
26909 /* Parse the part of a function-definition that follows the
26910 declarator. INLINE_P is TRUE iff this function is an inline
26911 function defined within a class-specifier.
26913 Returns the function defined. */
26915 static tree
26918 {
26919 tree fn;
26924 bool fully_implicit_function_template_p
26927 tree implicit_template_parms
26930 cp_binding_level* implicit_template_scope
26936 /* If the next token is `return', then the code may be trying to
26937 make use of the "named return value" extension that G++ used to
26938 support. */
26941 {
26942 /* Consume the `return' keyword. */
26944 /* Look for the identifier that indicates what value is to be
26945 returned. */
26947 /* Issue an error message. */
26950 /* Skip tokens until we reach the start of the function body. */
26952 {
26959 }
26960 }
26961 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26962 anything declared inside `f'. */
26963 saved_in_unbraced_linkage_specification_p
26966 /* Inside the function, surrounding template-parameter-lists do not
26967 apply. */
26968 saved_num_template_parameter_lists
26972 /* If the next token is `try', `__transaction_atomic', or
26973 `__transaction_relaxed`, then we are looking at either function-try-block
26974 or function-transaction-block. Note that all of these include the
26975 function-body. */
26979 RID_TRANSACTION_RELAXED))
26983 else
26984 cp_parser_ctor_initializer_opt_and_function_body
26987 /* Finish the function. */
26989 /* Generate code for it, if necessary. */
26991 /* Restore the saved values. */
26992 parser->in_unbraced_linkage_specification_p
26994 parser->num_template_parameter_lists
26998 parser->fully_implicit_function_template_p
27000 parser->implicit_template_parms
27002 parser->implicit_template_scope
27009 }
27011 /* Parse a template-declaration body (following argument list). */
27013 static void
27015 tree parameter_list,
27017 {
27021 /* We just processed one more parameter list. */
27024 /* Get the deferred access checks from the parameter list. These
27025 will be checked once we know what is being declared, as for a
27026 member template the checks must be performed in the scope of the
27027 class containing the member. */
27030 /* Tentatively parse for a new template parameter list, which can either be
27031 the template keyword or a template introduction. */
27037 else
27038 {
27039 /* There are no access checks when parsing a template, as we do not
27040 know if a specialization will be a friend. */
27044 checks,
27045 member_p,
27050 /* If this is a member template declaration, let the front
27051 end know. */
27053 {
27058 }
27063 }
27064 /* We are done with the current parameter list. */
27069 /* Finish up. */
27072 /* Check the template arguments for a literal operator template. */
27076 {
27080 else
27081 {
27084 {
27090 }
27092 {
27101 }
27102 else
27104 }
27106 {
27109 " Expected non-type template argument pack <char...>"
27111 decl);
27112 else
27115 decl);
27116 }
27117 }
27119 /* Register member declarations. */
27122 /* If DECL is a function template, we must return to parse it later.
27123 (Even though there is no definition, there might be default
27124 arguments that need handling.) */
27128 }
27130 /* Parse a template introduction header for a template-declaration. Returns
27131 false if tentative parse fails. */
27133 static bool
27135 {
27142 /* Look for the optional `::' operator. */
27145 /* Look for the nested-name-specifier. */
27155 /* Look up the concept for which we will be matching
27156 template parameters. */
27166 /* Look for opening brace for introduction. */
27167 matching_braces braces;
27175 /* Build vector of placeholder parameters and grab
27176 matching identifiers. */
27179 /* The introduction-list shall not be empty. */
27182 {
27185 }
27187 /* Look for closing brace for introduction. */
27192 {
27196 }
27198 /* Build and associate the constraint. */
27201 {
27203 member_p);
27205 }
27209 }
27211 /* Parse a normal template-declaration following the template keyword. */
27213 static void
27215 {
27216 tree parameter_list;
27220 /* Look for the `<' token. */
27224 {
27225 /* 14.5.2.2 [temp.mem]
27227 A local class shall not have member templates. */
27232 }
27233 /* [temp]
27235 A template ... shall not have C linkage. */
27237 {
27240 /* Give it C++ linkage to avoid confusing other parts of the
27241 front end. */
27244 }
27245 else
27248 /* We cannot perform access checks on the template parameter
27249 declarations until we know what is being declared, just as we
27250 cannot check the decl-specifier list. */
27253 /* If the next token is `>', then we have an invalid
27254 specialization. Rather than complain about an invalid template
27255 parameter, issue an error message here. */
27257 {
27261 }
27262 else
27263 {
27264 /* Parse the template parameters. */
27266 }
27268 /* Look for the `>'. */
27271 /* Manage template requirements */
27273 {
27278 }
27281 member_p);
27283 /* For the erroneous case of a template with C linkage, we pushed an
27284 implicit C++ linkage scope; exit that scope now. */
27287 }
27289 /* Parse a template-declaration, assuming that the `export' (and
27290 `extern') keywords, if present, has already been scanned. MEMBER_P
27291 is as for cp_parser_template_declaration. */
27293 static bool
27295 {
27297 {
27301 }
27306 }
27308 /* Perform the deferred access checks from a template-parameter-list.
27309 CHECKS is a TREE_LIST of access checks, as returned by
27310 get_deferred_access_checks. */
27312 static void
27313 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27314 {
27318 }
27320 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27321 `function-definition' sequence that follows a template header.
27322 If MEMBER_P is true, this declaration appears in a class scope.
27324 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27325 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27327 static tree
27333 {
27336 cp_decl_specifier_seq decl_specifiers;
27340 /* This function is only used when processing a template
27341 declaration. */
27345 /* Defer access checks until we know what is being declared. */
27348 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27349 alternative. */
27352 CP_PARSER_FLAGS_OPTIONAL,
27358 /* There are no template typedefs. */
27360 {
27364 }
27366 /* Gather up the access checks that occurred the
27367 decl-specifier-seq. */
27370 /* Check for the declaration of a template class. */
27372 {
27375 {
27376 // If this is a declaration, but not a definition, associate
27377 // any constraints with the type declaration. Constraints
27378 // are associated with definitions in cp_parser_class_specifier.
27384 /* In this case:
27386 struct C {
27387 friend template <typename T> struct A<T>::B;
27388 };
27390 A<T>::B will be represented by a TYPENAME_TYPE, and
27391 therefore not recognized by shadow_tag. */
27393 && !decl
27400 else
27403 /* Perform access checks for template parameters. */
27406 /* Give a helpful diagnostic for
27407 template <class T> struct A { } a;
27408 if we aren't already recovering from an error. */
27411 {
27413 "a class template declaration must not declare "
27417 }
27418 }
27419 }
27421 /* Complain about missing 'typename' or other invalid type names. */
27424 {
27425 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27426 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27427 the rest of this declaration. */
27430 }
27432 /* If it's not a template class, try for a template function. If
27433 the next token is a `;', then this declaration does not declare
27434 anything. But, if there were errors in the decl-specifiers, then
27435 the error might well have come from an attempted class-specifier.
27436 In that case, there's no need to warn about a missing declarator. */
27440 {
27443 checks,
27445 member_p,
27446 declares_class_or_enum,
27450 /* 7.1.1-1 [dcl.stc]
27452 A storage-class-specifier shall not be specified in an explicit
27453 specialization... */
27455 && explicit_specialization_p
27457 {
27461 }
27465 }
27467 /* Look for a trailing `;' after the declaration. */
27473 out:
27476 /* Clear any current qualification; whatever comes next is the start
27477 of something new. */
27483 }
27485 /* Parse a cast-expression that is not the operand of a unary "&". */
27487 static cp_expr
27489 {
27492 }
27494 /* Parse a functional cast to TYPE. Returns an expression
27495 representing the cast. */
27497 static cp_expr
27499 {
27501 tree expression_list;
27502 cp_expr cast;
27511 {
27521 /* Create a location of the form:
27522 type_name{i, f}
27523 ^~~~~~~~~~~~~~~
27524 with caret == start at the start of the type name,
27525 finishing at the closing brace. */
27526 location_t finish_loc
27529 finish_loc);
27532 }
27541 else
27542 {
27545 }
27548 tf_warning_or_error);
27549 /* [expr.const]/1: In an integral constant expression "only type
27550 conversions to integral or enumeration type can be used". */
27556 NIC_CONSTRUCTOR))
27559 /* Create a location of the form:
27560 float(i)
27561 ^~~~~~~~
27562 with caret == start at the start of the type name,
27563 finishing at the closing paren. */
27564 location_t finish_loc
27569 }
27571 /* Save the tokens that make up the body of a member function defined
27572 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27573 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27574 specifiers applied to the declaration. Returns the FUNCTION_DECL
27575 for the member function. */
27577 static tree
27581 tree attributes)
27582 {
27585 tree fn;
27588 /* Create the FUNCTION_DECL. */
27592 /* If something went badly wrong, bail out now. */
27594 {
27595 /* If there's a function-body, skip it. */
27600 }
27602 /* Remember it, if there default args to post process. */
27605 /* Save away the tokens that make up the body of the
27606 function. */
27612 RID_TRANSACTION_ATOMIC))
27613 {
27615 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27622 {
27628 }
27629 else
27632 {
27636 }
27637 }
27639 /* Handle function try blocks. */
27641 {
27644 }
27645 /* We can have braced-init-list mem-initializers before the fn body. */
27647 {
27650 {
27651 /* cache_group will stop after an un-nested { } pair, too. */
27655 /* variadic mem-inits have ... after the ')'. */
27658 }
27659 }
27661 /* Handle function try blocks. */
27667 /* Save away the inline definition; we will process it when the
27668 class is complete. */
27672 /* We need to know that this was defined in the class, so that
27673 friend templates are handled correctly. */
27676 /* Add FN to the queue of functions to be parsed later. */
27680 }
27682 /* Save the tokens that make up the in-class initializer for a non-static
27683 data member. Returns a DEFAULT_ARG. */
27685 static tree
27687 {
27689 }
27691 /* Parse a template-argument-list, as well as the trailing ">" (but
27692 not the opening "<"). See cp_parser_template_argument_list for the
27693 return value. */
27695 static tree
27697 {
27698 tree arguments;
27699 tree saved_scope;
27700 tree saved_qualifying_scope;
27701 tree saved_object_scope;
27706 /* [temp.names]
27708 When parsing a template-id, the first non-nested `>' is taken as
27709 the end of the template-argument-list rather than a greater-than
27710 operator. */
27711 saved_greater_than_is_operator_p
27714 /* Parsing the argument list may modify SCOPE, so we save it
27715 here. */
27719 /* We need to evaluate the template arguments, even though this
27720 template-id may be nested within a "sizeof". */
27725 /* Parse the template-argument-list itself. */
27729 else
27731 /* Look for the `>' that ends the template-argument-list. If we find
27732 a '>>' instead, it's probably just a typo. */
27734 {
27736 {
27737 /* In C++0x, a `>>' in a template argument list or cast
27738 expression is considered to be two separate `>'
27739 tokens. So, change the current token to a `>', but don't
27740 consume it: it will be consumed later when the outer
27741 template argument list (or cast expression) is parsed.
27742 Note that this replacement of `>' for `>>' is necessary
27743 even if we are parsing tentatively: in the tentative
27744 case, after calling
27745 cp_parser_enclosed_template_argument_list we will always
27746 throw away all of the template arguments and the first
27747 closing `>', either because the template argument list
27748 was erroneous or because we are replacing those tokens
27749 with a CPP_TEMPLATE_ID token. The second `>' (which will
27750 not have been thrown away) is needed either to close an
27751 outer template argument list or to complete a new-style
27752 cast. */
27755 }
27757 {
27758 /* If we're in a nested template argument list, the '>>' has
27759 to be a typo for '> >'. We emit the error message, but we
27760 continue parsing and we push a '>' as next token, so that
27761 the argument list will be parsed correctly. Note that the
27762 global source location is still on the token before the
27763 '>>', so we need to say explicitly where we want it. */
27771 }
27772 else
27773 {
27774 /* If this is not a nested template argument list, the '>>'
27775 is a typo for '>'. Emit an error message and continue.
27776 Same deal about the token location, but here we can get it
27777 right by consuming the '>>' before issuing the diagnostic. */
27780 "spurious %<>>%>, use %<>%> to terminate "
27782 }
27783 }
27784 else
27786 /* The `>' token might be a greater-than operator again now. */
27787 parser->greater_than_is_operator_p
27789 /* Restore the SAVED_SCOPE. */
27797 }
27799 /* MEMBER_FUNCTION is a member function, or a friend. If default
27800 arguments, or the body of the function have not yet been parsed,
27801 parse them now. */
27803 static void
27805 {
27807 /* If this member is a template, get the underlying
27808 FUNCTION_DECL. */
27812 /* There should not be any class definitions in progress at this
27813 point; the bodies of members are only parsed outside of all class
27814 definitions. */
27816 /* While we're parsing the member functions we might encounter more
27817 classes. We want to handle them right away, but we don't want
27818 them getting mixed up with functions that are currently in the
27819 queue. */
27822 /* Make sure that any template parameters are in scope. */
27825 /* If the body of the function has not yet been parsed, parse it
27826 now. */
27828 {
27829 tree function_scope;
27832 /* The function is no longer pending; we are processing it. */
27837 /* If this is a local class, enter the scope of the containing
27838 function. */
27843 /* Push the body of the function onto the lexer stack. */
27846 /* Let the front end know that we going to be defining this
27847 function. */
27851 /* Don't do access checking if it is a templated function. */
27855 /* #pragma omp declare reduction needs special parsing. */
27857 {
27862 }
27863 else
27864 /* Now, parse the body of the function. */
27871 /* Leave the scope of the containing function. */
27875 }
27877 /* Remove any template parameters from the symbol table. */
27880 /* Restore the queue. */
27883 }
27885 /* If DECL contains any default args, remember it on the unparsed
27886 functions queue. */
27888 static void
27890 {
27891 tree probe;
27894 probe;
27897 {
27901 }
27902 }
27904 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27905 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27906 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27907 from the parameter-type-list. */
27909 static tree
27912 {
27914 tree parsed_arg;
27920 /* Push the saved tokens for the default argument onto the parser's
27921 lexer stack. */
27927 /* Parse the default argument. */
27938 {
27939 /* In a non-template class, check conversions now. In a template,
27940 we'll wait and instantiate these as needed. */
27943 tf_warning_or_error);
27946 else
27948 }
27950 /* If the token stream has not been completely used up, then
27951 there was extra junk after the end of the default
27952 argument. */
27954 {
27957 else
27959 }
27961 /* Revert to the main lexer. */
27965 }
27967 /* FIELD is a non-static data member with an initializer which we saved for
27968 later; parse it now. */
27970 static void
27972 {
27973 tree def;
27980 NULL_TREE);
27986 }
27988 /* FN is a FUNCTION_DECL which may contains a parameter with an
27989 unparsed DEFAULT_ARG. Parse the default args now. This function
27990 assumes that the current scope is the scope in which the default
27991 argument should be processed. */
27993 static void
27995 {
27999 /* While we're parsing the default args, we might (due to the
28000 statement expression extension) encounter more classes. We want
28001 to handle them right away, but we don't want them getting mixed
28002 up with default args that are currently in the queue. */
28005 /* Local variable names (and the `this' keyword) may not appear
28006 in a default argument. */
28017 {
28019 tree parsed_arg;
28021 tree copy;
28028 /* This can happen for a friend declaration for a function
28029 already declared with default arguments. */
28032 parsed_arg
28034 default_arg,
28038 /* Update any instantiations we've already created. */
28042 }
28046 /* Make sure no default arg is missing. */
28049 /* Restore the state of local_variables_forbidden_p. */
28052 /* Restore the queue. */
28054 }
28056 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28058 sizeof ... ( identifier )
28060 where the 'sizeof' token has already been consumed. */
28062 static tree
28064 {
28065 /* Consume the `...'. */
28069 matching_parens parens;
28073 else
28081 /* The name is not qualified. */
28100 }
28102 /* Parse the operand of `sizeof' (or a similar operator). Returns
28103 either a TYPE or an expression, depending on the form of the
28104 input. The KEYWORD indicates which kind of expression we have
28105 encountered. */
28107 static tree
28109 {
28116 /* If it's a `...', then we are computing the length of a parameter
28117 pack. */
28122 /* Types cannot be defined in a `sizeof' expression. Save away the
28123 old message. */
28125 /* And create the new one. */
28131 /* The restrictions on constant-expressions do not apply inside
28132 sizeof expressions. */
28133 saved_integral_constant_expression_p
28135 saved_non_integral_constant_expression_p
28139 /* Do not actually evaluate the expression. */
28142 /* If it's a `(', then we might be looking at the type-id
28143 construction. */
28145 {
28148 /* We can't be sure yet whether we're looking at a type-id or an
28149 expression. */
28152 matching_parens parens;
28155 /* Note: as a GNU Extension, compound literals are considered
28156 postfix-expressions as they are in C99, so they are valid
28157 arguments to sizeof. See comment in cp_parser_cast_expression
28158 for details. */
28161 else
28162 {
28165 /* Look for the type-id. */
28167 /* Look for the closing `)'. */
28170 }
28172 /* If all went well, then we're done. */
28174 {
28175 cp_decl_specifier_seq decl_specs;
28177 /* Build a trivial decl-specifier-seq. */
28181 /* Call grokdeclarator to figure out what type this is. */
28184 TYPENAME,
28187 }
28188 }
28190 /* If the type-id production did not work out, then we must be
28191 looking at the unary-expression production. */
28195 /* Go back to evaluating expressions. */
28199 /* Free the message we created. */
28201 /* And restore the old one. */
28203 parser->integral_constant_expression_p
28205 parser->non_integral_constant_expression_p
28209 }
28211 /* If the current declaration has no declarator, return true. */
28213 static bool
28215 {
28216 /* If the next token is a `;' or a `,' then there is no
28217 declarator. */
28220 }
28222 /* Update the DECL_SPECS to reflect the storage class indicated by
28223 KEYWORD. */
28225 static void
28230 {
28231 cp_storage_class storage_class;
28234 {
28238 }
28240 {
28243 }
28248 {
28251 }
28254 {
28272 }
28276 /* A storage class specifier cannot be applied alongside a typedef
28277 specifier. If there is a typedef specifier present then set
28278 conflicting_specifiers_p which will trigger an error later
28279 on in grokdeclarator. */
28282 }
28284 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28285 is true, the type is a class or enum definition. */
28287 static void
28289 tree type_spec,
28292 {
28295 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28296 (with, for example, in "typedef int wchar_t;") we remember that
28297 this is what happened. In system headers, we ignore these
28298 declarations so that G++ can work with system headers that are not
28299 C++-safe. */
28301 && !type_definition_p
28311 {
28314 ds_redefined_builtin_type_spec,
28315 token);
28317 {
28321 }
28322 }
28325 else
28326 {
28331 }
28332 }
28334 /* True iff TOKEN is the GNU keyword __thread. */
28336 static bool
28338 {
28341 }
28343 /* Set the location for a declarator specifier and check if it is
28344 duplicated.
28346 DECL_SPECS is the sequence of declarator specifiers onto which to
28347 set the location.
28349 DS is the single declarator specifier to set which location is to
28350 be set onto the existing sequence of declarators.
28352 LOCATION is the location for the declarator specifier to
28353 consider. */
28355 static void
28358 {
28367 {
28371 }
28372 else
28373 {
28375 {
28379 else
28380 {
28383 OPT_Wlong_long,
28385 }
28386 }
28388 {
28392 {
28396 }
28397 else
28398 {
28401 }
28402 }
28403 else
28404 {
28420 "__complex"
28421 };
28425 }
28426 }
28427 }
28429 /* Return true iff the declarator specifier DS is present in the
28430 sequence of declarator specifiers DECL_SPECS. */
28432 bool
28434 cp_decl_spec ds)
28435 {
28442 }
28444 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28445 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28447 static bool
28449 {
28451 }
28453 /* Issue an error message indicating that TOKEN_DESC was expected.
28454 If KEYWORD is true, it indicated this function is called by
28455 cp_parser_require_keword and the required token can only be
28456 a indicated keyword.
28458 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28459 within any error as the location of an "opening" token matching
28460 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28461 RT_CLOSE_PAREN). */
28463 static void
28465 required_token token_desc,
28467 location_t matching_location)
28468 {
28474 {
28543 }
28546 {
28548 {
28626 }
28627 }
28631 }
28634 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28635 issue an error message indicating that TOKEN_DESC was expected.
28637 Returns the token consumed, if the token had the appropriate type.
28638 Otherwise, returns NULL.
28640 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28641 within any error as the location of an "opening" token matching
28642 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28643 RT_CLOSE_PAREN). */
28648 required_token token_desc,
28649 location_t matching_location)
28650 {
28653 else
28654 {
28655 /* Output the MESSAGE -- unless we're parsing tentatively. */
28658 matching_location);
28660 }
28661 }
28663 /* An error message is produced if the next token is not '>'.
28664 All further tokens are skipped until the desired token is
28665 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28667 static void
28669 {
28670 /* Current level of '< ... >'. */
28672 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28675 /* Are we ready, yet? If not, issue error message. */
28679 /* Skip tokens until the desired token is found. */
28681 {
28682 /* Peek at the next token. */
28684 {
28692 /* C++0x views the `>>' operator as two `>' tokens, but
28693 C++98 does not. */
28696 {
28697 /* We've hit a `>>' where the first `>' closes the
28698 template argument list, and the second `>' is
28699 spurious. Just consume the `>>' and stop; we've
28700 already produced at least one error. */
28703 }
28704 /* Fall through for C++0x, so we handle the second `>' in
28705 the `>>'. */
28710 {
28711 /* We've reached the token we want, consume it and stop. */
28714 }
28733 /* The '>' was probably forgotten, don't look further. */
28738 }
28740 /* Consume this token. */
28742 }
28743 }
28745 /* If the next token is the indicated keyword, consume it. Otherwise,
28746 issue an error message indicating that TOKEN_DESC was expected.
28748 Returns the token consumed, if the token had the appropriate type.
28749 Otherwise, returns NULL. */
28754 required_token token_desc)
28755 {
28759 {
28761 UNKNOWN_LOCATION);
28763 }
28766 }
28768 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28769 function-definition. */
28771 static bool
28773 {
28776 /* A ctor-initializer begins with a `:'. */
28778 /* A function-try-block begins with `try'. */
28780 /* A function-transaction-block begins with `__transaction_atomic'
28781 or `__transaction_relaxed'. */
28784 /* The named return value extension begins with `return'. */
28786 }
28788 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28789 definition. */
28791 static bool
28793 {
28800 }
28802 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28803 C++0x) ending a template-argument. */
28805 static bool
28807 {
28815 }
28817 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28818 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28820 static bool
28823 {
28829 /* Check for the sequence `<::' in the original code. It would be lexed as
28830 `[:', where `[' is a digraph, and there is no whitespace before
28831 `:'. */
28833 {
28838 }
28840 }
28842 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28843 or none_type otherwise. */
28845 static enum tag_types
28847 {
28849 {
28859 }
28860 }
28862 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28863 or none_type otherwise or if the token is null. */
28865 static enum tag_types
28867 {
28872 {
28880 }
28881 }
28883 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28885 static void
28887 {
28891 {
28895 type))
28898 }
28899 }
28901 /* Issue an error message if DECL is redeclared with different
28902 access than its original declaration [class.access.spec/3].
28903 This applies to nested classes, nested class templates and
28904 enumerations [class.mem/1]. */
28906 static void
28908 {
28919 }
28921 /* Look for the `template' keyword, as a syntactic disambiguator.
28922 Return TRUE iff it is present, in which case it will be
28923 consumed. */
28925 static bool
28927 {
28929 {
28930 /* In C++98 the `template' keyword can only be used within templates;
28931 outside templates the parser can always figure out what is a
28932 template and what is not. In C++11, per the resolution of DR 468,
28933 `template' is allowed in cases where it is not strictly necessary. */
28936 {
28939 "in C++98 %<template%> (as a disambiguator) is only "
28941 /* If this part of the token stream is rescanned, the same
28942 error message would be generated. So, we purge the token
28943 from the stream. */
28946 }
28947 else
28948 {
28949 /* Consume the `template' keyword. */
28952 }
28953 }
28955 }
28957 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28958 set PARSER->SCOPE, and perform other related actions. */
28960 static void
28962 {
28965 /* Get the stored value. */
28967 /* Set the scope from the stored value. */
28971 }
28973 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28974 encounter the end of a block before what we were looking for. */
28976 static bool
28980 {
28982 {
28985 /* Abort a parenthesized expression if we encounter a semicolon. */
28989 /* If we've reached the end of the file, stop. */
28995 /* We've hit the end of an enclosing block, so there's been some
28996 kind of syntax error. */
28999 /* Consume the token. */
29001 /* See if it starts a new group. */
29003 {
29005 /* In theory this should probably check end == '}', but
29006 cp_parser_save_member_function_body needs it to exit
29007 after either '}' or ')' when called with ')'. */
29010 }
29012 {
29016 }
29021 }
29022 }
29024 /* Like above, for caching a default argument or NSDMI. Both of these are
29025 terminated by a non-nested comma, but it can be unclear whether or not a
29026 comma is nested in a template argument list unless we do more parsing.
29027 In order to handle this ambiguity, when we encounter a ',' after a '<'
29028 we try to parse what follows as a parameter-declaration-list (in the
29029 case of a default argument) or a member-declarator (in the case of an
29030 NSDMI). If that succeeds, then we stop caching. */
29032 static tree
29034 {
29039 tree default_argument;
29041 /* Add tokens until we have processed the entire default
29042 argument. We add the range [first_token, token). */
29045 {
29046 /* For list-initialization, this is straightforward. */
29049 }
29051 {
29054 /* Peek at the next token. */
29056 /* What we do depends on what token we have. */
29058 {
29059 /* In valid code, a default argument must be
29060 immediately followed by a `,' `)', or `...'. */
29063 {
29064 /* If we've seen a '<', we might be in a
29065 template-argument-list. Until Core issue 325 is
29066 resolved, we don't know how this situation ought
29067 to be handled, so try to DTRT. We check whether
29068 what comes after the comma is a valid parameter
29069 declaration list. If it is, then the comma ends
29070 the default argument; otherwise the default
29071 argument continues. */
29075 /* Set ITALP so cp_parser_parameter_declaration_list
29076 doesn't decide to commit to this parse. */
29083 {
29084 /* Parse declarators until we reach a non-comma or
29085 somthing that cannot be an initializer.
29086 Just checking whether we're looking at a single
29087 declarator is insufficient. Consider:
29088 int var = tuple<T,U>::x;
29089 The template parameter 'U' looks exactly like a
29090 declarator. */
29091 do
29092 {
29103 }
29105 /* If we met an '=' or ';' then the original comma
29106 was the end of the NSDMI. Otherwise assume
29107 we're still in the NSDMI. */
29110 }
29111 else
29112 {
29119 }
29126 }
29127 /* FALLTHRU */
29130 /* If we run into a non-nested `;', `}', or `]',
29131 then the code is invalid -- but the default
29132 argument is certainly over. */
29137 /* Handle correctly int n = sizeof ... ( p ); */
29140 /* Update DEPTH, if necessary. */
29155 /* This might be the comparison operator, or it might
29156 start a template argument list. */
29163 /* Fall through for C++0x, which treats the `>>'
29164 operator like two `>' tokens in certain
29165 cases. */
29170 {
29171 /* This might be an operator, or it might close a
29172 template argument list. But if a previous '<'
29173 started a template argument list, this will have
29174 closed it, so we can't be in one anymore. */
29178 }
29181 /* If we run out of tokens, issue an error message. */
29189 /* In these cases, we should look for template-ids.
29190 For example, if the default argument is
29191 `X<int, double>()', we need to do name lookup to
29192 figure out whether or not `X' is a template; if
29193 so, the `,' does not end the default argument.
29195 That is not yet done. */
29200 }
29202 /* If we've reached the end, stop. */
29206 /* Add the token to the token block. */
29208 }
29210 /* Create a DEFAULT_ARG to represent the unparsed default
29211 argument. */
29218 }
29220 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29222 location_t
29224 {
29229 }
29231 /* Begin parsing tentatively. We always save tokens while parsing
29232 tentatively so that if the tentative parsing fails we can restore the
29233 tokens. */
29235 static void
29237 {
29238 /* Enter a new parsing context. */
29240 /* Begin saving tokens. */
29242 /* In order to avoid repetitive access control error messages,
29243 access checks are queued up until we are no longer parsing
29244 tentatively. */
29246 }
29248 /* Commit to the currently active tentative parse. */
29250 static void
29252 {
29256 /* Mark all of the levels as committed. */
29259 {
29266 }
29267 }
29269 /* Commit to the topmost currently active tentative parse.
29271 Note that this function shouldn't be called when there are
29272 irreversible side-effects while in a tentative state. For
29273 example, we shouldn't create a permanent entry in the symbol
29274 table, or issue an error message that might not apply if the
29275 tentative parse is aborted. */
29277 static void
29279 {
29284 {
29292 }
29293 }
29295 /* Abort the currently active tentative parse. All consumed tokens
29296 will be rolled back, and no diagnostics will be issued. */
29298 static void
29300 {
29304 /* Now, pretend that we want to see if the construct was
29305 successfully parsed. */
29307 }
29309 /* Stop parsing tentatively. If a parse error has occurred, restore the
29310 token stream. Otherwise, commit to the tokens we have consumed.
29311 Returns true if no error occurred; false otherwise. */
29313 static bool
29315 {
29319 /* Remember whether or not an error occurred, since we are about to
29320 destroy that information. */
29322 /* Remove the topmost context from the stack. */
29325 /* If no parse errors occurred, commit to the tentative parse. */
29327 {
29328 /* Commit to the tokens read tentatively, unless that was
29329 already done. */
29334 }
29335 /* Otherwise, if errors occurred, roll back our state so that things
29336 are just as they were before we began the tentative parse. */
29337 else
29338 {
29341 }
29342 /* Add the context to the front of the free list. */
29347 }
29349 /* Returns true if we are parsing tentatively and are not committed to
29350 this tentative parse. */
29352 static bool
29354 {
29357 }
29359 /* Returns nonzero iff an error has occurred during the most recent
29360 tentative parse. */
29362 static bool
29364 {
29367 }
29369 /* Returns nonzero if GNU extensions are allowed. */
29371 static bool
29373 {
29375 }
29376 \f
29377 /* Objective-C++ Productions */
29380 /* Parse an Objective-C expression, which feeds into a primary-expression
29381 above.
29383 objc-expression:
29384 objc-message-expression
29385 objc-string-literal
29386 objc-encode-expression
29387 objc-protocol-expression
29388 objc-selector-expression
29390 Returns a tree representation of the expression. */
29392 static cp_expr
29394 {
29395 /* Try to figure out what kind of declaration is present. */
29399 {
29409 {
29421 }
29422 /* FALLTHRU */
29428 }
29431 }
29433 /* Parse an Objective-C message expression.
29435 objc-message-expression:
29436 [ objc-message-receiver objc-message-args ]
29438 Returns a representation of an Objective-C message. */
29440 static tree
29442 {
29454 /* Construct a location e.g.
29455 [self func1:5]
29456 ^~~~~~~~~~~~~~
29457 ranging from the '[' to the ']', with the caret at the start. */
29462 }
29464 /* Parse an objc-message-receiver.
29466 objc-message-receiver:
29467 expression
29468 simple-type-specifier
29470 Returns a representation of the type or expression. */
29472 static tree
29474 {
29475 tree rcv;
29477 /* An Objective-C message receiver may be either (1) a type
29478 or (2) an expression. */
29482 /* If that worked out, fine. */
29489 CP_PARSER_FLAGS_NONE);
29496 }
29498 /* Parse the arguments and selectors comprising an Objective-C message.
29500 objc-message-args:
29501 objc-selector
29502 objc-selector-args
29503 objc-selector-args , objc-comma-args
29505 objc-selector-args:
29506 objc-selector [opt] : assignment-expression
29507 objc-selector-args objc-selector [opt] : assignment-expression
29509 objc-comma-args:
29510 assignment-expression
29511 objc-comma-args , assignment-expression
29513 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29514 selector arguments and TREE_VALUE containing a list of comma
29515 arguments. */
29517 static tree
29519 {
29525 {
29531 /* Detect if we have a unary selector. */
29540 sel_args
29545 }
29547 /* Handle non-selector arguments, if any. */
29549 {
29550 tree arg;
29555 addl_args
29560 }
29563 {
29566 }
29569 }
29571 /* Parse an Objective-C encode expression.
29573 objc-encode-expression:
29574 @encode objc-typename
29576 Returns an encoded representation of the type argument. */
29578 static cp_expr
29580 {
29581 tree type;
29586 matching_parens parens;
29593 {
29597 }
29599 /* This happens if we find @encode(T) (where T is a template
29600 typename or something dependent on a template typename) when
29601 parsing a template. In that case, we can't compile it
29602 immediately, but we rather create an AT_ENCODE_EXPR which will
29603 need to be instantiated when the template is used.
29604 */
29606 {
29610 }
29613 /* Build a location of the form:
29614 @encode(int)
29615 ^~~~~~~~~~~~
29616 with caret==start at the @ token, finishing at the close paren. */
29617 location_t combined_loc
29622 }
29624 /* Parse an Objective-C @defs expression. */
29626 static tree
29628 {
29629 tree name;
29632 matching_parens parens;
29638 }
29640 /* Parse an Objective-C protocol expression.
29642 objc-protocol-expression:
29643 @protocol ( identifier )
29645 Returns a representation of the protocol expression. */
29647 static tree
29649 {
29650 tree proto;
29654 matching_parens parens;
29659 /* Build a location of the form:
29660 @protocol(prot)
29661 ^~~~~~~~~~~~~~~
29662 with caret==start at the @ token, finishing at the close paren. */
29663 location_t combined_loc
29669 }
29671 /* Parse an Objective-C selector expression.
29673 objc-selector-expression:
29674 @selector ( objc-method-signature )
29676 objc-method-signature:
29677 objc-selector
29678 objc-selector-seq
29680 objc-selector-seq:
29681 objc-selector :
29682 objc-selector-seq objc-selector :
29684 Returns a representation of the method selector. */
29686 static tree
29688 {
29695 matching_parens parens;
29701 {
29710 {
29711 /* Detect if we have a unary selector. */
29713 {
29716 }
29717 else
29718 {
29720 }
29721 }
29726 {
29727 sel_seq
29730 sel_seq
29733 }
29734 else
29735 sel_seq
29740 }
29742 finish_selector:
29746 /* Build a location of the form:
29747 @selector(func)
29748 ^~~~~~~~~~~~~~~
29749 with caret==start at the @ token, finishing at the close paren. */
29750 location_t combined_loc
29754 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29757 }
29759 /* Parse a list of identifiers.
29761 objc-identifier-list:
29762 identifier
29763 objc-identifier-list , identifier
29765 Returns a TREE_LIST of identifier nodes. */
29767 static tree
29769 {
29770 tree identifier;
29771 tree list;
29782 {
29789 identifier));
29791 }
29794 }
29796 /* Parse an Objective-C alias declaration.
29798 objc-alias-declaration:
29799 @compatibility_alias identifier identifier ;
29801 This function registers the alias mapping with the Objective-C front end.
29802 It returns nothing. */
29804 static void
29806 {
29814 }
29816 /* Parse an Objective-C class forward-declaration.
29818 objc-class-declaration:
29819 @class objc-identifier-list ;
29821 The function registers the forward declarations with the Objective-C
29822 front end. It returns nothing. */
29824 static void
29826 {
29829 {
29830 tree id;
29840 else
29842 }
29844 }
29846 /* Parse a list of Objective-C protocol references.
29848 objc-protocol-refs-opt:
29849 objc-protocol-refs [opt]
29851 objc-protocol-refs:
29852 < objc-identifier-list >
29854 Returns a TREE_LIST of identifiers, if any. */
29856 static tree
29858 {
29862 {
29866 }
29869 }
29871 /* Parse a Objective-C visibility specification. */
29873 static void
29875 {
29879 {
29894 }
29896 /* Eat '@private'/'@protected'/'@public'. */
29898 }
29900 /* Parse an Objective-C method type. Return 'true' if it is a class
29901 (+) method, and 'false' if it is an instance (-) method. */
29905 {
29908 else
29910 }
29912 /* Parse an Objective-C protocol qualifier. */
29914 static tree
29916 {
29929 {
29934 }
29937 }
29939 /* Parse an Objective-C typename. */
29941 static tree
29943 {
29947 {
29950 matching_parens parens;
29954 /* An ObjC type name may consist of just protocol qualifiers, in which
29955 case the type shall default to 'id'. */
29957 {
29960 /* If the type could not be parsed, an error has already
29961 been produced. For error recovery, behave as if it had
29962 not been specified, which will use the default type
29963 'id'. */
29965 {
29967 /* We need to skip to the closing parenthesis as
29968 cp_parser_type_id() does not seem to do it for
29969 us. */
29974 }
29975 }
29979 }
29982 }
29984 /* Check to see if TYPE refers to an Objective-C selector name. */
29986 static bool
29988 {
29994 }
29996 /* Parse an Objective-C selector. */
29998 static tree
30000 {
30004 {
30007 }
30009 /* C++ operator names are allowed to appear in ObjC selectors. */
30011 {
30024 }
30025 }
30027 /* Parse an Objective-C params list. */
30029 static tree
30031 {
30037 {
30047 /* Detect if we have a unary selector. */
30050 {
30053 }
30057 {
30058 /* Something went quite wrong. There should be a colon
30059 here, but there is not. Stop parsing parameters. */
30061 }
30063 /* New ObjC allows attributes on parameters too. */
30068 params
30071 type_name,
30072 identifier,
30073 parm_attr));
30076 }
30079 {
30082 }
30084 /* We allow tail attributes for the method. */
30086 {
30094 }
30097 {
30100 }
30102 }
30104 /* Parse the non-keyword Objective-C params. */
30106 static tree
30109 {
30115 {
30117 tree parm;
30123 {
30128 }
30130 /* TODO: parse attributes for tail parameters. */
30139 }
30141 /* We allow tail attributes for the method. */
30143 {
30145 {
30150 }
30151 else
30152 /* We have an error, but parse the attributes, so that we can
30153 carry on. */
30159 }
30162 }
30164 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30166 static void
30168 {
30171 /* If the next token is `extern' and the following token is a string
30172 literal, then we have a linkage specification. */
30174 && cp_parser_is_pure_string_literal
30177 /* Handle #pragma, if any. */
30180 /* Allow stray semicolons. */
30183 /* Mark methods as optional or required, when building protocols. */
30185 {
30188 }
30190 {
30193 }
30196 /* Other stray characters must generate errors. */
30198 {
30202 }
30203 /* Finally, try to parse a block-declaration, or a function-definition. */
30204 else
30206 }
30208 /* Parse a method signature. */
30210 static tree
30212 {
30228 }
30230 static bool
30232 {
30233 tree tattr;
30238 /* If the attributes are followed by a method introducer, this is not allowed.
30239 Dump the attributes and flag the situation. */
30244 /* Otherwise, the attributes introduce some interstitial code, possibly so
30245 rewind to allow that check. */
30248 }
30250 /* Parse an Objective-C method prototype list. */
30252 static void
30254 {
30258 {
30260 {
30265 else
30269 {
30273 }
30276 }
30282 OPT_Wattributes,
30284 else
30285 /* Allow for interspersed non-ObjC++ code. */
30289 }
30293 else
30297 }
30299 /* Parse an Objective-C method definition list. */
30301 static void
30303 {
30307 {
30308 tree meth;
30311 {
30317 else
30322 {
30326 }
30328 NULL_TREE);
30330 /* For historical reasons, we accept an optional semicolon. */
30337 {
30344 }
30345 }
30346 /* The following case will be removed once @synthesize is
30347 completely implemented. */
30358 else
30359 /* Allow for interspersed non-ObjC++ code. */
30363 }
30367 else
30371 }
30373 /* Parse Objective-C ivars. */
30375 static void
30377 {
30388 {
30389 cp_decl_specifier_seq declspecs;
30391 tree prefix_attributes;
30399 CP_PARSER_FLAGS_OPTIONAL,
30403 /* auto, register, static, extern, mutable. */
30405 {
30408 }
30410 /* thread_local. */
30412 {
30415 }
30417 /* typedef. */
30419 {
30422 }
30427 /* Keep going until we hit the `;' at the end of the
30428 declaration. */
30430 {
30435 /* Check for a (possibly unnamed) bitfield declaration. */
30443 {
30444 /* Get the name of the bitfield. */
30447 sfk_none);
30449 eat_colon:
30451 /* Get the width of the bitfield. */
30452 width
30454 }
30455 else
30456 {
30457 /* Parse the declarator. */
30458 declarator
30464 }
30466 /* Look for attributes that apply to the ivar. */
30468 /* Remember which attributes are prefix attributes and
30469 which are not. */
30471 /* Combine the attributes. */
30475 /* Create the bitfield declaration. */
30478 else
30483 /* Add the instance variable. */
30487 /* Reset PREFIX_ATTRIBUTES. */
30489 {
30494 }
30499 {
30502 }
30504 }
30508 }
30513 /* Do not consume the RID_AT_END, so it will be read again as terminating
30514 the @interface of @implementation. */
30518 /* For historical reasons, we accept an optional semicolon. */
30521 }
30523 /* Parse an Objective-C protocol declaration. */
30525 static void
30527 {
30533 {
30538 }
30540 /* See if we have a forward declaration or a definition. */
30543 /* Try a forward declaration first. */
30545 {
30547 {
30548 tree id;
30558 else
30560 }
30562 }
30564 /* Ok, we got a full-fledged definition (or at least should). */
30565 else
30566 {
30571 }
30572 }
30574 /* Parse an Objective-C superclass or category. */
30576 static void
30581 {
30587 {
30590 }
30592 {
30593 matching_parens parens;
30596 /* If there is no category name, and this is an @interface, we
30597 have a class extension. */
30599 {
30602 }
30603 else
30607 }
30608 }
30610 /* Parse an Objective-C class interface. */
30612 static void
30614 {
30621 {
30622 /* It's hard to recover because even if valid @interface stuff
30623 is to follow, we can't compile it (or validate it) if we
30624 don't even know which class it refers to. Let's assume this
30625 was a stray '@interface' token in the stream and skip it.
30626 */
30628 }
30633 /* We have either a class or a category on our hands. */
30636 else
30637 {
30639 /* Handle instance variable declarations, if any. */
30642 }
30645 }
30647 /* Parse an Objective-C class implementation. */
30649 static void
30651 {
30658 {
30659 /* It's hard to recover because even if valid @implementation
30660 stuff is to follow, we can't compile it (or validate it) if
30661 we don't even know which class it refers to. Let's assume
30662 this was a stray '@implementation' token in the stream and
30663 skip it.
30664 */
30666 }
30670 /* We have either a class or a category on our hands. */
30673 else
30674 {
30676 /* Handle instance variable declarations, if any. */
30679 }
30682 }
30684 /* Consume the @end token and finish off the implementation. */
30686 static void
30688 {
30691 }
30693 /* Parse an Objective-C declaration. */
30695 static void
30697 {
30698 /* Try to figure out what kind of declaration is present. */
30703 {
30719 }
30722 {
30745 }
30746 }
30748 /* Parse an Objective-C try-catch-finally statement.
30750 objc-try-catch-finally-stmt:
30751 @try compound-statement objc-catch-clause-seq [opt]
30752 objc-finally-clause [opt]
30754 objc-catch-clause-seq:
30755 objc-catch-clause objc-catch-clause-seq [opt]
30757 objc-catch-clause:
30758 @catch ( objc-exception-declaration ) compound-statement
30760 objc-finally-clause:
30761 @finally compound-statement
30763 objc-exception-declaration:
30764 parameter-declaration
30765 '...'
30767 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30769 Returns NULL_TREE.
30771 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30772 for C. Keep them in sync. */
30774 static tree
30776 {
30777 location_t location;
30778 tree stmt;
30783 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30784 node, lest it get absorbed into the surrounding block. */
30790 {
30794 matching_parens parens;
30800 {
30801 /* We have "@catch (...)" (where the '...' are literally
30802 what is in the code). Skip the '...'.
30803 parameter_declaration is set to NULL_TREE, and
30804 objc_being_catch_clauses() knows that that means
30805 '...'. */
30808 }
30809 else
30810 {
30811 /* We have "@catch (NSException *exception)" or something
30812 like that. Parse the parameter declaration. */
30816 else
30821 }
30824 else
30825 {
30826 /* If there was no open parenthesis, we are recovering from
30827 an error, and we are trying to figure out what mistake
30828 the user has made. */
30830 /* If there is an immediate closing parenthesis, the user
30831 probably forgot the opening one (ie, they typed "@catch
30832 NSException *e)". Parse the closing parenthesis and keep
30833 going. */
30837 /* If these is no immediate closing parenthesis, the user
30838 probably doesn't know that parenthesis are required at
30839 all (ie, they typed "@catch NSException *e"). So, just
30840 forget about the closing parenthesis and keep going. */
30841 }
30845 }
30847 {
30850 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30851 node, lest it get absorbed into the surrounding block. */
30855 }
30858 }
30860 /* Parse an Objective-C synchronized statement.
30862 objc-synchronized-stmt:
30863 @synchronized ( expression ) compound-statement
30865 Returns NULL_TREE. */
30867 static tree
30869 {
30870 location_t location;
30877 matching_parens parens;
30882 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30883 node, lest it get absorbed into the surrounding block. */
30888 }
30890 /* Parse an Objective-C throw statement.
30892 objc-throw-stmt:
30893 @throw assignment-expression [opt] ;
30895 Returns a constructed '@throw' statement. */
30897 static tree
30899 {
30911 }
30913 /* Parse an Objective-C statement. */
30915 static tree
30917 {
30918 /* Try to figure out what kind of declaration is present. */
30922 {
30933 }
30936 }
30938 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30939 look ahead to see if an objc keyword follows the attributes. This
30940 is to detect the use of prefix attributes on ObjC @interface and
30941 @protocol. */
30943 static bool
30945 {
30950 {
30953 }
30956 }
30958 /* This routine is a minimal replacement for
30959 c_parser_struct_declaration () used when parsing the list of
30960 types/names or ObjC++ properties. For example, when parsing the
30961 code
30963 @property (readonly) int a, b, c;
30965 this function is responsible for parsing "int a, int b, int c" and
30966 returning the declarations as CHAIN of DECLs.
30968 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30969 similar parsing. */
30970 static tree
30972 {
30974 cp_decl_specifier_seq declspecs;
30976 tree prefix_attributes;
30979 CP_PARSER_FLAGS_NONE,
30986 /* auto, register, static, extern, mutable. */
30988 {
30991 }
30993 /* thread_local. */
30995 {
30998 }
31000 /* typedef. */
31002 {
31005 }
31010 /* Keep going until we hit the `;' at the end of the declaration. */
31012 {
31017 /* Parse the declarator. */
31021 /* Look for attributes that apply to the ivar. */
31023 /* Remember which attributes are prefix attributes and
31024 which are not. */
31026 /* Combine the attributes. */
31036 /* Reset PREFIX_ATTRIBUTES. */
31038 {
31043 }
31050 {
31053 }
31054 else
31056 }
31058 }
31060 /* Parse an Objective-C @property declaration. The syntax is:
31062 objc-property-declaration:
31063 '@property' objc-property-attributes[opt] struct-declaration ;
31065 objc-property-attributes:
31066 '(' objc-property-attribute-list ')'
31068 objc-property-attribute-list:
31069 objc-property-attribute
31070 objc-property-attribute-list, objc-property-attribute
31072 objc-property-attribute
31073 'getter' = identifier
31074 'setter' = identifier
31075 'readonly'
31076 'readwrite'
31077 'assign'
31078 'retain'
31079 'copy'
31080 'nonatomic'
31082 For example:
31083 @property NSString *name;
31084 @property (readonly) id object;
31085 @property (retain, nonatomic, getter=getTheName) id name;
31086 @property int a, b, c;
31088 PS: This function is identical to
31089 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31090 static void
31092 {
31093 /* The following variables hold the attributes of the properties as
31094 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31095 seen. When we see an attribute, we set them to 'true' (if they
31096 are boolean properties) or to the identifier (if they have an
31097 argument, ie, for getter and setter). Note that here we only
31098 parse the list of attributes, check the syntax and accumulate the
31099 attributes that we find. objc_add_property_declaration() will
31100 then process the information. */
31110 /* 'properties' is the list of properties that we read. Usually a
31111 single one, but maybe more (eg, in "@property int a, b, c;" there
31112 are three). */
31113 tree properties;
31114 location_t loc;
31120 /* Parse the optional attribute list... */
31122 {
31123 /* Eat the '('. */
31124 matching_parens parens;
31128 {
31134 {
31137 }
31141 {
31152 {
31156 else
31161 }
31164 {
31168 }
31170 {
31172 {
31175 }
31176 else
31180 else
31182 }
31183 else
31184 {
31186 {
31189 }
31190 else
31192 }
31198 }
31205 else
31207 }
31209 /* FIXME: "@property (setter, assign);" will generate a spurious
31210 "error: expected ‘)’ before ‘,’ token". This is because
31211 cp_parser_require, unlike the C counterpart, will produce an
31212 error even if we are in error recovery. */
31214 {
31219 }
31220 }
31222 /* ... and the property declaration(s). */
31226 {
31228 /* If the next token is now a `;', consume it. */
31232 }
31236 else
31237 {
31238 /* Comma-separated properties are chained together in
31239 reverse order; add them one by one. */
31248 }
31251 }
31253 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31255 objc-synthesize-declaration:
31256 @synthesize objc-synthesize-identifier-list ;
31258 objc-synthesize-identifier-list:
31259 objc-synthesize-identifier
31260 objc-synthesize-identifier-list, objc-synthesize-identifier
31262 objc-synthesize-identifier
31263 identifier
31264 identifier = identifier
31266 For example:
31267 @synthesize MyProperty;
31268 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31270 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31271 for C. Keep them in sync.
31272 */
31273 static void
31275 {
31277 location_t loc;
31282 {
31286 {
31289 }
31291 {
31295 {
31298 }
31299 }
31300 else
31305 else
31307 }
31310 }
31312 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31314 objc-dynamic-declaration:
31315 @dynamic identifier-list ;
31317 For example:
31318 @dynamic MyProperty;
31319 @dynamic MyProperty, AnotherProperty;
31321 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31322 for C. Keep them in sync.
31323 */
31324 static void
31326 {
31328 location_t loc;
31333 {
31334 tree property;
31337 {
31340 }
31344 else
31346 }
31349 }
31351 \f
31352 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31354 /* Returns name of the next clause.
31355 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31356 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31357 returned and the token is consumed. */
31359 static pragma_omp_clause
31361 {
31377 {
31382 {
31563 }
31564 }
31570 }
31572 /* Validate that a clause of the given type does not already exist. */
31574 static void
31577 {
31578 tree c;
31582 {
31585 }
31586 }
31588 /* OpenMP 2.5:
31589 variable-list:
31590 identifier
31591 variable-list , identifier
31593 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31594 colon). An opening parenthesis will have been consumed by the caller.
31596 If KIND is nonzero, create the appropriate node and install the decl
31597 in OMP_CLAUSE_DECL and add the node to the head of the list.
31599 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31600 return the list created.
31602 COLON can be NULL if only closing parenthesis should end the list,
31603 or pointer to bool which will receive false if the list is terminated
31604 by closing parenthesis or true if the list is terminated by colon. */
31606 static tree
31609 {
31613 {
31616 }
31618 {
31623 && current_class_ptr
31625 {
31631 }
31632 else
31633 {
31644 else
31649 }
31651 ;
31653 {
31655 {
31657 /* The OpenACC cache directive explicitly only allows "array
31658 elements or subarrays". */
31660 {
31664 }
31665 /* FALLTHROUGH. */
31670 {
31671 location_t loc
31676 decl
31680 }
31681 /* FALLTHROUGH. */
31685 {
31693 parser->colon_corrects_to_scope_p
31697 else
31698 {
31699 /* Look for `:'. */
31703 CPP_CLOSE_SQUARE))
31705 }
31706 /* Look for the closing `]'. */
31708 RT_CLOSE_SQUARE))
31712 }
31716 }
31722 }
31723 else
31726 get_comma:
31730 }
31736 {
31740 }
31743 {
31746 /* Try to resync to an unnested comma. Copied from
31747 cp_parser_parenthesized_expression_list. */
31748 skip_comma:
31757 }
31760 }
31762 /* Similarly, but expect leading and trailing parenthesis. This is a very
31763 common case for omp clauses. */
31765 static tree
31767 {
31771 }
31773 /* OpenACC 2.0:
31774 copy ( variable-list )
31775 copyin ( variable-list )
31776 copyout ( variable-list )
31777 create ( variable-list )
31778 delete ( variable-list )
31779 present ( variable-list ) */
31781 static tree
31783 tree list)
31784 {
31787 {
31820 }
31828 }
31830 /* OpenACC 2.0:
31831 deviceptr ( variable-list ) */
31833 static tree
31835 {
31839 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31840 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31841 variable-list must only allow for pointer variables. */
31844 {
31851 }
31854 }
31856 /* OpenACC 2.5:
31857 auto
31858 finalize
31859 independent
31860 nohost
31861 seq */
31863 static tree
31867 {
31872 }
31874 /* OpenACC:
31875 num_gangs ( expression )
31876 num_workers ( expression )
31877 vector_length ( expression ) */
31879 static tree
31882 {
31885 matching_parens parens;
31893 {
31898 }
31906 }
31908 /* OpenACC:
31910 gang [( gang-arg-list )]
31911 worker [( [num:] int-expr )]
31912 vector [( [length:] int-expr )]
31914 where gang-arg is one of:
31916 [num:] int-expr
31917 static: size-expr
31919 and size-expr may be:
31921 *
31922 int-expr
31923 */
31925 static tree
31928 {
31938 {
31939 matching_parens parens;
31942 do
31943 {
31947 /* Gang static argument. */
31950 {
31958 {
31961 }
31963 /* Check for the '*' argument. */
31967 CPP_CLOSE_PAREN)))
31968 {
31973 {
31976 }
31978 }
31979 }
31980 /* Worker num: argument and vector length: arguments. */
31984 {
31987 }
31989 /* Now collect the actual argument. */
31991 {
31994 }
32006 {
32009 }
32011 }
32016 }
32030 cleanup_error:
32033 }
32035 /* OpenACC 2.0:
32036 tile ( size-expr-list ) */
32038 static tree
32040 {
32044 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32045 so, but the spec authors never considered such a case and have
32046 differing opinions on what it might mean, including 'not
32047 allowed'.) */
32050 clause_loc);
32055 do
32056 {
32063 {
32066 }
32067 else
32071 }
32074 /* Consume the trailing ')'. */
32082 }
32084 /* OpenACC 2.0
32085 Parse wait clause or directive parameters. */
32087 static tree
32089 {
32099 {
32104 }
32111 {
32115 {
32118 else
32119 {
32126 }
32127 }
32128 }
32131 }
32133 /* OpenACC:
32134 wait ( int-expr-list ) */
32136 static tree
32138 {
32147 }
32149 /* OpenMP 3.0:
32150 collapse ( constant-expression ) */
32152 static tree
32154 {
32156 location_t loc;
32157 HOST_WIDE_INT n;
32160 matching_parens parens;
32178 {
32181 }
32190 }
32192 /* OpenMP 2.5:
32193 default ( none | shared )
32195 OpenACC:
32196 default ( none | present ) */
32198 static tree
32201 {
32203 tree c;
32205 matching_parens parens;
32209 {
32214 {
32235 }
32238 }
32239 else
32240 {
32241 invalid_kind:
32244 else
32246 }
32263 }
32265 /* OpenMP 3.1:
32266 final ( expression ) */
32268 static tree
32270 {
32273 matching_parens parens;
32292 }
32294 /* OpenMP 2.5:
32295 if ( expression )
32297 OpenMP 4.5:
32298 if ( directive-name-modifier : expression )
32300 directive-name-modifier:
32301 parallel | task | taskloop | target data | target | target update
32302 | target enter data | target exit data */
32304 static tree
32307 {
32311 matching_parens parens;
32316 {
32328 {
32331 {
32344 else
32345 {
32346 location_t loc
32351 }
32354 {
32356 {
32361 }
32363 {
32364 location_t loc
32368 }
32369 }
32370 }
32371 }
32373 {
32375 {
32378 }
32379 else
32380 {
32382 {
32383 location_t loc
32386 }
32388 }
32389 }
32390 }
32402 {
32405 {
32408 {
32418 }
32420 p);
32422 }
32424 {
32427 else
32430 }
32433 {
32437 }
32438 }
32446 }
32448 /* OpenMP 3.1:
32449 mergeable */
32451 static tree
32454 {
32455 tree c;
32458 location);
32463 }
32465 /* OpenMP 2.5:
32466 nowait */
32468 static tree
32471 {
32472 tree c;
32479 }
32481 /* OpenMP 2.5:
32482 num_threads ( expression ) */
32484 static tree
32486 location_t location)
32487 {
32490 matching_parens parens;
32510 }
32512 /* OpenMP 4.5:
32513 num_tasks ( expression ) */
32515 static tree
32517 location_t location)
32518 {
32521 matching_parens parens;
32541 }
32543 /* OpenMP 4.5:
32544 grainsize ( expression ) */
32546 static tree
32548 location_t location)
32549 {
32552 matching_parens parens;
32572 }
32574 /* OpenMP 4.5:
32575 priority ( expression ) */
32577 static tree
32579 location_t location)
32580 {
32583 matching_parens parens;
32603 }
32605 /* OpenMP 4.5:
32606 hint ( expression ) */
32608 static tree
32610 location_t location)
32611 {
32614 matching_parens parens;
32633 }
32635 /* OpenMP 4.5:
32636 defaultmap ( tofrom : scalar ) */
32638 static tree
32640 location_t location)
32641 {
32645 matching_parens parens;
32650 {
32653 }
32657 {
32660 }
32666 {
32669 }
32673 {
32676 }
32682 location);
32688 out_err:
32693 }
32695 /* OpenMP 2.5:
32696 ordered
32698 OpenMP 4.5:
32699 ordered ( constant-expression ) */
32701 static tree
32704 {
32706 HOST_WIDE_INT n;
32712 {
32713 matching_parens parens;
32730 {
32732 "ordered argument needs positive constant integer "
32735 }
32736 }
32742 }
32744 /* OpenMP 2.5:
32745 reduction ( reduction-operator : variable-list )
32747 reduction-operator:
32748 One of: + * - & ^ | && ||
32750 OpenMP 3.1:
32752 reduction-operator:
32753 One of: + * - & ^ | && || min max
32755 OpenMP 4.0:
32757 reduction-operator:
32758 One of: + * - & ^ | && ||
32759 id-expression */
32761 static tree
32763 {
32771 {
32781 }
32785 else
32786 {
32797 {
32827 }
32828 else
32829 {
32831 resync_fail:
32836 }
32837 }
32843 NULL);
32845 {
32848 }
32851 }
32853 /* OpenMP 2.5:
32854 schedule ( schedule-kind )
32855 schedule ( schedule-kind , expression )
32857 schedule-kind:
32858 static | dynamic | guided | runtime | auto
32860 OpenMP 4.5:
32861 schedule ( schedule-modifier : schedule-kind )
32862 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32864 schedule-modifier:
32865 simd
32866 monotonic
32867 nonmonotonic */
32869 static tree
32871 {
32875 matching_parens parens;
32882 {
32891 else
32897 else
32898 {
32901 }
32902 }
32905 {
32910 {
32931 }
32932 }
32937 else
32943 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32945 {
32949 }
32952 {
32967 else
32972 }
32984 invalid_kind:
32986 resync_fail:
32991 }
32993 /* OpenMP 3.0:
32994 untied */
32996 static tree
32999 {
33000 tree c;
33007 }
33009 /* OpenMP 4.0:
33010 inbranch
33011 notinbranch */
33013 static tree
33016 {
33021 }
33023 /* OpenMP 4.0:
33024 parallel
33025 for
33026 sections
33027 taskgroup */
33029 static tree
33033 {
33037 }
33039 /* OpenMP 4.5:
33040 nogroup */
33042 static tree
33045 {
33050 }
33052 /* OpenMP 4.5:
33053 simd
33054 threads */
33056 static tree
33060 {
33065 }
33067 /* OpenMP 4.0:
33068 num_teams ( expression ) */
33070 static tree
33072 location_t location)
33073 {
33076 matching_parens parens;
33096 }
33098 /* OpenMP 4.0:
33099 thread_limit ( expression ) */
33101 static tree
33103 location_t location)
33104 {
33107 matching_parens parens;
33127 }
33129 /* OpenMP 4.0:
33130 aligned ( variable-list )
33131 aligned ( variable-list : constant-expression ) */
33133 static tree
33135 {
33139 matching_parens parens;
33147 {
33157 }
33163 }
33165 /* OpenMP 4.0:
33166 linear ( variable-list )
33167 linear ( variable-list : expression )
33169 OpenMP 4.5:
33170 linear ( modifier ( variable-list ) )
33171 linear ( modifier ( variable-list ) : expression ) */
33173 static tree
33176 {
33181 matching_parens parens;
33186 {
33198 else
33200 }
33205 else
33206 {
33215 }
33218 {
33223 {
33234 {
33237 }
33240 }
33251 }
33254 {
33257 }
33260 }
33262 /* OpenMP 4.0:
33263 safelen ( constant-expression ) */
33265 static tree
33267 location_t location)
33268 {
33271 matching_parens parens;
33290 }
33292 /* OpenMP 4.0:
33293 simdlen ( constant-expression ) */
33295 static tree
33297 location_t location)
33298 {
33301 matching_parens parens;
33320 }
33322 /* OpenMP 4.5:
33323 vec:
33324 identifier [+/- integer]
33325 vec , identifier [+/- integer]
33326 */
33328 static tree
33330 tree list)
33331 {
33335 {
33338 }
33341 {
33348 else
33349 {
33350 t = cp_parser_lookup_name_simple
33355 id_loc);
33356 }
33362 {
33365 }
33369 {
33372 }
33376 {
33379 }
33382 add_to_vector:
33384 {
33388 }
33394 }
33397 {
33403 }
33405 }
33407 /* OpenMP 4.0:
33408 depend ( depend-kind : variable-list )
33410 depend-kind:
33411 in | out | inout
33413 OpenMP 4.5:
33414 depend ( source )
33416 depend ( sink : vec ) */
33418 static tree
33420 {
33424 matching_parens parens;
33429 {
33443 else
33445 }
33446 else
33452 {
33462 }
33469 else
33470 {
33476 }
33479 invalid_kind:
33481 resync_fail:
33486 }
33488 /* OpenMP 4.0:
33489 map ( map-kind : variable-list )
33490 map ( variable-list )
33492 map-kind:
33493 alloc | to | from | tofrom
33495 OpenMP 4.5:
33496 map-kind:
33497 alloc | to | from | tofrom | release | delete
33499 map ( always [,] map-kind: variable-list ) */
33501 static tree
33503 {
33512 {
33517 {
33520 nth++;
33526 {
33531 }
33532 }
33533 }
33537 {
33551 else
33552 {
33558 }
33561 }
33564 {
33568 }
33571 NULL);
33577 }
33579 /* OpenMP 4.0:
33580 device ( expression ) */
33582 static tree
33584 location_t location)
33585 {
33588 matching_parens parens;
33608 }
33610 /* OpenMP 4.0:
33611 dist_schedule ( static )
33612 dist_schedule ( static , expression ) */
33614 static tree
33616 location_t location)
33617 {
33620 matching_parens parens;
33631 {
33642 }
33647 location);
33651 invalid_kind:
33653 resync_fail:
33658 }
33660 /* OpenMP 4.0:
33661 proc_bind ( proc-bind-kind )
33663 proc-bind-kind:
33664 master | close | spread */
33666 static tree
33668 location_t location)
33669 {
33670 tree c;
33677 {
33687 else
33689 }
33690 else
33699 location);
33704 invalid_kind:
33706 resync_fail:
33711 }
33713 /* OpenACC:
33714 async [( int-expr )] */
33716 static tree
33718 {
33725 {
33726 matching_parens parens;
33735 }
33745 }
33747 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33748 is a bitmask in MASK. Return the list of clauses found. */
33750 static tree
33754 {
33759 {
33760 location_t here;
33761 pragma_omp_clause c_kind;
33762 omp_clause_code code;
33773 {
33830 clauses);
33848 OMP_CLAUSE_IF_PRESENT,
33854 OMP_CLAUSE_INDEPENDENT,
33866 clauses);
33872 clauses);
33880 clauses);
33898 clauses);
33910 clauses);
33924 }
33929 {
33930 /* Remove the invalid clause(s) from the list to avoid
33931 confusing the rest of the compiler. */
33934 }
33935 }
33937 saw_error:
33944 }
33946 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33947 is a bitmask in MASK. Return the list of clauses found; the result
33948 of clause default goes in *pdefault. */
33950 static tree
33954 {
33960 {
33961 pragma_omp_clause c_kind;
33972 {
33984 clauses);
33998 clauses);
34018 clauses);
34023 clauses);
34033 clauses);
34067 clauses);
34081 clauses);
34096 OMP_CLAUSE_NOTINBRANCH,
34105 {
34106 clause_not_first:
34110 }
34140 clauses);
34141 else
34151 clauses);
34169 {
34174 }
34217 clauses
34223 clauses
34231 }
34236 {
34237 /* Remove the invalid clause(s) from the list to avoid
34238 confusing the rest of the compiler. */
34241 }
34242 }
34243 saw_error:
34246 {
34249 else
34251 }
34253 }
34255 /* OpenMP 2.5:
34256 structured-block:
34257 statement
34259 In practice, we're also interested in adding the statement to an
34260 outer node. So it is convenient if we work around the fact that
34261 cp_parser_statement calls add_stmt. */
34263 static unsigned
34265 {
34268 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34269 This preserves the "not within loop or switch" style error messages
34270 for nonsense cases like
34271 void foo() {
34272 #pragma omp single
34273 break;
34274 }
34275 */
34280 }
34282 static void
34284 {
34286 }
34288 static tree
34290 {
34298 }
34300 /* OpenMP 2.5:
34301 # pragma omp atomic new-line
34302 expression-stmt
34304 expression-stmt:
34305 x binop= expr | x++ | ++x | x-- | --x
34306 binop:
34307 +, *, -, /, &, ^, |, <<, >>
34309 where x is an lvalue expression with scalar type.
34311 OpenMP 3.1:
34312 # pragma omp atomic new-line
34313 update-stmt
34315 # pragma omp atomic read new-line
34316 read-stmt
34318 # pragma omp atomic write new-line
34319 write-stmt
34321 # pragma omp atomic update new-line
34322 update-stmt
34324 # pragma omp atomic capture new-line
34325 capture-stmt
34327 # pragma omp atomic capture new-line
34328 capture-block
34330 read-stmt:
34331 v = x
34332 write-stmt:
34333 x = expr
34334 update-stmt:
34335 expression-stmt | x = x binop expr
34336 capture-stmt:
34337 v = expression-stmt
34338 capture-block:
34339 { v = x; update-stmt; } | { update-stmt; v = x; }
34341 OpenMP 4.0:
34342 update-stmt:
34343 expression-stmt | x = x binop expr | x = expr binop x
34344 capture-stmt:
34345 v = update-stmt
34346 capture-block:
34347 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34349 where x and v are lvalue expressions with scalar type. */
34351 static void
34353 {
34361 {
34366 {
34372 }
34373 }
34375 {
34387 else
34391 }
34393 {
34399 {
34404 {
34407 }
34408 }
34409 }
34413 {
34423 else
34428 {
34429 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34430 opcode. */
34435 }
34439 {
34442 }
34443 else
34444 {
34450 }
34453 }
34455 restart:
34459 {
34466 /* FALLTHROUGH */
34476 /* FALLTHROUGH */
34491 /* Undo effects of boolean_increment for post {in,de}crement. */
34493 /* FALLTHRU */
34497 {
34498 /* Undo effects of boolean_increment. */
34500 {
34501 /* This is pre or post increment. */
34506 && !structured_block
34510 }
34511 }
34512 /* FALLTHRU */
34515 {
34550 {
34554 }
34557 {
34563 {
34568 }
34570 {
34582 {
34584 {
34589 }
34590 else
34592 }
34596 }
34599 {
34606 }
34610 }
34614 {
34617 {
34625 }
34627 {
34632 }
34667 }
34678 /* FALLTHROUGH */
34683 }
34690 }
34691 stmt_done:
34693 {
34704 }
34706 {
34709 }
34710 done:
34716 saw_error:
34719 {
34723 {
34727 }
34728 }
34729 }
34732 /* OpenMP 2.5:
34733 # pragma omp barrier new-line */
34735 static void
34737 {
34740 }
34742 /* OpenMP 2.5:
34743 # pragma omp critical [(name)] new-line
34744 structured-block
34746 OpenMP 4.5:
34747 # pragma omp critical [(name) [hint(expression)]] new-line
34748 structured-block */
34750 #define OMP_CRITICAL_CLAUSE_MASK \
34751 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34753 static tree
34755 {
34759 {
34760 matching_parens parens;
34774 OMP_CRITICAL_CLAUSE_MASK,
34776 }
34777 else
34782 }
34784 /* OpenMP 2.5:
34785 # pragma omp flush flush-vars[opt] new-line
34787 flush-vars:
34788 ( variable-list ) */
34790 static void
34792 {
34798 }
34800 /* Helper function, to parse omp for increment expression. */
34802 static tree
34804 {
34809 {
34812 }
34815 {
34822 /* Fall through: OpenMP disallows NE_EXPR. */
34826 }
34828 /* If decl is an iterator, preserve LHS and RHS of the relational
34829 expr until finish_omp_for. */
34840 }
34842 /* Helper function, to parse omp for increment expression. */
34844 static tree
34846 {
34850 cp_id_kind idk;
34854 {
34863 }
34872 {
34877 }
34884 {
34888 }
34901 do
34902 {
34909 {
34911 {
34914 else
34916 tf_warning_or_error);
34917 }
34918 else
34921 }
34922 }
34926 {
34932 }
34933 else
34937 }
34939 /* Parse the initialization statement of an OpenMP for loop.
34941 Return true if the resulting construct should have an
34942 OMP_CLAUSE_PRIVATE added to it. */
34944 static tree
34952 {
34958 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34960 init-expr:
34961 var = lb
34962 integer-type var = lb
34963 random-access-iterator-type var = lb
34964 pointer-type var = lb
34965 */
34966 cp_decl_specifier_seq type_specifiers;
34968 /* First, try to parse as an initialized declaration. See
34969 cp_parser_condition, from whence the bulk of this is copied. */
34976 {
34977 /* If parsing a type specifier seq succeeded, then this
34978 MUST be a initialized declaration. */
34983 CP_PARSER_DECLARATOR_NAMED,
34994 else
34995 {
35005 {
35007 CPP_OPEN_PAREN))
35010 else
35011 /* Trigger an error. */
35016 }
35020 {
35028 {
35031 auto_node);
35036 }
35039 asm_specification,
35040 LOOKUP_ONLYCONVERTING);
35043 {
35046 }
35047 else
35048 {
35051 {
35053 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35055 {
35059 {
35063 }
35065 }
35067 {
35072 }
35073 }
35074 }
35076 }
35077 else
35078 {
35079 /* Consume '='. */
35083 non_class:
35086 else
35089 asm_specification,
35090 LOOKUP_ONLYCONVERTING);
35091 }
35095 }
35096 }
35097 else
35098 {
35099 cp_id_kind idk;
35100 /* If parsing a type specifier sequence failed, then
35101 this MUST be a simple expression. */
35107 && decl
35110 {
35121 {
35126 }
35131 }
35133 && decl
35136 {
35137 tree rhs;
35145 rhs,
35146 tf_warning_or_error));
35149 }
35150 else
35151 {
35156 {
35160 }
35161 }
35162 }
35164 }
35166 /* Parse the restricted form of the for statement allowed by OpenMP. */
35168 static tree
35171 {
35175 location_t loc_first;
35186 {
35189 }
35192 {
35195 }
35198 {
35204 }
35206 {
35209 {
35211 "%<linear%> clause may not be specified together "
35214 }
35215 else
35217 }
35230 {
35233 location_t loc;
35236 {
35240 }
35243 matching_parens parens;
35250 add_private_clause
35256 {
35259 {
35265 }
35266 else
35268 }
35275 {
35280 {
35284 }
35287 {
35288 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35292 {
35295 }
35296 else
35297 {
35300 }
35302 }
35303 else
35304 {
35309 }
35310 }
35313 {
35314 tree c;
35316 {
35325 decl);
35329 decl);
35330 }
35332 {
35337 else
35342 {
35345 /* For linear, signal that we need to fill up
35346 the so far unknown linear step. */
35349 }
35350 }
35351 }
35360 {
35361 /* If decl is an iterator, preserve the operator on decl
35362 until finish_omp_for. */
35364 && ((processing_template_decl
35369 else
35373 }
35385 {
35388 }
35393 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35394 in between the collapsed for loops to be still considered perfectly
35395 nested. Hopefully the final version clarifies this.
35396 For now handle (multiple) {'s and empty statements. */
35399 {
35403 {
35405 bracecount++;
35406 }
35410 else
35411 {
35418 }
35419 }
35422 {
35425 }
35426 }
35431 /* Note that we saved the original contents of this flag when we entered
35432 the structured block, and so we don't need to re-save it here. */
35435 /* Note that the grammar doesn't call for a structured block here,
35436 though the loop as a whole is a structured block. */
35443 else
35448 {
35450 {
35452 nbraces--;
35453 }
35456 else
35457 {
35459 {
35462 }
35467 }
35468 }
35471 {
35475 else
35477 }
35481 }
35483 /* Helper function for OpenMP parsing, split clauses and call
35484 finish_omp_clauses on each of the set of clauses afterwards. */
35486 static void
35489 {
35495 }
35497 /* OpenMP 4.0:
35498 #pragma omp simd simd-clause[optseq] new-line
35499 for-loop */
35501 #define OMP_SIMD_CLAUSE_MASK \
35502 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35511 static tree
35515 {
35526 {
35530 OMP_CLAUSE_ORDERED);
35532 {
35534 "%<ordered%> clause with parameter may not be specified "
35537 }
35538 }
35549 }
35551 /* OpenMP 2.5:
35552 #pragma omp for for-clause[optseq] new-line
35553 for-loop
35555 OpenMP 4.0:
35556 #pragma omp for simd for-simd-clause[optseq] new-line
35557 for-loop */
35559 #define OMP_FOR_CLAUSE_MASK \
35560 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35570 static tree
35574 {
35581 /* parallel for{, simd} disallows nowait clause, but for
35582 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35585 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35590 {
35595 {
35619 }
35620 }
35622 {
35625 }
35627 /* Composite distribute parallel for disallows linear clause. */
35634 {
35637 }
35648 }
35650 /* OpenMP 2.5:
35651 # pragma omp master new-line
35652 structured-block */
35654 static tree
35656 {
35660 }
35662 /* OpenMP 2.5:
35663 # pragma omp ordered new-line
35664 structured-block
35666 OpenMP 4.5:
35667 # pragma omp ordered ordered-clauses new-line
35668 structured-block */
35670 #define OMP_ORDERED_CLAUSE_MASK \
35671 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35674 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35675 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35677 static bool
35680 {
35684 {
35689 {
35691 {
35694 }
35696 {
35698 "%<depend%> clause may only be used in compound "
35702 }
35703 tree clauses
35705 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35709 }
35710 }
35712 tree clauses
35723 }
35725 /* OpenMP 2.5:
35727 section-scope:
35728 { section-sequence }
35730 section-sequence:
35731 section-directive[opt] structured-block
35732 section-sequence section-directive structured-block */
35734 static tree
35736 {
35741 matching_braces braces;
35749 {
35753 }
35756 {
35764 {
35768 }
35770 {
35773 }
35778 }
35789 }
35791 /* OpenMP 2.5:
35792 # pragma omp sections sections-clause[optseq] newline
35793 sections-scope */
35795 #define OMP_SECTIONS_CLAUSE_MASK \
35796 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35802 static tree
35805 {
35817 {
35820 }
35827 }
35829 /* OpenMP 2.5:
35830 # pragma omp parallel parallel-clause[optseq] new-line
35831 structured-block
35832 # pragma omp parallel for parallel-for-clause[optseq] new-line
35833 structured-block
35834 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35835 structured-block
35837 OpenMP 4.0:
35838 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35839 structured-block */
35841 #define OMP_PARALLEL_CLAUSE_MASK \
35842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35852 static tree
35856 {
35863 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35869 {
35877 if_p);
35881 if_p);
35884 block);
35889 }
35890 /* When combined with distribute, parallel has to be followed by for.
35891 #pragma omp target parallel is allowed though. */
35895 {
35899 }
35901 {
35904 }
35906 {
35910 {
35920 block);
35923 }
35924 }
35929 {
35932 }
35940 }
35942 /* OpenMP 2.5:
35943 # pragma omp single single-clause[optseq] new-line
35944 structured-block */
35946 #define OMP_SINGLE_CLAUSE_MASK \
35947 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35952 static tree
35954 {
35964 }
35966 /* OpenMP 3.0:
35967 # pragma omp task task-clause[optseq] new-line
35968 structured-block */
35970 #define OMP_TASK_CLAUSE_MASK \
35971 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35982 static tree
35984 {
35995 }
35997 /* OpenMP 3.0:
35998 # pragma omp taskwait new-line */
36000 static void
36002 {
36005 }
36007 /* OpenMP 3.1:
36008 # pragma omp taskyield new-line */
36010 static void
36012 {
36015 }
36017 /* OpenMP 4.0:
36018 # pragma omp taskgroup new-line
36019 structured-block */
36021 static tree
36023 {
36027 if_p));
36028 }
36031 /* OpenMP 2.5:
36032 # pragma omp threadprivate (variable-list) */
36034 static void
36036 {
36037 tree vars;
36043 }
36045 /* OpenMP 4.0:
36046 # pragma omp cancel cancel-clause[optseq] new-line */
36048 #define OMP_CANCEL_CLAUSE_MASK \
36049 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36055 static void
36057 {
36061 }
36063 /* OpenMP 4.0:
36064 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36066 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36067 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36072 static void
36075 {
36076 tree clauses;
36080 {
36085 {
36088 }
36089 }
36091 {
36095 }
36098 {
36103 else
36107 }
36110 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36112 pragma_tok);
36114 }
36116 /* OpenMP 4.0:
36117 #pragma omp distribute distribute-clause[optseq] new-line
36118 for-loop */
36120 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36127 static tree
36131 {
36140 {
36148 else
36151 {
36157 {
36161 else
36164 }
36170 else
36184 }
36185 }
36187 {
36190 }
36195 {
36198 }
36209 }
36211 /* OpenMP 4.0:
36212 # pragma omp teams teams-clause[optseq] new-line
36213 structured-block */
36215 #define OMP_TEAMS_CLAUSE_MASK \
36216 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36224 static tree
36228 {
36237 {
36241 {
36266 }
36267 }
36269 {
36272 }
36277 {
36280 }
36289 }
36291 /* OpenMP 4.0:
36292 # pragma omp target data target-data-clause[optseq] new-line
36293 structured-block */
36295 #define OMP_TARGET_DATA_CLAUSE_MASK \
36296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36301 static tree
36303 {
36304 tree clauses
36309 {
36312 {
36329 "%<#pragma omp target data%> with map-type other "
36330 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36334 }
36336 }
36339 {
36342 "%<#pragma omp target data%> must contain at least "
36345 }
36356 }
36358 /* OpenMP 4.5:
36359 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36360 structured-block */
36362 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36369 static tree
36372 {
36375 {
36380 {
36383 }
36384 }
36386 {
36390 }
36393 {
36399 }
36401 tree clauses
36406 {
36409 {
36422 "%<#pragma omp target enter data%> with map-type other "
36426 }
36428 }
36431 {
36434 "%<#pragma omp target enter data%> must contain at least "
36437 }
36444 }
36446 /* OpenMP 4.5:
36447 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36448 structured-block */
36450 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36451 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36457 static tree
36460 {
36463 {
36468 {
36471 }
36472 }
36474 {
36478 }
36481 {
36487 }
36489 tree clauses
36494 {
36497 {
36511 "%<#pragma omp target exit data%> with map-type other "
36512 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36516 }
36518 }
36521 {
36524 "%<#pragma omp target exit data%> must contain at least "
36527 }
36534 }
36536 /* OpenMP 4.0:
36537 # pragma omp target update target-update-clause[optseq] new-line */
36539 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36540 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36547 static bool
36550 {
36552 {
36558 }
36560 tree clauses
36565 {
36567 "%<#pragma omp target update%> must contain at least one "
36570 }
36578 }
36580 /* OpenMP 4.0:
36581 # pragma omp target target-clause[optseq] new-line
36582 structured-block */
36584 #define OMP_TARGET_CLAUSE_MASK \
36585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36595 static bool
36598 {
36602 {
36614 {
36622 {
36623 tree stmt;
36625 {
36628 OMP_TARGET_CLAUSE_MASK,
36633 OMP_TARGET_CLAUSE_MASK,
36638 OMP_TARGET_CLAUSE_MASK,
36643 }
36645 }
36650 {
36654 if_p);
36659 if_p);
36664 if_p);
36668 }
36674 {
36675 /* For combined target teams, ensure the num_teams and
36676 thread_limit clause expressions are evaluated on the host,
36677 before entering the target construct. */
36678 tree c;
36684 {
36693 OMP_CLAUSE_FIRSTPRIVATE);
36698 }
36699 }
36709 }
36711 {
36714 }
36716 {
36720 }
36722 {
36726 }
36728 {
36732 }
36734 {
36737 }
36738 }
36740 {
36743 }
36758 check_clauses:
36760 {
36763 {
36777 "%<#pragma omp target%> with map-type other "
36778 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36782 }
36784 }
36786 }
36788 /* OpenACC 2.0:
36789 # pragma acc cache (variable-list) new-line
36790 */
36792 static tree
36794 {
36809 }
36811 /* OpenACC 2.0:
36812 # pragma acc data oacc-data-clause[optseq] new-line
36813 structured-block */
36815 #define OACC_DATA_CLAUSE_MASK \
36816 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36824 static tree
36826 {
36839 }
36841 /* OpenACC 2.0:
36842 # pragma acc host_data <clauses> new-line
36843 structured-block */
36845 #define OACC_HOST_DATA_CLAUSE_MASK \
36846 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36848 static tree
36850 {
36863 }
36865 /* OpenACC 2.0:
36866 # pragma acc declare oacc-data-clause[optseq] new-line
36867 */
36869 #define OACC_DECLARE_CLAUSE_MASK \
36870 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36879 static tree
36881 {
36890 {
36894 }
36897 {
36901 {
36905 }
36908 {
36920 {
36922 "%qD must be a global variable in "
36924 decl);
36927 }
36932 {
36936 }
36938 {
36940 "invalid use of %<extern%> variable %qD "
36944 }
36946 {
36948 "invalid use of %<global%> variable %qD "
36952 }
36954 }
36959 {
36964 }
36967 {
36968 tree id;
36972 else
36978 {
36981 {
36984 {
36988 }
36989 }
36990 }
36991 }
36992 }
37005 }
37007 /* OpenACC 2.0:
37008 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37010 or
37012 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37014 LOC is the location of the #pragma token.
37015 */
37017 #define OACC_ENTER_DATA_CLAUSE_MASK \
37018 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37024 #define OACC_EXIT_DATA_CLAUSE_MASK \
37025 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
37030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37032 static tree
37035 {
37044 {
37049 }
37056 else
37061 {
37065 }
37073 }
37075 /* OpenACC 2.0:
37076 # pragma acc loop oacc-loop-clause[optseq] new-line
37077 structured-block */
37079 #define OACC_LOOP_CLAUSE_MASK \
37080 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37091 static tree
37094 {
37103 {
37109 }
37118 }
37120 /* OpenACC 2.0:
37121 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37122 structured-block
37124 or
37126 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37127 structured-block
37128 */
37130 #define OACC_KERNELS_CLAUSE_MASK \
37131 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37145 #define OACC_PARALLEL_CLAUSE_MASK \
37146 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37163 static tree
37166 {
37167 omp_clause_mask mask;
37170 {
37183 }
37186 {
37190 {
37193 tree clauses;
37195 if_p);
37197 }
37198 }
37207 }
37209 /* OpenACC 2.0:
37210 # pragma acc update oacc-update-clause[optseq] new-line
37211 */
37213 #define OACC_UPDATE_CLAUSE_MASK \
37214 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
37219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37221 static tree
37223 {
37230 {
37232 "%<#pragma acc update%> must contain at least one "
37235 }
37243 }
37245 /* OpenACC 2.0:
37246 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37248 LOC is the location of the #pragma token.
37249 */
37251 #define OACC_WAIT_CLAUSE_MASK \
37252 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37254 static tree
37256 {
37270 }
37272 /* OpenMP 4.0:
37273 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37275 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37276 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37283 static void
37286 {
37288 cp_omp_declare_simd_data data;
37290 {
37295 /* It is safe to take the address of a local variable; it will only be
37296 used while this scope is live. */
37298 }
37300 /* Store away all pragma tokens. */
37312 {
37316 {
37329 }
37334 "%<#pragma omp declare simd%> not immediately followed by "
37338 }
37339 }
37341 /* Finalize #pragma omp declare simd clauses after direct declarator has
37342 been parsed, and put that into "omp declare simd" attribute. */
37344 static tree
37346 {
37352 {
37356 }
37361 {
37379 }
37383 }
37386 /* OpenMP 4.0:
37387 # pragma omp declare target new-line
37388 declarations and definitions
37389 # pragma omp end declare target new-line
37391 OpenMP 4.5:
37392 # pragma omp declare target ( extended-list ) new-line
37394 # pragma omp declare target declare-target-clauses[seq] new-line */
37396 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37397 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37400 static void
37402 {
37405 clauses
37409 {
37411 clauses);
37414 }
37415 else
37416 {
37420 }
37423 "%<#pragma omp declare target%> with clauses in between "
37424 "%<#pragma omp declare target%> without clauses and "
37427 {
37433 {
37436 }
37437 else
37440 {
37442 "%qD specified both in declare target %<link%> and %<to%>"
37445 }
37447 {
37454 {
37457 {
37461 }
37462 }
37463 }
37464 }
37465 }
37467 static void
37469 {
37472 {
37475 }
37477 {
37481 {
37484 }
37487 else
37488 {
37492 }
37493 }
37494 else
37495 {
37499 }
37503 "%<#pragma omp end declare target%> without corresponding "
37505 else
37507 }
37509 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37510 expression and optional initializer clause of
37511 #pragma omp declare reduction. We store the expression(s) as
37512 either 3, 6 or 7 special statements inside of the artificial function's
37513 body. The first two statements are DECL_EXPRs for the artificial
37514 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37515 expression that uses those variables.
37516 If there was any INITIALIZER clause, this is followed by further statements,
37517 the fourth and fifth statements are DECL_EXPRs for the artificial
37518 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37519 constructor variant (first token after open paren is not omp_priv),
37520 then the sixth statement is a statement with the function call expression
37521 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37522 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37523 to initialize the OMP_PRIV artificial variable and there is seventh
37524 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37526 static bool
37528 {
37540 tree combiner;
37555 {
37558 }
37561 {
37563 matching_parens parens;
37569 {
37572 }
37588 {
37592 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37596 == CPP_CLOSE_PAREN
37599 {
37603 }
37608 }
37609 else
37610 {
37626 {
37631 }
37633 tree arg;
37646 }
37657 }
37661 UNKNOWN_LOCATION);
37664 }
37666 /* OpenMP 4.0
37667 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37668 initializer-clause[opt] new-line
37670 initializer-clause:
37671 initializer (omp_priv initializer)
37672 initializer (function-name (argument-list)) */
37674 static void
37677 {
37687 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37694 {
37726 }
37738 /* Types may not be defined in declare reduction type list. */
37741 parser->type_definition_forbidden_message
37747 saved_colon_doesnt_start_class_def_p
37752 {
37756 ;
37775 else
37780 else
37782 }
37784 /* Restore the saved message. */
37787 parser->colon_doesnt_start_class_def_p
37792 {
37793 fail:
37796 }
37802 {
37803 tree fntype
37806 NULL_TREE);
37826 {
37831 }
37833 {
37835 {
37844 }
37851 }
37852 else
37853 {
37856 }
37859 else
37862 {
37865 }
37867 {
37870 else
37875 }
37880 else
37881 {
37890 }
37897 }
37901 done:
37902 /* Free any declarators allocated. */
37904 }
37906 /* OpenMP 4.0
37907 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37908 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37909 initializer-clause[opt] new-line
37910 #pragma omp declare target new-line */
37912 static bool
37915 {
37917 {
37922 {
37925 context);
37927 }
37930 {
37933 context);
37935 }
37937 {
37940 }
37942 {
37946 }
37947 }
37952 }
37954 /* OpenMP 4.5:
37955 #pragma omp taskloop taskloop-clause[optseq] new-line
37956 for-loop
37958 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37959 for-loop */
37961 #define OMP_TASKLOOP_CLAUSE_MASK \
37962 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37977 static tree
37981 {
37990 {
37995 {
38019 }
38020 }
38022 {
38025 }
38030 {
38033 }
38039 if_p);
38045 }
38048 /* OpenACC 2.0:
38049 # pragma acc routine oacc-routine-clause[optseq] new-line
38050 function-definition
38052 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38053 */
38055 #define OACC_ROUTINE_CLAUSE_MASK \
38056 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38062 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38063 component, which must resolve to a declared namespace-scope
38064 function. The clauses are either processed directly (for a named
38065 function), or defered until the immediatley following declaration
38066 is parsed. */
38068 static void
38071 {
38073 /* The checking for "another pragma following this one" in the "no optional
38074 '( name )'" case makes sure that we dont re-enter. */
38077 cp_oacc_routine_data data;
38083 /* It is safe to take the address of a local variable; it will only be
38084 used while this scope is live. */
38087 /* Look for optional '( name )'. */
38089 {
38090 matching_parens parens;
38093 /* We parse the name as an id-expression. If it resolves to
38094 anything other than a non-overloaded function at namespace
38095 scope, it's an error. */
38111 {
38115 }
38117 data.clauses
38125 {
38130 }
38132 /* Perhaps we should use the same rule as declarations in different
38133 namespaces? */
38135 {
38140 }
38143 {
38147 }
38151 }
38153 {
38154 /* Store away all pragma tokens. */
38165 /* Emit a helpful diagnostic if there's another pragma following this
38166 one. */
38168 {
38171 /* ..., and then just keep going. */
38173 }
38175 /* We only have to consider the pragma_external case here. */
38180 else
38183 }
38184 }
38186 /* Finalize #pragma acc routine clauses after direct declarator has
38187 been parsed. */
38189 static tree
38191 {
38196 {
38198 "%<#pragma acc routine%> not immediately followed by "
38201 }
38218 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38219 fndecl_seen. */
38222 }
38224 /* Apply any saved OpenACC routine clauses to a just-parsed
38225 declaration. */
38227 static void
38229 {
38231 {
38232 /* Keep going if we're in error reporting mode. */
38238 {
38240 "%<#pragma acc routine%> not immediately followed by"
38244 }
38246 {
38249 }
38252 {
38257 }
38260 {
38268 }
38270 /* Process the routine's dimension clauses. */
38274 /* Add an "omp declare target" attribute. */
38279 /* Don't unset parser->oacc_routine here: we may still need it to
38280 diagnose wrong usage. But, remember that we've used this "#pragma acc
38281 routine". */
38283 }
38284 }
38286 /* Main entry point to OpenMP statement pragmas. */
38288 static void
38290 {
38291 tree stmt;
38296 {
38319 if_p);
38324 if_p);
38341 if_p);
38346 if_p);
38354 if_p);
38363 if_p);
38377 if_p);
38382 if_p);
38386 }
38389 }
38390 \f
38391 /* Transactional Memory parsing routines. */
38393 /* Parse a transaction attribute.
38395 txn-attribute:
38396 attribute
38397 [ [ identifier ] ]
38399 We use this instead of cp_parser_attributes_opt for transactions to avoid
38400 the pedwarn in C++98 mode. */
38402 static tree
38404 {
38419 {
38423 /* For keywords, use the canonical spelling,
38424 not the parsed identifier. */
38428 }
38429 else
38433 error1:
38436 }
38438 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38440 transaction-statement:
38441 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38442 compound-statement
38443 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38444 */
38446 static tree
38448 {
38459 else
38460 {
38464 }
38466 /* Parse a noexcept specification. */
38470 {
38471 /* cancel-and-throw is unimplemented. */
38474 }
38475 else
38478 /* Keep track if we're in the lexical scope of an outer transaction. */
38490 }
38492 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38494 transaction-expression:
38495 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38496 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38497 */
38499 static tree
38501 {
38514 keyword == RID_TRANSACTION_RELAXED
38528 /* Set this early. This might mean that we allow transaction_cancel in
38529 an expression that we find out later actually has to be a constexpr.
38530 However, we expect that cxx_constant_value will be able to deal with
38531 this; also, if the noexcept has no constexpr, then what we parse next
38532 really is a transaction's body. */
38535 /* Parse a noexcept specification. */
38541 {
38542 matching_parens parens;
38549 }
38550 else
38551 {
38552 /* The only expression that is available got parsed for the noexcept
38553 already. noexcept is true then. */
38556 }
38565 }
38567 /* Parse a function-transaction-block.
38569 function-transaction-block:
38570 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38571 function-body
38572 __transaction_atomic txn-attribute[opt] function-try-block
38573 __transaction_relaxed ctor-initializer[opt] function-body
38574 __transaction_relaxed function-try-block
38575 */
38577 static void
38579 {
38594 else
38595 {
38599 }
38607 else
38608 cp_parser_ctor_initializer_opt_and_function_body
38614 }
38616 /* Parse a __transaction_cancel statement.
38618 cancel-statement:
38619 __transaction_cancel txn-attribute[opt] ;
38620 __transaction_cancel txn-attribute[opt] throw-expression ;
38622 ??? Cancel and throw is not yet implemented. */
38624 static tree
38626 {
38632 RT_TRANSACTION_CANCEL);
38639 /* ??? Parse cancel-and-throw here. */
38644 {
38648 }
38650 {
38654 }
38656 {
38659 {
38665 }
38666 }
38668 {
38672 }
38678 }
38679 \f
38680 /* The parser. */
38684 \f
38685 /* Special handling for the first token or line in the file. The first
38686 thing in the file might be #pragma GCC pch_preprocess, which loads a
38687 PCH file, which is a GC collection point. So we need to handle this
38688 first pragma without benefit of an existing lexer structure.
38690 Always returns one token to the caller in *FIRST_TOKEN. This is
38691 either the true first token of the file, or the first token after
38692 the initial pragma. */
38694 static void
38696 {
38705 {
38712 }
38713 else
38716 /* Skip to the end of the pragma. */
38720 /* Now actually load the PCH file. */
38724 /* Read one more token to return to our caller. We have to do this
38725 after reading the PCH file in, since its pointers have to be
38726 live. */
38728 }
38730 /* Parse a pragma GCC ivdep. */
38732 static bool
38734 {
38737 }
38739 /* Parse a pragma GCC unroll. */
38741 static unsigned short
38743 {
38753 {
38755 " assignment-expression that evaluates to a non-negative"
38758 }
38759 else
38760 {
38764 }
38767 }
38769 /* Normal parsing of a pragma token. Here we can (and must) use the
38770 regular lexer. */
38772 static bool
38774 {
38777 tree stmt;
38788 {
38796 {
38806 }
38811 {
38821 }
38826 {
38837 }
38842 {
38853 }
38858 {
38869 }
38889 {
38894 }
38902 {
38907 }
38915 {
38919 }
38925 {
38930 }
38938 {
38943 }
38998 "%<#pragma omp section%> may only be used in "
39003 {
39005 {
39009 }
39015 {
39019 }
39020 else
39026 {
39029 }
39032 }
39035 {
39037 {
39041 }
39042 const unsigned short unroll
39048 {
39052 }
39053 else
39059 {
39062 }
39065 }
39072 bad_stmt:
39075 }
39079 }
39081 /* The interface the pragma parsers have to the lexer. */
39083 enum cpp_ttype
39085 {
39097 else
39098 {
39102 }
39105 }
39107 \f
39108 /* External interface. */
39110 /* Parse one entire translation unit. */
39112 void
39114 {
39127 }
39129 /* Create an identifier for a generic parameter type (a synthesized
39130 template parameter implied by `auto' or a concept identifier). */
39133 static tree
39135 {
39139 }
39141 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39142 (creating a new template parameter list if necessary). Returns the newly
39143 created template type parm. */
39145 static tree
39147 {
39150 /* Before committing to modifying any scope, if we're in an
39151 implicit template scope, and we're trying to synthesize a
39152 constrained parameter, try to find a previous parameter with
39153 the same name. This is the same-type rule for abbreviated
39154 function templates.
39156 NOTE: We can generate implicit parameters when tentatively
39157 parsing a nested name specifier, only to reject that parse
39158 later. However, matching the same template-id as part of a
39159 direct-declarator should generate an identical template
39160 parameter, so this rule will merge them. */
39162 {
39165 {
39167 {
39170 /* Return the TEMPLATE_PARM_INDEX. */
39173 }
39175 }
39176 }
39178 /* We are either continuing a function template that already contains implicit
39179 template parameters, creating a new fully-implicit function template, or
39180 extending an existing explicit function template with implicit template
39181 parameters. */
39189 {
39193 }
39194 else
39195 {
39196 /* Roll back to the existing template parameter scope (in the case of
39197 extending an explicit function template) or introduce a new template
39198 parameter scope ahead of the function parameter scope (or class scope
39199 in the case of out-of-line member definitions). The function scope is
39200 added back after template parameter synthesis below. */
39205 {
39208 }
39210 {
39211 /* If not defining a class, then any class scope is a scope level in
39212 an out-of-line member definition. In this case simply wind back
39213 beyond the first such scope to inject the template parameter list.
39214 Otherwise wind back to the class being defined. The latter can
39215 occur in class member friend declarations such as:
39217 class A {
39218 void foo (auto);
39219 };
39220 class B {
39221 friend void A::foo (auto);
39222 };
39224 The template parameter list synthesized for the friend declaration
39225 must be injected in the scope of 'B'. This can also occur in
39226 erroneous cases such as:
39228 struct A {
39229 struct B {
39230 void foo (auto);
39231 };
39232 void B::foo (auto) {}
39233 };
39235 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39236 but, nevertheless, the template parameter list synthesized for the
39237 declarator should be injected into the scope of 'A' as if the
39238 ill-formed template was specified explicitly. */
39241 {
39244 }
39245 }
39251 {
39252 /* Introduce a new template parameter list for implicit template
39253 parameters. */
39257 parser->implicit_template_scope
39264 }
39265 else
39266 {
39267 /* Synthesize implicit template parameters at the end of the explicit
39268 template parameter list. */
39275 parser->implicit_template_parms
39277 }
39278 }
39280 /* Synthesize a new template parameter and track the current template
39281 parameter chain with implicit_template_parms. */
39285 tree synth_tmpl_parm;
39289 synth_tmpl_parm
39292 synth_tmpl_parm
39294 else
39295 {
39299 }
39301 // Attach the constraint to the parm before processing.
39304 tree new_parm
39306 input_location,
39307 node,
39311 // Chain the new parameter to the list of implicit parameters.
39313 parser->implicit_template_parms
39315 else
39320 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39323 /* If creating a fully implicit function template, start the new implicit
39324 template parameter list with this synthesized type, otherwise grow the
39325 current template parameter list. */
39328 {
39335 }
39336 else
39337 {
39342 }
39344 // If the new parameter was constrained, we need to add that to the
39345 // constraints in the template parameter list.
39347 {
39351 }
39356 }
39358 /* Finish the declaration of a fully implicit function template. Such a
39359 template has no explicit template parameter list so has not been through the
39360 normal template head and tail processing. synthesize_implicit_template_parm
39361 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39362 provided if the declaration is a class member such that its template
39363 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39364 form is returned. Otherwise NULL_TREE is returned. */
39366 static tree
39368 {
39373 {
39377 }
39389 }
39391 /* Like finish_fully_implicit_template, but to be used in error
39392 recovery, rearranging scopes so that we restore the state we had
39393 before synthesize_implicit_template_parm inserted the implement
39394 template parms scope. */
39396 static void
39398 {
39403 {
39412 }
39413 else
39419 }
39421 /* Helper function for diagnostics that have complained about things
39422 being used with 'extern "C"' linkage.
39424 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39426 void
39428 {
39432 }