| blob | aa5286b24ccbb6e7c8d77bffbcc60c15d7045744 |
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 {
10288 }
10291 {
10293 tree capture_id;
10294 tree capture_init_expr;
10298 enum capture_kind_type
10299 {
10300 BY_COPY,
10301 BY_REFERENCE
10302 };
10306 {
10309 }
10313 else
10316 /* Possibly capture `this'. */
10318 {
10329 explicit_init_p);
10331 }
10333 /* Possibly capture `*this'. */
10336 {
10347 explicit_init_p);
10349 }
10351 /* Remember whether we want to capture as a reference or not. */
10353 {
10356 }
10358 /* Get the identifier. */
10363 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10364 delimiters, but I modified this to stop on unnested ']' as well. It
10365 was already changed to stop on unnested '}', so the
10366 "closing_parenthesis" name is no more misleading with my change. */
10367 {
10373 }
10375 /* Find the initializer for this capture. */
10379 {
10381 /* An explicit initializer exists. */
10384 "lambda capture initializers "
10390 {
10393 }
10394 }
10395 else
10396 {
10399 /* Turn the identifier into an id-expression. */
10400 capture_init_expr
10405 {
10408 }
10411 {
10414 capture_init_expr);
10419 }
10422 {
10425 capture_init_expr))
10429 }
10431 capture_init_expr
10432 = finish_id_expression
10434 capture_init_expr,
10448 {
10451 }
10452 }
10456 {
10461 capture_id);
10465 "capture of %qD redundant with by-reference capture "
10467 }
10470 capture_id,
10471 capture_init_expr,
10473 explicit_init_p);
10475 /* If there is any qualification still in effect, clear it
10476 now; we will be starting fresh with the next capture. */
10480 }
10483 }
10485 /* Parse the (optional) middle of a lambda expression.
10487 lambda-declarator:
10488 < template-parameter-list [opt] >
10489 ( parameter-declaration-clause [opt] )
10490 attribute-specifier [opt]
10491 decl-specifier-seq [opt]
10492 exception-specification [opt]
10493 lambda-return-type-clause [opt]
10495 LAMBDA_EXPR is the current representation of the lambda expression. */
10497 static bool
10499 {
10500 /* 5.1.1.4 of the standard says:
10501 If a lambda-expression does not include a lambda-declarator, it is as if
10502 the lambda-declarator were ().
10503 This means an empty parameter list, no attributes, and no exception
10504 specification. */
10511 cp_decl_specifier_seq lambda_specs;
10514 /* The template-parameter-list is optional, but must begin with
10515 an opening angle if present. */
10517 {
10520 "lambda templates are only available with "
10524 "lambda templates are only available with "
10533 /* We just processed one more parameter list. */
10535 }
10537 /* The parameter-declaration-clause is optional (unless
10538 template-parameter-list was given), but must begin with an
10539 opening parenthesis if present. */
10541 {
10542 matching_parens parens;
10547 /* Parse parameters. */
10550 /* Default arguments shall not be specified in the
10551 parameter-declaration-clause of a lambda-declarator. */
10562 /* In the decl-specifier-seq of the lambda-declarator, each
10563 decl-specifier shall either be mutable or constexpr. */
10567 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10570 {
10575 }
10579 /* Parse optional exception specification. */
10582 /* Parse optional trailing return type. */
10584 {
10587 }
10589 /* The function parameters must be in scope all the way until after the
10590 trailing-return-type in case of decltype. */
10592 }
10596 /* Create the function call operator.
10598 Messing with declarators like this is no uglier than building up the
10599 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10600 other code. */
10601 {
10602 cp_decl_specifier_seq return_type_specs;
10604 tree fco;
10612 {
10616 else
10619 }
10628 VIRT_SPEC_UNSPECIFIED,
10629 REF_QUAL_NONE,
10630 tx_qual,
10631 exception_spec,
10639 declarator,
10640 attributes);
10642 {
10645 /* Give the object parameter a different name. */
10647 }
10649 {
10653 }
10662 }
10663 }
10665 /* Parse the body of a lambda expression, which is simply
10667 compound-statement
10669 but which requires special handling.
10670 LAMBDA_EXPR is the current representation of the lambda expression. */
10672 static void
10674 {
10681 else
10682 /* Still increment function_depth so that we don't GC in the
10683 middle of an expression. */
10688 /* Clear this in case we're in the middle of a default argument. */
10692 {
10696 matching_braces braces;
10699 {
10702 /* Originally C++11 required us to peek for 'return expr'; and
10703 process it specially here to deduce the return type. N3638
10704 removed the need for that. */
10712 }
10715 }
10722 else
10724 }
10726 /* Statements [gram.stmt.stmt] */
10728 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10730 static void
10732 {
10736 /* A concept is never expanded normally. */
10742 }
10744 /* Parse a statement.
10746 statement:
10747 labeled-statement
10748 expression-statement
10749 compound-statement
10750 selection-statement
10751 iteration-statement
10752 jump-statement
10753 declaration-statement
10754 try-block
10756 C++11:
10758 statement:
10759 labeled-statement
10760 attribute-specifier-seq (opt) expression-statement
10761 attribute-specifier-seq (opt) compound-statement
10762 attribute-specifier-seq (opt) selection-statement
10763 attribute-specifier-seq (opt) iteration-statement
10764 attribute-specifier-seq (opt) jump-statement
10765 declaration-statement
10766 attribute-specifier-seq (opt) try-block
10768 init-statement:
10769 expression-statement
10770 simple-declaration
10772 TM Extension:
10774 statement:
10775 atomic-statement
10777 IN_COMPOUND is true when the statement is nested inside a
10778 cp_parser_compound_statement; this matters for certain pragmas.
10780 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10781 is a (possibly labeled) if statement which is not enclosed in braces
10782 and has an else clause. This is used to implement -Wparentheses.
10784 CHAIN is a vector of if-else-if conditions. */
10786 static void
10790 {
10795 restart:
10798 /* There is no statement yet. */
10804 /* In obj-c++, seeing '[[' might be the either the beginning of
10805 c++11 attributes, or a nested objc-message-expression. So
10806 let's parse the c++11 attributes tentatively. */
10810 {
10813 }
10815 /* Peek at the next token. */
10817 /* Remember the location of the first token in the statement. */
10820 /* If this is a keyword, then that will often determine what kind of
10821 statement we have. */
10823 {
10827 {
10830 /* Looks like a labeled-statement with a case label.
10831 Parse the label, and then use tail recursion to parse
10832 the statement. */
10855 /* Objective-C++ exception-handling constructs. */
10869 /* This must be a namespace alias definition. */
10885 /* It might be a keyword like `int' that can start a
10886 declaration-statement. */
10888 }
10889 }
10891 {
10892 /* If the next token is a `:', then we are looking at a
10893 labeled-statement. */
10896 {
10897 /* Looks like a labeled-statement with an ordinary label.
10898 Parse the label, and then use tail recursion to parse
10899 the statement. */
10904 }
10905 }
10906 /* Anything that starts with a `{' must be a compound-statement. */
10909 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10910 a statement all its own. */
10912 {
10913 /* Only certain OpenMP pragmas are attached to statements, and thus
10914 are considered statements themselves. All others are not. In
10915 the context of a compound, accept the pragma as a "statement" and
10916 return so that we can check for a close brace. Otherwise we
10917 require a real statement and must go back and read one. */
10923 }
10925 {
10928 }
10930 /* Everything else must be a declaration-statement or an
10931 expression-statement. Try for the declaration-statement
10932 first, unless we are looking at a `;', in which case we know that
10933 we have an expression-statement. */
10935 {
10937 {
10939 {
10940 /* Attributes should be parsed as part of the the
10941 declaration, so let's un-parse them. */
10944 }
10947 /* Try to parse the declaration-statement. */
10949 /* If that worked, we're done. */
10952 }
10953 /* All preceding labels have been parsed at this point. */
10957 /* Look for an expression-statement instead. */
10960 /* Handle [[fallthrough]];. */
10962 {
10963 /* The next token after the fallthrough attribute is ';'. */
10965 {
10966 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10968 IFN_FALLTHROUGH,
10971 }
10972 else
10976 }
10977 }
10979 /* Set the line number for the statement. */
10983 /* Allow "[[fallthrough]];", but warn otherwise. */
10986 OPT_Wattributes,
10988 }
10990 /* Append ATTR to attribute list ATTRS. */
10992 static tree
10994 {
11000 }
11002 /* Parse the label for a labeled-statement, i.e.
11004 identifier :
11005 case constant-expression :
11006 default :
11008 GNU Extension:
11009 case constant-expression ... constant-expression : statement
11011 When a label is parsed without errors, the label is added to the
11012 parse tree by the finish_* functions, so this function doesn't
11013 have to return the label. */
11015 static void
11017 {
11022 /* The next token should be an identifier. */
11026 {
11029 }
11031 /* Remember whether this case or a user-defined label is allowed to fall
11032 through to. */
11037 {
11039 {
11043 /* Consume the `case' token. */
11045 /* Parse the constant-expression. */
11052 {
11053 /* Consume the `...' token. */
11059 /* We don't need to emit warnings here, as the common code
11060 will do this for us. */
11061 }
11062 else
11066 {
11070 }
11071 else
11074 expr);
11075 }
11079 /* Consume the `default' token. */
11083 {
11087 }
11088 else
11093 /* Anything else must be an ordinary label. */
11098 }
11100 /* Require the `:' token. */
11103 /* An ordinary label may optionally be followed by attributes.
11104 However, this is only permitted if the attributes are then
11105 followed by a semicolon. This is because, for backward
11106 compatibility, when parsing
11107 lab: __attribute__ ((unused)) int i;
11108 we want the attribute to attach to "i", not "lab". */
11111 {
11112 tree attrs;
11119 ;
11120 else
11122 }
11128 }
11130 /* Parse an expression-statement.
11132 expression-statement:
11133 expression [opt] ;
11135 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11136 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11137 indicates whether this expression-statement is part of an
11138 expression statement. */
11140 static tree
11142 {
11147 /* There might be attribute fallthrough. */
11150 /* If the next token is a ';', then there is no expression
11151 statement. */
11153 {
11157 {
11160 }
11161 }
11163 /* Handle [[fallthrough]];. */
11165 {
11166 /* The next token after the fallthrough attribute is ';'. */
11168 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11171 else
11175 }
11177 /* Allow "[[fallthrough]];", but warn otherwise. */
11182 /* Give a helpful message for "A<T>::type t;" and the like. */
11185 {
11192 {
11193 /* A::A a; */
11198 }
11199 }
11201 /* Consume the final `;'. */
11206 /* This is the final expression statement of a statement
11207 expression. */
11213 }
11215 /* Parse a compound-statement.
11217 compound-statement:
11218 { statement-seq [opt] }
11220 GNU extension:
11222 compound-statement:
11223 { label-declaration-seq [opt] statement-seq [opt] }
11225 label-declaration-seq:
11226 label-declaration
11227 label-declaration-seq label-declaration
11229 Returns a tree representing the statement. */
11231 static tree
11234 {
11235 tree compound_stmt;
11236 matching_braces braces;
11238 /* Consume the `{'. */
11245 /* Begin the compound-statement. */
11247 /* If the next keyword is `__label__' we have a label declaration. */
11250 /* Parse an (optional) statement-seq. */
11252 /* Finish the compound-statement. */
11254 /* Consume the `}'. */
11258 }
11260 /* Parse an (optional) statement-seq.
11262 statement-seq:
11263 statement
11264 statement-seq [opt] statement */
11266 static void
11268 {
11269 /* Scan statements until there aren't any more. */
11271 {
11274 /* If we are looking at a `}', then we have run out of
11275 statements; the same is true if we have reached the end
11276 of file, or have stumbled upon a stray '@end'. */
11283 /* If we are in a compound statement and find 'else' then
11284 something went wrong. */
11286 {
11289 else
11290 {
11293 }
11294 }
11296 /* Parse the statement. */
11298 }
11299 }
11301 /* Return true if this is the C++20 version of range-based-for with
11302 init-statement. */
11304 static bool
11306 {
11309 /* Save tokens so that we can put them back. */
11312 /* There has to be an unnested ; followed by an unnested :. */
11315 CPP_SEMICOLON,
11319 /* We found the semicolon, eat it now. */
11322 /* Now look for ':' that is not nested in () or {}. */
11325 CPP_COLON,
11328 out:
11329 /* Roll back the tokens we skipped. */
11333 }
11335 /* Return true if we're looking at (init; cond), false otherwise. */
11337 static bool
11339 {
11340 /* Save tokens so that we can put them back. */
11343 /* Look for ';' that is not nested in () or {}. */
11346 CPP_SEMICOLON,
11349 /* Roll back the tokens we skipped. */
11353 }
11355 /* Parse a selection-statement.
11357 selection-statement:
11358 if ( init-statement [opt] condition ) statement
11359 if ( init-statement [opt] condition ) statement else statement
11360 switch ( init-statement [opt] condition ) statement
11362 Returns the new IF_STMT or SWITCH_STMT.
11364 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11365 is a (possibly labeled) if statement which is not enclosed in
11366 braces and has an else clause. This is used to implement
11367 -Wparentheses.
11369 CHAIN is a vector of if-else-if conditions. This is used to implement
11370 -Wduplicated-cond. */
11372 static tree
11375 {
11378 token_indent_info guard_tinfo;
11383 /* Peek at the next token. */
11387 /* See what kind of keyword it is. */
11390 {
11393 {
11394 tree statement;
11395 tree condition;
11400 RID_CONSTEXPR))
11401 {
11407 }
11409 /* Look for the `('. */
11410 matching_parens parens;
11412 {
11415 }
11417 /* Begin the selection-statement. */
11419 {
11422 }
11423 else
11426 /* Parse the optional init-statement. */
11428 {
11429 tree decl;
11432 "init-statement in selection statements only available "
11435 }
11437 /* Parse the condition. */
11439 /* Look for the `)'. */
11445 {
11449 /* Add the condition. */
11456 /* Parse the then-clause. */
11460 /* Outside a template, the non-selected branch of a constexpr
11461 if is a 'discarded statement', i.e. unevaluated. */
11466 {
11469 }
11472 guard_tinfo);
11479 {
11483 }
11485 /* If the next token is `else', parse the else-clause. */
11487 RID_ELSE))
11488 {
11492 {
11495 }
11497 guard_tinfo
11499 /* Consume the `else' keyword. */
11502 {
11504 RID_IF)
11506 {
11507 /* We've got "if (COND) else if (COND2)". Start
11508 the condition chain and add COND as the first
11509 element. */
11513 {
11514 /* Wrap it in a NOP_EXPR so that we can set the
11515 location of the condition. */
11517 condition);
11520 }
11521 }
11523 RID_IF))
11524 {
11525 /* This is if-else without subsequent if. Zap the
11526 condition chain; we would have already warned at
11527 this point. */
11530 }
11531 }
11533 /* Parse the else-clause. */
11539 /* If we are currently parsing a then-clause, then
11540 IF_P will not be NULL. We set it to true to
11541 indicate that this if statement has an else clause.
11542 This may trigger the Wparentheses warning below
11543 when we get back up to the parent if statement. */
11548 {
11552 }
11553 }
11554 else
11555 {
11556 /* This if statement does not have an else clause. If
11557 NESTED_IF is true, then the then-clause has an if
11558 statement which does have an else clause. We warn
11559 about the potential ambiguity. */
11562 "suggest explicit braces to avoid ambiguous"
11565 {
11566 /* We don't need the condition chain anymore. */
11569 }
11570 }
11572 /* Now we're all done with the if-statement. */
11574 }
11575 else
11576 {
11580 /* Add the condition. */
11583 /* Parse the body of the switch-statement. */
11589 guard_tinfo);
11593 /* Now we're all done with the switch-statement. */
11595 }
11598 }
11604 }
11605 }
11607 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11608 If we have seen at least one decl-specifier, and the next token
11609 is not a parenthesis, then we must be looking at a declaration.
11610 (After "int (" we might be looking at a functional cast.) */
11612 static void
11615 {
11621 }
11623 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11624 The declarator shall not specify a function or an array. Returns
11625 TRUE if the declarator is valid, FALSE otherwise. */
11627 static bool
11630 location_t loc)
11631 {
11635 {
11640 else
11648 }
11649 else
11651 }
11653 /* Parse a condition.
11655 condition:
11656 expression
11657 type-specifier-seq declarator = initializer-clause
11658 type-specifier-seq declarator braced-init-list
11660 GNU Extension:
11662 condition:
11663 type-specifier-seq declarator asm-specification [opt]
11664 attributes [opt] = assignment-expression
11666 Returns the expression that should be tested. */
11668 static tree
11670 {
11671 cp_decl_specifier_seq type_specifiers;
11675 /* Try the declaration first. */
11677 /* New types are not allowed in the type-specifier-seq for a
11678 condition. */
11680 parser->type_definition_forbidden_message
11682 /* Parse the type-specifier-seq. */
11684 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11687 /* Restore the saved message. */
11693 /* If all is well, we might be looking at a declaration. */
11695 {
11696 tree decl;
11697 tree asm_specification;
11698 tree attributes;
11703 /* Parse the declarator. */
11709 /* Parse the attributes. */
11711 /* Parse the asm-specification. */
11713 /* If the next token is not an `=' or '{', then we might still be
11714 looking at an expression. For example:
11716 if (A(a).x)
11718 looks like a decl-specifier-seq and a declarator -- but then
11719 there is no `=', so this is an expression. */
11724 /* If we did see an `=' or '{', then we are looking at a declaration
11725 for sure. */
11727 {
11728 tree pushed_scope;
11735 /* Create the declaration. */
11741 /* Parse the initializer. */
11743 {
11747 }
11749 {
11750 /* Consume the `='. */
11754 }
11755 else
11756 {
11759 }
11763 /* Process the initializer. */
11766 asm_specification,
11767 flags);
11773 }
11774 }
11775 /* If we didn't even get past the declarator successfully, we are
11776 definitely not looking at a declaration. */
11777 else
11780 /* Otherwise, we are looking at an expression. */
11782 }
11784 /* Parses a for-statement or range-for-statement until the closing ')',
11785 not included. */
11787 static tree
11789 {
11793 /* Begin the for-statement. */
11796 /* Parse the initialization. */
11801 else
11803 }
11805 static tree
11808 {
11809 /* Normal for loop */
11812 tree stmt;
11815 /* The init-statement has already been parsed in
11816 cp_parser_init_statement, so no work is needed here. */
11819 /* If there's a condition, process it. */
11823 {
11827 }
11829 {
11833 }
11835 /* Look for the `;'. */
11838 /* If there's an expression, process it. */
11844 }
11846 /* Tries to parse a range-based for-statement:
11848 range-based-for:
11849 decl-specifier-seq declarator : expression
11851 The decl-specifier-seq declarator and the `:' are already parsed by
11852 cp_parser_init_statement. If processing_template_decl it returns a
11853 newly created RANGE_FOR_STMT; if not, it is converted to a
11854 regular FOR_STMT. */
11856 static tree
11859 {
11866 /* Get the range declaration momentarily out of the way so that
11867 the range expression doesn't clash with it. */
11869 {
11871 {
11873 /* For decomposition declaration get all of the corresponding
11874 declarations out of the way. */
11878 {
11884 {
11890 }
11891 }
11892 }
11894 {
11899 }
11900 }
11903 {
11906 }
11907 else
11910 /* Put the range declaration(s) back into scope. */
11912 {
11916 }
11918 /* If in template, STMT is converted to a normal for-statement
11919 at instantiation. If not, it is done just ahead. */
11921 {
11931 /* do_auto_deduction doesn't mess with template init-lists. */
11934 }
11935 else
11936 {
11940 unroll);
11941 }
11943 }
11945 /* Subroutine of cp_convert_range_for: given the initializer expression,
11946 builds up the range temporary. */
11948 static tree
11950 {
11953 /* Find out the type deduced by the declaration
11954 `auto &&__range = range_expr'. */
11959 /* Create the __range variable. */
11961 range_type);
11966 }
11968 /* Used by cp_parser_range_for in template context: we aren't going to
11969 do a full conversion yet, but we still need to resolve auto in the
11970 type of the for-range-declaration if present. This is basically
11971 a shortcut version of cp_convert_range_for. */
11973 static void
11975 {
11978 {
11981 iter_type = (cp_parser_perform_range_for_lookup
11984 {
11986 iter_type);
11988 RO_UNARY_STAR,
11989 tf_warning_or_error);
11992 }
11993 }
11994 }
11996 /* Converts a range-based for-statement into a normal
11997 for-statement, as per the definition.
11999 for (RANGE_DECL : RANGE_EXPR)
12000 BLOCK
12002 should be equivalent to:
12004 {
12005 auto &&__range = RANGE_EXPR;
12006 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12007 __begin != __end;
12008 ++__begin)
12009 {
12010 RANGE_DECL = *__begin;
12011 BLOCK
12012 }
12013 }
12015 If RANGE_EXPR is an array:
12016 BEGIN_EXPR = __range
12017 END_EXPR = __range + ARRAY_SIZE(__range)
12018 Else if RANGE_EXPR has a member 'begin' or 'end':
12019 BEGIN_EXPR = __range.begin()
12020 END_EXPR = __range.end()
12021 Else:
12022 BEGIN_EXPR = begin(__range)
12023 END_EXPR = end(__range);
12025 If __range has a member 'begin' but not 'end', or vice versa, we must
12026 still use the second alternative (it will surely fail, however).
12027 When calling begin()/end() in the third alternative we must use
12028 argument dependent lookup, but always considering 'std' as an associated
12029 namespace. */
12031 tree
12035 {
12043 /* If an error happened previously do nothing or else a lot of
12044 unhelpful errors would be issued. */
12046 else
12047 {
12048 tree range_temp;
12052 /* Can't bind a reference to an array of runtime bound. */
12054 else
12055 {
12060 LOOKUP_ONLYCONVERTING);
12062 }
12065 }
12067 /* The new for initialization statement. */
12069 iter_type);
12075 LOOKUP_ONLYCONVERTING);
12085 LOOKUP_ONLYCONVERTING);
12089 /* The new for condition. */
12096 /* The new increment expression. */
12099 tf_warning_or_error);
12105 /* The declaration is initialized with *__begin inside the loop body. */
12108 tf_warning_or_error),
12110 LOOKUP_ONLYCONVERTING);
12115 }
12117 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12118 We need to solve both at the same time because the method used
12119 depends on the existence of members begin or end.
12120 Returns the type deduced for the iterator expression. */
12122 static tree
12124 {
12126 {
12129 }
12132 {
12137 }
12139 {
12140 /* If RANGE is an array, we will use pointer arithmetic. */
12143 range,
12147 }
12148 else
12149 {
12150 /* If it is not an array, we must do a bit of magic. */
12160 tf_warning_or_error);
12163 tf_warning_or_error);
12166 {
12167 /* Use the member functions. */
12170 }
12171 else
12172 {
12173 /* Use global functions with ADL. */
12180 tf_warning_or_error);
12182 tf_warning_or_error);
12184 tf_warning_or_error);
12186 tf_warning_or_error);
12189 }
12191 /* Last common checks. */
12193 {
12194 /* If one of the expressions is an error do no more checks. */
12197 }
12200 /* Can happen, when, eg, in a template context, Koenig lookup
12201 can't resolve begin/end (c++/58503). */
12203 else
12204 {
12206 /* The unqualified type of the __begin and __end temporaries should
12207 be the same, as required by the multiple auto declaration. */
12209 {
12216 /* P0184R0 allows __begin and __end to have different types,
12217 but make sure they are comparable so we can give a better
12219 else
12223 }
12225 }
12226 }
12227 }
12229 /* Helper function for cp_parser_perform_range_for_lookup.
12230 Builds a tree for RANGE.IDENTIFIER(). */
12232 static tree
12234 {
12247 tf_warning_or_error);
12250 }
12252 /* Parse an iteration-statement.
12254 iteration-statement:
12255 while ( condition ) statement
12256 do statement while ( expression ) ;
12257 for ( init-statement condition [opt] ; expression [opt] )
12258 statement
12260 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12262 static tree
12265 {
12268 tree statement;
12270 token_indent_info guard_tinfo;
12272 /* Peek at the next token. */
12279 /* Remember whether or not we are already within an iteration
12280 statement. */
12283 /* See what kind of keyword it is. */
12286 {
12288 {
12289 tree condition;
12291 /* Begin the while-statement. */
12293 /* Look for the `('. */
12294 matching_parens parens;
12296 /* Parse the condition. */
12299 /* Look for the `)'. */
12301 /* Parse the dependent statement. */
12307 /* We're done with the while-statement. */
12309 }
12313 {
12314 tree expression;
12316 /* Begin the do-statement. */
12318 /* Parse the body of the do-statement. */
12325 /* Look for the `while' keyword. */
12327 /* Look for the `('. */
12328 matching_parens parens;
12330 /* Parse the expression. */
12332 /* We're done with the do-statement. */
12334 /* Look for the `)'. */
12336 /* Look for the `;'. */
12338 }
12342 {
12343 /* Look for the `('. */
12344 matching_parens parens;
12349 /* Look for the `)'. */
12352 /* Parse the body of the for-statement. */
12359 /* We're done with the for-statement. */
12361 }
12368 }
12371 }
12373 /* Parse a init-statement or the declarator of a range-based-for.
12374 Returns true if a range-based-for declaration is seen.
12376 init-statement:
12377 expression-statement
12378 simple-declaration */
12380 static bool
12382 {
12383 /* If the next token is a `;', then we have an empty
12384 expression-statement. Grammatically, this is also a
12385 simple-declaration, but an invalid one, because it does not
12386 declare anything. Therefore, if we did not handle this case
12387 specially, we would issue an error message about an invalid
12388 declaration. */
12390 {
12394 /* Try to parse the init-statement. */
12396 {
12397 tree dummy;
12399 /* Parse the declaration. */
12405 /* That didn't work, try to parse it as an expression-statement. */
12409 {
12411 "range-based %<for%> loops with initializer only "
12414 }
12415 }
12417 /* A colon is used in range-based for. */
12420 /* We're going to speculatively look for a declaration, falling back
12421 to an expression, if necessary. */
12423 /* Parse the declaration. */
12426 decl);
12429 {
12430 /* It is a range-for, consume the ':'. */
12435 "range-based %<for%> loops only available with "
12437 }
12438 else
12439 /* The ';' is not consumed yet because we told
12440 cp_parser_simple_declaration not to. */
12445 /* If the tentative parse failed, then we shall need to look for an
12446 expression-statement. */
12447 }
12448 /* If we are here, it is an expression-statement. */
12451 }
12453 /* Parse a jump-statement.
12455 jump-statement:
12456 break ;
12457 continue ;
12458 return expression [opt] ;
12459 return braced-init-list ;
12460 goto identifier ;
12462 GNU extension:
12464 jump-statement:
12465 goto * expression ;
12467 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12469 static tree
12471 {
12477 /* Peek at the next token. */
12482 /* See what kind of keyword it is. */
12485 {
12489 {
12506 }
12512 {
12516 /* Fall through. */
12526 }
12531 {
12532 tree expr;
12536 {
12540 }
12543 else
12544 /* If the next token is a `;', then there is no
12545 expression. */
12547 /* Build the return-statement. */
12550 else
12552 /* Look for the final `;'. */
12554 }
12560 {
12563 }
12565 /* Create the goto-statement. */
12567 {
12568 /* Issue a warning about this use of a GNU extension. */
12570 /* Consume the '*' token. */
12572 /* Parse the dependent expression. */
12574 }
12575 else
12577 /* Look for the final `;'. */
12584 }
12587 }
12589 /* Parse a declaration-statement.
12591 declaration-statement:
12592 block-declaration */
12594 static void
12596 {
12599 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12602 /* Parse the block-declaration. */
12605 /* Free any declarators allocated. */
12607 }
12609 /* Some dependent statements (like `if (cond) statement'), are
12610 implicitly in their own scope. In other words, if the statement is
12611 a single statement (as opposed to a compound-statement), it is
12612 none-the-less treated as if it were enclosed in braces. Any
12613 declarations appearing in the dependent statement are out of scope
12614 after control passes that point. This function parses a statement,
12615 but ensures that is in its own scope, even if it is not a
12616 compound-statement.
12618 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12619 is a (possibly labeled) if statement which is not enclosed in
12620 braces and has an else clause. This is used to implement
12621 -Wparentheses.
12623 CHAIN is a vector of if-else-if conditions. This is used to implement
12624 -Wduplicated-cond.
12626 Returns the new statement. */
12628 static tree
12632 {
12633 tree statement;
12636 token_indent_info body_tinfo
12642 /* Mark if () ; with a special NOP_EXPR. */
12644 {
12655 }
12656 /* if a compound is opened, we simply parse the statement directly. */
12659 /* If the token is not a `{', then we must take special action. */
12660 else
12661 {
12662 /* Create a compound-statement. */
12664 /* Parse the dependent-statement. */
12667 /* Finish the dummy compound-statement. */
12669 }
12671 token_indent_info next_tinfo
12680 /* Return the statement. */
12682 }
12684 /* For some dependent statements (like `while (cond) statement'), we
12685 have already created a scope. Therefore, even if the dependent
12686 statement is a compound-statement, we do not want to create another
12687 scope. */
12689 static void
12692 {
12693 /* If the token is a `{', then we must take special action. */
12695 {
12696 token_indent_info body_tinfo
12702 token_indent_info next_tinfo
12711 }
12712 else
12713 {
12714 /* Avoid calling cp_parser_compound_statement, so that we
12715 don't create a new scope. Do everything else by hand. */
12716 matching_braces braces;
12718 /* If the next keyword is `__label__' we have a label declaration. */
12721 /* Parse an (optional) statement-seq. */
12724 }
12725 }
12727 /* Declarations [gram.dcl.dcl] */
12729 /* Parse an optional declaration-sequence.
12731 declaration-seq:
12732 declaration
12733 declaration-seq declaration */
12735 static void
12737 {
12739 {
12750 {
12751 /* A declaration consisting of a single semicolon is
12752 invalid. Allow it unless we're being pedantic. */
12757 }
12759 /* If we're entering or exiting a region that's implicitly
12760 extern "C", modify the lang context appropriately. */
12762 {
12765 }
12767 {
12770 }
12773 {
12774 /* A top-level declaration can consist solely of a #pragma.
12775 A nested declaration cannot, so this is done here and not
12776 in cp_parser_declaration. (A #pragma at block scope is
12777 handled in cp_parser_statement.) */
12780 }
12782 /* Parse the declaration itself. */
12784 }
12785 }
12787 /* Parse a declaration.
12789 declaration:
12790 block-declaration
12791 function-definition
12792 template-declaration
12793 explicit-instantiation
12794 explicit-specialization
12795 linkage-specification
12796 namespace-definition
12798 C++17:
12799 deduction-guide
12801 GNU extension:
12803 declaration:
12804 __extension__ declaration */
12806 static void
12808 {
12809 cp_token token1;
12810 cp_token token2;
12815 /* Check for the `__extension__' keyword. */
12817 {
12818 /* Parse the qualified declaration. */
12820 /* Restore the PEDANTIC flag. */
12824 }
12826 /* Try to figure out what kind of declaration is present. */
12831 else
12832 {
12835 }
12837 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12840 /* If the next token is `extern' and the following token is a string
12841 literal, then we have a linkage specification. */
12845 /* If the next token is `template', then we have either a template
12846 declaration, an explicit instantiation, or an explicit
12847 specialization. */
12849 {
12850 /* `template <>' indicates a template specialization. */
12854 /* `template <' indicates a template declaration. */
12857 /* Anything else must be an explicit instantiation. */
12858 else
12860 }
12861 /* If the next token is `export', then we have a template
12862 declaration. */
12865 /* If the next token is `extern', 'static' or 'inline' and the one
12866 after that is `template', we have a GNU extended explicit
12867 instantiation directive. */
12874 /* If the next token is `namespace', check for a named or unnamed
12875 namespace definition. */
12884 /* An unnamed namespace definition. */
12888 /* An inline (associated) namespace definition. */
12892 /* Objective-C++ declaration/definition. */
12899 /* At this point we may have a template declared by a concept
12900 introduction. */
12905 else
12906 /* Try to parse a block-declaration, or a function-definition. */
12909 /* Free any declarators allocated. */
12911 }
12913 /* Parse a block-declaration.
12915 block-declaration:
12916 simple-declaration
12917 asm-definition
12918 namespace-alias-definition
12919 using-declaration
12920 using-directive
12922 GNU Extension:
12924 block-declaration:
12925 __extension__ block-declaration
12927 C++0x Extension:
12929 block-declaration:
12930 static_assert-declaration
12932 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12933 part of a declaration-statement. */
12935 static void
12938 {
12942 /* Check for the `__extension__' keyword. */
12944 {
12945 /* Parse the qualified declaration. */
12947 /* Restore the PEDANTIC flag. */
12951 }
12953 /* Peek at the next token to figure out which kind of declaration is
12954 present. */
12957 /* If the next keyword is `asm', we have an asm-definition. */
12959 {
12963 }
12964 /* If the next keyword is `namespace', we have a
12965 namespace-alias-definition. */
12968 /* If the next keyword is `using', we have a
12969 using-declaration, a using-directive, or an alias-declaration. */
12971 {
12976 /* If the token after `using' is `namespace', then we have a
12977 using-directive. */
12981 /* If the second token after 'using' is '=', then we have an
12982 alias-declaration. */
12988 /* Otherwise, it's a using-declaration. */
12989 else
12992 }
12993 /* If the next keyword is `__label__' we have a misplaced label
12994 declaration. */
12996 {
13000 /* If the next token is now a `;', consume it. */
13003 }
13004 /* If the next token is `static_assert' we have a static assertion. */
13007 /* Anything else must be a simple-declaration. */
13008 else
13011 }
13013 /* Parse a simple-declaration.
13015 simple-declaration:
13016 decl-specifier-seq [opt] init-declarator-list [opt] ;
13017 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13018 brace-or-equal-initializer ;
13020 init-declarator-list:
13021 init-declarator
13022 init-declarator-list , init-declarator
13024 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13025 function-definition as a simple-declaration.
13027 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13028 parsed declaration if it is an uninitialized single declarator not followed
13029 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13030 if present, will not be consumed. */
13032 static void
13036 {
13037 cp_decl_specifier_seq decl_specifiers;
13046 /* Defer access checks until we know what is being declared; the
13047 checks for names appearing in the decl-specifier-seq should be
13048 done as if we were in the scope of the thing being declared. */
13051 /* Parse the decl-specifier-seq. We have to keep track of whether
13052 or not the decl-specifier-seq declares a named class or
13053 enumeration type, since that is the only case in which the
13054 init-declarator-list is allowed to be empty.
13056 [dcl.dcl]
13058 In a simple-declaration, the optional init-declarator-list can be
13059 omitted only when declaring a class or enumeration, that is when
13060 the decl-specifier-seq contains either a class-specifier, an
13061 elaborated-type-specifier, or an enum-specifier. */
13063 CP_PARSER_FLAGS_OPTIONAL,
13066 /* We no longer need to defer access checks. */
13069 /* In a block scope, a valid declaration must always have a
13070 decl-specifier-seq. By not trying to parse declarators, we can
13071 resolve the declaration/expression ambiguity more quickly. */
13074 {
13077 }
13079 /* If the next two tokens are both identifiers, the code is
13080 erroneous. The usual cause of this situation is code like:
13082 T t;
13084 where "T" should name a type -- but does not. */
13087 {
13088 /* If parsing tentatively, we should commit; we really are
13089 looking at a declaration. */
13091 /* Give up. */
13093 }
13098 /* Look for C++17 decomposition declaration. */
13106 {
13107 tree decl
13109 maybe_range_for_decl,
13112 /* The next token should be either a `,' or a `;'. */
13114 /* If it's a `;', we are done. */
13118 {
13122 }
13123 /* Anything else is an error. */
13124 else
13125 {
13126 /* If we have already issued an error message we don't need
13127 to issue another one. */
13132 /* Skip tokens until we reach the end of the statement. */
13134 /* If the next token is now a `;', consume it. */
13138 }
13139 }
13140 else
13143 tree last_type;
13145 /* NULL_TREE if both variable and function declaration are allowed,
13146 error_mark_node if function declaration are not allowed and
13147 a FUNCTION_DECL that should be diagnosed if it is followed by
13148 variable declarations. */
13149 tree auto_function_declaration;
13152 auto_specifier_p
13156 /* Keep going until we hit the `;' at the end of the simple
13157 declaration. */
13160 CPP_SEMICOLON))
13161 {
13164 tree decl;
13168 {
13169 /* If we are processing next declarator, comma is expected */
13174 {
13178 }
13179 }
13180 else
13183 /* Parse the init-declarator. */
13186 function_definition_allowed_p,
13188 declares_class_or_enum,
13190 maybe_range_for_decl,
13193 /* If an error occurred while parsing tentatively, exit quickly.
13194 (That usually happens when in the body of a function; each
13195 statement is treated as a declaration-statement until proven
13196 otherwise.) */
13201 {
13202 /* If the init-declarator-list contains more than one
13203 init-declarator, they shall all form declarations of
13204 variables. */
13206 auto_function_declaration
13210 {
13212 "non-variable %qD in declaration with more than one "
13217 }
13218 }
13222 {
13226 {
13227 /* If the list of declarators contains more than one declarator,
13228 the type of each declared variable is determined as described
13229 above. If the type deduced for the template parameter U is not
13230 the same in each deduction, the program is ill-formed. */
13235 }
13236 else
13238 }
13240 /* Handle function definitions specially. */
13242 {
13243 /* If the next token is a `,', then we are probably
13244 processing something like:
13246 void f() {}, *p;
13248 which is erroneous. */
13250 {
13253 "mixing"
13255 }
13256 /* Otherwise, we're done with the list of declarators. */
13257 else
13258 {
13261 }
13262 }
13265 /* The next token should be either a `,' or a `;'. */
13267 /* If it's a `,', there are more declarators to come. */
13270 /* If it's a `;', we are done. */
13274 {
13279 }
13280 /* Anything else is an error. */
13281 else
13282 {
13283 /* If we have already issued an error message we don't need
13284 to issue another one. */
13289 /* Skip tokens until we reach the end of the statement. */
13291 /* If the next token is now a `;', consume it. */
13295 }
13296 /* After the first time around, a function-definition is not
13297 allowed -- even if it was OK at first. For example:
13299 int i, f() {}
13301 is not valid. */
13303 }
13305 /* Issue an error message if no declarators are present, and the
13306 decl-specifier-seq does not itself declare a class or
13307 enumeration: [dcl.dcl]/3. */
13309 {
13311 {
13315 /* Ensure an error is issued anyway when finish_decltype_type,
13316 called via cp_parser_decl_specifier_seq, returns a class or
13317 an enumeration (c++/51786). */
13320 }
13321 /* Perform any deferred access checks. */
13323 }
13325 /* Consume the `;'. */
13326 finish:
13330 {
13336 }
13338 done:
13340 }
13342 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13343 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13344 initializer ; */
13346 static tree
13351 {
13356 /* Parse the identifier-list. */
13360 {
13368 }
13372 {
13378 else
13379 {
13382 }
13383 }
13389 tree pushed_scope;
13396 NULL_TREE);
13403 cp_expr e;
13404 cp_decl_specifier_seq decl_specs;
13409 {
13412 else
13415 tree elt_pushed_scope;
13421 {
13422 /* Ensure we've diagnosed redeclaration if we aren't creating
13423 a new VAR_DECL. */
13426 }
13427 else
13431 }
13434 {
13437 }
13441 {
13449 || (is_direct_init
13452 {
13456 }
13459 {
13464 }
13465 }
13467 {
13469 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13470 the underlying DECL. */
13472 }
13478 {
13481 }
13484 }
13486 /* Parse a decl-specifier-seq.
13488 decl-specifier-seq:
13489 decl-specifier-seq [opt] decl-specifier
13490 decl-specifier attribute-specifier-seq [opt] (C++11)
13492 decl-specifier:
13493 storage-class-specifier
13494 type-specifier
13495 function-specifier
13496 friend
13497 typedef
13499 GNU Extension:
13501 decl-specifier:
13502 attributes
13504 Concepts Extension:
13506 decl-specifier:
13507 concept
13509 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13511 The parser flags FLAGS is used to control type-specifier parsing.
13513 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13514 flags:
13516 1: one of the decl-specifiers is an elaborated-type-specifier
13517 (i.e., a type declaration)
13518 2: one of the decl-specifiers is an enum-specifier or a
13519 class-specifier (i.e., a type definition)
13521 */
13523 static void
13525 cp_parser_flags flags,
13528 {
13532 cp_decl_spec ds;
13534 /* Clear DECL_SPECS. */
13537 /* Assume no class or enumeration type is declared. */
13540 /* Keep reading specifiers until there are no more to read. */
13542 {
13547 /* Peek at the next token. */
13550 /* Save the first token of the decl spec list for error
13551 reporting. */
13554 /* Handle attributes. */
13556 {
13557 /* Parse the attributes. */
13560 /* In a sequence of declaration specifiers, c++11 attributes
13561 appertain to the type that precede them. In that case
13562 [dcl.spec]/1 says:
13564 The attribute-specifier-seq affects the type only for
13565 the declaration it appears in, not other declarations
13566 involving the same type.
13568 But for now let's force the user to position the
13569 attribute either at the beginning of the declaration or
13570 after the declarator-id, which would clearly mean that it
13571 applies to the declarator. */
13573 {
13575 /* The c++11 attribute is at the beginning of the
13576 declaration. It appertains to the entity being
13578 else
13579 {
13581 {
13582 /* This is an attribute following a
13583 class-specifier. */
13588 }
13589 else
13590 {
13591 decl_specs->std_attributes
13595 }
13597 }
13598 }
13600 decl_specs->attributes
13605 }
13606 /* Assume we will find a decl-specifier keyword. */
13608 /* If the next token is an appropriate keyword, we can simply
13609 add it to the list. */
13611 {
13612 /* decl-specifier:
13613 friend
13614 constexpr */
13617 {
13622 }
13623 else
13624 {
13626 /* Consume the token. */
13628 }
13641 /* function-specifier:
13642 inline
13643 virtual
13644 explicit */
13651 /* decl-specifier:
13652 typedef */
13655 /* Consume the token. */
13657 /* A constructor declarator cannot appear in a typedef. */
13659 /* The "typedef" keyword can only occur in a declaration; we
13660 may as well commit at this point. */
13667 /* storage-class-specifier:
13668 auto
13669 register
13670 static
13671 extern
13672 mutable
13674 GNU Extension:
13675 thread */
13678 {
13679 /* Consume the token. */
13682 /* Complain about `auto' as a storage specifier, if
13683 we're complaining about C++0x compatibility. */
13687 "%<auto%> changes meaning in C++11; "
13690 /* Set the storage class anyway. */
13692 token);
13693 }
13694 else
13695 /* C++0x auto type-specifier. */
13703 /* Consume the token. */
13706 token);
13709 /* Consume the token. */
13715 /* We did not yet find a decl-specifier yet. */
13718 }
13735 /* Constructors are a special case. The `S' in `S()' is not a
13736 decl-specifier; it is the beginning of the declarator. */
13737 constructor_p
13738 = (!found_decl_spec
13739 && constructor_possible_p
13740 && (cp_parser_constructor_declarator_p
13743 /* If we don't have a DECL_SPEC yet, then we must be looking at
13744 a type-specifier. */
13746 {
13749 tree type_spec;
13751 type_spec
13753 decl_specs,
13759 /* If this type-specifier referenced a user-defined type
13760 (a typedef, class-name, etc.), then we can't allow any
13761 more such type-specifiers henceforth.
13763 [dcl.spec]
13765 The longest sequence of decl-specifiers that could
13766 possibly be a type name is taken as the
13767 decl-specifier-seq of a declaration. The sequence shall
13768 be self-consistent as described below.
13770 [dcl.type]
13772 As a general rule, at most one type-specifier is allowed
13773 in the complete decl-specifier-seq of a declaration. The
13774 only exceptions are the following:
13776 -- const or volatile can be combined with any other
13777 type-specifier.
13779 -- signed or unsigned can be combined with char, long,
13780 short, or int.
13782 -- ..
13784 Example:
13786 typedef char* Pc;
13787 void g (const int Pc);
13789 Here, Pc is *not* part of the decl-specifier seq; it's
13790 the declarator. Therefore, once we see a type-specifier
13791 (other than a cv-qualifier), we forbid any additional
13792 user-defined types. We *do* still allow things like `int
13793 int' to be considered a decl-specifier-seq, and issue the
13794 error message later. */
13797 /* A constructor declarator cannot follow a type-specifier. */
13799 {
13807 }
13808 }
13810 /* If we still do not have a DECL_SPEC, then there are no more
13811 decl-specifiers. */
13816 /* After we see one decl-specifier, further decl-specifiers are
13817 always optional. */
13819 }
13821 /* Don't allow a friend specifier with a class definition. */
13826 }
13828 /* Parse an (optional) storage-class-specifier.
13830 storage-class-specifier:
13831 auto
13832 register
13833 static
13834 extern
13835 mutable
13837 GNU Extension:
13839 storage-class-specifier:
13840 thread
13842 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13844 static tree
13846 {
13848 {
13852 /* Fall through for C++98. */
13860 /* Consume the token. */
13865 }
13866 }
13868 /* Parse an (optional) function-specifier.
13870 function-specifier:
13871 inline
13872 virtual
13873 explicit
13875 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13876 Updates DECL_SPECS, if it is non-NULL. */
13878 static tree
13881 {
13884 {
13890 /* 14.5.2.3 [temp.mem]
13892 A member function template shall not be virtual. */
13896 else
13906 }
13908 /* Consume the token. */
13910 }
13912 /* Parse a linkage-specification.
13914 linkage-specification:
13915 extern string-literal { declaration-seq [opt] }
13916 extern string-literal declaration */
13918 static void
13920 {
13921 tree linkage;
13923 /* Look for the `extern' keyword. */
13924 cp_token *extern_token
13927 /* Look for the string-literal. */
13931 /* Transform the literal into an identifier. If the literal is a
13932 wide-character string, or contains embedded NULs, then we can't
13933 handle it as the user wants. */
13936 {
13938 /* Assume C++ linkage. */
13940 }
13941 else
13944 /* We're now using the new linkage. */
13947 /* Preserve the location of the the innermost linkage specification,
13948 tracking the locations of nested specifications via a local. */
13949 location_t saved_location
13951 /* Construct a location ranging from the start of the "extern" to
13952 the end of the string-literal, with the caret at the start, e.g.:
13953 extern "C" {
13954 ^~~~~~~~~~
13955 */
13956 parser->innermost_linkage_specification_location
13961 /* If the next token is a `{', then we're using the first
13962 production. */
13964 {
13968 /* Consume the `{' token. */
13969 matching_braces braces;
13971 /* Parse the declarations. */
13973 /* Look for the closing `}'. */
13975 }
13976 /* Otherwise, there's just one declaration. */
13977 else
13978 {
13981 saved_in_unbraced_linkage_specification_p
13985 parser->in_unbraced_linkage_specification_p
13987 }
13989 /* We're done with the linkage-specification. */
13992 /* Restore location of parent linkage specification, if any. */
13994 }
13996 /* Parse a static_assert-declaration.
13998 static_assert-declaration:
13999 static_assert ( constant-expression , string-literal ) ;
14000 static_assert ( constant-expression ) ; (C++17)
14002 If MEMBER_P, this static_assert is a class member. */
14004 static void
14006 {
14007 cp_expr condition;
14008 location_t token_loc;
14009 tree message;
14012 /* Peek at the `static_assert' token so we can keep track of exactly
14013 where the static assertion started. */
14016 /* Look for the `static_assert' keyword. */
14018 RT_STATIC_ASSERT))
14021 /* We know we are in a static assertion; commit to any tentative
14022 parse. */
14026 /* Parse the `(' starting the static assertion condition. */
14027 matching_parens parens;
14030 /* Parse the constant-expression. Allow a non-constant expression
14031 here in order to give better diagnostics in finish_static_assert. */
14032 condition =
14038 {
14041 "static_assert without a message "
14043 /* Eat the ')' */
14048 }
14049 else
14050 {
14051 /* Parse the separating `,'. */
14054 /* Parse the string-literal message. */
14059 /* A `)' completes the static assertion. */
14065 }
14067 /* A semicolon terminates the declaration. */
14070 /* Get the location for the static assertion. Use that of the
14071 condition if available, otherwise, use that of the "static_assert"
14072 token. */
14077 /* Complete the static assertion, which may mean either processing
14078 the static assert now or saving it for template instantiation. */
14080 }
14082 /* Parse the expression in decltype ( expression ). */
14084 static tree
14087 {
14089 tree expr;
14091 /* Since we're going to preserve any side-effects from this parse, set up a
14092 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14093 in the expression. */
14096 /* First, try parsing an id-expression. */
14107 {
14110 cp_id_kind idk;
14114 /* Lookup the name we got back from the id-expression. */
14119 /* A template without args is not a complete id-expression. */
14128 {
14129 /* Complete lookup of the id-expression. */
14130 expr = (finish_id_expression
14143 /* We found an id-expression, but it was something that we
14144 should not have found. This is an error, not something
14145 we can recover from, so note that we found an
14146 id-expression and we'll recover as gracefully as
14147 possible. */
14149 }
14154 /* We have an id-expression. */
14156 }
14159 {
14160 /* Abort the id-expression parse. */
14163 /* Parsing tentatively, again. */
14166 /* Parse a class member access. */
14174 /* We have an id-expression. */
14176 }
14179 /* We have parsed the complete id-expression or member access. */
14181 else
14182 {
14183 /* Abort our attempt to parse an id-expression or member access
14184 expression. */
14187 /* Commit to the tentative_firewall so we get syntax errors. */
14190 /* Parse a full expression. */
14193 }
14196 }
14198 /* Parse a `decltype' type. Returns the type.
14200 simple-type-specifier:
14201 decltype ( expression )
14202 C++14 proposal:
14203 decltype ( auto ) */
14205 static tree
14207 {
14212 {
14213 /* Already parsed. */
14216 }
14218 /* Look for the `decltype' token. */
14222 /* Parse the opening `('. */
14223 matching_parens parens;
14233 /* decltype (auto) */
14235 else
14236 {
14237 /* decltype (expression) */
14239 /* Types cannot be defined in a `decltype' expression. Save away the
14240 old message and set the new one. */
14242 parser->type_definition_forbidden_message
14245 /* The restrictions on constant-expressions do not apply inside
14246 decltype expressions. */
14247 bool saved_integral_constant_expression_p
14249 bool saved_non_integral_constant_expression_p
14253 /* Within a parenthesized expression, a `>' token is always
14254 the greater-than operator. */
14255 bool saved_greater_than_is_operator_p
14259 /* Do not actually evaluate the expression. */
14262 /* Do not warn about problems with the expression. */
14267 /* Go back to evaluating expressions. */
14271 /* The `>' token might be the end of a template-id or
14272 template-parameter-list now. */
14273 parser->greater_than_is_operator_p
14276 /* Restore the old message and the integral constant expression
14277 flags. */
14279 parser->integral_constant_expression_p
14281 parser->non_integral_constant_expression_p
14283 }
14285 /* Parse to the closing `)'. */
14287 {
14292 }
14295 {
14296 /* Build auto. */
14299 }
14300 else
14302 tf_warning_or_error);
14304 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14305 it again. */
14316 }
14318 /* Special member functions [gram.special] */
14320 /* Parse a conversion-function-id.
14322 conversion-function-id:
14323 operator conversion-type-id
14325 Returns an IDENTIFIER_NODE representing the operator. */
14327 static tree
14329 {
14330 tree type;
14331 tree saved_scope;
14332 tree saved_qualifying_scope;
14333 tree saved_object_scope;
14336 /* Look for the `operator' token. */
14339 /* When we parse the conversion-type-id, the current scope will be
14340 reset. However, we need that information in able to look up the
14341 conversion function later, so we save it here. */
14345 /* We must enter the scope of the class so that the names of
14346 entities declared within the class are available in the
14347 conversion-type-id. For example, consider:
14349 struct S {
14350 typedef int I;
14351 operator I();
14352 };
14354 S::operator I() { ... }
14356 In order to see that `I' is a type-name in the definition, we
14357 must be in the scope of `S'. */
14360 /* Parse the conversion-type-id. */
14362 /* Leave the scope of the class, if any. */
14365 /* Restore the saved scope. */
14369 /* If the TYPE is invalid, indicate failure. */
14373 }
14375 /* Parse a conversion-type-id:
14377 conversion-type-id:
14378 type-specifier-seq conversion-declarator [opt]
14380 Returns the TYPE specified. */
14382 static tree
14384 {
14385 tree attributes;
14386 cp_decl_specifier_seq type_specifiers;
14388 tree type_specified;
14391 /* Parse the attributes. */
14395 parser->type_definition_forbidden_message
14398 /* Parse the type-specifiers. */
14405 /* If that didn't work, stop. */
14408 /* Parse the conversion-declarator. */
14416 /* Don't give this error when parsing tentatively. This happens to
14417 work because we always parse this definitively once. */
14420 {
14422 {
14425 }
14429 }
14432 }
14434 /* Parse an (optional) conversion-declarator.
14436 conversion-declarator:
14437 ptr-operator conversion-declarator [opt]
14439 */
14443 {
14446 cp_cv_quals cv_quals;
14448 /* We don't know if there's a ptr-operator next, or not. */
14450 /* Try the ptr-operator. */
14453 /* If it worked, look for more conversion-declarators. */
14455 {
14458 /* Parse another optional declarator. */
14461 declarator = cp_parser_make_indirect_declarator
14465 }
14468 }
14470 /* Parse an (optional) ctor-initializer.
14472 ctor-initializer:
14473 : mem-initializer-list */
14475 static void
14477 {
14478 /* If the next token is not a `:', then there is no
14479 ctor-initializer. */
14481 {
14482 /* Do default initialization of any bases and members. */
14486 }
14488 /* Consume the `:' token. */
14490 /* And the mem-initializer-list. */
14492 }
14494 /* Parse a mem-initializer-list.
14496 mem-initializer-list:
14497 mem-initializer ... [opt]
14498 mem-initializer ... [opt] , mem-initializer-list */
14500 static void
14502 {
14507 /* Let the semantic analysis code know that we are starting the
14508 mem-initializer-list. */
14513 /* Loop through the list. */
14515 {
14516 tree mem_initializer;
14519 /* Parse the mem-initializer. */
14521 /* If the next token is a `...', we're expanding member initializers. */
14527 {
14528 /* Consume the `...'. */
14532 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14533 can be expanded but members cannot. */
14536 {
14541 }
14543 /* Construct the pack expansion type. */
14546 }
14549 {
14553 }
14554 /* Look for a target constructor. */
14558 {
14561 {
14565 }
14567 }
14568 /* Add it to the list, unless it was erroneous. */
14570 {
14573 }
14574 /* If the next token is not a `,', we're done. */
14577 /* Consume the `,' token. */
14579 }
14581 /* Perform semantic analysis. */
14584 }
14586 /* Parse a mem-initializer.
14588 mem-initializer:
14589 mem-initializer-id ( expression-list [opt] )
14590 mem-initializer-id braced-init-list
14592 GNU extension:
14594 mem-initializer:
14595 ( expression-list [opt] )
14597 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14598 class) or FIELD_DECL (for a non-static data member) to initialize;
14599 the TREE_VALUE is the expression-list. An empty initialization
14600 list is represented by void_list_node. */
14602 static tree
14604 {
14605 tree mem_initializer_id;
14606 tree expression_list;
14607 tree member;
14610 /* Find out what is being initialized. */
14612 {
14616 }
14617 else
14618 {
14622 }
14628 {
14635 }
14636 else
14637 {
14647 }
14657 }
14659 /* Parse a mem-initializer-id.
14661 mem-initializer-id:
14662 :: [opt] nested-name-specifier [opt] class-name
14663 decltype-specifier (C++11)
14664 identifier
14666 Returns a TYPE indicating the class to be initialized for the first
14667 production (and the second in C++11). Returns an IDENTIFIER_NODE
14668 indicating the data member to be initialized for the last production. */
14670 static tree
14672 {
14676 tree id;
14680 /* `typename' is not allowed in this context ([temp.res]). */
14682 {
14684 "keyword %<typename%> not allowed in this context (a qualified "
14687 }
14688 /* Look for the optional `::' operator. */
14689 global_scope_p
14693 /* Look for the optional nested-name-specifier. The simplest way to
14694 implement:
14696 [temp.res]
14698 The keyword `typename' is not permitted in a base-specifier or
14699 mem-initializer; in these contexts a qualified name that
14700 depends on a template-parameter is implicitly assumed to be a
14701 type name.
14703 is to assume that we have seen the `typename' keyword at this
14704 point. */
14705 nested_name_specifier_p
14714 /* If there is a `::' operator or a nested-name-specifier, then we
14715 are definitely looking for a class-name. */
14720 typename_type,
14724 /* Otherwise, we could also be looking for an ordinary identifier. */
14727 /* Try a decltype-specifier. */
14729 else
14730 /* Otherwise, try a class-name. */
14734 none_type,
14738 /* If we found one, we're done. */
14741 /* Otherwise, look for an ordinary identifier. */
14743 }
14745 /* Overloading [gram.over] */
14747 /* Parse an operator-function-id.
14749 operator-function-id:
14750 operator operator
14752 Returns an IDENTIFIER_NODE for the operator which is a
14753 human-readable spelling of the identifier, e.g., `operator +'. */
14755 static cp_expr
14757 {
14758 /* Look for the `operator' keyword. */
14761 /* And then the name of the operator itself. */
14763 }
14765 /* Return an identifier node for a user-defined literal operator.
14766 The suffix identifier is chained to the operator name identifier. */
14768 tree
14770 {
14771 tree identifier;
14778 }
14780 /* Parse an operator.
14782 operator:
14783 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14784 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14785 || ++ -- , ->* -> () []
14787 GNU Extensions:
14789 operator:
14790 <? >? <?= >?=
14792 Returns an IDENTIFIER_NODE for the operator which is a
14793 human-readable spelling of the identifier, e.g., `operator +'. */
14795 static cp_expr
14797 {
14802 /* Peek at the next token. */
14807 /* Figure out which operator we have. */
14812 {
14814 {
14815 /* The keyword should be either `new' or `delete'. */
14820 else
14823 /* Consume the `new' or `delete' token. */
14826 /* Peek at the next token. */
14828 /* If it's a `[' token then this is the array variant of the
14829 operator. */
14831 {
14832 /* Consume the `[' token. */
14834 /* Look for the `]' token. */
14839 }
14843 }
15001 {
15002 /* Consume the `('. */
15003 matching_parens parens;
15005 /* Look for the matching `)'. */
15010 }
15013 /* Consume the `['. */
15015 /* Look for the matching `]'. */
15024 /* FALLTHRU */
15033 {
15040 /* Consume the string. */
15046 {
15049 }
15050 else
15051 {
15053 /* Look for the suffix identifier. */
15058 {
15062 }
15063 else
15064 {
15067 }
15068 }
15073 {
15076 }
15079 {
15082 }
15084 {
15087 }
15089 }
15092 /* Anything else is an error. */
15094 }
15096 /* If we have selected an identifier, we need to consume the
15097 operator token. */
15099 {
15103 }
15104 /* Otherwise, no valid operator name was present. */
15105 else
15106 {
15109 }
15112 }
15114 /* Parse a template-declaration.
15116 template-declaration:
15117 export [opt] template < template-parameter-list > declaration
15119 If MEMBER_P is TRUE, this template-declaration occurs within a
15120 class-specifier.
15122 The grammar rule given by the standard isn't correct. What
15123 is really meant is:
15125 template-declaration:
15126 export [opt] template-parameter-list-seq
15127 decl-specifier-seq [opt] init-declarator [opt] ;
15128 export [opt] template-parameter-list-seq
15129 function-definition
15131 template-parameter-list-seq:
15132 template-parameter-list-seq [opt]
15133 template < template-parameter-list >
15135 Concept Extensions:
15137 template-parameter-list-seq:
15138 template < template-parameter-list > requires-clause [opt]
15140 requires-clause:
15141 requires logical-or-expression */
15143 static void
15145 {
15146 /* Check for `export'. */
15148 {
15149 /* Consume the `export' token. */
15151 /* Warn that we do not support `export'. */
15153 }
15156 }
15158 /* Parse a template-parameter-list.
15160 template-parameter-list:
15161 template-parameter
15162 template-parameter-list , template-parameter
15164 Returns a TREE_LIST. Each node represents a template parameter.
15165 The nodes are connected via their TREE_CHAINs. */
15167 static tree
15169 {
15174 /* The loop below parses the template parms. We first need to know
15175 the total number of template parms to be able to compute proper
15176 canonical types of each dependent type. So after the loop, when
15177 we know the total number of template parms,
15178 end_template_parm_list computes the proper canonical types and
15179 fixes up the dependent types accordingly. */
15181 {
15182 tree parameter;
15185 location_t parm_loc;
15187 /* Parse the template-parameter. */
15192 /* Add it to the list. */
15195 parm_loc,
15196 parameter,
15197 is_non_type,
15198 is_parameter_pack);
15199 else
15200 {
15203 }
15205 /* If the next token is not a `,', we're done. */
15208 /* Otherwise, consume the `,' token. */
15210 }
15213 }
15215 /* Parse a introduction-list.
15217 introduction-list:
15218 introduced-parameter
15219 introduction-list , introduced-parameter
15221 introduced-parameter:
15222 ...[opt] identifier
15224 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15225 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15226 WILDCARD_DECL will also have DECL_NAME set and token location in
15227 DECL_SOURCE_LOCATION. */
15229 static tree
15231 {
15235 {
15240 /* Build placeholder. */
15248 /* If the next token is not a `,', we're done. */
15251 /* Otherwise, consume the `,' token. */
15253 }
15255 /* Convert the vec into a TREE_VEC. */
15258 tree parm;
15264 }
15266 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15267 is an abstract declarator. */
15271 {
15276 }
15278 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15279 is an abstract declarator. */
15283 {
15287 else
15289 }
15291 /* Returns true if DECL represents a constrained-parameter. */
15295 {
15300 }
15302 /* Returns true if PARM declares a constrained-parameter. */
15306 {
15308 }
15310 /* Check that the type parameter is only a declarator-id, and that its
15311 type is not cv-qualified. */
15313 bool
15316 {
15321 {
15324 }
15326 /* Don't allow cv-qualified type parameters. */
15329 {
15332 }
15335 }
15337 /* Finish parsing/processing a template type parameter and checking
15338 various restrictions. */
15342 tree id,
15344 {
15347 else
15349 }
15351 static tree
15353 {
15354 /* FIXME: This should probably be copied, and we may need to adjust
15355 the template parameter depths. */
15365 }
15367 /* Finish parsing/processing a template template parameter by borrowing
15368 the template parameter list from the prototype parameter. */
15370 static tree
15372 tree proto,
15373 tree id,
15375 {
15379 }
15381 /* Create a new non-type template parameter from the given PARM
15382 declarator. */
15384 static tree
15387 {
15393 }
15395 /* Build a constrained template parameter based on the PARMDECL
15396 declarator. The type of PARMDECL is the constrained type, which
15397 refers to the prototype template parameter that ultimately
15398 specifies the type of the declared parameter. */
15400 static tree
15405 {
15411 /* A template parameter constrained by a variadic concept shall also
15412 be declared as a template parameter pack. */
15417 /* Build the parameter. Return an error if the declarator was invalid. */
15418 tree parm;
15423 parmdecl);
15424 else
15429 /* Finish the parameter decl and create a node attaching the
15430 default argument and constraint. */
15435 }
15437 /* Returns true if the parsed type actually represents the declaration
15438 of a type template-parameter. */
15442 {
15445 }
15448 /* Returns true if the parsed type actually represents the declaration of
15449 a template template-parameter. */
15451 static bool
15453 {
15456 }
15458 /* Parse a default argument for a type template-parameter.
15459 Note that diagnostics are handled in cp_parser_template_parameter. */
15461 static tree
15463 {
15466 /* Consume the `=' token. */
15471 /* Parse the default-argument. */
15477 {
15481 }
15484 }
15486 /* Parse a default argument for a template template-parameter. */
15488 static tree
15490 {
15495 /* Consume the `='. */
15497 /* Parse the id-expression. */
15499 /* save token before parsing the id-expression, for error
15500 reporting */
15502 tree default_argument
15510 /* If the id-expression was a template-id that refers to
15511 a template-class, we already have the declaration here,
15512 so no further lookup is needed. */
15513 ;
15514 else
15515 /* Look up the name. */
15516 default_argument
15518 none_type,
15524 /* See if the default argument is valid. */
15528 }
15530 /* Parse a template-parameter.
15532 template-parameter:
15533 type-parameter
15534 parameter-declaration
15536 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15537 the parameter. The TREE_PURPOSE is the default value, if any.
15538 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15539 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15540 set to true iff this parameter is a parameter pack. */
15542 static tree
15545 {
15548 tree parm;
15550 /* Assume it is a type parameter or a template parameter. */
15552 /* Assume it not a parameter pack. */
15554 /* Peek at the next token. */
15556 /* If it is `template', we have a type-parameter. */
15559 /* If it is `class' or `typename' we do not know yet whether it is a
15560 type parameter or a non-type parameter. Consider:
15562 template <typename T, typename T::X X> ...
15564 or:
15566 template <class C, class D*> ...
15568 Here, the first parameter is a type parameter, and the second is
15569 a non-type parameter. We can tell by looking at the token after
15570 the identifier -- if it is a `,', `=', or `>' then we have a type
15571 parameter. */
15573 {
15574 /* Peek at the token after `class' or `typename'. */
15576 /* If it's an ellipsis, we have a template type parameter
15577 pack. */
15580 /* If it's an identifier, skip it. */
15583 /* Now, see if the token looks like the end of a template
15584 parameter. */
15589 }
15591 /* Otherwise, it is a non-type parameter or a constrained parameter.
15593 [temp.param]
15595 When parsing a default template-argument for a non-type
15596 template-parameter, the first non-nested `>' is taken as the end
15597 of the template parameter-list rather than a greater-than
15598 operator. */
15599 parameter_declarator
15606 /* If the parameter declaration is marked as a parameter pack, set
15607 *IS_PARAMETER_PACK to notify the caller. */
15612 {
15613 /* Can happen in some cases of erroneous input (c++/34892). */
15615 /* Consume the `...' for better error recovery. */
15617 }
15619 // The parameter may have been constrained.
15622 parameter_declarator,
15623 is_non_type,
15624 is_parameter_pack);
15626 // Now we're sure that the parameter is a non-type parameter.
15637 }
15639 /* Parse a type-parameter.
15641 type-parameter:
15642 class identifier [opt]
15643 class identifier [opt] = type-id
15644 typename identifier [opt]
15645 typename identifier [opt] = type-id
15646 template < template-parameter-list > class identifier [opt]
15647 template < template-parameter-list > class identifier [opt]
15648 = id-expression
15650 GNU Extension (variadic templates):
15652 type-parameter:
15653 class ... identifier [opt]
15654 typename ... identifier [opt]
15656 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15657 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15658 the declaration of the parameter.
15660 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15662 static tree
15664 {
15666 tree parameter;
15668 /* Look for a keyword to tell us what kind of parameter this is. */
15674 {
15677 {
15678 tree identifier;
15679 tree default_argument;
15681 /* If the next token is an ellipsis, we have a template
15682 argument pack. */
15684 {
15685 /* Consume the `...' token. */
15690 }
15692 /* If the next token is an identifier, then it names the
15693 parameter. */
15696 else
15699 /* Create the parameter. */
15702 /* If the next token is an `=', we have a default argument. */
15704 {
15705 default_argument
15708 /* Template parameter packs cannot have default
15709 arguments. */
15711 {
15714 "template parameter pack %qD cannot have a "
15716 else
15718 "template parameter packs cannot have "
15721 }
15724 }
15725 else
15728 /* Create the combined representation of the parameter and the
15729 default argument. */
15731 }
15735 {
15736 tree identifier;
15737 tree default_argument;
15739 /* Look for the `<'. */
15741 /* Parse the template-parameter-list. */
15743 /* Look for the `>'. */
15746 // If template requirements are present, parse them.
15748 {
15753 }
15755 /* Look for the `class' or 'typename' keywords. */
15757 /* If the next token is an ellipsis, we have a template
15758 argument pack. */
15760 {
15761 /* Consume the `...' token. */
15766 }
15767 /* If the next token is an `=', then there is a
15768 default-argument. If the next token is a `>', we are at
15769 the end of the parameter-list. If the next token is a `,',
15770 then we are at the end of this parameter. */
15774 {
15776 /* Treat invalid names as if the parameter were nameless. */
15779 }
15780 else
15783 /* Create the template parameter. */
15785 identifier);
15787 /* If the next token is an `=', then there is a
15788 default-argument. */
15790 {
15791 default_argument
15794 /* Template parameter packs cannot have default
15795 arguments. */
15797 {
15800 "template parameter pack %qD cannot "
15802 identifier);
15803 else
15807 }
15808 }
15809 else
15812 /* Create the combined representation of the parameter and the
15813 default argument. */
15815 }
15821 }
15824 }
15826 /* Parse a template-id.
15828 template-id:
15829 template-name < template-argument-list [opt] >
15831 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15832 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15833 returned. Otherwise, if the template-name names a function, or set
15834 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15835 names a class, returns a TYPE_DECL for the specialization.
15837 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15838 uninstantiated templates. */
15840 static tree
15846 {
15847 tree templ;
15848 tree arguments;
15849 tree template_id;
15854 /* If the next token corresponds to a template-id, there is no need
15855 to reparse it. */
15858 {
15861 }
15863 /* Avoid performing name lookup if there is no possibility of
15864 finding a template-id. */
15867 && !cp_parser_nth_token_starts_template_argument_list_p
15869 {
15872 }
15874 /* Remember where the template-id starts. */
15880 /* Parse the template-name. */
15883 check_dependency_p,
15884 is_declaration,
15885 tag_type,
15888 {
15891 }
15893 /* Since we're going to preserve any side-effects from this parse, set up a
15894 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15895 in the template arguments. */
15898 /* If we find the sequence `[:' after a template-name, it's probably
15899 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15900 parse correctly the argument list. */
15907 {
15909 /* Change `:' into `::'. */
15911 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15912 CPP_LESS. */
15915 /* Parse the arguments. */
15918 {
15919 /* If we couldn't parse an argument list, then we revert our changes
15920 and return simply an error. Maybe this is not a template-id
15921 after all. */
15926 }
15927 /* Otherwise, emit an error about the invalid digraph, but continue
15928 parsing because we got our argument list. */
15931 {
15934 "%<<:%> is an alternate spelling for %<[%>."
15937 {
15939 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15942 }
15943 }
15944 }
15945 else
15946 {
15947 /* Look for the `<' that starts the template-argument-list. */
15949 {
15952 }
15953 /* Parse the arguments. */
15955 }
15957 /* Set the location to be of the form:
15958 template-name < template-argument-list [opt] >
15959 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15960 with caret == start at the start of the template-name,
15961 ranging until the closing '>'. */
15962 location_t finish_loc
15964 location_t combined_loc
15967 /* Check for concepts autos where they don't belong. We could
15968 identify types in some cases of idnetifier TEMPL, looking ahead
15969 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15970 types. We reject them in functions, but if what we have is an
15971 identifier, even with none_type we can't conclude it's NOT a
15972 type, we have to wait for template substitution. */
15975 /* Build a representation of the specialization. */
15978 TEMPLATE_ID_EXPR,
15982 {
15983 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15984 template (rather than some instantiation thereof) only if
15985 is not nested within some other construct. For example, in
15986 "template <typename T> void f(T) { A<T>::", A<T> is just an
15987 instantiation of A. */
15988 bool entering_scope
15991 template_id
15993 }
15994 /* A template-like identifier may be a partial concept id. */
16000 {
16004 }
16005 else
16006 {
16007 /* If it's not a class-template or a template-template, it should be
16008 a function-template. */
16016 }
16018 /* If parsing tentatively, replace the sequence of tokens that makes
16019 up the template-id with a CPP_TEMPLATE_ID token. That way,
16020 should we re-parse the token stream, we will not have to repeat
16021 the effort required to do the parse, nor will we issue duplicate
16022 error messages about problems during instantiation of the
16023 template. */
16025 /* Don't do this if we had a parse error in a declarator; re-parsing
16026 might succeed if a name changes meaning (60361). */
16030 {
16031 /* Reset the contents of the START_OF_ID token. */
16035 /* Retrieve any deferred checks. Do not pop this access checks yet
16036 so the memory will not be reclaimed during token replacing below. */
16042 /* Purge all subsequent tokens. */
16045 /* ??? Can we actually assume that, if template_id ==
16046 error_mark_node, we will have issued a diagnostic to the
16047 user, as opposed to simply marking the tentative parse as
16048 failed? */
16051 }
16055 }
16057 /* Parse a template-name.
16059 template-name:
16060 identifier
16062 The standard should actually say:
16064 template-name:
16065 identifier
16066 operator-function-id
16068 A defect report has been filed about this issue.
16070 A conversion-function-id cannot be a template name because they cannot
16071 be part of a template-id. In fact, looking at this code:
16073 a.operator K<int>()
16075 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16076 It is impossible to call a templated conversion-function-id with an
16077 explicit argument list, since the only allowed template parameter is
16078 the type to which it is converting.
16080 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16081 `template' keyword, in a construction like:
16083 T::template f<3>()
16085 In that case `f' is taken to be a template-name, even though there
16086 is no way of knowing for sure.
16088 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16089 name refers to a set of overloaded functions, at least one of which
16090 is a template, or an IDENTIFIER_NODE with the name of the template,
16091 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16092 names are looked up inside uninstantiated templates. */
16094 static tree
16101 {
16102 tree identifier;
16103 tree decl;
16106 /* If the next token is `operator', then we have either an
16107 operator-function-id or a conversion-function-id. */
16109 {
16110 /* We don't know whether we're looking at an
16111 operator-function-id or a conversion-function-id. */
16113 /* Try an operator-function-id. */
16115 /* If that didn't work, try a conversion-function-id. */
16117 {
16120 }
16121 }
16122 /* Look for the identifier. */
16123 else
16126 /* If we didn't find an identifier, we don't have a template-id. */
16130 /* If the name immediately followed the `template' keyword, then it
16131 is a template-name. However, if the next token is not `<', then
16132 we do not treat it as a template-name, since it is not being used
16133 as part of a template-id. This enables us to handle constructs
16134 like:
16136 template <typename T> struct S { S(); };
16137 template <typename T> S<T>::S();
16139 correctly. We would treat `S' as a template -- if it were `S<T>'
16140 -- but we do not if there is no `<'. */
16144 {
16145 /* In a declaration, in a dependent context, we pretend that the
16146 "template" keyword was present in order to improve error
16147 recovery. For example, given:
16149 template <typename T> void f(T::X<int>);
16151 we want to treat "X<int>" as a template-id. */
16153 && !template_keyword_p
16155 && check_dependency_p
16157 /* Do not do this for dtors (or ctors), since they never
16158 need the template keyword before their name. */
16160 {
16163 /* Explain what went wrong. */
16165 identifier);
16168 /* If parsing tentatively, find the location of the "<" token. */
16171 /* Parse the template arguments so that we can issue error
16172 messages about them. */
16175 /* Skip tokens until we find a good place from which to
16176 continue parsing. */
16181 /* If parsing tentatively, permanently remove the
16182 template argument list. That will prevent duplicate
16183 error messages from being issued about the missing
16184 "template" keyword. */
16191 }
16193 /* If the "template" keyword is present, then there is generally
16194 no point in doing name-lookup, so we just return IDENTIFIER.
16195 But, if the qualifying scope is non-dependent then we can
16196 (and must) do name-lookup normally. */
16198 {
16204 {
16205 /* We're optimizing away the call to cp_parser_lookup_name, but
16206 we still need to do this. */
16209 }
16210 }
16211 }
16213 /* Look up the name. */
16215 tag_type,
16218 check_dependency_p,
16224 /* If DECL is a template, then the name was a template-name. */
16226 {
16230 }
16231 else
16232 {
16233 /* The standard does not explicitly indicate whether a name that
16234 names a set of overloaded declarations, some of which are
16235 templates, is a template-name. However, such a name should
16236 be a template-name; otherwise, there is no way to form a
16237 template-id for the overloaded templates. */
16246 {
16247 /* The name does not name a template. */
16250 }
16251 }
16253 /* If DECL is dependent, and refers to a function, then just return
16254 its name; we will look it up again during template instantiation. */
16256 {
16260 }
16263 }
16265 /* Parse a template-argument-list.
16267 template-argument-list:
16268 template-argument ... [opt]
16269 template-argument-list , template-argument ... [opt]
16271 Returns a TREE_VEC containing the arguments. */
16273 static tree
16275 {
16280 tree vec;
16287 /* Even if the template-id appears in an integral
16288 constant-expression, the contents of the argument list do
16289 not. */
16295 /* Parse the arguments. */
16296 do
16297 {
16298 tree argument;
16301 /* Consume the comma. */
16304 /* Parse the template-argument. */
16307 /* If the next token is an ellipsis, we're expanding a template
16308 argument pack. */
16310 {
16312 {
16316 }
16317 /* Consume the `...' token. */
16320 /* Make the argument into a TYPE_PACK_EXPANSION or
16321 EXPR_PACK_EXPANSION. */
16323 }
16326 {
16330 {
16333 }
16334 else
16336 }
16338 }
16354 }
16356 /* Parse a template-argument.
16358 template-argument:
16359 assignment-expression
16360 type-id
16361 id-expression
16363 The representation is that of an assignment-expression, type-id, or
16364 id-expression -- except that the qualified id-expression is
16365 evaluated, so that the value returned is either a DECL or an
16366 OVERLOAD.
16368 Although the standard says "assignment-expression", it forbids
16369 throw-expressions or assignments in the template argument.
16370 Therefore, we use "conditional-expression" instead. */
16372 static tree
16374 {
16375 tree argument;
16381 cp_id_kind idk;
16383 /* There's really no way to know what we're looking at, so we just
16384 try each alternative in order.
16386 [temp.arg]
16388 In a template-argument, an ambiguity between a type-id and an
16389 expression is resolved to a type-id, regardless of the form of
16390 the corresponding template-parameter.
16392 Therefore, we try a type-id first. */
16395 /* If there was no error parsing the type-id but the next token is a
16396 '>>', our behavior depends on which dialect of C++ we're
16397 parsing. In C++98, we probably found a typo for '> >'. But there
16398 are type-id which are also valid expressions. For instance:
16400 struct X { int operator >> (int); };
16401 template <int V> struct Foo {};
16402 Foo<X () >> 5> r;
16404 Here 'X()' is a valid type-id of a function type, but the user just
16405 wanted to write the expression "X() >> 5". Thus, we remember that we
16406 found a valid type-id, but we still try to parse the argument as an
16407 expression to see what happens.
16409 In C++0x, the '>>' will be considered two separate '>'
16410 tokens. */
16414 {
16417 }
16418 else
16419 {
16420 /* If the next token isn't a `,' or a `>', then this argument wasn't
16421 really finished. This means that the argument is not a valid
16422 type-id. */
16425 /* If that worked, we're done. */
16428 }
16429 /* We're still not sure what the argument will be. */
16431 /* Try a template. */
16439 /* If the next token isn't a `,' or a `>', then this argument wasn't
16440 really finished. */
16444 {
16445 /* Figure out what is being referred to. If the id-expression
16446 was for a class template specialization, then we will have a
16447 TYPE_DECL at this point. There is no need to do name lookup
16448 at this point in that case. */
16451 none_type,
16457 /* Handle a constrained-type-specifier for a non-type template
16458 parameter. */
16464 }
16466 {
16470 }
16471 /* It must be a non-type argument. In C++17 any constant-expression is
16472 allowed. */
16476 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16478 -- an integral constant-expression of integral or enumeration
16479 type; or
16481 -- the name of a non-type template-parameter; or
16483 -- the name of an object or function with external linkage...
16485 -- the address of an object or function with external linkage...
16487 -- a pointer to member... */
16488 /* Look for a non-type template parameter. */
16490 {
16502 }
16504 /* If the next token is "&", the argument must be the address of an
16505 object or function with external linkage. */
16508 {
16511 }
16512 /* See if we might have an id-expression. */
16519 {
16522 address_p,
16529 else
16530 {
16531 tree probe;
16534 {
16535 /* Strip the dereference temporarily. */
16538 }
16540 /* If we're in a template, we represent a qualified-id referring
16541 to a static data member as a SCOPE_REF even if the scope isn't
16542 dependent so that we can check access control later. */
16547 {
16548 /* A variable without external linkage might still be a
16549 valid constant-expression, so no error is issued here
16550 if the external-linkage check fails. */
16553 }
16555 /* All overloaded functions are allowed; if the external
16556 linkage test does not pass, an error will be issued
16557 later. */
16558 ;
16562 /* A pointer-to-member. */
16563 ;
16565 ;
16566 else
16570 {
16573 tf_warning_or_error);
16574 else
16577 }
16578 }
16579 }
16580 /* If the argument started with "&", there are no other valid
16581 alternatives at this point. */
16583 {
16586 }
16588 general_expr:
16589 /* If the argument wasn't successfully parsed as a type-id followed
16590 by '>>', the argument can only be a constant expression now.
16591 Otherwise, we try parsing the constant-expression tentatively,
16592 because the argument could really be a type-id. */
16598 else
16599 {
16600 /* With C++17 generalized non-type template arguments we need to handle
16601 lvalue constant expressions, too. */
16604 }
16612 /* We did our best to parse the argument as a non type-id, but that
16613 was the only alternative that matched (albeit with a '>' after
16614 it). We can assume it's just a typo from the user, and a
16615 diagnostic will then be issued. */
16617 }
16619 /* Parse an explicit-instantiation.
16621 explicit-instantiation:
16622 template declaration
16624 Although the standard says `declaration', what it really means is:
16626 explicit-instantiation:
16627 template decl-specifier-seq [opt] declarator [opt] ;
16629 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16630 supposed to be allowed. A defect report has been filed about this
16631 issue.
16633 GNU Extension:
16635 explicit-instantiation:
16636 storage-class-specifier template
16637 decl-specifier-seq [opt] declarator [opt] ;
16638 function-specifier template
16639 decl-specifier-seq [opt] declarator [opt] ; */
16641 static void
16643 {
16645 cp_decl_specifier_seq decl_specifiers;
16650 /* Look for an (optional) storage-class-specifier or
16651 function-specifier. */
16653 {
16654 extension_specifier
16657 extension_specifier
16660 }
16662 /* Look for the `template' keyword. */
16664 /* Let the front end know that we are processing an explicit
16665 instantiation. */
16667 /* [temp.explicit] says that we are supposed to ignore access
16668 control while processing explicit instantiation directives. */
16670 /* Parse a decl-specifier-seq. */
16672 CP_PARSER_FLAGS_OPTIONAL,
16675 /* If there was exactly one decl-specifier, and it declared a class,
16676 and there's no declarator, then we have an explicit type
16677 instantiation. */
16679 {
16680 tree type;
16684 /* Turn access control back on for names used during
16685 template instantiation. */
16690 }
16691 else
16692 {
16694 tree decl;
16696 /* Parse the declarator. */
16697 declarator
16708 {
16711 "explicit instantiation shall not use"
16715 "explicit instantiation shall not use"
16720 /* Turn access control back on for names used during
16721 template instantiation. */
16723 /* Do the explicit instantiation. */
16725 }
16726 else
16727 {
16729 /* Skip the body of the explicit instantiation. */
16731 }
16732 }
16733 /* We're done with the instantiation. */
16739 }
16741 /* Parse an explicit-specialization.
16743 explicit-specialization:
16744 template < > declaration
16746 Although the standard says `declaration', what it really means is:
16748 explicit-specialization:
16749 template <> decl-specifier [opt] init-declarator [opt] ;
16750 template <> function-definition
16751 template <> explicit-specialization
16752 template <> template-declaration */
16754 static void
16756 {
16760 /* Look for the `template' keyword. */
16762 /* Look for the `<'. */
16764 /* Look for the `>'. */
16766 /* We have processed another parameter list. */
16768 /* [temp]
16770 A template ... explicit specialization ... shall not have C
16771 linkage. */
16773 {
16776 /* Give it C++ linkage to avoid confusing other parts of the
16777 front end. */
16780 }
16781 else
16783 /* Let the front end know that we are beginning a specialization. */
16785 {
16788 }
16790 /* If the next keyword is `template', we need to figure out whether
16791 or not we're looking a template-declaration. */
16793 {
16798 else
16800 }
16801 else
16802 /* Parse the dependent declaration. */
16808 /* We're done with the specialization. */
16810 /* For the erroneous case of a template with C linkage, we pushed an
16811 implicit C++ linkage scope; exit that scope now. */
16814 /* We're done with this parameter list. */
16816 }
16818 /* Parse a type-specifier.
16820 type-specifier:
16821 simple-type-specifier
16822 class-specifier
16823 enum-specifier
16824 elaborated-type-specifier
16825 cv-qualifier
16827 GNU Extension:
16829 type-specifier:
16830 __complex__
16832 Returns a representation of the type-specifier. For a
16833 class-specifier, enum-specifier, or elaborated-type-specifier, a
16834 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16836 The parser flags FLAGS is used to control type-specifier parsing.
16838 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16839 in a decl-specifier-seq.
16841 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16842 class-specifier, enum-specifier, or elaborated-type-specifier, then
16843 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16844 if a type is declared; 2 if it is defined. Otherwise, it is set to
16845 zero.
16847 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16848 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16849 is set to FALSE. */
16851 static tree
16853 cp_parser_flags flags,
16858 {
16864 /* Assume this type-specifier does not declare a new type. */
16867 /* And that it does not specify a cv-qualifier. */
16870 /* Peek at the next token. */
16873 /* If we're looking at a keyword, we can use that to guide the
16874 production we choose. */
16877 {
16882 /* Look for the enum-specifier. */
16884 /* If that worked, we're done. */
16886 {
16891 type_spec,
16892 token,
16895 }
16896 else
16899 /* Any of these indicate either a class-specifier, or an
16900 elaborated-type-specifier. */
16907 /* Parse tentatively so that we can back up if we don't find a
16908 class-specifier. */
16910 /* Look for the class-specifier. */
16913 /* If that worked, we're done. */
16915 {
16920 type_spec,
16921 token,
16924 }
16926 /* Fall through. */
16927 elaborated_type_specifier:
16928 /* We're declaring (not defining) a class or enum. */
16932 /* Fall through. */
16934 /* Look for an elaborated-type-specifier. */
16935 type_spec
16936 = (cp_parser_elaborated_type_specifier
16939 is_declaration));
16942 type_spec,
16943 token,
16966 /* The `__complex__' keyword is a GNU extension. */
16972 }
16974 /* Handle simple keywords. */
16976 {
16978 {
16981 }
16983 }
16985 /* If we do not already have a type-specifier, assume we are looking
16986 at a simple-type-specifier. */
16988 decl_specs,
16989 flags);
16991 /* If we didn't find a type-specifier, and a type-specifier was not
16992 optional in this context, issue an error message. */
16994 {
16997 }
17000 }
17002 /* Parse a simple-type-specifier.
17004 simple-type-specifier:
17005 :: [opt] nested-name-specifier [opt] type-name
17006 :: [opt] nested-name-specifier template template-id
17007 char
17008 wchar_t
17009 bool
17010 short
17011 int
17012 long
17013 signed
17014 unsigned
17015 float
17016 double
17017 void
17019 C++11 Extension:
17021 simple-type-specifier:
17022 auto
17023 decltype ( expression )
17024 char16_t
17025 char32_t
17026 __underlying_type ( type-id )
17028 C++17 extension:
17030 nested-name-specifier(opt) template-name
17032 GNU Extension:
17034 simple-type-specifier:
17035 __int128
17036 __typeof__ unary-expression
17037 __typeof__ ( type-id )
17038 __typeof__ ( type-id ) { initializer-list , [opt] }
17040 Concepts Extension:
17042 simple-type-specifier:
17043 constrained-type-specifier
17045 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17046 appropriately updated. */
17048 static tree
17051 cp_parser_flags flags)
17052 {
17057 /* Peek at the next token. */
17060 /* If we're looking at a keyword, things are easy. */
17062 {
17097 {
17100 }
17129 {
17130 /* The 'auto' might be the placeholder return type for a function decl
17131 with trailing return type. */
17140 {
17142 {
17149 }
17152 {
17155 }
17158 }
17162 {
17165 }
17168 {
17171 }
17172 else
17176 {
17179 "use of %<auto%> in lambda parameter declaration "
17180 "only available with "
17182 }
17185 "use of %<auto%> in parameter declaration "
17186 "only available with "
17190 "use of %<auto%> in parameter declaration "
17192 }
17193 else
17198 /* Since DR 743, decltype can either be a simple-type-specifier by
17199 itself or begin a nested-name-specifier. Parsing it will replace
17200 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17201 handling below decide what to do. */
17207 /* Consume the `typeof' token. */
17209 /* Parse the operand to `typeof'. */
17211 /* If it is not already a TYPE, take its type. */
17217 token,
17226 token,
17236 token,
17241 }
17243 /* If token is an already-parsed decltype not followed by ::,
17244 it's a simple-type-specifier. */
17247 {
17250 {
17252 token,
17254 /* Remember that we are handling a decltype in order to
17255 implement the resolution of DR 1510 when the argument
17256 isn't instantiation dependent. */
17258 }
17261 }
17263 /* If the type-specifier was for a built-in type, we're done. */
17265 {
17266 /* Record the type. */
17273 type,
17274 token,
17279 /* Consume the token. */
17285 /* There is no valid C++ program where a non-template type is
17286 followed by a "<". That usually indicates that the user thought
17287 that the type was a template. */
17292 }
17294 /* The type-specifier must be a user-defined type. */
17296 {
17300 /* Don't gobble tokens or issue error messages if this is an
17301 optional type-specifier. */
17307 /* Look for the optional `::' operator. */
17308 global_p
17312 /* Look for the nested-name specifier. */
17313 qualified_p
17320 /* If we have seen a nested-name-specifier, and the next token
17321 is `template', then we are using the template-id production. */
17324 {
17325 /* Look for the template-id. */
17329 none_type,
17331 /* If the template-id did not name a type, we are out of
17332 luck. */
17334 {
17337 }
17338 }
17339 /* Otherwise, look for a type-name. */
17340 else
17342 /* Keep track of all name-lookups performed in class scopes. */
17344 && !global_p
17345 && !qualified_p
17349 /* If it didn't work out, we don't have a TYPE. */
17354 {
17368 {
17370 none_type,
17380 else
17381 {
17386 }
17387 }
17388 else
17394 }
17397 token,
17399 }
17401 /* If we didn't get a type-name, issue an error message. */
17403 {
17406 }
17409 {
17410 /* See if TYPE is an Objective-C type, and if so, parse and
17411 accept any protocol references following it. Do this before
17412 the cp_parser_check_for_invalid_template_id() call, because
17413 Objective-C types can be followed by '<...>' which would
17414 enclose protocol names rather than template arguments, and so
17415 everything is fine. */
17418 {
17422 /* Clobber the "unqualified" type previously entered into
17423 DECL_SPECS with the new, improved protocol-qualified version. */
17428 }
17430 /* There is no valid C++ program where a non-template type is
17431 followed by a "<". That usually indicates that the user
17432 thought that the type was a template. */
17434 none_type,
17436 }
17439 }
17441 /* Parse a type-name.
17443 type-name:
17444 class-name
17445 enum-name
17446 typedef-name
17447 simple-template-id [in c++0x]
17449 enum-name:
17450 identifier
17452 typedef-name:
17453 identifier
17455 Concepts:
17457 type-name:
17458 concept-name
17459 partial-concept-id
17461 concept-name:
17462 identifier
17464 Returns a TYPE_DECL for the type. */
17466 static tree
17468 {
17470 }
17472 /* See above. */
17473 static tree
17475 {
17476 tree type_decl;
17478 /* We can't know yet whether it is a class-name or not. */
17480 /* Try a class-name. */
17482 typename_keyword_p,
17484 none_type,
17488 /* If it's not a class-name, keep looking. */
17490 {
17492 /* It must be a typedef-name or an enum-name. */
17496 /* It is either a simple-template-id representing an
17497 instantiation of an alias template... */
17501 none_type,
17503 /* Note that this must be an instantiation of an alias template
17504 because [temp.names]/6 says:
17506 A template-id that names an alias template specialization
17507 is a type-name.
17509 Whereas [temp.names]/7 says:
17511 A simple-template-id that names a class template
17512 specialization is a class-name.
17514 With concepts, this could also be a partial-concept-id that
17515 declares a non-type template parameter. */
17522 else
17526 /* ... Or a typedef-name or an enum-name. */
17528 }
17531 }
17533 /* Check if DECL and ARGS can form a constrained-type-specifier.
17534 If ARGS is non-null, we try to form a concept check of the
17535 form DECL<?, ARGS> where ? is a wildcard that matches any
17536 kind of template argument. If ARGS is NULL, then we try to
17537 form a concept check of the form DECL<?>. */
17539 static tree
17542 {
17545 /* If we a constrained-type-specifier cannot be deduced. */
17549 /* A constrained type specifier can only be found in an
17550 overload set or as a reference to a template declaration.
17552 FIXME: This might be masking a bug. It's possible that
17553 that the deduction below is causing template specializations
17554 to be formed with the wildcard as an argument. */
17558 /* Try to build a call expression that evaluates the
17559 concept. This can fail if the overload set refers
17560 only to non-templates. */
17566 /* Deduce the checked constraint and the prototype parameter.
17568 FIXME: In certain cases, failure to deduce should be a
17569 diagnosable error. */
17570 tree conc;
17571 tree proto;
17575 /* In template parameter scope, this results in a constrained
17576 parameter. Return a descriptor of that parm. */
17580 /* In a parameter-declaration-clause, constrained-type
17581 specifiers result in invented template parameters. */
17583 {
17586 }
17587 else
17588 {
17589 /* Otherwise, we're in a context where the constrained
17590 type name is deduced and the constraint applies
17591 after deduction. */
17593 }
17596 }
17598 /* If DECL refers to a concept, return a TYPE_DECL representing
17599 the result of using the constrained type specifier in the
17600 current context. DECL refers to a concept if
17602 - it is an overload set containing a function concept taking a single
17603 type argument, or
17605 - it is a variable concept taking a single type argument. */
17607 static tree
17609 {
17615 else
17617 }
17619 /* Check if DECL and ARGS form a partial-concept-id. If so,
17620 assign ID to the resulting constrained placeholder.
17622 Returns true if the partial-concept-id designates a placeholder
17623 and false otherwise. Note that *id is set to NULL_TREE in
17624 this case. */
17626 static tree
17628 {
17630 }
17632 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17633 or a concept-name.
17635 enum-name:
17636 identifier
17638 typedef-name:
17639 identifier
17641 concept-name:
17642 identifier
17644 Returns a TYPE_DECL for the type. */
17646 static tree
17648 {
17649 tree type_decl;
17650 tree identifier;
17657 /* Look up the type-name. */
17662 /* If we found an overload set, then it may refer to a concept-name. */
17668 {
17669 /* See if this is an Objective-C type. */
17674 }
17676 /* Issue an error if we did not find a type-name. */
17678 /* In Objective-C, we have the complication that class names are
17679 normally type names and start declarations (eg, the
17680 "NSObject" in "NSObject *object;"), but can be used in an
17681 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17682 is an expression. So, a classname followed by a dot is not a
17683 valid type-name. */
17686 {
17691 }
17692 /* Remember that the name was used in the definition of the
17693 current class so that we can check later to see if the
17694 meaning would have been different after the class was
17695 entirely defined. */
17701 }
17703 /* Parse an elaborated-type-specifier. Note that the grammar given
17704 here incorporates the resolution to DR68.
17706 elaborated-type-specifier:
17707 class-key :: [opt] nested-name-specifier [opt] identifier
17708 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17709 enum-key :: [opt] nested-name-specifier [opt] identifier
17710 typename :: [opt] nested-name-specifier identifier
17711 typename :: [opt] nested-name-specifier template [opt]
17712 template-id
17714 GNU extension:
17716 elaborated-type-specifier:
17717 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17718 class-key attributes :: [opt] nested-name-specifier [opt]
17719 template [opt] template-id
17720 enum attributes :: [opt] nested-name-specifier [opt] identifier
17722 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17723 declared `friend'. If IS_DECLARATION is TRUE, then this
17724 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17725 something is being declared.
17727 Returns the TYPE specified. */
17729 static tree
17733 {
17735 tree identifier;
17738 tree globalscope;
17741 /* See if we're looking at the `enum' keyword. */
17743 {
17744 /* Consume the `enum' token. */
17746 /* Remember that it's an enumeration type. */
17748 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17749 enums) is used here. */
17753 {
17760 /* Consume the `struct' or `class' and parse it anyway. */
17762 }
17763 /* Parse the attributes. */
17765 }
17766 /* Or, it might be `typename'. */
17768 RID_TYPENAME))
17769 {
17770 /* Consume the `typename' token. */
17772 /* Remember that it's a `typename' type. */
17774 }
17775 /* Otherwise it must be a class-key. */
17776 else
17777 {
17781 /* Parse the attributes. */
17783 }
17785 /* Look for the `::' operator. */
17788 /* Look for the nested-name-specifier. */
17789 tree nested_name_specifier;
17791 {
17792 nested_name_specifier
17797 is_declaration);
17800 }
17801 else
17802 /* Even though `typename' is not present, the proposed resolution
17803 to Core Issue 180 says that in `class A<T>::B', `B' should be
17804 considered a type-name, even if `A<T>' is dependent. */
17805 nested_name_specifier
17810 is_declaration);
17811 /* For everything but enumeration types, consider a template-id.
17812 For an enumeration type, consider only a plain identifier. */
17814 {
17816 tree decl;
17818 /* Allow the `template' keyword. */
17820 /* If we didn't see `template', we don't know if there's a
17821 template-id or not. */
17824 /* Parse the template-id. */
17828 tag_type,
17829 is_declaration);
17830 /* If we didn't find a template-id, look for an ordinary
17831 identifier. */
17833 ;
17834 /* We can get here when cp_parser_template_id, called by
17835 cp_parser_class_name with tag_type == none_type, succeeds
17836 and caches a BASELINK. Then, when called again here,
17837 instead of failing and returning an error_mark_node
17838 returns it (see template/typename17.C in C++11).
17839 ??? Could we diagnose this earlier? */
17841 {
17844 }
17845 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17846 in effect, then we must assume that, upon instantiation, the
17847 template will correspond to a class. */
17851 typename_type,
17853 /* If the `typename' keyword is in effect and DECL is not a type
17854 decl, then type is non existent. */
17856 ;
17858 {
17862 /* If the next token is a semicolon, this must be a specialization,
17863 instantiation, or friend declaration. Check the scope while we
17864 still know whether or not we had a nested-name-specifier. */
17869 }
17872 }
17875 {
17880 {
17883 }
17885 /* For a `typename', we needn't call xref_tag. */
17891 /* Template parameter lists apply only if we are not within a
17892 function parameter list. */
17893 bool template_parm_lists_apply
17902 /* Look up a qualified name in the usual way. */
17904 {
17905 tree decl;
17906 tree ambiguous_decls;
17909 tag_type,
17916 /* If the lookup was ambiguous, an error will already have been
17917 issued. */
17921 /* If we are parsing friend declaration, DECL may be a
17922 TEMPLATE_DECL tree node here. However, we need to check
17923 whether this TEMPLATE_DECL results in valid code. Consider
17924 the following example:
17926 namespace N {
17927 template <class T> class C {};
17928 }
17929 class X {
17930 template <class T> friend class N::C; // #1, valid code
17931 };
17932 template <class T> class Y {
17933 friend class N::C; // #2, invalid code
17934 };
17936 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17937 name lookup of `N::C'. We see that friend declaration must
17938 be template for the code to be valid. Note that
17939 processing_template_decl does not work here since it is
17940 always 1 for the above two cases. */
17942 decl = (cp_parser_maybe_treat_template_as_class
17947 {
17949 identifier,
17952 }
17955 {
17959 allow_template);
17963 }
17965 /* Forward declarations of nested types, such as
17967 class C1::C2;
17968 class C1::C2::C3;
17970 are invalid unless all components preceding the final '::'
17971 are complete. If all enclosing types are complete, these
17972 declarations become merely pointless.
17974 Invalid forward declarations of nested types are errors
17975 caught elsewhere in parsing. Those that are pointless arrive
17976 here. */
17983 }
17984 else
17985 {
17986 /* An elaborated-type-specifier sometimes introduces a new type and
17987 sometimes names an existing type. Normally, the rule is that it
17988 introduces a new type only if there is not an existing type of
17989 the same name already in scope. For example, given:
17991 struct S {};
17992 void f() { struct S s; }
17994 the `struct S' in the body of `f' is the same `struct S' as in
17995 the global scope; the existing definition is used. However, if
17996 there were no global declaration, this would introduce a new
17997 local class named `S'.
17999 An exception to this rule applies to the following code:
18001 namespace N { struct S; }
18003 Here, the elaborated-type-specifier names a new type
18004 unconditionally; even if there is already an `S' in the
18005 containing scope this declaration names a new type.
18006 This exception only applies if the elaborated-type-specifier
18007 forms the complete declaration:
18009 [class.name]
18011 A declaration consisting solely of `class-key identifier ;' is
18012 either a redeclaration of the name in the current scope or a
18013 forward declaration of the identifier as a class name. It
18014 introduces the name into the current scope.
18016 We are in this situation precisely when the next token is a `;'.
18018 An exception to the exception is that a `friend' declaration does
18019 *not* name a new type; i.e., given:
18021 struct S { friend struct T; };
18023 `T' is not a new type in the scope of `S'.
18025 Also, `new struct S' or `sizeof (struct S)' never results in the
18026 definition of a new type; a new type can only be declared in a
18027 declaration context. */
18029 tag_scope ts;
18033 /* Friends have special name lookup rules. */
18037 CPP_SEMICOLON))
18038 /* This is a `class-key identifier ;' */
18040 else
18043 template_p =
18044 (template_parm_lists_apply
18047 /* An unqualified name was used to reference this type, so
18048 there were no qualifying templates. */
18057 }
18058 }
18063 /* Allow attributes on forward declarations of classes. */
18065 {
18075 else
18078 }
18081 {
18082 /* Indicate whether this class was declared as a `class' or as a
18083 `struct'. */
18087 }
18089 /* A "<" cannot follow an elaborated type specifier. If that
18090 happens, the user was probably trying to form a template-id. */
18095 }
18097 /* Parse an enum-specifier.
18099 enum-specifier:
18100 enum-head { enumerator-list [opt] }
18101 enum-head { enumerator-list , } [C++0x]
18103 enum-head:
18104 enum-key identifier [opt] enum-base [opt]
18105 enum-key nested-name-specifier identifier enum-base [opt]
18107 enum-key:
18108 enum
18109 enum class [C++0x]
18110 enum struct [C++0x]
18112 enum-base: [C++0x]
18113 : type-specifier-seq
18115 opaque-enum-specifier:
18116 enum-key identifier enum-base [opt] ;
18118 GNU Extensions:
18119 enum-key attributes[opt] identifier [opt] enum-base [opt]
18120 { enumerator-list [opt] }attributes[opt]
18121 enum-key attributes[opt] identifier [opt] enum-base [opt]
18122 { enumerator-list, }attributes[opt] [C++0x]
18124 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18125 if the token stream isn't an enum-specifier after all. */
18127 static tree
18129 {
18130 tree identifier;
18132 tree prev_scope;
18134 tree attributes;
18147 /* Parse tentatively so that we can back up if we don't find a
18148 enum-specifier. */
18151 /* Caller guarantees that the current token is 'enum', an identifier
18152 possibly follows, and the token after that is an opening brace.
18153 If we don't have an identifier, fabricate an anonymous name for
18154 the enumeration being defined. */
18157 /* Parse the "class" or "struct", which indicates a scoped
18158 enumeration type in C++0x. */
18161 {
18165 /* Consume the `struct' or `class' token. */
18169 }
18173 /* Clear the qualification. */
18178 /* Figure out in what scope the declaration is being placed. */
18184 nested_name_specifier
18192 {
18193 tree name;
18197 enum_type,
18202 input_location);
18204 {
18207 {
18208 /* Are template enums allowed in ISO? */
18212 /* ignore a typename reference, for it will be solved by name
18213 in start_enum. */
18215 }
18216 }
18219 else
18220 {
18225 }
18226 }
18227 else
18228 {
18231 else
18232 {
18238 }
18239 }
18242 /* Check for the `:' that denotes a specified underlying type in C++0x.
18243 Note that a ':' could also indicate a bitfield width, however. */
18245 {
18246 cp_decl_specifier_seq type_specifiers;
18248 /* Consume the `:'. */
18251 /* Parse the type-specifier-seq. */
18256 /* At this point this is surely not elaborated type specifier. */
18265 /* If that didn't work, stop. */
18267 {
18273 }
18274 }
18276 /* Look for the `{' but don't consume it yet. */
18278 {
18280 {
18283 {
18286 }
18287 }
18288 /* An opaque-enum-specifier must have a ';' here. */
18291 {
18294 {
18297 }
18298 }
18299 }
18305 {
18307 {
18311 }
18313 {
18315 }
18316 }
18318 /* Issue an error message if type-definitions are forbidden here. */
18321 else
18322 /* Create the new type. We do this before consuming the opening
18323 brace so the enum will be recorded as being on the line of its
18324 tag (or the 'enum' keyword, if there is no tag). */
18328 /* If the next token is not '{' it is an opaque-enum-specifier or an
18329 elaborated-type-specifier. */
18331 {
18335 {
18336 /* The following catches invalid code such as:
18337 enum class S<int>::E { A, B, C }; */
18345 {
18349 nested_name_specifier);
18351 }
18354 {
18356 "%qT for enum declaration does not name a class "
18359 }
18360 /* If that scope does not contain the scope in which the
18361 class was originally declared, the program is invalid. */
18363 nested_name_specifier))
18364 {
18367 "declaration of %qD in namespace %qD which does not "
18370 else
18372 "declaration of %qD in %qD which does not "
18376 }
18377 /* If that scope is the scope where the declaration is being placed
18378 the program is invalid. */
18382 {
18386 }
18387 }
18392 /* Consume the opening brace. */
18393 matching_braces braces;
18400 {
18404 }
18405 else
18406 {
18412 }
18416 /* If the next token is not '}', then there are some enumerators. */
18418 {
18422 }
18423 else
18426 /* Consume the final '}'. */
18432 }
18433 else
18434 {
18435 /* If a ';' follows, then it is an opaque-enum-specifier
18436 and additional restrictions apply. */
18438 {
18445 }
18446 }
18448 /* Look for trailing attributes to apply to this enumeration, and
18449 apply them if appropriate. */
18451 {
18454 trailing_attr,
18456 }
18458 /* Finish up the enumeration. */
18460 {
18465 }
18468 {
18470 {
18473 }
18475 {
18477 }
18478 }
18479 out:
18482 }
18484 /* Parse an enumerator-list. The enumerators all have the indicated
18485 TYPE.
18487 enumerator-list:
18488 enumerator-definition
18489 enumerator-list , enumerator-definition */
18491 static void
18493 {
18495 {
18496 /* Parse an enumerator-definition. */
18499 /* If the next token is not a ',', we've reached the end of
18500 the list. */
18503 /* Otherwise, consume the `,' and keep going. */
18505 /* If the next token is a `}', there is a trailing comma. */
18507 {
18512 }
18513 }
18514 }
18516 /* Parse an enumerator-definition. The enumerator has the indicated
18517 TYPE.
18519 enumerator-definition:
18520 enumerator
18521 enumerator = constant-expression
18523 enumerator:
18524 identifier
18526 GNU Extensions:
18528 enumerator-definition:
18529 enumerator attributes [opt]
18530 enumerator attributes [opt] = constant-expression */
18532 static void
18534 {
18535 tree identifier;
18536 tree value;
18537 location_t loc;
18539 /* Save the input location because we are interested in the location
18540 of the identifier and not the location of the explicit value. */
18543 /* Look for the identifier. */
18548 /* Parse any specified attributes. */
18551 /* If the next token is an '=', then there is an explicit value. */
18553 {
18554 /* Consume the `=' token. */
18556 /* Parse the value. */
18558 }
18559 else
18562 /* If we are processing a template, make sure the initializer of the
18563 enumerator doesn't contain any bare template parameter pack. */
18567 /* Create the enumerator. */
18569 }
18571 /* Parse a namespace-name.
18573 namespace-name:
18574 original-namespace-name
18575 namespace-alias
18577 Returns the NAMESPACE_DECL for the namespace. */
18579 static tree
18581 {
18582 tree identifier;
18583 tree namespace_decl;
18587 /* Get the name of the namespace. */
18592 /* Look up the identifier in the currently active scope. Look only
18593 for namespaces, due to:
18595 [basic.lookup.udir]
18597 When looking up a namespace-name in a using-directive or alias
18598 definition, only namespace names are considered.
18600 And:
18602 [basic.lookup.qual]
18604 During the lookup of a name preceding the :: scope resolution
18605 operator, object, function, and enumerator names are ignored.
18607 (Note that cp_parser_qualifying_entity only calls this
18608 function if the token after the name is the scope resolution
18609 operator.) */
18611 none_type,
18617 /* If it's not a namespace, issue an error. */
18620 {
18622 {
18623 auto_diagnostic_group d;
18629 }
18632 }
18635 }
18637 /* Parse a namespace-definition.
18639 namespace-definition:
18640 named-namespace-definition
18641 unnamed-namespace-definition
18643 named-namespace-definition:
18644 original-namespace-definition
18645 extension-namespace-definition
18647 original-namespace-definition:
18648 namespace identifier { namespace-body }
18650 extension-namespace-definition:
18651 namespace original-namespace-name { namespace-body }
18653 unnamed-namespace-definition:
18654 namespace { namespace-body } */
18656 static void
18658 {
18659 tree identifier;
18668 {
18671 }
18673 /* Look for the `namespace' keyword. */
18674 cp_token* token
18677 /* Parse any specified attributes before the identifier. */
18681 {
18685 {
18690 "standard attributes on namespaces must precede "
18693 /* Parse any attributes specified after the identifier. */
18695 }
18702 "nested namespace definitions only available with "
18705 /* Nested namespace names can create new namespaces (unlike
18706 other qualified-ids). */
18709 else
18712 }
18724 /* Start the namespace. */
18731 /* Look for the `{' to validate starting the namespace. */
18732 matching_braces braces;
18734 {
18735 /* Parse the body of the namespace. */
18738 /* Look for the final `}'. */
18740 }
18745 /* Pop the nested namespace definitions. */
18748 }
18750 /* Parse a namespace-body.
18752 namespace-body:
18753 declaration-seq [opt] */
18755 static void
18757 {
18759 }
18761 /* Parse a namespace-alias-definition.
18763 namespace-alias-definition:
18764 namespace identifier = qualified-namespace-specifier ; */
18766 static void
18768 {
18769 tree identifier;
18770 tree namespace_specifier;
18774 /* Look for the `namespace' keyword. */
18776 /* Look for the identifier. */
18780 /* Look for the `=' token. */
18783 {
18785 /* Skip the definition. */
18790 }
18792 /* Look for the qualified-namespace-specifier. */
18793 namespace_specifier
18795 /* Look for the `;' token. */
18798 /* Register the alias in the symbol table. */
18800 }
18802 /* Parse a qualified-namespace-specifier.
18804 qualified-namespace-specifier:
18805 :: [opt] nested-name-specifier [opt] namespace-name
18807 Returns a NAMESPACE_DECL corresponding to the specified
18808 namespace. */
18810 static tree
18812 {
18813 /* Look for the optional `::'. */
18817 /* Look for the optional nested-name-specifier. */
18825 }
18827 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18828 access declaration.
18830 using-declaration:
18831 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18832 using :: unqualified-id ;
18834 access-declaration:
18835 qualified-id ;
18837 */
18839 static bool
18842 {
18846 tree decl;
18847 tree identifier;
18848 tree qscope;
18853 {
18856 }
18857 else
18858 {
18859 /* Look for the `using' keyword. */
18862 again:
18863 /* Peek at the next token. */
18865 /* See if it's `typename'. */
18867 {
18868 /* Remember that we've seen it. */
18870 /* Consume the `typename' token. */
18872 }
18873 }
18875 /* Look for the optional global scope qualification. */
18876 global_scope_p
18881 /* If we saw `typename', or didn't see `::', then there must be a
18882 nested-name-specifier present. */
18884 {
18890 {
18893 }
18894 }
18895 /* Otherwise, we could be in either of the two productions. In that
18896 case, treat the nested-name-specifier as optional. */
18897 else
18909 /* Something has already gone wrong; there's no need to parse
18910 further. Since an error has occurred, the return value of
18911 cp_parser_parse_definitely will be false, as required. */
18915 /* Parse the unqualified-id. */
18923 {
18928 }
18930 {
18935 "pack expansion in using-declaration only available "
18938 }
18940 /* The function we call to handle a using-declaration is different
18941 depending on what scope we are in. */
18943 ;
18946 /* [namespace.udecl]
18948 A using declaration shall not name a template-id. */
18951 else
18952 {
18954 {
18955 /* Create the USING_DECL. */
18962 {
18965 }
18966 else
18967 /* Add it to the list of members in this class. */
18969 }
18970 else
18971 {
18973 identifier,
18980 {
18983 }
18986 else
18988 }
18989 }
18993 {
18997 "comma-separated list in using-declaration only available "
19000 }
19002 /* Look for the final `;'. */
19007 "access declarations are deprecated "
19008 "in favour of using-declarations; "
19012 }
19014 /* Parse an alias-declaration.
19016 alias-declaration:
19017 using identifier attribute-specifier-seq [opt] = type-id */
19019 static tree
19021 {
19023 location_t id_location;
19025 cp_decl_specifier_seq decl_specs;
19029 /* Look for the `using' keyword. */
19030 cp_token *using_token
19052 /* Now we are going to parse the type-id of the declaration. */
19054 /*
19055 [dcl.type]/3 says:
19057 "A type-specifier-seq shall not define a class or enumeration
19058 unless it appears in the type-id of an alias-declaration (7.1.3) that
19059 is not the declaration of a template-declaration."
19061 In other words, if we currently are in an alias template, the
19062 type-id should not define a type.
19064 So let's set parser->type_definition_forbidden_message in that
19065 case; cp_parser_check_type_definition (called by
19066 cp_parser_class_specifier) will then emit an error if a type is
19067 defined in the type-id. */
19069 {
19073 }
19077 /* Restore the error message if need be. */
19083 {
19086 }
19088 /* A typedef-name can also be introduced by an alias-declaration. The
19089 identifier following the using keyword becomes a typedef-name. It has
19090 the same semantics as if it were introduced by the typedef
19091 specifier. In particular, it does not define a new type and it shall
19092 not appear in the type-id. */
19097 {
19100 ds_attribute,
19101 attrs_token);
19102 }
19104 ds_typedef,
19105 using_token);
19107 ds_alias,
19108 using_token);
19114 id_location,
19125 else
19131 // Attach constraints to the alias declaration.
19133 {
19137 }
19144 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19145 added into the symbol table; otherwise, return the TYPE_DECL. */
19149 {
19153 }
19156 }
19158 /* Parse a using-directive.
19160 using-directive:
19161 using namespace :: [opt] nested-name-specifier [opt]
19162 namespace-name ; */
19164 static void
19166 {
19167 tree namespace_decl;
19168 tree attribs;
19170 /* Look for the `using' keyword. */
19172 /* And the `namespace' keyword. */
19174 /* Look for the optional `::' operator. */
19176 /* And the optional nested-name-specifier. */
19182 /* Get the namespace being used. */
19184 /* And any specified attributes. */
19187 /* Update the symbol table. */
19190 else
19193 /* Look for the final `;'. */
19195 }
19197 /* Parse an asm-definition.
19199 asm-definition:
19200 asm ( string-literal ) ;
19202 GNU Extension:
19204 asm-definition:
19205 asm volatile [opt] ( string-literal ) ;
19206 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19207 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19208 : asm-operand-list [opt] ) ;
19209 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19210 : asm-operand-list [opt]
19211 : asm-clobber-list [opt] ) ;
19212 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19213 : asm-clobber-list [opt]
19214 : asm-goto-list ) ; */
19216 static void
19218 {
19219 tree string;
19224 tree asm_stmt;
19232 /* Look for the `asm' keyword. */
19237 {
19240 }
19242 /* See if the next token is `volatile'. */
19245 {
19246 /* Remember that we saw the `volatile' keyword. */
19248 /* Consume the token. */
19250 }
19254 {
19255 /* Remember that we saw the `goto' keyword. */
19257 /* Consume the token. */
19259 }
19260 /* Look for the opening `('. */
19263 /* Look for the string. */
19266 {
19270 }
19272 /* If we're allowing GNU extensions, check for the extended assembly
19273 syntax. Unfortunately, the `:' tokens need not be separated by
19274 a space in C, and so, for compatibility, we tolerate that here
19275 too. Doing that means that we have to treat the `::' operator as
19276 two `:' tokens. */
19281 {
19286 /* The extended syntax was used. */
19289 /* Look for outputs. */
19291 {
19292 /* Consume the `:'. */
19294 /* Parse the output-operands. */
19296 CPP_COLON)
19298 CPP_SCOPE)
19300 CPP_CLOSE_PAREN)
19302 {
19306 }
19307 }
19308 /* If the next token is `::', there are no outputs, and the
19309 next token is the beginning of the inputs. */
19311 /* The inputs are coming next. */
19314 /* Look for inputs. */
19317 {
19318 /* Consume the `:' or `::'. */
19320 /* Parse the output-operands. */
19322 CPP_COLON)
19324 CPP_SCOPE)
19326 CPP_CLOSE_PAREN))
19327 {
19331 }
19332 }
19334 /* The clobbers are coming next. */
19337 /* Look for clobbers. */
19340 {
19342 /* Consume the `:' or `::'. */
19344 /* Parse the clobbers. */
19346 CPP_COLON)
19348 CPP_CLOSE_PAREN))
19350 }
19353 /* The labels are coming next. */
19356 /* Look for labels. */
19359 {
19361 /* Consume the `:' or `::'. */
19363 /* Parse the labels. */
19365 }
19369 }
19373 /* Look for the closing `)'. */
19381 {
19382 /* Create the ASM_EXPR. */
19384 {
19387 /* If the extended syntax was not used, mark the ASM_EXPR. */
19389 {
19395 }
19396 }
19397 else
19399 }
19400 }
19402 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19403 type that comes from the decl-specifier-seq. */
19405 static tree
19407 {
19410 {
19423 }
19426 }
19428 /* Declarators [gram.dcl.decl] */
19430 /* Parse an init-declarator.
19432 init-declarator:
19433 declarator initializer [opt]
19435 GNU Extension:
19437 init-declarator:
19438 declarator asm-specification [opt] attributes [opt] initializer [opt]
19440 function-definition:
19441 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19442 function-body
19443 decl-specifier-seq [opt] declarator function-try-block
19445 GNU Extension:
19447 function-definition:
19448 __extension__ function-definition
19450 TM Extension:
19452 function-definition:
19453 decl-specifier-seq [opt] declarator function-transaction-block
19455 The DECL_SPECIFIERS apply to this declarator. Returns a
19456 representation of the entity declared. If MEMBER_P is TRUE, then
19457 this declarator appears in a class scope. The new DECL created by
19458 this declarator is returned.
19460 The CHECKS are access checks that should be performed once we know
19461 what entity is being declared (and, therefore, what classes have
19462 befriended it).
19464 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19465 for a function-definition here as well. If the declarator is a
19466 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19467 be TRUE upon return. By that point, the function-definition will
19468 have been completely parsed.
19470 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19471 is FALSE.
19473 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19474 parsed declaration if it is an uninitialized single declarator not followed
19475 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19476 if present, will not be consumed. If returned, this declarator will be
19477 created with SD_INITIALIZED but will not call cp_finish_decl.
19479 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19480 and there is an initializer, the pointed location_t is set to the
19481 location of the '=' or `(', or '{' in C++11 token introducing the
19482 initializer. */
19484 static tree
19495 {
19499 tree prefix_attributes;
19501 tree asm_specification;
19502 tree initializer;
19504 tree scope;
19506 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19507 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19508 "(...)". */
19519 /* Gather the attributes that were provided with the
19520 decl-specifiers. */
19523 /* Assume that this is not the declarator for a function
19524 definition. */
19528 /* Default arguments are only permitted for function parameters. */
19532 /* Defer access checks while parsing the declarator; we cannot know
19533 what names are accessible until we know what is being
19534 declared. */
19539 /* Parse the declarator. */
19540 declarator
19545 /* Gather up the deferred checks. */
19550 /* If the DECLARATOR was erroneous, there's no need to go
19551 further. */
19555 /* Check that the number of template-parameter-lists is OK. */
19565 /* Figure out what scope the entity declared by the DECLARATOR is
19566 located in. `grokdeclarator' sometimes changes the scope, so
19567 we compute it now. */
19570 /* Perform any lookups in the declared type which were thought to be
19571 dependent, but are not in the scope of the declarator. */
19572 decl_specifiers->type
19575 /* If we're allowing GNU extensions, look for an
19576 asm-specification. */
19578 {
19579 /* Look for an asm-specification. */
19582 }
19583 else
19586 /* Look for attributes. */
19590 /* Peek at the next token. */
19596 {
19597 /* Handle C++17 deduction guides. */
19601 {
19609 {
19613 }
19614 }
19616 /* Check to see if the token indicates the start of a
19617 function-definition. */
19619 {
19621 {
19622 /* If a function-definition should not appear here, issue an
19623 error message. */
19627 }
19629 location_t func_brace_location
19632 /* Neither attributes nor an asm-specification are allowed
19633 on a function-definition. */
19636 "an asm-specification is not allowed "
19640 "attributes are not allowed "
19642 /* This is a function-definition. */
19645 /* Parse the function definition. */
19648 decl_specifiers,
19649 declarator,
19650 prefix_attributes);
19651 else
19652 decl =
19653 (cp_parser_function_definition_from_specifiers_and_declarator
19657 {
19658 /* This is where the prologue starts... */
19661 }
19664 }
19665 }
19667 {
19668 /* A non-template declaration involving a function parameter list
19669 containing an implicit template parameter will be made into a
19670 template. If the resulting declaration is not going to be an
19671 actual function then finish the template scope here to prevent it.
19672 An error message will be issued once we have a decl to talk about.
19674 FIXME probably we should do type deduction rather than create an
19675 implicit template, but the standard currently doesn't allow it. */
19678 }
19680 /* [dcl.dcl]
19682 Only in function declarations for constructors, destructors, type
19683 conversions, and deduction guides can the decl-specifier-seq be omitted.
19685 We explicitly postpone this check past the point where we handle
19686 function-definitions because we tolerate function-definitions
19687 that are missing their return types in some modes. */
19689 {
19693 }
19695 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19699 {
19710 {
19716 }
19717 }
19718 else
19719 {
19720 /* If the init-declarator isn't initialized and isn't followed by a
19721 `,' or `;', it's not a valid init-declarator. */
19724 {
19727 else
19728 {
19732 }
19733 }
19736 }
19738 /* Because start_decl has side-effects, we should only call it if we
19739 know we're going ahead. By this point, we know that we cannot
19740 possibly be looking at any other construct. */
19743 /* Enter the newly declared entry in the symbol table. If we're
19744 processing a declaration in a class-specifier, we wait until
19745 after processing the initializer. */
19747 {
19755 /* Adjust location of decl if declarator->id_loc is more appropriate:
19756 set, and decl wasn't merged with another decl, in which case its
19757 location would be different from input_location, and more accurate. */
19762 }
19764 /* Enter the SCOPE. That way unqualified names appearing in the
19765 initializer will be looked up in SCOPE. */
19768 /* Perform deferred access control checks, now that we know in which
19769 SCOPE the declared entity resides. */
19771 {
19774 /* If the entity being declared is a function, pretend that we
19775 are in its scope. If it is a `friend', it may have access to
19776 things that would not otherwise be accessible. */
19778 {
19781 }
19783 /* Perform access checks for template parameters. */
19786 /* Perform the access control checks for the declarator and the
19787 decl-specifiers. */
19790 /* Restore the saved value. */
19793 }
19795 /* Parse the initializer. */
19800 {
19802 {
19805 else
19806 {
19807 /* If the declaration was erroneous, we don't really
19808 know what the user intended, so just silently
19809 consume the initializer. */
19816 }
19817 }
19818 else
19819 {
19820 /* We want to record the extra mangling scope for in-class
19821 initializers of class members and initializers of static data
19822 member templates. The former involves deferring
19823 parsing of the initializer until end of class as with default
19824 arguments. So right here we only handle the latter. */
19834 }
19835 }
19837 /* The old parser allows attributes to appear after a parenthesized
19838 initializer. Mark Mitchell proposed removing this functionality
19839 on the GCC mailing lists on 2002-08-13. This parser accepts the
19840 attributes -- but ignores them. Made a permerror in GCC 8. */
19846 {
19849 {
19853 }
19854 }
19856 /* And now complain about a non-function implicit template. */
19861 /* For an in-class declaration, use `grokfield' to create the
19862 declaration. */
19864 {
19866 {
19869 }
19878 }
19880 /* Finish processing the declaration. But, skip member
19881 declarations. */
19883 {
19886 asm_specification,
19887 /* If the initializer is in parentheses, then this is
19888 a direct-initialization, which means that an
19889 `explicit' constructor is OK. Otherwise, an
19890 `explicit' constructor cannot be used. */
19893 }
19896 /* Core issue #226 (C++0x only): A default template-argument
19897 shall not be specified in a friend class template
19898 declaration. */
19907 {
19910 else
19912 }
19919 }
19921 /* Parse a declarator.
19923 declarator:
19924 direct-declarator
19925 ptr-operator declarator
19927 abstract-declarator:
19928 ptr-operator abstract-declarator [opt]
19929 direct-abstract-declarator
19931 GNU Extensions:
19933 declarator:
19934 attributes [opt] direct-declarator
19935 attributes [opt] ptr-operator declarator
19937 abstract-declarator:
19938 attributes [opt] ptr-operator abstract-declarator [opt]
19939 attributes [opt] direct-abstract-declarator
19941 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19942 detect constructors, destructors, deduction guides, or conversion operators.
19943 It is set to -1 if the declarator is a name, and +1 if it is a
19944 function. Otherwise it is set to zero. Usually you just want to
19945 test for >0, but internally the negative value is used.
19947 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19948 a decl-specifier-seq unless it declares a constructor, destructor,
19949 or conversion. It might seem that we could check this condition in
19950 semantic analysis, rather than parsing, but that makes it difficult
19951 to handle something like `f()'. We want to notice that there are
19952 no decl-specifiers, and therefore realize that this is an
19953 expression, not a declaration.)
19955 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19956 the declarator is a direct-declarator of the form "(...)".
19958 MEMBER_P is true iff this declarator is a member-declarator.
19960 FRIEND_P is true iff this declarator is a friend. */
19964 cp_parser_declarator_kind dcl_kind,
19968 {
19971 cp_cv_quals cv_quals;
19972 tree class_type;
19975 /* Assume this is not a constructor, destructor, or type-conversion
19976 operator. */
19983 /* Check for the ptr-operator production. */
19985 /* Parse the ptr-operator. */
19991 /* If that worked, then we have a ptr-operator. */
19993 {
19994 /* If a ptr-operator was found, then this declarator was not
19995 parenthesized. */
19998 /* The dependent declarator is optional if we are parsing an
19999 abstract-declarator. */
20003 /* Parse the dependent declarator. */
20008 friend_p);
20010 /* If we are parsing an abstract-declarator, we must handle the
20011 case where the dependent declarator is absent. */
20016 declarator = cp_parser_make_indirect_declarator
20018 }
20019 /* Everything else is a direct-declarator. */
20020 else
20021 {
20024 CPP_OPEN_PAREN);
20026 ctor_dtor_or_conv_p,
20028 }
20033 }
20035 /* Parse a direct-declarator or direct-abstract-declarator.
20037 direct-declarator:
20038 declarator-id
20039 direct-declarator ( parameter-declaration-clause )
20040 cv-qualifier-seq [opt]
20041 ref-qualifier [opt]
20042 exception-specification [opt]
20043 direct-declarator [ constant-expression [opt] ]
20044 ( declarator )
20046 direct-abstract-declarator:
20047 direct-abstract-declarator [opt]
20048 ( parameter-declaration-clause )
20049 cv-qualifier-seq [opt]
20050 ref-qualifier [opt]
20051 exception-specification [opt]
20052 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20053 ( abstract-declarator )
20055 Returns a representation of the declarator. DCL_KIND is
20056 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20057 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20058 we are parsing a direct-declarator. It is
20059 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20060 of ambiguity we prefer an abstract declarator, as per
20061 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20062 as for cp_parser_declarator. */
20066 cp_parser_declarator_kind dcl_kind,
20069 {
20080 {
20081 /* Peek at the next token. */
20084 {
20085 /* This is either a parameter-declaration-clause, or a
20086 parenthesized declarator. When we know we are parsing a
20087 named declarator, it must be a parenthesized declarator
20088 if FIRST is true. For instance, `(int)' is a
20089 parameter-declaration-clause, with an omitted
20090 direct-abstract-declarator. But `((*))', is a
20091 parenthesized abstract declarator. Finally, when T is a
20092 template parameter `(T)' is a
20093 parameter-declaration-clause, and not a parenthesized
20094 named declarator.
20096 We first try and parse a parameter-declaration-clause,
20097 and then try a nested declarator (if FIRST is true).
20099 It is not an error for it not to be a
20100 parameter-declaration-clause, even when FIRST is
20101 false. Consider,
20103 int i (int);
20104 int i (3);
20106 The first is the declaration of a function while the
20107 second is the definition of a variable, including its
20108 initializer.
20110 Having seen only the parenthesis, we cannot know which of
20111 these two alternatives should be selected. Even more
20112 complex are examples like:
20114 int i (int (a));
20115 int i (int (3));
20117 The former is a function-declaration; the latter is a
20118 variable initialization.
20120 Thus again, we try a parameter-declaration-clause, and if
20121 that fails, we back out and return. */
20124 {
20125 tree params;
20130 /* In a member-declarator, the only valid interpretation
20131 of a parenthesis is the start of a
20132 parameter-declaration-clause. (It is invalid to
20133 initialize a static data member with a parenthesized
20134 initializer; only the "=" form of initialization is
20135 permitted.) */
20139 /* Consume the `('. */
20140 matching_parens parens;
20143 {
20144 /* If this is going to be an abstract declarator, we're
20145 in a declarator and we can't have default args. */
20148 }
20152 /* Parse the parameter-declaration-clause. */
20155 /* Consume the `)'. */
20158 /* If all went well, parse the cv-qualifier-seq,
20159 ref-qualifier and the exception-specification. */
20161 {
20162 cp_cv_quals cv_quals;
20163 cp_virt_specifiers virt_specifiers;
20164 cp_ref_qualifier ref_qual;
20165 tree exception_specification;
20166 tree late_return;
20167 tree attrs;
20177 /* Parse the cv-qualifier-seq. */
20179 /* Parse the ref-qualifier. */
20181 /* Parse the tx-qualifier. */
20183 /* And the exception-specification. */
20184 exception_specification
20189 /* In here, we handle cases where attribute is used after
20190 the function declaration. For example:
20191 void func (int x) __attribute__((vector(..))); */
20194 late_return = (cp_parser_late_return_type_opt
20198 /* Parse the virt-specifier-seq. */
20201 /* Create the function-declarator. */
20203 params,
20204 cv_quals,
20205 virt_specifiers,
20206 ref_qual,
20207 tx_qual,
20208 exception_specification,
20209 late_return,
20210 requires_clause);
20213 /* Any subsequent parameter lists are to do with
20214 return type, so are not those of the declared
20215 function. */
20217 }
20219 /* Remove the function parms from scope. */
20223 /* Repeat the main loop. */
20225 }
20227 /* If this is the first, we can try a parenthesized
20228 declarator. */
20230 {
20237 /* Consume the `('. */
20238 matching_parens parens;
20240 /* Parse the nested declarator. */
20243 declarator
20249 /* Expect a `)'. */
20257 }
20258 /* Otherwise, we must be done. */
20259 else
20261 }
20265 {
20266 /* Parse an array-declarator. */
20276 /* Consume the `['. */
20278 /* Peek at the next token. */
20280 /* If the next token is `]', then there is no
20281 constant-expression. */
20283 {
20285 bounds
20295 {
20296 /* Normally, the array bound must be an integral constant
20297 expression. However, as an extension, we allow VLAs
20298 in function scopes as long as they aren't part of a
20299 parameter declaration. */
20303 }
20306 {
20307 /* Remember this wasn't a constant-expression. */
20310 }
20311 }
20312 else
20314 /* Look for the closing `]'. */
20316 {
20319 }
20324 }
20326 {
20327 {
20328 tree qualifying_scope;
20329 tree unqualified_name;
20330 tree attrs;
20331 special_function_kind sfk;
20336 /* Parse a declarator-id */
20339 {
20342 /* If we see an ellipsis, we should be looking at a
20343 parameter pack. */
20345 {
20346 /* Consume the `...' */
20350 }
20351 }
20354 unqualified_name
20358 {
20362 {
20363 /* Check whether an error occurred. */
20366 /* We already consumed the ellipsis to mark a
20367 parameter pack, but we have no way to report it,
20368 so abort the tentative parse. We will be exiting
20369 immediately anyway. */
20371 }
20372 else
20378 && (qualifying_scope
20380 {
20383 }
20384 }
20389 {
20394 }
20400 {
20401 /* In the declaration of a member of a template class
20402 outside of the class itself, the SCOPE will sometimes
20403 be a TYPENAME_TYPE. For example, given:
20405 template <typename T>
20406 int S<T>::R::i = 3;
20408 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20409 this context, we must resolve S<T>::R to an ordinary
20410 type, rather than a typename type.
20412 The reason we normally avoid resolving TYPENAME_TYPEs
20413 is that a specialization of `S' might render
20414 `S<T>::R' not a type. However, if `S' is
20415 specialized, then this `i' will not be used, so there
20416 is no harm in resolving the types here. */
20417 tree type;
20419 /* Resolve the TYPENAME_TYPE. */
20422 /* If that failed, the declarator is invalid. */
20424 {
20427 "cannot define member of dependent typedef "
20429 else
20434 }
20436 }
20441 {
20442 tree class_type;
20447 else
20451 {
20455 {
20456 /* We do not attempt to print the declarator
20457 here because we do not have enough
20458 information about its original syntactic
20459 form. */
20463 }
20466 {
20470 "use %<%T::%D%> instead of %<%T::%D%> to "
20472 class_type,
20477 }
20479 }
20482 {
20489 for an unnamed type, even if the type
20490 got a name for linkage purposes. */
20492 /* Handle correctly (c++/19200):
20494 struct S {
20495 struct T{};
20496 friend void S(T);
20497 };
20499 and also:
20501 namespace N {
20502 void S();
20503 }
20505 struct S {
20506 friend void N::S();
20507 }; */
20510 class_type))
20519 }
20520 }
20522 unqualified_name,
20523 sfk);
20530 }
20532 handle_declarator:;
20535 {
20536 /* Any names that appear after the declarator-id for a
20537 member are looked up in the containing scope. */
20539 {
20540 /* But declarations with qualified-ids can't appear in a
20541 function. */
20545 }
20547 }
20551 /* Default args are only allowed on function
20552 declarations. */
20554 else
20558 }
20559 /* We're done. */
20560 else
20562 }
20564 /* For an abstract declarator, we might wind up with nothing at this
20565 point. That's an error; the declarator is not optional. */
20569 {
20570 /* Record overly parenthesized declarator so we can give a
20571 diagnostic about confusing decl/expr disambiguation. */
20573 {
20574 /* If the open and close parens are on different lines, this
20575 is probably a formatting thing, so ignore. */
20580 }
20583 }
20585 /* If we entered a scope, we must exit it now. */
20593 }
20595 /* Parse a ptr-operator.
20597 ptr-operator:
20598 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20599 * cv-qualifier-seq [opt]
20600 &
20601 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20602 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20604 GNU Extension:
20606 ptr-operator:
20607 & cv-qualifier-seq [opt]
20609 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20610 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20611 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20612 filled in with the TYPE containing the member. *CV_QUALS is
20613 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20614 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20615 Note that the tree codes returned by this function have nothing
20616 to do with the types of trees that will be eventually be created
20617 to represent the pointer or reference type being parsed. They are
20618 just constants with suggestive names. */
20619 static enum tree_code
20624 {
20629 /* Assume that it's not a pointer-to-member. */
20631 /* And that there are no cv-qualifiers. */
20634 /* Peek at the next token. */
20637 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20647 {
20648 /* Consume the `*', `&' or `&&'. */
20651 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20652 `&', if we are allowing GNU extensions. (The only qualifier
20653 that can legally appear after `&' is `restrict', but that is
20654 enforced during semantic analysis. */
20662 }
20663 else
20664 {
20665 /* Try the pointer-to-member case. */
20667 /* Look for the optional `::' operator. */
20670 /* Look for the nested-name specifier. */
20677 /* If we found it, and the next token is a `*', then we are
20678 indeed looking at a pointer-to-member operator. */
20681 {
20682 /* Indicate that the `*' operator was used. */
20690 else
20691 {
20692 /* The type of which the member is a member is given by the
20693 current SCOPE. */
20695 /* The next name will not be qualified. */
20699 /* Look for optional c++11 attributes. */
20703 /* Look for the optional cv-qualifier-seq. */
20705 }
20706 }
20707 /* If that didn't work we don't have a ptr-operator. */
20710 }
20713 }
20715 /* Parse an (optional) cv-qualifier-seq.
20717 cv-qualifier-seq:
20718 cv-qualifier cv-qualifier-seq [opt]
20720 cv-qualifier:
20721 const
20722 volatile
20724 GNU Extension:
20726 cv-qualifier:
20727 __restrict__
20729 Returns a bitmask representing the cv-qualifiers. */
20731 static cp_cv_quals
20733 {
20737 {
20739 cp_cv_quals cv_qualifier;
20741 /* Peek at the next token. */
20743 /* See if it's a cv-qualifier. */
20745 {
20761 }
20767 {
20772 }
20773 else
20774 {
20777 }
20778 }
20781 }
20783 /* Parse an (optional) ref-qualifier
20785 ref-qualifier:
20786 &
20787 &&
20789 Returns cp_ref_qualifier representing ref-qualifier. */
20791 static cp_ref_qualifier
20793 {
20796 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20801 {
20806 {
20818 }
20823 {
20826 }
20827 else
20828 {
20831 }
20832 }
20835 }
20837 /* Parse an optional tx-qualifier.
20839 tx-qualifier:
20840 transaction_safe
20841 transaction_safe_dynamic */
20843 static tree
20845 {
20848 {
20853 {
20857 {
20860 {
20863 }
20864 else
20866 }
20867 }
20868 }
20870 }
20872 /* Parse an (optional) virt-specifier-seq.
20874 virt-specifier-seq:
20875 virt-specifier virt-specifier-seq [opt]
20877 virt-specifier:
20878 override
20879 final
20881 Returns a bitmask representing the virt-specifiers. */
20883 static cp_virt_specifiers
20885 {
20889 {
20891 cp_virt_specifiers virt_specifier;
20893 /* Peek at the next token. */
20895 /* See if it's a virt-specifier-qualifier. */
20899 {
20902 }
20904 {
20907 }
20909 {
20911 }
20912 else
20916 {
20921 }
20922 else
20923 {
20926 }
20927 }
20929 }
20931 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20932 is in scope even though it isn't real. */
20934 void
20936 {
20937 tree this_parm;
20940 {
20941 /* We don't clear this between NSDMIs. Is it already what we want? */
20948 }
20951 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20953 current_class_ref
20956 }
20958 /* Return true iff our current scope is a non-static data member
20959 initializer. */
20961 bool
20963 {
20964 /* We recognize NSDMI context by the context-less 'this' pointer set up
20965 by the function above. */
20971 }
20973 /* Parse a late-specified return type, if any. This is not a separate
20974 non-terminal, but part of a function declarator, which looks like
20976 -> trailing-type-specifier-seq abstract-declarator(opt)
20978 Returns the type indicated by the type-id.
20980 In addition to this, parse any queued up #pragma omp declare simd
20981 clauses, and #pragma acc routine clauses.
20983 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20984 function. */
20986 static tree
20989 {
20993 && declarator
20997 && declarator
21000 /* Peek at the next token. */
21002 /* A late-specified return type is indicated by an initial '->'. */
21013 {
21014 /* DR 1207: 'this' is in scope in the trailing return type. */
21016 }
21019 {
21020 /* Consume the ->. */
21024 }
21026 /* Function declarations may be followed by a trailing
21027 requires-clause. */
21031 declarator->attributes
21035 declarator->attributes
21040 {
21043 }
21046 }
21048 /* Parse a declarator-id.
21050 declarator-id:
21051 id-expression
21052 :: [opt] nested-name-specifier [opt] type-name
21054 In the `id-expression' case, the value returned is as for
21055 cp_parser_id_expression if the id-expression was an unqualified-id.
21056 If the id-expression was a qualified-id, then a SCOPE_REF is
21057 returned. The first operand is the scope (either a NAMESPACE_DECL
21058 or TREE_TYPE), but the second is still just a representation of an
21059 unqualified-id. */
21061 static tree
21063 {
21064 tree id;
21065 /* The expression must be an id-expression. Assume that qualified
21066 names are the names of types so that:
21068 template <class T>
21069 int S<T>::R::i = 3;
21071 will work; we must treat `S<T>::R' as the name of a type.
21072 Similarly, assume that qualified names are templates, where
21073 required, so that:
21075 template <class T>
21076 int S<T>::R<T>::i = 3;
21078 will work, too. */
21084 optional_p);
21088 }
21090 /* Parse a type-id.
21092 type-id:
21093 type-specifier-seq abstract-declarator [opt]
21095 Returns the TYPE specified. */
21097 static tree
21100 {
21101 cp_decl_specifier_seq type_specifier_seq;
21104 /* Parse the type-specifier-seq. */
21106 is_trailing_return,
21111 /* A bare template name as a template argument is a template template
21112 argument, not a placeholder, so fail parsing it as a type argument. */
21113 {
21117 }
21121 /* There might or might not be an abstract declarator. */
21123 /* Look for the declarator. */
21124 abstract_declarator
21129 /* Check to see if there really was a declarator. */
21134 /* The concepts TS allows 'auto' as a type-id. */
21136 /* None of the valid uses of 'auto' in C++14 involve the type-id
21137 nonterminal, but it is valid in a trailing-return-type. */
21140 {
21141 /* A type-id with type 'auto' is only ok if the abstract declarator
21142 is a function declarator with a late-specified return type.
21144 A type-id with 'auto' is also valid in a trailing-return-type
21145 in a compound-requirement. */
21152 else
21153 {
21156 {
21158 auto_node);
21160 tmpl);
21161 }
21162 else
21165 }
21166 }
21169 is_template_arg);
21170 }
21172 static tree
21174 {
21176 }
21178 static tree
21180 {
21181 tree r;
21183 parser->type_definition_forbidden_message
21188 {
21191 }
21193 }
21195 static tree
21197 {
21199 }
21201 /* Parse a type-specifier-seq.
21203 type-specifier-seq:
21204 type-specifier type-specifier-seq [opt]
21206 GNU extension:
21208 type-specifier-seq:
21209 attributes type-specifier-seq [opt]
21211 If IS_DECLARATION is true, we are at the start of a "condition" or
21212 exception-declaration, so we might be followed by a declarator-id.
21214 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21215 i.e. we've just seen "->".
21217 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21219 static void
21224 {
21229 /* Clear the TYPE_SPECIFIER_SEQ. */
21232 /* In the context of a trailing return type, enum E { } is an
21233 elaborated-type-specifier followed by a function-body, not an
21234 enum-specifier. */
21238 /* Parse the type-specifiers and attributes. */
21240 {
21241 tree type_specifier;
21244 /* Check for attributes first. */
21246 {
21247 type_specifier_seq->attributes
21251 }
21253 /* record the token of the beginning of the type specifier seq,
21254 for error reporting purposes*/
21258 /* Look for the type-specifier. */
21260 flags,
21261 type_specifier_seq,
21263 NULL,
21266 {
21267 /* If the first type-specifier could not be found, this is not a
21268 type-specifier-seq at all. */
21270 {
21271 /* Set in_declarator_p to avoid skipping to the semicolon. */
21283 }
21284 /* If subsequent type-specifiers could not be found, the
21285 type-specifier-seq is complete. */
21287 }
21290 /* The standard says that a condition can be:
21292 type-specifier-seq declarator = assignment-expression
21294 However, given:
21296 struct S {};
21297 if (int S = ...)
21299 we should treat the "S" as a declarator, not as a
21300 type-specifier. The standard doesn't say that explicitly for
21301 type-specifier-seq, but it does say that for
21302 decl-specifier-seq in an ordinary declaration. Perhaps it
21303 would be clearer just to allow a decl-specifier-seq here, and
21304 then add a semantic restriction that if any decl-specifiers
21305 that are not type-specifiers appear, the program is invalid. */
21308 }
21309 }
21311 /* Return whether the function currently being declared has an associated
21312 template parameter list. */
21314 static bool
21316 {
21329 }
21331 /* Parse a parameter-declaration-clause.
21333 parameter-declaration-clause:
21334 parameter-declaration-list [opt] ... [opt]
21335 parameter-declaration-list , ...
21337 Returns a representation for the parameter declarations. A return
21338 value of NULL indicates a parameter-declaration-clause consisting
21339 only of an ellipsis. */
21341 static tree
21343 {
21344 tree parameters;
21352 && !processing_template_parmlist
21353 && !processing_explicit_instantiation
21354 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21355 actual function or a random abstract declarator. */
21361 /* Peek at the next token. */
21363 /* Check for trivial parameter-declaration-clauses. */
21365 {
21366 /* Consume the `...' token. */
21369 }
21371 /* There are no parameters. */
21372 {
21373 #ifdef SYSTEM_IMPLICIT_EXTERN_C
21378 else
21379 #endif
21381 }
21382 /* Check for `(void)', too, which is a special case. */
21386 {
21387 /* Consume the `void' token. */
21389 /* There are no parameters. */
21391 }
21393 /* Parse the parameter-declaration-list. */
21395 /* If a parse error occurred while parsing the
21396 parameter-declaration-list, then the entire
21397 parameter-declaration-clause is erroneous. */
21401 /* Peek at the next token. */
21403 /* If it's a `,', the clause should terminate with an ellipsis. */
21405 {
21406 /* Consume the `,'. */
21408 /* Expect an ellipsis. */
21409 ellipsis_p
21411 }
21412 /* It might also be `...' if the optional trailing `,' was
21413 omitted. */
21415 {
21416 /* Consume the `...' token. */
21418 /* And remember that we saw it. */
21420 }
21421 else
21424 /* Finish the parameter list. */
21429 }
21431 /* Parse a parameter-declaration-list.
21433 parameter-declaration-list:
21434 parameter-declaration
21435 parameter-declaration-list , parameter-declaration
21437 Returns a representation of the parameter-declaration-list, as for
21438 cp_parser_parameter_declaration_clause. However, the
21439 `void_list_node' is never appended to the list. */
21441 static tree
21443 {
21449 /* The special considerations that apply to a function within an
21450 unbraced linkage specifications do not apply to the parameters
21451 to the function. */
21452 saved_in_unbraced_linkage_specification_p
21456 /* Look for more parameters. */
21458 {
21463 /* Parse the parameter. */
21464 parameter
21469 /* We don't know yet if the enclosing context is deprecated, so wait
21470 and warn in grokparms if appropriate. */
21474 {
21477 PARM,
21482 }
21486 /* If a parse error occurred parsing the parameter declaration,
21487 then the entire parameter-declaration-list is erroneous. */
21489 {
21492 }
21502 {
21506 }
21508 /* Add the new parameter to the list. */
21512 /* Peek at the next token. */
21515 /* These are for Objective-C++ */
21518 /* The parameter-declaration-list is complete. */
21521 {
21524 /* Peek at the next token. */
21526 /* If it's an ellipsis, then the list is complete. */
21529 /* Otherwise, there must be more parameters. Consume the
21530 `,'. */
21532 /* When parsing something like:
21534 int i(float f, double d)
21536 we can tell after seeing the declaration for "f" that we
21537 are not looking at an initialization of a variable "i",
21538 but rather at the declaration of a function "i".
21540 Due to the fact that the parsing of template arguments
21541 (as specified to a template-id) requires backtracking we
21542 cannot use this technique when inside a template argument
21543 list. */
21547 /* However, a parameter-declaration of the form
21548 "float(f)" (which is a valid declaration of a
21549 parameter "f") can also be interpreted as an
21550 expression (the conversion of "f" to "float"). */
21553 }
21554 else
21555 {
21563 }
21564 }
21566 parser->in_unbraced_linkage_specification_p
21569 /* Reset implicit_template_scope if we are about to leave the function
21570 parameter list that introduced it. Note that for out-of-line member
21571 definitions, there will be one or more class scopes before we get to
21572 the template parameter scope. */
21576 {
21580 {
21583 }
21584 }
21587 }
21589 /* Parse a parameter declaration.
21591 parameter-declaration:
21592 decl-specifier-seq ... [opt] declarator
21593 decl-specifier-seq declarator = assignment-expression
21594 decl-specifier-seq ... [opt] abstract-declarator [opt]
21595 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21597 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21598 declares a template parameter. (In that case, a non-nested `>'
21599 token encountered during the parsing of the assignment-expression
21600 is not interpreted as a greater-than operator.)
21602 Returns a representation of the parameter, or NULL if an error
21603 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21604 true iff the declarator is of the form "(p)". */
21610 {
21612 cp_decl_specifier_seq decl_specifiers;
21614 tree default_argument;
21619 /* In a template parameter, `>' is not an operator.
21621 [temp.param]
21623 When parsing a default template-argument for a non-type
21624 template-parameter, the first non-nested `>' is taken as the end
21625 of the template parameter-list rather than a greater-than
21626 operator. */
21628 /* Type definitions may not appear in parameter types. */
21630 parser->type_definition_forbidden_message
21637 /* Parse the declaration-specifiers. */
21640 CP_PARSER_FLAGS_NONE,
21644 /* Complain about missing 'typename' or other invalid type names. */
21649 /* If an error occurred, there's no reason to attempt to parse the
21650 rest of the declaration. */
21652 {
21655 }
21657 /* Peek at the next token. */
21660 /* If the next token is a `)', `,', `=', `>', or `...', then there
21661 is no declarator. However, when variadic templates are enabled,
21662 there may be a declarator following `...'. */
21667 {
21671 }
21672 /* Otherwise, there should be a declarator. */
21673 else
21674 {
21678 /* After seeing a decl-specifier-seq, if the next token is not a
21679 "(", there is no possibility that the code is a valid
21680 expression. Therefore, if parsing tentatively, we commit at
21681 this point. */
21683 /* In an expression context, having seen:
21685 (int((char ...
21687 we cannot be sure whether we are looking at a
21688 function-type (taking a "char" as a parameter) or a cast
21689 of some object of type "char" to "int". */
21695 /* Parse the declarator. */
21698 CP_PARSER_DECLARATOR_EITHER,
21700 parenthesized_p,
21704 /* After the declarator, allow more attributes. */
21705 decl_specifiers.attributes
21709 /* If the declarator is a template parameter pack, remember that and
21710 clear the flag in the declarator itself so we don't get errors
21711 from grokdeclarator. */
21713 {
21716 }
21717 }
21719 /* If the next token is an ellipsis, and we have not seen a declarator
21720 name, and if either the type of the declarator contains parameter
21721 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21722 for, eg, abbreviated integral type names), then we actually have a
21723 parameter pack expansion expression. Otherwise, leave the ellipsis
21724 for a C-style variadic function. */
21727 /* If a function parameter pack was specified and an implicit template
21728 parameter was introduced during cp_parser_parameter_declaration,
21729 change any implicit parameters introduced into packs. */
21734 {
21742 }
21745 {
21756 {
21757 /* Consume the `...'. */
21761 /* Build a pack expansion type */
21766 else
21768 }
21769 }
21771 /* The restriction on defining new types applies only to the type
21772 of the parameter, not to the default argument. */
21775 /* If the next token is `=', then process a default argument. */
21777 {
21780 /* If we are defining a class, then the tokens that make up the
21781 default argument must be saved and processed later. */
21787 // A constrained-type-specifier may declare a type template-parameter.
21789 default_argument
21792 // A constrained-type-specifier may declare a template-template-parameter.
21794 default_argument
21797 /* Outside of a class definition, we can just parse the
21798 assignment-expression. */
21799 else
21800 default_argument
21804 {
21806 "default arguments are only "
21808 }
21810 || template_parameter_pack_p
21813 {
21814 /* Find the name of the parameter pack. */
21821 template_parm_p
21827 else
21829 template_parm_p
21836 }
21837 }
21838 else
21841 /* Generate a location for the parameter, ranging from the start of the
21842 initial token to the end of the final token (using input_location for
21843 the latter, set up by cp_lexer_set_source_position_from_token when
21844 consuming tokens).
21846 If we have a identifier, then use it for the caret location, e.g.
21848 extern int callee (int one, int (*two)(int, int), float three);
21849 ~~~~~~^~~~~~~~~~~~~~
21851 otherwise, reuse the start location for the caret location e.g.:
21853 extern int callee (int one, int (*)(int, int), float three);
21854 ^~~~~~~~~~~~~~~~~
21856 */
21862 input_location);
21865 declarator,
21866 default_argument,
21867 param_loc,
21868 template_parameter_pack_p);
21869 }
21871 /* Parse a default argument and return it.
21873 TEMPLATE_PARM_P is true if this is a default argument for a
21874 non-type template parameter. */
21875 static tree
21877 {
21883 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21884 set correctly. */
21887 /* Local variable names (and the `this' keyword) may not
21888 appear in a default argument. */
21891 /* Parse the assignment-expression. */
21896 /* The "this" pointer is not valid in a default argument. */
21898 {
21903 }
21904 default_argument
21906 /* Restore the "this" pointer. */
21908 {
21911 }
21920 }
21922 /* Parse a function-body.
21924 function-body:
21925 compound_statement */
21927 static void
21929 {
21933 }
21935 /* Parse a ctor-initializer-opt followed by a function-body. Return
21936 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21937 is true we are parsing a function-try-block. */
21939 static void
21942 {
21949 /* Begin the function body. */
21951 /* Parse the optional ctor-initializer. */
21954 /* If we're parsing a constexpr constructor definition, we need
21955 to check that the constructor body is indeed empty. However,
21956 before we get to cp_parser_function_body lot of junk has been
21957 generated, so we can't just check that we have an empty block.
21958 Rather we take a snapshot of the outermost block, and check whether
21959 cp_parser_function_body changed its state. */
21961 {
21965 }
21966 /* Parse the function-body. */
21970 /* Finish the function body. */
21972 }
21974 /* Parse an initializer.
21976 initializer:
21977 = initializer-clause
21978 ( expression-list )
21980 Returns an expression representing the initializer. If no
21981 initializer is present, NULL_TREE is returned.
21983 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21984 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21985 set to TRUE if there is no initializer present. If there is an
21986 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21987 is set to true; otherwise it is set to false. */
21989 static tree
21992 {
21994 tree init;
21996 /* Peek at the next token. */
21999 /* Let our caller know whether or not this initializer was
22000 parenthesized. */
22002 /* Assume that the initializer is constant. */
22006 {
22007 /* Consume the `='. */
22009 /* Parse the initializer-clause. */
22011 }
22013 {
22018 non_constant_p);
22023 }
22025 {
22030 }
22031 else
22032 {
22033 /* Anything else is an error. */
22036 }
22042 }
22044 /* Parse an initializer-clause.
22046 initializer-clause:
22047 assignment-expression
22048 braced-init-list
22050 Returns an expression representing the initializer.
22052 If the `assignment-expression' production is used the value
22053 returned is simply a representation for the expression.
22055 Otherwise, calls cp_parser_braced_list. */
22057 static cp_expr
22059 {
22060 cp_expr initializer;
22062 /* Assume the expression is constant. */
22065 /* If it is not a `{', then we are looking at an
22066 assignment-expression. */
22068 {
22069 initializer
22072 non_constant_p);
22073 }
22074 else
22078 }
22080 /* Parse a brace-enclosed initializer list.
22082 braced-init-list:
22083 { initializer-list , [opt] }
22084 { designated-initializer-list , [opt] }
22085 { }
22087 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22088 the elements of the initializer-list (or NULL, if the last
22089 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22090 NULL_TREE. There is no way to detect whether or not the optional
22091 trailing `,' was provided. NON_CONSTANT_P is as for
22092 cp_parser_initializer. */
22094 static cp_expr
22096 {
22097 tree initializer;
22100 /* Consume the `{' token. */
22101 matching_braces braces;
22103 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22105 /* If it's not a `}', then there is a non-trivial initializer. */
22107 {
22108 /* Parse the initializer list. */
22111 /* A trailing `,' token is allowed. */
22114 }
22115 else
22117 /* Now, there should be a trailing `}'. */
22123 /* Build a location of the form:
22124 { ... }
22125 ^~~~~~~
22126 with caret==start at the open brace, finish at the close brace. */
22130 }
22132 /* Consume tokens up to, and including, the next non-nested closing `]'.
22133 Returns true iff we found a closing `]'. */
22135 static bool
22137 {
22141 {
22145 {
22148 /* If we've run out of tokens, then there is no closing `]'. */
22157 {
22160 }
22165 }
22167 /* Consume the token. */
22169 }
22170 }
22172 /* Return true if we are looking at an array-designator, false otherwise. */
22174 static bool
22176 {
22177 /* Consume the `['. */
22182 /* Skip tokens until the next token is a closing square bracket.
22183 If we find the closing `]', and the next token is a `=', then
22184 we are looking at an array designator. */
22185 bool array_designator_p
22189 /* Roll back the tokens we skipped. */
22193 }
22195 /* Parse an initializer-list.
22197 initializer-list:
22198 initializer-clause ... [opt]
22199 initializer-list , initializer-clause ... [opt]
22201 C++2A Extension:
22203 designated-initializer-list:
22204 designated-initializer-clause
22205 designated-initializer-list , designated-initializer-clause
22207 designated-initializer-clause:
22208 designator brace-or-equal-initializer
22210 designator:
22211 . identifier
22213 GNU Extension:
22215 initializer-list:
22216 designation initializer-clause ...[opt]
22217 initializer-list , designation initializer-clause ...[opt]
22219 designation:
22220 . identifier =
22221 identifier :
22222 [ constant-expression ] =
22224 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22225 for the initializer. If the INDEX of the elt is non-NULL, it is the
22226 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22227 as for cp_parser_initializer. */
22231 {
22236 /* Assume all of the expressions are constant. */
22239 /* Parse the rest of the list. */
22241 {
22243 tree designator;
22244 tree initializer;
22248 /* Handle the C++2A syntax, '. id ='. */
22256 {
22259 "C++ designated initializers only available with "
22261 /* Consume the `.'. */
22263 /* Consume the identifier. */
22266 /* Consume the `='. */
22268 }
22269 /* Also, if the next token is an identifier and the following one is a
22270 colon, we are looking at the GNU designated-initializer
22271 syntax. */
22276 {
22277 /* Warn the user that they are using an extension. */
22280 /* Consume the identifier. */
22282 /* Consume the `:'. */
22284 }
22285 /* Also handle C99 array designators, '[ const ] ='. */
22289 {
22290 /* In C++11, [ could start a lambda-introducer. */
22296 {
22299 }
22300 else
22301 {
22306 }
22311 && (!require_potential_rvalue_constant_expression
22315 /* Warn the user that they are using an extension. */
22318 }
22319 else
22323 {
22326 }
22330 {
22334 }
22338 /* Parse the initializer. */
22341 /* If any clause is non-constant, so is the entire initializer. */
22345 /* If we have an ellipsis, this is an initializer pack
22346 expansion. */
22348 {
22351 /* Consume the `...'. */
22358 /* Turn the initializer into an initializer expansion. */
22360 }
22362 /* Add it to the vector. */
22365 /* If the next token is not a comma, we have reached the end of
22366 the list. */
22370 /* Peek at the next token. */
22372 /* If the next token is a `}', then we're still done. An
22373 initializer-clause can have a trailing `,' after the
22374 initializer-list and before the closing `}'. */
22378 /* Consume the `,' token. */
22380 }
22382 /* The same identifier shall not appear in multiple designators
22383 of a designated-initializer-list. */
22385 {
22390 {
22392 {
22394 "%<.%s%> designator used multiple times in "
22398 }
22399 else
22401 }
22405 }
22408 }
22410 /* Classes [gram.class] */
22412 /* Parse a class-name.
22414 class-name:
22415 identifier
22416 template-id
22418 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22419 to indicate that names looked up in dependent types should be
22420 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22421 keyword has been used to indicate that the name that appears next
22422 is a template. TAG_TYPE indicates the explicit tag given before
22423 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22424 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22425 is the class being defined in a class-head. If ENUM_OK is TRUE,
22426 enum-names are also accepted.
22428 Returns the TYPE_DECL representing the class. */
22430 static tree
22439 {
22440 tree decl;
22441 tree scope;
22446 /* All class-names start with an identifier. */
22449 {
22452 }
22454 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22455 to a template-id, so we save it here. */
22460 /* Any name names a type if we're following the `typename' keyword
22461 in a qualified name where the enclosing scope is type-dependent. */
22464 /* Handle the common case (an identifier, but not a template-id)
22465 efficiently. */
22468 {
22472 /* Look for the identifier. */
22476 /* If the next token isn't an identifier, we are certainly not
22477 looking at a class-name. */
22480 /* If we know this is a type-name, there's no need to look it
22481 up. */
22484 else
22485 {
22486 tree ambiguous_decls;
22487 /* If we already know that this lookup is ambiguous, then
22488 we've already issued an error message; there's no reason
22489 to check again. */
22491 {
22494 }
22495 /* If the next token is a `::', then the name must be a type
22496 name.
22498 [basic.lookup.qual]
22500 During the lookup for a name preceding the :: scope
22501 resolution operator, object, function, and enumerator
22502 names are ignored. */
22505 /* Look up the name. */
22507 tag_type,
22510 check_dependency_p,
22514 {
22518 }
22519 }
22520 }
22521 else
22522 {
22523 /* Try a template-id. */
22525 check_dependency_p,
22526 tag_type,
22527 is_declaration);
22530 }
22534 /* If this is a typename, create a TYPENAME_TYPE. */
22536 {
22541 }
22545 /* Check to see that it is really the name of a class. */
22549 /* Situations like this:
22551 template <typename T> struct A {
22552 typename T::template X<int>::I i;
22553 };
22555 are problematic. Is `T::template X<int>' a class-name? The
22556 standard does not seem to be definitive, but there is no other
22557 valid interpretation of the following `::'. Therefore, those
22558 names are considered class-names. */
22559 {
22563 }
22568 /* In Objective-C 2.0, a classname followed by '.' starts a
22569 dot-syntax expression, and it's not a type-name. */
22581 }
22583 /* Parse a class-specifier.
22585 class-specifier:
22586 class-head { member-specification [opt] }
22588 Returns the TREE_TYPE representing the class. */
22590 static tree
22592 {
22593 tree type;
22607 /* Parse the class-head. */
22610 /* If the class-head was a semantic disaster, skip the entire body
22611 of the class. */
22613 {
22617 }
22619 /* Look for the `{'. */
22620 matching_braces braces;
22622 {
22625 }
22630 /* Issue an error message if type-definitions are forbidden here. */
22632 /* Remember that we are defining one more class. */
22634 /* Inside the class, surrounding template-parameter-lists do not
22635 apply. */
22636 saved_num_template_parameter_lists
22639 /* We are not in a function body. */
22642 /* Or in a loop. */
22645 /* Or in a switch. */
22648 /* We are not immediately inside an extern "lang" block. */
22649 saved_in_unbraced_linkage_specification_p
22653 // Associate constraints with the type.
22657 /* Start the class. */
22659 {
22662 }
22666 /* If the type is erroneous, skip the entire body of the class. */
22668 else
22669 /* Parse the member-specification. */
22672 /* Look for the trailing `}'. */
22674 /* Look for trailing attributes to apply to this class. */
22682 /* We've finished a type definition. Check for the common syntax
22683 error of forgetting a semicolon after the definition. We need to
22684 be careful, as we can't just check for not-a-semicolon and be done
22685 with it; the user might have typed:
22687 class X { } c = ...;
22688 class X { } *p = ...;
22690 and so forth. Instead, enumerate all the possible tokens that
22691 might follow this production; if we don't see one of them, then
22692 complain and silently insert the semicolon. */
22693 {
22698 /* Don't try to parse c++11 attributes here. As per the
22699 grammar, that should be a task for
22700 cp_parser_decl_specifier_seq. */
22704 {
22715 /* While it's legal for type qualifiers and storage class
22716 specifiers to follow type definitions in the grammar, only
22717 compiler testsuites contain code like that. Assume that if
22718 we see such code, then what we're really seeing is a case
22719 like:
22721 class X { }
22722 const <type> var = ...;
22724 or
22726 class Y { }
22727 static <type> func (...) ...
22729 i.e. the qualifier or specifier applies to the next
22730 declaration. To do so, however, we need to look ahead one
22731 more token to see if *that* token is a type specifier.
22733 This code could be improved to handle:
22735 class Z { }
22736 static const <type> var = ...; */
22739 {
22742 /* Handling user-defined types here would be nice, but very
22743 tricky. */
22744 want_semicolon
22747 }
22751 }
22753 /* If we don't have a type, then something is very wrong and we
22754 shouldn't try to do anything clever. Likewise for not seeing the
22755 closing brace. */
22757 {
22758 /* Locate the closing brace. */
22759 cp_token_position prev
22764 /* We want to suggest insertion of a ';' immediately *after* the
22765 closing brace, so, if we can, offset the location by 1 column. */
22772 /* If we successfully offset the location, suggest the fix-it. */
22785 else
22788 /* Unget one token and smash it to look as though we encountered
22789 a semicolon in the input stream. */
22794 }
22795 }
22797 /* If this class is not itself within the scope of another class,
22798 then we need to parse the bodies of all of the queued function
22799 definitions. Note that the queued functions defined in a class
22800 are not always processed immediately following the
22801 class-specifier for that class. Consider:
22803 struct A {
22804 struct B { void f() { sizeof (A); } };
22805 };
22807 If `f' were processed before the processing of `A' were
22808 completed, there would be no way to compute the size of `A'.
22809 Note that the nesting we are interested in here is lexical --
22810 not the semantic nesting given by TYPE_CONTEXT. In particular,
22811 for:
22813 struct A { struct B; };
22814 struct A::B { void f() { } };
22816 there is no need to delay the parsing of `A::B::f'. */
22818 {
22819 tree decl;
22827 {
22828 /* Skip default arguments, NSDMIs, etc, in order to improve
22829 error recovery (c++/71169, c++/71832). */
22834 }
22836 /* In a first pass, parse default arguments to the functions.
22837 Then, in a second pass, parse the bodies of the functions.
22838 This two-phased approach handles cases like:
22840 struct S {
22841 void f() { g(); }
22842 void g(int i = 3);
22843 };
22845 */
22847 {
22849 /* If there are default arguments that have not yet been processed,
22850 take care of them now. */
22852 {
22857 }
22858 /* Make sure that any template parameters are in scope. */
22860 /* Parse the default argument expressions. */
22862 /* Remove any template parameters from the symbol table. */
22864 }
22866 /* Now parse any NSDMIs. */
22870 {
22872 {
22877 }
22880 }
22887 /* Now do some post-NSDMI bookkeeping. */
22893 /* Now parse the body of the functions. */
22895 {
22896 /* OpenMP UDRs need to be parsed before all other functions. */
22903 }
22904 else
22908 }
22909 else
22912 /* Put back any saved access checks. */
22915 /* Restore saved state. */
22919 parser->num_template_parameter_lists
22921 parser->in_unbraced_linkage_specification_p
22925 }
22927 static tree
22929 {
22930 tree ret;
22935 }
22937 /* Parse a class-head.
22939 class-head:
22940 class-key identifier [opt] base-clause [opt]
22941 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22942 class-key nested-name-specifier [opt] template-id
22943 base-clause [opt]
22945 class-virt-specifier:
22946 final
22948 GNU Extensions:
22949 class-key attributes identifier [opt] base-clause [opt]
22950 class-key attributes nested-name-specifier identifier base-clause [opt]
22951 class-key attributes nested-name-specifier [opt] template-id
22952 base-clause [opt]
22954 Upon return BASES is initialized to the list of base classes (or
22955 NULL, if there are none) in the same form returned by
22956 cp_parser_base_clause.
22958 Returns the TYPE of the indicated class. Sets
22959 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22960 involving a nested-name-specifier was used, and FALSE otherwise.
22962 Returns error_mark_node if this is not a class-head.
22964 Returns NULL_TREE if the class-head is syntactically valid, but
22965 semantically invalid in a way that means we should skip the entire
22966 body of the class. */
22968 static tree
22971 {
22972 tree nested_name_specifier;
22976 tree attributes;
22977 tree bases;
22987 /* Assume no nested-name-specifier will be present. */
22989 /* Assume no template parameter lists will be used in defining the
22990 type. */
22994 /* Look for the class-key. */
23001 /* Parse the attributes. */
23004 /* If the next token is `::', that is invalid -- but sometimes
23005 people do try to write:
23007 struct ::S {};
23009 Handle this gracefully by accepting the extra qualifier, and then
23010 issuing an error about it later if this really is a
23011 class-head. If it turns out just to be an elaborated type
23012 specifier, remain silent. */
23018 /* Determine the name of the class. Begin by looking for an
23019 optional nested-name-specifier. */
23021 nested_name_specifier
23027 /* If there was a nested-name-specifier, then there *must* be an
23028 identifier. */
23033 {
23035 /* Although the grammar says `identifier', it really means
23036 `class-name' or `template-name'. You are only allowed to
23037 define a class that has already been declared with this
23038 syntax.
23040 The proposed resolution for Core Issue 180 says that wherever
23041 you see `class T::X' you should treat `X' as a type-name.
23043 It is OK to define an inaccessible class; for example:
23045 class A { class B; };
23046 class A::B {};
23048 We do not know if we will see a class-name, or a
23049 template-name. We look for a class-name first, in case the
23050 class-name is a template-id; if we looked for the
23051 template-name first we would stop after the template-name. */
23058 class_type,
23062 /* If that didn't work, ignore the nested-name-specifier. */
23064 {
23070 }
23071 /* If we could not find a corresponding TYPE, treat this
23072 declaration like an unqualified declaration. */
23075 /* Otherwise, count the number of templates used in TYPE and its
23076 containing scopes. */
23077 else
23079 }
23080 /* Otherwise, the identifier is optional. */
23081 else
23082 {
23083 /* We don't know whether what comes next is a template-id,
23084 an identifier, or nothing at all. */
23086 /* Check for a template-id. */
23091 class_key,
23093 /* If that didn't work, it could still be an identifier. */
23095 {
23097 {
23100 }
23101 else
23103 }
23104 else
23105 {
23108 }
23109 }
23114 {
23116 class_key,
23118 }
23121 /* If it's not a `:' or a `{' then we can't really be looking at a
23122 class-head, since a class-head only appears as part of a
23123 class-specifier. We have to detect this situation before calling
23124 xref_tag, since that has irreversible side-effects. */
23126 {
23130 }
23132 /* At this point, we're going ahead with the class-specifier, even
23133 if some other problem occurs. */
23136 {
23141 }
23142 /* Issue the error about the overly-qualified name now. */
23144 {
23149 }
23151 {
23156 }
23158 {
23159 tree scope;
23162 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23163 keyword template shall not appear at the top level. */
23167 /* Reject typedef-names in class heads. */
23169 {
23172 type);
23175 }
23177 /* Figure out in what scope the declaration is being placed. */
23179 /* If that scope does not contain the scope in which the
23180 class was originally declared, the program is invalid. */
23182 {
23185 "declaration of %qD in namespace %qD which does not "
23188 else
23194 }
23195 /* [dcl.meaning]
23197 A declarator-id shall not be qualified except for the
23198 definition of a ... nested class outside of its class
23199 ... [or] the definition or explicit instantiation of a
23200 class member of a namespace outside of its namespace. */
23202 {
23207 }
23208 }
23209 /* An explicit-specialization must be preceded by "template <>". If
23210 it is not, try to recover gracefully. */
23213 && !processing_template_parmlist
23215 {
23216 /* Build a location of this form:
23217 struct typename <ARGS>
23218 ^~~~~~~~~~~~~~~~~~~~~~
23219 with caret==start at the start token, and
23220 finishing at the end of the type. */
23221 location_t reported_loc
23223 class_head_start_location,
23229 "an explicit specialization must be preceded by"
23232 /* Take the same action that would have been taken by
23233 cp_parser_explicit_specialization. */
23236 }
23237 /* There must be no "return" statements between this point and the
23238 end of this function; set "type "to the correct return value and
23239 use "goto done;" to return. */
23240 /* Make sure that the right number of template parameters were
23241 present. */
23243 template_id_p,
23246 {
23247 /* If something went wrong, there is no point in even trying to
23248 process the class-definition. */
23251 }
23253 /* Look up the type. */
23255 {
23259 {
23263 }
23264 else
23265 {
23269 /* Check the scope while we still know whether or not we had a
23270 nested-name-specifier. */
23273 }
23276 }
23278 {
23279 tree class_type;
23281 /* Given:
23283 template <typename T> struct S { struct T };
23284 template <typename T> struct S<T>::T { };
23286 we will get a TYPENAME_TYPE when processing the definition of
23287 `S::T'. We need to resolve it to the actual type before we
23288 try to define it. */
23290 {
23295 else
23296 {
23299 }
23300 }
23304 {
23307 }
23310 /* Enter the scope indicated by the nested-name-specifier. */
23312 /* Get the canonical version of this type. */
23314 /* Call push_template_decl if it seems like we should be defining a
23315 template either from the template headers or the type we're
23316 defining, so that we diagnose both extra and missing headers. */
23320 {
23323 {
23326 }
23327 }
23331 }
23333 {
23334 /* If the class was unnamed, create a dummy name. */
23338 ? ts_within_enclosing_non_class
23342 }
23344 /* Indicate whether this class was declared as a `class' or as a
23345 `struct'. */
23350 /* If this type was already complete, and we see another definition,
23351 that's an error. */
23353 {
23355 type);
23357 type);
23360 }
23365 {
23366 /* Apply attributes now, before any use of the class as a template
23367 argument in its base list. */
23370 }
23372 /* We will have entered the scope containing the class; the names of
23373 base classes should be looked up in that context. For example:
23375 struct A { struct B {}; struct C; };
23376 struct A::C : B {};
23378 is valid. */
23380 /* Get the list of base-classes, if there is one. */
23382 {
23383 /* PR59482: enter the class scope so that base-specifiers are looked
23384 up correctly. */
23388 /* PR59482: get out of the previously pushed class scope so that the
23389 subsequent pops pop the right thing. */
23392 }
23393 else
23396 /* If we're really defining a class, process the base classes.
23397 If they're invalid, fail. */
23401 done:
23402 /* Leave the scope given by the nested-name-specifier. We will
23403 enter the class scope itself while processing the members. */
23408 {
23411 }
23417 out:
23420 }
23422 /* Parse a class-key.
23424 class-key:
23425 class
23426 struct
23427 union
23429 Returns the kind of class-key specified, or none_type to indicate
23430 error. */
23432 static enum tag_types
23434 {
23438 /* Look for the class-key. */
23443 /* Check to see if the TOKEN is a class-key. */
23448 }
23450 /* Parse a type-parameter-key.
23452 type-parameter-key:
23453 class
23454 typename
23455 */
23457 static void
23459 {
23460 /* Look for the type-parameter-key. */
23464 {
23467 /* typename is not allowed in a template template parameter
23468 by the standard until C++17. */
23470 "ISO C++ forbids typename key in template template parameter;"
23472 }
23473 else
23477 }
23479 /* Parse an (optional) member-specification.
23481 member-specification:
23482 member-declaration member-specification [opt]
23483 access-specifier : member-specification [opt] */
23485 static void
23487 {
23489 {
23493 /* Peek at the next token. */
23495 /* If it's a `}', or EOF then we've seen all the members. */
23501 /* See if this token is a keyword. */
23504 {
23508 /* Consume the access-specifier. */
23510 /* Remember which access-specifier is active. */
23512 /* Look for the `:'. */
23517 /* Accept #pragmas at class scope. */
23519 {
23522 }
23524 /* Otherwise, the next construction must be a
23525 member-declaration. */
23527 }
23528 }
23529 }
23531 /* Parse a member-declaration.
23533 member-declaration:
23534 decl-specifier-seq [opt] member-declarator-list [opt] ;
23535 function-definition ; [opt]
23536 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23537 using-declaration
23538 template-declaration
23539 alias-declaration
23541 member-declarator-list:
23542 member-declarator
23543 member-declarator-list , member-declarator
23545 member-declarator:
23546 declarator pure-specifier [opt]
23547 declarator constant-initializer [opt]
23548 identifier [opt] : constant-expression
23550 GNU Extensions:
23552 member-declaration:
23553 __extension__ member-declaration
23555 member-declarator:
23556 declarator attributes [opt] pure-specifier [opt]
23557 declarator attributes [opt] constant-initializer [opt]
23558 identifier [opt] attributes [opt] : constant-expression
23560 C++0x Extensions:
23562 member-declaration:
23563 static_assert-declaration */
23565 static void
23567 {
23568 cp_decl_specifier_seq decl_specifiers;
23569 tree prefix_attributes;
23570 tree decl;
23579 /* Check for the `__extension__' keyword. */
23581 {
23582 /* Recurse. */
23584 /* Restore the old value of the PEDANTIC flag. */
23588 }
23590 /* Check for a template-declaration. */
23592 {
23593 /* An explicit specialization here is an error condition, and we
23594 expect the specialization handler to detect and report this. */
23598 else
23602 }
23603 /* Check for a template introduction. */
23607 /* Check for a using-declaration. */
23609 {
23611 {
23612 /* Parse the using-declaration. */
23616 }
23617 else
23618 {
23619 tree decl;
23623 /* Note that if we actually see the '=' token after the
23624 identifier, cp_parser_alias_declaration commits the
23625 tentative parse. In that case, we really expect an
23626 alias-declaration. Otherwise, we expect a using
23627 declaration. */
23628 alias_decl_expected =
23634 else
23638 }
23639 }
23641 /* Check for @defs. */
23643 {
23648 {
23653 }
23655 }
23657 /* If the next token is `static_assert' we have a static assertion. */
23659 {
23662 }
23669 /* Parse the decl-specifier-seq. */
23672 CP_PARSER_FLAGS_OPTIONAL,
23675 /* Check for an invalid type-name. */
23679 /* If there is no declarator, then the decl-specifier-seq should
23680 specify a type. */
23682 {
23683 /* If there was no decl-specifier-seq, and the next token is a
23684 `;', then we have something like:
23686 struct S { ; };
23688 [class.mem]
23690 Each member-declaration shall declare at least one member
23691 name of the class. */
23693 {
23696 {
23700 }
23701 }
23702 else
23703 {
23704 tree type;
23706 /* See if this declaration is a friend. */
23708 /* If there were decl-specifiers, check to see if there was
23709 a class-declaration. */
23712 /* Nested classes have already been added to the class, but
23713 a `friend' needs to be explicitly registered. */
23715 {
23716 /* If the `friend' keyword was present, the friend must
23717 be introduced with a class-key. */
23720 "in C++03 a class-key must be used "
23722 /* In this case:
23724 template <typename T> struct A {
23725 friend struct A<T>::B;
23726 };
23728 A<T>::B will be represented by a TYPENAME_TYPE, and
23729 therefore not recognized by check_tag_decl. */
23731 {
23735 }
23738 "friend declaration does not name a class or "
23740 else
23743 }
23744 /* If there is no TYPE, an error message will already have
23745 been issued. */
23747 ;
23748 /* An anonymous aggregate has to be handled specially; such
23749 a declaration really declares a data member (with a
23750 particular type), as opposed to a nested class. */
23752 {
23753 /* C++11 9.5/6. */
23756 "a storage class on an anonymous aggregate "
23759 /* Remove constructors and such from TYPE, now that we
23760 know it is an anonymous aggregate. */
23762 /* And make the corresponding data member. */
23765 /* Add it to the class. */
23767 }
23768 else
23769 cp_parser_check_access_in_redeclaration
23772 }
23773 }
23774 else
23775 {
23778 /* Clear attributes from the decl_specifiers but keep them
23779 around as prefix attributes that apply them to the entity
23780 being declared. */
23784 /* See if these declarations will be friends. */
23787 /* Keep going until we hit the `;' at the end of the
23788 declaration. */
23790 {
23792 tree first_attribute;
23793 tree initializer;
23796 /* Peek at the next token. */
23799 /* The following code wants to know early if it is a bit-field
23800 or some other declaration. Attributes can appear before
23801 the `:' token. Skip over them without consuming any tokens
23802 to peek if they are followed by `:'. */
23807 {
23808 size_t n
23811 }
23813 /* Check for a bitfield declaration. */
23819 {
23820 tree identifier;
23821 tree width;
23826 else
23829 /* Look for attributes that apply to the bitfield. */
23832 /* Consume the `:' token. */
23835 /* Get the width of the bitfield. */
23839 /* In C++2A and as extension for C++11 and above we allow
23840 default member initializers for bit-fields. */
23845 CPP_OPEN_BRACE)))
23846 {
23847 location_t loc
23853 "default member initializers for bit-fields "
23854 "only available with -std=c++2a or "
23859 {
23863 }
23864 }
23865 else
23866 {
23867 /* Look for attributes that apply to the bitfield after
23868 the `:' token and width. This is where GCC used to
23869 parse attributes in the past, pedwarn if there is
23870 a std attribute. */
23873 "ISO C++ allows bit-field attributes only "
23877 }
23881 /* Remember which attributes are prefix attributes and
23882 which are not. */
23884 /* Combine the attributes. */
23887 /* Create the bitfield declaration. */
23890 identifier,
23891 sfk_none)
23895 attributes);
23896 }
23897 else
23898 {
23900 tree asm_specification;
23903 /* Parse the declarator. */
23904 declarator
23909 friend_p);
23911 /* If something went wrong parsing the declarator, make sure
23912 that we at least consume some tokens. */
23914 {
23915 /* Skip to the end of the statement. */
23917 /* If the next token is not a semicolon, that is
23918 probably because we just skipped over the body of
23919 a function. So, we consume a semicolon if
23920 present, but do not issue an error message if it
23921 is not present. */
23923 CPP_SEMICOLON))
23926 }
23929 cp_parser_check_for_definition_in_return_type
23933 /* Look for an asm-specification. */
23935 /* Look for attributes that apply to the declaration. */
23937 /* Remember which attributes are prefix attributes and
23938 which are not. */
23940 /* Combine the attributes. */
23943 /* If it's an `=', then we have a constant-initializer or a
23944 pure-specifier. It is not correct to parse the
23945 initializer before registering the member declaration
23946 since the member declaration should be in scope while
23947 its initializer is processed. However, the rest of the
23948 front end does not yet provide an interface that allows
23949 us to handle this correctly. */
23951 {
23952 /* In [class.mem]:
23954 A pure-specifier shall be used only in the declaration of
23955 a virtual function.
23957 A member-declarator can contain a constant-initializer
23958 only if it declares a static member of integral or
23959 enumeration type.
23961 Therefore, if the DECLARATOR is for a function, we look
23962 for a pure-specifier; otherwise, we look for a
23963 constant-initializer. When we call `grokfield', it will
23964 perform more stringent semantics checks. */
23976 {
23978 /* Don't require a constant rvalue in C++11, since we
23979 might want a reference constant. We'll enforce
23980 constancy later. */
23982 /* Parse the initializer. */
23985 }
23986 else
23987 /* Parse the initializer. */
23989 }
23992 {
23996 else
23998 }
23999 /* Otherwise, there is no initializer. */
24000 else
24003 /* See if we are probably looking at a function
24004 definition. We are certainly not looking at a
24005 member-declarator. Calling `grokfield' has
24006 side-effects, so we must not do it unless we are sure
24007 that we are looking at a member-declarator. */
24010 {
24011 /* The grammar does not allow a pure-specifier to be
24012 used when a member function is defined. (It is
24013 possible that this fact is an oversight in the
24014 standard, since a pure function may be defined
24015 outside of the class-specifier. */
24021 declarator,
24022 attributes);
24025 /* If the member was not a friend, declare it here. */
24028 /* Peek at the next token. */
24030 /* If the next token is a semicolon, consume it. */
24032 {
24033 location_t semicolon_loc
24038 "extra %<;%> after in-class "
24040 }
24042 }
24043 else
24046 /* Create the declaration. */
24051 {
24054 else
24056 }
24057 }
24062 /* Reset PREFIX_ATTRIBUTES. */
24064 {
24069 }
24071 /* If there is any qualification still in effect, clear it
24072 now; we will be starting fresh with the next declarator. */
24076 /* If it's a `,', then there are more declarators. */
24078 {
24081 {
24087 }
24088 }
24089 /* If the next token isn't a `;', then we have a parse error. */
24091 CPP_SEMICOLON))
24092 {
24093 /* The next token might be a ways away from where the
24094 actual semicolon is missing. Find the previous token
24095 and use that for our error position. */
24102 /* Assume that the user meant to provide a semicolon. If
24103 we were to cp_parser_skip_to_end_of_statement, we might
24104 skip to a semicolon inside a member function definition
24105 and issue nonsensical error messages. */
24107 }
24110 {
24111 /* Add DECL to the list of members. */
24113 /* Explicitly include, eg, NSDMIs, for better error
24114 recovery (c++/58650). */
24122 /* Add DECL to the queue of NSDMI to be parsed later. */
24124 }
24128 }
24129 }
24132 out:
24134 }
24136 /* Parse a pure-specifier.
24138 pure-specifier:
24139 = 0
24141 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24142 Otherwise, ERROR_MARK_NODE is returned. */
24144 static tree
24146 {
24149 /* Look for the `=' token. */
24152 /* Look for the `0' token. */
24161 /* Accept = default or = delete in c++0x mode. */
24164 {
24167 }
24169 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24171 {
24176 }
24178 {
24181 }
24184 }
24186 /* Parse a constant-initializer.
24188 constant-initializer:
24189 = constant-expression
24191 Returns a representation of the constant-expression. */
24193 static tree
24195 {
24196 /* Look for the `=' token. */
24200 /* It is invalid to write:
24202 struct S { static const int i = { 7 }; };
24204 */
24206 {
24209 /* Consume the opening brace. */
24210 matching_braces braces;
24212 /* Skip the initializer. */
24214 /* Look for the trailing `}'. */
24218 }
24221 }
24223 /* Derived classes [gram.class.derived] */
24225 /* Parse a base-clause.
24227 base-clause:
24228 : base-specifier-list
24230 base-specifier-list:
24231 base-specifier ... [opt]
24232 base-specifier-list , base-specifier ... [opt]
24234 Returns a TREE_LIST representing the base-classes, in the order in
24235 which they were declared. The representation of each node is as
24236 described by cp_parser_base_specifier.
24238 In the case that no bases are specified, this function will return
24239 NULL_TREE, not ERROR_MARK_NODE. */
24241 static tree
24243 {
24246 /* Look for the `:' that begins the list. */
24249 /* Scan the base-specifier-list. */
24251 {
24253 tree base;
24256 /* Look for the base-specifier. */
24258 /* Look for the (optional) ellipsis. */
24260 {
24261 /* Consume the `...'. */
24265 }
24267 /* Add BASE to the front of the list. */
24269 {
24271 /* Make this a pack expansion type. */
24275 {
24278 }
24279 }
24280 /* Peek at the next token. */
24282 /* If it's not a comma, then the list is complete. */
24285 /* Consume the `,'. */
24287 }
24289 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24290 base class had a qualified name. However, the next name that
24291 appears is certainly not qualified. */
24297 }
24299 /* Parse a base-specifier.
24301 base-specifier:
24302 :: [opt] nested-name-specifier [opt] class-name
24303 virtual access-specifier [opt] :: [opt] nested-name-specifier
24304 [opt] class-name
24305 access-specifier virtual [opt] :: [opt] nested-name-specifier
24306 [opt] class-name
24308 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24309 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24310 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24311 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24313 static tree
24315 {
24323 tree type;
24325 /* Process the optional `virtual' and `access-specifier'. */
24327 {
24328 /* Peek at the next token. */
24330 /* Process `virtual'. */
24332 {
24334 /* If `virtual' appears more than once, issue an error. */
24336 {
24340 }
24344 /* Consume the `virtual' token. */
24352 /* If more than one access specifier appears, issue an
24353 error. */
24356 {
24360 }
24364 /* Consume the access-specifier. */
24372 }
24373 }
24374 /* It is not uncommon to see programs mechanically, erroneously, use
24375 the 'typename' keyword to denote (dependent) qualified types
24376 as base classes. */
24378 {
24383 else
24385 "keyword %<typename%> not allowed in this context "
24388 }
24390 /* Look for the optional `::' operator. */
24392 /* Look for the nested-name-specifier. The simplest way to
24393 implement:
24395 [temp.res]
24397 The keyword `typename' is not permitted in a base-specifier or
24398 mem-initializer; in these contexts a qualified name that
24399 depends on a template-parameter is implicitly assumed to be a
24400 type name.
24402 is to pretend that we have seen the `typename' keyword at this
24403 point. */
24409 /* If the base class is given by a qualified name, assume that names
24410 we see are type names or templates, as appropriate. */
24416 /* DR 950 allows decltype as a base-specifier. */
24418 else
24419 {
24420 /* Otherwise, look for the class-name. */
24422 class_scope_p,
24423 template_p,
24424 typename_type,
24429 }
24435 }
24437 /* Exception handling [gram.exception] */
24439 /* Parse an (optional) noexcept-specification.
24441 noexcept-specification:
24442 noexcept ( constant-expression ) [opt]
24444 If no noexcept-specification is present, returns NULL_TREE.
24445 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24446 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24447 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24448 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24449 in which case a boolean condition is returned instead. */
24451 static tree
24456 {
24460 /* Peek at the next token. */
24463 /* Is it a noexcept-specification? */
24465 {
24466 tree expr;
24470 {
24471 matching_parens parens;
24475 {
24476 /* Types may not be defined in an exception-specification. */
24478 parser->type_definition_forbidden_message
24483 /* Restore the saved message. */
24485 }
24486 else
24487 {
24490 }
24493 }
24494 else
24495 {
24499 }
24501 /* We cannot build a noexcept-spec right away because this will check
24502 that expr is a constexpr. */
24505 else
24507 }
24508 else
24510 }
24512 /* Parse an (optional) exception-specification.
24514 exception-specification:
24515 throw ( type-id-list [opt] )
24517 Returns a TREE_LIST representing the exception-specification. The
24518 TREE_VALUE of each node is a type. */
24520 static tree
24522 {
24524 tree type_id_list;
24527 /* Peek at the next token. */
24530 /* Is it a noexcept-specification? */
24536 /* If it's not `throw', then there's no exception-specification. */
24542 /* Consume the `throw'. */
24545 /* Look for the `('. */
24546 matching_parens parens;
24549 /* Peek at the next token. */
24551 /* If it's not a `)', then there is a type-id-list. */
24553 {
24554 /* Types may not be defined in an exception-specification. */
24556 parser->type_definition_forbidden_message
24558 /* Parse the type-id-list. */
24560 /* Restore the saved message. */
24564 {
24568 }
24571 "dynamic exception specifications are deprecated in "
24573 }
24574 /* In C++17, throw() is equivalent to noexcept (true). throw()
24575 is deprecated in C++11 and above as well, but is still widely used,
24576 so don't warn about it yet. */
24579 else
24582 /* Look for the `)'. */
24586 }
24588 /* Parse an (optional) type-id-list.
24590 type-id-list:
24591 type-id ... [opt]
24592 type-id-list , type-id ... [opt]
24594 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24595 in the order that the types were presented. */
24597 static tree
24599 {
24603 {
24605 tree type;
24609 /* Get the next type-id. */
24611 /* Check for invalid 'auto'. */
24613 {
24617 }
24618 /* Parse the optional ellipsis. */
24620 {
24621 /* Consume the `...'. */
24624 /* Turn the type into a pack expansion expression. */
24626 }
24627 /* Add it to the list. */
24629 /* Peek at the next token. */
24631 /* If it is not a `,', we are done. */
24634 /* Consume the `,'. */
24636 }
24639 }
24641 /* Parse a try-block.
24643 try-block:
24644 try compound-statement handler-seq */
24646 static tree
24648 {
24649 tree try_block;
24663 }
24665 /* Parse a function-try-block.
24667 function-try-block:
24668 try ctor-initializer [opt] function-body handler-seq */
24670 static void
24672 {
24673 tree compound_stmt;
24674 tree try_block;
24676 /* Look for the `try' keyword. */
24679 /* Let the rest of the front end know where we are. */
24681 /* Parse the function-body. */
24682 cp_parser_ctor_initializer_opt_and_function_body
24684 /* We're done with the `try' part. */
24686 /* Parse the handlers. */
24688 /* We're done with the handlers. */
24690 }
24692 /* Parse a handler-seq.
24694 handler-seq:
24695 handler handler-seq [opt] */
24697 static void
24699 {
24701 {
24704 /* Parse the handler. */
24706 /* Peek at the next token. */
24708 /* If it's not `catch' then there are no more handlers. */
24711 }
24712 }
24714 /* Parse a handler.
24716 handler:
24717 catch ( exception-declaration ) compound-statement */
24719 static void
24721 {
24722 tree handler;
24723 tree declaration;
24727 matching_parens parens;
24734 }
24736 /* Parse an exception-declaration.
24738 exception-declaration:
24739 type-specifier-seq declarator
24740 type-specifier-seq abstract-declarator
24741 type-specifier-seq
24742 ...
24744 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24745 ellipsis variant is used. */
24747 static tree
24749 {
24750 cp_decl_specifier_seq type_specifiers;
24754 /* If it's an ellipsis, it's easy to handle. */
24756 {
24757 /* Consume the `...' token. */
24760 }
24762 /* Types may not be defined in exception-declarations. */
24764 parser->type_definition_forbidden_message
24767 /* Parse the type-specifier-seq. */
24771 /* If it's a `)', then there is no declarator. */
24774 else
24781 /* Restore the saved message. */
24788 }
24790 /* Parse a throw-expression.
24792 throw-expression:
24793 throw assignment-expression [opt]
24795 Returns a THROW_EXPR representing the throw-expression. */
24797 static tree
24799 {
24800 tree expression;
24805 /* Figure out whether or not there is an assignment-expression
24806 following the "throw" keyword. */
24814 else
24818 }
24820 /* GNU Extensions */
24822 /* Parse an (optional) asm-specification.
24824 asm-specification:
24825 asm ( string-literal )
24827 If the asm-specification is present, returns a STRING_CST
24828 corresponding to the string-literal. Otherwise, returns
24829 NULL_TREE. */
24831 static tree
24833 {
24835 tree asm_specification;
24837 /* Peek at the next token. */
24839 /* If the next token isn't the `asm' keyword, then there's no
24840 asm-specification. */
24844 /* Consume the `asm' token. */
24846 /* Look for the `('. */
24847 matching_parens parens;
24850 /* Look for the string-literal. */
24853 /* Look for the `)'. */
24857 }
24859 /* Parse an asm-operand-list.
24861 asm-operand-list:
24862 asm-operand
24863 asm-operand-list , asm-operand
24865 asm-operand:
24866 string-literal ( expression )
24867 [ string-literal ] string-literal ( expression )
24869 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24870 each node is the expression. The TREE_PURPOSE is itself a
24871 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24872 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24873 is a STRING_CST for the string literal before the parenthesis. Returns
24874 ERROR_MARK_NODE if any of the operands are invalid. */
24876 static tree
24878 {
24883 {
24884 tree string_literal;
24885 tree expression;
24886 tree name;
24889 {
24890 /* Consume the `[' token. */
24892 /* Read the operand name. */
24897 /* Look for the closing `]'. */
24899 }
24900 else
24902 /* Look for the string-literal. */
24905 /* Look for the `('. */
24906 matching_parens parens;
24908 /* Parse the expression. */
24910 /* Look for the `)'. */
24918 /* Add this operand to the list. */
24920 expression,
24921 asm_operands);
24922 /* If the next token is not a `,', there are no more
24923 operands. */
24926 /* Consume the `,'. */
24928 }
24931 }
24933 /* Parse an asm-clobber-list.
24935 asm-clobber-list:
24936 string-literal
24937 asm-clobber-list , string-literal
24939 Returns a TREE_LIST, indicating the clobbers in the order that they
24940 appeared. The TREE_VALUE of each node is a STRING_CST. */
24942 static tree
24944 {
24948 {
24949 tree string_literal;
24951 /* Look for the string literal. */
24953 /* Add it to the list. */
24955 /* If the next token is not a `,', then the list is
24956 complete. */
24959 /* Consume the `,' token. */
24961 }
24964 }
24966 /* Parse an asm-label-list.
24968 asm-label-list:
24969 identifier
24970 asm-label-list , identifier
24972 Returns a TREE_LIST, indicating the labels in the order that they
24973 appeared. The TREE_VALUE of each node is a label. */
24975 static tree
24977 {
24981 {
24984 /* Look for the identifier. */
24987 {
24990 {
24996 }
24997 }
24998 /* If the next token is not a `,', then the list is
24999 complete. */
25002 /* Consume the `,' token. */
25004 }
25007 }
25009 /* Return TRUE iff the next tokens in the stream are possibly the
25010 beginning of a GNU extension attribute. */
25012 static bool
25014 {
25016 }
25018 /* Return TRUE iff the next tokens in the stream are possibly the
25019 beginning of a standard C++-11 attribute specifier. */
25021 static bool
25023 {
25025 }
25027 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25028 beginning of a standard C++-11 attribute specifier. */
25030 static bool
25032 {
25040 }
25042 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25043 beginning of a GNU extension attribute. */
25045 static bool
25047 {
25051 }
25053 /* Return true iff the next tokens can be the beginning of either a
25054 GNU attribute list, or a standard C++11 attribute sequence. */
25056 static bool
25058 {
25061 }
25063 /* Return true iff the next Nth tokens can be the beginning of either
25064 a GNU attribute list, or a standard C++11 attribute sequence. */
25066 static bool
25068 {
25071 }
25073 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25074 of GNU attributes, or return NULL. */
25076 static tree
25078 {
25082 }
25084 /* Parse an (optional) series of attributes.
25086 attributes:
25087 attributes attribute
25089 attribute:
25090 __attribute__ (( attribute-list [opt] ))
25092 The return value is as for cp_parser_gnu_attribute_list. */
25094 static tree
25096 {
25103 {
25105 tree attribute_list;
25108 /* Peek at the next token. */
25110 /* If it's not `__attribute__', then we're done. */
25114 /* Consume the `__attribute__' keyword. */
25116 /* Look for the two `(' tokens. */
25117 matching_parens outer_parens;
25119 matching_parens inner_parens;
25122 /* Peek at the next token. */
25125 /* Parse the attribute-list. */
25127 else
25128 /* If the next token is a `)', then there is no attribute
25129 list. */
25132 /* Look for the two `)' tokens. */
25140 /* Add these new attributes to the list. */
25142 }
25145 }
25147 /* Parse a GNU attribute-list.
25149 attribute-list:
25150 attribute
25151 attribute-list , attribute
25153 attribute:
25154 identifier
25155 identifier ( identifier )
25156 identifier ( identifier , expression-list )
25157 identifier ( expression-list )
25159 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25160 to an attribute. The TREE_PURPOSE of each node is the identifier
25161 indicating which attribute is in use. The TREE_VALUE represents
25162 the arguments, if any. */
25164 static tree
25166 {
25172 {
25174 tree identifier;
25175 tree attribute;
25177 /* Look for the identifier. We also allow keywords here; for
25178 example `__attribute__ ((const))' is legal. */
25182 {
25185 /* Consume the token, but save it since we need it for the
25186 SIMD enabled function parsing. */
25189 /* Save away the identifier that indicates which attribute
25190 this is. */
25192 /* For keywords, use the canonical spelling, not the
25193 parsed identifier. */
25200 /* Peek at the next token. */
25202 /* If it's an `(', then parse the attribute arguments. */
25204 {
25208 vec = cp_parser_parenthesized_expression_list
25214 else
25215 {
25218 }
25219 /* Save the arguments away. */
25221 }
25224 {
25225 /* Add this attribute to the list. */
25228 }
25231 }
25232 /* Now, look for more attributes. If the next token isn't a
25233 `,', we're done. */
25237 /* Consume the comma and keep going. */
25239 }
25242 /* We built up the list in reverse order. */
25244 }
25246 /* Parse a standard C++11 attribute.
25248 The returned representation is a TREE_LIST which TREE_PURPOSE is
25249 the scoped name of the attribute, and the TREE_VALUE is its
25250 arguments list.
25252 Note that the scoped name of the attribute is itself a TREE_LIST
25253 which TREE_PURPOSE is the namespace of the attribute, and
25254 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25255 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25256 and which TREE_PURPOSE is directly the attribute name.
25258 Clients of the attribute code should use get_attribute_namespace
25259 and get_attribute_name to get the actual namespace and name of
25260 attributes, regardless of their being GNU or C++11 attributes.
25262 attribute:
25263 attribute-token attribute-argument-clause [opt]
25265 attribute-token:
25266 identifier
25267 attribute-scoped-token
25269 attribute-scoped-token:
25270 attribute-namespace :: identifier
25272 attribute-namespace:
25273 identifier
25275 attribute-argument-clause:
25276 ( balanced-token-seq )
25278 balanced-token-seq:
25279 balanced-token [opt]
25280 balanced-token-seq balanced-token
25282 balanced-token:
25283 ( balanced-token-seq )
25284 [ balanced-token-seq ]
25285 { balanced-token-seq }. */
25287 static tree
25289 {
25296 /* First, parse name of the attribute, a.k.a attribute-token. */
25313 {
25314 /* We are seeing a scoped attribute token. */
25329 else
25330 {
25334 }
25338 NULL_TREE);
25340 }
25343 NULL_TREE);
25344 else
25345 {
25348 NULL_TREE);
25349 /* C++11 noreturn attribute is equivalent to GNU's. */
25352 /* C++14 deprecated attribute is equivalent to GNU's. */
25355 /* C++17 fallthrough attribute is equivalent to GNU's. */
25358 /* Transactional Memory TS optimize_for_synchronized attribute is
25359 equivalent to GNU transaction_callable. */
25363 /* Transactional Memory attributes are GNU attributes. */
25366 }
25368 /* Now parse the optional argument clause of the attribute. */
25373 {
25379 /* A GNU attribute that takes an identifier in parameter. */
25382 vec = cp_parser_parenthesized_expression_list
25388 else
25389 {
25392 }
25396 else
25398 }
25401 }
25403 /* Check that the attribute ATTRIBUTE appears at most once in the
25404 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25405 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25406 isn't implemented yet in GCC. */
25408 static void
25410 {
25412 {
25422 }
25423 }
25425 /* Parse a list of standard C++-11 attributes.
25427 attribute-list:
25428 attribute [opt]
25429 attribute-list , attribute[opt]
25430 attribute ...
25431 attribute-list , attribute ...
25432 */
25434 static tree
25436 {
25441 {
25446 {
25450 }
25453 {
25458 else
25459 {
25464 }
25466 }
25470 }
25473 }
25475 /* Parse a standard C++-11 attribute specifier.
25477 attribute-specifier:
25478 [ [ attribute-using-prefix [opt] attribute-list ] ]
25479 alignment-specifier
25481 attribute-using-prefix:
25482 using attribute-namespace :
25484 alignment-specifier:
25485 alignas ( type-id ... [opt] )
25486 alignas ( alignment-expression ... [opt] ). */
25488 static tree
25490 {
25496 {
25503 {
25514 {
25518 "attribute using prefix only available "
25524 }
25525 else
25527 }
25534 else
25535 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25536 when we are sure that we have actually parsed them. */
25538 }
25539 else
25540 {
25541 tree alignas_expr;
25543 /* Look for an alignment-specifier. */
25554 matching_parens parens;
25562 {
25569 }
25574 /* Handle alignas (pack...). */
25576 {
25579 }
25581 /* Something went wrong, so don't build the attribute. */
25588 /* Build the C++-11 representation of an 'aligned'
25589 attribute. */
25590 attributes
25593 }
25596 }
25598 /* Parse a standard C++-11 attribute-specifier-seq.
25600 attribute-specifier-seq:
25601 attribute-specifier-seq [opt] attribute-specifier
25602 */
25604 static tree
25606 {
25611 {
25620 else
25623 }
25626 }
25628 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25629 return index of the first token after balanced-token, or N on failure. */
25631 static size_t
25633 {
25636 do
25638 {
25641 /* Ran out of tokens. */
25663 }
25666 }
25668 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25669 return index of the first token after the GNU attribute tokens, or N on
25670 failure. */
25672 static size_t
25674 {
25676 {
25688 }
25690 }
25692 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25693 next token), return index of the first token after the standard C++11
25694 attribute tokens, or N on failure. */
25696 static size_t
25698 {
25700 {
25703 {
25710 }
25713 {
25718 }
25719 else
25721 }
25723 }
25725 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25726 as the next token), return index of the first token after the attribute
25727 tokens, or N on failure. */
25729 static size_t
25731 {
25735 }
25737 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25738 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25739 current value of the PEDANTIC flag, regardless of whether or not
25740 the `__extension__' keyword is present. The caller is responsible
25741 for restoring the value of the PEDANTIC flag. */
25743 static bool
25745 {
25746 /* Save the old value of the PEDANTIC flag. */
25750 {
25751 /* Consume the `__extension__' token. */
25753 /* We're not being pedantic while the `__extension__' keyword is
25754 in effect. */
25758 }
25761 }
25763 /* Parse a label declaration.
25765 label-declaration:
25766 __label__ label-declarator-seq ;
25768 label-declarator-seq:
25769 identifier , label-declarator-seq
25770 identifier */
25772 static void
25774 {
25775 /* Look for the `__label__' keyword. */
25779 {
25780 tree identifier;
25782 /* Look for an identifier. */
25784 /* If we failed, stop. */
25787 /* Declare it as a label. */
25789 /* If the next token is a `;', stop. */
25792 /* Look for the `,' separating the label declarations. */
25794 }
25796 /* Look for the final `;'. */
25798 }
25800 // -------------------------------------------------------------------------- //
25801 // Requires Clause
25803 // Parse a requires clause.
25804 //
25805 // requires-clause:
25806 // 'requires' logical-or-expression
25807 //
25808 // The required logical-or-expression must be a constant expression. Note
25809 // that we don't check that the expression is constepxr here. We defer until
25810 // we analyze constraints and then, we only check atomic constraints.
25811 static tree
25813 {
25814 // Parse the requires clause so that it is not automatically folded.
25822 }
25824 // Optionally parse a requires clause:
25825 static tree
25827 {
25830 {
25833 {
25836 /* Parse and discard the requires-clause. */
25839 }
25841 }
25844 }
25847 /*---------------------------------------------------------------------------
25848 Requires expressions
25849 ---------------------------------------------------------------------------*/
25851 /* Parse a requires expression
25853 requirement-expression:
25854 'requires' requirement-parameter-list [opt] requirement-body */
25855 static tree
25857 {
25861 /* A requires-expression shall appear only within a concept
25862 definition or a requires-clause.
25864 TODO: Implement this diagnostic correctly. */
25866 {
25870 }
25873 {
25874 /* Local parameters are delared as variables within the scope
25875 of the expression. They are not visible past the end of
25876 the expression. Expressions within the requires-expression
25877 are unevaluated. */
25878 struct scope_sentinel
25879 {
25881 {
25884 }
25887 {
25890 }
25893 /* Parse the optional parameter list. */
25895 {
25899 }
25900 else
25903 /* Parse the requirement body. */
25907 }
25909 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25910 the parm chain. */
25913 }
25915 /* Parse a parameterized requirement.
25917 requirement-parameter-list:
25918 '(' parameter-declaration-clause ')' */
25919 static tree
25921 {
25922 matching_parens parens;
25932 }
25934 /* Parse the body of a requirement.
25936 requirement-body:
25937 '{' requirement-list '}' */
25938 static tree
25940 {
25941 matching_braces braces;
25951 }
25953 /* Parse a list of requirements.
25955 requirement-list:
25956 requirement
25957 requirement-list ';' requirement[opt] */
25958 static tree
25960 {
25963 {
25970 /* If we see a semi-colon, consume it. */
25974 /* Stop processing at the end of the list. */
25977 }
25979 /* Reverse the order of requirements so they are analyzed in
25980 declaration order. */
25982 }
25984 /* Parse a syntactic requirement or type requirement.
25986 requirement:
25987 simple-requirement
25988 compound-requirement
25989 type-requirement
25990 nested-requirement */
25991 static tree
25993 {
26000 else
26002 }
26004 /* Parse a simple requirement.
26006 simple-requirement:
26007 expression ';' */
26008 static tree
26010 {
26019 }
26021 /* Parse a type requirement
26023 type-requirement
26024 nested-name-specifier [opt] required-type-name ';'
26026 required-type-name:
26027 type-name
26028 'template' [opt] simple-template-id */
26029 static tree
26031 {
26034 // Save the scope before parsing name specifiers.
26045 tree type;
26047 {
26056 }
26057 else
26076 }
26078 /* Parse a compound requirement
26080 compound-requirement:
26081 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26082 static tree
26084 {
26085 /* Parse an expression enclosed in '{ }'s. */
26086 matching_braces braces;
26097 /* Parse the optional noexcept. */
26100 {
26103 }
26105 /* Parse the optional trailing return type. */
26108 {
26116 }
26119 }
26121 /* Parse a nested requirement. This is the same as a requires clause.
26123 nested-requirement:
26124 requires-clause */
26125 static tree
26127 {
26133 }
26135 /* Support Functions */
26137 /* Return the appropriate prefer_type argument for lookup_name_real based on
26138 tag_type and template_mem_access. */
26142 {
26143 /* DR 141: When looking in the current enclosing context for a template-name
26144 after -> or ., only consider class templates. */
26148 {
26152 }
26153 }
26155 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26156 NAME should have one of the representations used for an
26157 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26158 is returned. If PARSER->SCOPE is a dependent type, then a
26159 SCOPE_REF is returned.
26161 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26162 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26163 was formed. Abstractly, such entities should not be passed to this
26164 function, because they do not need to be looked up, but it is
26165 simpler to check for this special case here, rather than at the
26166 call-sites.
26168 In cases not explicitly covered above, this function returns a
26169 DECL, OVERLOAD, or baselink representing the result of the lookup.
26170 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26171 is returned.
26173 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26174 (e.g., "struct") that was used. In that case bindings that do not
26175 refer to types are ignored.
26177 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26178 ignored.
26180 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26181 are ignored.
26183 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26184 types.
26186 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26187 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26188 NULL_TREE otherwise. */
26190 static cp_expr
26197 location_t name_location)
26198 {
26199 tree decl;
26202 /* Assume that the lookup will be unambiguous. */
26206 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26207 no longer valid. Note that if we are parsing tentatively, and
26208 the parse fails, OBJECT_TYPE will be automatically restored. */
26214 /* A template-id has already been resolved; there is no lookup to
26215 do. */
26219 {
26223 }
26225 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26226 it should already have been checked to make sure that the name
26227 used matches the type being destroyed. */
26229 {
26230 tree type;
26232 /* Figure out to which type this destructor applies. */
26237 else
26239 /* If that's not a class type, there is no destructor. */
26250 }
26252 /* By this point, the NAME should be an ordinary identifier. If
26253 the id-expression was a qualified name, the qualifying scope is
26254 stored in PARSER->SCOPE at this point. */
26257 /* Perform the lookup. */
26259 {
26265 /* If the SCOPE is dependent, the lookup must be deferred until
26266 the template is instantiated -- unless we are explicitly
26267 looking up names in uninstantiated templates. Even then, we
26268 cannot look up the name if the scope is not a class type; it
26269 might, for example, be a template type parameter. */
26274 /* Defer lookup. */
26276 else
26277 {
26280 /* If PARSER->SCOPE is a dependent type, then it must be a
26281 class type, and we must not be checking dependencies;
26282 otherwise, we would have processed this lookup above. So
26283 that PARSER->SCOPE is not considered a dependent base by
26284 lookup_member, we must enter the scope here. */
26288 /* If the PARSER->SCOPE is a template specialization, it
26289 may be instantiated during name lookup. In that case,
26290 errors may be issued. Even if we rollback the current
26291 tentative parse, those errors are valid. */
26296 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26297 lookup result and the nested-name-specifier nominates a class C:
26298 * if the name specified after the nested-name-specifier, when
26299 looked up in C, is the injected-class-name of C (Clause 9), or
26300 * if the name specified after the nested-name-specifier is the
26301 same as the identifier or the simple-template-id's template-
26302 name in the last component of the nested-name-specifier,
26303 the name is instead considered to name the constructor of
26304 class C. [ Note: for example, the constructor is not an
26305 acceptable lookup result in an elaborated-type-specifier so
26306 the constructor would not be used in place of the
26307 injected-class-name. --end note ] Such a constructor name
26308 shall be used only in the declarator-id of a declaration that
26309 names a constructor or in a using-declaration. */
26317 /* If we have a single function from a using decl, pull it out. */
26324 }
26326 /* If the scope is a dependent type and either we deferred lookup or
26327 we did lookup but didn't find the name, rememeber the name. */
26330 {
26332 {
26333 tree type;
26335 /* The resolution to Core Issue 180 says that `struct
26336 A::B' should be considered a type-name, even if `A'
26337 is dependent. */
26342 }
26346 CPP_CLOSE_PAREN)))
26350 else
26353 is_template);
26354 }
26357 }
26359 {
26360 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26361 OBJECT_TYPE is not a class. */
26363 /* If the OBJECT_TYPE is a template specialization, it may
26364 be instantiated during name lookup. In that case, errors
26365 may be issued. Even if we rollback the current tentative
26366 parse, those errors are valid. */
26368 name,
26371 tf_warning_or_error);
26372 else
26376 /* Look it up in the enclosing context. DR 141: When looking for a
26377 template-name after -> or ., only consider class templates. */
26382 /* The object is type-dependent, so we can't look anything up; we used
26383 this to get the DR 141 behavior. */
26387 }
26388 else
26389 {
26395 }
26397 /* If the lookup failed, let our caller know. */
26401 /* Pull out the template from an injected-class-name (or multiple). */
26405 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26407 {
26410 /* The error message we have to print is too complicated for
26411 cp_parser_error, so we incorporate its actions directly. */
26413 {
26415 name);
26417 }
26419 }
26427 /* If we have resolved the name of a member declaration, check to
26428 see if the declaration is accessible. When the name resolves to
26429 set of overloaded functions, accessibility is checked when
26430 overload resolution is done.
26432 During an explicit instantiation, access is not checked at all,
26433 as per [temp.explicit]. */
26440 }
26442 /* Like cp_parser_lookup_name, but for use in the typical case where
26443 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26444 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26446 static tree
26448 {
26450 none_type,
26455 location);
26456 }
26458 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26459 the current context, return the TYPE_DECL. If TAG_NAME_P is
26460 true, the DECL indicates the class being defined in a class-head,
26461 or declared in an elaborated-type-specifier.
26463 Otherwise, return DECL. */
26465 static tree
26467 {
26468 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26469 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26471 struct A {
26472 template <typename T> struct B;
26473 };
26475 template <typename T> struct A::B {};
26477 Similarly, in an elaborated-type-specifier:
26479 namespace N { struct X{}; }
26481 struct A {
26482 template <typename T> friend struct N::X;
26483 };
26485 However, if the DECL refers to a class type, and we are in
26486 the scope of the class, then the name lookup automatically
26487 finds the TYPE_DECL created by build_self_reference rather
26488 than a TEMPLATE_DECL. For example, in:
26490 template <class T> struct S {
26491 S s;
26492 };
26494 there is no need to handle such case. */
26500 }
26502 /* If too many, or too few, template-parameter lists apply to the
26503 declarator, issue an error message. Returns TRUE if all went well,
26504 and FALSE otherwise. */
26506 static bool
26509 location_t declarator_location)
26510 {
26512 {
26514 {
26523 {
26524 /* If the DECLARATOR has the form `X<y>' then it uses one
26525 additional level of template parameters. */
26528 }
26530 return cp_parser_check_template_parameters
26532 declarator);
26533 }
26549 }
26551 }
26553 /* NUM_TEMPLATES were used in the current declaration. If that is
26554 invalid, return FALSE and issue an error messages. Otherwise,
26555 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26556 declarator and we can print more accurate diagnostics. */
26558 static bool
26562 location_t location,
26564 {
26565 /* If there are the same number of template classes and parameter
26566 lists, that's OK. */
26569 /* If there are more, but only one more, and the name ends in an identifier,
26570 then we are declaring a primary template. That's OK too. */
26574 /* If there are more template classes than parameter lists, we have
26575 something like:
26577 template <class T> void S<T>::R<T>::f (); */
26579 {
26589 else
26592 }
26593 /* Otherwise, there are too many template parameter lists. We have
26594 something like:
26596 template <class T> template <class U> void S::f(); */
26599 }
26601 /* Parse an optional `::' token indicating that the following name is
26602 from the global namespace. If so, PARSER->SCOPE is set to the
26603 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26604 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26605 Returns the new value of PARSER->SCOPE, if the `::' token is
26606 present, and NULL_TREE otherwise. */
26608 static tree
26610 {
26613 /* Peek at the next token. */
26615 /* If we're looking at a `::' token then we're starting from the
26616 global namespace, not our current location. */
26618 {
26619 /* Consume the `::' token. */
26621 /* Set the SCOPE so that we know where to start the lookup. */
26627 }
26629 {
26633 }
26636 }
26638 /* Returns TRUE if the upcoming token sequence is the start of a
26639 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26640 declarator is preceded by the `friend' specifier. */
26642 static bool
26644 {
26647 tree nested_name_specifier;
26650 /* The common case is that this is not a constructor declarator, so
26651 try to avoid doing lots of work if at all possible. It's not
26652 valid declare a constructor at function scope. */
26655 /* And only certain tokens can begin a constructor declarator. */
26663 /* Parse tentatively; we are going to roll back all of the tokens
26664 consumed here. */
26666 /* Assume that we are looking at a constructor declarator. */
26669 /* Look for the optional `::' operator. */
26672 /* Look for the nested-name-specifier. */
26673 nested_name_specifier
26684 /* Outside of a class-specifier, there must be a
26685 nested-name-specifier. Except in C++17 mode, where we
26686 might be declaring a guiding declaration. */
26693 /* If we have a class scope, this is easy; DR 147 says that S::S always
26694 names the constructor, and no other qualified name could. */
26697 {
26707 }
26708 /* If we still think that this might be a constructor-declarator,
26709 look for a class-name. */
26711 {
26712 /* If we have:
26714 template <typename T> struct S {
26715 S();
26716 };
26718 we must recognize that the nested `S' names a class. */
26722 tree type_decl;
26726 none_type,
26733 {
26739 none_type,
26744 else
26746 }
26748 /* If there was no class-name, then this is not a constructor.
26749 Otherwise, if we are in a class-specifier and we aren't
26750 handling a friend declaration, check that its type matches
26751 current_class_type (c++/38313). Note: error_mark_node
26752 is left alone for error recovery purposes. */
26754 && (outside_class_specifier_p
26760 /* If we're still considering a constructor, we have to see a `(',
26761 to begin the parameter-declaration-clause, followed by either a
26762 `)', an `...', or a decl-specifier. We need to check for a
26763 type-specifier to avoid being fooled into thinking that:
26765 S (f) (int);
26767 is a constructor. (It is actually a function named `f' that
26768 takes one parameter (of type `int') and returns a value of type
26769 `S'. */
26777 /* A parameter declaration begins with a decl-specifier,
26778 which is either the "attribute" keyword, a storage class
26779 specifier, or (usually) a type-specifier. */
26781 {
26782 tree type;
26786 /* Names appearing in the type-specifier should be looked up
26787 in the scope of the class. */
26791 {
26794 {
26798 {
26801 }
26802 }
26804 }
26806 /* Inside the constructor parameter list, surrounding
26807 template-parameter-lists do not apply. */
26808 saved_num_template_parameter_lists
26812 /* Look for the type-specifier. */
26814 CP_PARSER_FLAGS_NONE,
26820 parser->num_template_parameter_lists
26823 /* Leave the scope of the class. */
26828 }
26829 }
26831 /* We did not really want to consume any tokens. */
26835 }
26837 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26838 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26839 they must be performed once we are in the scope of the function.
26841 Returns the function defined. */
26843 static tree
26844 cp_parser_function_definition_from_specifiers_and_declarator
26847 tree attributes,
26849 {
26850 tree fn;
26853 /* Begin the function-definition. */
26856 /* The things we're about to see are not directly qualified by any
26857 template headers we've seen thus far. */
26860 /* If there were names looked up in the decl-specifier-seq that we
26861 did not check, check them now. We must wait until we are in the
26862 scope of the function to perform the checks, since the function
26863 might be a friend. */
26867 {
26872 }
26875 {
26876 /* Skip the entire function. */
26879 }
26881 {
26882 /* Seen already, skip it. An error message has already been output. */
26886 /* If this is a function from a class, pop the nested class. */
26889 }
26890 else
26891 {
26892 timevar_id_t tv;
26895 else
26901 }
26904 }
26906 /* Parse the part of a function-definition that follows the
26907 declarator. INLINE_P is TRUE iff this function is an inline
26908 function defined within a class-specifier.
26910 Returns the function defined. */
26912 static tree
26915 {
26916 tree fn;
26921 bool fully_implicit_function_template_p
26924 tree implicit_template_parms
26927 cp_binding_level* implicit_template_scope
26933 /* If the next token is `return', then the code may be trying to
26934 make use of the "named return value" extension that G++ used to
26935 support. */
26938 {
26939 /* Consume the `return' keyword. */
26941 /* Look for the identifier that indicates what value is to be
26942 returned. */
26944 /* Issue an error message. */
26947 /* Skip tokens until we reach the start of the function body. */
26949 {
26956 }
26957 }
26958 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26959 anything declared inside `f'. */
26960 saved_in_unbraced_linkage_specification_p
26963 /* Inside the function, surrounding template-parameter-lists do not
26964 apply. */
26965 saved_num_template_parameter_lists
26969 /* If the next token is `try', `__transaction_atomic', or
26970 `__transaction_relaxed`, then we are looking at either function-try-block
26971 or function-transaction-block. Note that all of these include the
26972 function-body. */
26976 RID_TRANSACTION_RELAXED))
26980 else
26981 cp_parser_ctor_initializer_opt_and_function_body
26984 /* Finish the function. */
26986 /* Generate code for it, if necessary. */
26988 /* Restore the saved values. */
26989 parser->in_unbraced_linkage_specification_p
26991 parser->num_template_parameter_lists
26995 parser->fully_implicit_function_template_p
26997 parser->implicit_template_parms
26999 parser->implicit_template_scope
27006 }
27008 /* Parse a template-declaration body (following argument list). */
27010 static void
27012 tree parameter_list,
27014 {
27018 /* We just processed one more parameter list. */
27021 /* Get the deferred access checks from the parameter list. These
27022 will be checked once we know what is being declared, as for a
27023 member template the checks must be performed in the scope of the
27024 class containing the member. */
27027 /* Tentatively parse for a new template parameter list, which can either be
27028 the template keyword or a template introduction. */
27034 else
27035 {
27036 /* There are no access checks when parsing a template, as we do not
27037 know if a specialization will be a friend. */
27041 checks,
27042 member_p,
27047 /* If this is a member template declaration, let the front
27048 end know. */
27050 {
27055 }
27060 }
27061 /* We are done with the current parameter list. */
27066 /* Finish up. */
27069 /* Check the template arguments for a literal operator template. */
27073 {
27077 else
27078 {
27081 {
27087 }
27089 {
27098 }
27099 else
27101 }
27103 {
27106 " Expected non-type template argument pack <char...>"
27108 decl);
27109 else
27112 decl);
27113 }
27114 }
27116 /* Register member declarations. */
27119 /* If DECL is a function template, we must return to parse it later.
27120 (Even though there is no definition, there might be default
27121 arguments that need handling.) */
27125 }
27127 /* Parse a template introduction header for a template-declaration. Returns
27128 false if tentative parse fails. */
27130 static bool
27132 {
27139 /* Look for the optional `::' operator. */
27142 /* Look for the nested-name-specifier. */
27152 /* Look up the concept for which we will be matching
27153 template parameters. */
27163 /* Look for opening brace for introduction. */
27164 matching_braces braces;
27172 /* Build vector of placeholder parameters and grab
27173 matching identifiers. */
27176 /* The introduction-list shall not be empty. */
27179 {
27182 }
27184 /* Look for closing brace for introduction. */
27189 {
27193 }
27195 /* Build and associate the constraint. */
27198 {
27200 member_p);
27202 }
27206 }
27208 /* Parse a normal template-declaration following the template keyword. */
27210 static void
27212 {
27213 tree parameter_list;
27217 /* Look for the `<' token. */
27221 {
27222 /* 14.5.2.2 [temp.mem]
27224 A local class shall not have member templates. */
27229 }
27230 /* [temp]
27232 A template ... shall not have C linkage. */
27234 {
27237 /* Give it C++ linkage to avoid confusing other parts of the
27238 front end. */
27241 }
27242 else
27245 /* We cannot perform access checks on the template parameter
27246 declarations until we know what is being declared, just as we
27247 cannot check the decl-specifier list. */
27250 /* If the next token is `>', then we have an invalid
27251 specialization. Rather than complain about an invalid template
27252 parameter, issue an error message here. */
27254 {
27258 }
27259 else
27260 {
27261 /* Parse the template parameters. */
27263 }
27265 /* Look for the `>'. */
27268 /* Manage template requirements */
27270 {
27275 }
27278 member_p);
27280 /* For the erroneous case of a template with C linkage, we pushed an
27281 implicit C++ linkage scope; exit that scope now. */
27284 }
27286 /* Parse a template-declaration, assuming that the `export' (and
27287 `extern') keywords, if present, has already been scanned. MEMBER_P
27288 is as for cp_parser_template_declaration. */
27290 static bool
27292 {
27294 {
27298 }
27303 }
27305 /* Perform the deferred access checks from a template-parameter-list.
27306 CHECKS is a TREE_LIST of access checks, as returned by
27307 get_deferred_access_checks. */
27309 static void
27310 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27311 {
27315 }
27317 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27318 `function-definition' sequence that follows a template header.
27319 If MEMBER_P is true, this declaration appears in a class scope.
27321 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27322 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27324 static tree
27330 {
27333 cp_decl_specifier_seq decl_specifiers;
27337 /* This function is only used when processing a template
27338 declaration. */
27342 /* Defer access checks until we know what is being declared. */
27345 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27346 alternative. */
27349 CP_PARSER_FLAGS_OPTIONAL,
27355 /* There are no template typedefs. */
27357 {
27361 }
27363 /* Gather up the access checks that occurred the
27364 decl-specifier-seq. */
27367 /* Check for the declaration of a template class. */
27369 {
27372 {
27373 // If this is a declaration, but not a definition, associate
27374 // any constraints with the type declaration. Constraints
27375 // are associated with definitions in cp_parser_class_specifier.
27381 /* In this case:
27383 struct C {
27384 friend template <typename T> struct A<T>::B;
27385 };
27387 A<T>::B will be represented by a TYPENAME_TYPE, and
27388 therefore not recognized by shadow_tag. */
27390 && !decl
27397 else
27400 /* Perform access checks for template parameters. */
27403 /* Give a helpful diagnostic for
27404 template <class T> struct A { } a;
27405 if we aren't already recovering from an error. */
27408 {
27410 "a class template declaration must not declare "
27414 }
27415 }
27416 }
27418 /* Complain about missing 'typename' or other invalid type names. */
27421 {
27422 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27423 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27424 the rest of this declaration. */
27427 }
27429 /* If it's not a template class, try for a template function. If
27430 the next token is a `;', then this declaration does not declare
27431 anything. But, if there were errors in the decl-specifiers, then
27432 the error might well have come from an attempted class-specifier.
27433 In that case, there's no need to warn about a missing declarator. */
27437 {
27440 checks,
27442 member_p,
27443 declares_class_or_enum,
27447 /* 7.1.1-1 [dcl.stc]
27449 A storage-class-specifier shall not be specified in an explicit
27450 specialization... */
27452 && explicit_specialization_p
27454 {
27458 }
27462 }
27464 /* Look for a trailing `;' after the declaration. */
27470 out:
27473 /* Clear any current qualification; whatever comes next is the start
27474 of something new. */
27480 }
27482 /* Parse a cast-expression that is not the operand of a unary "&". */
27484 static cp_expr
27486 {
27489 }
27491 /* Parse a functional cast to TYPE. Returns an expression
27492 representing the cast. */
27494 static cp_expr
27496 {
27498 tree expression_list;
27499 cp_expr cast;
27508 {
27518 /* Create a location of the form:
27519 type_name{i, f}
27520 ^~~~~~~~~~~~~~~
27521 with caret == start at the start of the type name,
27522 finishing at the closing brace. */
27523 location_t finish_loc
27526 finish_loc);
27529 }
27538 else
27539 {
27542 }
27545 tf_warning_or_error);
27546 /* [expr.const]/1: In an integral constant expression "only type
27547 conversions to integral or enumeration type can be used". */
27553 NIC_CONSTRUCTOR))
27556 /* Create a location of the form:
27557 float(i)
27558 ^~~~~~~~
27559 with caret == start at the start of the type name,
27560 finishing at the closing paren. */
27561 location_t finish_loc
27566 }
27568 /* Save the tokens that make up the body of a member function defined
27569 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27570 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27571 specifiers applied to the declaration. Returns the FUNCTION_DECL
27572 for the member function. */
27574 static tree
27578 tree attributes)
27579 {
27582 tree fn;
27585 /* Create the FUNCTION_DECL. */
27589 /* If something went badly wrong, bail out now. */
27591 {
27592 /* If there's a function-body, skip it. */
27597 }
27599 /* Remember it, if there default args to post process. */
27602 /* Save away the tokens that make up the body of the
27603 function. */
27609 RID_TRANSACTION_ATOMIC))
27610 {
27612 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27619 {
27625 }
27626 else
27629 {
27633 }
27634 }
27636 /* Handle function try blocks. */
27638 {
27641 }
27642 /* We can have braced-init-list mem-initializers before the fn body. */
27644 {
27647 {
27648 /* cache_group will stop after an un-nested { } pair, too. */
27652 /* variadic mem-inits have ... after the ')'. */
27655 }
27656 }
27658 /* Handle function try blocks. */
27664 /* Save away the inline definition; we will process it when the
27665 class is complete. */
27669 /* We need to know that this was defined in the class, so that
27670 friend templates are handled correctly. */
27673 /* Add FN to the queue of functions to be parsed later. */
27677 }
27679 /* Save the tokens that make up the in-class initializer for a non-static
27680 data member. Returns a DEFAULT_ARG. */
27682 static tree
27684 {
27686 }
27688 /* Parse a template-argument-list, as well as the trailing ">" (but
27689 not the opening "<"). See cp_parser_template_argument_list for the
27690 return value. */
27692 static tree
27694 {
27695 tree arguments;
27696 tree saved_scope;
27697 tree saved_qualifying_scope;
27698 tree saved_object_scope;
27703 /* [temp.names]
27705 When parsing a template-id, the first non-nested `>' is taken as
27706 the end of the template-argument-list rather than a greater-than
27707 operator. */
27708 saved_greater_than_is_operator_p
27711 /* Parsing the argument list may modify SCOPE, so we save it
27712 here. */
27716 /* We need to evaluate the template arguments, even though this
27717 template-id may be nested within a "sizeof". */
27722 /* Parse the template-argument-list itself. */
27726 else
27728 /* Look for the `>' that ends the template-argument-list. If we find
27729 a '>>' instead, it's probably just a typo. */
27731 {
27733 {
27734 /* In C++0x, a `>>' in a template argument list or cast
27735 expression is considered to be two separate `>'
27736 tokens. So, change the current token to a `>', but don't
27737 consume it: it will be consumed later when the outer
27738 template argument list (or cast expression) is parsed.
27739 Note that this replacement of `>' for `>>' is necessary
27740 even if we are parsing tentatively: in the tentative
27741 case, after calling
27742 cp_parser_enclosed_template_argument_list we will always
27743 throw away all of the template arguments and the first
27744 closing `>', either because the template argument list
27745 was erroneous or because we are replacing those tokens
27746 with a CPP_TEMPLATE_ID token. The second `>' (which will
27747 not have been thrown away) is needed either to close an
27748 outer template argument list or to complete a new-style
27749 cast. */
27752 }
27754 {
27755 /* If we're in a nested template argument list, the '>>' has
27756 to be a typo for '> >'. We emit the error message, but we
27757 continue parsing and we push a '>' as next token, so that
27758 the argument list will be parsed correctly. Note that the
27759 global source location is still on the token before the
27760 '>>', so we need to say explicitly where we want it. */
27768 }
27769 else
27770 {
27771 /* If this is not a nested template argument list, the '>>'
27772 is a typo for '>'. Emit an error message and continue.
27773 Same deal about the token location, but here we can get it
27774 right by consuming the '>>' before issuing the diagnostic. */
27777 "spurious %<>>%>, use %<>%> to terminate "
27779 }
27780 }
27781 else
27783 /* The `>' token might be a greater-than operator again now. */
27784 parser->greater_than_is_operator_p
27786 /* Restore the SAVED_SCOPE. */
27794 }
27796 /* MEMBER_FUNCTION is a member function, or a friend. If default
27797 arguments, or the body of the function have not yet been parsed,
27798 parse them now. */
27800 static void
27802 {
27804 /* If this member is a template, get the underlying
27805 FUNCTION_DECL. */
27809 /* There should not be any class definitions in progress at this
27810 point; the bodies of members are only parsed outside of all class
27811 definitions. */
27813 /* While we're parsing the member functions we might encounter more
27814 classes. We want to handle them right away, but we don't want
27815 them getting mixed up with functions that are currently in the
27816 queue. */
27819 /* Make sure that any template parameters are in scope. */
27822 /* If the body of the function has not yet been parsed, parse it
27823 now. */
27825 {
27826 tree function_scope;
27829 /* The function is no longer pending; we are processing it. */
27834 /* If this is a local class, enter the scope of the containing
27835 function. */
27840 /* Push the body of the function onto the lexer stack. */
27843 /* Let the front end know that we going to be defining this
27844 function. */
27848 /* Don't do access checking if it is a templated function. */
27852 /* #pragma omp declare reduction needs special parsing. */
27854 {
27859 }
27860 else
27861 /* Now, parse the body of the function. */
27868 /* Leave the scope of the containing function. */
27872 }
27874 /* Remove any template parameters from the symbol table. */
27877 /* Restore the queue. */
27880 }
27882 /* If DECL contains any default args, remember it on the unparsed
27883 functions queue. */
27885 static void
27887 {
27888 tree probe;
27891 probe;
27894 {
27898 }
27899 }
27901 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27902 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27903 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27904 from the parameter-type-list. */
27906 static tree
27909 {
27911 tree parsed_arg;
27917 /* Push the saved tokens for the default argument onto the parser's
27918 lexer stack. */
27924 /* Parse the default argument. */
27935 {
27936 /* In a non-template class, check conversions now. In a template,
27937 we'll wait and instantiate these as needed. */
27940 tf_warning_or_error);
27943 else
27945 }
27947 /* If the token stream has not been completely used up, then
27948 there was extra junk after the end of the default
27949 argument. */
27951 {
27954 else
27956 }
27958 /* Revert to the main lexer. */
27962 }
27964 /* FIELD is a non-static data member with an initializer which we saved for
27965 later; parse it now. */
27967 static void
27969 {
27970 tree def;
27977 NULL_TREE);
27983 }
27985 /* FN is a FUNCTION_DECL which may contains a parameter with an
27986 unparsed DEFAULT_ARG. Parse the default args now. This function
27987 assumes that the current scope is the scope in which the default
27988 argument should be processed. */
27990 static void
27992 {
27996 /* While we're parsing the default args, we might (due to the
27997 statement expression extension) encounter more classes. We want
27998 to handle them right away, but we don't want them getting mixed
27999 up with default args that are currently in the queue. */
28002 /* Local variable names (and the `this' keyword) may not appear
28003 in a default argument. */
28014 {
28016 tree parsed_arg;
28018 tree copy;
28025 /* This can happen for a friend declaration for a function
28026 already declared with default arguments. */
28029 parsed_arg
28031 default_arg,
28035 /* Update any instantiations we've already created. */
28039 }
28043 /* Make sure no default arg is missing. */
28046 /* Restore the state of local_variables_forbidden_p. */
28049 /* Restore the queue. */
28051 }
28053 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28055 sizeof ... ( identifier )
28057 where the 'sizeof' token has already been consumed. */
28059 static tree
28061 {
28062 /* Consume the `...'. */
28066 matching_parens parens;
28070 else
28078 /* The name is not qualified. */
28097 }
28099 /* Parse the operand of `sizeof' (or a similar operator). Returns
28100 either a TYPE or an expression, depending on the form of the
28101 input. The KEYWORD indicates which kind of expression we have
28102 encountered. */
28104 static tree
28106 {
28113 /* If it's a `...', then we are computing the length of a parameter
28114 pack. */
28119 /* Types cannot be defined in a `sizeof' expression. Save away the
28120 old message. */
28122 /* And create the new one. */
28128 /* The restrictions on constant-expressions do not apply inside
28129 sizeof expressions. */
28130 saved_integral_constant_expression_p
28132 saved_non_integral_constant_expression_p
28136 /* Do not actually evaluate the expression. */
28139 /* If it's a `(', then we might be looking at the type-id
28140 construction. */
28142 {
28145 /* We can't be sure yet whether we're looking at a type-id or an
28146 expression. */
28149 matching_parens parens;
28152 /* Note: as a GNU Extension, compound literals are considered
28153 postfix-expressions as they are in C99, so they are valid
28154 arguments to sizeof. See comment in cp_parser_cast_expression
28155 for details. */
28158 else
28159 {
28162 /* Look for the type-id. */
28164 /* Look for the closing `)'. */
28167 }
28169 /* If all went well, then we're done. */
28171 {
28172 cp_decl_specifier_seq decl_specs;
28174 /* Build a trivial decl-specifier-seq. */
28178 /* Call grokdeclarator to figure out what type this is. */
28181 TYPENAME,
28184 }
28185 }
28187 /* If the type-id production did not work out, then we must be
28188 looking at the unary-expression production. */
28192 /* Go back to evaluating expressions. */
28196 /* Free the message we created. */
28198 /* And restore the old one. */
28200 parser->integral_constant_expression_p
28202 parser->non_integral_constant_expression_p
28206 }
28208 /* If the current declaration has no declarator, return true. */
28210 static bool
28212 {
28213 /* If the next token is a `;' or a `,' then there is no
28214 declarator. */
28217 }
28219 /* Update the DECL_SPECS to reflect the storage class indicated by
28220 KEYWORD. */
28222 static void
28227 {
28228 cp_storage_class storage_class;
28231 {
28235 }
28237 {
28240 }
28245 {
28248 }
28251 {
28269 }
28273 /* A storage class specifier cannot be applied alongside a typedef
28274 specifier. If there is a typedef specifier present then set
28275 conflicting_specifiers_p which will trigger an error later
28276 on in grokdeclarator. */
28279 }
28281 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28282 is true, the type is a class or enum definition. */
28284 static void
28286 tree type_spec,
28289 {
28292 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28293 (with, for example, in "typedef int wchar_t;") we remember that
28294 this is what happened. In system headers, we ignore these
28295 declarations so that G++ can work with system headers that are not
28296 C++-safe. */
28298 && !type_definition_p
28308 {
28311 ds_redefined_builtin_type_spec,
28312 token);
28314 {
28318 }
28319 }
28322 else
28323 {
28328 }
28329 }
28331 /* True iff TOKEN is the GNU keyword __thread. */
28333 static bool
28335 {
28338 }
28340 /* Set the location for a declarator specifier and check if it is
28341 duplicated.
28343 DECL_SPECS is the sequence of declarator specifiers onto which to
28344 set the location.
28346 DS is the single declarator specifier to set which location is to
28347 be set onto the existing sequence of declarators.
28349 LOCATION is the location for the declarator specifier to
28350 consider. */
28352 static void
28355 {
28364 {
28368 }
28369 else
28370 {
28372 {
28376 else
28377 {
28380 OPT_Wlong_long,
28382 }
28383 }
28385 {
28389 {
28393 }
28394 else
28395 {
28398 }
28399 }
28400 else
28401 {
28417 "__complex"
28418 };
28422 }
28423 }
28424 }
28426 /* Return true iff the declarator specifier DS is present in the
28427 sequence of declarator specifiers DECL_SPECS. */
28429 bool
28431 cp_decl_spec ds)
28432 {
28439 }
28441 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28442 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28444 static bool
28446 {
28448 }
28450 /* Issue an error message indicating that TOKEN_DESC was expected.
28451 If KEYWORD is true, it indicated this function is called by
28452 cp_parser_require_keword and the required token can only be
28453 a indicated keyword.
28455 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28456 within any error as the location of an "opening" token matching
28457 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28458 RT_CLOSE_PAREN). */
28460 static void
28462 required_token token_desc,
28464 location_t matching_location)
28465 {
28471 {
28540 }
28543 {
28545 {
28623 }
28624 }
28628 }
28631 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28632 issue an error message indicating that TOKEN_DESC was expected.
28634 Returns the token consumed, if the token had the appropriate type.
28635 Otherwise, returns NULL.
28637 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28638 within any error as the location of an "opening" token matching
28639 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28640 RT_CLOSE_PAREN). */
28645 required_token token_desc,
28646 location_t matching_location)
28647 {
28650 else
28651 {
28652 /* Output the MESSAGE -- unless we're parsing tentatively. */
28655 matching_location);
28657 }
28658 }
28660 /* An error message is produced if the next token is not '>'.
28661 All further tokens are skipped until the desired token is
28662 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28664 static void
28666 {
28667 /* Current level of '< ... >'. */
28669 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28672 /* Are we ready, yet? If not, issue error message. */
28676 /* Skip tokens until the desired token is found. */
28678 {
28679 /* Peek at the next token. */
28681 {
28689 /* C++0x views the `>>' operator as two `>' tokens, but
28690 C++98 does not. */
28693 {
28694 /* We've hit a `>>' where the first `>' closes the
28695 template argument list, and the second `>' is
28696 spurious. Just consume the `>>' and stop; we've
28697 already produced at least one error. */
28700 }
28701 /* Fall through for C++0x, so we handle the second `>' in
28702 the `>>'. */
28707 {
28708 /* We've reached the token we want, consume it and stop. */
28711 }
28730 /* The '>' was probably forgotten, don't look further. */
28735 }
28737 /* Consume this token. */
28739 }
28740 }
28742 /* If the next token is the indicated keyword, consume it. Otherwise,
28743 issue an error message indicating that TOKEN_DESC was expected.
28745 Returns the token consumed, if the token had the appropriate type.
28746 Otherwise, returns NULL. */
28751 required_token token_desc)
28752 {
28756 {
28758 UNKNOWN_LOCATION);
28760 }
28763 }
28765 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28766 function-definition. */
28768 static bool
28770 {
28773 /* A ctor-initializer begins with a `:'. */
28775 /* A function-try-block begins with `try'. */
28777 /* A function-transaction-block begins with `__transaction_atomic'
28778 or `__transaction_relaxed'. */
28781 /* The named return value extension begins with `return'. */
28783 }
28785 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28786 definition. */
28788 static bool
28790 {
28797 }
28799 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28800 C++0x) ending a template-argument. */
28802 static bool
28804 {
28812 }
28814 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28815 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28817 static bool
28820 {
28826 /* Check for the sequence `<::' in the original code. It would be lexed as
28827 `[:', where `[' is a digraph, and there is no whitespace before
28828 `:'. */
28830 {
28835 }
28837 }
28839 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28840 or none_type otherwise. */
28842 static enum tag_types
28844 {
28846 {
28856 }
28857 }
28859 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28860 or none_type otherwise or if the token is null. */
28862 static enum tag_types
28864 {
28869 {
28877 }
28878 }
28880 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28882 static void
28884 {
28888 {
28892 type))
28895 }
28896 }
28898 /* Issue an error message if DECL is redeclared with different
28899 access than its original declaration [class.access.spec/3].
28900 This applies to nested classes, nested class templates and
28901 enumerations [class.mem/1]. */
28903 static void
28905 {
28916 }
28918 /* Look for the `template' keyword, as a syntactic disambiguator.
28919 Return TRUE iff it is present, in which case it will be
28920 consumed. */
28922 static bool
28924 {
28926 {
28927 /* In C++98 the `template' keyword can only be used within templates;
28928 outside templates the parser can always figure out what is a
28929 template and what is not. In C++11, per the resolution of DR 468,
28930 `template' is allowed in cases where it is not strictly necessary. */
28933 {
28936 "in C++98 %<template%> (as a disambiguator) is only "
28938 /* If this part of the token stream is rescanned, the same
28939 error message would be generated. So, we purge the token
28940 from the stream. */
28943 }
28944 else
28945 {
28946 /* Consume the `template' keyword. */
28949 }
28950 }
28952 }
28954 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28955 set PARSER->SCOPE, and perform other related actions. */
28957 static void
28959 {
28962 /* Get the stored value. */
28964 /* Set the scope from the stored value. */
28968 }
28970 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28971 encounter the end of a block before what we were looking for. */
28973 static bool
28977 {
28979 {
28982 /* Abort a parenthesized expression if we encounter a semicolon. */
28986 /* If we've reached the end of the file, stop. */
28992 /* We've hit the end of an enclosing block, so there's been some
28993 kind of syntax error. */
28996 /* Consume the token. */
28998 /* See if it starts a new group. */
29000 {
29002 /* In theory this should probably check end == '}', but
29003 cp_parser_save_member_function_body needs it to exit
29004 after either '}' or ')' when called with ')'. */
29007 }
29009 {
29013 }
29018 }
29019 }
29021 /* Like above, for caching a default argument or NSDMI. Both of these are
29022 terminated by a non-nested comma, but it can be unclear whether or not a
29023 comma is nested in a template argument list unless we do more parsing.
29024 In order to handle this ambiguity, when we encounter a ',' after a '<'
29025 we try to parse what follows as a parameter-declaration-list (in the
29026 case of a default argument) or a member-declarator (in the case of an
29027 NSDMI). If that succeeds, then we stop caching. */
29029 static tree
29031 {
29036 tree default_argument;
29038 /* Add tokens until we have processed the entire default
29039 argument. We add the range [first_token, token). */
29042 {
29043 /* For list-initialization, this is straightforward. */
29046 }
29048 {
29051 /* Peek at the next token. */
29053 /* What we do depends on what token we have. */
29055 {
29056 /* In valid code, a default argument must be
29057 immediately followed by a `,' `)', or `...'. */
29060 {
29061 /* If we've seen a '<', we might be in a
29062 template-argument-list. Until Core issue 325 is
29063 resolved, we don't know how this situation ought
29064 to be handled, so try to DTRT. We check whether
29065 what comes after the comma is a valid parameter
29066 declaration list. If it is, then the comma ends
29067 the default argument; otherwise the default
29068 argument continues. */
29072 /* Set ITALP so cp_parser_parameter_declaration_list
29073 doesn't decide to commit to this parse. */
29080 {
29081 /* Parse declarators until we reach a non-comma or
29082 somthing that cannot be an initializer.
29083 Just checking whether we're looking at a single
29084 declarator is insufficient. Consider:
29085 int var = tuple<T,U>::x;
29086 The template parameter 'U' looks exactly like a
29087 declarator. */
29088 do
29089 {
29100 }
29102 /* If we met an '=' or ';' then the original comma
29103 was the end of the NSDMI. Otherwise assume
29104 we're still in the NSDMI. */
29107 }
29108 else
29109 {
29116 }
29123 }
29124 /* FALLTHRU */
29127 /* If we run into a non-nested `;', `}', or `]',
29128 then the code is invalid -- but the default
29129 argument is certainly over. */
29134 /* Handle correctly int n = sizeof ... ( p ); */
29137 /* Update DEPTH, if necessary. */
29152 /* This might be the comparison operator, or it might
29153 start a template argument list. */
29160 /* Fall through for C++0x, which treats the `>>'
29161 operator like two `>' tokens in certain
29162 cases. */
29167 {
29168 /* This might be an operator, or it might close a
29169 template argument list. But if a previous '<'
29170 started a template argument list, this will have
29171 closed it, so we can't be in one anymore. */
29175 }
29178 /* If we run out of tokens, issue an error message. */
29186 /* In these cases, we should look for template-ids.
29187 For example, if the default argument is
29188 `X<int, double>()', we need to do name lookup to
29189 figure out whether or not `X' is a template; if
29190 so, the `,' does not end the default argument.
29192 That is not yet done. */
29197 }
29199 /* If we've reached the end, stop. */
29203 /* Add the token to the token block. */
29205 }
29207 /* Create a DEFAULT_ARG to represent the unparsed default
29208 argument. */
29215 }
29217 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29219 location_t
29221 {
29226 }
29228 /* Begin parsing tentatively. We always save tokens while parsing
29229 tentatively so that if the tentative parsing fails we can restore the
29230 tokens. */
29232 static void
29234 {
29235 /* Enter a new parsing context. */
29237 /* Begin saving tokens. */
29239 /* In order to avoid repetitive access control error messages,
29240 access checks are queued up until we are no longer parsing
29241 tentatively. */
29243 }
29245 /* Commit to the currently active tentative parse. */
29247 static void
29249 {
29253 /* Mark all of the levels as committed. */
29256 {
29263 }
29264 }
29266 /* Commit to the topmost currently active tentative parse.
29268 Note that this function shouldn't be called when there are
29269 irreversible side-effects while in a tentative state. For
29270 example, we shouldn't create a permanent entry in the symbol
29271 table, or issue an error message that might not apply if the
29272 tentative parse is aborted. */
29274 static void
29276 {
29281 {
29289 }
29290 }
29292 /* Abort the currently active tentative parse. All consumed tokens
29293 will be rolled back, and no diagnostics will be issued. */
29295 static void
29297 {
29301 /* Now, pretend that we want to see if the construct was
29302 successfully parsed. */
29304 }
29306 /* Stop parsing tentatively. If a parse error has occurred, restore the
29307 token stream. Otherwise, commit to the tokens we have consumed.
29308 Returns true if no error occurred; false otherwise. */
29310 static bool
29312 {
29316 /* Remember whether or not an error occurred, since we are about to
29317 destroy that information. */
29319 /* Remove the topmost context from the stack. */
29322 /* If no parse errors occurred, commit to the tentative parse. */
29324 {
29325 /* Commit to the tokens read tentatively, unless that was
29326 already done. */
29331 }
29332 /* Otherwise, if errors occurred, roll back our state so that things
29333 are just as they were before we began the tentative parse. */
29334 else
29335 {
29338 }
29339 /* Add the context to the front of the free list. */
29344 }
29346 /* Returns true if we are parsing tentatively and are not committed to
29347 this tentative parse. */
29349 static bool
29351 {
29354 }
29356 /* Returns nonzero iff an error has occurred during the most recent
29357 tentative parse. */
29359 static bool
29361 {
29364 }
29366 /* Returns nonzero if GNU extensions are allowed. */
29368 static bool
29370 {
29372 }
29373 \f
29374 /* Objective-C++ Productions */
29377 /* Parse an Objective-C expression, which feeds into a primary-expression
29378 above.
29380 objc-expression:
29381 objc-message-expression
29382 objc-string-literal
29383 objc-encode-expression
29384 objc-protocol-expression
29385 objc-selector-expression
29387 Returns a tree representation of the expression. */
29389 static cp_expr
29391 {
29392 /* Try to figure out what kind of declaration is present. */
29396 {
29406 {
29418 }
29419 /* FALLTHRU */
29425 }
29428 }
29430 /* Parse an Objective-C message expression.
29432 objc-message-expression:
29433 [ objc-message-receiver objc-message-args ]
29435 Returns a representation of an Objective-C message. */
29437 static tree
29439 {
29451 /* Construct a location e.g.
29452 [self func1:5]
29453 ^~~~~~~~~~~~~~
29454 ranging from the '[' to the ']', with the caret at the start. */
29459 }
29461 /* Parse an objc-message-receiver.
29463 objc-message-receiver:
29464 expression
29465 simple-type-specifier
29467 Returns a representation of the type or expression. */
29469 static tree
29471 {
29472 tree rcv;
29474 /* An Objective-C message receiver may be either (1) a type
29475 or (2) an expression. */
29479 /* If that worked out, fine. */
29486 CP_PARSER_FLAGS_NONE);
29493 }
29495 /* Parse the arguments and selectors comprising an Objective-C message.
29497 objc-message-args:
29498 objc-selector
29499 objc-selector-args
29500 objc-selector-args , objc-comma-args
29502 objc-selector-args:
29503 objc-selector [opt] : assignment-expression
29504 objc-selector-args objc-selector [opt] : assignment-expression
29506 objc-comma-args:
29507 assignment-expression
29508 objc-comma-args , assignment-expression
29510 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29511 selector arguments and TREE_VALUE containing a list of comma
29512 arguments. */
29514 static tree
29516 {
29522 {
29528 /* Detect if we have a unary selector. */
29537 sel_args
29542 }
29544 /* Handle non-selector arguments, if any. */
29546 {
29547 tree arg;
29552 addl_args
29557 }
29560 {
29563 }
29566 }
29568 /* Parse an Objective-C encode expression.
29570 objc-encode-expression:
29571 @encode objc-typename
29573 Returns an encoded representation of the type argument. */
29575 static cp_expr
29577 {
29578 tree type;
29583 matching_parens parens;
29590 {
29594 }
29596 /* This happens if we find @encode(T) (where T is a template
29597 typename or something dependent on a template typename) when
29598 parsing a template. In that case, we can't compile it
29599 immediately, but we rather create an AT_ENCODE_EXPR which will
29600 need to be instantiated when the template is used.
29601 */
29603 {
29607 }
29610 /* Build a location of the form:
29611 @encode(int)
29612 ^~~~~~~~~~~~
29613 with caret==start at the @ token, finishing at the close paren. */
29614 location_t combined_loc
29619 }
29621 /* Parse an Objective-C @defs expression. */
29623 static tree
29625 {
29626 tree name;
29629 matching_parens parens;
29635 }
29637 /* Parse an Objective-C protocol expression.
29639 objc-protocol-expression:
29640 @protocol ( identifier )
29642 Returns a representation of the protocol expression. */
29644 static tree
29646 {
29647 tree proto;
29651 matching_parens parens;
29656 /* Build a location of the form:
29657 @protocol(prot)
29658 ^~~~~~~~~~~~~~~
29659 with caret==start at the @ token, finishing at the close paren. */
29660 location_t combined_loc
29666 }
29668 /* Parse an Objective-C selector expression.
29670 objc-selector-expression:
29671 @selector ( objc-method-signature )
29673 objc-method-signature:
29674 objc-selector
29675 objc-selector-seq
29677 objc-selector-seq:
29678 objc-selector :
29679 objc-selector-seq objc-selector :
29681 Returns a representation of the method selector. */
29683 static tree
29685 {
29692 matching_parens parens;
29698 {
29707 {
29708 /* Detect if we have a unary selector. */
29710 {
29713 }
29714 else
29715 {
29717 }
29718 }
29723 {
29724 sel_seq
29727 sel_seq
29730 }
29731 else
29732 sel_seq
29737 }
29739 finish_selector:
29743 /* Build a location of the form:
29744 @selector(func)
29745 ^~~~~~~~~~~~~~~
29746 with caret==start at the @ token, finishing at the close paren. */
29747 location_t combined_loc
29751 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29754 }
29756 /* Parse a list of identifiers.
29758 objc-identifier-list:
29759 identifier
29760 objc-identifier-list , identifier
29762 Returns a TREE_LIST of identifier nodes. */
29764 static tree
29766 {
29767 tree identifier;
29768 tree list;
29779 {
29786 identifier));
29788 }
29791 }
29793 /* Parse an Objective-C alias declaration.
29795 objc-alias-declaration:
29796 @compatibility_alias identifier identifier ;
29798 This function registers the alias mapping with the Objective-C front end.
29799 It returns nothing. */
29801 static void
29803 {
29811 }
29813 /* Parse an Objective-C class forward-declaration.
29815 objc-class-declaration:
29816 @class objc-identifier-list ;
29818 The function registers the forward declarations with the Objective-C
29819 front end. It returns nothing. */
29821 static void
29823 {
29826 {
29827 tree id;
29837 else
29839 }
29841 }
29843 /* Parse a list of Objective-C protocol references.
29845 objc-protocol-refs-opt:
29846 objc-protocol-refs [opt]
29848 objc-protocol-refs:
29849 < objc-identifier-list >
29851 Returns a TREE_LIST of identifiers, if any. */
29853 static tree
29855 {
29859 {
29863 }
29866 }
29868 /* Parse a Objective-C visibility specification. */
29870 static void
29872 {
29876 {
29891 }
29893 /* Eat '@private'/'@protected'/'@public'. */
29895 }
29897 /* Parse an Objective-C method type. Return 'true' if it is a class
29898 (+) method, and 'false' if it is an instance (-) method. */
29902 {
29905 else
29907 }
29909 /* Parse an Objective-C protocol qualifier. */
29911 static tree
29913 {
29926 {
29931 }
29934 }
29936 /* Parse an Objective-C typename. */
29938 static tree
29940 {
29944 {
29947 matching_parens parens;
29951 /* An ObjC type name may consist of just protocol qualifiers, in which
29952 case the type shall default to 'id'. */
29954 {
29957 /* If the type could not be parsed, an error has already
29958 been produced. For error recovery, behave as if it had
29959 not been specified, which will use the default type
29960 'id'. */
29962 {
29964 /* We need to skip to the closing parenthesis as
29965 cp_parser_type_id() does not seem to do it for
29966 us. */
29971 }
29972 }
29976 }
29979 }
29981 /* Check to see if TYPE refers to an Objective-C selector name. */
29983 static bool
29985 {
29991 }
29993 /* Parse an Objective-C selector. */
29995 static tree
29997 {
30001 {
30004 }
30006 /* C++ operator names are allowed to appear in ObjC selectors. */
30008 {
30021 }
30022 }
30024 /* Parse an Objective-C params list. */
30026 static tree
30028 {
30034 {
30044 /* Detect if we have a unary selector. */
30047 {
30050 }
30054 {
30055 /* Something went quite wrong. There should be a colon
30056 here, but there is not. Stop parsing parameters. */
30058 }
30060 /* New ObjC allows attributes on parameters too. */
30065 params
30068 type_name,
30069 identifier,
30070 parm_attr));
30073 }
30076 {
30079 }
30081 /* We allow tail attributes for the method. */
30083 {
30091 }
30094 {
30097 }
30099 }
30101 /* Parse the non-keyword Objective-C params. */
30103 static tree
30106 {
30112 {
30114 tree parm;
30120 {
30125 }
30127 /* TODO: parse attributes for tail parameters. */
30136 }
30138 /* We allow tail attributes for the method. */
30140 {
30142 {
30147 }
30148 else
30149 /* We have an error, but parse the attributes, so that we can
30150 carry on. */
30156 }
30159 }
30161 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30163 static void
30165 {
30168 /* If the next token is `extern' and the following token is a string
30169 literal, then we have a linkage specification. */
30171 && cp_parser_is_pure_string_literal
30174 /* Handle #pragma, if any. */
30177 /* Allow stray semicolons. */
30180 /* Mark methods as optional or required, when building protocols. */
30182 {
30185 }
30187 {
30190 }
30193 /* Other stray characters must generate errors. */
30195 {
30199 }
30200 /* Finally, try to parse a block-declaration, or a function-definition. */
30201 else
30203 }
30205 /* Parse a method signature. */
30207 static tree
30209 {
30225 }
30227 static bool
30229 {
30230 tree tattr;
30235 /* If the attributes are followed by a method introducer, this is not allowed.
30236 Dump the attributes and flag the situation. */
30241 /* Otherwise, the attributes introduce some interstitial code, possibly so
30242 rewind to allow that check. */
30245 }
30247 /* Parse an Objective-C method prototype list. */
30249 static void
30251 {
30255 {
30257 {
30262 else
30266 {
30270 }
30273 }
30279 OPT_Wattributes,
30281 else
30282 /* Allow for interspersed non-ObjC++ code. */
30286 }
30290 else
30294 }
30296 /* Parse an Objective-C method definition list. */
30298 static void
30300 {
30304 {
30305 tree meth;
30308 {
30314 else
30319 {
30323 }
30325 NULL_TREE);
30327 /* For historical reasons, we accept an optional semicolon. */
30334 {
30341 }
30342 }
30343 /* The following case will be removed once @synthesize is
30344 completely implemented. */
30355 else
30356 /* Allow for interspersed non-ObjC++ code. */
30360 }
30364 else
30368 }
30370 /* Parse Objective-C ivars. */
30372 static void
30374 {
30385 {
30386 cp_decl_specifier_seq declspecs;
30388 tree prefix_attributes;
30396 CP_PARSER_FLAGS_OPTIONAL,
30400 /* auto, register, static, extern, mutable. */
30402 {
30405 }
30407 /* thread_local. */
30409 {
30412 }
30414 /* typedef. */
30416 {
30419 }
30424 /* Keep going until we hit the `;' at the end of the
30425 declaration. */
30427 {
30432 /* Check for a (possibly unnamed) bitfield declaration. */
30440 {
30441 /* Get the name of the bitfield. */
30444 sfk_none);
30446 eat_colon:
30448 /* Get the width of the bitfield. */
30449 width
30451 }
30452 else
30453 {
30454 /* Parse the declarator. */
30455 declarator
30461 }
30463 /* Look for attributes that apply to the ivar. */
30465 /* Remember which attributes are prefix attributes and
30466 which are not. */
30468 /* Combine the attributes. */
30472 /* Create the bitfield declaration. */
30475 else
30480 /* Add the instance variable. */
30484 /* Reset PREFIX_ATTRIBUTES. */
30486 {
30491 }
30496 {
30499 }
30501 }
30505 }
30510 /* Do not consume the RID_AT_END, so it will be read again as terminating
30511 the @interface of @implementation. */
30515 /* For historical reasons, we accept an optional semicolon. */
30518 }
30520 /* Parse an Objective-C protocol declaration. */
30522 static void
30524 {
30530 {
30535 }
30537 /* See if we have a forward declaration or a definition. */
30540 /* Try a forward declaration first. */
30542 {
30544 {
30545 tree id;
30555 else
30557 }
30559 }
30561 /* Ok, we got a full-fledged definition (or at least should). */
30562 else
30563 {
30568 }
30569 }
30571 /* Parse an Objective-C superclass or category. */
30573 static void
30578 {
30584 {
30587 }
30589 {
30590 matching_parens parens;
30593 /* If there is no category name, and this is an @interface, we
30594 have a class extension. */
30596 {
30599 }
30600 else
30604 }
30605 }
30607 /* Parse an Objective-C class interface. */
30609 static void
30611 {
30618 {
30619 /* It's hard to recover because even if valid @interface stuff
30620 is to follow, we can't compile it (or validate it) if we
30621 don't even know which class it refers to. Let's assume this
30622 was a stray '@interface' token in the stream and skip it.
30623 */
30625 }
30630 /* We have either a class or a category on our hands. */
30633 else
30634 {
30636 /* Handle instance variable declarations, if any. */
30639 }
30642 }
30644 /* Parse an Objective-C class implementation. */
30646 static void
30648 {
30655 {
30656 /* It's hard to recover because even if valid @implementation
30657 stuff is to follow, we can't compile it (or validate it) if
30658 we don't even know which class it refers to. Let's assume
30659 this was a stray '@implementation' token in the stream and
30660 skip it.
30661 */
30663 }
30667 /* We have either a class or a category on our hands. */
30670 else
30671 {
30673 /* Handle instance variable declarations, if any. */
30676 }
30679 }
30681 /* Consume the @end token and finish off the implementation. */
30683 static void
30685 {
30688 }
30690 /* Parse an Objective-C declaration. */
30692 static void
30694 {
30695 /* Try to figure out what kind of declaration is present. */
30700 {
30716 }
30719 {
30742 }
30743 }
30745 /* Parse an Objective-C try-catch-finally statement.
30747 objc-try-catch-finally-stmt:
30748 @try compound-statement objc-catch-clause-seq [opt]
30749 objc-finally-clause [opt]
30751 objc-catch-clause-seq:
30752 objc-catch-clause objc-catch-clause-seq [opt]
30754 objc-catch-clause:
30755 @catch ( objc-exception-declaration ) compound-statement
30757 objc-finally-clause:
30758 @finally compound-statement
30760 objc-exception-declaration:
30761 parameter-declaration
30762 '...'
30764 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30766 Returns NULL_TREE.
30768 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30769 for C. Keep them in sync. */
30771 static tree
30773 {
30774 location_t location;
30775 tree stmt;
30780 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30781 node, lest it get absorbed into the surrounding block. */
30787 {
30791 matching_parens parens;
30797 {
30798 /* We have "@catch (...)" (where the '...' are literally
30799 what is in the code). Skip the '...'.
30800 parameter_declaration is set to NULL_TREE, and
30801 objc_being_catch_clauses() knows that that means
30802 '...'. */
30805 }
30806 else
30807 {
30808 /* We have "@catch (NSException *exception)" or something
30809 like that. Parse the parameter declaration. */
30813 else
30818 }
30821 else
30822 {
30823 /* If there was no open parenthesis, we are recovering from
30824 an error, and we are trying to figure out what mistake
30825 the user has made. */
30827 /* If there is an immediate closing parenthesis, the user
30828 probably forgot the opening one (ie, they typed "@catch
30829 NSException *e)". Parse the closing parenthesis and keep
30830 going. */
30834 /* If these is no immediate closing parenthesis, the user
30835 probably doesn't know that parenthesis are required at
30836 all (ie, they typed "@catch NSException *e"). So, just
30837 forget about the closing parenthesis and keep going. */
30838 }
30842 }
30844 {
30847 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30848 node, lest it get absorbed into the surrounding block. */
30852 }
30855 }
30857 /* Parse an Objective-C synchronized statement.
30859 objc-synchronized-stmt:
30860 @synchronized ( expression ) compound-statement
30862 Returns NULL_TREE. */
30864 static tree
30866 {
30867 location_t location;
30874 matching_parens parens;
30879 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30880 node, lest it get absorbed into the surrounding block. */
30885 }
30887 /* Parse an Objective-C throw statement.
30889 objc-throw-stmt:
30890 @throw assignment-expression [opt] ;
30892 Returns a constructed '@throw' statement. */
30894 static tree
30896 {
30908 }
30910 /* Parse an Objective-C statement. */
30912 static tree
30914 {
30915 /* Try to figure out what kind of declaration is present. */
30919 {
30930 }
30933 }
30935 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30936 look ahead to see if an objc keyword follows the attributes. This
30937 is to detect the use of prefix attributes on ObjC @interface and
30938 @protocol. */
30940 static bool
30942 {
30947 {
30950 }
30953 }
30955 /* This routine is a minimal replacement for
30956 c_parser_struct_declaration () used when parsing the list of
30957 types/names or ObjC++ properties. For example, when parsing the
30958 code
30960 @property (readonly) int a, b, c;
30962 this function is responsible for parsing "int a, int b, int c" and
30963 returning the declarations as CHAIN of DECLs.
30965 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30966 similar parsing. */
30967 static tree
30969 {
30971 cp_decl_specifier_seq declspecs;
30973 tree prefix_attributes;
30976 CP_PARSER_FLAGS_NONE,
30983 /* auto, register, static, extern, mutable. */
30985 {
30988 }
30990 /* thread_local. */
30992 {
30995 }
30997 /* typedef. */
30999 {
31002 }
31007 /* Keep going until we hit the `;' at the end of the declaration. */
31009 {
31014 /* Parse the declarator. */
31018 /* Look for attributes that apply to the ivar. */
31020 /* Remember which attributes are prefix attributes and
31021 which are not. */
31023 /* Combine the attributes. */
31033 /* Reset PREFIX_ATTRIBUTES. */
31035 {
31040 }
31047 {
31050 }
31051 else
31053 }
31055 }
31057 /* Parse an Objective-C @property declaration. The syntax is:
31059 objc-property-declaration:
31060 '@property' objc-property-attributes[opt] struct-declaration ;
31062 objc-property-attributes:
31063 '(' objc-property-attribute-list ')'
31065 objc-property-attribute-list:
31066 objc-property-attribute
31067 objc-property-attribute-list, objc-property-attribute
31069 objc-property-attribute
31070 'getter' = identifier
31071 'setter' = identifier
31072 'readonly'
31073 'readwrite'
31074 'assign'
31075 'retain'
31076 'copy'
31077 'nonatomic'
31079 For example:
31080 @property NSString *name;
31081 @property (readonly) id object;
31082 @property (retain, nonatomic, getter=getTheName) id name;
31083 @property int a, b, c;
31085 PS: This function is identical to
31086 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31087 static void
31089 {
31090 /* The following variables hold the attributes of the properties as
31091 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31092 seen. When we see an attribute, we set them to 'true' (if they
31093 are boolean properties) or to the identifier (if they have an
31094 argument, ie, for getter and setter). Note that here we only
31095 parse the list of attributes, check the syntax and accumulate the
31096 attributes that we find. objc_add_property_declaration() will
31097 then process the information. */
31107 /* 'properties' is the list of properties that we read. Usually a
31108 single one, but maybe more (eg, in "@property int a, b, c;" there
31109 are three). */
31110 tree properties;
31111 location_t loc;
31117 /* Parse the optional attribute list... */
31119 {
31120 /* Eat the '('. */
31121 matching_parens parens;
31125 {
31131 {
31134 }
31138 {
31149 {
31153 else
31158 }
31161 {
31165 }
31167 {
31169 {
31172 }
31173 else
31177 else
31179 }
31180 else
31181 {
31183 {
31186 }
31187 else
31189 }
31195 }
31202 else
31204 }
31206 /* FIXME: "@property (setter, assign);" will generate a spurious
31207 "error: expected ‘)’ before ‘,’ token". This is because
31208 cp_parser_require, unlike the C counterpart, will produce an
31209 error even if we are in error recovery. */
31211 {
31216 }
31217 }
31219 /* ... and the property declaration(s). */
31223 {
31225 /* If the next token is now a `;', consume it. */
31229 }
31233 else
31234 {
31235 /* Comma-separated properties are chained together in
31236 reverse order; add them one by one. */
31245 }
31248 }
31250 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31252 objc-synthesize-declaration:
31253 @synthesize objc-synthesize-identifier-list ;
31255 objc-synthesize-identifier-list:
31256 objc-synthesize-identifier
31257 objc-synthesize-identifier-list, objc-synthesize-identifier
31259 objc-synthesize-identifier
31260 identifier
31261 identifier = identifier
31263 For example:
31264 @synthesize MyProperty;
31265 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31267 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31268 for C. Keep them in sync.
31269 */
31270 static void
31272 {
31274 location_t loc;
31279 {
31283 {
31286 }
31288 {
31292 {
31295 }
31296 }
31297 else
31302 else
31304 }
31307 }
31309 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31311 objc-dynamic-declaration:
31312 @dynamic identifier-list ;
31314 For example:
31315 @dynamic MyProperty;
31316 @dynamic MyProperty, AnotherProperty;
31318 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31319 for C. Keep them in sync.
31320 */
31321 static void
31323 {
31325 location_t loc;
31330 {
31331 tree property;
31334 {
31337 }
31341 else
31343 }
31346 }
31348 \f
31349 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31351 /* Returns name of the next clause.
31352 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31353 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31354 returned and the token is consumed. */
31356 static pragma_omp_clause
31358 {
31374 {
31379 {
31560 }
31561 }
31567 }
31569 /* Validate that a clause of the given type does not already exist. */
31571 static void
31574 {
31575 tree c;
31579 {
31582 }
31583 }
31585 /* OpenMP 2.5:
31586 variable-list:
31587 identifier
31588 variable-list , identifier
31590 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31591 colon). An opening parenthesis will have been consumed by the caller.
31593 If KIND is nonzero, create the appropriate node and install the decl
31594 in OMP_CLAUSE_DECL and add the node to the head of the list.
31596 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31597 return the list created.
31599 COLON can be NULL if only closing parenthesis should end the list,
31600 or pointer to bool which will receive false if the list is terminated
31601 by closing parenthesis or true if the list is terminated by colon. */
31603 static tree
31606 {
31610 {
31613 }
31615 {
31620 && current_class_ptr
31622 {
31628 }
31629 else
31630 {
31641 else
31646 }
31648 ;
31650 {
31652 {
31654 /* The OpenACC cache directive explicitly only allows "array
31655 elements or subarrays". */
31657 {
31661 }
31662 /* FALLTHROUGH. */
31667 {
31668 location_t loc
31673 decl
31677 }
31678 /* FALLTHROUGH. */
31682 {
31690 parser->colon_corrects_to_scope_p
31694 else
31695 {
31696 /* Look for `:'. */
31700 CPP_CLOSE_SQUARE))
31702 }
31703 /* Look for the closing `]'. */
31705 RT_CLOSE_SQUARE))
31709 }
31713 }
31719 }
31720 else
31723 get_comma:
31727 }
31733 {
31737 }
31740 {
31743 /* Try to resync to an unnested comma. Copied from
31744 cp_parser_parenthesized_expression_list. */
31745 skip_comma:
31754 }
31757 }
31759 /* Similarly, but expect leading and trailing parenthesis. This is a very
31760 common case for omp clauses. */
31762 static tree
31764 {
31768 }
31770 /* OpenACC 2.0:
31771 copy ( variable-list )
31772 copyin ( variable-list )
31773 copyout ( variable-list )
31774 create ( variable-list )
31775 delete ( variable-list )
31776 present ( variable-list ) */
31778 static tree
31780 tree list)
31781 {
31784 {
31817 }
31825 }
31827 /* OpenACC 2.0:
31828 deviceptr ( variable-list ) */
31830 static tree
31832 {
31836 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31837 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31838 variable-list must only allow for pointer variables. */
31841 {
31848 }
31851 }
31853 /* OpenACC 2.5:
31854 auto
31855 finalize
31856 independent
31857 nohost
31858 seq */
31860 static tree
31864 {
31869 }
31871 /* OpenACC:
31872 num_gangs ( expression )
31873 num_workers ( expression )
31874 vector_length ( expression ) */
31876 static tree
31879 {
31882 matching_parens parens;
31890 {
31895 }
31903 }
31905 /* OpenACC:
31907 gang [( gang-arg-list )]
31908 worker [( [num:] int-expr )]
31909 vector [( [length:] int-expr )]
31911 where gang-arg is one of:
31913 [num:] int-expr
31914 static: size-expr
31916 and size-expr may be:
31918 *
31919 int-expr
31920 */
31922 static tree
31925 {
31935 {
31936 matching_parens parens;
31939 do
31940 {
31944 /* Gang static argument. */
31947 {
31955 {
31958 }
31960 /* Check for the '*' argument. */
31964 CPP_CLOSE_PAREN)))
31965 {
31970 {
31973 }
31975 }
31976 }
31977 /* Worker num: argument and vector length: arguments. */
31981 {
31984 }
31986 /* Now collect the actual argument. */
31988 {
31991 }
32003 {
32006 }
32008 }
32013 }
32027 cleanup_error:
32030 }
32032 /* OpenACC 2.0:
32033 tile ( size-expr-list ) */
32035 static tree
32037 {
32041 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32042 so, but the spec authors never considered such a case and have
32043 differing opinions on what it might mean, including 'not
32044 allowed'.) */
32047 clause_loc);
32052 do
32053 {
32060 {
32063 }
32064 else
32068 }
32071 /* Consume the trailing ')'. */
32079 }
32081 /* OpenACC 2.0
32082 Parse wait clause or directive parameters. */
32084 static tree
32086 {
32096 {
32101 }
32108 {
32112 {
32115 else
32116 {
32123 }
32124 }
32125 }
32128 }
32130 /* OpenACC:
32131 wait ( int-expr-list ) */
32133 static tree
32135 {
32144 }
32146 /* OpenMP 3.0:
32147 collapse ( constant-expression ) */
32149 static tree
32151 {
32153 location_t loc;
32154 HOST_WIDE_INT n;
32157 matching_parens parens;
32175 {
32178 }
32187 }
32189 /* OpenMP 2.5:
32190 default ( none | shared )
32192 OpenACC:
32193 default ( none | present ) */
32195 static tree
32198 {
32200 tree c;
32202 matching_parens parens;
32206 {
32211 {
32232 }
32235 }
32236 else
32237 {
32238 invalid_kind:
32241 else
32243 }
32260 }
32262 /* OpenMP 3.1:
32263 final ( expression ) */
32265 static tree
32267 {
32270 matching_parens parens;
32289 }
32291 /* OpenMP 2.5:
32292 if ( expression )
32294 OpenMP 4.5:
32295 if ( directive-name-modifier : expression )
32297 directive-name-modifier:
32298 parallel | task | taskloop | target data | target | target update
32299 | target enter data | target exit data */
32301 static tree
32304 {
32308 matching_parens parens;
32313 {
32325 {
32328 {
32341 else
32342 {
32343 location_t loc
32348 }
32351 {
32353 {
32358 }
32360 {
32361 location_t loc
32365 }
32366 }
32367 }
32368 }
32370 {
32372 {
32375 }
32376 else
32377 {
32379 {
32380 location_t loc
32383 }
32385 }
32386 }
32387 }
32399 {
32402 {
32405 {
32415 }
32417 p);
32419 }
32421 {
32424 else
32427 }
32430 {
32434 }
32435 }
32443 }
32445 /* OpenMP 3.1:
32446 mergeable */
32448 static tree
32451 {
32452 tree c;
32455 location);
32460 }
32462 /* OpenMP 2.5:
32463 nowait */
32465 static tree
32468 {
32469 tree c;
32476 }
32478 /* OpenMP 2.5:
32479 num_threads ( expression ) */
32481 static tree
32483 location_t location)
32484 {
32487 matching_parens parens;
32507 }
32509 /* OpenMP 4.5:
32510 num_tasks ( expression ) */
32512 static tree
32514 location_t location)
32515 {
32518 matching_parens parens;
32538 }
32540 /* OpenMP 4.5:
32541 grainsize ( expression ) */
32543 static tree
32545 location_t location)
32546 {
32549 matching_parens parens;
32569 }
32571 /* OpenMP 4.5:
32572 priority ( expression ) */
32574 static tree
32576 location_t location)
32577 {
32580 matching_parens parens;
32600 }
32602 /* OpenMP 4.5:
32603 hint ( expression ) */
32605 static tree
32607 location_t location)
32608 {
32611 matching_parens parens;
32630 }
32632 /* OpenMP 4.5:
32633 defaultmap ( tofrom : scalar ) */
32635 static tree
32637 location_t location)
32638 {
32642 matching_parens parens;
32647 {
32650 }
32654 {
32657 }
32663 {
32666 }
32670 {
32673 }
32679 location);
32685 out_err:
32690 }
32692 /* OpenMP 2.5:
32693 ordered
32695 OpenMP 4.5:
32696 ordered ( constant-expression ) */
32698 static tree
32701 {
32703 HOST_WIDE_INT n;
32709 {
32710 matching_parens parens;
32727 {
32729 "ordered argument needs positive constant integer "
32732 }
32733 }
32739 }
32741 /* OpenMP 2.5:
32742 reduction ( reduction-operator : variable-list )
32744 reduction-operator:
32745 One of: + * - & ^ | && ||
32747 OpenMP 3.1:
32749 reduction-operator:
32750 One of: + * - & ^ | && || min max
32752 OpenMP 4.0:
32754 reduction-operator:
32755 One of: + * - & ^ | && ||
32756 id-expression */
32758 static tree
32760 {
32768 {
32778 }
32782 else
32783 {
32794 {
32824 }
32825 else
32826 {
32828 resync_fail:
32833 }
32834 }
32840 NULL);
32842 {
32845 }
32848 }
32850 /* OpenMP 2.5:
32851 schedule ( schedule-kind )
32852 schedule ( schedule-kind , expression )
32854 schedule-kind:
32855 static | dynamic | guided | runtime | auto
32857 OpenMP 4.5:
32858 schedule ( schedule-modifier : schedule-kind )
32859 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32861 schedule-modifier:
32862 simd
32863 monotonic
32864 nonmonotonic */
32866 static tree
32868 {
32872 matching_parens parens;
32879 {
32888 else
32894 else
32895 {
32898 }
32899 }
32902 {
32907 {
32928 }
32929 }
32934 else
32940 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32942 {
32946 }
32949 {
32964 else
32969 }
32981 invalid_kind:
32983 resync_fail:
32988 }
32990 /* OpenMP 3.0:
32991 untied */
32993 static tree
32996 {
32997 tree c;
33004 }
33006 /* OpenMP 4.0:
33007 inbranch
33008 notinbranch */
33010 static tree
33013 {
33018 }
33020 /* OpenMP 4.0:
33021 parallel
33022 for
33023 sections
33024 taskgroup */
33026 static tree
33030 {
33034 }
33036 /* OpenMP 4.5:
33037 nogroup */
33039 static tree
33042 {
33047 }
33049 /* OpenMP 4.5:
33050 simd
33051 threads */
33053 static tree
33057 {
33062 }
33064 /* OpenMP 4.0:
33065 num_teams ( expression ) */
33067 static tree
33069 location_t location)
33070 {
33073 matching_parens parens;
33093 }
33095 /* OpenMP 4.0:
33096 thread_limit ( expression ) */
33098 static tree
33100 location_t location)
33101 {
33104 matching_parens parens;
33124 }
33126 /* OpenMP 4.0:
33127 aligned ( variable-list )
33128 aligned ( variable-list : constant-expression ) */
33130 static tree
33132 {
33136 matching_parens parens;
33144 {
33154 }
33160 }
33162 /* OpenMP 4.0:
33163 linear ( variable-list )
33164 linear ( variable-list : expression )
33166 OpenMP 4.5:
33167 linear ( modifier ( variable-list ) )
33168 linear ( modifier ( variable-list ) : expression ) */
33170 static tree
33173 {
33178 matching_parens parens;
33183 {
33195 else
33197 }
33202 else
33203 {
33212 }
33215 {
33220 {
33231 {
33234 }
33237 }
33248 }
33251 {
33254 }
33257 }
33259 /* OpenMP 4.0:
33260 safelen ( constant-expression ) */
33262 static tree
33264 location_t location)
33265 {
33268 matching_parens parens;
33287 }
33289 /* OpenMP 4.0:
33290 simdlen ( constant-expression ) */
33292 static tree
33294 location_t location)
33295 {
33298 matching_parens parens;
33317 }
33319 /* OpenMP 4.5:
33320 vec:
33321 identifier [+/- integer]
33322 vec , identifier [+/- integer]
33323 */
33325 static tree
33327 tree list)
33328 {
33332 {
33335 }
33338 {
33345 else
33346 {
33347 t = cp_parser_lookup_name_simple
33352 id_loc);
33353 }
33359 {
33362 }
33366 {
33369 }
33373 {
33376 }
33379 add_to_vector:
33381 {
33385 }
33391 }
33394 {
33400 }
33402 }
33404 /* OpenMP 4.0:
33405 depend ( depend-kind : variable-list )
33407 depend-kind:
33408 in | out | inout
33410 OpenMP 4.5:
33411 depend ( source )
33413 depend ( sink : vec ) */
33415 static tree
33417 {
33421 matching_parens parens;
33426 {
33440 else
33442 }
33443 else
33449 {
33459 }
33466 else
33467 {
33473 }
33476 invalid_kind:
33478 resync_fail:
33483 }
33485 /* OpenMP 4.0:
33486 map ( map-kind : variable-list )
33487 map ( variable-list )
33489 map-kind:
33490 alloc | to | from | tofrom
33492 OpenMP 4.5:
33493 map-kind:
33494 alloc | to | from | tofrom | release | delete
33496 map ( always [,] map-kind: variable-list ) */
33498 static tree
33500 {
33509 {
33514 {
33517 nth++;
33523 {
33528 }
33529 }
33530 }
33534 {
33548 else
33549 {
33555 }
33558 }
33561 {
33565 }
33568 NULL);
33574 }
33576 /* OpenMP 4.0:
33577 device ( expression ) */
33579 static tree
33581 location_t location)
33582 {
33585 matching_parens parens;
33605 }
33607 /* OpenMP 4.0:
33608 dist_schedule ( static )
33609 dist_schedule ( static , expression ) */
33611 static tree
33613 location_t location)
33614 {
33617 matching_parens parens;
33628 {
33639 }
33644 location);
33648 invalid_kind:
33650 resync_fail:
33655 }
33657 /* OpenMP 4.0:
33658 proc_bind ( proc-bind-kind )
33660 proc-bind-kind:
33661 master | close | spread */
33663 static tree
33665 location_t location)
33666 {
33667 tree c;
33674 {
33684 else
33686 }
33687 else
33696 location);
33701 invalid_kind:
33703 resync_fail:
33708 }
33710 /* OpenACC:
33711 async [( int-expr )] */
33713 static tree
33715 {
33722 {
33723 matching_parens parens;
33732 }
33742 }
33744 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33745 is a bitmask in MASK. Return the list of clauses found. */
33747 static tree
33751 {
33756 {
33757 location_t here;
33758 pragma_omp_clause c_kind;
33759 omp_clause_code code;
33770 {
33827 clauses);
33845 OMP_CLAUSE_IF_PRESENT,
33851 OMP_CLAUSE_INDEPENDENT,
33863 clauses);
33869 clauses);
33877 clauses);
33895 clauses);
33907 clauses);
33921 }
33926 {
33927 /* Remove the invalid clause(s) from the list to avoid
33928 confusing the rest of the compiler. */
33931 }
33932 }
33934 saw_error:
33941 }
33943 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33944 is a bitmask in MASK. Return the list of clauses found; the result
33945 of clause default goes in *pdefault. */
33947 static tree
33951 {
33957 {
33958 pragma_omp_clause c_kind;
33969 {
33981 clauses);
33995 clauses);
34015 clauses);
34020 clauses);
34030 clauses);
34064 clauses);
34078 clauses);
34093 OMP_CLAUSE_NOTINBRANCH,
34102 {
34103 clause_not_first:
34107 }
34137 clauses);
34138 else
34148 clauses);
34166 {
34171 }
34214 clauses
34220 clauses
34228 }
34233 {
34234 /* Remove the invalid clause(s) from the list to avoid
34235 confusing the rest of the compiler. */
34238 }
34239 }
34240 saw_error:
34243 {
34246 else
34248 }
34250 }
34252 /* OpenMP 2.5:
34253 structured-block:
34254 statement
34256 In practice, we're also interested in adding the statement to an
34257 outer node. So it is convenient if we work around the fact that
34258 cp_parser_statement calls add_stmt. */
34260 static unsigned
34262 {
34265 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34266 This preserves the "not within loop or switch" style error messages
34267 for nonsense cases like
34268 void foo() {
34269 #pragma omp single
34270 break;
34271 }
34272 */
34277 }
34279 static void
34281 {
34283 }
34285 static tree
34287 {
34295 }
34297 /* OpenMP 2.5:
34298 # pragma omp atomic new-line
34299 expression-stmt
34301 expression-stmt:
34302 x binop= expr | x++ | ++x | x-- | --x
34303 binop:
34304 +, *, -, /, &, ^, |, <<, >>
34306 where x is an lvalue expression with scalar type.
34308 OpenMP 3.1:
34309 # pragma omp atomic new-line
34310 update-stmt
34312 # pragma omp atomic read new-line
34313 read-stmt
34315 # pragma omp atomic write new-line
34316 write-stmt
34318 # pragma omp atomic update new-line
34319 update-stmt
34321 # pragma omp atomic capture new-line
34322 capture-stmt
34324 # pragma omp atomic capture new-line
34325 capture-block
34327 read-stmt:
34328 v = x
34329 write-stmt:
34330 x = expr
34331 update-stmt:
34332 expression-stmt | x = x binop expr
34333 capture-stmt:
34334 v = expression-stmt
34335 capture-block:
34336 { v = x; update-stmt; } | { update-stmt; v = x; }
34338 OpenMP 4.0:
34339 update-stmt:
34340 expression-stmt | x = x binop expr | x = expr binop x
34341 capture-stmt:
34342 v = update-stmt
34343 capture-block:
34344 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34346 where x and v are lvalue expressions with scalar type. */
34348 static void
34350 {
34358 {
34363 {
34369 }
34370 }
34372 {
34384 else
34388 }
34390 {
34396 {
34401 {
34404 }
34405 }
34406 }
34410 {
34420 else
34425 {
34426 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34427 opcode. */
34432 }
34436 {
34439 }
34440 else
34441 {
34447 }
34450 }
34452 restart:
34456 {
34463 /* FALLTHROUGH */
34473 /* FALLTHROUGH */
34488 /* Undo effects of boolean_increment for post {in,de}crement. */
34490 /* FALLTHRU */
34494 {
34495 /* Undo effects of boolean_increment. */
34497 {
34498 /* This is pre or post increment. */
34503 && !structured_block
34507 }
34508 }
34509 /* FALLTHRU */
34512 {
34547 {
34551 }
34554 {
34560 {
34565 }
34567 {
34579 {
34581 {
34586 }
34587 else
34589 }
34593 }
34596 {
34603 }
34607 }
34611 {
34614 {
34622 }
34624 {
34629 }
34664 }
34675 /* FALLTHROUGH */
34680 }
34687 }
34688 stmt_done:
34690 {
34701 }
34703 {
34706 }
34707 done:
34713 saw_error:
34716 {
34720 {
34724 }
34725 }
34726 }
34729 /* OpenMP 2.5:
34730 # pragma omp barrier new-line */
34732 static void
34734 {
34737 }
34739 /* OpenMP 2.5:
34740 # pragma omp critical [(name)] new-line
34741 structured-block
34743 OpenMP 4.5:
34744 # pragma omp critical [(name) [hint(expression)]] new-line
34745 structured-block */
34747 #define OMP_CRITICAL_CLAUSE_MASK \
34748 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34750 static tree
34752 {
34756 {
34757 matching_parens parens;
34771 OMP_CRITICAL_CLAUSE_MASK,
34773 }
34774 else
34779 }
34781 /* OpenMP 2.5:
34782 # pragma omp flush flush-vars[opt] new-line
34784 flush-vars:
34785 ( variable-list ) */
34787 static void
34789 {
34795 }
34797 /* Helper function, to parse omp for increment expression. */
34799 static tree
34801 {
34806 {
34809 }
34812 {
34819 /* Fall through: OpenMP disallows NE_EXPR. */
34823 }
34825 /* If decl is an iterator, preserve LHS and RHS of the relational
34826 expr until finish_omp_for. */
34837 }
34839 /* Helper function, to parse omp for increment expression. */
34841 static tree
34843 {
34847 cp_id_kind idk;
34851 {
34860 }
34869 {
34874 }
34881 {
34885 }
34898 do
34899 {
34906 {
34908 {
34911 else
34913 tf_warning_or_error);
34914 }
34915 else
34918 }
34919 }
34923 {
34929 }
34930 else
34934 }
34936 /* Parse the initialization statement of an OpenMP for loop.
34938 Return true if the resulting construct should have an
34939 OMP_CLAUSE_PRIVATE added to it. */
34941 static tree
34949 {
34955 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34957 init-expr:
34958 var = lb
34959 integer-type var = lb
34960 random-access-iterator-type var = lb
34961 pointer-type var = lb
34962 */
34963 cp_decl_specifier_seq type_specifiers;
34965 /* First, try to parse as an initialized declaration. See
34966 cp_parser_condition, from whence the bulk of this is copied. */
34973 {
34974 /* If parsing a type specifier seq succeeded, then this
34975 MUST be a initialized declaration. */
34980 CP_PARSER_DECLARATOR_NAMED,
34991 else
34992 {
35002 {
35004 CPP_OPEN_PAREN))
35007 else
35008 /* Trigger an error. */
35013 }
35017 {
35025 {
35028 auto_node);
35033 }
35036 asm_specification,
35037 LOOKUP_ONLYCONVERTING);
35040 {
35043 }
35044 else
35045 {
35048 {
35050 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35052 {
35056 {
35060 }
35062 }
35064 {
35069 }
35070 }
35071 }
35073 }
35074 else
35075 {
35076 /* Consume '='. */
35080 non_class:
35083 else
35086 asm_specification,
35087 LOOKUP_ONLYCONVERTING);
35088 }
35092 }
35093 }
35094 else
35095 {
35096 cp_id_kind idk;
35097 /* If parsing a type specifier sequence failed, then
35098 this MUST be a simple expression. */
35104 && decl
35107 {
35118 {
35123 }
35128 }
35130 && decl
35133 {
35134 tree rhs;
35142 rhs,
35143 tf_warning_or_error));
35146 }
35147 else
35148 {
35153 {
35157 }
35158 }
35159 }
35161 }
35163 /* Parse the restricted form of the for statement allowed by OpenMP. */
35165 static tree
35168 {
35172 location_t loc_first;
35183 {
35186 }
35189 {
35192 }
35195 {
35201 }
35203 {
35206 {
35208 "%<linear%> clause may not be specified together "
35211 }
35212 else
35214 }
35227 {
35230 location_t loc;
35233 {
35237 }
35240 matching_parens parens;
35247 add_private_clause
35253 {
35256 {
35262 }
35263 else
35265 }
35272 {
35277 {
35281 }
35284 {
35285 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35289 {
35292 }
35293 else
35294 {
35297 }
35299 }
35300 else
35301 {
35306 }
35307 }
35310 {
35311 tree c;
35313 {
35322 decl);
35326 decl);
35327 }
35329 {
35334 else
35339 {
35342 /* For linear, signal that we need to fill up
35343 the so far unknown linear step. */
35346 }
35347 }
35348 }
35357 {
35358 /* If decl is an iterator, preserve the operator on decl
35359 until finish_omp_for. */
35361 && ((processing_template_decl
35366 else
35370 }
35382 {
35385 }
35390 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35391 in between the collapsed for loops to be still considered perfectly
35392 nested. Hopefully the final version clarifies this.
35393 For now handle (multiple) {'s and empty statements. */
35396 {
35400 {
35402 bracecount++;
35403 }
35407 else
35408 {
35415 }
35416 }
35419 {
35422 }
35423 }
35428 /* Note that we saved the original contents of this flag when we entered
35429 the structured block, and so we don't need to re-save it here. */
35432 /* Note that the grammar doesn't call for a structured block here,
35433 though the loop as a whole is a structured block. */
35440 else
35445 {
35447 {
35449 nbraces--;
35450 }
35453 else
35454 {
35456 {
35459 }
35464 }
35465 }
35468 {
35472 else
35474 }
35478 }
35480 /* Helper function for OpenMP parsing, split clauses and call
35481 finish_omp_clauses on each of the set of clauses afterwards. */
35483 static void
35486 {
35492 }
35494 /* OpenMP 4.0:
35495 #pragma omp simd simd-clause[optseq] new-line
35496 for-loop */
35498 #define OMP_SIMD_CLAUSE_MASK \
35499 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35508 static tree
35512 {
35523 {
35527 OMP_CLAUSE_ORDERED);
35529 {
35531 "%<ordered%> clause with parameter may not be specified "
35534 }
35535 }
35546 }
35548 /* OpenMP 2.5:
35549 #pragma omp for for-clause[optseq] new-line
35550 for-loop
35552 OpenMP 4.0:
35553 #pragma omp for simd for-simd-clause[optseq] new-line
35554 for-loop */
35556 #define OMP_FOR_CLAUSE_MASK \
35557 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35567 static tree
35571 {
35578 /* parallel for{, simd} disallows nowait clause, but for
35579 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35582 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35587 {
35592 {
35616 }
35617 }
35619 {
35622 }
35624 /* Composite distribute parallel for disallows linear clause. */
35631 {
35634 }
35645 }
35647 /* OpenMP 2.5:
35648 # pragma omp master new-line
35649 structured-block */
35651 static tree
35653 {
35657 }
35659 /* OpenMP 2.5:
35660 # pragma omp ordered new-line
35661 structured-block
35663 OpenMP 4.5:
35664 # pragma omp ordered ordered-clauses new-line
35665 structured-block */
35667 #define OMP_ORDERED_CLAUSE_MASK \
35668 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35671 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35672 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35674 static bool
35677 {
35681 {
35686 {
35688 {
35691 }
35693 {
35695 "%<depend%> clause may only be used in compound "
35699 }
35700 tree clauses
35702 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35706 }
35707 }
35709 tree clauses
35720 }
35722 /* OpenMP 2.5:
35724 section-scope:
35725 { section-sequence }
35727 section-sequence:
35728 section-directive[opt] structured-block
35729 section-sequence section-directive structured-block */
35731 static tree
35733 {
35738 matching_braces braces;
35746 {
35750 }
35753 {
35761 {
35765 }
35767 {
35770 }
35775 }
35786 }
35788 /* OpenMP 2.5:
35789 # pragma omp sections sections-clause[optseq] newline
35790 sections-scope */
35792 #define OMP_SECTIONS_CLAUSE_MASK \
35793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35799 static tree
35802 {
35814 {
35817 }
35824 }
35826 /* OpenMP 2.5:
35827 # pragma omp parallel parallel-clause[optseq] new-line
35828 structured-block
35829 # pragma omp parallel for parallel-for-clause[optseq] new-line
35830 structured-block
35831 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35832 structured-block
35834 OpenMP 4.0:
35835 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35836 structured-block */
35838 #define OMP_PARALLEL_CLAUSE_MASK \
35839 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35849 static tree
35853 {
35860 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35866 {
35874 if_p);
35878 if_p);
35881 block);
35886 }
35887 /* When combined with distribute, parallel has to be followed by for.
35888 #pragma omp target parallel is allowed though. */
35892 {
35896 }
35898 {
35901 }
35903 {
35907 {
35917 block);
35920 }
35921 }
35926 {
35929 }
35937 }
35939 /* OpenMP 2.5:
35940 # pragma omp single single-clause[optseq] new-line
35941 structured-block */
35943 #define OMP_SINGLE_CLAUSE_MASK \
35944 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35949 static tree
35951 {
35961 }
35963 /* OpenMP 3.0:
35964 # pragma omp task task-clause[optseq] new-line
35965 structured-block */
35967 #define OMP_TASK_CLAUSE_MASK \
35968 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35979 static tree
35981 {
35992 }
35994 /* OpenMP 3.0:
35995 # pragma omp taskwait new-line */
35997 static void
35999 {
36002 }
36004 /* OpenMP 3.1:
36005 # pragma omp taskyield new-line */
36007 static void
36009 {
36012 }
36014 /* OpenMP 4.0:
36015 # pragma omp taskgroup new-line
36016 structured-block */
36018 static tree
36020 {
36024 if_p));
36025 }
36028 /* OpenMP 2.5:
36029 # pragma omp threadprivate (variable-list) */
36031 static void
36033 {
36034 tree vars;
36040 }
36042 /* OpenMP 4.0:
36043 # pragma omp cancel cancel-clause[optseq] new-line */
36045 #define OMP_CANCEL_CLAUSE_MASK \
36046 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36052 static void
36054 {
36058 }
36060 /* OpenMP 4.0:
36061 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36063 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36064 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36069 static void
36072 {
36073 tree clauses;
36077 {
36082 {
36085 }
36086 }
36088 {
36092 }
36095 {
36100 else
36104 }
36107 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36109 pragma_tok);
36111 }
36113 /* OpenMP 4.0:
36114 #pragma omp distribute distribute-clause[optseq] new-line
36115 for-loop */
36117 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36118 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36124 static tree
36128 {
36137 {
36145 else
36148 {
36154 {
36158 else
36161 }
36167 else
36181 }
36182 }
36184 {
36187 }
36192 {
36195 }
36206 }
36208 /* OpenMP 4.0:
36209 # pragma omp teams teams-clause[optseq] new-line
36210 structured-block */
36212 #define OMP_TEAMS_CLAUSE_MASK \
36213 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36221 static tree
36225 {
36234 {
36238 {
36263 }
36264 }
36266 {
36269 }
36274 {
36277 }
36286 }
36288 /* OpenMP 4.0:
36289 # pragma omp target data target-data-clause[optseq] new-line
36290 structured-block */
36292 #define OMP_TARGET_DATA_CLAUSE_MASK \
36293 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36298 static tree
36300 {
36301 tree clauses
36306 {
36309 {
36326 "%<#pragma omp target data%> with map-type other "
36327 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36331 }
36333 }
36336 {
36339 "%<#pragma omp target data%> must contain at least "
36342 }
36353 }
36355 /* OpenMP 4.5:
36356 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36357 structured-block */
36359 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36360 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36366 static tree
36369 {
36372 {
36377 {
36380 }
36381 }
36383 {
36387 }
36390 {
36396 }
36398 tree clauses
36403 {
36406 {
36419 "%<#pragma omp target enter data%> with map-type other "
36423 }
36425 }
36428 {
36431 "%<#pragma omp target enter data%> must contain at least "
36434 }
36441 }
36443 /* OpenMP 4.5:
36444 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36445 structured-block */
36447 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36448 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36454 static tree
36457 {
36460 {
36465 {
36468 }
36469 }
36471 {
36475 }
36478 {
36484 }
36486 tree clauses
36491 {
36494 {
36508 "%<#pragma omp target exit data%> with map-type other "
36509 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36513 }
36515 }
36518 {
36521 "%<#pragma omp target exit data%> must contain at least "
36524 }
36531 }
36533 /* OpenMP 4.0:
36534 # pragma omp target update target-update-clause[optseq] new-line */
36536 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36537 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36544 static bool
36547 {
36549 {
36555 }
36557 tree clauses
36562 {
36564 "%<#pragma omp target update%> must contain at least one "
36567 }
36575 }
36577 /* OpenMP 4.0:
36578 # pragma omp target target-clause[optseq] new-line
36579 structured-block */
36581 #define OMP_TARGET_CLAUSE_MASK \
36582 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36592 static bool
36595 {
36599 {
36611 {
36619 {
36620 tree stmt;
36622 {
36625 OMP_TARGET_CLAUSE_MASK,
36630 OMP_TARGET_CLAUSE_MASK,
36635 OMP_TARGET_CLAUSE_MASK,
36640 }
36642 }
36647 {
36651 if_p);
36656 if_p);
36661 if_p);
36665 }
36671 {
36672 /* For combined target teams, ensure the num_teams and
36673 thread_limit clause expressions are evaluated on the host,
36674 before entering the target construct. */
36675 tree c;
36681 {
36690 OMP_CLAUSE_FIRSTPRIVATE);
36695 }
36696 }
36706 }
36708 {
36711 }
36713 {
36717 }
36719 {
36723 }
36725 {
36729 }
36731 {
36734 }
36735 }
36737 {
36740 }
36755 check_clauses:
36757 {
36760 {
36774 "%<#pragma omp target%> with map-type other "
36775 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36779 }
36781 }
36783 }
36785 /* OpenACC 2.0:
36786 # pragma acc cache (variable-list) new-line
36787 */
36789 static tree
36791 {
36806 }
36808 /* OpenACC 2.0:
36809 # pragma acc data oacc-data-clause[optseq] new-line
36810 structured-block */
36812 #define OACC_DATA_CLAUSE_MASK \
36813 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36821 static tree
36823 {
36836 }
36838 /* OpenACC 2.0:
36839 # pragma acc host_data <clauses> new-line
36840 structured-block */
36842 #define OACC_HOST_DATA_CLAUSE_MASK \
36843 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36845 static tree
36847 {
36860 }
36862 /* OpenACC 2.0:
36863 # pragma acc declare oacc-data-clause[optseq] new-line
36864 */
36866 #define OACC_DECLARE_CLAUSE_MASK \
36867 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36876 static tree
36878 {
36887 {
36891 }
36894 {
36898 {
36902 }
36905 {
36917 {
36919 "%qD must be a global variable in "
36921 decl);
36924 }
36929 {
36933 }
36935 {
36937 "invalid use of %<extern%> variable %qD "
36941 }
36943 {
36945 "invalid use of %<global%> variable %qD "
36949 }
36951 }
36956 {
36961 }
36964 {
36965 tree id;
36969 else
36975 {
36978 {
36981 {
36985 }
36986 }
36987 }
36988 }
36989 }
37002 }
37004 /* OpenACC 2.0:
37005 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37007 or
37009 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37011 LOC is the location of the #pragma token.
37012 */
37014 #define OACC_ENTER_DATA_CLAUSE_MASK \
37015 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37021 #define OACC_EXIT_DATA_CLAUSE_MASK \
37022 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37029 static tree
37032 {
37041 {
37046 }
37053 else
37058 {
37062 }
37070 }
37072 /* OpenACC 2.0:
37073 # pragma acc loop oacc-loop-clause[optseq] new-line
37074 structured-block */
37076 #define OACC_LOOP_CLAUSE_MASK \
37077 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37088 static tree
37091 {
37100 {
37106 }
37115 }
37117 /* OpenACC 2.0:
37118 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37119 structured-block
37121 or
37123 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37124 structured-block
37125 */
37127 #define OACC_KERNELS_CLAUSE_MASK \
37128 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37142 #define OACC_PARALLEL_CLAUSE_MASK \
37143 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37160 static tree
37163 {
37164 omp_clause_mask mask;
37167 {
37180 }
37183 {
37187 {
37190 tree clauses;
37192 if_p);
37194 }
37195 }
37204 }
37206 /* OpenACC 2.0:
37207 # pragma acc update oacc-update-clause[optseq] new-line
37208 */
37210 #define OACC_UPDATE_CLAUSE_MASK \
37211 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
37216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37218 static tree
37220 {
37227 {
37229 "%<#pragma acc update%> must contain at least one "
37232 }
37240 }
37242 /* OpenACC 2.0:
37243 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37245 LOC is the location of the #pragma token.
37246 */
37248 #define OACC_WAIT_CLAUSE_MASK \
37249 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37251 static tree
37253 {
37267 }
37269 /* OpenMP 4.0:
37270 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37272 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37273 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37280 static void
37283 {
37285 cp_omp_declare_simd_data data;
37287 {
37292 /* It is safe to take the address of a local variable; it will only be
37293 used while this scope is live. */
37295 }
37297 /* Store away all pragma tokens. */
37309 {
37313 {
37326 }
37331 "%<#pragma omp declare simd%> not immediately followed by "
37335 }
37336 }
37338 /* Finalize #pragma omp declare simd clauses after direct declarator has
37339 been parsed, and put that into "omp declare simd" attribute. */
37341 static tree
37343 {
37349 {
37353 }
37358 {
37376 }
37380 }
37383 /* OpenMP 4.0:
37384 # pragma omp declare target new-line
37385 declarations and definitions
37386 # pragma omp end declare target new-line
37388 OpenMP 4.5:
37389 # pragma omp declare target ( extended-list ) new-line
37391 # pragma omp declare target declare-target-clauses[seq] new-line */
37393 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37394 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37397 static void
37399 {
37402 clauses
37406 {
37408 clauses);
37411 }
37412 else
37413 {
37417 }
37420 "%<#pragma omp declare target%> with clauses in between "
37421 "%<#pragma omp declare target%> without clauses and "
37424 {
37430 {
37433 }
37434 else
37437 {
37439 "%qD specified both in declare target %<link%> and %<to%>"
37442 }
37444 {
37451 {
37454 {
37458 }
37459 }
37460 }
37461 }
37462 }
37464 static void
37466 {
37469 {
37472 }
37474 {
37478 {
37481 }
37484 else
37485 {
37489 }
37490 }
37491 else
37492 {
37496 }
37500 "%<#pragma omp end declare target%> without corresponding "
37502 else
37504 }
37506 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37507 expression and optional initializer clause of
37508 #pragma omp declare reduction. We store the expression(s) as
37509 either 3, 6 or 7 special statements inside of the artificial function's
37510 body. The first two statements are DECL_EXPRs for the artificial
37511 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37512 expression that uses those variables.
37513 If there was any INITIALIZER clause, this is followed by further statements,
37514 the fourth and fifth statements are DECL_EXPRs for the artificial
37515 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37516 constructor variant (first token after open paren is not omp_priv),
37517 then the sixth statement is a statement with the function call expression
37518 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37519 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37520 to initialize the OMP_PRIV artificial variable and there is seventh
37521 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37523 static bool
37525 {
37537 tree combiner;
37552 {
37555 }
37558 {
37560 matching_parens parens;
37566 {
37569 }
37585 {
37589 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37593 == CPP_CLOSE_PAREN
37596 {
37600 }
37605 }
37606 else
37607 {
37623 {
37628 }
37630 tree arg;
37643 }
37654 }
37658 UNKNOWN_LOCATION);
37661 }
37663 /* OpenMP 4.0
37664 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37665 initializer-clause[opt] new-line
37667 initializer-clause:
37668 initializer (omp_priv initializer)
37669 initializer (function-name (argument-list)) */
37671 static void
37674 {
37684 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37691 {
37723 }
37735 /* Types may not be defined in declare reduction type list. */
37738 parser->type_definition_forbidden_message
37744 saved_colon_doesnt_start_class_def_p
37749 {
37753 ;
37772 else
37777 else
37779 }
37781 /* Restore the saved message. */
37784 parser->colon_doesnt_start_class_def_p
37789 {
37790 fail:
37793 }
37799 {
37800 tree fntype
37803 NULL_TREE);
37823 {
37828 }
37830 {
37832 {
37841 }
37848 }
37849 else
37850 {
37853 }
37856 else
37859 {
37862 }
37864 {
37867 else
37872 }
37877 else
37878 {
37887 }
37894 }
37898 done:
37899 /* Free any declarators allocated. */
37901 }
37903 /* OpenMP 4.0
37904 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37905 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37906 initializer-clause[opt] new-line
37907 #pragma omp declare target new-line */
37909 static bool
37912 {
37914 {
37919 {
37922 context);
37924 }
37927 {
37930 context);
37932 }
37934 {
37937 }
37939 {
37943 }
37944 }
37949 }
37951 /* OpenMP 4.5:
37952 #pragma omp taskloop taskloop-clause[optseq] new-line
37953 for-loop
37955 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37956 for-loop */
37958 #define OMP_TASKLOOP_CLAUSE_MASK \
37959 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37974 static tree
37978 {
37987 {
37992 {
38016 }
38017 }
38019 {
38022 }
38027 {
38030 }
38036 if_p);
38042 }
38045 /* OpenACC 2.0:
38046 # pragma acc routine oacc-routine-clause[optseq] new-line
38047 function-definition
38049 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38050 */
38052 #define OACC_ROUTINE_CLAUSE_MASK \
38053 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38059 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38060 component, which must resolve to a declared namespace-scope
38061 function. The clauses are either processed directly (for a named
38062 function), or defered until the immediatley following declaration
38063 is parsed. */
38065 static void
38068 {
38070 /* The checking for "another pragma following this one" in the "no optional
38071 '( name )'" case makes sure that we dont re-enter. */
38074 cp_oacc_routine_data data;
38080 /* It is safe to take the address of a local variable; it will only be
38081 used while this scope is live. */
38084 /* Look for optional '( name )'. */
38086 {
38087 matching_parens parens;
38090 /* We parse the name as an id-expression. If it resolves to
38091 anything other than a non-overloaded function at namespace
38092 scope, it's an error. */
38108 {
38112 }
38114 data.clauses
38122 {
38127 }
38129 /* Perhaps we should use the same rule as declarations in different
38130 namespaces? */
38132 {
38137 }
38140 {
38144 }
38148 }
38150 {
38151 /* Store away all pragma tokens. */
38162 /* Emit a helpful diagnostic if there's another pragma following this
38163 one. */
38165 {
38168 /* ..., and then just keep going. */
38170 }
38172 /* We only have to consider the pragma_external case here. */
38177 else
38180 }
38181 }
38183 /* Finalize #pragma acc routine clauses after direct declarator has
38184 been parsed. */
38186 static tree
38188 {
38193 {
38195 "%<#pragma acc routine%> not immediately followed by "
38198 }
38215 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38216 fndecl_seen. */
38219 }
38221 /* Apply any saved OpenACC routine clauses to a just-parsed
38222 declaration. */
38224 static void
38226 {
38228 {
38229 /* Keep going if we're in error reporting mode. */
38235 {
38237 "%<#pragma acc routine%> not immediately followed by"
38241 }
38243 {
38246 }
38249 {
38254 }
38257 {
38265 }
38267 /* Process the routine's dimension clauses. */
38271 /* Add an "omp declare target" attribute. */
38276 /* Don't unset parser->oacc_routine here: we may still need it to
38277 diagnose wrong usage. But, remember that we've used this "#pragma acc
38278 routine". */
38280 }
38281 }
38283 /* Main entry point to OpenMP statement pragmas. */
38285 static void
38287 {
38288 tree stmt;
38293 {
38316 if_p);
38321 if_p);
38338 if_p);
38343 if_p);
38351 if_p);
38360 if_p);
38374 if_p);
38379 if_p);
38383 }
38386 }
38387 \f
38388 /* Transactional Memory parsing routines. */
38390 /* Parse a transaction attribute.
38392 txn-attribute:
38393 attribute
38394 [ [ identifier ] ]
38396 We use this instead of cp_parser_attributes_opt for transactions to avoid
38397 the pedwarn in C++98 mode. */
38399 static tree
38401 {
38416 {
38420 /* For keywords, use the canonical spelling,
38421 not the parsed identifier. */
38425 }
38426 else
38430 error1:
38433 }
38435 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38437 transaction-statement:
38438 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38439 compound-statement
38440 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38441 */
38443 static tree
38445 {
38456 else
38457 {
38461 }
38463 /* Parse a noexcept specification. */
38467 {
38468 /* cancel-and-throw is unimplemented. */
38471 }
38472 else
38475 /* Keep track if we're in the lexical scope of an outer transaction. */
38487 }
38489 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38491 transaction-expression:
38492 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38493 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38494 */
38496 static tree
38498 {
38511 keyword == RID_TRANSACTION_RELAXED
38525 /* Set this early. This might mean that we allow transaction_cancel in
38526 an expression that we find out later actually has to be a constexpr.
38527 However, we expect that cxx_constant_value will be able to deal with
38528 this; also, if the noexcept has no constexpr, then what we parse next
38529 really is a transaction's body. */
38532 /* Parse a noexcept specification. */
38538 {
38539 matching_parens parens;
38546 }
38547 else
38548 {
38549 /* The only expression that is available got parsed for the noexcept
38550 already. noexcept is true then. */
38553 }
38562 }
38564 /* Parse a function-transaction-block.
38566 function-transaction-block:
38567 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38568 function-body
38569 __transaction_atomic txn-attribute[opt] function-try-block
38570 __transaction_relaxed ctor-initializer[opt] function-body
38571 __transaction_relaxed function-try-block
38572 */
38574 static void
38576 {
38591 else
38592 {
38596 }
38604 else
38605 cp_parser_ctor_initializer_opt_and_function_body
38611 }
38613 /* Parse a __transaction_cancel statement.
38615 cancel-statement:
38616 __transaction_cancel txn-attribute[opt] ;
38617 __transaction_cancel txn-attribute[opt] throw-expression ;
38619 ??? Cancel and throw is not yet implemented. */
38621 static tree
38623 {
38629 RT_TRANSACTION_CANCEL);
38636 /* ??? Parse cancel-and-throw here. */
38641 {
38645 }
38647 {
38651 }
38653 {
38656 {
38662 }
38663 }
38665 {
38669 }
38675 }
38676 \f
38677 /* The parser. */
38681 \f
38682 /* Special handling for the first token or line in the file. The first
38683 thing in the file might be #pragma GCC pch_preprocess, which loads a
38684 PCH file, which is a GC collection point. So we need to handle this
38685 first pragma without benefit of an existing lexer structure.
38687 Always returns one token to the caller in *FIRST_TOKEN. This is
38688 either the true first token of the file, or the first token after
38689 the initial pragma. */
38691 static void
38693 {
38702 {
38709 }
38710 else
38713 /* Skip to the end of the pragma. */
38717 /* Now actually load the PCH file. */
38721 /* Read one more token to return to our caller. We have to do this
38722 after reading the PCH file in, since its pointers have to be
38723 live. */
38725 }
38727 /* Parse a pragma GCC ivdep. */
38729 static bool
38731 {
38734 }
38736 /* Parse a pragma GCC unroll. */
38738 static unsigned short
38740 {
38750 {
38752 " assignment-expression that evaluates to a non-negative"
38755 }
38756 else
38757 {
38761 }
38764 }
38766 /* Normal parsing of a pragma token. Here we can (and must) use the
38767 regular lexer. */
38769 static bool
38771 {
38774 tree stmt;
38785 {
38793 {
38803 }
38808 {
38818 }
38823 {
38834 }
38839 {
38850 }
38855 {
38866 }
38886 {
38891 }
38899 {
38904 }
38912 {
38916 }
38922 {
38927 }
38935 {
38940 }
38995 "%<#pragma omp section%> may only be used in "
39000 {
39002 {
39006 }
39012 {
39016 }
39017 else
39023 {
39026 }
39029 }
39032 {
39034 {
39038 }
39039 const unsigned short unroll
39045 {
39049 }
39050 else
39056 {
39059 }
39062 }
39069 bad_stmt:
39072 }
39076 }
39078 /* The interface the pragma parsers have to the lexer. */
39080 enum cpp_ttype
39082 {
39094 else
39095 {
39099 }
39102 }
39104 \f
39105 /* External interface. */
39107 /* Parse one entire translation unit. */
39109 void
39111 {
39124 }
39126 /* Create an identifier for a generic parameter type (a synthesized
39127 template parameter implied by `auto' or a concept identifier). */
39130 static tree
39132 {
39136 }
39138 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39139 (creating a new template parameter list if necessary). Returns the newly
39140 created template type parm. */
39142 static tree
39144 {
39147 /* Before committing to modifying any scope, if we're in an
39148 implicit template scope, and we're trying to synthesize a
39149 constrained parameter, try to find a previous parameter with
39150 the same name. This is the same-type rule for abbreviated
39151 function templates.
39153 NOTE: We can generate implicit parameters when tentatively
39154 parsing a nested name specifier, only to reject that parse
39155 later. However, matching the same template-id as part of a
39156 direct-declarator should generate an identical template
39157 parameter, so this rule will merge them. */
39159 {
39162 {
39164 {
39167 /* Return the TEMPLATE_PARM_INDEX. */
39170 }
39172 }
39173 }
39175 /* We are either continuing a function template that already contains implicit
39176 template parameters, creating a new fully-implicit function template, or
39177 extending an existing explicit function template with implicit template
39178 parameters. */
39186 {
39190 }
39191 else
39192 {
39193 /* Roll back to the existing template parameter scope (in the case of
39194 extending an explicit function template) or introduce a new template
39195 parameter scope ahead of the function parameter scope (or class scope
39196 in the case of out-of-line member definitions). The function scope is
39197 added back after template parameter synthesis below. */
39202 {
39205 }
39207 {
39208 /* If not defining a class, then any class scope is a scope level in
39209 an out-of-line member definition. In this case simply wind back
39210 beyond the first such scope to inject the template parameter list.
39211 Otherwise wind back to the class being defined. The latter can
39212 occur in class member friend declarations such as:
39214 class A {
39215 void foo (auto);
39216 };
39217 class B {
39218 friend void A::foo (auto);
39219 };
39221 The template parameter list synthesized for the friend declaration
39222 must be injected in the scope of 'B'. This can also occur in
39223 erroneous cases such as:
39225 struct A {
39226 struct B {
39227 void foo (auto);
39228 };
39229 void B::foo (auto) {}
39230 };
39232 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39233 but, nevertheless, the template parameter list synthesized for the
39234 declarator should be injected into the scope of 'A' as if the
39235 ill-formed template was specified explicitly. */
39238 {
39241 }
39242 }
39248 {
39249 /* Introduce a new template parameter list for implicit template
39250 parameters. */
39254 parser->implicit_template_scope
39261 }
39262 else
39263 {
39264 /* Synthesize implicit template parameters at the end of the explicit
39265 template parameter list. */
39272 parser->implicit_template_parms
39274 }
39275 }
39277 /* Synthesize a new template parameter and track the current template
39278 parameter chain with implicit_template_parms. */
39282 tree synth_tmpl_parm;
39286 synth_tmpl_parm
39289 synth_tmpl_parm
39291 else
39292 {
39296 }
39298 // Attach the constraint to the parm before processing.
39301 tree new_parm
39303 input_location,
39304 node,
39308 // Chain the new parameter to the list of implicit parameters.
39310 parser->implicit_template_parms
39312 else
39317 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39320 /* If creating a fully implicit function template, start the new implicit
39321 template parameter list with this synthesized type, otherwise grow the
39322 current template parameter list. */
39325 {
39332 }
39333 else
39334 {
39339 }
39341 // If the new parameter was constrained, we need to add that to the
39342 // constraints in the template parameter list.
39344 {
39348 }
39353 }
39355 /* Finish the declaration of a fully implicit function template. Such a
39356 template has no explicit template parameter list so has not been through the
39357 normal template head and tail processing. synthesize_implicit_template_parm
39358 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39359 provided if the declaration is a class member such that its template
39360 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39361 form is returned. Otherwise NULL_TREE is returned. */
39363 static tree
39365 {
39370 {
39374 }
39386 }
39388 /* Like finish_fully_implicit_template, but to be used in error
39389 recovery, rearranging scopes so that we restore the state we had
39390 before synthesize_implicit_template_parm inserted the implement
39391 template parms scope. */
39393 static void
39395 {
39400 {
39409 }
39410 else
39416 }
39418 /* Helper function for diagnostics that have complained about things
39419 being used with 'extern "C"' linkage.
39421 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39423 void
39425 {
39429 }