| blob | d17beb8f93078194596f934b516631911e2cddd3 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2267 static void abort_fully_implicit_template
2270 /* Classes [gram.class] */
2272 static tree cp_parser_class_name
2274 static tree cp_parser_class_specifier
2276 static tree cp_parser_class_head
2278 static enum tag_types cp_parser_class_key
2280 static void cp_parser_type_parameter_key
2282 static void cp_parser_member_specification_opt
2284 static void cp_parser_member_declaration
2286 static tree cp_parser_pure_specifier
2288 static tree cp_parser_constant_initializer
2291 /* Derived classes [gram.class.derived] */
2293 static tree cp_parser_base_clause
2295 static tree cp_parser_base_specifier
2298 /* Special member functions [gram.special] */
2300 static tree cp_parser_conversion_function_id
2302 static tree cp_parser_conversion_type_id
2306 static void cp_parser_ctor_initializer_opt
2308 static void cp_parser_mem_initializer_list
2310 static tree cp_parser_mem_initializer
2312 static tree cp_parser_mem_initializer_id
2315 /* Overloading [gram.over] */
2317 static cp_expr cp_parser_operator_function_id
2319 static cp_expr cp_parser_operator
2322 /* Templates [gram.temp] */
2324 static void cp_parser_template_declaration
2326 static tree cp_parser_template_parameter_list
2328 static tree cp_parser_template_parameter
2330 static tree cp_parser_type_parameter
2332 static tree cp_parser_template_id
2334 static tree cp_parser_template_name
2336 static tree cp_parser_template_argument_list
2338 static tree cp_parser_template_argument
2340 static void cp_parser_explicit_instantiation
2342 static void cp_parser_explicit_specialization
2345 /* Exception handling [gram.exception] */
2347 static tree cp_parser_try_block
2349 static void cp_parser_function_try_block
2351 static void cp_parser_handler_seq
2353 static void cp_parser_handler
2355 static tree cp_parser_exception_declaration
2357 static tree cp_parser_throw_expression
2359 static tree cp_parser_exception_specification_opt
2361 static tree cp_parser_type_id_list
2364 /* GNU Extensions */
2366 static tree cp_parser_asm_specification_opt
2368 static tree cp_parser_asm_operand_list
2370 static tree cp_parser_asm_clobber_list
2372 static tree cp_parser_asm_label_list
2374 static bool cp_next_tokens_can_be_attribute_p
2376 static bool cp_next_tokens_can_be_gnu_attribute_p
2378 static bool cp_next_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_gnu_attribute_p
2384 static bool cp_nth_tokens_can_be_attribute_p
2386 static tree cp_parser_attributes_opt
2388 static tree cp_parser_gnu_attributes_opt
2390 static tree cp_parser_gnu_attribute_list
2392 static tree cp_parser_std_attribute
2394 static tree cp_parser_std_attribute_spec
2396 static tree cp_parser_std_attribute_spec_seq
2398 static size_t cp_parser_skip_attributes_opt
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static void cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static cp_expr cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2769 RT_CLOSE_PAREN. */
2773 {
2775 {
2783 }
2784 }
2786 /* Attempt to convert TOKEN_DESC from a required_token to an
2787 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2789 static enum cpp_ttype
2791 {
2793 {
2814 /* Use CPP_EOF as a "no completions possible" code. */
2816 }
2817 }
2820 /* Subroutine of cp_parser_error and cp_parser_required_error.
2822 Issue a diagnostic of the form
2823 FILE:LINE: MESSAGE before TOKEN
2824 where TOKEN is the next token in the input stream. MESSAGE
2825 (specified by the caller) is usually of the form "expected
2826 OTHER-TOKEN".
2828 This bypasses the check for tentative passing, and potentially
2829 adds material needed by cp_parser_required_error.
2831 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2832 suggesting insertion of the missing token.
2834 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2835 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2836 location. */
2838 static void
2840 required_token missing_token_desc,
2841 location_t matching_location)
2842 {
2844 /* This diagnostic makes more sense if it is tagged to the line
2845 of the token we just peeked at. */
2849 {
2854 }
2856 /* If this is actually a conflict marker, report it as such. */
2860 {
2861 location_t loc;
2863 {
2866 }
2867 }
2874 {
2875 /* Potentially supply a fix-it hint, suggesting to add the
2876 missing token immediately after the *previous* token.
2877 This may move the primary location within richloc. */
2879 location_t prev_token_loc
2883 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2884 Attempt to consolidate diagnostics by printing it as a
2885 secondary range within the main diagnostic. */
2887 added_matching_location
2889 }
2891 /* Actually emit the error. */
2893 /* Because c_parser_error does not understand
2894 CPP_KEYWORD, keywords are treated like
2895 identifiers. */
2900 {
2901 /* If we weren't able to consolidate matching_location, then
2902 print it as a secondary diagnostic. */
2907 }
2908 }
2910 /* If not parsing tentatively, issue a diagnostic of the form
2911 FILE:LINE: MESSAGE before TOKEN
2912 where TOKEN is the next token in the input stream. MESSAGE
2913 (specified by the caller) is usually of the form "expected
2914 OTHER-TOKEN". */
2916 static void
2918 {
2921 }
2923 /* Issue an error about name-lookup failing. NAME is the
2924 IDENTIFIER_NODE DECL is the result of
2925 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2926 the thing that we hoped to find. */
2928 static void
2930 tree name,
2931 tree decl,
2932 name_lookup_error desired,
2933 location_t location)
2934 {
2935 /* If name lookup completely failed, tell the user that NAME was not
2936 declared. */
2938 {
2951 else
2953 }
2955 {
2957 {
2974 }
2975 }
2977 {
2979 {
2989 name);
2993 }
2994 }
2995 else
2996 {
2998 {
3011 }
3012 }
3013 }
3015 /* If we are parsing tentatively, remember that an error has occurred
3016 during this tentative parse. Returns true if the error was
3017 simulated; false if a message should be issued by the caller. */
3019 static bool
3021 {
3023 {
3026 }
3028 }
3030 /* This function is called when a type is defined. If type
3031 definitions are forbidden at this point, an error message is
3032 issued. */
3034 static bool
3036 {
3037 /* If types are forbidden here, issue a message. */
3039 {
3040 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3041 in the message need to be interpreted. */
3044 }
3046 }
3048 /* This function is called when the DECLARATOR is processed. The TYPE
3049 was a type defined in the decl-specifiers. If it is invalid to
3050 define a type in the decl-specifiers for DECLARATOR, an error is
3051 issued. TYPE_LOCATION is the location of TYPE and is used
3052 for error reporting. */
3054 static void
3057 {
3058 /* [dcl.fct] forbids type definitions in return types.
3059 Unfortunately, it's not easy to know whether or not we are
3060 processing a return type until after the fact. */
3068 {
3073 type);
3074 }
3075 }
3077 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3078 "<" in any valid C++ program. If the next token is indeed "<",
3079 issue a message warning the user about what appears to be an
3080 invalid attempt to form a template-id. LOCATION is the location
3081 of the type-specifier (TYPE) */
3083 static void
3085 tree type,
3087 location_t location)
3088 {
3092 {
3098 {
3101 else
3103 }
3104 else
3106 /* Remember the location of the invalid "<". */
3109 /* Consume the "<". */
3111 /* Parse the template arguments. */
3113 /* Permanently remove the invalid template arguments so that
3114 this error message is not issued again. */
3117 }
3118 }
3120 /* If parsing an integral constant-expression, issue an error message
3121 about the fact that THING appeared and return true. Otherwise,
3122 return false. In either case, set
3123 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3125 static bool
3127 non_integral_constant thing)
3128 {
3131 {
3133 {
3136 {
3139 "ISO C++ forbids using a floating-point literal "
3144 "enumeration type cannot appear in a "
3235 }
3239 }
3240 }
3242 }
3244 /* Emit a diagnostic for an invalid type name. This function commits
3245 to the current active tentative parse, if any. (Otherwise, the
3246 problematic construct might be encountered again later, resulting
3247 in duplicate error messages.) LOCATION is the location of ID. */
3249 static void
3251 location_t location)
3252 {
3255 /* Try to lookup the identifier. */
3262 /* If the lookup was ambiguous, an error will already have
3263 been issued. */
3265 /* If the lookup found a template-name, it means that the user forgot
3266 to specify an argument list. Emit a useful error message. */
3268 {
3271 decl);
3276 }
3280 /* Something like 'unsigned A a;' */
3283 {
3284 /* Issue an error message. */
3285 name_hint hint;
3289 {
3295 }
3296 else
3298 /* If we're in a template class, it's possible that the user was
3299 referring to a type from a base class. For example:
3301 template <typename T> struct A { typedef T X; };
3302 template <typename T> struct B : public A<T> { X x; };
3304 The user should have said "typename A<T>::X". */
3320 {
3321 tree b;
3324 b;
3326 {
3330 {
3331 tree field;
3332 /* Go from a particular instantiation of the
3333 template (which will have an empty TYPE_FIELDs),
3334 to the main version. */
3337 field;
3341 {
3346 }
3349 }
3350 }
3351 }
3352 }
3353 /* Here we diagnose qualified-ids where the scope is actually correct,
3354 but the identifier does not resolve to a valid type name. */
3356 {
3358 {
3367 else
3376 }
3379 {
3380 /* A<T>::A<T>() */
3386 }
3389 {
3392 "need %<typename%> before %<%T::%D::%E%> because "
3396 id,
3399 else
3403 }
3405 {
3417 else
3423 }
3424 else
3426 }
3427 }
3429 /* Check for a common situation where a type-name should be present,
3430 but is not, and issue a sensible error message. Returns true if an
3431 invalid type-name was detected.
3433 The situation handled by this function are variable declarations of the
3434 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3435 Usually, `ID' should name a type, but if we got here it means that it
3436 does not. We try to emit the best possible error message depending on
3437 how exactly the id-expression looks like. */
3439 static bool
3441 {
3442 tree id;
3445 /* Avoid duplicate error about ambiguous lookup. */
3447 {
3451 }
3460 /* If the next token is a (, this is a function with no explicit return
3461 type, i.e. constructor, destructor or conversion op. */
3464 {
3467 }
3471 /* Emit a diagnostic for the invalid type. */
3473 out:
3474 /* If we aren't in the middle of a declarator (i.e. in a
3475 parameter-declaration-clause), skip to the end of the declaration;
3476 there's no point in trying to process it. */
3480 }
3482 /* Consume tokens up to, and including, the next non-nested closing `)'.
3483 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3484 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3485 found an unnested token of that type. */
3487 static int
3490 cpp_ttype or_ttype,
3492 {
3503 {
3506 /* Have we found what we're looking for before the closing paren? */
3512 {
3515 /* If we've run out of tokens, then there is no closing `)'. */
3518 /* This is good for lambda expression capture-lists. */
3528 /* This matches the processing in skip_to_end_of_statement. */
3548 {
3552 }
3562 condop_depth--;
3567 }
3569 /* Consume the token. */
3571 }
3572 }
3574 /* Consume tokens up to, and including, the next non-nested closing `)'.
3575 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3576 are doing error recovery. Returns -1 if OR_COMMA is true and we
3577 found an unnested token of that type. */
3579 static int
3584 {
3588 }
3590 /* Consume tokens until we reach the end of the current statement.
3591 Normally, that will be just before consuming a `;'. However, if a
3592 non-nested `}' comes first, then we stop before consuming that. */
3594 static void
3596 {
3599 /* Unwind generic function template scope if necessary. */
3604 {
3608 {
3611 /* If we've run out of tokens, stop. */
3615 /* If the next token is a `;', we have reached the end of the
3616 statement. */
3622 /* If this is a non-nested '}', stop before consuming it.
3623 That way, when confronted with something like:
3625 { 3 + }
3627 we stop before consuming the closing '}', even though we
3628 have not yet reached a `;'. */
3632 /* If it is the closing '}' for a block that we have
3633 scanned, stop -- but only after consuming the token.
3634 That way given:
3636 void f g () { ... }
3637 typedef int I;
3639 we will stop after the body of the erroneously declared
3640 function, but before consuming the following `typedef'
3641 declaration. */
3643 {
3646 }
3655 }
3657 /* Consume the token. */
3659 }
3660 }
3662 /* This function is called at the end of a statement or declaration.
3663 If the next token is a semicolon, it is consumed; otherwise, error
3664 recovery is attempted. */
3666 static void
3668 {
3669 /* Look for the trailing `;'. */
3671 {
3672 /* If there is additional (erroneous) input, skip to the end of
3673 the statement. */
3675 /* If the next token is now a `;', consume it. */
3678 }
3679 }
3681 /* Skip tokens until we have consumed an entire block, or until we
3682 have consumed a non-nested `;'. */
3684 static void
3686 {
3689 /* Unwind generic function template scope if necessary. */
3694 {
3698 {
3701 /* If we've run out of tokens, stop. */
3705 /* Stop if this is an unnested ';'. */
3711 /* Stop if this is an unnested '}', or closes the outermost
3712 nesting level. */
3713 nesting_depth--;
3721 /* Nest. */
3722 nesting_depth++;
3727 }
3729 /* Consume the token. */
3731 }
3732 }
3734 /* Skip tokens until a non-nested closing curly brace is the next
3735 token, or there are no more tokens. Return true in the first case,
3736 false otherwise. */
3738 static bool
3740 {
3744 {
3748 {
3751 /* If we've run out of tokens, stop. */
3755 /* If the next token is a non-nested `}', then we have reached
3756 the end of the current block. */
3762 /* If it the next token is a `{', then we are entering a new
3763 block. Consume the entire block. */
3769 }
3771 /* Consume the token. */
3773 }
3774 }
3776 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3777 parameter is the PRAGMA token, allowing us to purge the entire pragma
3778 sequence. */
3780 static void
3782 {
3787 do
3791 /* Ensure that the pragma is not parsed again. */
3793 }
3795 /* Require pragma end of line, resyncing with it as necessary. The
3796 arguments are as for cp_parser_skip_to_pragma_eol. */
3798 static void
3800 {
3804 }
3806 /* This is a simple wrapper around make_typename_type. When the id is
3807 an unresolved identifier node, we can provide a superior diagnostic
3808 using cp_parser_diagnose_invalid_type_name. */
3810 static tree
3812 location_t id_location)
3813 {
3814 tree result;
3816 {
3822 }
3824 }
3826 /* This is a wrapper around the
3827 make_{pointer,ptrmem,reference}_declarator functions that decides
3828 which one to call based on the CODE and CLASS_TYPE arguments. The
3829 CODE argument should be one of the values returned by
3830 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3831 appertain to the pointer or reference. */
3835 cp_cv_quals cv_qualifiers,
3837 tree attributes)
3838 {
3845 else
3855 }
3857 /* Create a new C++ parser. */
3861 {
3866 /* cp_lexer_new_main is called before doing GC allocation because
3867 cp_lexer_new_main might load a PCH file. */
3870 /* Initialize the binops_by_token so that we can get the tree
3871 directly from the token. */
3879 /* For now, we always accept GNU extensions. */
3882 /* The `>' token is a greater-than operator, not the end of a
3883 template-id. */
3888 /* We are not parsing a constant-expression. */
3893 /* Local variable names are not forbidden. */
3896 /* We are not processing an `extern "C"' declaration. */
3899 /* We are not processing a declarator. */
3902 /* We are not processing a template-argument-list. */
3905 /* We are not in an iteration statement. */
3908 /* We are not in a switch statement. */
3911 /* We are not parsing a type-id inside an expression. */
3914 /* Declarations aren't implicitly extern "C". */
3917 /* String literals should be translated to the execution character set. */
3920 /* We are not parsing a function body. */
3923 /* We can correct until told otherwise. */
3926 /* The unparsed function queue is empty. */
3929 /* There are no classes being defined. */
3932 /* No template parameters apply. */
3935 /* Special parsing data structures. */
3939 /* Not declaring an implicit function template. */
3945 /* Allow constrained-type-specifiers. */
3948 /* We haven't yet seen an 'extern "C"'. */
3952 }
3954 /* Create a cp_lexer structure which will emit the tokens in CACHE
3955 and push it onto the parser's lexer stack. This is used for delayed
3956 parsing of in-class method bodies and default arguments, and should
3957 not be confused with tentative parsing. */
3958 static void
3960 {
3965 /* Move the current source position to that of the first token in the
3966 new lexer. */
3968 }
3970 /* Pop the top lexer off the parser stack. This is never used for the
3971 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3972 static void
3974 {
3979 /* Put the current source position back where it was before this
3980 lexer was pushed. */
3982 }
3984 /* Lexical conventions [gram.lex] */
3986 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3987 identifier. */
3989 static cp_expr
3991 {
3994 /* Look for the identifier. */
3996 /* Return the value. */
3999 else
4001 }
4003 /* Parse a sequence of adjacent string constants. Returns a
4004 TREE_STRING representing the combined, nul-terminated string
4005 constant. If TRANSLATE is true, translate the string to the
4006 execution character set. If WIDE_OK is true, a wide string is
4007 invalid here.
4009 C++98 [lex.string] says that if a narrow string literal token is
4010 adjacent to a wide string literal token, the behavior is undefined.
4011 However, C99 6.4.5p4 says that this results in a wide string literal.
4012 We follow C99 here, for consistency with the C front end.
4014 This code is largely lifted from lex_string() in c-lex.c.
4016 FUTURE: ObjC++ will need to handle @-strings here. */
4017 static cp_expr
4020 {
4021 tree value;
4028 tree string_tree;
4034 {
4037 }
4042 {
4046 }
4047 else
4048 {
4051 }
4054 /* Try to avoid the overhead of creating and destroying an obstack
4055 for the common case of just one string. */
4058 {
4066 {
4070 }
4071 else
4075 }
4076 else
4077 {
4082 do
4083 {
4085 count++;
4090 {
4093 {
4096 }
4099 {
4104 }
4106 }
4107 else
4111 {
4115 {
4119 "unsupported non-standard concatenation "
4121 }
4122 }
4130 {
4134 }
4135 else
4136 {
4140 }
4141 }
4144 /* A string literal built by concatenation has its caret=start at
4145 the start of the initial string, and its finish at the finish of
4146 the final string literal. */
4150 }
4153 {
4156 }
4160 {
4165 {
4180 }
4185 {
4190 else
4192 }
4193 }
4194 else
4195 /* cpp_interpret_string has issued an error. */
4202 }
4204 /* Look up a literal operator with the name and the exact arguments. */
4206 static tree
4208 {
4209 tree decl;
4215 {
4221 {
4224 {
4234 }
4237 /* May be this should be sufficient_parms_p instead,
4238 depending on how exactly should user-defined literals
4239 work in presence of default arguments on the literal
4240 operator parameters. */
4243 }
4244 }
4247 }
4249 /* Parse a user-defined char constant. Returns a call to a user-defined
4250 literal operator taking the character as an argument. */
4252 static cp_expr
4254 {
4262 /* Build up a call to the user-defined operator */
4263 /* Lookup the name we got back from the id-expression. */
4268 {
4273 }
4277 }
4279 /* A subroutine of cp_parser_userdef_numeric_literal to
4280 create a char... template parameter pack from a string node. */
4282 static tree
4284 {
4285 tree charvec;
4291 /* Fill in CHARVEC with all of the parameters. */
4296 /* Build the argument packs. */
4302 }
4304 /* A subroutine of cp_parser_userdef_numeric_literal to
4305 create a char... template parameter pack from a string node. */
4307 static tree
4309 {
4310 tree charvec;
4321 /* First template parm is character type. */
4324 /* Fill in CHARVEC with all of the parameters. */
4331 /* Build the argument packs. */
4337 }
4339 /* Parse a user-defined numeric constant. returns a call to a user-defined
4340 literal operator. */
4342 static cp_expr
4344 {
4355 /* Look for a literal operator taking the exact type of numeric argument
4356 as the literal value. */
4361 {
4363 tf_warning_or_error);
4366 {
4369 long_long_unsigned_type_node);
4370 }
4371 else
4372 {
4376 long_double_type_node);
4380 }
4384 }
4387 /* If the numeric argument didn't work, look for a raw literal
4388 operator taking a const char* argument consisting of the number
4389 in string format. */
4394 {
4396 tf_warning_or_error);
4399 }
4402 /* If the raw literal didn't work, look for a non-type template
4403 function with parameter pack char.... Call the function with
4404 template parameter characters representing the number. */
4408 {
4412 tf_warning_or_error);
4415 }
4419 /* In C++14 the standard library defines complex number suffixes that
4420 conflict with GNU extensions. Prefer them if <complex> is #included. */
4430 {
4435 {
4436 /* No <complex>, so pedwarn and use GNU semantics. */
4439 }
4440 }
4442 bool complained
4449 {
4451 "(from <complex>) to enable the C++14 user-defined literal "
4456 }
4463 else
4464 {
4465 /* Use the built-in semantics. */
4466 tree type;
4468 {
4471 else
4473 }
4482 }
4485 /* Avoid repeated diagnostics. */
4488 }
4490 /* Parse a user-defined string constant. Returns a call to a user-defined
4491 literal operator taking a character pointer and the length of the string
4492 as arguments. */
4494 static tree
4496 {
4505 /* Build up a call to the user-defined operator. */
4506 /* Lookup the name we got back from the id-expression. */
4513 {
4515 tf_warning_or_error);
4518 }
4521 /* Look for a template function with typename parameter CharT
4522 and parameter pack CharT... Call the function with
4523 template parameter characters representing the string. */
4527 {
4531 tf_warning_or_error);
4534 }
4540 }
4543 /* Basic concepts [gram.basic] */
4545 /* Parse a translation-unit.
4547 translation-unit:
4548 declaration-seq [opt]
4550 Returns TRUE if all went well. */
4552 static bool
4554 {
4555 /* The address of the first non-permanent object on the declarator
4556 obstack. */
4561 /* Create the declarator obstack, if necessary. */
4563 {
4565 /* Create the error declarator. */
4567 /* Create the empty parameter list. */
4569 UNKNOWN_LOCATION);
4570 /* Remember where the base of the declarator obstack lies. */
4572 }
4576 /* If there are no tokens left then all went well. */
4578 {
4579 /* Get rid of the token array; we don't need it any more. */
4583 /* This file might have been a context that's implicitly extern
4584 "C". If so, pop the lang context. (Only relevant for PCH.) */
4586 {
4589 }
4591 /* Finish up. */
4595 }
4596 else
4597 {
4600 }
4602 /* Make sure the declarator obstack was fully cleaned up. */
4606 /* All went well. */
4608 }
4610 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4611 decltype context. */
4615 {
4620 }
4622 /* We're about to parse a collection of statements. If we're currently
4623 parsing tentatively, set up a firewall so that any nested
4624 cp_parser_commit_to_tentative_parse won't affect the current context. */
4626 static cp_token_position
4628 {
4635 }
4637 /* We've finished parsing the collection of statements. Wrap up the
4638 firewall and replace the relevant tokens with the parsed form. */
4640 static void
4642 tree expr)
4643 {
4647 /* Finish the firewall level. */
4649 /* And remember the result of the parse for when we try again. */
4655 }
4657 /* Like the above functions, but let the user modify the tokens. Used by
4658 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4659 later parses, so it makes sense to localize the effects of
4660 cp_parser_commit_to_tentative_parse. */
4662 struct tentative_firewall
4663 {
4668 {
4669 /* If we're currently parsing tentatively, start a committed level as a
4670 firewall and then an inner tentative parse. */
4672 {
4676 }
4677 }
4680 {
4682 {
4683 /* Finish the inner tentative parse and the firewall, propagating any
4684 uncommitted error state to the outer tentative parse. */
4690 }
4691 }
4692 };
4694 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4695 This class is for tracking such a matching pair of symbols.
4696 In particular, it tracks the location of the first token,
4697 so that if the second token is missing, we can highlight the
4698 location of the first token when notifying the user about the
4699 problem. */
4702 class token_pair
4703 {
4705 /* token_pair's ctor. */
4708 /* If the next token is the opening symbol for this pair, consume it and
4709 return true.
4710 Otherwise, issue an error and return false.
4711 In either case, record the location of the opening token. */
4714 {
4718 }
4720 /* Consume the next token from PARSER, recording its location as
4721 that of the opening token within the pair. */
4724 {
4729 }
4731 /* If the next token is the closing symbol for this pair, consume it
4732 and return it.
4733 Otherwise, issue an error, highlighting the location of the
4734 corresponding opening token, and return NULL. */
4737 {
4740 m_open_loc);
4741 }
4744 location_t m_open_loc;
4745 };
4747 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4749 struct matching_paren_traits
4750 {
4755 };
4757 /* "matching_parens" is a token_pair<T> class for tracking matching
4758 pairs of parentheses. */
4762 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4764 struct matching_brace_traits
4765 {
4770 };
4772 /* "matching_braces" is a token_pair<T> class for tracking matching
4773 pairs of braces. */
4778 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4779 enclosing parentheses. */
4781 static cp_expr
4783 {
4786 /* Consume the '('. */
4788 matching_parens parens;
4790 /* Start the statement-expression. */
4792 /* Parse the compound-statement. */
4794 /* Finish up. */
4796 /* Consume the ')'. */
4804 }
4806 /* Expressions [gram.expr] */
4808 /* Parse a fold-operator.
4810 fold-operator:
4811 - * / % ^ & | = < > << >>
4812 = -= *= /= %= ^= &= |= <<= >>=
4813 == != <= >= && || , .* ->*
4815 This returns the tree code corresponding to the matched operator
4816 as an int. When the current token matches a compound assignment
4817 opertor, the resulting tree code is the negative value of the
4818 non-assignment operator. */
4820 static int
4822 {
4824 {
4864 }
4865 }
4867 /* Returns true if CODE indicates a binary expression, which is not allowed in
4868 the LHS of a fold-expression. More codes will need to be added to use this
4869 function in other contexts. */
4871 static bool
4873 {
4875 {
4908 }
4909 }
4911 /* If the next token is a suitable fold operator, consume it and return as
4912 the function above. */
4914 static int
4916 {
4922 }
4924 /* Parse a fold-expression.
4926 fold-expression:
4927 ( ... folding-operator cast-expression)
4928 ( cast-expression folding-operator ... )
4929 ( cast-expression folding operator ... folding-operator cast-expression)
4931 Note that the '(' and ')' are matched in primary expression. */
4933 static cp_expr
4935 {
4936 cp_id_kind pidk;
4938 // Left fold.
4940 {
4944 {
4947 }
4954 }
4959 {
4962 }
4965 {
4968 }
4971 /* The operands of a fold-expression are cast-expressions, so binary or
4972 conditional expressions are not allowed. We check this here to avoid
4973 tentative parsing. */
4985 // Right fold.
4990 {
4993 }
4996 // Binary left or right fold.
5001 }
5003 /* Parse a primary-expression.
5005 primary-expression:
5006 literal
5007 this
5008 ( expression )
5009 id-expression
5010 lambda-expression (C++11)
5012 GNU Extensions:
5014 primary-expression:
5015 ( compound-statement )
5016 __builtin_va_arg ( assignment-expression , type-id )
5017 __builtin_offsetof ( type-id , offsetof-expression )
5019 C++ Extensions:
5020 __has_nothrow_assign ( type-id )
5021 __has_nothrow_constructor ( type-id )
5022 __has_nothrow_copy ( type-id )
5023 __has_trivial_assign ( type-id )
5024 __has_trivial_constructor ( type-id )
5025 __has_trivial_copy ( type-id )
5026 __has_trivial_destructor ( type-id )
5027 __has_virtual_destructor ( type-id )
5028 __is_abstract ( type-id )
5029 __is_base_of ( type-id , type-id )
5030 __is_class ( type-id )
5031 __is_empty ( type-id )
5032 __is_enum ( type-id )
5033 __is_final ( type-id )
5034 __is_literal_type ( type-id )
5035 __is_pod ( type-id )
5036 __is_polymorphic ( type-id )
5037 __is_std_layout ( type-id )
5038 __is_trivial ( type-id )
5039 __is_union ( type-id )
5041 Objective-C++ Extension:
5043 primary-expression:
5044 objc-expression
5046 literal:
5047 __null
5049 ADDRESS_P is true iff this expression was immediately preceded by
5050 "&" and therefore might denote a pointer-to-member. CAST_P is true
5051 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5052 true iff this expression is a template argument.
5054 Returns a representation of the expression. Upon return, *IDK
5055 indicates what kind of id-expression (if any) was present. */
5057 static cp_expr
5064 {
5067 /* Assume the primary expression is not an id-expression. */
5070 /* Peek at the next token. */
5073 {
5074 /* literal:
5075 integer-literal
5076 character-literal
5077 floating-literal
5078 string-literal
5079 boolean-literal
5080 pointer-literal
5081 user-defined-literal */
5093 {
5097 }
5098 /* Floating-point literals are only allowed in an integral
5099 constant expression if they are cast to an integral or
5100 enumeration type. */
5104 {
5105 /* CAST_P will be set even in invalid code like "int(2.7 +
5106 ...)". Therefore, we have to check that the next token
5107 is sure to end the cast. */
5109 {
5114 enumerator-definition. */
5116 /* The curly brace at the end of an enum-specifier. */
5118 /* The end of a statement. */
5120 /* The end of the cast-expression. */
5122 /* The end of an array bound. */
5124 /* The closing ">" in a template-argument-list. */
5127 /* C++0x only: A ">>" treated like two ">" tokens,
5128 in a template-argument-list. */
5133 }
5135 /* If we are within a cast, then the constraint that the
5136 cast is to an integral or enumeration type will be
5137 checked at that point. If we are not within a cast, then
5138 this code is invalid. */
5141 }
5161 /* ??? Should wide strings be allowed when parser->translate_strings_p
5162 is false (i.e. in attributes)? If not, we can kill the third
5163 argument to cp_parser_string_literal. */
5169 /* If we see `( { ' then we are looking at the beginning of
5170 a GNU statement-expression. */
5173 {
5174 /* Statement-expressions are not allowed by the standard. */
5178 /* And they're not allowed outside of a function-body; you
5179 cannot, for example, write:
5181 int i = ({ int j = 3; j + 1; });
5183 at class or namespace scope. */
5186 {
5188 "statement-expressions are not allowed outside "
5194 }
5195 else
5197 }
5198 /* Otherwise it's a normal parenthesized expression. */
5199 {
5200 cp_expr expr;
5205 /* Consume the `('. */
5206 matching_parens parens;
5208 /* Within a parenthesized expression, a `>' token is always
5209 the greater-than operator. */
5210 saved_greater_than_is_operator_p
5215 /* Left fold expression. */
5217 else
5218 /* Parse the parenthesized expression. */
5223 {
5230 }
5231 else
5232 /* Let the front end know that this expression was
5233 enclosed in parentheses. This matters in case, for
5234 example, the expression is of the form `A::B', since
5235 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5236 not. */
5239 /* DR 705: Wrapping an unqualified name in parentheses
5240 suppresses arg-dependent lookup. We want to pass back
5241 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5242 (c++/37862), but none of the others. */
5246 /* The `>' token might be the end of a template-id or
5247 template-parameter-list now. */
5248 parser->greater_than_is_operator_p
5251 /* Consume the `)'. */
5260 }
5263 {
5265 {
5266 /* We might have an Objective-C++ message. */
5269 /* If that works out, we're done ... */
5272 /* ... else, fall though to see if it's a lambda. */
5273 }
5275 /* Don't warn about a failed tentative parse. */
5280 }
5284 /* We have an Objective-C++ string literal. */
5291 {
5292 /* These two are the boolean literals. */
5300 /* The `__null' literal. */
5305 /* The `nullptr' literal. */
5310 /* Recognize the `this' keyword. */
5314 {
5318 }
5319 /* Pointers cannot appear in constant-expressions. */
5324 /* The `operator' keyword can be the beginning of an
5325 id-expression. */
5332 {
5333 non_integral_constant name;
5335 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5336 __func__ are the names of variables -- but they are
5337 treated specially. Therefore, they are handled here,
5338 rather than relying on the generic id-expression logic
5339 below. Grammatically, these names are id-expressions.
5341 Consume the token. */
5345 {
5357 }
5362 /* Look up the name. */
5364 }
5367 {
5368 tree expression;
5369 tree type;
5370 source_location type_location;
5371 location_t start_loc
5373 /* The `__builtin_va_arg' construct is used to handle
5374 `va_arg'. Consume the `__builtin_va_arg' token. */
5376 /* Look for the opening `('. */
5377 matching_parens parens;
5379 /* Now, parse the assignment-expression. */
5381 /* Look for the `,'. */
5384 /* Parse the type-id. */
5385 {
5388 }
5389 /* Look for the closing `)'. */
5390 location_t finish_loc
5393 /* Using `va_arg' in a constant-expression is not
5394 allowed. */
5396 NIC_VA_ARG))
5398 /* Construct a location of the form:
5399 __builtin_va_arg (v, int)
5400 ~~~~~~~~~~~~~~~~~~~~~^~~~
5401 with the caret at the type, ranging from the start of the
5402 "__builtin_va_arg" token to the close paren. */
5403 location_t combined_loc
5406 }
5441 // C++ concepts
5445 /* Objective-C++ expressions. */
5455 {
5460 }
5461 /* FALLTHRU */
5465 }
5467 /* An id-expression can start with either an identifier, a
5468 `::' as the beginning of a qualified-id, or the "operator"
5469 keyword. */
5474 {
5475 id_expression:
5476 cp_expr id_expression;
5477 cp_expr decl;
5483 /* Parse the id-expression. */
5484 id_expression
5501 /* If we have a template-id, then no further lookup is
5502 required. If the template-id was for a template-class, we
5503 will sometimes have a TYPE_DECL at this point. */
5507 /* Look up the name. */
5508 else
5509 {
5510 tree ambiguous_decls;
5512 /* If we already know that this lookup is ambiguous, then
5513 we've already issued an error message; there's no reason
5514 to check again. */
5517 {
5520 }
5523 none_type,
5524 template_p,
5529 /* If the lookup was ambiguous, an error will already have
5530 been issued. */
5534 /* In Objective-C++, we may have an Objective-C 2.0
5535 dot-syntax for classes here. */
5540 {
5541 tree component;
5548 component);
5549 /* Build a location of the form:
5550 expr.component
5551 ~~~~~^~~~~~~~~
5552 with caret at the start of the component name (at
5553 input_location), ranging from the start of the id_expression
5554 to the end of the component name. */
5555 location_t combined_loc
5560 }
5562 /* In Objective-C++, an instance variable (ivar) may be preferred
5563 to whatever cp_parser_lookup_name() found.
5564 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5565 rest of c-family, we have to do a little extra work to preserve
5566 any location information in cp_expr "decl". Given that
5567 objc_lookup_ivar is implemented in "c-family" and "objc", we
5568 have a trip through the pure "tree" type, rather than cp_expr.
5569 Naively copying it back to "decl" would implicitly give the
5570 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5571 store an EXPR_LOCATION. Hence we only update "decl" (and
5572 hence its location_t) if we get back a different tree node. */
5574 id_expression);
5578 /* If name lookup gives us a SCOPE_REF, then the
5579 qualifying scope was dependent. */
5581 {
5582 /* At this point, we do not know if DECL is a valid
5583 integral constant expression. We assume that it is
5584 in fact such an expression, so that code like:
5586 template <int N> struct A {
5587 int a[B<N>::i];
5588 };
5590 is accepted. At template-instantiation time, we
5591 will check that B<N>::i is actually a constant. */
5593 }
5594 /* Check to see if DECL is a local variable in a context
5595 where that is forbidden. */
5598 {
5603 }
5604 }
5606 decl = (finish_id_expression
5608 idk,
5613 template_arg_p,
5620 }
5622 /* Anything else is an error. */
5626 }
5627 }
5635 {
5638 }
5640 /* Parse an id-expression.
5642 id-expression:
5643 unqualified-id
5644 qualified-id
5646 qualified-id:
5647 :: [opt] nested-name-specifier template [opt] unqualified-id
5648 :: identifier
5649 :: operator-function-id
5650 :: template-id
5652 Return a representation of the unqualified portion of the
5653 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5654 a `::' or nested-name-specifier.
5656 Often, if the id-expression was a qualified-id, the caller will
5657 want to make a SCOPE_REF to represent the qualified-id. This
5658 function does not do this in order to avoid wastefully creating
5659 SCOPE_REFs when they are not required.
5661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5662 `template' keyword.
5664 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5665 uninstantiated templates.
5667 If *TEMPLATE_P is non-NULL, it is set to true iff the
5668 `template' keyword is used to explicitly indicate that the entity
5669 named is a template.
5671 If DECLARATOR_P is true, the id-expression is appearing as part of
5672 a declarator, rather than as part of an expression. */
5674 static cp_expr
5681 {
5685 /* Assume the `template' keyword was not used. */
5689 /* Look for the optional `::' operator. */
5690 global_scope_p
5691 = (!template_keyword_p
5696 /* Look for the optional nested-name-specifier. */
5697 nested_name_specifier_p
5700 check_dependency_p,
5702 declarator_p,
5703 template_keyword_p)
5706 /* If there is a nested-name-specifier, then we are looking at
5707 the first qualified-id production. */
5709 {
5710 tree saved_scope;
5711 tree saved_object_scope;
5712 tree saved_qualifying_scope;
5713 cp_expr unqualified_id;
5716 /* See if the next token is the `template' keyword. */
5720 /* Name lookup we do during the processing of the
5721 unqualified-id might obliterate SCOPE. */
5725 /* Process the final unqualified-id. */
5727 check_dependency_p,
5728 declarator_p,
5730 /* Restore the SAVED_SCOPE for our caller. */
5736 }
5737 /* Otherwise, if we are in global scope, then we are looking at one
5738 of the other qualified-id productions. */
5740 {
5742 tree id;
5744 /* Peek at the next token. */
5747 /* If it's an identifier, and the next token is not a "<", then
5748 we can avoid the template-id case. This is an optimization
5749 for this common case. */
5751 && !cp_parser_nth_token_starts_template_argument_list_p
5756 /* Try a template-id. */
5760 none_type,
5761 declarator_p);
5762 /* If that worked, we're done. */
5766 /* Peek at the next token. (Changes in the token buffer may
5767 have invalidated the pointer obtained above.) */
5771 {
5778 /* Fall through. */
5783 }
5784 }
5785 else
5788 declarator_p,
5789 optional_p);
5790 }
5792 /* Parse an unqualified-id.
5794 unqualified-id:
5795 identifier
5796 operator-function-id
5797 conversion-function-id
5798 ~ class-name
5799 template-id
5801 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5802 keyword, in a construct like `A::template ...'.
5804 Returns a representation of unqualified-id. For the `identifier'
5805 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5806 production a BIT_NOT_EXPR is returned; the operand of the
5807 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5808 other productions, see the documentation accompanying the
5809 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5810 names are looked up in uninstantiated templates. If DECLARATOR_P
5811 is true, the unqualified-id is appearing as part of a declarator,
5812 rather than as part of an expression. */
5814 static cp_expr
5820 {
5823 /* Peek at the next token. */
5827 {
5829 {
5830 tree id;
5832 /* We don't know yet whether or not this will be a
5833 template-id. */
5835 /* Try a template-id. */
5837 check_dependency_p,
5838 none_type,
5839 declarator_p);
5840 /* If it worked, we're done. */
5843 /* Otherwise, it's an ordinary identifier. */
5845 }
5849 check_dependency_p,
5850 none_type,
5851 declarator_p);
5854 {
5855 tree type_decl;
5856 tree qualifying_scope;
5857 tree object_scope;
5858 tree scope;
5861 /* Consume the `~' token. */
5863 /* Parse the class-name. The standard, as written, seems to
5864 say that:
5866 template <typename T> struct S { ~S (); };
5867 template <typename T> S<T>::~S() {}
5869 is invalid, since `~' must be followed by a class-name, but
5870 `S<T>' is dependent, and so not known to be a class.
5871 That's not right; we need to look in uninstantiated
5872 templates. A further complication arises from:
5874 template <typename T> void f(T t) {
5875 t.T::~T();
5876 }
5878 Here, it is not possible to look up `T' in the scope of `T'
5879 itself. We must look in both the current scope, and the
5880 scope of the containing complete expression.
5882 Yet another issue is:
5884 struct S {
5885 int S;
5886 ~S();
5887 };
5889 S::~S() {}
5891 The standard does not seem to say that the `S' in `~S'
5892 should refer to the type `S' and not the data member
5893 `S::S'. */
5895 /* DR 244 says that we look up the name after the "~" in the
5896 same scope as we looked up the qualifying name. That idea
5897 isn't fully worked out; it's more complicated than that. */
5902 /* Check for invalid scopes. */
5904 {
5908 }
5910 {
5914 scope);
5919 }
5922 /* If the name is of the form "X::~X" it's OK even if X is a
5923 typedef. */
5932 {
5935 }
5937 /* ~auto means the destructor of whatever the object is. */
5939 {
5942 "%<~auto%> only available with "
5946 }
5948 /* If there was an explicit qualification (S::~T), first look
5949 in the scope given by the qualification (i.e., S).
5951 Note: in the calls to cp_parser_class_name below we pass
5952 typename_type so that lookup finds the injected-class-name
5953 rather than the constructor. */
5957 {
5962 typename_type,
5965 declarator_p);
5968 }
5969 /* In "N::S::~S", look in "N" as well. */
5971 {
5976 type_decl
5980 typename_type,
5983 declarator_p);
5986 }
5987 /* In "p->S::~T", look in the scope given by "*p" as well. */
5989 {
5994 type_decl
5998 typename_type,
6001 declarator_p);
6004 }
6005 /* Look in the surrounding context. */
6007 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 {
6024 /* We couldn't find a type with this name. If we're parsing
6025 tentatively, fail and try something else. */
6027 {
6030 }
6031 /* Otherwise, accept it and check for a match at instantiation
6032 time. */
6037 }
6038 }
6039 /* If an error occurred, assume that the name of the
6040 destructor is the same as the name of the qualifying
6041 class. That allows us to keep parsing after running
6042 into ill-formed destructor names. */
6048 /* Check that destructor name and scope match. */
6050 {
6057 }
6059 /* [class.dtor]
6061 A typedef-name that names a class shall not be used as the
6062 identifier in the declarator for a destructor declaration. */
6069 type_decl);
6072 }
6076 {
6077 cp_expr id;
6079 /* This could be a template-id, so we try that first. */
6081 /* Try a template-id. */
6084 none_type,
6085 declarator_p);
6086 /* If that worked, we're done. */
6089 /* We still don't know whether we're looking at an
6090 operator-function-id or a conversion-function-id. */
6092 /* Try an operator-function-id. */
6094 /* If that didn't work, try a conversion-function-id. */
6099 }
6100 /* Fall through. */
6107 }
6108 }
6110 /* Parse an (optional) nested-name-specifier.
6112 nested-name-specifier: [C++98]
6113 class-or-namespace-name :: nested-name-specifier [opt]
6114 class-or-namespace-name :: template nested-name-specifier [opt]
6116 nested-name-specifier: [C++0x]
6117 type-name ::
6118 namespace-name ::
6119 nested-name-specifier identifier ::
6120 nested-name-specifier template [opt] simple-template-id ::
6122 PARSER->SCOPE should be set appropriately before this function is
6123 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6124 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6125 in name lookups.
6127 Sets PARSER->SCOPE to the class (TYPE) or namespace
6128 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6129 it unchanged if there is no nested-name-specifier. Returns the new
6130 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6132 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6133 part of a declaration and/or decl-specifier. */
6135 static tree
6142 {
6147 /* Remember where the nested-name-specifier starts. */
6149 {
6152 }
6155 {
6156 tree new_scope;
6157 tree old_scope;
6158 tree saved_qualifying_scope;
6160 /* Spot cases that cannot be the beginning of a
6161 nested-name-specifier. */
6164 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6165 the already parsed nested-name-specifier. */
6167 {
6168 /* Grab the nested-name-specifier and continue the loop. */
6170 /* If we originally encountered this nested-name-specifier
6171 with IS_DECLARATION set to false, we will not have
6172 resolved TYPENAME_TYPEs, so we must do so here. */
6175 {
6180 }
6183 }
6185 /* Spot cases that cannot be the beginning of a
6186 nested-name-specifier. On the second and subsequent times
6187 through the loop, we look for the `template' keyword. */
6189 ;
6190 /* A template-id can start a nested-name-specifier. */
6192 ;
6193 /* DR 743: decltype can be used in a nested-name-specifier. */
6195 ;
6196 else
6197 {
6198 /* If the next token is not an identifier, then it is
6199 definitely not a type-name or namespace-name. */
6202 /* If the following token is neither a `<' (to begin a
6203 template-id), nor a `::', then we are not looking at a
6204 nested-name-specifier. */
6210 {
6214 "found %<:%> in nested-name-specifier, "
6217 }
6220 && !cp_parser_nth_token_starts_template_argument_list_p
6223 }
6225 /* The nested-name-specifier is optional, so we parse
6226 tentatively. */
6229 /* Look for the optional `template' keyword, if this isn't the
6230 first time through the loop. */
6234 /* Save the old scope since the name lookup we are about to do
6235 might destroy it. */
6238 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6239 look up names in "X<T>::I" in order to determine that "Y" is
6240 a template. So, if we have a typename at this point, we make
6241 an effort to look through it. */
6243 && !typename_keyword_p
6248 /* Parse the qualifying entity. */
6249 new_scope
6251 typename_keyword_p,
6252 template_keyword_p,
6253 check_dependency_p,
6254 type_p,
6255 is_declaration);
6256 /* Look for the `::' token. */
6259 /* If we found what we wanted, we keep going; otherwise, we're
6260 done. */
6262 {
6265 /* Restore the OLD_SCOPE since it was valid before the
6266 failed attempt at finding the last
6267 class-or-namespace-name. */
6271 /* If the next token is a decltype, and the one after that is a
6272 `::', then the decltype has failed to resolve to a class or
6273 enumeration type. Give this error even when parsing
6274 tentatively since it can't possibly be valid--and we're going
6275 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6276 won't get another chance.*/
6280 {
6287 /* As below. */
6290 }
6294 {
6295 /* If we have a non-type template-id followed by ::, it can't
6296 possibly be valid. */
6301 {
6304 {
6310 }
6311 else
6312 {
6313 /* Variable template. */
6318 }
6325 /* As below. */
6329 }
6330 }
6334 /* If the next token is an identifier, and the one after
6335 that is a `::', then any valid interpretation would have
6336 found a class-or-namespace-name. */
6342 {
6345 {
6347 {
6348 tree decl;
6349 tree ambiguous_decls;
6352 none_type,
6361 decl);
6363 {
6364 // cp_parser_lookup_name has the same diagnostic,
6365 // thus make sure to emit it at most once.
6368 {
6373 }
6375 }
6376 else
6377 {
6379 cp_parser_name_lookup_error
6382 else
6383 cp_parser_name_lookup_error
6386 }
6387 }
6390 /* Treat this as a successful nested-name-specifier
6391 due to:
6393 [basic.lookup.qual]
6395 If the name found is not a class-name (clause
6396 _class_) or namespace-name (_namespace.def_), the
6397 program is ill-formed. */
6399 }
6401 }
6403 }
6404 /* We've found one valid nested-name-specifier. */
6406 /* Name lookup always gives us a DECL. */
6409 /* Uses of "template" must be followed by actual templates. */
6421 new_scope);
6422 /* If it is a class scope, try to complete it; we are about to
6423 be looking up names inside the class. */
6425 /* Since checking types for dependency can be expensive,
6426 avoid doing it if the type is already complete. */
6428 /* Do not try to complete dependent types. */
6430 {
6432 /* If it is a typedef to current class, use the current
6433 class instead, as the typedef won't have any names inside
6434 it yet. */
6438 }
6439 /* Make sure we look in the right scope the next time through
6440 the loop. */
6442 }
6444 /* If parsing tentatively, replace the sequence of tokens that makes
6445 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6446 token. That way, should we re-parse the token stream, we will
6447 not have to repeat the effort required to do the parse, nor will
6448 we issue duplicate error messages. */
6450 {
6454 /* Reset the contents of the START token. */
6456 /* Retrieve any deferred checks. Do not pop this access checks yet
6457 so the memory will not be reclaimed during token replacing below. */
6465 /* Purge all subsequent tokens. */
6467 }
6473 }
6475 /* Parse a nested-name-specifier. See
6476 cp_parser_nested_name_specifier_opt for details. This function
6477 behaves identically, except that it will an issue an error if no
6478 nested-name-specifier is present. */
6480 static tree
6486 {
6487 tree scope;
6489 /* Look for the nested-name-specifier. */
6491 typename_keyword_p,
6492 check_dependency_p,
6493 type_p,
6494 is_declaration);
6495 /* If it was not present, issue an error message. */
6497 {
6500 }
6503 }
6505 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6506 this is either a class-name or a namespace-name (which corresponds
6507 to the class-or-namespace-name production in the grammar). For
6508 C++0x, it can also be a type-name that refers to an enumeration
6509 type or a simple-template-id.
6511 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6512 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6513 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6514 TYPE_P is TRUE iff the next name should be taken as a class-name,
6515 even the same name is declared to be another entity in the same
6516 scope.
6518 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6519 specified by the class-or-namespace-name. If neither is found the
6520 ERROR_MARK_NODE is returned. */
6522 static tree
6529 {
6530 tree saved_scope;
6531 tree saved_qualifying_scope;
6532 tree saved_object_scope;
6533 tree scope;
6537 /* DR 743: decltype can appear in a nested-name-specifier. */
6539 {
6543 {
6546 }
6550 }
6552 /* Before we try to parse the class-name, we must save away the
6553 current PARSER->SCOPE since cp_parser_class_name will destroy
6554 it. */
6558 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6559 there is no need to look for a namespace-name. */
6560 only_class_p = template_keyword_p
6565 typename_keyword_p,
6566 template_keyword_p,
6568 check_dependency_p,
6570 is_declaration,
6573 /* If that didn't work, try for a namespace-name. */
6575 {
6576 /* Restore the saved scope. */
6580 /* If we are not looking at an identifier followed by the scope
6581 resolution operator, then this is not part of a
6582 nested-name-specifier. (Note that this function is only used
6583 to parse the components of a nested-name-specifier.) */
6588 }
6591 }
6593 /* Return true if we are looking at a compound-literal, false otherwise. */
6595 static bool
6597 {
6600 /* Skip tokens until the next token is a closing parenthesis.
6601 If we find the closing `)', and the next token is a `{', then
6602 we are looking at a compound-literal. */
6603 bool compound_literal_p
6608 /* Roll back the tokens we skipped. */
6612 }
6614 /* Return true if EXPR is the integer constant zero or a complex constant
6615 of zero, without any folding, but ignoring location wrappers. */
6617 static bool
6619 {
6622 }
6624 /* Parse a postfix-expression.
6626 postfix-expression:
6627 primary-expression
6628 postfix-expression [ expression ]
6629 postfix-expression ( expression-list [opt] )
6630 simple-type-specifier ( expression-list [opt] )
6631 typename :: [opt] nested-name-specifier identifier
6632 ( expression-list [opt] )
6633 typename :: [opt] nested-name-specifier template [opt] template-id
6634 ( expression-list [opt] )
6635 postfix-expression . template [opt] id-expression
6636 postfix-expression -> template [opt] id-expression
6637 postfix-expression . pseudo-destructor-name
6638 postfix-expression -> pseudo-destructor-name
6639 postfix-expression ++
6640 postfix-expression --
6641 dynamic_cast < type-id > ( expression )
6642 static_cast < type-id > ( expression )
6643 reinterpret_cast < type-id > ( expression )
6644 const_cast < type-id > ( expression )
6645 typeid ( expression )
6646 typeid ( type-id )
6648 GNU Extension:
6650 postfix-expression:
6651 ( type-id ) { initializer-list , [opt] }
6653 This extension is a GNU version of the C99 compound-literal
6654 construct. (The C99 grammar uses `type-name' instead of `type-id',
6655 but they are essentially the same concept.)
6657 If ADDRESS_P is true, the postfix expression is the operand of the
6658 `&' operator. CAST_P is true if this expression is the target of a
6659 cast.
6661 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6662 class member access expressions [expr.ref].
6664 Returns a representation of the expression. */
6666 static cp_expr
6670 {
6672 location_t loc;
6678 /* Peek at the next token. */
6683 /* Some of the productions are determined by keywords. */
6686 {
6691 {
6692 tree type;
6693 cp_expr expression;
6697 /* All of these can be handled in the same way from the point
6698 of view of parsing. Begin by consuming the token
6699 identifying the cast. */
6702 /* New types cannot be defined in the cast. */
6704 parser->type_definition_forbidden_message
6707 /* Look for the opening `<'. */
6709 /* Parse the type to which we are casting. */
6714 /* Look for the closing `>'. */
6716 /* Restore the old message. */
6719 bool saved_greater_than_is_operator_p
6723 /* And the expression which is being cast. */
6724 matching_parens parens;
6728 RT_CLOSE_PAREN);
6732 parser->greater_than_is_operator_p
6735 /* Only type conversions to integral or enumeration types
6736 can be used in constant-expressions. */
6739 {
6742 }
6745 {
6747 postfix_expression
6751 postfix_expression
6755 postfix_expression
6757 tf_warning_or_error);
6760 postfix_expression
6765 }
6767 /* Construct a location e.g. :
6768 reinterpret_cast <int *> (expr)
6769 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6770 ranging from the start of the "*_cast" token to the final closing
6771 paren, with the caret at the start. */
6774 }
6778 {
6779 tree type;
6783 /* Consume the `typeid' token. */
6785 /* Look for the `(' token. */
6786 matching_parens parens;
6788 /* Types cannot be defined in a `typeid' expression. */
6790 parser->type_definition_forbidden_message
6792 /* We can't be sure yet whether we're looking at a type-id or an
6793 expression. */
6795 /* Try a type-id first. */
6800 /* Look for the `)' token. Otherwise, we can't be sure that
6801 we're not looking at an expression: consider `typeid (int
6802 (3))', for example. */
6804 /* If all went well, simply lookup the type-id. */
6807 /* Otherwise, fall back to the expression variant. */
6808 else
6809 {
6810 tree expression;
6812 /* Look for an expression. */
6814 /* Compute its typeid. */
6816 /* Look for the `)' token. */
6818 }
6819 /* Restore the saved message. */
6821 /* `typeid' may not appear in an integral constant expression. */
6825 /* Construct a location e.g. :
6826 typeid (expr)
6827 ^~~~~~~~~~~~~
6828 ranging from the start of the "typeid" token to the final closing
6829 paren, with the caret at the start. */
6831 {
6832 location_t typeid_loc
6836 }
6837 }
6841 {
6842 tree type;
6843 /* The syntax permitted here is the same permitted for an
6844 elaborated-type-specifier. */
6851 }
6857 {
6860 tree p;
6867 {
6870 }
6876 {
6879 postfix_expression
6881 else
6882 {
6886 }
6892 tf_warning_or_error);
6893 else
6894 {
6898 }
6903 postfix_expression
6907 postfix_expression
6910 else
6911 {
6915 }
6920 }
6922 }
6925 {
6926 tree type;
6928 /* If the next thing is a simple-type-specifier, we may be
6929 looking at a functional cast. We could also be looking at
6930 an id-expression. So, we try the functional cast, and if
6931 that doesn't work we fall back to the primary-expression. */
6933 /* Look for the simple-type-specifier. */
6937 CP_PARSER_FLAGS_NONE);
6939 /* Parse the cast itself. */
6941 postfix_expression
6943 /* If that worked, we're done. */
6947 /* If the functional-cast didn't work out, try a
6948 compound-literal. */
6951 {
6956 matching_parens parens;
6959 /* Avoid calling cp_parser_type_id pointlessly, see comment
6960 in cp_parser_cast_expression about c++/29234. */
6963 else
6964 {
6965 /* Parse the type. */
6971 }
6973 /* If things aren't going well, there's no need to
6974 keep going. */
6976 {
6978 /* Parse the brace-enclosed initializer list. */
6981 }
6982 /* If that worked, we're definitely looking at a
6983 compound-literal expression. */
6985 {
6986 /* Warn the user that a compound literal is not
6987 allowed in standard C++. */
6990 /* For simplicity, we disallow compound literals in
6991 constant-expressions. We could
6992 allow compound literals of integer type, whose
6993 initializer was a constant, in constant
6994 expressions. Permitting that usage, as a further
6995 extension, would not change the meaning of any
6996 currently accepted programs. (Of course, as
6997 compound literals are not part of ISO C++, the
6998 standard has nothing to say.) */
7000 NIC_NCC))
7001 {
7004 }
7005 /* Form the representation of the compound-literal. */
7006 postfix_expression
7011 }
7012 }
7014 /* It must be a primary-expression. */
7015 postfix_expression
7018 decltype_p,
7020 }
7022 }
7024 /* Note that we don't need to worry about calling build_cplus_new on a
7025 class-valued CALL_EXPR in decltype when it isn't the end of the
7026 postfix-expression; unary_complex_lvalue will take care of that for
7027 all these cases. */
7029 /* Keep looping until the postfix-expression is complete. */
7031 {
7035 /* It is not a Koenig lookup function call. */
7036 postfix_expression
7039 /* Peek at the next token. */
7043 {
7046 {
7048 "two consecutive %<[%> shall "
7051 }
7052 postfix_expression
7054 postfix_expression,
7056 decltype_p);
7065 /* postfix-expression ( expression-list [opt] ) */
7066 {
7077 is_builtin_constant_p
7080 {
7081 /* The whole point of __builtin_constant_p is to allow
7082 non-constant expressions to appear as arguments. */
7083 saved_integral_constant_expression_p
7085 saved_non_integral_constant_expression_p
7088 }
7089 args = (cp_parser_parenthesized_expression_list
7096 {
7097 parser->integral_constant_expression_p
7099 parser->non_integral_constant_expression_p
7101 }
7104 {
7107 }
7109 /* Function calls are not permitted in
7110 constant-expressions. */
7113 NIC_FUNC_CALL))
7114 {
7118 }
7123 {
7125 {
7127 {
7130 postfix_expression
7132 complain);
7133 }
7134 else
7135 postfix_expression
7137 }
7138 /* We do not perform argument-dependent lookup if
7139 normal lookup finds a non-function, in accordance
7140 with the expected resolution of DR 218. */
7143 {
7147 /* Do not do argument dependent lookup if regular
7148 lookup finds a member function or a block-scope
7149 function declaration. [basic.lookup.argdep]/3 */
7152 {
7155 postfix_expression
7157 complain);
7158 }
7159 }
7160 }
7166 {
7173 }
7176 {
7186 {
7188 postfix_expression
7192 }
7195 {
7196 postfix_expression
7197 = (build_new_method_call
7203 complain));
7204 }
7205 else
7206 postfix_expression
7210 complain);
7211 }
7215 postfix_expression = (build_offset_ref_call_from_tree
7217 complain));
7219 /* A call to a static class member, or a namespace-scope
7220 function. */
7221 postfix_expression
7224 koenig_p,
7225 complain);
7226 else
7227 /* All other function calls. */
7228 postfix_expression
7231 koenig_p,
7232 complain);
7235 {
7237 start_loc,
7238 close_paren_loc);
7240 }
7242 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7246 }
7251 /* postfix-expression . template [opt] id-expression
7252 postfix-expression . pseudo-destructor-name
7253 postfix-expression -> template [opt] id-expression
7254 postfix-expression -> pseudo-destructor-name */
7256 /* Consume the `.' or `->' operator. */
7259 postfix_expression
7261 postfix_expression,
7268 /* postfix-expression ++ */
7269 /* Consume the `++' token. */
7271 /* Generate a representation for the complete expression. */
7272 postfix_expression
7274 POSTINCREMENT_EXPR);
7275 /* Increments may not appear in constant-expressions. */
7283 /* postfix-expression -- */
7284 /* Consume the `--' token. */
7286 /* Generate a representation for the complete expression. */
7287 postfix_expression
7289 POSTDECREMENT_EXPR);
7290 /* Decrements may not appear in constant-expressions. */
7301 return is_member_access
7302 ? postfix_expression
7304 else
7306 }
7307 }
7309 /* We should never get here. */
7312 }
7314 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7315 by cp_parser_builtin_offsetof. We're looking for
7317 postfix-expression [ expression ]
7318 postfix-expression [ braced-init-list ] (C++11)
7320 FOR_OFFSETOF is set if we're being called in that context, which
7321 changes how we deal with integer constant expressions. */
7323 static tree
7325 tree postfix_expression,
7328 {
7333 /* Consume the `[' token. */
7339 /* Parse the index expression. */
7340 /* ??? For offsetof, there is a question of what to allow here. If
7341 offsetof is not being used in an integral constant expression context,
7342 then we *could* get the right answer by computing the value at runtime.
7343 If we are in an integral constant expression context, then we might
7344 could accept any constant expression; hard to say without analysis.
7345 Rather than open the barn door too wide right away, allow only integer
7346 constant expressions here. */
7349 else
7350 {
7352 {
7357 }
7358 else
7360 }
7364 /* Look for the closing `]'. */
7367 /* Build the ARRAY_REF. */
7371 /* When not doing offsetof, array references are not permitted in
7372 constant-expressions. */
7378 }
7380 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7381 dereference of incomplete type, returns true if error_mark_node should
7382 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7383 and *DEPENDENT_P. */
7385 bool
7388 {
7389 /* In a template, be permissive by treating an object expression
7390 of incomplete type as dependent (after a pedwarn). */
7391 diagnostic_t kind = (processing_template_decl
7395 {
7407 /* Don't emit any diagnostic for OVERLOADs. */
7411 /* Avoid clobbering e.g. DECLs. */
7415 }
7427 {
7430 }
7432 }
7434 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7435 by cp_parser_builtin_offsetof. We're looking for
7437 postfix-expression . template [opt] id-expression
7438 postfix-expression . pseudo-destructor-name
7439 postfix-expression -> template [opt] id-expression
7440 postfix-expression -> pseudo-destructor-name
7442 FOR_OFFSETOF is set if we're being called in that context. That sorta
7443 limits what of the above we'll actually accept, but nevermind.
7444 TOKEN_TYPE is the "." or "->" token, which will already have been
7445 removed from the stream. */
7447 static tree
7450 cp_expr postfix_expression,
7452 location_t location)
7453 {
7454 tree name;
7460 /* If this is a `->' operator, dereference the pointer. */
7463 tf_warning_or_error);
7464 /* Check to see whether or not the expression is type-dependent and
7465 not the current instantiation. */
7467 /* The identifier following the `->' or `.' is not qualified. */
7473 /* Enter the scope corresponding to the type of the object
7474 given by the POSTFIX_EXPRESSION. */
7476 {
7478 /* According to the standard, no expression should ever have
7479 reference type. Unfortunately, we do not currently match
7480 the standard in this respect in that our internal representation
7481 of an expression may have reference type even when the standard
7482 says it does not. Therefore, we have to manually obtain the
7483 underlying type here. */
7485 /* The type of the POSTFIX_EXPRESSION must be complete. */
7486 /* Unlike the object expression in other contexts, *this is not
7487 required to be of complete type for purposes of class member
7488 access (5.2.5) outside the member function body. */
7492 {
7498 }
7501 {
7502 /* Let the name lookup machinery know that we are processing a
7503 class member access expression. */
7505 /* If something went wrong, we want to be able to discern that case,
7506 as opposed to the case where there was no SCOPE due to the type
7507 of expression being dependent. */
7510 /* If the SCOPE was erroneous, make the various semantic analysis
7511 functions exit quickly -- and without issuing additional error
7512 messages. */
7515 }
7516 }
7519 /* Tell cp_parser_lookup_name that there was an object, even though it's
7520 type-dependent. */
7523 /* Assume this expression is not a pseudo-destructor access. */
7526 /* If the SCOPE is a scalar type, then, if this is a valid program,
7527 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7528 is type dependent, it can be pseudo-destructor-name or something else.
7529 Try to parse it as pseudo-destructor-name first. */
7531 {
7532 tree s;
7533 tree type;
7536 /* Parse the pseudo-destructor-name. */
7545 {
7547 postfix_expression
7550 }
7551 }
7554 {
7555 /* If the SCOPE is not a scalar type, we are looking at an
7556 ordinary class member access expression, rather than a
7557 pseudo-destructor-name. */
7560 /* Parse the id-expression. */
7561 name = (cp_parser_id_expression
7568 /* In general, build a SCOPE_REF if the member name is qualified.
7569 However, if the name was not dependent and has already been
7570 resolved; there is no need to build the SCOPE_REF. For example;
7572 struct X { void f(); };
7573 template <typename T> void f(T* t) { t->X::f(); }
7575 Even though "t" is dependent, "X::f" is not and has been resolved
7576 to a BASELINK; there is no need to include scope information. */
7578 /* But we do need to remember that there was an explicit scope for
7579 virtual function calls. */
7583 /* If the name is a template-id that names a type, we will get a
7584 TYPE_DECL here. That is invalid code. */
7586 {
7589 }
7590 else
7591 {
7593 {
7595 {
7599 }
7600 else
7603 name,
7604 template_p);
7608 }
7610 adjust_result_of_qualified_name_lookup
7612 postfix_expression
7614 template_p,
7615 tf_warning_or_error);
7616 /* Build a location e.g.:
7617 ptr->access_expr
7618 ~~~^~~~~~~~~~~~~
7619 where the caret is at the deref token, ranging from
7620 the start of postfix_expression to the end of the access expr. */
7621 location_t end_loc
7623 location_t combined_loc
7626 }
7627 }
7629 /* We no longer need to look up names in the scope of the object on
7630 the left-hand side of the `.' or `->' operator. */
7633 /* Outside of offsetof, these operators may not appear in
7634 constant-expressions. */
7636 && (cp_parser_non_integral_constant_expression
7641 }
7643 /* Parse a parenthesized expression-list.
7645 expression-list:
7646 assignment-expression
7647 expression-list, assignment-expression
7649 attribute-list:
7650 expression-list
7651 identifier
7652 identifier, expression-list
7654 CAST_P is true if this expression is the target of a cast.
7656 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7657 argument pack.
7659 WRAP_LOCATIONS_P is true if expressions within this list for which
7660 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7661 their source locations.
7663 Returns a vector of trees. Each element is a representation of an
7664 assignment-expression. NULL is returned if the ( and or ) are
7665 missing. An empty, but allocated, vector is returned on no
7666 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7667 if we are parsing an attribute list for an attribute that wants a
7668 plain identifier argument, normal_attr for an attribute that wants
7669 an expression, or non_attr if we aren't parsing an attribute list. If
7670 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7671 not all of the expressions in the list were constant.
7672 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7673 will be written to with the location of the closing parenthesis. If
7674 an error occurs, it may or may not be written to. */
7684 {
7690 /* Assume all the expressions will be constant. */
7694 matching_parens parens;
7700 /* Within a parenthesized expression, a `>' token is always
7701 the greater-than operator. */
7702 saved_greater_than_is_operator_p
7708 /* Consume expressions until there are no more. */
7711 {
7712 /* At the beginning of attribute lists, check to see if the
7713 next token is an identifier. */
7716 {
7719 /* Consume the identifier. */
7721 /* Save the identifier. */
7723 }
7724 else
7725 {
7728 /* Parse the next assignment-expression. */
7730 {
7731 /* A braced-init-list. */
7737 }
7739 {
7740 expr = (cp_parser_constant_expression
7745 }
7746 else
7748 cast_p);
7753 /* If we have an ellipsis, then this is an expression
7754 expansion. */
7757 {
7758 /* Consume the `...'. */
7761 /* Build the argument pack. */
7763 }
7768 /* Add it to the list. We add error_mark_node
7769 expressions to the list, so that we can still tell if
7770 the correct form for a parenthesized expression-list
7771 is found. That gives better errors. */
7776 }
7778 /* After the first item, attribute lists look the same as
7779 expression lists. */
7782 get_comma:;
7783 /* If the next token isn't a `,', then we are done. */
7787 /* Otherwise, consume the `,' and keep going. */
7789 }
7795 {
7798 skip_comma:;
7799 /* We try and resync to an unnested comma, as that will give the
7800 user better diagnostics. */
7808 {
7809 parser->greater_than_is_operator_p
7812 }
7813 }
7815 parser->greater_than_is_operator_p
7822 }
7824 /* Parse a pseudo-destructor-name.
7826 pseudo-destructor-name:
7827 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7828 :: [opt] nested-name-specifier template template-id :: ~ type-name
7829 :: [opt] nested-name-specifier [opt] ~ type-name
7831 If either of the first two productions is used, sets *SCOPE to the
7832 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7833 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7834 or ERROR_MARK_NODE if the parse fails. */
7836 static void
7838 tree object,
7841 {
7844 /* Handle ~auto. */
7848 {
7851 "%<~auto%> only available with "
7858 }
7860 /* Assume that things will not work out. */
7863 /* Look for the optional `::' operator. */
7865 /* Look for the optional nested-name-specifier. */
7866 nested_name_specifier_p
7873 /* Now, if we saw a nested-name-specifier, we might be doing the
7874 second production. */
7877 {
7878 /* Consume the `template' keyword. */
7880 /* Parse the template-id. */
7884 class_type,
7886 /* Look for the `::' token. */
7888 }
7889 /* If the next token is not a `~', then there might be some
7890 additional qualification. */
7892 {
7893 /* At this point, we're looking for "type-name :: ~". The type-name
7894 must not be a class-name, since this is a pseudo-destructor. So,
7895 it must be either an enum-name, or a typedef-name -- both of which
7896 are just identifiers. So, we peek ahead to check that the "::"
7897 and "~" tokens are present; if they are not, then we can avoid
7898 calling type_name. */
7902 {
7905 }
7907 /* Look for the type-name. */
7912 /* Look for the `::' token. */
7914 }
7915 else
7918 /* Look for the `~'. */
7921 /* Once we see the ~, this has to be a pseudo-destructor. */
7925 /* Look for the type-name again. We are not responsible for
7926 checking that it matches the first type-name. */
7928 }
7930 /* Parse a unary-expression.
7932 unary-expression:
7933 postfix-expression
7934 ++ cast-expression
7935 -- cast-expression
7936 unary-operator cast-expression
7937 sizeof unary-expression
7938 sizeof ( type-id )
7939 alignof ( type-id ) [C++0x]
7940 new-expression
7941 delete-expression
7943 GNU Extensions:
7945 unary-expression:
7946 __extension__ cast-expression
7947 __alignof__ unary-expression
7948 __alignof__ ( type-id )
7949 alignof unary-expression [C++0x]
7950 __real__ cast-expression
7951 __imag__ cast-expression
7952 && identifier
7953 sizeof ( type-id ) { initializer-list , [opt] }
7954 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7955 __alignof__ ( type-id ) { initializer-list , [opt] }
7957 ADDRESS_P is true iff the unary-expression is appearing as the
7958 operand of the `&' operator. CAST_P is true if this expression is
7959 the target of a cast.
7961 Returns a representation of the expression. */
7963 static cp_expr
7966 {
7970 /* Peek at the next token. */
7972 /* Some keywords give away the kind of expression. */
7974 {
7978 {
7981 {
7989 /* Consume the token. */
7991 /* Parse the operand. */
7997 else
7998 {
7999 /* ISO C++ defines alignof only with types, not with
8000 expressions. So pedwarn if alignof is used with a non-
8001 type expression. However, __alignof__ is ok. */
8004 "ISO C++ does not allow %<alignof%> "
8008 }
8009 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8010 SIZEOF_EXPR with the original operand. */
8012 {
8014 {
8016 {
8019 error_mark_node));
8021 }
8022 else
8026 }
8027 }
8029 /* Construct a location e.g. :
8030 alignof (expr)
8031 ^~~~~~~~~~~~~~
8032 with start == caret at the start of the "alignof"/"sizeof"
8033 token, with the endpoint at the final closing paren. */
8034 location_t finish_loc
8036 location_t compound_loc
8043 }
8052 {
8053 /* The saved value of the PEDANTIC flag. */
8055 tree expr;
8057 /* Save away the PEDANTIC flag. */
8059 /* Parse the cast-expression. */
8061 /* Restore the PEDANTIC flag. */
8065 }
8069 {
8070 tree expression;
8072 /* Consume the `__real__' or `__imag__' token. */
8074 /* Parse the cast-expression. */
8076 /* Create the complete representation. */
8080 expression,
8081 tf_warning_or_error);
8082 }
8090 {
8091 tree expr;
8100 matching_parens parens;
8104 parser->type_definition_forbidden_message
8107 saved_integral_constant_expression_p
8109 saved_non_integral_constant_expression_p
8113 saved_greater_than_is_operator_p
8125 parser->greater_than_is_operator_p
8128 parser->integral_constant_expression_p
8130 parser->non_integral_constant_expression_p
8135 location_t finish_loc
8139 /* Construct a location of the form:
8140 noexcept (expr)
8141 ^~~~~~~~~~~~~~~
8142 with start == caret, finishing at the close-paren. */
8143 location_t noexcept_loc
8147 noexcept_loc);
8148 }
8152 }
8153 }
8155 /* Look for the `:: new' and `:: delete', which also signal the
8156 beginning of a new-expression, or delete-expression,
8157 respectively. If the next token is `::', then it might be one of
8158 these. */
8160 {
8163 /* See if the token after the `::' is one of the keywords in
8164 which we're interested. */
8166 /* If it's `new', we have a new-expression. */
8169 /* Similarly, for `delete'. */
8172 }
8174 /* Look for a unary operator. */
8176 /* The `++' and `--' operators can be handled similarly, even though
8177 they are not technically unary-operators in the grammar. */
8179 {
8184 /* Handle the GNU address-of-label extension. */
8187 {
8188 tree identifier;
8189 tree expression;
8192 /* Consume the '&&' token. */
8194 /* Look for the identifier. */
8195 location_t finish_loc
8198 /* Construct a location of the form:
8199 &&label
8200 ^~~~~~~
8201 with caret==start at the "&&", finish at the end of the label. */
8202 location_t combined_loc
8204 /* Create an expression representing the address. */
8207 NIC_ADDR_LABEL))
8210 }
8211 }
8213 {
8214 cp_expr cast_expression;
8220 /* Consume the operator token. */
8224 /* Parse the cast-expression. */
8225 cast_expression
8230 pidk);
8232 /* Make a location:
8233 OP_TOKEN CAST_EXPRESSION
8234 ^~~~~~~~~~~~~~~~~~~~~~~~~
8235 with start==caret at the operator token, and
8236 extending to the end of the cast_expression. */
8239 /* Now, build an appropriate representation. */
8241 {
8245 RO_UNARY_STAR,
8246 complain);
8247 /* TODO: build_x_indirect_ref does not always honor the
8248 location, so ensure it is set. */
8254 /* Fall through. */
8257 cast_expression,
8258 complain);
8259 /* TODO: build_x_unary_op does not always honor the location,
8260 so ensure it is set. */
8268 /* Fall through. */
8270 /* Immediately fold negation of a constant, unless the constant is 0
8271 (since -0 == 0) or it would overflow. */
8276 {
8279 cast_expression);
8281 {
8284 }
8285 }
8286 /* Fall through. */
8295 }
8299 non_constant_p))
8303 }
8307 decltype_p,
8308 pidk);
8309 }
8311 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8312 unary-operator, the corresponding tree code is returned. */
8314 static enum tree_code
8316 {
8318 {
8339 }
8340 }
8342 /* Parse a new-expression.
8344 new-expression:
8345 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8346 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8348 Returns a representation of the expression. */
8350 static tree
8352 {
8355 tree type;
8358 tree ret;
8362 /* Look for the optional `::' operator. */
8363 global_scope_p
8367 /* Look for the `new' operator. */
8369 /* There's no easy way to tell a new-placement from the
8370 `( type-id )' construct. */
8372 /* Look for a new-placement. */
8374 /* If that didn't work out, there's no new-placement. */
8376 {
8380 }
8382 /* If the next token is a `(', then we have a parenthesized
8383 type-id. */
8385 {
8389 /* Consume the `('. */
8390 matching_parens parens;
8393 /* Parse the type-id. */
8394 parser->type_definition_forbidden_message
8396 {
8399 }
8402 /* Look for the closing `)'. */
8405 /* There should not be a direct-new-declarator in this production,
8406 but GCC used to allowed this, so we check and emit a sensible error
8407 message for this case. */
8409 {
8415 }
8416 }
8417 /* Otherwise, there must be a new-type-id. */
8418 else
8421 /* If the next token is a `(' or '{', then we have a new-initializer. */
8426 else
8429 /* A new-expression may not appear in an integral constant
8430 expression. */
8433 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8434 of a new-type-id or type-id of a new-expression, the new-expression shall
8435 contain a new-initializer of the form ( assignment-expression )".
8436 Additionally, consistently with the spirit of DR 1467, we want to accept
8437 'new auto { 2 }' too. */
8443 {
8445 "initialization of new-expression for type %<auto%> "
8448 }
8449 else
8450 {
8451 /* Construct a location e.g.:
8452 ptr = new int[100]
8453 ^~~~~~~~~~~~
8454 with caret == start at the start of the "new" token, and the end
8455 at the end of the final token we consumed. */
8460 /* Create a representation of the new-expression. */
8462 tf_warning_or_error);
8464 }
8472 }
8474 /* Parse a new-placement.
8476 new-placement:
8477 ( expression-list )
8479 Returns the same representation as for an expression-list. */
8483 {
8486 /* Parse the expression-list. */
8487 expression_list = (cp_parser_parenthesized_expression_list
8496 }
8498 /* Parse a new-type-id.
8500 new-type-id:
8501 type-specifier-seq new-declarator [opt]
8503 Returns the TYPE allocated. If the new-type-id indicates an array
8504 type, *NELTS is set to the number of elements in the last array
8505 bound; the TYPE will not include the last array bound. */
8507 static tree
8509 {
8510 cp_decl_specifier_seq type_specifier_seq;
8516 /* The type-specifier sequence must not contain type definitions.
8517 (It cannot contain declarations of new types either, but if they
8518 are not definitions we will catch that because they are not
8519 complete.) */
8521 parser->type_definition_forbidden_message
8523 /* Parse the type-specifier-seq. */
8527 /* Restore the old message. */
8533 /* Parse the new-declarator. */
8536 /* Determine the number of elements in the last array dimension, if
8537 any. */
8539 /* Skip down to the last array dimension. */
8544 {
8547 }
8552 {
8555 }
8558 {
8565 else
8567 }
8570 }
8572 /* Parse an (optional) new-declarator.
8574 new-declarator:
8575 ptr-operator new-declarator [opt]
8576 direct-new-declarator
8578 Returns the declarator. */
8582 {
8585 cp_cv_quals cv_quals;
8587 /* We don't know if there's a ptr-operator next, or not. */
8589 /* Look for a ptr-operator. */
8591 /* If that worked, look for more new-declarators. */
8593 {
8596 /* Parse another optional declarator. */
8599 declarator = cp_parser_make_indirect_declarator
8603 }
8605 /* If the next token is a `[', there is a direct-new-declarator. */
8610 }
8612 /* Parse a direct-new-declarator.
8614 direct-new-declarator:
8615 [ expression ]
8616 direct-new-declarator [constant-expression]
8618 */
8622 {
8626 {
8627 tree expression;
8630 /* Look for the opening `['. */
8635 /* The standard requires that the expression have integral
8636 type. DR 74 adds enumeration types. We believe that the
8637 real intent is that these expressions be handled like the
8638 expression in a `switch' condition, which also allows
8639 classes with a single conversion to integral or
8640 enumeration type. */
8642 {
8643 expression
8645 expression,
8648 {
8650 "expression in new-declarator must have integral "
8653 }
8654 }
8656 /* Look for the closing `]'. */
8659 /* Add this bound to the declarator. */
8662 /* If the next token is not a `[', then there are no more
8663 bounds. */
8666 }
8669 }
8671 /* Parse a new-initializer.
8673 new-initializer:
8674 ( expression-list [opt] )
8675 braced-init-list
8677 Returns a representation of the expression-list. */
8681 {
8685 {
8686 tree t;
8693 }
8694 else
8695 expression_list = (cp_parser_parenthesized_expression_list
8701 }
8703 /* Parse a delete-expression.
8705 delete-expression:
8706 :: [opt] delete cast-expression
8707 :: [opt] delete [ ] cast-expression
8709 Returns a representation of the expression. */
8711 static tree
8713 {
8716 tree expression;
8718 /* Look for the optional `::' operator. */
8719 global_scope_p
8723 /* Look for the `delete' keyword. */
8725 /* See if the array syntax is in use. */
8727 {
8728 /* Consume the `[' token. */
8730 /* Look for the `]' token. */
8732 /* Remember that this is the `[]' construct. */
8734 }
8735 else
8738 /* Parse the cast-expression. */
8741 /* A delete-expression may not appear in an integral constant
8742 expression. */
8747 tf_warning_or_error);
8748 }
8750 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8751 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8752 0 otherwise. */
8754 static int
8756 {
8759 {
8801 /* In ((type ()) () the last () isn't a valid cast-expression,
8802 so the whole must be parsed as postfix-expression. */
8807 /* '[' may start a primary-expression in obj-c++ and in C++11,
8808 as a lambda-expression, eg, '(void)[]{}'. */
8815 /* '++' and '--' may or may not start a cast-expression:
8817 struct T { void operator++(int); };
8818 void f() { (T())++; }
8820 vs
8822 int a;
8823 (int)++a; */
8828 }
8829 }
8831 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8832 in the order: const_cast, static_cast, reinterpret_cast.
8834 Don't suggest dynamic_cast.
8836 Return the first legal cast kind found, or NULL otherwise. */
8840 {
8841 tree trial;
8843 /* Reuse the parser logic by attempting to build the various kinds of
8844 cast, with "complain" disabled.
8845 Identify the first such cast that is valid. */
8847 /* Don't attempt to run such logic within template processing. */
8851 /* First try const_cast. */
8856 /* If that fails, try static_cast. */
8861 /* Finally, try reinterpret_cast. */
8866 /* No such cast possible. */
8868 }
8870 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8871 suggesting how to convert a C-style cast of the form:
8873 (DST_TYPE)ORIG_EXPR
8875 to a C++-style cast.
8877 The primary range of RICHLOC is asssumed to be that of the original
8878 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8879 of the parens in the C-style cast. */
8881 static void
8884 tree dst_type)
8885 {
8886 /* This function is non-trivial, so bail out now if the warning isn't
8887 going to be emitted. */
8891 /* Try to find a legal C++ cast, trying them in order:
8892 const_cast, static_cast, reinterpret_cast. */
8897 /* Replace the open paren with "CAST_SUGGESTION<". */
8898 pretty_printer pp;
8902 /* Replace the close paren with "> (". */
8905 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8907 }
8910 /* Parse a cast-expression.
8912 cast-expression:
8913 unary-expression
8914 ( type-id ) cast-expression
8916 ADDRESS_P is true iff the unary-expression is appearing as the
8917 operand of the `&' operator. CAST_P is true if this expression is
8918 the target of a cast.
8920 Returns a representation of the expression. */
8922 static cp_expr
8925 {
8926 /* If it's a `(', then we might be looking at a cast. */
8928 {
8934 /* There's no way to know yet whether or not this is a cast.
8935 For example, `(int (3))' is a unary-expression, while `(int)
8936 3' is a cast. So, we resort to parsing tentatively. */
8938 /* Types may not be defined in a cast. */
8940 parser->type_definition_forbidden_message
8942 /* Consume the `('. */
8943 matching_parens parens;
8948 /* A very tricky bit is that `(struct S) { 3 }' is a
8949 compound-literal (which we permit in C++ as an extension).
8950 But, that construct is not a cast-expression -- it is a
8951 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8952 is legal; if the compound-literal were a cast-expression,
8953 you'd need an extra set of parentheses.) But, if we parse
8954 the type-id, and it happens to be a class-specifier, then we
8955 will commit to the parse at that point, because we cannot
8956 undo the action that is done when creating a new class. So,
8957 then we cannot back up and do a postfix-expression.
8959 Another tricky case is the following (c++/29234):
8961 struct S { void operator () (); };
8963 void foo ()
8964 {
8965 ( S()() );
8966 }
8968 As a type-id we parse the parenthesized S()() as a function
8969 returning a function, groktypename complains and we cannot
8970 back up in this case either.
8972 Therefore, we scan ahead to the closing `)', and check to see
8973 if the tokens after the `)' can start a cast-expression. Otherwise
8974 we are dealing with an unary-expression, a postfix-expression
8975 or something else.
8977 Yet another tricky case, in C++11, is the following (c++/54891):
8979 (void)[]{};
8981 The issue is that usually, besides the case of lambda-expressions,
8982 the parenthesized type-id cannot be followed by '[', and, eg, we
8983 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8984 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8985 we don't commit, we try a cast-expression, then an unary-expression.
8987 Save tokens so that we can put them back. */
8990 /* We may be looking at a cast-expression. */
8993 cast_expression
8996 /* Roll back the tokens we skipped. */
8998 /* If we aren't looking at a cast-expression, simulate an error so
8999 that the call to cp_parser_error_occurred below returns true. */
9002 else
9003 {
9006 /* Look for the type-id. */
9008 /* Look for the closing `)'. */
9013 }
9015 /* Restore the saved message. */
9018 /* At this point this can only be either a cast or a
9019 parenthesized ctor such as `(T ())' that looks like a cast to
9020 function returning T. */
9022 {
9023 /* Only commit if the cast-expression doesn't start with
9024 '++', '--', or '[' in C++11. */
9032 pidk);
9035 {
9036 /* Warn about old-style casts, if so requested. */
9041 {
9047 }
9049 /* Only type conversions to integral or enumeration types
9050 can be used in constant-expressions. */
9053 NIC_CAST))
9056 /* Perform the cast. */
9057 /* Make a location:
9058 (TYPE) EXPR
9059 ^~~~~~~~~~~
9060 with start==caret at the open paren, extending to the
9061 end of "expr". */
9063 open_paren_loc,
9067 }
9068 }
9069 else
9071 }
9073 /* If we get here, then it's not a cast, so it must be a
9074 unary-expression. */
9077 }
9079 /* Parse a binary expression of the general form:
9081 pm-expression:
9082 cast-expression
9083 pm-expression .* cast-expression
9084 pm-expression ->* cast-expression
9086 multiplicative-expression:
9087 pm-expression
9088 multiplicative-expression * pm-expression
9089 multiplicative-expression / pm-expression
9090 multiplicative-expression % pm-expression
9092 additive-expression:
9093 multiplicative-expression
9094 additive-expression + multiplicative-expression
9095 additive-expression - multiplicative-expression
9097 shift-expression:
9098 additive-expression
9099 shift-expression << additive-expression
9100 shift-expression >> additive-expression
9102 relational-expression:
9103 shift-expression
9104 relational-expression < shift-expression
9105 relational-expression > shift-expression
9106 relational-expression <= shift-expression
9107 relational-expression >= shift-expression
9109 GNU Extension:
9111 relational-expression:
9112 relational-expression <? shift-expression
9113 relational-expression >? shift-expression
9115 equality-expression:
9116 relational-expression
9117 equality-expression == relational-expression
9118 equality-expression != relational-expression
9120 and-expression:
9121 equality-expression
9122 and-expression & equality-expression
9124 exclusive-or-expression:
9125 and-expression
9126 exclusive-or-expression ^ and-expression
9128 inclusive-or-expression:
9129 exclusive-or-expression
9130 inclusive-or-expression | exclusive-or-expression
9132 logical-and-expression:
9133 inclusive-or-expression
9134 logical-and-expression && inclusive-or-expression
9136 logical-or-expression:
9137 logical-and-expression
9138 logical-or-expression || logical-and-expression
9140 All these are implemented with a single function like:
9142 binary-expression:
9143 simple-cast-expression
9144 binary-expression <token> binary-expression
9146 CAST_P is true if this expression is the target of a cast.
9148 The binops_by_token map is used to get the tree codes for each <token> type.
9149 binary-expressions are associated according to a precedence table. */
9151 #define TOKEN_PRECEDENCE(token) \
9152 (((token->type == CPP_GREATER \
9153 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9154 && !parser->greater_than_is_operator_p) \
9155 ? PREC_NOT_OPERATOR \
9156 : binops_by_token[token->type].prec)
9158 static cp_expr
9164 {
9165 cp_parser_expression_stack stack;
9167 cp_parser_expression_stack_entry current;
9168 cp_expr rhs;
9172 tree overload;
9174 /* Parse the first expression. */
9185 {
9186 /* Get an operator token. */
9192 {
9194 "%<>>%> operator is treated"
9198 }
9203 /* This is a fold-expression; handle it later. */
9206 /* Popping an entry off the stack means we completed a subexpression:
9207 - either we found a token which is not an operator (`>' where it is not
9208 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9209 will happen repeatedly;
9210 - or, we found an operator which has lower priority. This is the case
9211 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9212 parsing `3 * 4'. */
9214 {
9217 else
9219 }
9221 get_rhs:
9225 /* We used the operator token. */
9228 /* For "false && x" or "true || x", x will never be executed;
9229 disable warnings while evaluating it. */
9231 c_inhibit_evaluation_warnings +=
9234 c_inhibit_evaluation_warnings +=
9237 /* Extract another operand. It may be the RHS of this expression
9238 or the LHS of a new, higher priority expression. */
9243 /* Get another operator token. Look up its precedence to avoid
9244 building a useless (immediately popped) stack entry for common
9245 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9252 {
9253 /* ... and prepare to parse the RHS of the new, higher priority
9254 expression. Since precedence levels on the stack are
9255 monotonically increasing, we do not have to care about
9256 stack overflows. */
9265 pop:
9267 /* If the stack is not empty, we have parsed into LHS the right side
9268 (`4' in the example above) of an expression we had suspended.
9269 We can use the information on the stack to recover the LHS (`3')
9270 from the stack together with the tree code (`MULT_EXPR'), and
9271 the precedence of the higher level subexpression
9272 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9273 which will be used to actually build the additive expression. */
9278 }
9280 /* Undo the disabling of warnings done above. */
9282 c_inhibit_evaluation_warnings -=
9285 c_inhibit_evaluation_warnings -=
9291 /* Avoid warning for !!x == y. */
9296 /* Avoid warning for !b == y where b is boolean. */
9300 /* Avoid warning for !!b == y where b is boolean. */
9313 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9314 ERROR_MARK for everything that is not a binary expression.
9315 This makes warn_about_parentheses miss some warnings that
9316 involve unary operators. For unary expressions we should
9317 pass the correct tree_code unless the unary expression was
9318 surrounded by parentheses.
9319 */
9323 {
9326 else
9327 {
9328 current.lhs
9331 == tcc_comparison
9335 }
9336 }
9337 else
9338 {
9343 /* TODO: build_x_binary_op doesn't always honor the location. */
9345 }
9348 /* If the binary operator required the use of an overloaded operator,
9349 then this expression cannot be an integral constant-expression.
9350 An overloaded operator can be used even if both operands are
9351 otherwise permissible in an integral constant-expression if at
9352 least one of the operands is of enumeration type. */
9356 NIC_OVERLOADED))
9358 }
9361 }
9363 static cp_expr
9368 {
9371 }
9373 /* Parse the `? expression : assignment-expression' part of a
9374 conditional-expression. The LOGICAL_OR_EXPR is the
9375 logical-or-expression that started the conditional-expression.
9376 Returns a representation of the entire conditional-expression.
9378 This routine is used by cp_parser_assignment_expression.
9380 ? expression : assignment-expression
9382 GNU Extensions:
9384 ? : assignment-expression */
9386 static tree
9388 {
9390 cp_expr assignment_expr;
9394 /* Consume the `?' token. */
9399 {
9402 /* Implicit true clause. */
9404 c_inhibit_evaluation_warnings +=
9407 }
9408 else
9409 {
9412 /* Parse the expression. */
9413 c_inhibit_evaluation_warnings +=
9416 c_inhibit_evaluation_warnings +=
9420 }
9422 /* The next token should be a `:'. */
9424 /* Parse the assignment-expression. */
9426 c_inhibit_evaluation_warnings -=
9429 /* Make a location:
9430 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9431 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9432 with the caret at the "?", ranging from the start of
9433 the logical_or_expr to the end of the assignment_expr. */
9438 /* Build the conditional-expression. */
9440 expr,
9441 assignment_expr,
9442 tf_warning_or_error);
9443 }
9445 /* Parse an assignment-expression.
9447 assignment-expression:
9448 conditional-expression
9449 logical-or-expression assignment-operator assignment_expression
9450 throw-expression
9452 CAST_P is true if this expression is the target of a cast.
9453 DECLTYPE_P is true if this expression is the operand of decltype.
9455 Returns a representation for the expression. */
9457 static cp_expr
9460 {
9461 cp_expr expr;
9463 /* If the next token is the `throw' keyword, then we're looking at
9464 a throw-expression. */
9467 /* Otherwise, it must be that we are looking at a
9468 logical-or-expression. */
9469 else
9470 {
9471 /* Parse the binary expressions (logical-or-expression). */
9473 decltype_p,
9475 /* If the next token is a `?' then we're actually looking at a
9476 conditional-expression. */
9479 else
9480 {
9483 /* If it's an assignment-operator, we're using the second
9484 production. */
9485 enum tree_code assignment_operator
9488 {
9491 /* Parse the right-hand side of the assignment. */
9498 /* An assignment may not appear in a
9499 constant-expression. */
9501 NIC_ASSIGNMENT))
9503 /* Build the assignment expression. Its default
9504 location:
9505 LHS = RHS
9506 ~~~~^~~~~
9507 is the location of the '=' token as the
9508 caret, ranging from the start of the lhs to the
9509 end of the rhs. */
9514 assignment_operator,
9515 rhs,
9517 /* TODO: build_x_modify_expr doesn't honor the location,
9518 so we must set it here. */
9520 }
9521 }
9522 }
9525 }
9527 /* Parse an (optional) assignment-operator.
9529 assignment-operator: one of
9530 = *= /= %= += -= >>= <<= &= ^= |=
9532 GNU Extension:
9534 assignment-operator: one of
9535 <?= >?=
9537 If the next token is an assignment operator, the corresponding tree
9538 code is returned, and the token is consumed. For example, for
9539 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9540 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9541 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9542 operator, ERROR_MARK is returned. */
9544 static enum tree_code
9546 {
9550 /* Peek at the next token. */
9554 {
9600 /* Nothing else is an assignment operator. */
9602 }
9604 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9609 /* If it was an assignment operator, consume it. */
9614 }
9616 /* Parse an expression.
9618 expression:
9619 assignment-expression
9620 expression , assignment-expression
9622 CAST_P is true if this expression is the target of a cast.
9623 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9624 except possibly parenthesized or on the RHS of a comma (N3276).
9626 Returns a representation of the expression. */
9628 static cp_expr
9631 {
9636 {
9637 cp_expr assignment_expression;
9639 /* Parse the next assignment-expression. */
9640 assignment_expression
9643 /* We don't create a temporary for a call that is the immediate operand
9644 of decltype or on the RHS of a comma. But when we see a comma, we
9645 need to create a temporary for a call on the LHS. */
9650 assignment_expression
9654 /* If this is the first assignment-expression, we can just
9655 save it away. */
9658 else
9659 {
9660 /* Create a location with caret at the comma, ranging
9661 from the start of the LHS to the end of the RHS. */
9666 assignment_expression,
9669 }
9670 /* If the next token is not a comma, or we're in a fold-expression, then
9671 we are done with the expression. */
9675 /* Consume the `,'. */
9678 /* A comma operator cannot appear in a constant-expression. */
9681 }
9684 }
9686 /* Parse a constant-expression.
9688 constant-expression:
9689 conditional-expression
9691 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9692 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9693 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9694 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9695 only parse a conditional-expression, otherwise parse an
9696 assignment-expression. See below for rationale. */
9698 static cp_expr
9703 {
9707 cp_expr expression;
9709 /* It might seem that we could simply parse the
9710 conditional-expression, and then check to see if it were
9711 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9712 one that the compiler can figure out is constant, possibly after
9713 doing some simplifications or optimizations. The standard has a
9714 precise definition of constant-expression, and we must honor
9715 that, even though it is somewhat more restrictive.
9717 For example:
9719 int i[(2, 3)];
9721 is not a legal declaration, because `(2, 3)' is not a
9722 constant-expression. The `,' operator is forbidden in a
9723 constant-expression. However, GCC's constant-folding machinery
9724 will fold this operation to an INTEGER_CST for `3'. */
9726 /* Save the old settings. */
9728 saved_allow_non_integral_constant_expression_p
9731 /* We are now parsing a constant-expression. */
9733 parser->allow_non_integral_constant_expression_p
9736 /* Although the grammar says "conditional-expression", when not STRICT_P,
9737 we parse an "assignment-expression", which also permits
9738 "throw-expression" and the use of assignment operators. In the case
9739 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9740 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9741 actually essential that we look for an assignment-expression.
9742 For example, cp_parser_initializer_clauses uses this function to
9743 determine whether a particular assignment-expression is in fact
9744 constant. */
9746 {
9747 /* Parse the binary expressions (logical-or-expression). */
9750 /* If the next token is a `?' then we're actually looking at
9751 a conditional-expression; otherwise we're done. */
9754 }
9755 else
9757 /* Restore the old settings. */
9758 parser->integral_constant_expression_p
9760 parser->allow_non_integral_constant_expression_p
9763 {
9764 /* Require an rvalue constant expression here; that's what our
9765 callers expect. Reference constant expressions are handled
9766 separately in e.g. cp_parser_template_argument. */
9775 }
9778 parser->non_integral_constant_expression_p
9782 }
9784 /* Parse __builtin_offsetof.
9786 offsetof-expression:
9787 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9789 offsetof-member-designator:
9790 id-expression
9791 | offsetof-member-designator "." id-expression
9792 | offsetof-member-designator "[" expression "]"
9793 | offsetof-member-designator "->" id-expression */
9795 static cp_expr
9797 {
9799 tree type;
9800 cp_expr expr;
9801 cp_id_kind dummy;
9803 location_t finish_loc;
9805 /* We're about to accept non-integral-constant things, but will
9806 definitely yield an integral constant expression. Save and
9807 restore these values around our local parsing. */
9813 /* Consume the "__builtin_offsetof" token. */
9815 /* Consume the opening `('. */
9816 matching_parens parens;
9818 /* Parse the type-id. */
9820 {
9822 parser->type_definition_forbidden_message
9826 }
9827 /* Look for the `,'. */
9831 /* Build the (type *)null that begins the traditional offsetof macro. */
9832 tree object_ptr
9834 tf_warning_or_error);
9836 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9840 {
9843 {
9845 /* offsetof-member-designator "[" expression "]" */
9851 /* offsetof-member-designator "->" identifier */
9854 /* FALLTHRU */
9857 /* offsetof-member-designator "." identifier */
9865 /* Consume the ")" token. */
9871 /* Error. We know the following require will fail, but
9872 that gives the proper error message. */
9877 }
9878 }
9880 success:
9881 /* Make a location of the form:
9882 __builtin_offsetof (struct s, f)
9883 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9884 with caret at the type-id, ranging from the start of the
9885 "_builtin_offsetof" token to the close paren. */
9887 /* The result will be an INTEGER_CST, so we need to explicitly
9888 preserve the location. */
9891 failure:
9897 }
9899 /* Parse a trait expression.
9901 Returns a representation of the expression, the underlying type
9902 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9904 static cp_expr
9906 {
9907 cp_trait_kind kind;
9913 {
10015 }
10017 /* Get location of initial token. */
10020 /* Consume the token. */
10023 matching_parens parens;
10026 {
10029 }
10035 {
10038 {
10041 }
10045 }
10047 {
10049 {
10053 {
10056 }
10060 }
10061 }
10066 /* Construct a location of the form:
10067 __is_trivially_copyable(_Tp)
10068 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10069 with start == caret, finishing at the close-paren. */
10072 /* Complete the trait expression, which may mean either processing
10073 the trait expr now or saving it for template instantiation. */
10075 {
10084 }
10085 }
10087 /* Parse a lambda expression.
10089 lambda-expression:
10090 lambda-introducer lambda-declarator [opt] compound-statement
10092 Returns a representation of the expression. */
10094 static cp_expr
10096 {
10098 tree type;
10106 {
10108 {
10112 }
10114 }
10116 {
10118 {
10121 }
10123 }
10125 /* We may be in the middle of deferred access check. Disable
10126 it now. */
10137 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10140 /* Now that we've started the type, add the capture fields for any
10141 explicit captures. */
10144 {
10145 /* Inside the class, surrounding template-parameter-lists do not apply. */
10146 unsigned int saved_num_template_parameter_lists
10150 bool fully_implicit_function_template_p
10154 bool auto_is_implicit_function_template_parm_p
10165 /* By virtue of defining a local class, a lambda expression has access to
10166 the private variables of enclosing classes. */
10174 {
10179 }
10181 {
10184 }
10186 /* The capture list was built up in reverse order; fix that now. */
10198 parser->fully_implicit_function_template_p
10202 parser->auto_is_implicit_function_template_parm_p
10204 }
10206 /* This field is only used during parsing of the lambda. */
10209 /* This lambda shouldn't have any proxies left at this point. */
10211 /* And now that we're done, push proxies for an enclosing lambda. */
10216 else
10224 }
10226 /* Parse the beginning of a lambda expression.
10228 lambda-introducer:
10229 [ lambda-capture [opt] ]
10231 LAMBDA_EXPR is the current representation of the lambda expression. */
10233 static void
10235 {
10236 /* Need commas after the first capture. */
10239 /* Eat the leading `['. */
10242 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10250 {
10253 }
10256 {
10258 tree capture_id;
10259 tree capture_init_expr;
10263 enum capture_kind_type
10264 {
10265 BY_COPY,
10266 BY_REFERENCE
10267 };
10271 {
10274 }
10278 else
10281 /* Possibly capture `this'. */
10283 {
10294 explicit_init_p);
10296 }
10298 /* Possibly capture `*this'. */
10301 {
10312 explicit_init_p);
10314 }
10316 /* Remember whether we want to capture as a reference or not. */
10318 {
10321 }
10323 /* Get the identifier. */
10328 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10329 delimiters, but I modified this to stop on unnested ']' as well. It
10330 was already changed to stop on unnested '}', so the
10331 "closing_parenthesis" name is no more misleading with my change. */
10332 {
10338 }
10340 /* Find the initializer for this capture. */
10344 {
10346 /* An explicit initializer exists. */
10349 "lambda capture initializers "
10355 {
10358 }
10359 }
10360 else
10361 {
10364 /* Turn the identifier into an id-expression. */
10365 capture_init_expr
10370 {
10373 }
10376 {
10379 capture_init_expr);
10384 }
10387 {
10390 capture_init_expr))
10394 }
10396 capture_init_expr
10397 = finish_id_expression
10399 capture_init_expr,
10413 {
10416 }
10417 }
10421 {
10426 capture_id);
10430 "capture of %qD redundant with by-reference capture "
10432 }
10435 capture_id,
10436 capture_init_expr,
10438 explicit_init_p);
10440 /* If there is any qualification still in effect, clear it
10441 now; we will be starting fresh with the next capture. */
10445 }
10448 }
10450 /* Parse the (optional) middle of a lambda expression.
10452 lambda-declarator:
10453 < template-parameter-list [opt] >
10454 ( parameter-declaration-clause [opt] )
10455 attribute-specifier [opt]
10456 decl-specifier-seq [opt]
10457 exception-specification [opt]
10458 lambda-return-type-clause [opt]
10460 LAMBDA_EXPR is the current representation of the lambda expression. */
10462 static bool
10464 {
10465 /* 5.1.1.4 of the standard says:
10466 If a lambda-expression does not include a lambda-declarator, it is as if
10467 the lambda-declarator were ().
10468 This means an empty parameter list, no attributes, and no exception
10469 specification. */
10476 cp_decl_specifier_seq lambda_specs;
10479 /* The template-parameter-list is optional, but must begin with
10480 an opening angle if present. */
10482 {
10485 "lambda templates are only available with "
10489 "lambda templates are only available with "
10498 /* We just processed one more parameter list. */
10500 }
10502 /* The parameter-declaration-clause is optional (unless
10503 template-parameter-list was given), but must begin with an
10504 opening parenthesis if present. */
10506 {
10507 matching_parens parens;
10512 /* Parse parameters. */
10515 /* Default arguments shall not be specified in the
10516 parameter-declaration-clause of a lambda-declarator. */
10527 /* In the decl-specifier-seq of the lambda-declarator, each
10528 decl-specifier shall either be mutable or constexpr. */
10532 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10535 {
10540 }
10544 /* Parse optional exception specification. */
10547 /* Parse optional trailing return type. */
10549 {
10552 }
10554 /* The function parameters must be in scope all the way until after the
10555 trailing-return-type in case of decltype. */
10557 }
10561 /* Create the function call operator.
10563 Messing with declarators like this is no uglier than building up the
10564 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10565 other code. */
10566 {
10567 cp_decl_specifier_seq return_type_specs;
10569 tree fco;
10577 {
10581 else
10584 }
10593 VIRT_SPEC_UNSPECIFIED,
10594 REF_QUAL_NONE,
10595 tx_qual,
10596 exception_spec,
10604 declarator,
10605 attributes);
10607 {
10610 /* Give the object parameter a different name. */
10612 }
10614 {
10618 }
10627 }
10628 }
10630 /* Parse the body of a lambda expression, which is simply
10632 compound-statement
10634 but which requires special handling.
10635 LAMBDA_EXPR is the current representation of the lambda expression. */
10637 static void
10639 {
10646 else
10647 /* Still increment function_depth so that we don't GC in the
10648 middle of an expression. */
10653 /* Clear this in case we're in the middle of a default argument. */
10657 {
10661 matching_braces braces;
10664 {
10667 /* Originally C++11 required us to peek for 'return expr'; and
10668 process it specially here to deduce the return type. N3638
10669 removed the need for that. */
10677 }
10680 }
10687 else
10689 }
10691 /* Statements [gram.stmt.stmt] */
10693 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10695 static void
10697 {
10701 /* A concept is never expanded normally. */
10707 }
10709 /* Parse a statement.
10711 statement:
10712 labeled-statement
10713 expression-statement
10714 compound-statement
10715 selection-statement
10716 iteration-statement
10717 jump-statement
10718 declaration-statement
10719 try-block
10721 C++11:
10723 statement:
10724 labeled-statement
10725 attribute-specifier-seq (opt) expression-statement
10726 attribute-specifier-seq (opt) compound-statement
10727 attribute-specifier-seq (opt) selection-statement
10728 attribute-specifier-seq (opt) iteration-statement
10729 attribute-specifier-seq (opt) jump-statement
10730 declaration-statement
10731 attribute-specifier-seq (opt) try-block
10733 init-statement:
10734 expression-statement
10735 simple-declaration
10737 TM Extension:
10739 statement:
10740 atomic-statement
10742 IN_COMPOUND is true when the statement is nested inside a
10743 cp_parser_compound_statement; this matters for certain pragmas.
10745 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10746 is a (possibly labeled) if statement which is not enclosed in braces
10747 and has an else clause. This is used to implement -Wparentheses.
10749 CHAIN is a vector of if-else-if conditions. */
10751 static void
10755 {
10760 restart:
10763 /* There is no statement yet. */
10769 /* In obj-c++, seeing '[[' might be the either the beginning of
10770 c++11 attributes, or a nested objc-message-expression. So
10771 let's parse the c++11 attributes tentatively. */
10775 {
10778 }
10780 /* Peek at the next token. */
10782 /* Remember the location of the first token in the statement. */
10785 /* If this is a keyword, then that will often determine what kind of
10786 statement we have. */
10788 {
10792 {
10795 /* Looks like a labeled-statement with a case label.
10796 Parse the label, and then use tail recursion to parse
10797 the statement. */
10820 /* Objective-C++ exception-handling constructs. */
10834 /* This must be a namespace alias definition. */
10850 /* It might be a keyword like `int' that can start a
10851 declaration-statement. */
10853 }
10854 }
10856 {
10857 /* If the next token is a `:', then we are looking at a
10858 labeled-statement. */
10861 {
10862 /* Looks like a labeled-statement with an ordinary label.
10863 Parse the label, and then use tail recursion to parse
10864 the statement. */
10869 }
10870 }
10871 /* Anything that starts with a `{' must be a compound-statement. */
10874 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10875 a statement all its own. */
10877 {
10878 /* Only certain OpenMP pragmas are attached to statements, and thus
10879 are considered statements themselves. All others are not. In
10880 the context of a compound, accept the pragma as a "statement" and
10881 return so that we can check for a close brace. Otherwise we
10882 require a real statement and must go back and read one. */
10888 }
10890 {
10893 }
10895 /* Everything else must be a declaration-statement or an
10896 expression-statement. Try for the declaration-statement
10897 first, unless we are looking at a `;', in which case we know that
10898 we have an expression-statement. */
10900 {
10902 {
10904 {
10905 /* Attributes should be parsed as part of the the
10906 declaration, so let's un-parse them. */
10909 }
10912 /* Try to parse the declaration-statement. */
10914 /* If that worked, we're done. */
10917 }
10918 /* All preceding labels have been parsed at this point. */
10922 /* Look for an expression-statement instead. */
10925 /* Handle [[fallthrough]];. */
10927 {
10928 /* The next token after the fallthrough attribute is ';'. */
10930 {
10931 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10933 IFN_FALLTHROUGH,
10936 }
10937 else
10941 }
10942 }
10944 /* Set the line number for the statement. */
10948 /* Allow "[[fallthrough]];", but warn otherwise. */
10951 OPT_Wattributes,
10953 }
10955 /* Append ATTR to attribute list ATTRS. */
10957 static tree
10959 {
10965 }
10967 /* Parse the label for a labeled-statement, i.e.
10969 identifier :
10970 case constant-expression :
10971 default :
10973 GNU Extension:
10974 case constant-expression ... constant-expression : statement
10976 When a label is parsed without errors, the label is added to the
10977 parse tree by the finish_* functions, so this function doesn't
10978 have to return the label. */
10980 static void
10982 {
10987 /* The next token should be an identifier. */
10991 {
10994 }
10996 /* Remember whether this case or a user-defined label is allowed to fall
10997 through to. */
11002 {
11004 {
11008 /* Consume the `case' token. */
11010 /* Parse the constant-expression. */
11017 {
11018 /* Consume the `...' token. */
11024 /* We don't need to emit warnings here, as the common code
11025 will do this for us. */
11026 }
11027 else
11031 {
11035 }
11036 else
11039 expr);
11040 }
11044 /* Consume the `default' token. */
11048 {
11052 }
11053 else
11058 /* Anything else must be an ordinary label. */
11063 }
11065 /* Require the `:' token. */
11068 /* An ordinary label may optionally be followed by attributes.
11069 However, this is only permitted if the attributes are then
11070 followed by a semicolon. This is because, for backward
11071 compatibility, when parsing
11072 lab: __attribute__ ((unused)) int i;
11073 we want the attribute to attach to "i", not "lab". */
11076 {
11077 tree attrs;
11084 ;
11085 else
11087 }
11093 }
11095 /* Parse an expression-statement.
11097 expression-statement:
11098 expression [opt] ;
11100 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11101 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11102 indicates whether this expression-statement is part of an
11103 expression statement. */
11105 static tree
11107 {
11112 /* There might be attribute fallthrough. */
11115 /* If the next token is a ';', then there is no expression
11116 statement. */
11118 {
11122 {
11125 }
11126 }
11128 /* Handle [[fallthrough]];. */
11130 {
11131 /* The next token after the fallthrough attribute is ';'. */
11133 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11136 else
11140 }
11142 /* Allow "[[fallthrough]];", but warn otherwise. */
11147 /* Give a helpful message for "A<T>::type t;" and the like. */
11150 {
11157 {
11158 /* A::A a; */
11163 }
11164 }
11166 /* Consume the final `;'. */
11171 /* This is the final expression statement of a statement
11172 expression. */
11178 }
11180 /* Parse a compound-statement.
11182 compound-statement:
11183 { statement-seq [opt] }
11185 GNU extension:
11187 compound-statement:
11188 { label-declaration-seq [opt] statement-seq [opt] }
11190 label-declaration-seq:
11191 label-declaration
11192 label-declaration-seq label-declaration
11194 Returns a tree representing the statement. */
11196 static tree
11199 {
11200 tree compound_stmt;
11201 matching_braces braces;
11203 /* Consume the `{'. */
11210 /* Begin the compound-statement. */
11212 /* If the next keyword is `__label__' we have a label declaration. */
11215 /* Parse an (optional) statement-seq. */
11217 /* Finish the compound-statement. */
11219 /* Consume the `}'. */
11223 }
11225 /* Parse an (optional) statement-seq.
11227 statement-seq:
11228 statement
11229 statement-seq [opt] statement */
11231 static void
11233 {
11234 /* Scan statements until there aren't any more. */
11236 {
11239 /* If we are looking at a `}', then we have run out of
11240 statements; the same is true if we have reached the end
11241 of file, or have stumbled upon a stray '@end'. */
11248 /* If we are in a compound statement and find 'else' then
11249 something went wrong. */
11251 {
11254 else
11255 {
11258 }
11259 }
11261 /* Parse the statement. */
11263 }
11264 }
11266 /* Return true if this is the C++20 version of range-based-for with
11267 init-statement. */
11269 static bool
11271 {
11274 /* Save tokens so that we can put them back. */
11277 /* There has to be an unnested ; followed by an unnested :. */
11280 CPP_SEMICOLON,
11284 /* We found the semicolon, eat it now. */
11287 /* Now look for ':' that is not nested in () or {}. */
11290 CPP_COLON,
11293 out:
11294 /* Roll back the tokens we skipped. */
11298 }
11300 /* Return true if we're looking at (init; cond), false otherwise. */
11302 static bool
11304 {
11305 /* Save tokens so that we can put them back. */
11308 /* Look for ';' that is not nested in () or {}. */
11311 CPP_SEMICOLON,
11314 /* Roll back the tokens we skipped. */
11318 }
11320 /* Parse a selection-statement.
11322 selection-statement:
11323 if ( init-statement [opt] condition ) statement
11324 if ( init-statement [opt] condition ) statement else statement
11325 switch ( init-statement [opt] condition ) statement
11327 Returns the new IF_STMT or SWITCH_STMT.
11329 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11330 is a (possibly labeled) if statement which is not enclosed in
11331 braces and has an else clause. This is used to implement
11332 -Wparentheses.
11334 CHAIN is a vector of if-else-if conditions. This is used to implement
11335 -Wduplicated-cond. */
11337 static tree
11340 {
11343 token_indent_info guard_tinfo;
11348 /* Peek at the next token. */
11352 /* See what kind of keyword it is. */
11355 {
11358 {
11359 tree statement;
11360 tree condition;
11365 RID_CONSTEXPR))
11366 {
11372 }
11374 /* Look for the `('. */
11375 matching_parens parens;
11377 {
11380 }
11382 /* Begin the selection-statement. */
11384 {
11387 }
11388 else
11391 /* Parse the optional init-statement. */
11393 {
11394 tree decl;
11397 "init-statement in selection statements only available "
11400 }
11402 /* Parse the condition. */
11404 /* Look for the `)'. */
11410 {
11414 /* Add the condition. */
11421 /* Parse the then-clause. */
11425 /* Outside a template, the non-selected branch of a constexpr
11426 if is a 'discarded statement', i.e. unevaluated. */
11431 {
11434 }
11437 guard_tinfo);
11444 {
11448 }
11450 /* If the next token is `else', parse the else-clause. */
11452 RID_ELSE))
11453 {
11457 {
11460 }
11462 guard_tinfo
11464 /* Consume the `else' keyword. */
11467 {
11469 RID_IF)
11471 {
11472 /* We've got "if (COND) else if (COND2)". Start
11473 the condition chain and add COND as the first
11474 element. */
11478 {
11479 /* Wrap it in a NOP_EXPR so that we can set the
11480 location of the condition. */
11482 condition);
11485 }
11486 }
11488 RID_IF))
11489 {
11490 /* This is if-else without subsequent if. Zap the
11491 condition chain; we would have already warned at
11492 this point. */
11495 }
11496 }
11498 /* Parse the else-clause. */
11504 /* If we are currently parsing a then-clause, then
11505 IF_P will not be NULL. We set it to true to
11506 indicate that this if statement has an else clause.
11507 This may trigger the Wparentheses warning below
11508 when we get back up to the parent if statement. */
11513 {
11517 }
11518 }
11519 else
11520 {
11521 /* This if statement does not have an else clause. If
11522 NESTED_IF is true, then the then-clause has an if
11523 statement which does have an else clause. We warn
11524 about the potential ambiguity. */
11527 "suggest explicit braces to avoid ambiguous"
11530 {
11531 /* We don't need the condition chain anymore. */
11534 }
11535 }
11537 /* Now we're all done with the if-statement. */
11539 }
11540 else
11541 {
11545 /* Add the condition. */
11548 /* Parse the body of the switch-statement. */
11554 guard_tinfo);
11558 /* Now we're all done with the switch-statement. */
11560 }
11563 }
11569 }
11570 }
11572 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11573 If we have seen at least one decl-specifier, and the next token
11574 is not a parenthesis, then we must be looking at a declaration.
11575 (After "int (" we might be looking at a functional cast.) */
11577 static void
11580 {
11586 }
11588 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11589 The declarator shall not specify a function or an array. Returns
11590 TRUE if the declarator is valid, FALSE otherwise. */
11592 static bool
11595 location_t loc)
11596 {
11599 {
11602 else
11610 }
11611 else
11613 }
11615 /* Parse a condition.
11617 condition:
11618 expression
11619 type-specifier-seq declarator = initializer-clause
11620 type-specifier-seq declarator braced-init-list
11622 GNU Extension:
11624 condition:
11625 type-specifier-seq declarator asm-specification [opt]
11626 attributes [opt] = assignment-expression
11628 Returns the expression that should be tested. */
11630 static tree
11632 {
11633 cp_decl_specifier_seq type_specifiers;
11637 /* Try the declaration first. */
11639 /* New types are not allowed in the type-specifier-seq for a
11640 condition. */
11642 parser->type_definition_forbidden_message
11644 /* Parse the type-specifier-seq. */
11646 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11649 /* Restore the saved message. */
11655 /* If all is well, we might be looking at a declaration. */
11657 {
11658 tree decl;
11659 tree asm_specification;
11660 tree attributes;
11665 /* Parse the declarator. */
11671 /* Parse the attributes. */
11673 /* Parse the asm-specification. */
11675 /* If the next token is not an `=' or '{', then we might still be
11676 looking at an expression. For example:
11678 if (A(a).x)
11680 looks like a decl-specifier-seq and a declarator -- but then
11681 there is no `=', so this is an expression. */
11686 /* If we did see an `=' or '{', then we are looking at a declaration
11687 for sure. */
11689 {
11690 tree pushed_scope;
11697 /* Create the declaration. */
11703 /* Parse the initializer. */
11705 {
11709 }
11711 {
11712 /* Consume the `='. */
11716 }
11717 else
11718 {
11721 }
11725 /* Process the initializer. */
11728 asm_specification,
11729 flags);
11735 }
11736 }
11737 /* If we didn't even get past the declarator successfully, we are
11738 definitely not looking at a declaration. */
11739 else
11742 /* Otherwise, we are looking at an expression. */
11744 }
11746 /* Parses a for-statement or range-for-statement until the closing ')',
11747 not included. */
11749 static tree
11751 {
11755 /* Begin the for-statement. */
11758 /* Parse the initialization. */
11763 else
11765 }
11767 static tree
11770 {
11771 /* Normal for loop */
11774 tree stmt;
11777 /* The init-statement has already been parsed in
11778 cp_parser_init_statement, so no work is needed here. */
11781 /* If there's a condition, process it. */
11785 {
11789 }
11791 {
11795 }
11797 /* Look for the `;'. */
11800 /* If there's an expression, process it. */
11806 }
11808 /* Tries to parse a range-based for-statement:
11810 range-based-for:
11811 decl-specifier-seq declarator : expression
11813 The decl-specifier-seq declarator and the `:' are already parsed by
11814 cp_parser_init_statement. If processing_template_decl it returns a
11815 newly created RANGE_FOR_STMT; if not, it is converted to a
11816 regular FOR_STMT. */
11818 static tree
11821 {
11828 /* Get the range declaration momentarily out of the way so that
11829 the range expression doesn't clash with it. */
11831 {
11833 {
11835 /* For decomposition declaration get all of the corresponding
11836 declarations out of the way. */
11840 {
11846 {
11852 }
11853 }
11854 }
11856 {
11861 }
11862 }
11865 {
11868 }
11869 else
11872 /* Put the range declaration(s) back into scope. */
11874 {
11878 }
11880 /* If in template, STMT is converted to a normal for-statement
11881 at instantiation. If not, it is done just ahead. */
11883 {
11893 /* do_auto_deduction doesn't mess with template init-lists. */
11896 }
11897 else
11898 {
11902 unroll);
11903 }
11905 }
11907 /* Subroutine of cp_convert_range_for: given the initializer expression,
11908 builds up the range temporary. */
11910 static tree
11912 {
11915 /* Find out the type deduced by the declaration
11916 `auto &&__range = range_expr'. */
11921 /* Create the __range variable. */
11928 }
11930 /* Used by cp_parser_range_for in template context: we aren't going to
11931 do a full conversion yet, but we still need to resolve auto in the
11932 type of the for-range-declaration if present. This is basically
11933 a shortcut version of cp_convert_range_for. */
11935 static void
11937 {
11940 {
11943 iter_type = (cp_parser_perform_range_for_lookup
11946 {
11948 iter_type);
11950 RO_UNARY_STAR,
11951 tf_warning_or_error);
11954 }
11955 }
11956 }
11958 /* Converts a range-based for-statement into a normal
11959 for-statement, as per the definition.
11961 for (RANGE_DECL : RANGE_EXPR)
11962 BLOCK
11964 should be equivalent to:
11966 {
11967 auto &&__range = RANGE_EXPR;
11968 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11969 __begin != __end;
11970 ++__begin)
11971 {
11972 RANGE_DECL = *__begin;
11973 BLOCK
11974 }
11975 }
11977 If RANGE_EXPR is an array:
11978 BEGIN_EXPR = __range
11979 END_EXPR = __range + ARRAY_SIZE(__range)
11980 Else if RANGE_EXPR has a member 'begin' or 'end':
11981 BEGIN_EXPR = __range.begin()
11982 END_EXPR = __range.end()
11983 Else:
11984 BEGIN_EXPR = begin(__range)
11985 END_EXPR = end(__range);
11987 If __range has a member 'begin' but not 'end', or vice versa, we must
11988 still use the second alternative (it will surely fail, however).
11989 When calling begin()/end() in the third alternative we must use
11990 argument dependent lookup, but always considering 'std' as an associated
11991 namespace. */
11993 tree
11997 {
12005 /* If an error happened previously do nothing or else a lot of
12006 unhelpful errors would be issued. */
12008 else
12009 {
12010 tree range_temp;
12014 /* Can't bind a reference to an array of runtime bound. */
12016 else
12017 {
12022 LOOKUP_ONLYCONVERTING);
12024 }
12027 }
12029 /* The new for initialization statement. */
12037 LOOKUP_ONLYCONVERTING);
12048 LOOKUP_ONLYCONVERTING);
12052 /* The new for condition. */
12059 /* The new increment expression. */
12062 tf_warning_or_error);
12068 /* The declaration is initialized with *__begin inside the loop body. */
12071 tf_warning_or_error),
12073 LOOKUP_ONLYCONVERTING);
12078 }
12080 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12081 We need to solve both at the same time because the method used
12082 depends on the existence of members begin or end.
12083 Returns the type deduced for the iterator expression. */
12085 static tree
12087 {
12089 {
12092 }
12095 {
12100 }
12102 {
12103 /* If RANGE is an array, we will use pointer arithmetic. */
12106 range,
12110 }
12111 else
12112 {
12113 /* If it is not an array, we must do a bit of magic. */
12123 tf_warning_or_error);
12126 tf_warning_or_error);
12129 {
12130 /* Use the member functions. */
12133 }
12134 else
12135 {
12136 /* Use global functions with ADL. */
12143 tf_warning_or_error);
12145 tf_warning_or_error);
12147 tf_warning_or_error);
12149 tf_warning_or_error);
12152 }
12154 /* Last common checks. */
12156 {
12157 /* If one of the expressions is an error do no more checks. */
12160 }
12163 /* Can happen, when, eg, in a template context, Koenig lookup
12164 can't resolve begin/end (c++/58503). */
12166 else
12167 {
12169 /* The unqualified type of the __begin and __end temporaries should
12170 be the same, as required by the multiple auto declaration. */
12172 {
12179 /* P0184R0 allows __begin and __end to have different types,
12180 but make sure they are comparable so we can give a better
12182 else
12186 }
12188 }
12189 }
12190 }
12192 /* Helper function for cp_parser_perform_range_for_lookup.
12193 Builds a tree for RANGE.IDENTIFIER(). */
12195 static tree
12197 {
12210 tf_warning_or_error);
12213 }
12215 /* Parse an iteration-statement.
12217 iteration-statement:
12218 while ( condition ) statement
12219 do statement while ( expression ) ;
12220 for ( init-statement condition [opt] ; expression [opt] )
12221 statement
12223 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12225 static tree
12228 {
12231 tree statement;
12233 token_indent_info guard_tinfo;
12235 /* Peek at the next token. */
12242 /* Remember whether or not we are already within an iteration
12243 statement. */
12246 /* See what kind of keyword it is. */
12249 {
12251 {
12252 tree condition;
12254 /* Begin the while-statement. */
12256 /* Look for the `('. */
12257 matching_parens parens;
12259 /* Parse the condition. */
12262 /* Look for the `)'. */
12264 /* Parse the dependent statement. */
12270 /* We're done with the while-statement. */
12272 }
12276 {
12277 tree expression;
12279 /* Begin the do-statement. */
12281 /* Parse the body of the do-statement. */
12288 /* Look for the `while' keyword. */
12290 /* Look for the `('. */
12291 matching_parens parens;
12293 /* Parse the expression. */
12295 /* We're done with the do-statement. */
12297 /* Look for the `)'. */
12299 /* Look for the `;'. */
12301 }
12305 {
12306 /* Look for the `('. */
12307 matching_parens parens;
12312 /* Look for the `)'. */
12315 /* Parse the body of the for-statement. */
12322 /* We're done with the for-statement. */
12324 }
12331 }
12334 }
12336 /* Parse a init-statement or the declarator of a range-based-for.
12337 Returns true if a range-based-for declaration is seen.
12339 init-statement:
12340 expression-statement
12341 simple-declaration */
12343 static bool
12345 {
12346 /* If the next token is a `;', then we have an empty
12347 expression-statement. Grammatically, this is also a
12348 simple-declaration, but an invalid one, because it does not
12349 declare anything. Therefore, if we did not handle this case
12350 specially, we would issue an error message about an invalid
12351 declaration. */
12353 {
12357 /* Try to parse the init-statement. */
12359 {
12360 tree dummy;
12362 /* Parse the declaration. */
12368 /* That didn't work, try to parse it as an expression-statement. */
12372 {
12374 "range-based %<for%> loops with initializer only "
12377 }
12378 }
12380 /* A colon is used in range-based for. */
12383 /* We're going to speculatively look for a declaration, falling back
12384 to an expression, if necessary. */
12386 /* Parse the declaration. */
12389 decl);
12392 {
12393 /* It is a range-for, consume the ':'. */
12397 {
12399 "range-based %<for%> loops only available with "
12402 }
12403 }
12404 else
12405 /* The ';' is not consumed yet because we told
12406 cp_parser_simple_declaration not to. */
12411 /* If the tentative parse failed, then we shall need to look for an
12412 expression-statement. */
12413 }
12414 /* If we are here, it is an expression-statement. */
12417 }
12419 /* Parse a jump-statement.
12421 jump-statement:
12422 break ;
12423 continue ;
12424 return expression [opt] ;
12425 return braced-init-list ;
12426 goto identifier ;
12428 GNU extension:
12430 jump-statement:
12431 goto * expression ;
12433 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12435 static tree
12437 {
12443 /* Peek at the next token. */
12448 /* See what kind of keyword it is. */
12451 {
12455 {
12472 }
12478 {
12482 /* Fall through. */
12492 }
12497 {
12498 tree expr;
12502 {
12506 }
12509 else
12510 /* If the next token is a `;', then there is no
12511 expression. */
12513 /* Build the return-statement. */
12516 else
12518 /* Look for the final `;'. */
12520 }
12526 {
12529 }
12531 /* Create the goto-statement. */
12533 {
12534 /* Issue a warning about this use of a GNU extension. */
12536 /* Consume the '*' token. */
12538 /* Parse the dependent expression. */
12540 }
12541 else
12543 /* Look for the final `;'. */
12550 }
12553 }
12555 /* Parse a declaration-statement.
12557 declaration-statement:
12558 block-declaration */
12560 static void
12562 {
12565 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12568 /* Parse the block-declaration. */
12571 /* Free any declarators allocated. */
12573 }
12575 /* Some dependent statements (like `if (cond) statement'), are
12576 implicitly in their own scope. In other words, if the statement is
12577 a single statement (as opposed to a compound-statement), it is
12578 none-the-less treated as if it were enclosed in braces. Any
12579 declarations appearing in the dependent statement are out of scope
12580 after control passes that point. This function parses a statement,
12581 but ensures that is in its own scope, even if it is not a
12582 compound-statement.
12584 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12585 is a (possibly labeled) if statement which is not enclosed in
12586 braces and has an else clause. This is used to implement
12587 -Wparentheses.
12589 CHAIN is a vector of if-else-if conditions. This is used to implement
12590 -Wduplicated-cond.
12592 Returns the new statement. */
12594 static tree
12598 {
12599 tree statement;
12602 token_indent_info body_tinfo
12608 /* Mark if () ; with a special NOP_EXPR. */
12610 {
12621 }
12622 /* if a compound is opened, we simply parse the statement directly. */
12625 /* If the token is not a `{', then we must take special action. */
12626 else
12627 {
12628 /* Create a compound-statement. */
12630 /* Parse the dependent-statement. */
12633 /* Finish the dummy compound-statement. */
12635 }
12637 token_indent_info next_tinfo
12646 /* Return the statement. */
12648 }
12650 /* For some dependent statements (like `while (cond) statement'), we
12651 have already created a scope. Therefore, even if the dependent
12652 statement is a compound-statement, we do not want to create another
12653 scope. */
12655 static void
12658 {
12659 /* If the token is a `{', then we must take special action. */
12661 {
12662 token_indent_info body_tinfo
12668 token_indent_info next_tinfo
12677 }
12678 else
12679 {
12680 /* Avoid calling cp_parser_compound_statement, so that we
12681 don't create a new scope. Do everything else by hand. */
12682 matching_braces braces;
12684 /* If the next keyword is `__label__' we have a label declaration. */
12687 /* Parse an (optional) statement-seq. */
12690 }
12691 }
12693 /* Declarations [gram.dcl.dcl] */
12695 /* Parse an optional declaration-sequence.
12697 declaration-seq:
12698 declaration
12699 declaration-seq declaration */
12701 static void
12703 {
12705 {
12716 {
12717 /* A declaration consisting of a single semicolon is
12718 invalid. Allow it unless we're being pedantic. */
12723 }
12725 /* If we're entering or exiting a region that's implicitly
12726 extern "C", modify the lang context appropriately. */
12728 {
12731 }
12733 {
12736 }
12739 {
12740 /* A top-level declaration can consist solely of a #pragma.
12741 A nested declaration cannot, so this is done here and not
12742 in cp_parser_declaration. (A #pragma at block scope is
12743 handled in cp_parser_statement.) */
12746 }
12748 /* Parse the declaration itself. */
12750 }
12751 }
12753 /* Parse a declaration.
12755 declaration:
12756 block-declaration
12757 function-definition
12758 template-declaration
12759 explicit-instantiation
12760 explicit-specialization
12761 linkage-specification
12762 namespace-definition
12764 C++17:
12765 deduction-guide
12767 GNU extension:
12769 declaration:
12770 __extension__ declaration */
12772 static void
12774 {
12775 cp_token token1;
12776 cp_token token2;
12781 /* Check for the `__extension__' keyword. */
12783 {
12784 /* Parse the qualified declaration. */
12786 /* Restore the PEDANTIC flag. */
12790 }
12792 /* Try to figure out what kind of declaration is present. */
12797 else
12798 {
12801 }
12803 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12806 /* If the next token is `extern' and the following token is a string
12807 literal, then we have a linkage specification. */
12811 /* If the next token is `template', then we have either a template
12812 declaration, an explicit instantiation, or an explicit
12813 specialization. */
12815 {
12816 /* `template <>' indicates a template specialization. */
12820 /* `template <' indicates a template declaration. */
12823 /* Anything else must be an explicit instantiation. */
12824 else
12826 }
12827 /* If the next token is `export', then we have a template
12828 declaration. */
12831 /* If the next token is `extern', 'static' or 'inline' and the one
12832 after that is `template', we have a GNU extended explicit
12833 instantiation directive. */
12840 /* If the next token is `namespace', check for a named or unnamed
12841 namespace definition. */
12850 /* An unnamed namespace definition. */
12854 /* An inline (associated) namespace definition. */
12858 /* Objective-C++ declaration/definition. */
12865 /* At this point we may have a template declared by a concept
12866 introduction. */
12871 else
12872 /* Try to parse a block-declaration, or a function-definition. */
12875 /* Free any declarators allocated. */
12877 }
12879 /* Parse a block-declaration.
12881 block-declaration:
12882 simple-declaration
12883 asm-definition
12884 namespace-alias-definition
12885 using-declaration
12886 using-directive
12888 GNU Extension:
12890 block-declaration:
12891 __extension__ block-declaration
12893 C++0x Extension:
12895 block-declaration:
12896 static_assert-declaration
12898 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12899 part of a declaration-statement. */
12901 static void
12904 {
12908 /* Check for the `__extension__' keyword. */
12910 {
12911 /* Parse the qualified declaration. */
12913 /* Restore the PEDANTIC flag. */
12917 }
12919 /* Peek at the next token to figure out which kind of declaration is
12920 present. */
12923 /* If the next keyword is `asm', we have an asm-definition. */
12925 {
12929 }
12930 /* If the next keyword is `namespace', we have a
12931 namespace-alias-definition. */
12934 /* If the next keyword is `using', we have a
12935 using-declaration, a using-directive, or an alias-declaration. */
12937 {
12942 /* If the token after `using' is `namespace', then we have a
12943 using-directive. */
12947 /* If the second token after 'using' is '=', then we have an
12948 alias-declaration. */
12954 /* Otherwise, it's a using-declaration. */
12955 else
12958 }
12959 /* If the next keyword is `__label__' we have a misplaced label
12960 declaration. */
12962 {
12966 /* If the next token is now a `;', consume it. */
12969 }
12970 /* If the next token is `static_assert' we have a static assertion. */
12973 /* Anything else must be a simple-declaration. */
12974 else
12977 }
12979 /* Parse a simple-declaration.
12981 simple-declaration:
12982 decl-specifier-seq [opt] init-declarator-list [opt] ;
12983 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12984 brace-or-equal-initializer ;
12986 init-declarator-list:
12987 init-declarator
12988 init-declarator-list , init-declarator
12990 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12991 function-definition as a simple-declaration.
12993 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12994 parsed declaration if it is an uninitialized single declarator not followed
12995 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12996 if present, will not be consumed. */
12998 static void
13002 {
13003 cp_decl_specifier_seq decl_specifiers;
13012 /* Defer access checks until we know what is being declared; the
13013 checks for names appearing in the decl-specifier-seq should be
13014 done as if we were in the scope of the thing being declared. */
13017 /* Parse the decl-specifier-seq. We have to keep track of whether
13018 or not the decl-specifier-seq declares a named class or
13019 enumeration type, since that is the only case in which the
13020 init-declarator-list is allowed to be empty.
13022 [dcl.dcl]
13024 In a simple-declaration, the optional init-declarator-list can be
13025 omitted only when declaring a class or enumeration, that is when
13026 the decl-specifier-seq contains either a class-specifier, an
13027 elaborated-type-specifier, or an enum-specifier. */
13029 CP_PARSER_FLAGS_OPTIONAL,
13032 /* We no longer need to defer access checks. */
13035 /* In a block scope, a valid declaration must always have a
13036 decl-specifier-seq. By not trying to parse declarators, we can
13037 resolve the declaration/expression ambiguity more quickly. */
13040 {
13043 }
13045 /* If the next two tokens are both identifiers, the code is
13046 erroneous. The usual cause of this situation is code like:
13048 T t;
13050 where "T" should name a type -- but does not. */
13053 {
13054 /* If parsing tentatively, we should commit; we really are
13055 looking at a declaration. */
13057 /* Give up. */
13059 }
13064 /* Look for C++17 decomposition declaration. */
13072 {
13073 tree decl
13075 maybe_range_for_decl,
13078 /* The next token should be either a `,' or a `;'. */
13080 /* If it's a `;', we are done. */
13084 {
13088 }
13089 /* Anything else is an error. */
13090 else
13091 {
13092 /* If we have already issued an error message we don't need
13093 to issue another one. */
13098 /* Skip tokens until we reach the end of the statement. */
13100 /* If the next token is now a `;', consume it. */
13104 }
13105 }
13106 else
13109 tree last_type;
13111 /* NULL_TREE if both variable and function declaration are allowed,
13112 error_mark_node if function declaration are not allowed and
13113 a FUNCTION_DECL that should be diagnosed if it is followed by
13114 variable declarations. */
13115 tree auto_function_declaration;
13118 auto_specifier_p
13122 /* Keep going until we hit the `;' at the end of the simple
13123 declaration. */
13126 CPP_SEMICOLON))
13127 {
13130 tree decl;
13134 {
13135 /* If we are processing next declarator, comma is expected */
13140 {
13144 }
13145 }
13146 else
13149 /* Parse the init-declarator. */
13152 function_definition_allowed_p,
13154 declares_class_or_enum,
13156 maybe_range_for_decl,
13159 /* If an error occurred while parsing tentatively, exit quickly.
13160 (That usually happens when in the body of a function; each
13161 statement is treated as a declaration-statement until proven
13162 otherwise.) */
13167 {
13168 /* If the init-declarator-list contains more than one
13169 init-declarator, they shall all form declarations of
13170 variables. */
13172 auto_function_declaration
13176 {
13178 "non-variable %qD in declaration with more than one "
13183 }
13184 }
13188 {
13192 {
13193 /* If the list of declarators contains more than one declarator,
13194 the type of each declared variable is determined as described
13195 above. If the type deduced for the template parameter U is not
13196 the same in each deduction, the program is ill-formed. */
13201 }
13202 else
13204 }
13206 /* Handle function definitions specially. */
13208 {
13209 /* If the next token is a `,', then we are probably
13210 processing something like:
13212 void f() {}, *p;
13214 which is erroneous. */
13216 {
13219 "mixing"
13221 }
13222 /* Otherwise, we're done with the list of declarators. */
13223 else
13224 {
13227 }
13228 }
13231 /* The next token should be either a `,' or a `;'. */
13233 /* If it's a `,', there are more declarators to come. */
13236 /* If it's a `;', we are done. */
13240 {
13245 }
13246 /* Anything else is an error. */
13247 else
13248 {
13249 /* If we have already issued an error message we don't need
13250 to issue another one. */
13255 /* Skip tokens until we reach the end of the statement. */
13257 /* If the next token is now a `;', consume it. */
13261 }
13262 /* After the first time around, a function-definition is not
13263 allowed -- even if it was OK at first. For example:
13265 int i, f() {}
13267 is not valid. */
13269 }
13271 /* Issue an error message if no declarators are present, and the
13272 decl-specifier-seq does not itself declare a class or
13273 enumeration: [dcl.dcl]/3. */
13275 {
13277 {
13281 /* Ensure an error is issued anyway when finish_decltype_type,
13282 called via cp_parser_decl_specifier_seq, returns a class or
13283 an enumeration (c++/51786). */
13286 }
13287 /* Perform any deferred access checks. */
13289 }
13291 /* Consume the `;'. */
13292 finish:
13296 {
13302 }
13304 done:
13306 }
13308 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13309 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13310 initializer ; */
13312 static tree
13317 {
13322 /* Parse the identifier-list. */
13326 {
13334 }
13338 {
13344 else
13345 {
13348 }
13349 }
13355 tree pushed_scope;
13362 NULL_TREE);
13369 cp_expr e;
13370 cp_decl_specifier_seq decl_specs;
13375 {
13378 else
13381 tree elt_pushed_scope;
13387 {
13388 /* Ensure we've diagnosed redeclaration if we aren't creating
13389 a new VAR_DECL. */
13392 }
13393 else
13397 }
13400 {
13403 }
13407 {
13415 || (is_direct_init
13418 {
13422 }
13425 {
13430 }
13431 }
13433 {
13435 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13436 the underlying DECL. */
13438 }
13444 {
13447 }
13450 }
13452 /* Parse a decl-specifier-seq.
13454 decl-specifier-seq:
13455 decl-specifier-seq [opt] decl-specifier
13456 decl-specifier attribute-specifier-seq [opt] (C++11)
13458 decl-specifier:
13459 storage-class-specifier
13460 type-specifier
13461 function-specifier
13462 friend
13463 typedef
13465 GNU Extension:
13467 decl-specifier:
13468 attributes
13470 Concepts Extension:
13472 decl-specifier:
13473 concept
13475 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13477 The parser flags FLAGS is used to control type-specifier parsing.
13479 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13480 flags:
13482 1: one of the decl-specifiers is an elaborated-type-specifier
13483 (i.e., a type declaration)
13484 2: one of the decl-specifiers is an enum-specifier or a
13485 class-specifier (i.e., a type definition)
13487 */
13489 static void
13491 cp_parser_flags flags,
13494 {
13498 cp_decl_spec ds;
13500 /* Clear DECL_SPECS. */
13503 /* Assume no class or enumeration type is declared. */
13506 /* Keep reading specifiers until there are no more to read. */
13508 {
13513 /* Peek at the next token. */
13516 /* Save the first token of the decl spec list for error
13517 reporting. */
13520 /* Handle attributes. */
13522 {
13523 /* Parse the attributes. */
13526 /* In a sequence of declaration specifiers, c++11 attributes
13527 appertain to the type that precede them. In that case
13528 [dcl.spec]/1 says:
13530 The attribute-specifier-seq affects the type only for
13531 the declaration it appears in, not other declarations
13532 involving the same type.
13534 But for now let's force the user to position the
13535 attribute either at the beginning of the declaration or
13536 after the declarator-id, which would clearly mean that it
13537 applies to the declarator. */
13539 {
13541 /* The c++11 attribute is at the beginning of the
13542 declaration. It appertains to the entity being
13544 else
13545 {
13547 {
13548 /* This is an attribute following a
13549 class-specifier. */
13554 }
13555 else
13556 {
13557 decl_specs->std_attributes
13561 }
13563 }
13564 }
13566 decl_specs->attributes
13571 }
13572 /* Assume we will find a decl-specifier keyword. */
13574 /* If the next token is an appropriate keyword, we can simply
13575 add it to the list. */
13577 {
13578 /* decl-specifier:
13579 friend
13580 constexpr */
13583 {
13588 }
13589 else
13590 {
13592 /* Consume the token. */
13594 }
13607 /* function-specifier:
13608 inline
13609 virtual
13610 explicit */
13617 /* decl-specifier:
13618 typedef */
13621 /* Consume the token. */
13623 /* A constructor declarator cannot appear in a typedef. */
13625 /* The "typedef" keyword can only occur in a declaration; we
13626 may as well commit at this point. */
13633 /* storage-class-specifier:
13634 auto
13635 register
13636 static
13637 extern
13638 mutable
13640 GNU Extension:
13641 thread */
13644 {
13645 /* Consume the token. */
13648 /* Complain about `auto' as a storage specifier, if
13649 we're complaining about C++0x compatibility. */
13653 "%<auto%> changes meaning in C++11; "
13656 /* Set the storage class anyway. */
13658 token);
13659 }
13660 else
13661 /* C++0x auto type-specifier. */
13669 /* Consume the token. */
13672 token);
13675 /* Consume the token. */
13681 /* We did not yet find a decl-specifier yet. */
13684 }
13701 /* Constructors are a special case. The `S' in `S()' is not a
13702 decl-specifier; it is the beginning of the declarator. */
13703 constructor_p
13704 = (!found_decl_spec
13705 && constructor_possible_p
13706 && (cp_parser_constructor_declarator_p
13709 /* If we don't have a DECL_SPEC yet, then we must be looking at
13710 a type-specifier. */
13712 {
13715 tree type_spec;
13717 type_spec
13719 decl_specs,
13725 /* If this type-specifier referenced a user-defined type
13726 (a typedef, class-name, etc.), then we can't allow any
13727 more such type-specifiers henceforth.
13729 [dcl.spec]
13731 The longest sequence of decl-specifiers that could
13732 possibly be a type name is taken as the
13733 decl-specifier-seq of a declaration. The sequence shall
13734 be self-consistent as described below.
13736 [dcl.type]
13738 As a general rule, at most one type-specifier is allowed
13739 in the complete decl-specifier-seq of a declaration. The
13740 only exceptions are the following:
13742 -- const or volatile can be combined with any other
13743 type-specifier.
13745 -- signed or unsigned can be combined with char, long,
13746 short, or int.
13748 -- ..
13750 Example:
13752 typedef char* Pc;
13753 void g (const int Pc);
13755 Here, Pc is *not* part of the decl-specifier seq; it's
13756 the declarator. Therefore, once we see a type-specifier
13757 (other than a cv-qualifier), we forbid any additional
13758 user-defined types. We *do* still allow things like `int
13759 int' to be considered a decl-specifier-seq, and issue the
13760 error message later. */
13763 /* A constructor declarator cannot follow a type-specifier. */
13765 {
13770 }
13771 }
13773 /* If we still do not have a DECL_SPEC, then there are no more
13774 decl-specifiers. */
13779 /* After we see one decl-specifier, further decl-specifiers are
13780 always optional. */
13782 }
13784 /* Don't allow a friend specifier with a class definition. */
13789 }
13791 /* Parse an (optional) storage-class-specifier.
13793 storage-class-specifier:
13794 auto
13795 register
13796 static
13797 extern
13798 mutable
13800 GNU Extension:
13802 storage-class-specifier:
13803 thread
13805 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13807 static tree
13809 {
13811 {
13815 /* Fall through for C++98. */
13823 /* Consume the token. */
13828 }
13829 }
13831 /* Parse an (optional) function-specifier.
13833 function-specifier:
13834 inline
13835 virtual
13836 explicit
13838 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13839 Updates DECL_SPECS, if it is non-NULL. */
13841 static tree
13844 {
13847 {
13853 /* 14.5.2.3 [temp.mem]
13855 A member function template shall not be virtual. */
13859 else
13869 }
13871 /* Consume the token. */
13873 }
13875 /* Parse a linkage-specification.
13877 linkage-specification:
13878 extern string-literal { declaration-seq [opt] }
13879 extern string-literal declaration */
13881 static void
13883 {
13884 tree linkage;
13886 /* Look for the `extern' keyword. */
13887 cp_token *extern_token
13890 /* Look for the string-literal. */
13894 /* Transform the literal into an identifier. If the literal is a
13895 wide-character string, or contains embedded NULs, then we can't
13896 handle it as the user wants. */
13899 {
13901 /* Assume C++ linkage. */
13903 }
13904 else
13907 /* We're now using the new linkage. */
13910 /* Preserve the location of the the innermost linkage specification,
13911 tracking the locations of nested specifications via a local. */
13912 location_t saved_location
13914 /* Construct a location ranging from the start of the "extern" to
13915 the end of the string-literal, with the caret at the start, e.g.:
13916 extern "C" {
13917 ^~~~~~~~~~
13918 */
13919 parser->innermost_linkage_specification_location
13924 /* If the next token is a `{', then we're using the first
13925 production. */
13927 {
13931 /* Consume the `{' token. */
13932 matching_braces braces;
13934 /* Parse the declarations. */
13936 /* Look for the closing `}'. */
13938 }
13939 /* Otherwise, there's just one declaration. */
13940 else
13941 {
13944 saved_in_unbraced_linkage_specification_p
13948 parser->in_unbraced_linkage_specification_p
13950 }
13952 /* We're done with the linkage-specification. */
13955 /* Restore location of parent linkage specification, if any. */
13957 }
13959 /* Parse a static_assert-declaration.
13961 static_assert-declaration:
13962 static_assert ( constant-expression , string-literal ) ;
13963 static_assert ( constant-expression ) ; (C++17)
13965 If MEMBER_P, this static_assert is a class member. */
13967 static void
13969 {
13970 cp_expr condition;
13971 location_t token_loc;
13972 tree message;
13975 /* Peek at the `static_assert' token so we can keep track of exactly
13976 where the static assertion started. */
13979 /* Look for the `static_assert' keyword. */
13981 RT_STATIC_ASSERT))
13984 /* We know we are in a static assertion; commit to any tentative
13985 parse. */
13989 /* Parse the `(' starting the static assertion condition. */
13990 matching_parens parens;
13993 /* Parse the constant-expression. Allow a non-constant expression
13994 here in order to give better diagnostics in finish_static_assert. */
13995 condition =
14001 {
14004 "static_assert without a message "
14006 /* Eat the ')' */
14011 }
14012 else
14013 {
14014 /* Parse the separating `,'. */
14017 /* Parse the string-literal message. */
14022 /* A `)' completes the static assertion. */
14028 }
14030 /* A semicolon terminates the declaration. */
14033 /* Get the location for the static assertion. Use that of the
14034 condition if available, otherwise, use that of the "static_assert"
14035 token. */
14040 /* Complete the static assertion, which may mean either processing
14041 the static assert now or saving it for template instantiation. */
14043 }
14045 /* Parse the expression in decltype ( expression ). */
14047 static tree
14050 {
14052 tree expr;
14054 /* Since we're going to preserve any side-effects from this parse, set up a
14055 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14056 in the expression. */
14059 /* First, try parsing an id-expression. */
14070 {
14073 cp_id_kind idk;
14077 /* Lookup the name we got back from the id-expression. */
14082 /* A template without args is not a complete id-expression. */
14091 {
14092 /* Complete lookup of the id-expression. */
14093 expr = (finish_id_expression
14106 /* We found an id-expression, but it was something that we
14107 should not have found. This is an error, not something
14108 we can recover from, so note that we found an
14109 id-expression and we'll recover as gracefully as
14110 possible. */
14112 }
14117 /* We have an id-expression. */
14119 }
14122 {
14123 /* Abort the id-expression parse. */
14126 /* Parsing tentatively, again. */
14129 /* Parse a class member access. */
14137 /* We have an id-expression. */
14139 }
14142 /* We have parsed the complete id-expression or member access. */
14144 else
14145 {
14146 /* Abort our attempt to parse an id-expression or member access
14147 expression. */
14150 /* Commit to the tentative_firewall so we get syntax errors. */
14153 /* Parse a full expression. */
14156 }
14159 }
14161 /* Parse a `decltype' type. Returns the type.
14163 simple-type-specifier:
14164 decltype ( expression )
14165 C++14 proposal:
14166 decltype ( auto ) */
14168 static tree
14170 {
14175 {
14176 /* Already parsed. */
14179 }
14181 /* Look for the `decltype' token. */
14185 /* Parse the opening `('. */
14186 matching_parens parens;
14196 /* decltype (auto) */
14198 else
14199 {
14200 /* decltype (expression) */
14202 /* Types cannot be defined in a `decltype' expression. Save away the
14203 old message and set the new one. */
14205 parser->type_definition_forbidden_message
14208 /* The restrictions on constant-expressions do not apply inside
14209 decltype expressions. */
14210 bool saved_integral_constant_expression_p
14212 bool saved_non_integral_constant_expression_p
14216 /* Within a parenthesized expression, a `>' token is always
14217 the greater-than operator. */
14218 bool saved_greater_than_is_operator_p
14222 /* Do not actually evaluate the expression. */
14225 /* Do not warn about problems with the expression. */
14230 /* Go back to evaluating expressions. */
14234 /* The `>' token might be the end of a template-id or
14235 template-parameter-list now. */
14236 parser->greater_than_is_operator_p
14239 /* Restore the old message and the integral constant expression
14240 flags. */
14242 parser->integral_constant_expression_p
14244 parser->non_integral_constant_expression_p
14246 }
14248 /* Parse to the closing `)'. */
14250 {
14255 }
14258 {
14259 /* Build auto. */
14262 }
14263 else
14265 tf_warning_or_error);
14267 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14268 it again. */
14279 }
14281 /* Special member functions [gram.special] */
14283 /* Parse a conversion-function-id.
14285 conversion-function-id:
14286 operator conversion-type-id
14288 Returns an IDENTIFIER_NODE representing the operator. */
14290 static tree
14292 {
14293 tree type;
14294 tree saved_scope;
14295 tree saved_qualifying_scope;
14296 tree saved_object_scope;
14299 /* Look for the `operator' token. */
14302 /* When we parse the conversion-type-id, the current scope will be
14303 reset. However, we need that information in able to look up the
14304 conversion function later, so we save it here. */
14308 /* We must enter the scope of the class so that the names of
14309 entities declared within the class are available in the
14310 conversion-type-id. For example, consider:
14312 struct S {
14313 typedef int I;
14314 operator I();
14315 };
14317 S::operator I() { ... }
14319 In order to see that `I' is a type-name in the definition, we
14320 must be in the scope of `S'. */
14323 /* Parse the conversion-type-id. */
14325 /* Leave the scope of the class, if any. */
14328 /* Restore the saved scope. */
14332 /* If the TYPE is invalid, indicate failure. */
14336 }
14338 /* Parse a conversion-type-id:
14340 conversion-type-id:
14341 type-specifier-seq conversion-declarator [opt]
14343 Returns the TYPE specified. */
14345 static tree
14347 {
14348 tree attributes;
14349 cp_decl_specifier_seq type_specifiers;
14351 tree type_specified;
14354 /* Parse the attributes. */
14358 parser->type_definition_forbidden_message
14361 /* Parse the type-specifiers. */
14368 /* If that didn't work, stop. */
14371 /* Parse the conversion-declarator. */
14379 /* Don't give this error when parsing tentatively. This happens to
14380 work because we always parse this definitively once. */
14383 {
14385 {
14388 }
14392 }
14395 }
14397 /* Parse an (optional) conversion-declarator.
14399 conversion-declarator:
14400 ptr-operator conversion-declarator [opt]
14402 */
14406 {
14409 cp_cv_quals cv_quals;
14411 /* We don't know if there's a ptr-operator next, or not. */
14413 /* Try the ptr-operator. */
14416 /* If it worked, look for more conversion-declarators. */
14418 {
14421 /* Parse another optional declarator. */
14424 declarator = cp_parser_make_indirect_declarator
14428 }
14431 }
14433 /* Parse an (optional) ctor-initializer.
14435 ctor-initializer:
14436 : mem-initializer-list */
14438 static void
14440 {
14441 /* If the next token is not a `:', then there is no
14442 ctor-initializer. */
14444 {
14445 /* Do default initialization of any bases and members. */
14449 }
14451 /* Consume the `:' token. */
14453 /* And the mem-initializer-list. */
14455 }
14457 /* Parse a mem-initializer-list.
14459 mem-initializer-list:
14460 mem-initializer ... [opt]
14461 mem-initializer ... [opt] , mem-initializer-list */
14463 static void
14465 {
14470 /* Let the semantic analysis code know that we are starting the
14471 mem-initializer-list. */
14476 /* Loop through the list. */
14478 {
14479 tree mem_initializer;
14482 /* Parse the mem-initializer. */
14484 /* If the next token is a `...', we're expanding member initializers. */
14490 {
14491 /* Consume the `...'. */
14495 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14496 can be expanded but members cannot. */
14499 {
14504 }
14506 /* Construct the pack expansion type. */
14509 }
14512 {
14516 }
14517 /* Look for a target constructor. */
14521 {
14524 {
14528 }
14530 }
14531 /* Add it to the list, unless it was erroneous. */
14533 {
14536 }
14537 /* If the next token is not a `,', we're done. */
14540 /* Consume the `,' token. */
14542 }
14544 /* Perform semantic analysis. */
14547 }
14549 /* Parse a mem-initializer.
14551 mem-initializer:
14552 mem-initializer-id ( expression-list [opt] )
14553 mem-initializer-id braced-init-list
14555 GNU extension:
14557 mem-initializer:
14558 ( expression-list [opt] )
14560 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14561 class) or FIELD_DECL (for a non-static data member) to initialize;
14562 the TREE_VALUE is the expression-list. An empty initialization
14563 list is represented by void_list_node. */
14565 static tree
14567 {
14568 tree mem_initializer_id;
14569 tree expression_list;
14570 tree member;
14573 /* Find out what is being initialized. */
14575 {
14579 }
14580 else
14581 {
14585 }
14591 {
14598 }
14599 else
14600 {
14610 }
14620 }
14622 /* Parse a mem-initializer-id.
14624 mem-initializer-id:
14625 :: [opt] nested-name-specifier [opt] class-name
14626 decltype-specifier (C++11)
14627 identifier
14629 Returns a TYPE indicating the class to be initialized for the first
14630 production (and the second in C++11). Returns an IDENTIFIER_NODE
14631 indicating the data member to be initialized for the last production. */
14633 static tree
14635 {
14639 tree id;
14643 /* `typename' is not allowed in this context ([temp.res]). */
14645 {
14647 "keyword %<typename%> not allowed in this context (a qualified "
14650 }
14651 /* Look for the optional `::' operator. */
14652 global_scope_p
14656 /* Look for the optional nested-name-specifier. The simplest way to
14657 implement:
14659 [temp.res]
14661 The keyword `typename' is not permitted in a base-specifier or
14662 mem-initializer; in these contexts a qualified name that
14663 depends on a template-parameter is implicitly assumed to be a
14664 type name.
14666 is to assume that we have seen the `typename' keyword at this
14667 point. */
14668 nested_name_specifier_p
14677 /* If there is a `::' operator or a nested-name-specifier, then we
14678 are definitely looking for a class-name. */
14683 typename_type,
14687 /* Otherwise, we could also be looking for an ordinary identifier. */
14690 /* Try a decltype-specifier. */
14692 else
14693 /* Otherwise, try a class-name. */
14697 none_type,
14701 /* If we found one, we're done. */
14704 /* Otherwise, look for an ordinary identifier. */
14706 }
14708 /* Overloading [gram.over] */
14710 /* Parse an operator-function-id.
14712 operator-function-id:
14713 operator operator
14715 Returns an IDENTIFIER_NODE for the operator which is a
14716 human-readable spelling of the identifier, e.g., `operator +'. */
14718 static cp_expr
14720 {
14721 /* Look for the `operator' keyword. */
14724 /* And then the name of the operator itself. */
14726 }
14728 /* Return an identifier node for a user-defined literal operator.
14729 The suffix identifier is chained to the operator name identifier. */
14731 tree
14733 {
14734 tree identifier;
14741 }
14743 /* Parse an operator.
14745 operator:
14746 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14747 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14748 || ++ -- , ->* -> () []
14750 GNU Extensions:
14752 operator:
14753 <? >? <?= >?=
14755 Returns an IDENTIFIER_NODE for the operator which is a
14756 human-readable spelling of the identifier, e.g., `operator +'. */
14758 static cp_expr
14760 {
14765 /* Peek at the next token. */
14770 /* Figure out which operator we have. */
14775 {
14777 {
14778 /* The keyword should be either `new' or `delete'. */
14783 else
14786 /* Consume the `new' or `delete' token. */
14789 /* Peek at the next token. */
14791 /* If it's a `[' token then this is the array variant of the
14792 operator. */
14794 {
14795 /* Consume the `[' token. */
14797 /* Look for the `]' token. */
14802 }
14806 }
14964 {
14965 /* Consume the `('. */
14966 matching_parens parens;
14968 /* Look for the matching `)'. */
14973 }
14976 /* Consume the `['. */
14978 /* Look for the matching `]'. */
14987 /* FALLTHRU */
14996 {
15003 /* Consume the string. */
15009 {
15012 }
15013 else
15014 {
15016 /* Look for the suffix identifier. */
15021 {
15025 }
15026 else
15027 {
15030 }
15031 }
15036 {
15039 }
15042 {
15045 }
15047 {
15050 }
15052 }
15055 /* Anything else is an error. */
15057 }
15059 /* If we have selected an identifier, we need to consume the
15060 operator token. */
15062 {
15066 }
15067 /* Otherwise, no valid operator name was present. */
15068 else
15069 {
15072 }
15075 }
15077 /* Parse a template-declaration.
15079 template-declaration:
15080 export [opt] template < template-parameter-list > declaration
15082 If MEMBER_P is TRUE, this template-declaration occurs within a
15083 class-specifier.
15085 The grammar rule given by the standard isn't correct. What
15086 is really meant is:
15088 template-declaration:
15089 export [opt] template-parameter-list-seq
15090 decl-specifier-seq [opt] init-declarator [opt] ;
15091 export [opt] template-parameter-list-seq
15092 function-definition
15094 template-parameter-list-seq:
15095 template-parameter-list-seq [opt]
15096 template < template-parameter-list >
15098 Concept Extensions:
15100 template-parameter-list-seq:
15101 template < template-parameter-list > requires-clause [opt]
15103 requires-clause:
15104 requires logical-or-expression */
15106 static void
15108 {
15109 /* Check for `export'. */
15111 {
15112 /* Consume the `export' token. */
15114 /* Warn that we do not support `export'. */
15116 }
15119 }
15121 /* Parse a template-parameter-list.
15123 template-parameter-list:
15124 template-parameter
15125 template-parameter-list , template-parameter
15127 Returns a TREE_LIST. Each node represents a template parameter.
15128 The nodes are connected via their TREE_CHAINs. */
15130 static tree
15132 {
15137 /* The loop below parses the template parms. We first need to know
15138 the total number of template parms to be able to compute proper
15139 canonical types of each dependent type. So after the loop, when
15140 we know the total number of template parms,
15141 end_template_parm_list computes the proper canonical types and
15142 fixes up the dependent types accordingly. */
15144 {
15145 tree parameter;
15148 location_t parm_loc;
15150 /* Parse the template-parameter. */
15155 /* Add it to the list. */
15158 parm_loc,
15159 parameter,
15160 is_non_type,
15161 is_parameter_pack);
15162 else
15163 {
15166 }
15168 /* If the next token is not a `,', we're done. */
15171 /* Otherwise, consume the `,' token. */
15173 }
15176 }
15178 /* Parse a introduction-list.
15180 introduction-list:
15181 introduced-parameter
15182 introduction-list , introduced-parameter
15184 introduced-parameter:
15185 ...[opt] identifier
15187 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15188 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15189 WILDCARD_DECL will also have DECL_NAME set and token location in
15190 DECL_SOURCE_LOCATION. */
15192 static tree
15194 {
15198 {
15203 /* Build placeholder. */
15211 /* If the next token is not a `,', we're done. */
15214 /* Otherwise, consume the `,' token. */
15216 }
15218 /* Convert the vec into a TREE_VEC. */
15221 tree parm;
15227 }
15229 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15230 is an abstract declarator. */
15234 {
15239 }
15241 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15242 is an abstract declarator. */
15246 {
15250 else
15252 }
15254 /* Returns true if DECL represents a constrained-parameter. */
15258 {
15263 }
15265 /* Returns true if PARM declares a constrained-parameter. */
15269 {
15271 }
15273 /* Check that the type parameter is only a declarator-id, and that its
15274 type is not cv-qualified. */
15276 bool
15279 {
15284 {
15287 }
15289 /* Don't allow cv-qualified type parameters. */
15292 {
15295 }
15298 }
15300 /* Finish parsing/processing a template type parameter and checking
15301 various restrictions. */
15305 tree id,
15307 {
15310 else
15312 }
15314 static tree
15316 {
15317 /* FIXME: This should probably be copied, and we may need to adjust
15318 the template parameter depths. */
15328 }
15330 /* Finish parsing/processing a template template parameter by borrowing
15331 the template parameter list from the prototype parameter. */
15333 static tree
15335 tree proto,
15336 tree id,
15338 {
15342 }
15344 /* Create a new non-type template parameter from the given PARM
15345 declarator. */
15347 static tree
15350 {
15356 }
15358 /* Build a constrained template parameter based on the PARMDECL
15359 declarator. The type of PARMDECL is the constrained type, which
15360 refers to the prototype template parameter that ultimately
15361 specifies the type of the declared parameter. */
15363 static tree
15368 {
15374 /* A template parameter constrained by a variadic concept shall also
15375 be declared as a template parameter pack. */
15380 /* Build the parameter. Return an error if the declarator was invalid. */
15381 tree parm;
15386 parmdecl);
15387 else
15392 /* Finish the parameter decl and create a node attaching the
15393 default argument and constraint. */
15398 }
15400 /* Returns true if the parsed type actually represents the declaration
15401 of a type template-parameter. */
15405 {
15408 }
15411 /* Returns true if the parsed type actually represents the declaration of
15412 a template template-parameter. */
15414 static bool
15416 {
15419 }
15421 /* Parse a default argument for a type template-parameter.
15422 Note that diagnostics are handled in cp_parser_template_parameter. */
15424 static tree
15426 {
15429 /* Consume the `=' token. */
15434 /* Parse the default-argument. */
15440 {
15444 }
15447 }
15449 /* Parse a default argument for a template template-parameter. */
15451 static tree
15453 {
15458 /* Consume the `='. */
15460 /* Parse the id-expression. */
15462 /* save token before parsing the id-expression, for error
15463 reporting */
15465 tree default_argument
15473 /* If the id-expression was a template-id that refers to
15474 a template-class, we already have the declaration here,
15475 so no further lookup is needed. */
15476 ;
15477 else
15478 /* Look up the name. */
15479 default_argument
15481 none_type,
15487 /* See if the default argument is valid. */
15491 }
15493 /* Parse a template-parameter.
15495 template-parameter:
15496 type-parameter
15497 parameter-declaration
15499 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15500 the parameter. The TREE_PURPOSE is the default value, if any.
15501 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15502 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15503 set to true iff this parameter is a parameter pack. */
15505 static tree
15508 {
15511 tree parm;
15513 /* Assume it is a type parameter or a template parameter. */
15515 /* Assume it not a parameter pack. */
15517 /* Peek at the next token. */
15519 /* If it is `template', we have a type-parameter. */
15522 /* If it is `class' or `typename' we do not know yet whether it is a
15523 type parameter or a non-type parameter. Consider:
15525 template <typename T, typename T::X X> ...
15527 or:
15529 template <class C, class D*> ...
15531 Here, the first parameter is a type parameter, and the second is
15532 a non-type parameter. We can tell by looking at the token after
15533 the identifier -- if it is a `,', `=', or `>' then we have a type
15534 parameter. */
15536 {
15537 /* Peek at the token after `class' or `typename'. */
15539 /* If it's an ellipsis, we have a template type parameter
15540 pack. */
15543 /* If it's an identifier, skip it. */
15546 /* Now, see if the token looks like the end of a template
15547 parameter. */
15552 }
15554 /* Otherwise, it is a non-type parameter or a constrained parameter.
15556 [temp.param]
15558 When parsing a default template-argument for a non-type
15559 template-parameter, the first non-nested `>' is taken as the end
15560 of the template parameter-list rather than a greater-than
15561 operator. */
15562 parameter_declarator
15569 /* If the parameter declaration is marked as a parameter pack, set
15570 *IS_PARAMETER_PACK to notify the caller. */
15575 {
15576 /* Can happen in some cases of erroneous input (c++/34892). */
15578 /* Consume the `...' for better error recovery. */
15580 }
15582 // The parameter may have been constrained.
15585 parameter_declarator,
15586 is_non_type,
15587 is_parameter_pack);
15589 // Now we're sure that the parameter is a non-type parameter.
15600 }
15602 /* Parse a type-parameter.
15604 type-parameter:
15605 class identifier [opt]
15606 class identifier [opt] = type-id
15607 typename identifier [opt]
15608 typename identifier [opt] = type-id
15609 template < template-parameter-list > class identifier [opt]
15610 template < template-parameter-list > class identifier [opt]
15611 = id-expression
15613 GNU Extension (variadic templates):
15615 type-parameter:
15616 class ... identifier [opt]
15617 typename ... identifier [opt]
15619 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15620 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15621 the declaration of the parameter.
15623 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15625 static tree
15627 {
15629 tree parameter;
15631 /* Look for a keyword to tell us what kind of parameter this is. */
15637 {
15640 {
15641 tree identifier;
15642 tree default_argument;
15644 /* If the next token is an ellipsis, we have a template
15645 argument pack. */
15647 {
15648 /* Consume the `...' token. */
15653 }
15655 /* If the next token is an identifier, then it names the
15656 parameter. */
15659 else
15662 /* Create the parameter. */
15665 /* If the next token is an `=', we have a default argument. */
15667 {
15668 default_argument
15671 /* Template parameter packs cannot have default
15672 arguments. */
15674 {
15677 "template parameter pack %qD cannot have a "
15679 else
15681 "template parameter packs cannot have "
15684 }
15687 }
15688 else
15691 /* Create the combined representation of the parameter and the
15692 default argument. */
15694 }
15698 {
15699 tree identifier;
15700 tree default_argument;
15702 /* Look for the `<'. */
15704 /* Parse the template-parameter-list. */
15706 /* Look for the `>'. */
15709 // If template requirements are present, parse them.
15711 {
15716 }
15718 /* Look for the `class' or 'typename' keywords. */
15720 /* If the next token is an ellipsis, we have a template
15721 argument pack. */
15723 {
15724 /* Consume the `...' token. */
15729 }
15730 /* If the next token is an `=', then there is a
15731 default-argument. If the next token is a `>', we are at
15732 the end of the parameter-list. If the next token is a `,',
15733 then we are at the end of this parameter. */
15737 {
15739 /* Treat invalid names as if the parameter were nameless. */
15742 }
15743 else
15746 /* Create the template parameter. */
15748 identifier);
15750 /* If the next token is an `=', then there is a
15751 default-argument. */
15753 {
15754 default_argument
15757 /* Template parameter packs cannot have default
15758 arguments. */
15760 {
15763 "template parameter pack %qD cannot "
15765 identifier);
15766 else
15770 }
15771 }
15772 else
15775 /* Create the combined representation of the parameter and the
15776 default argument. */
15778 }
15784 }
15787 }
15789 /* Parse a template-id.
15791 template-id:
15792 template-name < template-argument-list [opt] >
15794 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15795 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15796 returned. Otherwise, if the template-name names a function, or set
15797 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15798 names a class, returns a TYPE_DECL for the specialization.
15800 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15801 uninstantiated templates. */
15803 static tree
15809 {
15810 tree templ;
15811 tree arguments;
15812 tree template_id;
15817 /* If the next token corresponds to a template-id, there is no need
15818 to reparse it. */
15821 {
15824 }
15826 /* Avoid performing name lookup if there is no possibility of
15827 finding a template-id. */
15830 && !cp_parser_nth_token_starts_template_argument_list_p
15832 {
15835 }
15837 /* Remember where the template-id starts. */
15843 /* Parse the template-name. */
15846 check_dependency_p,
15847 is_declaration,
15848 tag_type,
15851 {
15854 }
15856 /* Since we're going to preserve any side-effects from this parse, set up a
15857 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15858 in the template arguments. */
15861 /* If we find the sequence `[:' after a template-name, it's probably
15862 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15863 parse correctly the argument list. */
15870 {
15872 /* Change `:' into `::'. */
15874 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15875 CPP_LESS. */
15878 /* Parse the arguments. */
15881 {
15882 /* If we couldn't parse an argument list, then we revert our changes
15883 and return simply an error. Maybe this is not a template-id
15884 after all. */
15889 }
15890 /* Otherwise, emit an error about the invalid digraph, but continue
15891 parsing because we got our argument list. */
15894 {
15897 "%<<:%> is an alternate spelling for %<[%>."
15900 {
15902 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15905 }
15906 }
15907 }
15908 else
15909 {
15910 /* Look for the `<' that starts the template-argument-list. */
15912 {
15915 }
15916 /* Parse the arguments. */
15918 }
15920 /* Set the location to be of the form:
15921 template-name < template-argument-list [opt] >
15922 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15923 with caret == start at the start of the template-name,
15924 ranging until the closing '>'. */
15925 location_t finish_loc
15927 location_t combined_loc
15930 /* Check for concepts autos where they don't belong. We could
15931 identify types in some cases of idnetifier TEMPL, looking ahead
15932 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15933 types. We reject them in functions, but if what we have is an
15934 identifier, even with none_type we can't conclude it's NOT a
15935 type, we have to wait for template substitution. */
15938 /* Build a representation of the specialization. */
15941 TEMPLATE_ID_EXPR,
15945 {
15947 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15948 template (rather than some instantiation thereof) only if
15949 is not nested within some other construct. For example, in
15950 "template <typename T> void f(T) { A<T>::", A<T> is just an
15951 instantiation of A. */
15954 CPP_SCOPE));
15955 template_id
15957 }
15958 /* A template-like identifier may be a partial concept id. */
15964 {
15968 }
15969 else
15970 {
15971 /* If it's not a class-template or a template-template, it should be
15972 a function-template. */
15980 }
15982 /* If parsing tentatively, replace the sequence of tokens that makes
15983 up the template-id with a CPP_TEMPLATE_ID token. That way,
15984 should we re-parse the token stream, we will not have to repeat
15985 the effort required to do the parse, nor will we issue duplicate
15986 error messages about problems during instantiation of the
15987 template. */
15989 /* Don't do this if we had a parse error in a declarator; re-parsing
15990 might succeed if a name changes meaning (60361). */
15994 {
15995 /* Reset the contents of the START_OF_ID token. */
15999 /* We must mark the lookup as kept, so we don't throw it away on
16000 the first parse. */
16004 /* Retrieve any deferred checks. Do not pop this access checks yet
16005 so the memory will not be reclaimed during token replacing below. */
16011 /* Purge all subsequent tokens. */
16014 /* ??? Can we actually assume that, if template_id ==
16015 error_mark_node, we will have issued a diagnostic to the
16016 user, as opposed to simply marking the tentative parse as
16017 failed? */
16020 }
16024 }
16026 /* Parse a template-name.
16028 template-name:
16029 identifier
16031 The standard should actually say:
16033 template-name:
16034 identifier
16035 operator-function-id
16037 A defect report has been filed about this issue.
16039 A conversion-function-id cannot be a template name because they cannot
16040 be part of a template-id. In fact, looking at this code:
16042 a.operator K<int>()
16044 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16045 It is impossible to call a templated conversion-function-id with an
16046 explicit argument list, since the only allowed template parameter is
16047 the type to which it is converting.
16049 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16050 `template' keyword, in a construction like:
16052 T::template f<3>()
16054 In that case `f' is taken to be a template-name, even though there
16055 is no way of knowing for sure.
16057 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16058 name refers to a set of overloaded functions, at least one of which
16059 is a template, or an IDENTIFIER_NODE with the name of the template,
16060 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16061 names are looked up inside uninstantiated templates. */
16063 static tree
16070 {
16071 tree identifier;
16072 tree decl;
16075 /* If the next token is `operator', then we have either an
16076 operator-function-id or a conversion-function-id. */
16078 {
16079 /* We don't know whether we're looking at an
16080 operator-function-id or a conversion-function-id. */
16082 /* Try an operator-function-id. */
16084 /* If that didn't work, try a conversion-function-id. */
16086 {
16089 }
16090 }
16091 /* Look for the identifier. */
16092 else
16095 /* If we didn't find an identifier, we don't have a template-id. */
16099 /* If the name immediately followed the `template' keyword, then it
16100 is a template-name. However, if the next token is not `<', then
16101 we do not treat it as a template-name, since it is not being used
16102 as part of a template-id. This enables us to handle constructs
16103 like:
16105 template <typename T> struct S { S(); };
16106 template <typename T> S<T>::S();
16108 correctly. We would treat `S' as a template -- if it were `S<T>'
16109 -- but we do not if there is no `<'. */
16113 {
16114 /* In a declaration, in a dependent context, we pretend that the
16115 "template" keyword was present in order to improve error
16116 recovery. For example, given:
16118 template <typename T> void f(T::X<int>);
16120 we want to treat "X<int>" as a template-id. */
16122 && !template_keyword_p
16124 && check_dependency_p
16126 /* Do not do this for dtors (or ctors), since they never
16127 need the template keyword before their name. */
16129 {
16132 /* Explain what went wrong. */
16134 identifier);
16137 /* If parsing tentatively, find the location of the "<" token. */
16140 /* Parse the template arguments so that we can issue error
16141 messages about them. */
16144 /* Skip tokens until we find a good place from which to
16145 continue parsing. */
16150 /* If parsing tentatively, permanently remove the
16151 template argument list. That will prevent duplicate
16152 error messages from being issued about the missing
16153 "template" keyword. */
16160 }
16162 /* If the "template" keyword is present, then there is generally
16163 no point in doing name-lookup, so we just return IDENTIFIER.
16164 But, if the qualifying scope is non-dependent then we can
16165 (and must) do name-lookup normally. */
16167 {
16173 {
16174 /* We're optimizing away the call to cp_parser_lookup_name, but
16175 we still need to do this. */
16178 }
16179 }
16180 }
16182 /* Look up the name. */
16184 tag_type,
16187 check_dependency_p,
16193 /* If DECL is a template, then the name was a template-name. */
16195 {
16199 }
16200 else
16201 {
16202 /* The standard does not explicitly indicate whether a name that
16203 names a set of overloaded declarations, some of which are
16204 templates, is a template-name. However, such a name should
16205 be a template-name; otherwise, there is no way to form a
16206 template-id for the overloaded templates. */
16215 {
16216 /* The name does not name a template. */
16219 }
16220 }
16222 /* If DECL is dependent, and refers to a function, then just return
16223 its name; we will look it up again during template instantiation. */
16225 {
16229 }
16232 }
16234 /* Parse a template-argument-list.
16236 template-argument-list:
16237 template-argument ... [opt]
16238 template-argument-list , template-argument ... [opt]
16240 Returns a TREE_VEC containing the arguments. */
16242 static tree
16244 {
16249 tree vec;
16256 /* Even if the template-id appears in an integral
16257 constant-expression, the contents of the argument list do
16258 not. */
16264 /* Parse the arguments. */
16265 do
16266 {
16267 tree argument;
16270 /* Consume the comma. */
16273 /* Parse the template-argument. */
16276 /* If the next token is an ellipsis, we're expanding a template
16277 argument pack. */
16279 {
16281 {
16285 }
16286 /* Consume the `...' token. */
16289 /* Make the argument into a TYPE_PACK_EXPANSION or
16290 EXPR_PACK_EXPANSION. */
16292 }
16295 {
16299 {
16302 }
16303 else
16305 }
16307 }
16323 }
16325 /* Parse a template-argument.
16327 template-argument:
16328 assignment-expression
16329 type-id
16330 id-expression
16332 The representation is that of an assignment-expression, type-id, or
16333 id-expression -- except that the qualified id-expression is
16334 evaluated, so that the value returned is either a DECL or an
16335 OVERLOAD.
16337 Although the standard says "assignment-expression", it forbids
16338 throw-expressions or assignments in the template argument.
16339 Therefore, we use "conditional-expression" instead. */
16341 static tree
16343 {
16344 tree argument;
16350 cp_id_kind idk;
16352 /* There's really no way to know what we're looking at, so we just
16353 try each alternative in order.
16355 [temp.arg]
16357 In a template-argument, an ambiguity between a type-id and an
16358 expression is resolved to a type-id, regardless of the form of
16359 the corresponding template-parameter.
16361 Therefore, we try a type-id first. */
16364 /* If there was no error parsing the type-id but the next token is a
16365 '>>', our behavior depends on which dialect of C++ we're
16366 parsing. In C++98, we probably found a typo for '> >'. But there
16367 are type-id which are also valid expressions. For instance:
16369 struct X { int operator >> (int); };
16370 template <int V> struct Foo {};
16371 Foo<X () >> 5> r;
16373 Here 'X()' is a valid type-id of a function type, but the user just
16374 wanted to write the expression "X() >> 5". Thus, we remember that we
16375 found a valid type-id, but we still try to parse the argument as an
16376 expression to see what happens.
16378 In C++0x, the '>>' will be considered two separate '>'
16379 tokens. */
16383 {
16386 }
16387 else
16388 {
16389 /* If the next token isn't a `,' or a `>', then this argument wasn't
16390 really finished. This means that the argument is not a valid
16391 type-id. */
16394 /* If that worked, we're done. */
16397 }
16398 /* We're still not sure what the argument will be. */
16400 /* Try a template. */
16408 /* If the next token isn't a `,' or a `>', then this argument wasn't
16409 really finished. */
16413 {
16414 /* Figure out what is being referred to. If the id-expression
16415 was for a class template specialization, then we will have a
16416 TYPE_DECL at this point. There is no need to do name lookup
16417 at this point in that case. */
16420 none_type,
16426 /* Handle a constrained-type-specifier for a non-type template
16427 parameter. */
16433 }
16435 {
16439 }
16440 /* It must be a non-type argument. In C++17 any constant-expression is
16441 allowed. */
16445 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16447 -- an integral constant-expression of integral or enumeration
16448 type; or
16450 -- the name of a non-type template-parameter; or
16452 -- the name of an object or function with external linkage...
16454 -- the address of an object or function with external linkage...
16456 -- a pointer to member... */
16457 /* Look for a non-type template parameter. */
16459 {
16471 }
16473 /* If the next token is "&", the argument must be the address of an
16474 object or function with external linkage. */
16477 {
16480 }
16481 /* See if we might have an id-expression. */
16488 {
16491 address_p,
16498 else
16499 {
16500 tree probe;
16503 {
16504 /* Strip the dereference temporarily. */
16507 }
16509 /* If we're in a template, we represent a qualified-id referring
16510 to a static data member as a SCOPE_REF even if the scope isn't
16511 dependent so that we can check access control later. */
16516 {
16517 /* A variable without external linkage might still be a
16518 valid constant-expression, so no error is issued here
16519 if the external-linkage check fails. */
16522 }
16524 /* All overloaded functions are allowed; if the external
16525 linkage test does not pass, an error will be issued
16526 later. */
16527 ;
16531 /* A pointer-to-member. */
16532 ;
16534 ;
16535 else
16539 {
16542 tf_warning_or_error);
16543 else
16546 }
16547 }
16548 }
16549 /* If the argument started with "&", there are no other valid
16550 alternatives at this point. */
16552 {
16555 }
16557 general_expr:
16558 /* If the argument wasn't successfully parsed as a type-id followed
16559 by '>>', the argument can only be a constant expression now.
16560 Otherwise, we try parsing the constant-expression tentatively,
16561 because the argument could really be a type-id. */
16567 else
16568 {
16569 /* With C++17 generalized non-type template arguments we need to handle
16570 lvalue constant expressions, too. */
16573 }
16581 /* We did our best to parse the argument as a non type-id, but that
16582 was the only alternative that matched (albeit with a '>' after
16583 it). We can assume it's just a typo from the user, and a
16584 diagnostic will then be issued. */
16586 }
16588 /* Parse an explicit-instantiation.
16590 explicit-instantiation:
16591 template declaration
16593 Although the standard says `declaration', what it really means is:
16595 explicit-instantiation:
16596 template decl-specifier-seq [opt] declarator [opt] ;
16598 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16599 supposed to be allowed. A defect report has been filed about this
16600 issue.
16602 GNU Extension:
16604 explicit-instantiation:
16605 storage-class-specifier template
16606 decl-specifier-seq [opt] declarator [opt] ;
16607 function-specifier template
16608 decl-specifier-seq [opt] declarator [opt] ; */
16610 static void
16612 {
16614 cp_decl_specifier_seq decl_specifiers;
16619 /* Look for an (optional) storage-class-specifier or
16620 function-specifier. */
16622 {
16623 extension_specifier
16626 extension_specifier
16629 }
16631 /* Look for the `template' keyword. */
16633 /* Let the front end know that we are processing an explicit
16634 instantiation. */
16636 /* [temp.explicit] says that we are supposed to ignore access
16637 control while processing explicit instantiation directives. */
16639 /* Parse a decl-specifier-seq. */
16641 CP_PARSER_FLAGS_OPTIONAL,
16644 /* If there was exactly one decl-specifier, and it declared a class,
16645 and there's no declarator, then we have an explicit type
16646 instantiation. */
16648 {
16649 tree type;
16653 /* Turn access control back on for names used during
16654 template instantiation. */
16659 }
16660 else
16661 {
16663 tree decl;
16665 /* Parse the declarator. */
16666 declarator
16677 {
16680 "explicit instantiation shall not use"
16684 "explicit instantiation shall not use"
16689 /* Turn access control back on for names used during
16690 template instantiation. */
16692 /* Do the explicit instantiation. */
16694 }
16695 else
16696 {
16698 /* Skip the body of the explicit instantiation. */
16700 }
16701 }
16702 /* We're done with the instantiation. */
16708 }
16710 /* Parse an explicit-specialization.
16712 explicit-specialization:
16713 template < > declaration
16715 Although the standard says `declaration', what it really means is:
16717 explicit-specialization:
16718 template <> decl-specifier [opt] init-declarator [opt] ;
16719 template <> function-definition
16720 template <> explicit-specialization
16721 template <> template-declaration */
16723 static void
16725 {
16729 /* Look for the `template' keyword. */
16731 /* Look for the `<'. */
16733 /* Look for the `>'. */
16735 /* We have processed another parameter list. */
16737 /* [temp]
16739 A template ... explicit specialization ... shall not have C
16740 linkage. */
16742 {
16745 /* Give it C++ linkage to avoid confusing other parts of the
16746 front end. */
16749 }
16750 else
16752 /* Let the front end know that we are beginning a specialization. */
16754 {
16757 }
16759 /* If the next keyword is `template', we need to figure out whether
16760 or not we're looking a template-declaration. */
16762 {
16767 else
16769 }
16770 else
16771 /* Parse the dependent declaration. */
16777 /* We're done with the specialization. */
16779 /* For the erroneous case of a template with C linkage, we pushed an
16780 implicit C++ linkage scope; exit that scope now. */
16783 /* We're done with this parameter list. */
16785 }
16787 /* Parse a type-specifier.
16789 type-specifier:
16790 simple-type-specifier
16791 class-specifier
16792 enum-specifier
16793 elaborated-type-specifier
16794 cv-qualifier
16796 GNU Extension:
16798 type-specifier:
16799 __complex__
16801 Returns a representation of the type-specifier. For a
16802 class-specifier, enum-specifier, or elaborated-type-specifier, a
16803 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16805 The parser flags FLAGS is used to control type-specifier parsing.
16807 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16808 in a decl-specifier-seq.
16810 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16811 class-specifier, enum-specifier, or elaborated-type-specifier, then
16812 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16813 if a type is declared; 2 if it is defined. Otherwise, it is set to
16814 zero.
16816 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16817 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16818 is set to FALSE. */
16820 static tree
16822 cp_parser_flags flags,
16827 {
16833 /* Assume this type-specifier does not declare a new type. */
16836 /* And that it does not specify a cv-qualifier. */
16839 /* Peek at the next token. */
16842 /* If we're looking at a keyword, we can use that to guide the
16843 production we choose. */
16846 {
16851 /* Look for the enum-specifier. */
16853 /* If that worked, we're done. */
16855 {
16860 type_spec,
16861 token,
16864 }
16865 else
16868 /* Any of these indicate either a class-specifier, or an
16869 elaborated-type-specifier. */
16876 /* Parse tentatively so that we can back up if we don't find a
16877 class-specifier. */
16879 /* Look for the class-specifier. */
16882 /* If that worked, we're done. */
16884 {
16889 type_spec,
16890 token,
16893 }
16895 /* Fall through. */
16896 elaborated_type_specifier:
16897 /* We're declaring (not defining) a class or enum. */
16901 /* Fall through. */
16903 /* Look for an elaborated-type-specifier. */
16904 type_spec
16905 = (cp_parser_elaborated_type_specifier
16908 is_declaration));
16911 type_spec,
16912 token,
16935 /* The `__complex__' keyword is a GNU extension. */
16941 }
16943 /* Handle simple keywords. */
16945 {
16947 {
16950 }
16952 }
16954 /* If we do not already have a type-specifier, assume we are looking
16955 at a simple-type-specifier. */
16957 decl_specs,
16958 flags);
16960 /* If we didn't find a type-specifier, and a type-specifier was not
16961 optional in this context, issue an error message. */
16963 {
16966 }
16969 }
16971 /* Parse a simple-type-specifier.
16973 simple-type-specifier:
16974 :: [opt] nested-name-specifier [opt] type-name
16975 :: [opt] nested-name-specifier template template-id
16976 char
16977 wchar_t
16978 bool
16979 short
16980 int
16981 long
16982 signed
16983 unsigned
16984 float
16985 double
16986 void
16988 C++11 Extension:
16990 simple-type-specifier:
16991 auto
16992 decltype ( expression )
16993 char16_t
16994 char32_t
16995 __underlying_type ( type-id )
16997 C++17 extension:
16999 nested-name-specifier(opt) template-name
17001 GNU Extension:
17003 simple-type-specifier:
17004 __int128
17005 __typeof__ unary-expression
17006 __typeof__ ( type-id )
17007 __typeof__ ( type-id ) { initializer-list , [opt] }
17009 Concepts Extension:
17011 simple-type-specifier:
17012 constrained-type-specifier
17014 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17015 appropriately updated. */
17017 static tree
17020 cp_parser_flags flags)
17021 {
17026 /* Peek at the next token. */
17029 /* If we're looking at a keyword, things are easy. */
17031 {
17066 {
17069 }
17098 {
17099 /* The 'auto' might be the placeholder return type for a function decl
17100 with trailing return type. */
17109 {
17111 {
17118 }
17121 {
17124 }
17127 }
17131 {
17134 }
17137 {
17140 }
17141 else
17145 {
17148 "use of %<auto%> in lambda parameter declaration "
17149 "only available with "
17151 }
17154 "use of %<auto%> in parameter declaration "
17155 "only available with "
17159 "use of %<auto%> in parameter declaration "
17161 }
17162 else
17167 /* Since DR 743, decltype can either be a simple-type-specifier by
17168 itself or begin a nested-name-specifier. Parsing it will replace
17169 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17170 handling below decide what to do. */
17176 /* Consume the `typeof' token. */
17178 /* Parse the operand to `typeof'. */
17180 /* If it is not already a TYPE, take its type. */
17186 token,
17195 token,
17205 token,
17210 }
17212 /* If token is an already-parsed decltype not followed by ::,
17213 it's a simple-type-specifier. */
17216 {
17219 {
17221 token,
17223 /* Remember that we are handling a decltype in order to
17224 implement the resolution of DR 1510 when the argument
17225 isn't instantiation dependent. */
17227 }
17230 }
17232 /* If the type-specifier was for a built-in type, we're done. */
17234 {
17235 /* Record the type. */
17242 type,
17243 token,
17248 /* Consume the token. */
17254 /* There is no valid C++ program where a non-template type is
17255 followed by a "<". That usually indicates that the user thought
17256 that the type was a template. */
17261 }
17263 /* The type-specifier must be a user-defined type. */
17265 {
17269 /* Don't gobble tokens or issue error messages if this is an
17270 optional type-specifier. */
17276 /* Look for the optional `::' operator. */
17277 global_p
17281 /* Look for the nested-name specifier. */
17282 qualified_p
17289 /* If we have seen a nested-name-specifier, and the next token
17290 is `template', then we are using the template-id production. */
17293 {
17294 /* Look for the template-id. */
17298 none_type,
17300 /* If the template-id did not name a type, we are out of
17301 luck. */
17303 {
17306 }
17307 }
17308 /* Otherwise, look for a type-name. */
17309 else
17311 /* Keep track of all name-lookups performed in class scopes. */
17313 && !global_p
17314 && !qualified_p
17318 /* If it didn't work out, we don't have a TYPE. */
17323 {
17337 {
17339 none_type,
17349 else
17350 {
17355 }
17356 }
17357 else
17363 }
17366 token,
17368 }
17370 /* If we didn't get a type-name, issue an error message. */
17372 {
17375 }
17378 {
17379 /* See if TYPE is an Objective-C type, and if so, parse and
17380 accept any protocol references following it. Do this before
17381 the cp_parser_check_for_invalid_template_id() call, because
17382 Objective-C types can be followed by '<...>' which would
17383 enclose protocol names rather than template arguments, and so
17384 everything is fine. */
17387 {
17391 /* Clobber the "unqualified" type previously entered into
17392 DECL_SPECS with the new, improved protocol-qualified version. */
17397 }
17399 /* There is no valid C++ program where a non-template type is
17400 followed by a "<". That usually indicates that the user
17401 thought that the type was a template. */
17403 none_type,
17405 }
17408 }
17410 /* Parse a type-name.
17412 type-name:
17413 class-name
17414 enum-name
17415 typedef-name
17416 simple-template-id [in c++0x]
17418 enum-name:
17419 identifier
17421 typedef-name:
17422 identifier
17424 Concepts:
17426 type-name:
17427 concept-name
17428 partial-concept-id
17430 concept-name:
17431 identifier
17433 Returns a TYPE_DECL for the type. */
17435 static tree
17437 {
17439 }
17441 /* See above. */
17442 static tree
17444 {
17445 tree type_decl;
17447 /* We can't know yet whether it is a class-name or not. */
17449 /* Try a class-name. */
17451 typename_keyword_p,
17453 none_type,
17457 /* If it's not a class-name, keep looking. */
17459 {
17461 /* It must be a typedef-name or an enum-name. */
17465 /* It is either a simple-template-id representing an
17466 instantiation of an alias template... */
17470 none_type,
17472 /* Note that this must be an instantiation of an alias template
17473 because [temp.names]/6 says:
17475 A template-id that names an alias template specialization
17476 is a type-name.
17478 Whereas [temp.names]/7 says:
17480 A simple-template-id that names a class template
17481 specialization is a class-name.
17483 With concepts, this could also be a partial-concept-id that
17484 declares a non-type template parameter. */
17491 else
17495 /* ... Or a typedef-name or an enum-name. */
17497 }
17500 }
17502 /* Check if DECL and ARGS can form a constrained-type-specifier.
17503 If ARGS is non-null, we try to form a concept check of the
17504 form DECL<?, ARGS> where ? is a wildcard that matches any
17505 kind of template argument. If ARGS is NULL, then we try to
17506 form a concept check of the form DECL<?>. */
17508 static tree
17511 {
17514 /* If we a constrained-type-specifier cannot be deduced. */
17518 /* A constrained type specifier can only be found in an
17519 overload set or as a reference to a template declaration.
17521 FIXME: This might be masking a bug. It's possible that
17522 that the deduction below is causing template specializations
17523 to be formed with the wildcard as an argument. */
17527 /* Try to build a call expression that evaluates the
17528 concept. This can fail if the overload set refers
17529 only to non-templates. */
17535 /* Deduce the checked constraint and the prototype parameter.
17537 FIXME: In certain cases, failure to deduce should be a
17538 diagnosable error. */
17539 tree conc;
17540 tree proto;
17544 /* In template parameter scope, this results in a constrained
17545 parameter. Return a descriptor of that parm. */
17549 /* In a parameter-declaration-clause, constrained-type
17550 specifiers result in invented template parameters. */
17552 {
17555 }
17556 else
17557 {
17558 /* Otherwise, we're in a context where the constrained
17559 type name is deduced and the constraint applies
17560 after deduction. */
17562 }
17565 }
17567 /* If DECL refers to a concept, return a TYPE_DECL representing
17568 the result of using the constrained type specifier in the
17569 current context. DECL refers to a concept if
17571 - it is an overload set containing a function concept taking a single
17572 type argument, or
17574 - it is a variable concept taking a single type argument. */
17576 static tree
17578 {
17584 else
17586 }
17588 /* Check if DECL and ARGS form a partial-concept-id. If so,
17589 assign ID to the resulting constrained placeholder.
17591 Returns true if the partial-concept-id designates a placeholder
17592 and false otherwise. Note that *id is set to NULL_TREE in
17593 this case. */
17595 static tree
17597 {
17599 }
17601 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17602 or a concept-name.
17604 enum-name:
17605 identifier
17607 typedef-name:
17608 identifier
17610 concept-name:
17611 identifier
17613 Returns a TYPE_DECL for the type. */
17615 static tree
17617 {
17618 tree type_decl;
17619 tree identifier;
17626 /* Look up the type-name. */
17631 /* If we found an overload set, then it may refer to a concept-name. */
17637 {
17638 /* See if this is an Objective-C type. */
17643 }
17645 /* Issue an error if we did not find a type-name. */
17647 /* In Objective-C, we have the complication that class names are
17648 normally type names and start declarations (eg, the
17649 "NSObject" in "NSObject *object;"), but can be used in an
17650 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17651 is an expression. So, a classname followed by a dot is not a
17652 valid type-name. */
17655 {
17660 }
17661 /* Remember that the name was used in the definition of the
17662 current class so that we can check later to see if the
17663 meaning would have been different after the class was
17664 entirely defined. */
17670 }
17672 /* Parse an elaborated-type-specifier. Note that the grammar given
17673 here incorporates the resolution to DR68.
17675 elaborated-type-specifier:
17676 class-key :: [opt] nested-name-specifier [opt] identifier
17677 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17678 enum-key :: [opt] nested-name-specifier [opt] identifier
17679 typename :: [opt] nested-name-specifier identifier
17680 typename :: [opt] nested-name-specifier template [opt]
17681 template-id
17683 GNU extension:
17685 elaborated-type-specifier:
17686 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17687 class-key attributes :: [opt] nested-name-specifier [opt]
17688 template [opt] template-id
17689 enum attributes :: [opt] nested-name-specifier [opt] identifier
17691 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17692 declared `friend'. If IS_DECLARATION is TRUE, then this
17693 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17694 something is being declared.
17696 Returns the TYPE specified. */
17698 static tree
17702 {
17704 tree identifier;
17707 tree globalscope;
17710 /* See if we're looking at the `enum' keyword. */
17712 {
17713 /* Consume the `enum' token. */
17715 /* Remember that it's an enumeration type. */
17717 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17718 enums) is used here. */
17722 {
17729 /* Consume the `struct' or `class' and parse it anyway. */
17731 }
17732 /* Parse the attributes. */
17734 }
17735 /* Or, it might be `typename'. */
17737 RID_TYPENAME))
17738 {
17739 /* Consume the `typename' token. */
17741 /* Remember that it's a `typename' type. */
17743 }
17744 /* Otherwise it must be a class-key. */
17745 else
17746 {
17750 /* Parse the attributes. */
17752 }
17754 /* Look for the `::' operator. */
17757 /* Look for the nested-name-specifier. */
17758 tree nested_name_specifier;
17760 {
17761 nested_name_specifier
17766 is_declaration);
17769 }
17770 else
17771 /* Even though `typename' is not present, the proposed resolution
17772 to Core Issue 180 says that in `class A<T>::B', `B' should be
17773 considered a type-name, even if `A<T>' is dependent. */
17774 nested_name_specifier
17779 is_declaration);
17780 /* For everything but enumeration types, consider a template-id.
17781 For an enumeration type, consider only a plain identifier. */
17783 {
17785 tree decl;
17787 /* Allow the `template' keyword. */
17789 /* If we didn't see `template', we don't know if there's a
17790 template-id or not. */
17793 /* Parse the template-id. */
17797 tag_type,
17798 is_declaration);
17799 /* If we didn't find a template-id, look for an ordinary
17800 identifier. */
17802 ;
17803 /* We can get here when cp_parser_template_id, called by
17804 cp_parser_class_name with tag_type == none_type, succeeds
17805 and caches a BASELINK. Then, when called again here,
17806 instead of failing and returning an error_mark_node
17807 returns it (see template/typename17.C in C++11).
17808 ??? Could we diagnose this earlier? */
17810 {
17813 }
17814 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17815 in effect, then we must assume that, upon instantiation, the
17816 template will correspond to a class. */
17820 typename_type,
17822 /* If the `typename' keyword is in effect and DECL is not a type
17823 decl, then type is non existent. */
17825 ;
17827 {
17831 /* If the next token is a semicolon, this must be a specialization,
17832 instantiation, or friend declaration. Check the scope while we
17833 still know whether or not we had a nested-name-specifier. */
17838 }
17841 }
17844 {
17849 {
17852 }
17854 /* For a `typename', we needn't call xref_tag. */
17860 /* Template parameter lists apply only if we are not within a
17861 function parameter list. */
17862 bool template_parm_lists_apply
17871 /* Look up a qualified name in the usual way. */
17873 {
17874 tree decl;
17875 tree ambiguous_decls;
17878 tag_type,
17885 /* If the lookup was ambiguous, an error will already have been
17886 issued. */
17890 /* If we are parsing friend declaration, DECL may be a
17891 TEMPLATE_DECL tree node here. However, we need to check
17892 whether this TEMPLATE_DECL results in valid code. Consider
17893 the following example:
17895 namespace N {
17896 template <class T> class C {};
17897 }
17898 class X {
17899 template <class T> friend class N::C; // #1, valid code
17900 };
17901 template <class T> class Y {
17902 friend class N::C; // #2, invalid code
17903 };
17905 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17906 name lookup of `N::C'. We see that friend declaration must
17907 be template for the code to be valid. Note that
17908 processing_template_decl does not work here since it is
17909 always 1 for the above two cases. */
17911 decl = (cp_parser_maybe_treat_template_as_class
17916 {
17918 identifier,
17921 }
17924 {
17928 allow_template);
17932 }
17934 /* Forward declarations of nested types, such as
17936 class C1::C2;
17937 class C1::C2::C3;
17939 are invalid unless all components preceding the final '::'
17940 are complete. If all enclosing types are complete, these
17941 declarations become merely pointless.
17943 Invalid forward declarations of nested types are errors
17944 caught elsewhere in parsing. Those that are pointless arrive
17945 here. */
17952 }
17953 else
17954 {
17955 /* An elaborated-type-specifier sometimes introduces a new type and
17956 sometimes names an existing type. Normally, the rule is that it
17957 introduces a new type only if there is not an existing type of
17958 the same name already in scope. For example, given:
17960 struct S {};
17961 void f() { struct S s; }
17963 the `struct S' in the body of `f' is the same `struct S' as in
17964 the global scope; the existing definition is used. However, if
17965 there were no global declaration, this would introduce a new
17966 local class named `S'.
17968 An exception to this rule applies to the following code:
17970 namespace N { struct S; }
17972 Here, the elaborated-type-specifier names a new type
17973 unconditionally; even if there is already an `S' in the
17974 containing scope this declaration names a new type.
17975 This exception only applies if the elaborated-type-specifier
17976 forms the complete declaration:
17978 [class.name]
17980 A declaration consisting solely of `class-key identifier ;' is
17981 either a redeclaration of the name in the current scope or a
17982 forward declaration of the identifier as a class name. It
17983 introduces the name into the current scope.
17985 We are in this situation precisely when the next token is a `;'.
17987 An exception to the exception is that a `friend' declaration does
17988 *not* name a new type; i.e., given:
17990 struct S { friend struct T; };
17992 `T' is not a new type in the scope of `S'.
17994 Also, `new struct S' or `sizeof (struct S)' never results in the
17995 definition of a new type; a new type can only be declared in a
17996 declaration context. */
17998 tag_scope ts;
18002 /* Friends have special name lookup rules. */
18006 CPP_SEMICOLON))
18007 /* This is a `class-key identifier ;' */
18009 else
18012 template_p =
18013 (template_parm_lists_apply
18016 /* An unqualified name was used to reference this type, so
18017 there were no qualifying templates. */
18026 }
18027 }
18032 /* Allow attributes on forward declarations of classes. */
18034 {
18044 else
18047 }
18050 {
18051 /* Indicate whether this class was declared as a `class' or as a
18052 `struct'. */
18056 }
18058 /* A "<" cannot follow an elaborated type specifier. If that
18059 happens, the user was probably trying to form a template-id. */
18064 }
18066 /* Parse an enum-specifier.
18068 enum-specifier:
18069 enum-head { enumerator-list [opt] }
18070 enum-head { enumerator-list , } [C++0x]
18072 enum-head:
18073 enum-key identifier [opt] enum-base [opt]
18074 enum-key nested-name-specifier identifier enum-base [opt]
18076 enum-key:
18077 enum
18078 enum class [C++0x]
18079 enum struct [C++0x]
18081 enum-base: [C++0x]
18082 : type-specifier-seq
18084 opaque-enum-specifier:
18085 enum-key identifier enum-base [opt] ;
18087 GNU Extensions:
18088 enum-key attributes[opt] identifier [opt] enum-base [opt]
18089 { enumerator-list [opt] }attributes[opt]
18090 enum-key attributes[opt] identifier [opt] enum-base [opt]
18091 { enumerator-list, }attributes[opt] [C++0x]
18093 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18094 if the token stream isn't an enum-specifier after all. */
18096 static tree
18098 {
18099 tree identifier;
18101 tree prev_scope;
18103 tree attributes;
18116 /* Parse tentatively so that we can back up if we don't find a
18117 enum-specifier. */
18120 /* Caller guarantees that the current token is 'enum', an identifier
18121 possibly follows, and the token after that is an opening brace.
18122 If we don't have an identifier, fabricate an anonymous name for
18123 the enumeration being defined. */
18126 /* Parse the "class" or "struct", which indicates a scoped
18127 enumeration type in C++0x. */
18130 {
18134 /* Consume the `struct' or `class' token. */
18138 }
18142 /* Clear the qualification. */
18147 /* Figure out in what scope the declaration is being placed. */
18153 nested_name_specifier
18161 {
18162 tree name;
18166 enum_type,
18171 input_location);
18173 {
18176 {
18177 /* Are template enums allowed in ISO? */
18181 /* ignore a typename reference, for it will be solved by name
18182 in start_enum. */
18184 }
18185 }
18188 else
18189 {
18194 }
18195 }
18196 else
18197 {
18200 else
18201 {
18207 }
18208 }
18211 /* Check for the `:' that denotes a specified underlying type in C++0x.
18212 Note that a ':' could also indicate a bitfield width, however. */
18214 {
18215 cp_decl_specifier_seq type_specifiers;
18217 /* Consume the `:'. */
18220 /* Parse the type-specifier-seq. */
18225 /* At this point this is surely not elaborated type specifier. */
18234 /* If that didn't work, stop. */
18236 {
18242 }
18243 }
18245 /* Look for the `{' but don't consume it yet. */
18247 {
18249 {
18252 {
18255 }
18256 }
18257 /* An opaque-enum-specifier must have a ';' here. */
18260 {
18263 {
18266 }
18267 }
18268 }
18274 {
18276 {
18280 }
18282 {
18284 }
18285 }
18287 /* Issue an error message if type-definitions are forbidden here. */
18290 else
18291 /* Create the new type. We do this before consuming the opening
18292 brace so the enum will be recorded as being on the line of its
18293 tag (or the 'enum' keyword, if there is no tag). */
18297 /* If the next token is not '{' it is an opaque-enum-specifier or an
18298 elaborated-type-specifier. */
18300 {
18304 {
18305 /* The following catches invalid code such as:
18306 enum class S<int>::E { A, B, C }; */
18314 {
18318 nested_name_specifier);
18320 }
18323 {
18325 "%qT for enum declaration does not name a class "
18328 }
18329 /* If that scope does not contain the scope in which the
18330 class was originally declared, the program is invalid. */
18332 nested_name_specifier))
18333 {
18336 "declaration of %qD in namespace %qD which does not "
18339 else
18341 "declaration of %qD in %qD which does not "
18345 }
18346 /* If that scope is the scope where the declaration is being placed
18347 the program is invalid. */
18351 {
18355 }
18356 }
18361 /* Consume the opening brace. */
18362 matching_braces braces;
18369 {
18373 }
18374 else
18375 {
18381 }
18385 /* If the next token is not '}', then there are some enumerators. */
18387 {
18391 }
18392 else
18395 /* Consume the final '}'. */
18401 }
18402 else
18403 {
18404 /* If a ';' follows, then it is an opaque-enum-specifier
18405 and additional restrictions apply. */
18407 {
18414 }
18415 }
18417 /* Look for trailing attributes to apply to this enumeration, and
18418 apply them if appropriate. */
18420 {
18423 trailing_attr,
18425 }
18427 /* Finish up the enumeration. */
18429 {
18434 }
18437 {
18439 {
18442 }
18444 {
18446 }
18447 }
18448 out:
18451 }
18453 /* Parse an enumerator-list. The enumerators all have the indicated
18454 TYPE.
18456 enumerator-list:
18457 enumerator-definition
18458 enumerator-list , enumerator-definition */
18460 static void
18462 {
18464 {
18465 /* Parse an enumerator-definition. */
18468 /* If the next token is not a ',', we've reached the end of
18469 the list. */
18472 /* Otherwise, consume the `,' and keep going. */
18474 /* If the next token is a `}', there is a trailing comma. */
18476 {
18481 }
18482 }
18483 }
18485 /* Parse an enumerator-definition. The enumerator has the indicated
18486 TYPE.
18488 enumerator-definition:
18489 enumerator
18490 enumerator = constant-expression
18492 enumerator:
18493 identifier
18495 GNU Extensions:
18497 enumerator-definition:
18498 enumerator attributes [opt]
18499 enumerator attributes [opt] = constant-expression */
18501 static void
18503 {
18504 tree identifier;
18505 tree value;
18506 location_t loc;
18508 /* Save the input location because we are interested in the location
18509 of the identifier and not the location of the explicit value. */
18512 /* Look for the identifier. */
18517 /* Parse any specified attributes. */
18520 /* If the next token is an '=', then there is an explicit value. */
18522 {
18523 /* Consume the `=' token. */
18525 /* Parse the value. */
18527 }
18528 else
18531 /* If we are processing a template, make sure the initializer of the
18532 enumerator doesn't contain any bare template parameter pack. */
18536 /* Create the enumerator. */
18538 }
18540 /* Parse a namespace-name.
18542 namespace-name:
18543 original-namespace-name
18544 namespace-alias
18546 Returns the NAMESPACE_DECL for the namespace. */
18548 static tree
18550 {
18551 tree identifier;
18552 tree namespace_decl;
18556 /* Get the name of the namespace. */
18561 /* Look up the identifier in the currently active scope. Look only
18562 for namespaces, due to:
18564 [basic.lookup.udir]
18566 When looking up a namespace-name in a using-directive or alias
18567 definition, only namespace names are considered.
18569 And:
18571 [basic.lookup.qual]
18573 During the lookup of a name preceding the :: scope resolution
18574 operator, object, function, and enumerator names are ignored.
18576 (Note that cp_parser_qualifying_entity only calls this
18577 function if the token after the name is the scope resolution
18578 operator.) */
18580 none_type,
18586 /* If it's not a namespace, issue an error. */
18589 {
18591 {
18597 }
18600 }
18603 }
18605 /* Parse a namespace-definition.
18607 namespace-definition:
18608 named-namespace-definition
18609 unnamed-namespace-definition
18611 named-namespace-definition:
18612 original-namespace-definition
18613 extension-namespace-definition
18615 original-namespace-definition:
18616 namespace identifier { namespace-body }
18618 extension-namespace-definition:
18619 namespace original-namespace-name { namespace-body }
18621 unnamed-namespace-definition:
18622 namespace { namespace-body } */
18624 static void
18626 {
18627 tree identifier;
18636 {
18639 }
18641 /* Look for the `namespace' keyword. */
18642 cp_token* token
18645 /* Parse any specified attributes before the identifier. */
18649 {
18653 {
18658 "standard attributes on namespaces must precede "
18661 /* Parse any attributes specified after the identifier. */
18663 }
18670 "nested namespace definitions only available with "
18673 /* Nested namespace names can create new namespaces (unlike
18674 other qualified-ids). */
18677 else
18680 }
18692 /* Start the namespace. */
18699 /* Look for the `{' to validate starting the namespace. */
18700 matching_braces braces;
18702 {
18703 /* Parse the body of the namespace. */
18706 /* Look for the final `}'. */
18708 }
18713 /* Pop the nested namespace definitions. */
18716 }
18718 /* Parse a namespace-body.
18720 namespace-body:
18721 declaration-seq [opt] */
18723 static void
18725 {
18727 }
18729 /* Parse a namespace-alias-definition.
18731 namespace-alias-definition:
18732 namespace identifier = qualified-namespace-specifier ; */
18734 static void
18736 {
18737 tree identifier;
18738 tree namespace_specifier;
18742 /* Look for the `namespace' keyword. */
18744 /* Look for the identifier. */
18748 /* Look for the `=' token. */
18751 {
18753 /* Skip the definition. */
18758 }
18760 /* Look for the qualified-namespace-specifier. */
18761 namespace_specifier
18763 /* Look for the `;' token. */
18766 /* Register the alias in the symbol table. */
18768 }
18770 /* Parse a qualified-namespace-specifier.
18772 qualified-namespace-specifier:
18773 :: [opt] nested-name-specifier [opt] namespace-name
18775 Returns a NAMESPACE_DECL corresponding to the specified
18776 namespace. */
18778 static tree
18780 {
18781 /* Look for the optional `::'. */
18785 /* Look for the optional nested-name-specifier. */
18793 }
18795 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18796 access declaration.
18798 using-declaration:
18799 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18800 using :: unqualified-id ;
18802 access-declaration:
18803 qualified-id ;
18805 */
18807 static bool
18810 {
18814 tree decl;
18815 tree identifier;
18816 tree qscope;
18821 {
18824 }
18825 else
18826 {
18827 /* Look for the `using' keyword. */
18830 again:
18831 /* Peek at the next token. */
18833 /* See if it's `typename'. */
18835 {
18836 /* Remember that we've seen it. */
18838 /* Consume the `typename' token. */
18840 }
18841 }
18843 /* Look for the optional global scope qualification. */
18844 global_scope_p
18849 /* If we saw `typename', or didn't see `::', then there must be a
18850 nested-name-specifier present. */
18852 {
18858 {
18861 }
18862 }
18863 /* Otherwise, we could be in either of the two productions. In that
18864 case, treat the nested-name-specifier as optional. */
18865 else
18877 /* Something has already gone wrong; there's no need to parse
18878 further. Since an error has occurred, the return value of
18879 cp_parser_parse_definitely will be false, as required. */
18883 /* Parse the unqualified-id. */
18891 {
18896 }
18898 {
18903 "pack expansion in using-declaration only available "
18906 }
18908 /* The function we call to handle a using-declaration is different
18909 depending on what scope we are in. */
18911 ;
18914 /* [namespace.udecl]
18916 A using declaration shall not name a template-id. */
18919 else
18920 {
18922 {
18923 /* Create the USING_DECL. */
18930 {
18933 }
18934 else
18935 /* Add it to the list of members in this class. */
18937 }
18938 else
18939 {
18941 identifier,
18948 {
18951 }
18954 else
18956 }
18957 }
18961 {
18965 "comma-separated list in using-declaration only available "
18968 }
18970 /* Look for the final `;'. */
18975 "access declarations are deprecated "
18976 "in favour of using-declarations; "
18980 }
18982 /* Parse an alias-declaration.
18984 alias-declaration:
18985 using identifier attribute-specifier-seq [opt] = type-id */
18987 static tree
18989 {
18991 location_t id_location;
18993 cp_decl_specifier_seq decl_specs;
18997 /* Look for the `using' keyword. */
18998 cp_token *using_token
19020 /* Now we are going to parse the type-id of the declaration. */
19022 /*
19023 [dcl.type]/3 says:
19025 "A type-specifier-seq shall not define a class or enumeration
19026 unless it appears in the type-id of an alias-declaration (7.1.3) that
19027 is not the declaration of a template-declaration."
19029 In other words, if we currently are in an alias template, the
19030 type-id should not define a type.
19032 So let's set parser->type_definition_forbidden_message in that
19033 case; cp_parser_check_type_definition (called by
19034 cp_parser_class_specifier) will then emit an error if a type is
19035 defined in the type-id. */
19037 {
19041 }
19045 /* Restore the error message if need be. */
19051 {
19054 }
19056 /* A typedef-name can also be introduced by an alias-declaration. The
19057 identifier following the using keyword becomes a typedef-name. It has
19058 the same semantics as if it were introduced by the typedef
19059 specifier. In particular, it does not define a new type and it shall
19060 not appear in the type-id. */
19065 {
19068 ds_attribute,
19069 attrs_token);
19070 }
19072 ds_typedef,
19073 using_token);
19075 ds_alias,
19076 using_token);
19082 id_location,
19093 else
19099 // Attach constraints to the alias declaration.
19101 {
19105 }
19112 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19113 added into the symbol table; otherwise, return the TYPE_DECL. */
19117 {
19121 }
19124 }
19126 /* Parse a using-directive.
19128 using-directive:
19129 using namespace :: [opt] nested-name-specifier [opt]
19130 namespace-name ; */
19132 static void
19134 {
19135 tree namespace_decl;
19136 tree attribs;
19138 /* Look for the `using' keyword. */
19140 /* And the `namespace' keyword. */
19142 /* Look for the optional `::' operator. */
19144 /* And the optional nested-name-specifier. */
19150 /* Get the namespace being used. */
19152 /* And any specified attributes. */
19155 /* Update the symbol table. */
19158 else
19161 /* Look for the final `;'. */
19163 }
19165 /* Parse an asm-definition.
19167 asm-definition:
19168 asm ( string-literal ) ;
19170 GNU Extension:
19172 asm-definition:
19173 asm volatile [opt] ( string-literal ) ;
19174 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19175 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19176 : asm-operand-list [opt] ) ;
19177 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19178 : asm-operand-list [opt]
19179 : asm-clobber-list [opt] ) ;
19180 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19181 : asm-clobber-list [opt]
19182 : asm-goto-list ) ; */
19184 static void
19186 {
19187 tree string;
19192 tree asm_stmt;
19200 /* Look for the `asm' keyword. */
19205 {
19208 }
19210 /* See if the next token is `volatile'. */
19213 {
19214 /* Remember that we saw the `volatile' keyword. */
19216 /* Consume the token. */
19218 }
19222 {
19223 /* Remember that we saw the `goto' keyword. */
19225 /* Consume the token. */
19227 }
19228 /* Look for the opening `('. */
19231 /* Look for the string. */
19234 {
19238 }
19240 /* If we're allowing GNU extensions, check for the extended assembly
19241 syntax. Unfortunately, the `:' tokens need not be separated by
19242 a space in C, and so, for compatibility, we tolerate that here
19243 too. Doing that means that we have to treat the `::' operator as
19244 two `:' tokens. */
19249 {
19254 /* The extended syntax was used. */
19257 /* Look for outputs. */
19259 {
19260 /* Consume the `:'. */
19262 /* Parse the output-operands. */
19264 CPP_COLON)
19266 CPP_SCOPE)
19268 CPP_CLOSE_PAREN)
19270 {
19274 }
19275 }
19276 /* If the next token is `::', there are no outputs, and the
19277 next token is the beginning of the inputs. */
19279 /* The inputs are coming next. */
19282 /* Look for inputs. */
19285 {
19286 /* Consume the `:' or `::'. */
19288 /* Parse the output-operands. */
19290 CPP_COLON)
19292 CPP_SCOPE)
19294 CPP_CLOSE_PAREN))
19295 {
19299 }
19300 }
19302 /* The clobbers are coming next. */
19305 /* Look for clobbers. */
19308 {
19310 /* Consume the `:' or `::'. */
19312 /* Parse the clobbers. */
19314 CPP_COLON)
19316 CPP_CLOSE_PAREN))
19318 }
19321 /* The labels are coming next. */
19324 /* Look for labels. */
19327 {
19329 /* Consume the `:' or `::'. */
19331 /* Parse the labels. */
19333 }
19337 }
19341 /* Look for the closing `)'. */
19349 {
19350 /* Create the ASM_EXPR. */
19352 {
19355 /* If the extended syntax was not used, mark the ASM_EXPR. */
19357 {
19363 }
19364 }
19365 else
19367 }
19368 }
19370 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19371 type that comes from the decl-specifier-seq. */
19373 static tree
19375 {
19378 {
19391 }
19394 }
19396 /* Declarators [gram.dcl.decl] */
19398 /* Parse an init-declarator.
19400 init-declarator:
19401 declarator initializer [opt]
19403 GNU Extension:
19405 init-declarator:
19406 declarator asm-specification [opt] attributes [opt] initializer [opt]
19408 function-definition:
19409 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19410 function-body
19411 decl-specifier-seq [opt] declarator function-try-block
19413 GNU Extension:
19415 function-definition:
19416 __extension__ function-definition
19418 TM Extension:
19420 function-definition:
19421 decl-specifier-seq [opt] declarator function-transaction-block
19423 The DECL_SPECIFIERS apply to this declarator. Returns a
19424 representation of the entity declared. If MEMBER_P is TRUE, then
19425 this declarator appears in a class scope. The new DECL created by
19426 this declarator is returned.
19428 The CHECKS are access checks that should be performed once we know
19429 what entity is being declared (and, therefore, what classes have
19430 befriended it).
19432 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19433 for a function-definition here as well. If the declarator is a
19434 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19435 be TRUE upon return. By that point, the function-definition will
19436 have been completely parsed.
19438 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19439 is FALSE.
19441 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19442 parsed declaration if it is an uninitialized single declarator not followed
19443 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19444 if present, will not be consumed. If returned, this declarator will be
19445 created with SD_INITIALIZED but will not call cp_finish_decl.
19447 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19448 and there is an initializer, the pointed location_t is set to the
19449 location of the '=' or `(', or '{' in C++11 token introducing the
19450 initializer. */
19452 static tree
19463 {
19467 tree prefix_attributes;
19469 tree asm_specification;
19470 tree initializer;
19472 tree scope;
19474 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19475 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19476 "(...)". */
19487 /* Gather the attributes that were provided with the
19488 decl-specifiers. */
19491 /* Assume that this is not the declarator for a function
19492 definition. */
19496 /* Default arguments are only permitted for function parameters. */
19500 /* Defer access checks while parsing the declarator; we cannot know
19501 what names are accessible until we know what is being
19502 declared. */
19507 /* Parse the declarator. */
19508 declarator
19513 /* Gather up the deferred checks. */
19518 /* If the DECLARATOR was erroneous, there's no need to go
19519 further. */
19523 /* Check that the number of template-parameter-lists is OK. */
19533 /* Figure out what scope the entity declared by the DECLARATOR is
19534 located in. `grokdeclarator' sometimes changes the scope, so
19535 we compute it now. */
19538 /* Perform any lookups in the declared type which were thought to be
19539 dependent, but are not in the scope of the declarator. */
19540 decl_specifiers->type
19543 /* If we're allowing GNU extensions, look for an
19544 asm-specification. */
19546 {
19547 /* Look for an asm-specification. */
19550 }
19551 else
19554 /* Look for attributes. */
19558 /* Peek at the next token. */
19564 {
19565 /* Handle C++17 deduction guides. */
19569 {
19577 {
19581 }
19582 }
19584 /* Check to see if the token indicates the start of a
19585 function-definition. */
19587 {
19589 {
19590 /* If a function-definition should not appear here, issue an
19591 error message. */
19595 }
19597 location_t func_brace_location
19600 /* Neither attributes nor an asm-specification are allowed
19601 on a function-definition. */
19604 "an asm-specification is not allowed "
19608 "attributes are not allowed "
19610 /* This is a function-definition. */
19613 /* Parse the function definition. */
19616 decl_specifiers,
19617 declarator,
19618 prefix_attributes);
19619 else
19620 decl =
19621 (cp_parser_function_definition_from_specifiers_and_declarator
19625 {
19626 /* This is where the prologue starts... */
19629 }
19632 }
19633 }
19635 {
19636 /* A non-template declaration involving a function parameter list
19637 containing an implicit template parameter will be made into a
19638 template. If the resulting declaration is not going to be an
19639 actual function then finish the template scope here to prevent it.
19640 An error message will be issued once we have a decl to talk about.
19642 FIXME probably we should do type deduction rather than create an
19643 implicit template, but the standard currently doesn't allow it. */
19646 }
19648 /* [dcl.dcl]
19650 Only in function declarations for constructors, destructors, type
19651 conversions, and deduction guides can the decl-specifier-seq be omitted.
19653 We explicitly postpone this check past the point where we handle
19654 function-definitions because we tolerate function-definitions
19655 that are missing their return types in some modes. */
19657 {
19661 }
19663 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19667 {
19678 {
19684 }
19685 }
19686 else
19687 {
19688 /* If the init-declarator isn't initialized and isn't followed by a
19689 `,' or `;', it's not a valid init-declarator. */
19692 {
19695 else
19696 {
19700 }
19701 }
19704 }
19706 /* Because start_decl has side-effects, we should only call it if we
19707 know we're going ahead. By this point, we know that we cannot
19708 possibly be looking at any other construct. */
19711 /* Enter the newly declared entry in the symbol table. If we're
19712 processing a declaration in a class-specifier, we wait until
19713 after processing the initializer. */
19715 {
19723 /* Adjust location of decl if declarator->id_loc is more appropriate:
19724 set, and decl wasn't merged with another decl, in which case its
19725 location would be different from input_location, and more accurate. */
19730 }
19732 /* Enter the SCOPE. That way unqualified names appearing in the
19733 initializer will be looked up in SCOPE. */
19736 /* Perform deferred access control checks, now that we know in which
19737 SCOPE the declared entity resides. */
19739 {
19742 /* If the entity being declared is a function, pretend that we
19743 are in its scope. If it is a `friend', it may have access to
19744 things that would not otherwise be accessible. */
19746 {
19749 }
19751 /* Perform access checks for template parameters. */
19754 /* Perform the access control checks for the declarator and the
19755 decl-specifiers. */
19758 /* Restore the saved value. */
19761 }
19763 /* Parse the initializer. */
19768 {
19770 {
19773 else
19774 {
19775 /* If the declaration was erroneous, we don't really
19776 know what the user intended, so just silently
19777 consume the initializer. */
19784 }
19785 }
19786 else
19787 {
19788 /* We want to record the extra mangling scope for in-class
19789 initializers of class members and initializers of static data
19790 member templates. The former involves deferring
19791 parsing of the initializer until end of class as with default
19792 arguments. So right here we only handle the latter. */
19802 }
19803 }
19805 /* The old parser allows attributes to appear after a parenthesized
19806 initializer. Mark Mitchell proposed removing this functionality
19807 on the GCC mailing lists on 2002-08-13. This parser accepts the
19808 attributes -- but ignores them. Made a permerror in GCC 8. */
19814 {
19817 {
19821 }
19822 }
19824 /* And now complain about a non-function implicit template. */
19829 /* For an in-class declaration, use `grokfield' to create the
19830 declaration. */
19832 {
19834 {
19837 }
19846 }
19848 /* Finish processing the declaration. But, skip member
19849 declarations. */
19851 {
19854 asm_specification,
19855 /* If the initializer is in parentheses, then this is
19856 a direct-initialization, which means that an
19857 `explicit' constructor is OK. Otherwise, an
19858 `explicit' constructor cannot be used. */
19861 }
19864 /* Core issue #226 (C++0x only): A default template-argument
19865 shall not be specified in a friend class template
19866 declaration. */
19875 {
19878 else
19880 }
19887 }
19889 /* Parse a declarator.
19891 declarator:
19892 direct-declarator
19893 ptr-operator declarator
19895 abstract-declarator:
19896 ptr-operator abstract-declarator [opt]
19897 direct-abstract-declarator
19899 GNU Extensions:
19901 declarator:
19902 attributes [opt] direct-declarator
19903 attributes [opt] ptr-operator declarator
19905 abstract-declarator:
19906 attributes [opt] ptr-operator abstract-declarator [opt]
19907 attributes [opt] direct-abstract-declarator
19909 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19910 detect constructors, destructors, deduction guides, or conversion operators.
19911 It is set to -1 if the declarator is a name, and +1 if it is a
19912 function. Otherwise it is set to zero. Usually you just want to
19913 test for >0, but internally the negative value is used.
19915 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19916 a decl-specifier-seq unless it declares a constructor, destructor,
19917 or conversion. It might seem that we could check this condition in
19918 semantic analysis, rather than parsing, but that makes it difficult
19919 to handle something like `f()'. We want to notice that there are
19920 no decl-specifiers, and therefore realize that this is an
19921 expression, not a declaration.)
19923 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19924 the declarator is a direct-declarator of the form "(...)".
19926 MEMBER_P is true iff this declarator is a member-declarator.
19928 FRIEND_P is true iff this declarator is a friend. */
19932 cp_parser_declarator_kind dcl_kind,
19936 {
19939 cp_cv_quals cv_quals;
19940 tree class_type;
19943 /* Assume this is not a constructor, destructor, or type-conversion
19944 operator. */
19951 /* Check for the ptr-operator production. */
19953 /* Parse the ptr-operator. */
19959 /* If that worked, then we have a ptr-operator. */
19961 {
19962 /* If a ptr-operator was found, then this declarator was not
19963 parenthesized. */
19966 /* The dependent declarator is optional if we are parsing an
19967 abstract-declarator. */
19971 /* Parse the dependent declarator. */
19976 friend_p);
19978 /* If we are parsing an abstract-declarator, we must handle the
19979 case where the dependent declarator is absent. */
19984 declarator = cp_parser_make_indirect_declarator
19986 }
19987 /* Everything else is a direct-declarator. */
19988 else
19989 {
19992 CPP_OPEN_PAREN);
19994 ctor_dtor_or_conv_p,
19996 }
20001 }
20003 /* Parse a direct-declarator or direct-abstract-declarator.
20005 direct-declarator:
20006 declarator-id
20007 direct-declarator ( parameter-declaration-clause )
20008 cv-qualifier-seq [opt]
20009 ref-qualifier [opt]
20010 exception-specification [opt]
20011 direct-declarator [ constant-expression [opt] ]
20012 ( declarator )
20014 direct-abstract-declarator:
20015 direct-abstract-declarator [opt]
20016 ( parameter-declaration-clause )
20017 cv-qualifier-seq [opt]
20018 ref-qualifier [opt]
20019 exception-specification [opt]
20020 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20021 ( abstract-declarator )
20023 Returns a representation of the declarator. DCL_KIND is
20024 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20025 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20026 we are parsing a direct-declarator. It is
20027 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20028 of ambiguity we prefer an abstract declarator, as per
20029 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20030 as for cp_parser_declarator. */
20034 cp_parser_declarator_kind dcl_kind,
20037 {
20048 {
20049 /* Peek at the next token. */
20052 {
20053 /* This is either a parameter-declaration-clause, or a
20054 parenthesized declarator. When we know we are parsing a
20055 named declarator, it must be a parenthesized declarator
20056 if FIRST is true. For instance, `(int)' is a
20057 parameter-declaration-clause, with an omitted
20058 direct-abstract-declarator. But `((*))', is a
20059 parenthesized abstract declarator. Finally, when T is a
20060 template parameter `(T)' is a
20061 parameter-declaration-clause, and not a parenthesized
20062 named declarator.
20064 We first try and parse a parameter-declaration-clause,
20065 and then try a nested declarator (if FIRST is true).
20067 It is not an error for it not to be a
20068 parameter-declaration-clause, even when FIRST is
20069 false. Consider,
20071 int i (int);
20072 int i (3);
20074 The first is the declaration of a function while the
20075 second is the definition of a variable, including its
20076 initializer.
20078 Having seen only the parenthesis, we cannot know which of
20079 these two alternatives should be selected. Even more
20080 complex are examples like:
20082 int i (int (a));
20083 int i (int (3));
20085 The former is a function-declaration; the latter is a
20086 variable initialization.
20088 Thus again, we try a parameter-declaration-clause, and if
20089 that fails, we back out and return. */
20092 {
20093 tree params;
20098 /* In a member-declarator, the only valid interpretation
20099 of a parenthesis is the start of a
20100 parameter-declaration-clause. (It is invalid to
20101 initialize a static data member with a parenthesized
20102 initializer; only the "=" form of initialization is
20103 permitted.) */
20107 /* Consume the `('. */
20108 matching_parens parens;
20111 {
20112 /* If this is going to be an abstract declarator, we're
20113 in a declarator and we can't have default args. */
20116 }
20120 /* Parse the parameter-declaration-clause. */
20123 /* Consume the `)'. */
20126 /* If all went well, parse the cv-qualifier-seq,
20127 ref-qualifier and the exception-specification. */
20129 {
20130 cp_cv_quals cv_quals;
20131 cp_virt_specifiers virt_specifiers;
20132 cp_ref_qualifier ref_qual;
20133 tree exception_specification;
20134 tree late_return;
20135 tree attrs;
20145 /* Parse the cv-qualifier-seq. */
20147 /* Parse the ref-qualifier. */
20149 /* Parse the tx-qualifier. */
20151 /* And the exception-specification. */
20152 exception_specification
20157 /* In here, we handle cases where attribute is used after
20158 the function declaration. For example:
20159 void func (int x) __attribute__((vector(..))); */
20162 late_return = (cp_parser_late_return_type_opt
20166 /* Parse the virt-specifier-seq. */
20169 /* Create the function-declarator. */
20171 params,
20172 cv_quals,
20173 virt_specifiers,
20174 ref_qual,
20175 tx_qual,
20176 exception_specification,
20177 late_return,
20178 requires_clause);
20181 /* Any subsequent parameter lists are to do with
20182 return type, so are not those of the declared
20183 function. */
20185 }
20187 /* Remove the function parms from scope. */
20191 /* Repeat the main loop. */
20193 }
20195 /* If this is the first, we can try a parenthesized
20196 declarator. */
20198 {
20205 /* Consume the `('. */
20206 matching_parens parens;
20208 /* Parse the nested declarator. */
20211 declarator
20217 /* Expect a `)'. */
20225 }
20226 /* Otherwise, we must be done. */
20227 else
20229 }
20233 {
20234 /* Parse an array-declarator. */
20244 /* Consume the `['. */
20246 /* Peek at the next token. */
20248 /* If the next token is `]', then there is no
20249 constant-expression. */
20251 {
20253 bounds
20263 {
20264 /* Normally, the array bound must be an integral constant
20265 expression. However, as an extension, we allow VLAs
20266 in function scopes as long as they aren't part of a
20267 parameter declaration. */
20271 }
20274 {
20275 /* Remember this wasn't a constant-expression. */
20278 }
20279 }
20280 else
20282 /* Look for the closing `]'. */
20284 {
20287 }
20292 }
20294 {
20295 {
20296 tree qualifying_scope;
20297 tree unqualified_name;
20298 tree attrs;
20299 special_function_kind sfk;
20304 /* Parse a declarator-id */
20307 {
20310 /* If we see an ellipsis, we should be looking at a
20311 parameter pack. */
20313 {
20314 /* Consume the `...' */
20318 }
20319 }
20322 unqualified_name
20326 {
20330 {
20331 /* Check whether an error occurred. */
20334 /* We already consumed the ellipsis to mark a
20335 parameter pack, but we have no way to report it,
20336 so abort the tentative parse. We will be exiting
20337 immediately anyway. */
20339 }
20340 else
20346 && (qualifying_scope
20348 {
20351 }
20352 }
20357 {
20362 }
20368 {
20369 /* In the declaration of a member of a template class
20370 outside of the class itself, the SCOPE will sometimes
20371 be a TYPENAME_TYPE. For example, given:
20373 template <typename T>
20374 int S<T>::R::i = 3;
20376 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20377 this context, we must resolve S<T>::R to an ordinary
20378 type, rather than a typename type.
20380 The reason we normally avoid resolving TYPENAME_TYPEs
20381 is that a specialization of `S' might render
20382 `S<T>::R' not a type. However, if `S' is
20383 specialized, then this `i' will not be used, so there
20384 is no harm in resolving the types here. */
20385 tree type;
20387 /* Resolve the TYPENAME_TYPE. */
20390 /* If that failed, the declarator is invalid. */
20392 {
20395 "cannot define member of dependent typedef "
20397 else
20402 }
20404 }
20409 {
20410 tree class_type;
20415 else
20419 {
20423 {
20424 /* We do not attempt to print the declarator
20425 here because we do not have enough
20426 information about its original syntactic
20427 form. */
20431 }
20434 {
20438 "use %<%T::%D%> instead of %<%T::%D%> to "
20440 class_type,
20445 }
20447 }
20450 {
20457 for an unnamed type, even if the type
20458 got a name for linkage purposes. */
20460 /* Handle correctly (c++/19200):
20462 struct S {
20463 struct T{};
20464 friend void S(T);
20465 };
20467 and also:
20469 namespace N {
20470 void S();
20471 }
20473 struct S {
20474 friend void N::S();
20475 }; */
20478 class_type))
20487 }
20488 }
20490 unqualified_name,
20491 sfk);
20498 }
20500 handle_declarator:;
20503 {
20504 /* Any names that appear after the declarator-id for a
20505 member are looked up in the containing scope. */
20507 {
20508 /* But declarations with qualified-ids can't appear in a
20509 function. */
20513 }
20515 }
20519 /* Default args are only allowed on function
20520 declarations. */
20522 else
20526 }
20527 /* We're done. */
20528 else
20530 }
20532 /* For an abstract declarator, we might wind up with nothing at this
20533 point. That's an error; the declarator is not optional. */
20537 {
20538 /* Record overly parenthesized declarator so we can give a
20539 diagnostic about confusing decl/expr disambiguation. */
20541 {
20542 /* If the open and close parens are on different lines, this
20543 is probably a formatting thing, so ignore. */
20548 }
20551 }
20553 /* If we entered a scope, we must exit it now. */
20561 }
20563 /* Parse a ptr-operator.
20565 ptr-operator:
20566 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20567 * cv-qualifier-seq [opt]
20568 &
20569 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20570 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20572 GNU Extension:
20574 ptr-operator:
20575 & cv-qualifier-seq [opt]
20577 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20578 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20579 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20580 filled in with the TYPE containing the member. *CV_QUALS is
20581 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20582 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20583 Note that the tree codes returned by this function have nothing
20584 to do with the types of trees that will be eventually be created
20585 to represent the pointer or reference type being parsed. They are
20586 just constants with suggestive names. */
20587 static enum tree_code
20592 {
20597 /* Assume that it's not a pointer-to-member. */
20599 /* And that there are no cv-qualifiers. */
20602 /* Peek at the next token. */
20605 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20615 {
20616 /* Consume the `*', `&' or `&&'. */
20619 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20620 `&', if we are allowing GNU extensions. (The only qualifier
20621 that can legally appear after `&' is `restrict', but that is
20622 enforced during semantic analysis. */
20630 }
20631 else
20632 {
20633 /* Try the pointer-to-member case. */
20635 /* Look for the optional `::' operator. */
20638 /* Look for the nested-name specifier. */
20645 /* If we found it, and the next token is a `*', then we are
20646 indeed looking at a pointer-to-member operator. */
20649 {
20650 /* Indicate that the `*' operator was used. */
20658 else
20659 {
20660 /* The type of which the member is a member is given by the
20661 current SCOPE. */
20663 /* The next name will not be qualified. */
20667 /* Look for optional c++11 attributes. */
20671 /* Look for the optional cv-qualifier-seq. */
20673 }
20674 }
20675 /* If that didn't work we don't have a ptr-operator. */
20678 }
20681 }
20683 /* Parse an (optional) cv-qualifier-seq.
20685 cv-qualifier-seq:
20686 cv-qualifier cv-qualifier-seq [opt]
20688 cv-qualifier:
20689 const
20690 volatile
20692 GNU Extension:
20694 cv-qualifier:
20695 __restrict__
20697 Returns a bitmask representing the cv-qualifiers. */
20699 static cp_cv_quals
20701 {
20705 {
20707 cp_cv_quals cv_qualifier;
20709 /* Peek at the next token. */
20711 /* See if it's a cv-qualifier. */
20713 {
20729 }
20735 {
20740 }
20741 else
20742 {
20745 }
20746 }
20749 }
20751 /* Parse an (optional) ref-qualifier
20753 ref-qualifier:
20754 &
20755 &&
20757 Returns cp_ref_qualifier representing ref-qualifier. */
20759 static cp_ref_qualifier
20761 {
20764 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20769 {
20774 {
20786 }
20791 {
20794 }
20795 else
20796 {
20799 }
20800 }
20803 }
20805 /* Parse an optional tx-qualifier.
20807 tx-qualifier:
20808 transaction_safe
20809 transaction_safe_dynamic */
20811 static tree
20813 {
20816 {
20821 {
20825 {
20828 {
20831 }
20832 else
20834 }
20835 }
20836 }
20838 }
20840 /* Parse an (optional) virt-specifier-seq.
20842 virt-specifier-seq:
20843 virt-specifier virt-specifier-seq [opt]
20845 virt-specifier:
20846 override
20847 final
20849 Returns a bitmask representing the virt-specifiers. */
20851 static cp_virt_specifiers
20853 {
20857 {
20859 cp_virt_specifiers virt_specifier;
20861 /* Peek at the next token. */
20863 /* See if it's a virt-specifier-qualifier. */
20867 {
20870 }
20872 {
20875 }
20877 {
20879 }
20880 else
20884 {
20889 }
20890 else
20891 {
20894 }
20895 }
20897 }
20899 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20900 is in scope even though it isn't real. */
20902 void
20904 {
20905 tree this_parm;
20908 {
20909 /* We don't clear this between NSDMIs. Is it already what we want? */
20916 }
20919 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20921 current_class_ref
20924 }
20926 /* Return true iff our current scope is a non-static data member
20927 initializer. */
20929 bool
20931 {
20932 /* We recognize NSDMI context by the context-less 'this' pointer set up
20933 by the function above. */
20939 }
20941 /* Parse a late-specified return type, if any. This is not a separate
20942 non-terminal, but part of a function declarator, which looks like
20944 -> trailing-type-specifier-seq abstract-declarator(opt)
20946 Returns the type indicated by the type-id.
20948 In addition to this, parse any queued up #pragma omp declare simd
20949 clauses, and #pragma acc routine clauses.
20951 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20952 function. */
20954 static tree
20957 {
20961 && declarator
20965 && declarator
20968 /* Peek at the next token. */
20970 /* A late-specified return type is indicated by an initial '->'. */
20981 {
20982 /* DR 1207: 'this' is in scope in the trailing return type. */
20984 }
20987 {
20988 /* Consume the ->. */
20992 }
20994 /* Function declarations may be followed by a trailing
20995 requires-clause. */
20999 declarator->attributes
21003 declarator->attributes
21008 {
21011 }
21014 }
21016 /* Parse a declarator-id.
21018 declarator-id:
21019 id-expression
21020 :: [opt] nested-name-specifier [opt] type-name
21022 In the `id-expression' case, the value returned is as for
21023 cp_parser_id_expression if the id-expression was an unqualified-id.
21024 If the id-expression was a qualified-id, then a SCOPE_REF is
21025 returned. The first operand is the scope (either a NAMESPACE_DECL
21026 or TREE_TYPE), but the second is still just a representation of an
21027 unqualified-id. */
21029 static tree
21031 {
21032 tree id;
21033 /* The expression must be an id-expression. Assume that qualified
21034 names are the names of types so that:
21036 template <class T>
21037 int S<T>::R::i = 3;
21039 will work; we must treat `S<T>::R' as the name of a type.
21040 Similarly, assume that qualified names are templates, where
21041 required, so that:
21043 template <class T>
21044 int S<T>::R<T>::i = 3;
21046 will work, too. */
21052 optional_p);
21056 }
21058 /* Parse a type-id.
21060 type-id:
21061 type-specifier-seq abstract-declarator [opt]
21063 Returns the TYPE specified. */
21065 static tree
21068 {
21069 cp_decl_specifier_seq type_specifier_seq;
21072 /* Parse the type-specifier-seq. */
21074 is_trailing_return,
21079 /* A bare template name as a template argument is a template template
21080 argument, not a placeholder, so fail parsing it as a type argument. */
21081 {
21085 }
21089 /* There might or might not be an abstract declarator. */
21091 /* Look for the declarator. */
21092 abstract_declarator
21097 /* Check to see if there really was a declarator. */
21102 /* The concepts TS allows 'auto' as a type-id. */
21104 /* None of the valid uses of 'auto' in C++14 involve the type-id
21105 nonterminal, but it is valid in a trailing-return-type. */
21108 {
21109 /* A type-id with type 'auto' is only ok if the abstract declarator
21110 is a function declarator with a late-specified return type.
21112 A type-id with 'auto' is also valid in a trailing-return-type
21113 in a compound-requirement. */
21120 else
21121 {
21124 {
21126 auto_node);
21128 tmpl);
21129 }
21130 else
21133 }
21134 }
21137 is_template_arg);
21138 }
21140 static tree
21142 {
21144 }
21146 static tree
21148 {
21149 tree r;
21151 parser->type_definition_forbidden_message
21156 {
21159 }
21161 }
21163 static tree
21165 {
21167 }
21169 /* Parse a type-specifier-seq.
21171 type-specifier-seq:
21172 type-specifier type-specifier-seq [opt]
21174 GNU extension:
21176 type-specifier-seq:
21177 attributes type-specifier-seq [opt]
21179 If IS_DECLARATION is true, we are at the start of a "condition" or
21180 exception-declaration, so we might be followed by a declarator-id.
21182 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21183 i.e. we've just seen "->".
21185 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21187 static void
21192 {
21197 /* Clear the TYPE_SPECIFIER_SEQ. */
21200 /* In the context of a trailing return type, enum E { } is an
21201 elaborated-type-specifier followed by a function-body, not an
21202 enum-specifier. */
21206 /* Parse the type-specifiers and attributes. */
21208 {
21209 tree type_specifier;
21212 /* Check for attributes first. */
21214 {
21215 type_specifier_seq->attributes
21219 }
21221 /* record the token of the beginning of the type specifier seq,
21222 for error reporting purposes*/
21226 /* Look for the type-specifier. */
21228 flags,
21229 type_specifier_seq,
21231 NULL,
21234 {
21235 /* If the first type-specifier could not be found, this is not a
21236 type-specifier-seq at all. */
21238 {
21239 /* Set in_declarator_p to avoid skipping to the semicolon. */
21251 }
21252 /* If subsequent type-specifiers could not be found, the
21253 type-specifier-seq is complete. */
21255 }
21258 /* The standard says that a condition can be:
21260 type-specifier-seq declarator = assignment-expression
21262 However, given:
21264 struct S {};
21265 if (int S = ...)
21267 we should treat the "S" as a declarator, not as a
21268 type-specifier. The standard doesn't say that explicitly for
21269 type-specifier-seq, but it does say that for
21270 decl-specifier-seq in an ordinary declaration. Perhaps it
21271 would be clearer just to allow a decl-specifier-seq here, and
21272 then add a semantic restriction that if any decl-specifiers
21273 that are not type-specifiers appear, the program is invalid. */
21276 }
21277 }
21279 /* Return whether the function currently being declared has an associated
21280 template parameter list. */
21282 static bool
21284 {
21297 }
21299 /* Parse a parameter-declaration-clause.
21301 parameter-declaration-clause:
21302 parameter-declaration-list [opt] ... [opt]
21303 parameter-declaration-list , ...
21305 Returns a representation for the parameter declarations. A return
21306 value of NULL indicates a parameter-declaration-clause consisting
21307 only of an ellipsis. */
21309 static tree
21311 {
21312 tree parameters;
21320 && !processing_template_parmlist
21321 && !processing_explicit_instantiation
21322 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21323 actual function or a random abstract declarator. */
21329 /* Peek at the next token. */
21331 /* Check for trivial parameter-declaration-clauses. */
21333 {
21334 /* Consume the `...' token. */
21337 }
21339 /* There are no parameters. */
21340 {
21341 #ifndef NO_IMPLICIT_EXTERN_C
21346 else
21347 #endif
21349 }
21350 /* Check for `(void)', too, which is a special case. */
21354 {
21355 /* Consume the `void' token. */
21357 /* There are no parameters. */
21359 }
21361 /* Parse the parameter-declaration-list. */
21363 /* If a parse error occurred while parsing the
21364 parameter-declaration-list, then the entire
21365 parameter-declaration-clause is erroneous. */
21369 /* Peek at the next token. */
21371 /* If it's a `,', the clause should terminate with an ellipsis. */
21373 {
21374 /* Consume the `,'. */
21376 /* Expect an ellipsis. */
21377 ellipsis_p
21379 }
21380 /* It might also be `...' if the optional trailing `,' was
21381 omitted. */
21383 {
21384 /* Consume the `...' token. */
21386 /* And remember that we saw it. */
21388 }
21389 else
21392 /* Finish the parameter list. */
21397 }
21399 /* Parse a parameter-declaration-list.
21401 parameter-declaration-list:
21402 parameter-declaration
21403 parameter-declaration-list , parameter-declaration
21405 Returns a representation of the parameter-declaration-list, as for
21406 cp_parser_parameter_declaration_clause. However, the
21407 `void_list_node' is never appended to the list. */
21409 static tree
21411 {
21417 /* The special considerations that apply to a function within an
21418 unbraced linkage specifications do not apply to the parameters
21419 to the function. */
21420 saved_in_unbraced_linkage_specification_p
21424 /* Look for more parameters. */
21426 {
21431 /* Parse the parameter. */
21432 parameter
21437 /* We don't know yet if the enclosing context is deprecated, so wait
21438 and warn in grokparms if appropriate. */
21442 {
21445 PARM,
21450 }
21454 /* If a parse error occurred parsing the parameter declaration,
21455 then the entire parameter-declaration-list is erroneous. */
21457 {
21460 }
21470 {
21474 }
21476 /* Add the new parameter to the list. */
21480 /* Peek at the next token. */
21483 /* These are for Objective-C++ */
21486 /* The parameter-declaration-list is complete. */
21489 {
21492 /* Peek at the next token. */
21494 /* If it's an ellipsis, then the list is complete. */
21497 /* Otherwise, there must be more parameters. Consume the
21498 `,'. */
21500 /* When parsing something like:
21502 int i(float f, double d)
21504 we can tell after seeing the declaration for "f" that we
21505 are not looking at an initialization of a variable "i",
21506 but rather at the declaration of a function "i".
21508 Due to the fact that the parsing of template arguments
21509 (as specified to a template-id) requires backtracking we
21510 cannot use this technique when inside a template argument
21511 list. */
21515 /* However, a parameter-declaration of the form
21516 "float(f)" (which is a valid declaration of a
21517 parameter "f") can also be interpreted as an
21518 expression (the conversion of "f" to "float"). */
21521 }
21522 else
21523 {
21531 }
21532 }
21534 parser->in_unbraced_linkage_specification_p
21537 /* Reset implicit_template_scope if we are about to leave the function
21538 parameter list that introduced it. Note that for out-of-line member
21539 definitions, there will be one or more class scopes before we get to
21540 the template parameter scope. */
21544 {
21548 {
21551 }
21552 }
21555 }
21557 /* Parse a parameter declaration.
21559 parameter-declaration:
21560 decl-specifier-seq ... [opt] declarator
21561 decl-specifier-seq declarator = assignment-expression
21562 decl-specifier-seq ... [opt] abstract-declarator [opt]
21563 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21565 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21566 declares a template parameter. (In that case, a non-nested `>'
21567 token encountered during the parsing of the assignment-expression
21568 is not interpreted as a greater-than operator.)
21570 Returns a representation of the parameter, or NULL if an error
21571 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21572 true iff the declarator is of the form "(p)". */
21578 {
21580 cp_decl_specifier_seq decl_specifiers;
21582 tree default_argument;
21587 /* In a template parameter, `>' is not an operator.
21589 [temp.param]
21591 When parsing a default template-argument for a non-type
21592 template-parameter, the first non-nested `>' is taken as the end
21593 of the template parameter-list rather than a greater-than
21594 operator. */
21596 /* Type definitions may not appear in parameter types. */
21598 parser->type_definition_forbidden_message
21605 /* Parse the declaration-specifiers. */
21608 CP_PARSER_FLAGS_NONE,
21612 /* Complain about missing 'typename' or other invalid type names. */
21617 /* If an error occurred, there's no reason to attempt to parse the
21618 rest of the declaration. */
21620 {
21623 }
21625 /* Peek at the next token. */
21628 /* If the next token is a `)', `,', `=', `>', or `...', then there
21629 is no declarator. However, when variadic templates are enabled,
21630 there may be a declarator following `...'. */
21635 {
21639 }
21640 /* Otherwise, there should be a declarator. */
21641 else
21642 {
21646 /* After seeing a decl-specifier-seq, if the next token is not a
21647 "(", there is no possibility that the code is a valid
21648 expression. Therefore, if parsing tentatively, we commit at
21649 this point. */
21651 /* In an expression context, having seen:
21653 (int((char ...
21655 we cannot be sure whether we are looking at a
21656 function-type (taking a "char" as a parameter) or a cast
21657 of some object of type "char" to "int". */
21663 /* Parse the declarator. */
21666 CP_PARSER_DECLARATOR_EITHER,
21668 parenthesized_p,
21672 /* After the declarator, allow more attributes. */
21673 decl_specifiers.attributes
21677 /* If the declarator is a template parameter pack, remember that and
21678 clear the flag in the declarator itself so we don't get errors
21679 from grokdeclarator. */
21681 {
21684 }
21685 }
21687 /* If the next token is an ellipsis, and we have not seen a declarator
21688 name, and if either the type of the declarator contains parameter
21689 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21690 for, eg, abbreviated integral type names), then we actually have a
21691 parameter pack expansion expression. Otherwise, leave the ellipsis
21692 for a C-style variadic function. */
21695 /* If a function parameter pack was specified and an implicit template
21696 parameter was introduced during cp_parser_parameter_declaration,
21697 change any implicit parameters introduced into packs. */
21701 {
21709 }
21712 {
21723 {
21724 /* Consume the `...'. */
21728 /* Build a pack expansion type */
21733 else
21735 }
21736 }
21738 /* The restriction on defining new types applies only to the type
21739 of the parameter, not to the default argument. */
21742 /* If the next token is `=', then process a default argument. */
21744 {
21747 /* If we are defining a class, then the tokens that make up the
21748 default argument must be saved and processed later. */
21754 // A constrained-type-specifier may declare a type template-parameter.
21756 default_argument
21759 // A constrained-type-specifier may declare a template-template-parameter.
21761 default_argument
21764 /* Outside of a class definition, we can just parse the
21765 assignment-expression. */
21766 else
21767 default_argument
21771 {
21773 "default arguments are only "
21775 }
21777 || template_parameter_pack_p
21780 {
21781 /* Find the name of the parameter pack. */
21788 template_parm_p
21794 else
21796 template_parm_p
21803 }
21804 }
21805 else
21808 /* Generate a location for the parameter, ranging from the start of the
21809 initial token to the end of the final token (using input_location for
21810 the latter, set up by cp_lexer_set_source_position_from_token when
21811 consuming tokens).
21813 If we have a identifier, then use it for the caret location, e.g.
21815 extern int callee (int one, int (*two)(int, int), float three);
21816 ~~~~~~^~~~~~~~~~~~~~
21818 otherwise, reuse the start location for the caret location e.g.:
21820 extern int callee (int one, int (*)(int, int), float three);
21821 ^~~~~~~~~~~~~~~~~
21823 */
21829 input_location);
21832 declarator,
21833 default_argument,
21834 param_loc,
21835 template_parameter_pack_p);
21836 }
21838 /* Parse a default argument and return it.
21840 TEMPLATE_PARM_P is true if this is a default argument for a
21841 non-type template parameter. */
21842 static tree
21844 {
21850 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21851 set correctly. */
21854 /* Local variable names (and the `this' keyword) may not
21855 appear in a default argument. */
21858 /* Parse the assignment-expression. */
21863 /* The "this" pointer is not valid in a default argument. */
21865 {
21870 }
21871 default_argument
21873 /* Restore the "this" pointer. */
21875 {
21878 }
21887 }
21889 /* Parse a function-body.
21891 function-body:
21892 compound_statement */
21894 static void
21896 {
21900 }
21902 /* Parse a ctor-initializer-opt followed by a function-body. Return
21903 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21904 is true we are parsing a function-try-block. */
21906 static void
21909 {
21916 /* Begin the function body. */
21918 /* Parse the optional ctor-initializer. */
21921 /* If we're parsing a constexpr constructor definition, we need
21922 to check that the constructor body is indeed empty. However,
21923 before we get to cp_parser_function_body lot of junk has been
21924 generated, so we can't just check that we have an empty block.
21925 Rather we take a snapshot of the outermost block, and check whether
21926 cp_parser_function_body changed its state. */
21928 {
21932 }
21933 /* Parse the function-body. */
21937 /* Finish the function body. */
21939 }
21941 /* Parse an initializer.
21943 initializer:
21944 = initializer-clause
21945 ( expression-list )
21947 Returns an expression representing the initializer. If no
21948 initializer is present, NULL_TREE is returned.
21950 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21951 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21952 set to TRUE if there is no initializer present. If there is an
21953 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21954 is set to true; otherwise it is set to false. */
21956 static tree
21959 {
21961 tree init;
21963 /* Peek at the next token. */
21966 /* Let our caller know whether or not this initializer was
21967 parenthesized. */
21969 /* Assume that the initializer is constant. */
21973 {
21974 /* Consume the `='. */
21976 /* Parse the initializer-clause. */
21978 }
21980 {
21985 non_constant_p);
21990 }
21992 {
21997 }
21998 else
21999 {
22000 /* Anything else is an error. */
22003 }
22009 }
22011 /* Parse an initializer-clause.
22013 initializer-clause:
22014 assignment-expression
22015 braced-init-list
22017 Returns an expression representing the initializer.
22019 If the `assignment-expression' production is used the value
22020 returned is simply a representation for the expression.
22022 Otherwise, calls cp_parser_braced_list. */
22024 static cp_expr
22026 {
22027 cp_expr initializer;
22029 /* Assume the expression is constant. */
22032 /* If it is not a `{', then we are looking at an
22033 assignment-expression. */
22035 {
22036 initializer
22039 non_constant_p);
22040 }
22041 else
22045 }
22047 /* Parse a brace-enclosed initializer list.
22049 braced-init-list:
22050 { initializer-list , [opt] }
22051 { designated-initializer-list , [opt] }
22052 { }
22054 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22055 the elements of the initializer-list (or NULL, if the last
22056 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22057 NULL_TREE. There is no way to detect whether or not the optional
22058 trailing `,' was provided. NON_CONSTANT_P is as for
22059 cp_parser_initializer. */
22061 static cp_expr
22063 {
22064 tree initializer;
22067 /* Consume the `{' token. */
22068 matching_braces braces;
22070 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22072 /* If it's not a `}', then there is a non-trivial initializer. */
22074 {
22075 /* Parse the initializer list. */
22078 /* A trailing `,' token is allowed. */
22081 }
22082 else
22084 /* Now, there should be a trailing `}'. */
22090 /* Build a location of the form:
22091 { ... }
22092 ^~~~~~~
22093 with caret==start at the open brace, finish at the close brace. */
22097 }
22099 /* Consume tokens up to, and including, the next non-nested closing `]'.
22100 Returns true iff we found a closing `]'. */
22102 static bool
22104 {
22108 {
22112 {
22115 /* If we've run out of tokens, then there is no closing `]'. */
22124 {
22127 }
22132 }
22134 /* Consume the token. */
22136 }
22137 }
22139 /* Return true if we are looking at an array-designator, false otherwise. */
22141 static bool
22143 {
22144 /* Consume the `['. */
22149 /* Skip tokens until the next token is a closing square bracket.
22150 If we find the closing `]', and the next token is a `=', then
22151 we are looking at an array designator. */
22152 bool array_designator_p
22156 /* Roll back the tokens we skipped. */
22160 }
22162 /* Parse an initializer-list.
22164 initializer-list:
22165 initializer-clause ... [opt]
22166 initializer-list , initializer-clause ... [opt]
22168 C++2A Extension:
22170 designated-initializer-list:
22171 designated-initializer-clause
22172 designated-initializer-list , designated-initializer-clause
22174 designated-initializer-clause:
22175 designator brace-or-equal-initializer
22177 designator:
22178 . identifier
22180 GNU Extension:
22182 initializer-list:
22183 designation initializer-clause ...[opt]
22184 initializer-list , designation initializer-clause ...[opt]
22186 designation:
22187 . identifier =
22188 identifier :
22189 [ constant-expression ] =
22191 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22192 for the initializer. If the INDEX of the elt is non-NULL, it is the
22193 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22194 as for cp_parser_initializer. */
22198 {
22203 /* Assume all of the expressions are constant. */
22206 /* Parse the rest of the list. */
22208 {
22210 tree designator;
22211 tree initializer;
22215 /* Handle the C++2A syntax, '. id ='. */
22223 {
22226 "C++ designated initializers only available with "
22228 /* Consume the `.'. */
22230 /* Consume the identifier. */
22233 /* Consume the `='. */
22235 }
22236 /* Also, if the next token is an identifier and the following one is a
22237 colon, we are looking at the GNU designated-initializer
22238 syntax. */
22243 {
22244 /* Warn the user that they are using an extension. */
22247 /* Consume the identifier. */
22249 /* Consume the `:'. */
22251 }
22252 /* Also handle C99 array designators, '[ const ] ='. */
22256 {
22257 /* In C++11, [ could start a lambda-introducer. */
22263 {
22266 }
22267 else
22268 {
22273 }
22278 && (!require_potential_rvalue_constant_expression
22282 /* Warn the user that they are using an extension. */
22285 }
22286 else
22290 {
22293 }
22297 {
22301 }
22305 /* Parse the initializer. */
22308 /* If any clause is non-constant, so is the entire initializer. */
22312 /* If we have an ellipsis, this is an initializer pack
22313 expansion. */
22315 {
22318 /* Consume the `...'. */
22325 /* Turn the initializer into an initializer expansion. */
22327 }
22329 /* Add it to the vector. */
22332 /* If the next token is not a comma, we have reached the end of
22333 the list. */
22337 /* Peek at the next token. */
22339 /* If the next token is a `}', then we're still done. An
22340 initializer-clause can have a trailing `,' after the
22341 initializer-list and before the closing `}'. */
22345 /* Consume the `,' token. */
22347 }
22349 /* The same identifier shall not appear in multiple designators
22350 of a designated-initializer-list. */
22352 {
22357 {
22359 {
22361 "%<.%s%> designator used multiple times in "
22365 }
22366 else
22368 }
22372 }
22375 }
22377 /* Classes [gram.class] */
22379 /* Parse a class-name.
22381 class-name:
22382 identifier
22383 template-id
22385 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22386 to indicate that names looked up in dependent types should be
22387 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22388 keyword has been used to indicate that the name that appears next
22389 is a template. TAG_TYPE indicates the explicit tag given before
22390 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22391 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22392 is the class being defined in a class-head. If ENUM_OK is TRUE,
22393 enum-names are also accepted.
22395 Returns the TYPE_DECL representing the class. */
22397 static tree
22406 {
22407 tree decl;
22408 tree scope;
22413 /* All class-names start with an identifier. */
22416 {
22419 }
22421 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22422 to a template-id, so we save it here. */
22427 /* Any name names a type if we're following the `typename' keyword
22428 in a qualified name where the enclosing scope is type-dependent. */
22431 /* Handle the common case (an identifier, but not a template-id)
22432 efficiently. */
22435 {
22439 /* Look for the identifier. */
22443 /* If the next token isn't an identifier, we are certainly not
22444 looking at a class-name. */
22447 /* If we know this is a type-name, there's no need to look it
22448 up. */
22451 else
22452 {
22453 tree ambiguous_decls;
22454 /* If we already know that this lookup is ambiguous, then
22455 we've already issued an error message; there's no reason
22456 to check again. */
22458 {
22461 }
22462 /* If the next token is a `::', then the name must be a type
22463 name.
22465 [basic.lookup.qual]
22467 During the lookup for a name preceding the :: scope
22468 resolution operator, object, function, and enumerator
22469 names are ignored. */
22472 /* Look up the name. */
22474 tag_type,
22477 check_dependency_p,
22481 {
22485 }
22486 }
22487 }
22488 else
22489 {
22490 /* Try a template-id. */
22492 check_dependency_p,
22493 tag_type,
22494 is_declaration);
22497 }
22501 /* If this is a typename, create a TYPENAME_TYPE. */
22503 {
22508 }
22512 /* Check to see that it is really the name of a class. */
22516 /* Situations like this:
22518 template <typename T> struct A {
22519 typename T::template X<int>::I i;
22520 };
22522 are problematic. Is `T::template X<int>' a class-name? The
22523 standard does not seem to be definitive, but there is no other
22524 valid interpretation of the following `::'. Therefore, those
22525 names are considered class-names. */
22526 {
22530 }
22535 /* In Objective-C 2.0, a classname followed by '.' starts a
22536 dot-syntax expression, and it's not a type-name. */
22548 }
22550 /* Parse a class-specifier.
22552 class-specifier:
22553 class-head { member-specification [opt] }
22555 Returns the TREE_TYPE representing the class. */
22557 static tree
22559 {
22560 tree type;
22574 /* Parse the class-head. */
22577 /* If the class-head was a semantic disaster, skip the entire body
22578 of the class. */
22580 {
22584 }
22586 /* Look for the `{'. */
22587 matching_braces braces;
22589 {
22592 }
22597 /* Issue an error message if type-definitions are forbidden here. */
22599 /* Remember that we are defining one more class. */
22601 /* Inside the class, surrounding template-parameter-lists do not
22602 apply. */
22603 saved_num_template_parameter_lists
22606 /* We are not in a function body. */
22609 /* Or in a loop. */
22612 /* Or in a switch. */
22615 /* We are not immediately inside an extern "lang" block. */
22616 saved_in_unbraced_linkage_specification_p
22620 // Associate constraints with the type.
22624 /* Start the class. */
22626 {
22629 }
22633 /* If the type is erroneous, skip the entire body of the class. */
22635 else
22636 /* Parse the member-specification. */
22639 /* Look for the trailing `}'. */
22641 /* Look for trailing attributes to apply to this class. */
22649 /* We've finished a type definition. Check for the common syntax
22650 error of forgetting a semicolon after the definition. We need to
22651 be careful, as we can't just check for not-a-semicolon and be done
22652 with it; the user might have typed:
22654 class X { } c = ...;
22655 class X { } *p = ...;
22657 and so forth. Instead, enumerate all the possible tokens that
22658 might follow this production; if we don't see one of them, then
22659 complain and silently insert the semicolon. */
22660 {
22665 /* Don't try to parse c++11 attributes here. As per the
22666 grammar, that should be a task for
22667 cp_parser_decl_specifier_seq. */
22671 {
22682 /* While it's legal for type qualifiers and storage class
22683 specifiers to follow type definitions in the grammar, only
22684 compiler testsuites contain code like that. Assume that if
22685 we see such code, then what we're really seeing is a case
22686 like:
22688 class X { }
22689 const <type> var = ...;
22691 or
22693 class Y { }
22694 static <type> func (...) ...
22696 i.e. the qualifier or specifier applies to the next
22697 declaration. To do so, however, we need to look ahead one
22698 more token to see if *that* token is a type specifier.
22700 This code could be improved to handle:
22702 class Z { }
22703 static const <type> var = ...; */
22706 {
22709 /* Handling user-defined types here would be nice, but very
22710 tricky. */
22711 want_semicolon
22714 }
22718 }
22720 /* If we don't have a type, then something is very wrong and we
22721 shouldn't try to do anything clever. Likewise for not seeing the
22722 closing brace. */
22724 {
22725 /* Locate the closing brace. */
22726 cp_token_position prev
22731 /* We want to suggest insertion of a ';' immediately *after* the
22732 closing brace, so, if we can, offset the location by 1 column. */
22739 /* If we successfully offset the location, suggest the fix-it. */
22752 else
22755 /* Unget one token and smash it to look as though we encountered
22756 a semicolon in the input stream. */
22761 }
22762 }
22764 /* If this class is not itself within the scope of another class,
22765 then we need to parse the bodies of all of the queued function
22766 definitions. Note that the queued functions defined in a class
22767 are not always processed immediately following the
22768 class-specifier for that class. Consider:
22770 struct A {
22771 struct B { void f() { sizeof (A); } };
22772 };
22774 If `f' were processed before the processing of `A' were
22775 completed, there would be no way to compute the size of `A'.
22776 Note that the nesting we are interested in here is lexical --
22777 not the semantic nesting given by TYPE_CONTEXT. In particular,
22778 for:
22780 struct A { struct B; };
22781 struct A::B { void f() { } };
22783 there is no need to delay the parsing of `A::B::f'. */
22785 {
22786 tree decl;
22794 {
22795 /* Skip default arguments, NSDMIs, etc, in order to improve
22796 error recovery (c++/71169, c++/71832). */
22801 }
22803 /* In a first pass, parse default arguments to the functions.
22804 Then, in a second pass, parse the bodies of the functions.
22805 This two-phased approach handles cases like:
22807 struct S {
22808 void f() { g(); }
22809 void g(int i = 3);
22810 };
22812 */
22814 {
22816 /* If there are default arguments that have not yet been processed,
22817 take care of them now. */
22819 {
22824 }
22825 /* Make sure that any template parameters are in scope. */
22827 /* Parse the default argument expressions. */
22829 /* Remove any template parameters from the symbol table. */
22831 }
22833 /* Now parse any NSDMIs. */
22837 {
22839 {
22844 }
22847 }
22854 /* Now do some post-NSDMI bookkeeping. */
22860 /* Now parse the body of the functions. */
22862 {
22863 /* OpenMP UDRs need to be parsed before all other functions. */
22870 }
22871 else
22875 }
22876 else
22879 /* Put back any saved access checks. */
22882 /* Restore saved state. */
22886 parser->num_template_parameter_lists
22888 parser->in_unbraced_linkage_specification_p
22892 }
22894 static tree
22896 {
22897 tree ret;
22902 }
22904 /* Parse a class-head.
22906 class-head:
22907 class-key identifier [opt] base-clause [opt]
22908 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22909 class-key nested-name-specifier [opt] template-id
22910 base-clause [opt]
22912 class-virt-specifier:
22913 final
22915 GNU Extensions:
22916 class-key attributes identifier [opt] base-clause [opt]
22917 class-key attributes nested-name-specifier identifier base-clause [opt]
22918 class-key attributes nested-name-specifier [opt] template-id
22919 base-clause [opt]
22921 Upon return BASES is initialized to the list of base classes (or
22922 NULL, if there are none) in the same form returned by
22923 cp_parser_base_clause.
22925 Returns the TYPE of the indicated class. Sets
22926 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22927 involving a nested-name-specifier was used, and FALSE otherwise.
22929 Returns error_mark_node if this is not a class-head.
22931 Returns NULL_TREE if the class-head is syntactically valid, but
22932 semantically invalid in a way that means we should skip the entire
22933 body of the class. */
22935 static tree
22938 {
22939 tree nested_name_specifier;
22943 tree attributes;
22944 tree bases;
22954 /* Assume no nested-name-specifier will be present. */
22956 /* Assume no template parameter lists will be used in defining the
22957 type. */
22961 /* Look for the class-key. */
22968 /* Parse the attributes. */
22971 /* If the next token is `::', that is invalid -- but sometimes
22972 people do try to write:
22974 struct ::S {};
22976 Handle this gracefully by accepting the extra qualifier, and then
22977 issuing an error about it later if this really is a
22978 class-head. If it turns out just to be an elaborated type
22979 specifier, remain silent. */
22985 /* Determine the name of the class. Begin by looking for an
22986 optional nested-name-specifier. */
22988 nested_name_specifier
22994 /* If there was a nested-name-specifier, then there *must* be an
22995 identifier. */
23000 {
23002 /* Although the grammar says `identifier', it really means
23003 `class-name' or `template-name'. You are only allowed to
23004 define a class that has already been declared with this
23005 syntax.
23007 The proposed resolution for Core Issue 180 says that wherever
23008 you see `class T::X' you should treat `X' as a type-name.
23010 It is OK to define an inaccessible class; for example:
23012 class A { class B; };
23013 class A::B {};
23015 We do not know if we will see a class-name, or a
23016 template-name. We look for a class-name first, in case the
23017 class-name is a template-id; if we looked for the
23018 template-name first we would stop after the template-name. */
23025 class_type,
23029 /* If that didn't work, ignore the nested-name-specifier. */
23031 {
23037 }
23038 /* If we could not find a corresponding TYPE, treat this
23039 declaration like an unqualified declaration. */
23042 /* Otherwise, count the number of templates used in TYPE and its
23043 containing scopes. */
23044 else
23046 }
23047 /* Otherwise, the identifier is optional. */
23048 else
23049 {
23050 /* We don't know whether what comes next is a template-id,
23051 an identifier, or nothing at all. */
23053 /* Check for a template-id. */
23058 class_key,
23060 /* If that didn't work, it could still be an identifier. */
23062 {
23064 {
23067 }
23068 else
23070 }
23071 else
23072 {
23075 }
23076 }
23081 {
23083 class_key,
23085 }
23088 /* If it's not a `:' or a `{' then we can't really be looking at a
23089 class-head, since a class-head only appears as part of a
23090 class-specifier. We have to detect this situation before calling
23091 xref_tag, since that has irreversible side-effects. */
23093 {
23097 }
23099 /* At this point, we're going ahead with the class-specifier, even
23100 if some other problem occurs. */
23103 {
23108 }
23109 /* Issue the error about the overly-qualified name now. */
23111 {
23116 }
23118 {
23123 }
23125 {
23126 tree scope;
23129 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23130 keyword template shall not appear at the top level. */
23134 /* Reject typedef-names in class heads. */
23136 {
23139 type);
23142 }
23144 /* Figure out in what scope the declaration is being placed. */
23146 /* If that scope does not contain the scope in which the
23147 class was originally declared, the program is invalid. */
23149 {
23152 "declaration of %qD in namespace %qD which does not "
23155 else
23161 }
23162 /* [dcl.meaning]
23164 A declarator-id shall not be qualified except for the
23165 definition of a ... nested class outside of its class
23166 ... [or] the definition or explicit instantiation of a
23167 class member of a namespace outside of its namespace. */
23169 {
23174 }
23175 }
23176 /* An explicit-specialization must be preceded by "template <>". If
23177 it is not, try to recover gracefully. */
23180 && !processing_template_parmlist
23182 {
23183 /* Build a location of this form:
23184 struct typename <ARGS>
23185 ^~~~~~~~~~~~~~~~~~~~~~
23186 with caret==start at the start token, and
23187 finishing at the end of the type. */
23188 location_t reported_loc
23190 class_head_start_location,
23196 "an explicit specialization must be preceded by"
23199 /* Take the same action that would have been taken by
23200 cp_parser_explicit_specialization. */
23203 }
23204 /* There must be no "return" statements between this point and the
23205 end of this function; set "type "to the correct return value and
23206 use "goto done;" to return. */
23207 /* Make sure that the right number of template parameters were
23208 present. */
23210 template_id_p,
23213 {
23214 /* If something went wrong, there is no point in even trying to
23215 process the class-definition. */
23218 }
23220 /* Look up the type. */
23222 {
23226 {
23230 }
23231 else
23232 {
23236 /* Check the scope while we still know whether or not we had a
23237 nested-name-specifier. */
23240 }
23243 }
23245 {
23246 tree class_type;
23248 /* Given:
23250 template <typename T> struct S { struct T };
23251 template <typename T> struct S<T>::T { };
23253 we will get a TYPENAME_TYPE when processing the definition of
23254 `S::T'. We need to resolve it to the actual type before we
23255 try to define it. */
23257 {
23262 else
23263 {
23266 }
23267 }
23271 {
23274 }
23277 /* Enter the scope indicated by the nested-name-specifier. */
23279 /* Get the canonical version of this type. */
23281 /* Call push_template_decl if it seems like we should be defining a
23282 template either from the template headers or the type we're
23283 defining, so that we diagnose both extra and missing headers. */
23287 {
23290 {
23293 }
23294 }
23298 }
23300 {
23301 /* If the class was unnamed, create a dummy name. */
23305 ? ts_within_enclosing_non_class
23309 }
23311 /* Indicate whether this class was declared as a `class' or as a
23312 `struct'. */
23317 /* If this type was already complete, and we see another definition,
23318 that's an error. */
23320 {
23322 type);
23324 type);
23327 }
23332 {
23333 /* Apply attributes now, before any use of the class as a template
23334 argument in its base list. */
23337 }
23339 /* We will have entered the scope containing the class; the names of
23340 base classes should be looked up in that context. For example:
23342 struct A { struct B {}; struct C; };
23343 struct A::C : B {};
23345 is valid. */
23347 /* Get the list of base-classes, if there is one. */
23349 {
23350 /* PR59482: enter the class scope so that base-specifiers are looked
23351 up correctly. */
23355 /* PR59482: get out of the previously pushed class scope so that the
23356 subsequent pops pop the right thing. */
23359 }
23360 else
23363 /* If we're really defining a class, process the base classes.
23364 If they're invalid, fail. */
23368 done:
23369 /* Leave the scope given by the nested-name-specifier. We will
23370 enter the class scope itself while processing the members. */
23375 {
23378 }
23384 out:
23387 }
23389 /* Parse a class-key.
23391 class-key:
23392 class
23393 struct
23394 union
23396 Returns the kind of class-key specified, or none_type to indicate
23397 error. */
23399 static enum tag_types
23401 {
23405 /* Look for the class-key. */
23410 /* Check to see if the TOKEN is a class-key. */
23415 }
23417 /* Parse a type-parameter-key.
23419 type-parameter-key:
23420 class
23421 typename
23422 */
23424 static void
23426 {
23427 /* Look for the type-parameter-key. */
23431 {
23434 /* typename is not allowed in a template template parameter
23435 by the standard until C++17. */
23437 "ISO C++ forbids typename key in template template parameter;"
23439 }
23440 else
23444 }
23446 /* Parse an (optional) member-specification.
23448 member-specification:
23449 member-declaration member-specification [opt]
23450 access-specifier : member-specification [opt] */
23452 static void
23454 {
23456 {
23460 /* Peek at the next token. */
23462 /* If it's a `}', or EOF then we've seen all the members. */
23468 /* See if this token is a keyword. */
23471 {
23475 /* Consume the access-specifier. */
23477 /* Remember which access-specifier is active. */
23479 /* Look for the `:'. */
23484 /* Accept #pragmas at class scope. */
23486 {
23489 }
23491 /* Otherwise, the next construction must be a
23492 member-declaration. */
23494 }
23495 }
23496 }
23498 /* Parse a member-declaration.
23500 member-declaration:
23501 decl-specifier-seq [opt] member-declarator-list [opt] ;
23502 function-definition ; [opt]
23503 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23504 using-declaration
23505 template-declaration
23506 alias-declaration
23508 member-declarator-list:
23509 member-declarator
23510 member-declarator-list , member-declarator
23512 member-declarator:
23513 declarator pure-specifier [opt]
23514 declarator constant-initializer [opt]
23515 identifier [opt] : constant-expression
23517 GNU Extensions:
23519 member-declaration:
23520 __extension__ member-declaration
23522 member-declarator:
23523 declarator attributes [opt] pure-specifier [opt]
23524 declarator attributes [opt] constant-initializer [opt]
23525 identifier [opt] attributes [opt] : constant-expression
23527 C++0x Extensions:
23529 member-declaration:
23530 static_assert-declaration */
23532 static void
23534 {
23535 cp_decl_specifier_seq decl_specifiers;
23536 tree prefix_attributes;
23537 tree decl;
23546 /* Check for the `__extension__' keyword. */
23548 {
23549 /* Recurse. */
23551 /* Restore the old value of the PEDANTIC flag. */
23555 }
23557 /* Check for a template-declaration. */
23559 {
23560 /* An explicit specialization here is an error condition, and we
23561 expect the specialization handler to detect and report this. */
23565 else
23569 }
23570 /* Check for a template introduction. */
23574 /* Check for a using-declaration. */
23576 {
23578 {
23579 /* Parse the using-declaration. */
23583 }
23584 else
23585 {
23586 tree decl;
23590 /* Note that if we actually see the '=' token after the
23591 identifier, cp_parser_alias_declaration commits the
23592 tentative parse. In that case, we really expect an
23593 alias-declaration. Otherwise, we expect a using
23594 declaration. */
23595 alias_decl_expected =
23601 else
23605 }
23606 }
23608 /* Check for @defs. */
23610 {
23615 {
23620 }
23622 }
23624 /* If the next token is `static_assert' we have a static assertion. */
23626 {
23629 }
23636 /* Parse the decl-specifier-seq. */
23639 CP_PARSER_FLAGS_OPTIONAL,
23642 /* Check for an invalid type-name. */
23646 /* If there is no declarator, then the decl-specifier-seq should
23647 specify a type. */
23649 {
23650 /* If there was no decl-specifier-seq, and the next token is a
23651 `;', then we have something like:
23653 struct S { ; };
23655 [class.mem]
23657 Each member-declaration shall declare at least one member
23658 name of the class. */
23660 {
23663 {
23667 }
23668 }
23669 else
23670 {
23671 tree type;
23673 /* See if this declaration is a friend. */
23675 /* If there were decl-specifiers, check to see if there was
23676 a class-declaration. */
23679 /* Nested classes have already been added to the class, but
23680 a `friend' needs to be explicitly registered. */
23682 {
23683 /* If the `friend' keyword was present, the friend must
23684 be introduced with a class-key. */
23687 "in C++03 a class-key must be used "
23689 /* In this case:
23691 template <typename T> struct A {
23692 friend struct A<T>::B;
23693 };
23695 A<T>::B will be represented by a TYPENAME_TYPE, and
23696 therefore not recognized by check_tag_decl. */
23698 {
23702 }
23705 "friend declaration does not name a class or "
23707 else
23710 }
23711 /* If there is no TYPE, an error message will already have
23712 been issued. */
23714 ;
23715 /* An anonymous aggregate has to be handled specially; such
23716 a declaration really declares a data member (with a
23717 particular type), as opposed to a nested class. */
23719 {
23720 /* C++11 9.5/6. */
23723 "a storage class on an anonymous aggregate "
23726 /* Remove constructors and such from TYPE, now that we
23727 know it is an anonymous aggregate. */
23729 /* And make the corresponding data member. */
23732 /* Add it to the class. */
23734 }
23735 else
23736 cp_parser_check_access_in_redeclaration
23739 }
23740 }
23741 else
23742 {
23745 /* Clear attributes from the decl_specifiers but keep them
23746 around as prefix attributes that apply them to the entity
23747 being declared. */
23751 /* See if these declarations will be friends. */
23754 /* Keep going until we hit the `;' at the end of the
23755 declaration. */
23757 {
23759 tree first_attribute;
23760 tree initializer;
23763 /* Peek at the next token. */
23766 /* The following code wants to know early if it is a bit-field
23767 or some other declaration. Attributes can appear before
23768 the `:' token. Skip over them without consuming any tokens
23769 to peek if they are followed by `:'. */
23774 {
23775 size_t n
23778 }
23780 /* Check for a bitfield declaration. */
23786 {
23787 tree identifier;
23788 tree width;
23793 else
23796 /* Look for attributes that apply to the bitfield. */
23799 /* Consume the `:' token. */
23802 /* Get the width of the bitfield. */
23806 /* In C++2A and as extension for C++11 and above we allow
23807 default member initializers for bit-fields. */
23812 CPP_OPEN_BRACE)))
23813 {
23814 location_t loc
23820 "default member initializers for bit-fields "
23821 "only available with -std=c++2a or "
23826 {
23830 }
23831 }
23832 else
23833 {
23834 /* Look for attributes that apply to the bitfield after
23835 the `:' token and width. This is where GCC used to
23836 parse attributes in the past, pedwarn if there is
23837 a std attribute. */
23840 "ISO C++ allows bit-field attributes only "
23844 }
23848 /* Remember which attributes are prefix attributes and
23849 which are not. */
23851 /* Combine the attributes. */
23854 /* Create the bitfield declaration. */
23857 identifier,
23858 sfk_none)
23862 attributes);
23863 }
23864 else
23865 {
23867 tree asm_specification;
23870 /* Parse the declarator. */
23871 declarator
23876 friend_p);
23878 /* If something went wrong parsing the declarator, make sure
23879 that we at least consume some tokens. */
23881 {
23882 /* Skip to the end of the statement. */
23884 /* If the next token is not a semicolon, that is
23885 probably because we just skipped over the body of
23886 a function. So, we consume a semicolon if
23887 present, but do not issue an error message if it
23888 is not present. */
23890 CPP_SEMICOLON))
23893 }
23896 cp_parser_check_for_definition_in_return_type
23900 /* Look for an asm-specification. */
23902 /* Look for attributes that apply to the declaration. */
23904 /* Remember which attributes are prefix attributes and
23905 which are not. */
23907 /* Combine the attributes. */
23910 /* If it's an `=', then we have a constant-initializer or a
23911 pure-specifier. It is not correct to parse the
23912 initializer before registering the member declaration
23913 since the member declaration should be in scope while
23914 its initializer is processed. However, the rest of the
23915 front end does not yet provide an interface that allows
23916 us to handle this correctly. */
23918 {
23919 /* In [class.mem]:
23921 A pure-specifier shall be used only in the declaration of
23922 a virtual function.
23924 A member-declarator can contain a constant-initializer
23925 only if it declares a static member of integral or
23926 enumeration type.
23928 Therefore, if the DECLARATOR is for a function, we look
23929 for a pure-specifier; otherwise, we look for a
23930 constant-initializer. When we call `grokfield', it will
23931 perform more stringent semantics checks. */
23943 {
23945 /* Don't require a constant rvalue in C++11, since we
23946 might want a reference constant. We'll enforce
23947 constancy later. */
23949 /* Parse the initializer. */
23952 }
23953 else
23954 /* Parse the initializer. */
23956 }
23959 {
23963 else
23965 }
23966 /* Otherwise, there is no initializer. */
23967 else
23970 /* See if we are probably looking at a function
23971 definition. We are certainly not looking at a
23972 member-declarator. Calling `grokfield' has
23973 side-effects, so we must not do it unless we are sure
23974 that we are looking at a member-declarator. */
23977 {
23978 /* The grammar does not allow a pure-specifier to be
23979 used when a member function is defined. (It is
23980 possible that this fact is an oversight in the
23981 standard, since a pure function may be defined
23982 outside of the class-specifier. */
23988 declarator,
23989 attributes);
23992 /* If the member was not a friend, declare it here. */
23995 /* Peek at the next token. */
23997 /* If the next token is a semicolon, consume it. */
23999 {
24000 location_t semicolon_loc
24005 "extra %<;%> after in-class "
24007 }
24009 }
24010 else
24013 /* Create the declaration. */
24018 {
24021 else
24023 }
24024 }
24029 /* Reset PREFIX_ATTRIBUTES. */
24031 {
24036 }
24038 /* If there is any qualification still in effect, clear it
24039 now; we will be starting fresh with the next declarator. */
24043 /* If it's a `,', then there are more declarators. */
24045 {
24048 {
24054 }
24055 }
24056 /* If the next token isn't a `;', then we have a parse error. */
24058 CPP_SEMICOLON))
24059 {
24060 /* The next token might be a ways away from where the
24061 actual semicolon is missing. Find the previous token
24062 and use that for our error position. */
24069 /* Assume that the user meant to provide a semicolon. If
24070 we were to cp_parser_skip_to_end_of_statement, we might
24071 skip to a semicolon inside a member function definition
24072 and issue nonsensical error messages. */
24074 }
24077 {
24078 /* Add DECL to the list of members. */
24080 /* Explicitly include, eg, NSDMIs, for better error
24081 recovery (c++/58650). */
24089 /* Add DECL to the queue of NSDMI to be parsed later. */
24091 }
24095 }
24096 }
24099 out:
24101 }
24103 /* Parse a pure-specifier.
24105 pure-specifier:
24106 = 0
24108 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24109 Otherwise, ERROR_MARK_NODE is returned. */
24111 static tree
24113 {
24116 /* Look for the `=' token. */
24119 /* Look for the `0' token. */
24128 /* Accept = default or = delete in c++0x mode. */
24131 {
24134 }
24136 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24138 {
24143 }
24145 {
24148 }
24151 }
24153 /* Parse a constant-initializer.
24155 constant-initializer:
24156 = constant-expression
24158 Returns a representation of the constant-expression. */
24160 static tree
24162 {
24163 /* Look for the `=' token. */
24167 /* It is invalid to write:
24169 struct S { static const int i = { 7 }; };
24171 */
24173 {
24176 /* Consume the opening brace. */
24177 matching_braces braces;
24179 /* Skip the initializer. */
24181 /* Look for the trailing `}'. */
24185 }
24188 }
24190 /* Derived classes [gram.class.derived] */
24192 /* Parse a base-clause.
24194 base-clause:
24195 : base-specifier-list
24197 base-specifier-list:
24198 base-specifier ... [opt]
24199 base-specifier-list , base-specifier ... [opt]
24201 Returns a TREE_LIST representing the base-classes, in the order in
24202 which they were declared. The representation of each node is as
24203 described by cp_parser_base_specifier.
24205 In the case that no bases are specified, this function will return
24206 NULL_TREE, not ERROR_MARK_NODE. */
24208 static tree
24210 {
24213 /* Look for the `:' that begins the list. */
24216 /* Scan the base-specifier-list. */
24218 {
24220 tree base;
24223 /* Look for the base-specifier. */
24225 /* Look for the (optional) ellipsis. */
24227 {
24228 /* Consume the `...'. */
24232 }
24234 /* Add BASE to the front of the list. */
24236 {
24238 /* Make this a pack expansion type. */
24242 {
24245 }
24246 }
24247 /* Peek at the next token. */
24249 /* If it's not a comma, then the list is complete. */
24252 /* Consume the `,'. */
24254 }
24256 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24257 base class had a qualified name. However, the next name that
24258 appears is certainly not qualified. */
24264 }
24266 /* Parse a base-specifier.
24268 base-specifier:
24269 :: [opt] nested-name-specifier [opt] class-name
24270 virtual access-specifier [opt] :: [opt] nested-name-specifier
24271 [opt] class-name
24272 access-specifier virtual [opt] :: [opt] nested-name-specifier
24273 [opt] class-name
24275 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24276 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24277 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24278 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24280 static tree
24282 {
24290 tree type;
24292 /* Process the optional `virtual' and `access-specifier'. */
24294 {
24295 /* Peek at the next token. */
24297 /* Process `virtual'. */
24299 {
24301 /* If `virtual' appears more than once, issue an error. */
24303 {
24307 }
24311 /* Consume the `virtual' token. */
24319 /* If more than one access specifier appears, issue an
24320 error. */
24323 {
24327 }
24331 /* Consume the access-specifier. */
24339 }
24340 }
24341 /* It is not uncommon to see programs mechanically, erroneously, use
24342 the 'typename' keyword to denote (dependent) qualified types
24343 as base classes. */
24345 {
24350 else
24352 "keyword %<typename%> not allowed in this context "
24355 }
24357 /* Look for the optional `::' operator. */
24359 /* Look for the nested-name-specifier. The simplest way to
24360 implement:
24362 [temp.res]
24364 The keyword `typename' is not permitted in a base-specifier or
24365 mem-initializer; in these contexts a qualified name that
24366 depends on a template-parameter is implicitly assumed to be a
24367 type name.
24369 is to pretend that we have seen the `typename' keyword at this
24370 point. */
24376 /* If the base class is given by a qualified name, assume that names
24377 we see are type names or templates, as appropriate. */
24383 /* DR 950 allows decltype as a base-specifier. */
24385 else
24386 {
24387 /* Otherwise, look for the class-name. */
24389 class_scope_p,
24390 template_p,
24391 typename_type,
24396 }
24402 }
24404 /* Exception handling [gram.exception] */
24406 /* Parse an (optional) noexcept-specification.
24408 noexcept-specification:
24409 noexcept ( constant-expression ) [opt]
24411 If no noexcept-specification is present, returns NULL_TREE.
24412 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24413 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24414 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24415 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24416 in which case a boolean condition is returned instead. */
24418 static tree
24423 {
24427 /* Peek at the next token. */
24430 /* Is it a noexcept-specification? */
24432 {
24433 tree expr;
24437 {
24438 matching_parens parens;
24442 {
24443 /* Types may not be defined in an exception-specification. */
24445 parser->type_definition_forbidden_message
24450 /* Restore the saved message. */
24452 }
24453 else
24454 {
24457 }
24460 }
24461 else
24462 {
24466 }
24468 /* We cannot build a noexcept-spec right away because this will check
24469 that expr is a constexpr. */
24472 else
24474 }
24475 else
24477 }
24479 /* Parse an (optional) exception-specification.
24481 exception-specification:
24482 throw ( type-id-list [opt] )
24484 Returns a TREE_LIST representing the exception-specification. The
24485 TREE_VALUE of each node is a type. */
24487 static tree
24489 {
24491 tree type_id_list;
24494 /* Peek at the next token. */
24497 /* Is it a noexcept-specification? */
24503 /* If it's not `throw', then there's no exception-specification. */
24509 /* Consume the `throw'. */
24512 /* Look for the `('. */
24513 matching_parens parens;
24516 /* Peek at the next token. */
24518 /* If it's not a `)', then there is a type-id-list. */
24520 {
24521 /* Types may not be defined in an exception-specification. */
24523 parser->type_definition_forbidden_message
24525 /* Parse the type-id-list. */
24527 /* Restore the saved message. */
24531 {
24535 }
24538 "dynamic exception specifications are deprecated in "
24540 }
24541 /* In C++17, throw() is equivalent to noexcept (true). throw()
24542 is deprecated in C++11 and above as well, but is still widely used,
24543 so don't warn about it yet. */
24546 else
24549 /* Look for the `)'. */
24553 }
24555 /* Parse an (optional) type-id-list.
24557 type-id-list:
24558 type-id ... [opt]
24559 type-id-list , type-id ... [opt]
24561 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24562 in the order that the types were presented. */
24564 static tree
24566 {
24570 {
24572 tree type;
24576 /* Get the next type-id. */
24578 /* Check for invalid 'auto'. */
24580 {
24584 }
24585 /* Parse the optional ellipsis. */
24587 {
24588 /* Consume the `...'. */
24591 /* Turn the type into a pack expansion expression. */
24593 }
24594 /* Add it to the list. */
24596 /* Peek at the next token. */
24598 /* If it is not a `,', we are done. */
24601 /* Consume the `,'. */
24603 }
24606 }
24608 /* Parse a try-block.
24610 try-block:
24611 try compound-statement handler-seq */
24613 static tree
24615 {
24616 tree try_block;
24630 }
24632 /* Parse a function-try-block.
24634 function-try-block:
24635 try ctor-initializer [opt] function-body handler-seq */
24637 static void
24639 {
24640 tree compound_stmt;
24641 tree try_block;
24643 /* Look for the `try' keyword. */
24646 /* Let the rest of the front end know where we are. */
24648 /* Parse the function-body. */
24649 cp_parser_ctor_initializer_opt_and_function_body
24651 /* We're done with the `try' part. */
24653 /* Parse the handlers. */
24655 /* We're done with the handlers. */
24657 }
24659 /* Parse a handler-seq.
24661 handler-seq:
24662 handler handler-seq [opt] */
24664 static void
24666 {
24668 {
24671 /* Parse the handler. */
24673 /* Peek at the next token. */
24675 /* If it's not `catch' then there are no more handlers. */
24678 }
24679 }
24681 /* Parse a handler.
24683 handler:
24684 catch ( exception-declaration ) compound-statement */
24686 static void
24688 {
24689 tree handler;
24690 tree declaration;
24694 matching_parens parens;
24701 }
24703 /* Parse an exception-declaration.
24705 exception-declaration:
24706 type-specifier-seq declarator
24707 type-specifier-seq abstract-declarator
24708 type-specifier-seq
24709 ...
24711 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24712 ellipsis variant is used. */
24714 static tree
24716 {
24717 cp_decl_specifier_seq type_specifiers;
24721 /* If it's an ellipsis, it's easy to handle. */
24723 {
24724 /* Consume the `...' token. */
24727 }
24729 /* Types may not be defined in exception-declarations. */
24731 parser->type_definition_forbidden_message
24734 /* Parse the type-specifier-seq. */
24738 /* If it's a `)', then there is no declarator. */
24741 else
24748 /* Restore the saved message. */
24755 }
24757 /* Parse a throw-expression.
24759 throw-expression:
24760 throw assignment-expression [opt]
24762 Returns a THROW_EXPR representing the throw-expression. */
24764 static tree
24766 {
24767 tree expression;
24772 /* Figure out whether or not there is an assignment-expression
24773 following the "throw" keyword. */
24781 else
24785 }
24787 /* GNU Extensions */
24789 /* Parse an (optional) asm-specification.
24791 asm-specification:
24792 asm ( string-literal )
24794 If the asm-specification is present, returns a STRING_CST
24795 corresponding to the string-literal. Otherwise, returns
24796 NULL_TREE. */
24798 static tree
24800 {
24802 tree asm_specification;
24804 /* Peek at the next token. */
24806 /* If the next token isn't the `asm' keyword, then there's no
24807 asm-specification. */
24811 /* Consume the `asm' token. */
24813 /* Look for the `('. */
24814 matching_parens parens;
24817 /* Look for the string-literal. */
24820 /* Look for the `)'. */
24824 }
24826 /* Parse an asm-operand-list.
24828 asm-operand-list:
24829 asm-operand
24830 asm-operand-list , asm-operand
24832 asm-operand:
24833 string-literal ( expression )
24834 [ string-literal ] string-literal ( expression )
24836 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24837 each node is the expression. The TREE_PURPOSE is itself a
24838 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24839 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24840 is a STRING_CST for the string literal before the parenthesis. Returns
24841 ERROR_MARK_NODE if any of the operands are invalid. */
24843 static tree
24845 {
24850 {
24851 tree string_literal;
24852 tree expression;
24853 tree name;
24856 {
24857 /* Consume the `[' token. */
24859 /* Read the operand name. */
24864 /* Look for the closing `]'. */
24866 }
24867 else
24869 /* Look for the string-literal. */
24872 /* Look for the `('. */
24873 matching_parens parens;
24875 /* Parse the expression. */
24877 /* Look for the `)'. */
24885 /* Add this operand to the list. */
24887 expression,
24888 asm_operands);
24889 /* If the next token is not a `,', there are no more
24890 operands. */
24893 /* Consume the `,'. */
24895 }
24898 }
24900 /* Parse an asm-clobber-list.
24902 asm-clobber-list:
24903 string-literal
24904 asm-clobber-list , string-literal
24906 Returns a TREE_LIST, indicating the clobbers in the order that they
24907 appeared. The TREE_VALUE of each node is a STRING_CST. */
24909 static tree
24911 {
24915 {
24916 tree string_literal;
24918 /* Look for the string literal. */
24920 /* Add it to the list. */
24922 /* If the next token is not a `,', then the list is
24923 complete. */
24926 /* Consume the `,' token. */
24928 }
24931 }
24933 /* Parse an asm-label-list.
24935 asm-label-list:
24936 identifier
24937 asm-label-list , identifier
24939 Returns a TREE_LIST, indicating the labels in the order that they
24940 appeared. The TREE_VALUE of each node is a label. */
24942 static tree
24944 {
24948 {
24951 /* Look for the identifier. */
24954 {
24957 {
24963 }
24964 }
24965 /* If the next token is not a `,', then the list is
24966 complete. */
24969 /* Consume the `,' token. */
24971 }
24974 }
24976 /* Return TRUE iff the next tokens in the stream are possibly the
24977 beginning of a GNU extension attribute. */
24979 static bool
24981 {
24983 }
24985 /* Return TRUE iff the next tokens in the stream are possibly the
24986 beginning of a standard C++-11 attribute specifier. */
24988 static bool
24990 {
24992 }
24994 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24995 beginning of a standard C++-11 attribute specifier. */
24997 static bool
24999 {
25007 }
25009 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25010 beginning of a GNU extension attribute. */
25012 static bool
25014 {
25018 }
25020 /* Return true iff the next tokens can be the beginning of either a
25021 GNU attribute list, or a standard C++11 attribute sequence. */
25023 static bool
25025 {
25028 }
25030 /* Return true iff the next Nth tokens can be the beginning of either
25031 a GNU attribute list, or a standard C++11 attribute sequence. */
25033 static bool
25035 {
25038 }
25040 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25041 of GNU attributes, or return NULL. */
25043 static tree
25045 {
25049 }
25051 /* Parse an (optional) series of attributes.
25053 attributes:
25054 attributes attribute
25056 attribute:
25057 __attribute__ (( attribute-list [opt] ))
25059 The return value is as for cp_parser_gnu_attribute_list. */
25061 static tree
25063 {
25070 {
25072 tree attribute_list;
25075 /* Peek at the next token. */
25077 /* If it's not `__attribute__', then we're done. */
25081 /* Consume the `__attribute__' keyword. */
25083 /* Look for the two `(' tokens. */
25084 matching_parens outer_parens;
25086 matching_parens inner_parens;
25089 /* Peek at the next token. */
25092 /* Parse the attribute-list. */
25094 else
25095 /* If the next token is a `)', then there is no attribute
25096 list. */
25099 /* Look for the two `)' tokens. */
25107 /* Add these new attributes to the list. */
25109 }
25112 }
25114 /* Parse a GNU attribute-list.
25116 attribute-list:
25117 attribute
25118 attribute-list , attribute
25120 attribute:
25121 identifier
25122 identifier ( identifier )
25123 identifier ( identifier , expression-list )
25124 identifier ( expression-list )
25126 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25127 to an attribute. The TREE_PURPOSE of each node is the identifier
25128 indicating which attribute is in use. The TREE_VALUE represents
25129 the arguments, if any. */
25131 static tree
25133 {
25139 {
25141 tree identifier;
25142 tree attribute;
25144 /* Look for the identifier. We also allow keywords here; for
25145 example `__attribute__ ((const))' is legal. */
25149 {
25152 /* Consume the token, but save it since we need it for the
25153 SIMD enabled function parsing. */
25156 /* Save away the identifier that indicates which attribute
25157 this is. */
25159 /* For keywords, use the canonical spelling, not the
25160 parsed identifier. */
25167 /* Peek at the next token. */
25169 /* If it's an `(', then parse the attribute arguments. */
25171 {
25175 vec = cp_parser_parenthesized_expression_list
25181 else
25182 {
25185 }
25186 /* Save the arguments away. */
25188 }
25191 {
25192 /* Add this attribute to the list. */
25195 }
25198 }
25199 /* Now, look for more attributes. If the next token isn't a
25200 `,', we're done. */
25204 /* Consume the comma and keep going. */
25206 }
25209 /* We built up the list in reverse order. */
25211 }
25213 /* Parse a standard C++11 attribute.
25215 The returned representation is a TREE_LIST which TREE_PURPOSE is
25216 the scoped name of the attribute, and the TREE_VALUE is its
25217 arguments list.
25219 Note that the scoped name of the attribute is itself a TREE_LIST
25220 which TREE_PURPOSE is the namespace of the attribute, and
25221 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25222 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25223 and which TREE_PURPOSE is directly the attribute name.
25225 Clients of the attribute code should use get_attribute_namespace
25226 and get_attribute_name to get the actual namespace and name of
25227 attributes, regardless of their being GNU or C++11 attributes.
25229 attribute:
25230 attribute-token attribute-argument-clause [opt]
25232 attribute-token:
25233 identifier
25234 attribute-scoped-token
25236 attribute-scoped-token:
25237 attribute-namespace :: identifier
25239 attribute-namespace:
25240 identifier
25242 attribute-argument-clause:
25243 ( balanced-token-seq )
25245 balanced-token-seq:
25246 balanced-token [opt]
25247 balanced-token-seq balanced-token
25249 balanced-token:
25250 ( balanced-token-seq )
25251 [ balanced-token-seq ]
25252 { balanced-token-seq }. */
25254 static tree
25256 {
25263 /* First, parse name of the attribute, a.k.a attribute-token. */
25280 {
25281 /* We are seeing a scoped attribute token. */
25296 else
25297 {
25301 }
25305 NULL_TREE);
25307 }
25310 NULL_TREE);
25311 else
25312 {
25315 NULL_TREE);
25316 /* C++11 noreturn attribute is equivalent to GNU's. */
25319 /* C++14 deprecated attribute is equivalent to GNU's. */
25322 /* C++17 fallthrough attribute is equivalent to GNU's. */
25325 /* Transactional Memory TS optimize_for_synchronized attribute is
25326 equivalent to GNU transaction_callable. */
25330 /* Transactional Memory attributes are GNU attributes. */
25333 }
25335 /* Now parse the optional argument clause of the attribute. */
25340 {
25346 /* A GNU attribute that takes an identifier in parameter. */
25349 vec = cp_parser_parenthesized_expression_list
25355 else
25356 {
25359 }
25363 else
25365 }
25368 }
25370 /* Check that the attribute ATTRIBUTE appears at most once in the
25371 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25372 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25373 isn't implemented yet in GCC. */
25375 static void
25377 {
25379 {
25389 }
25390 }
25392 /* Parse a list of standard C++-11 attributes.
25394 attribute-list:
25395 attribute [opt]
25396 attribute-list , attribute[opt]
25397 attribute ...
25398 attribute-list , attribute ...
25399 */
25401 static tree
25403 {
25408 {
25413 {
25417 }
25420 {
25425 else
25426 {
25431 }
25433 }
25437 }
25440 }
25442 /* Parse a standard C++-11 attribute specifier.
25444 attribute-specifier:
25445 [ [ attribute-using-prefix [opt] attribute-list ] ]
25446 alignment-specifier
25448 attribute-using-prefix:
25449 using attribute-namespace :
25451 alignment-specifier:
25452 alignas ( type-id ... [opt] )
25453 alignas ( alignment-expression ... [opt] ). */
25455 static tree
25457 {
25463 {
25470 {
25481 {
25485 "attribute using prefix only available "
25491 }
25492 else
25494 }
25501 else
25502 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25503 when we are sure that we have actually parsed them. */
25505 }
25506 else
25507 {
25508 tree alignas_expr;
25510 /* Look for an alignment-specifier. */
25521 matching_parens parens;
25529 {
25536 }
25541 /* Handle alignas (pack...). */
25543 {
25546 }
25548 /* Something went wrong, so don't build the attribute. */
25555 /* Build the C++-11 representation of an 'aligned'
25556 attribute. */
25557 attributes =
25560 alignas_expr);
25561 }
25564 }
25566 /* Parse a standard C++-11 attribute-specifier-seq.
25568 attribute-specifier-seq:
25569 attribute-specifier-seq [opt] attribute-specifier
25570 */
25572 static tree
25574 {
25579 {
25588 else
25591 }
25594 }
25596 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25597 return index of the first token after balanced-token, or N on failure. */
25599 static size_t
25601 {
25604 do
25606 {
25609 /* Ran out of tokens. */
25631 }
25634 }
25636 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25637 return index of the first token after the GNU attribute tokens, or N on
25638 failure. */
25640 static size_t
25642 {
25644 {
25656 }
25658 }
25660 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25661 next token), return index of the first token after the standard C++11
25662 attribute tokens, or N on failure. */
25664 static size_t
25666 {
25668 {
25671 {
25678 }
25681 {
25686 }
25687 else
25689 }
25691 }
25693 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25694 as the next token), return index of the first token after the attribute
25695 tokens, or N on failure. */
25697 static size_t
25699 {
25703 }
25705 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25706 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25707 current value of the PEDANTIC flag, regardless of whether or not
25708 the `__extension__' keyword is present. The caller is responsible
25709 for restoring the value of the PEDANTIC flag. */
25711 static bool
25713 {
25714 /* Save the old value of the PEDANTIC flag. */
25718 {
25719 /* Consume the `__extension__' token. */
25721 /* We're not being pedantic while the `__extension__' keyword is
25722 in effect. */
25726 }
25729 }
25731 /* Parse a label declaration.
25733 label-declaration:
25734 __label__ label-declarator-seq ;
25736 label-declarator-seq:
25737 identifier , label-declarator-seq
25738 identifier */
25740 static void
25742 {
25743 /* Look for the `__label__' keyword. */
25747 {
25748 tree identifier;
25750 /* Look for an identifier. */
25752 /* If we failed, stop. */
25755 /* Declare it as a label. */
25757 /* If the next token is a `;', stop. */
25760 /* Look for the `,' separating the label declarations. */
25762 }
25764 /* Look for the final `;'. */
25766 }
25768 // -------------------------------------------------------------------------- //
25769 // Requires Clause
25771 // Parse a requires clause.
25772 //
25773 // requires-clause:
25774 // 'requires' logical-or-expression
25775 //
25776 // The required logical-or-expression must be a constant expression. Note
25777 // that we don't check that the expression is constepxr here. We defer until
25778 // we analyze constraints and then, we only check atomic constraints.
25779 static tree
25781 {
25782 // Parse the requires clause so that it is not automatically folded.
25790 }
25792 // Optionally parse a requires clause:
25793 static tree
25795 {
25798 {
25801 {
25804 /* Parse and discard the requires-clause. */
25807 }
25809 }
25812 }
25815 /*---------------------------------------------------------------------------
25816 Requires expressions
25817 ---------------------------------------------------------------------------*/
25819 /* Parse a requires expression
25821 requirement-expression:
25822 'requires' requirement-parameter-list [opt] requirement-body */
25823 static tree
25825 {
25829 /* A requires-expression shall appear only within a concept
25830 definition or a requires-clause.
25832 TODO: Implement this diagnostic correctly. */
25834 {
25838 }
25841 {
25842 /* Local parameters are delared as variables within the scope
25843 of the expression. They are not visible past the end of
25844 the expression. Expressions within the requires-expression
25845 are unevaluated. */
25846 struct scope_sentinel
25847 {
25849 {
25852 }
25855 {
25858 }
25861 /* Parse the optional parameter list. */
25863 {
25867 }
25868 else
25871 /* Parse the requirement body. */
25875 }
25877 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25878 the parm chain. */
25881 }
25883 /* Parse a parameterized requirement.
25885 requirement-parameter-list:
25886 '(' parameter-declaration-clause ')' */
25887 static tree
25889 {
25890 matching_parens parens;
25900 }
25902 /* Parse the body of a requirement.
25904 requirement-body:
25905 '{' requirement-list '}' */
25906 static tree
25908 {
25909 matching_braces braces;
25919 }
25921 /* Parse a list of requirements.
25923 requirement-list:
25924 requirement
25925 requirement-list ';' requirement[opt] */
25926 static tree
25928 {
25931 {
25938 /* If we see a semi-colon, consume it. */
25942 /* Stop processing at the end of the list. */
25945 }
25947 /* Reverse the order of requirements so they are analyzed in
25948 declaration order. */
25950 }
25952 /* Parse a syntactic requirement or type requirement.
25954 requirement:
25955 simple-requirement
25956 compound-requirement
25957 type-requirement
25958 nested-requirement */
25959 static tree
25961 {
25968 else
25970 }
25972 /* Parse a simple requirement.
25974 simple-requirement:
25975 expression ';' */
25976 static tree
25978 {
25987 }
25989 /* Parse a type requirement
25991 type-requirement
25992 nested-name-specifier [opt] required-type-name ';'
25994 required-type-name:
25995 type-name
25996 'template' [opt] simple-template-id */
25997 static tree
25999 {
26002 // Save the scope before parsing name specifiers.
26013 tree type;
26015 {
26024 }
26025 else
26044 }
26046 /* Parse a compound requirement
26048 compound-requirement:
26049 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26050 static tree
26052 {
26053 /* Parse an expression enclosed in '{ }'s. */
26054 matching_braces braces;
26065 /* Parse the optional noexcept. */
26068 {
26071 }
26073 /* Parse the optional trailing return type. */
26076 {
26084 }
26087 }
26089 /* Parse a nested requirement. This is the same as a requires clause.
26091 nested-requirement:
26092 requires-clause */
26093 static tree
26095 {
26101 }
26103 /* Support Functions */
26105 /* Return the appropriate prefer_type argument for lookup_name_real based on
26106 tag_type and template_mem_access. */
26110 {
26111 /* DR 141: When looking in the current enclosing context for a template-name
26112 after -> or ., only consider class templates. */
26116 {
26120 }
26121 }
26123 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26124 NAME should have one of the representations used for an
26125 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26126 is returned. If PARSER->SCOPE is a dependent type, then a
26127 SCOPE_REF is returned.
26129 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26130 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26131 was formed. Abstractly, such entities should not be passed to this
26132 function, because they do not need to be looked up, but it is
26133 simpler to check for this special case here, rather than at the
26134 call-sites.
26136 In cases not explicitly covered above, this function returns a
26137 DECL, OVERLOAD, or baselink representing the result of the lookup.
26138 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26139 is returned.
26141 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26142 (e.g., "struct") that was used. In that case bindings that do not
26143 refer to types are ignored.
26145 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26146 ignored.
26148 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26149 are ignored.
26151 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26152 types.
26154 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26155 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26156 NULL_TREE otherwise. */
26158 static cp_expr
26165 location_t name_location)
26166 {
26167 tree decl;
26170 /* Assume that the lookup will be unambiguous. */
26174 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26175 no longer valid. Note that if we are parsing tentatively, and
26176 the parse fails, OBJECT_TYPE will be automatically restored. */
26182 /* A template-id has already been resolved; there is no lookup to
26183 do. */
26187 {
26191 }
26193 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26194 it should already have been checked to make sure that the name
26195 used matches the type being destroyed. */
26197 {
26198 tree type;
26200 /* Figure out to which type this destructor applies. */
26205 else
26207 /* If that's not a class type, there is no destructor. */
26218 }
26220 /* By this point, the NAME should be an ordinary identifier. If
26221 the id-expression was a qualified name, the qualifying scope is
26222 stored in PARSER->SCOPE at this point. */
26225 /* Perform the lookup. */
26227 {
26233 /* If the SCOPE is dependent, the lookup must be deferred until
26234 the template is instantiated -- unless we are explicitly
26235 looking up names in uninstantiated templates. Even then, we
26236 cannot look up the name if the scope is not a class type; it
26237 might, for example, be a template type parameter. */
26242 /* Defer lookup. */
26244 else
26245 {
26248 /* If PARSER->SCOPE is a dependent type, then it must be a
26249 class type, and we must not be checking dependencies;
26250 otherwise, we would have processed this lookup above. So
26251 that PARSER->SCOPE is not considered a dependent base by
26252 lookup_member, we must enter the scope here. */
26256 /* If the PARSER->SCOPE is a template specialization, it
26257 may be instantiated during name lookup. In that case,
26258 errors may be issued. Even if we rollback the current
26259 tentative parse, those errors are valid. */
26264 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26265 lookup result and the nested-name-specifier nominates a class C:
26266 * if the name specified after the nested-name-specifier, when
26267 looked up in C, is the injected-class-name of C (Clause 9), or
26268 * if the name specified after the nested-name-specifier is the
26269 same as the identifier or the simple-template-id's template-
26270 name in the last component of the nested-name-specifier,
26271 the name is instead considered to name the constructor of
26272 class C. [ Note: for example, the constructor is not an
26273 acceptable lookup result in an elaborated-type-specifier so
26274 the constructor would not be used in place of the
26275 injected-class-name. --end note ] Such a constructor name
26276 shall be used only in the declarator-id of a declaration that
26277 names a constructor or in a using-declaration. */
26285 /* If we have a single function from a using decl, pull it out. */
26292 }
26294 /* If the scope is a dependent type and either we deferred lookup or
26295 we did lookup but didn't find the name, rememeber the name. */
26298 {
26300 {
26301 tree type;
26303 /* The resolution to Core Issue 180 says that `struct
26304 A::B' should be considered a type-name, even if `A'
26305 is dependent. */
26310 }
26314 CPP_CLOSE_PAREN)))
26318 else
26321 is_template);
26322 }
26325 }
26327 {
26328 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26329 OBJECT_TYPE is not a class. */
26331 /* If the OBJECT_TYPE is a template specialization, it may
26332 be instantiated during name lookup. In that case, errors
26333 may be issued. Even if we rollback the current tentative
26334 parse, those errors are valid. */
26336 name,
26339 tf_warning_or_error);
26340 else
26344 /* Look it up in the enclosing context. DR 141: When looking for a
26345 template-name after -> or ., only consider class templates. */
26350 /* The object is type-dependent, so we can't look anything up; we used
26351 this to get the DR 141 behavior. */
26355 }
26356 else
26357 {
26363 }
26365 /* If the lookup failed, let our caller know. */
26369 /* Pull out the template from an injected-class-name (or multiple). */
26373 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26375 {
26378 /* The error message we have to print is too complicated for
26379 cp_parser_error, so we incorporate its actions directly. */
26381 {
26383 name);
26385 }
26387 }
26395 /* If we have resolved the name of a member declaration, check to
26396 see if the declaration is accessible. When the name resolves to
26397 set of overloaded functions, accessibility is checked when
26398 overload resolution is done.
26400 During an explicit instantiation, access is not checked at all,
26401 as per [temp.explicit]. */
26408 }
26410 /* Like cp_parser_lookup_name, but for use in the typical case where
26411 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26412 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26414 static tree
26416 {
26418 none_type,
26423 location);
26424 }
26426 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26427 the current context, return the TYPE_DECL. If TAG_NAME_P is
26428 true, the DECL indicates the class being defined in a class-head,
26429 or declared in an elaborated-type-specifier.
26431 Otherwise, return DECL. */
26433 static tree
26435 {
26436 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26437 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26439 struct A {
26440 template <typename T> struct B;
26441 };
26443 template <typename T> struct A::B {};
26445 Similarly, in an elaborated-type-specifier:
26447 namespace N { struct X{}; }
26449 struct A {
26450 template <typename T> friend struct N::X;
26451 };
26453 However, if the DECL refers to a class type, and we are in
26454 the scope of the class, then the name lookup automatically
26455 finds the TYPE_DECL created by build_self_reference rather
26456 than a TEMPLATE_DECL. For example, in:
26458 template <class T> struct S {
26459 S s;
26460 };
26462 there is no need to handle such case. */
26468 }
26470 /* If too many, or too few, template-parameter lists apply to the
26471 declarator, issue an error message. Returns TRUE if all went well,
26472 and FALSE otherwise. */
26474 static bool
26477 location_t declarator_location)
26478 {
26480 {
26482 {
26491 {
26492 /* If the DECLARATOR has the form `X<y>' then it uses one
26493 additional level of template parameters. */
26496 }
26498 return cp_parser_check_template_parameters
26500 declarator);
26501 }
26517 }
26519 }
26521 /* NUM_TEMPLATES were used in the current declaration. If that is
26522 invalid, return FALSE and issue an error messages. Otherwise,
26523 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26524 declarator and we can print more accurate diagnostics. */
26526 static bool
26530 location_t location,
26532 {
26533 /* If there are the same number of template classes and parameter
26534 lists, that's OK. */
26537 /* If there are more, but only one more, and the name ends in an identifier,
26538 then we are declaring a primary template. That's OK too. */
26542 /* If there are more template classes than parameter lists, we have
26543 something like:
26545 template <class T> void S<T>::R<T>::f (); */
26547 {
26557 else
26560 }
26561 /* Otherwise, there are too many template parameter lists. We have
26562 something like:
26564 template <class T> template <class U> void S::f(); */
26567 }
26569 /* Parse an optional `::' token indicating that the following name is
26570 from the global namespace. If so, PARSER->SCOPE is set to the
26571 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26572 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26573 Returns the new value of PARSER->SCOPE, if the `::' token is
26574 present, and NULL_TREE otherwise. */
26576 static tree
26578 {
26581 /* Peek at the next token. */
26583 /* If we're looking at a `::' token then we're starting from the
26584 global namespace, not our current location. */
26586 {
26587 /* Consume the `::' token. */
26589 /* Set the SCOPE so that we know where to start the lookup. */
26595 }
26597 {
26601 }
26604 }
26606 /* Returns TRUE if the upcoming token sequence is the start of a
26607 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26608 declarator is preceded by the `friend' specifier. */
26610 static bool
26612 {
26615 tree nested_name_specifier;
26618 /* The common case is that this is not a constructor declarator, so
26619 try to avoid doing lots of work if at all possible. It's not
26620 valid declare a constructor at function scope. */
26623 /* And only certain tokens can begin a constructor declarator. */
26631 /* Parse tentatively; we are going to roll back all of the tokens
26632 consumed here. */
26634 /* Assume that we are looking at a constructor declarator. */
26637 /* Look for the optional `::' operator. */
26640 /* Look for the nested-name-specifier. */
26641 nested_name_specifier
26652 /* Outside of a class-specifier, there must be a
26653 nested-name-specifier. Except in C++17 mode, where we
26654 might be declaring a guiding declaration. */
26661 /* If we have a class scope, this is easy; DR 147 says that S::S always
26662 names the constructor, and no other qualified name could. */
26665 {
26675 }
26676 /* If we still think that this might be a constructor-declarator,
26677 look for a class-name. */
26679 {
26680 /* If we have:
26682 template <typename T> struct S {
26683 S();
26684 };
26686 we must recognize that the nested `S' names a class. */
26690 tree type_decl;
26694 none_type,
26701 {
26707 none_type,
26712 else
26714 }
26716 /* If there was no class-name, then this is not a constructor.
26717 Otherwise, if we are in a class-specifier and we aren't
26718 handling a friend declaration, check that its type matches
26719 current_class_type (c++/38313). Note: error_mark_node
26720 is left alone for error recovery purposes. */
26722 && (outside_class_specifier_p
26728 /* If we're still considering a constructor, we have to see a `(',
26729 to begin the parameter-declaration-clause, followed by either a
26730 `)', an `...', or a decl-specifier. We need to check for a
26731 type-specifier to avoid being fooled into thinking that:
26733 S (f) (int);
26735 is a constructor. (It is actually a function named `f' that
26736 takes one parameter (of type `int') and returns a value of type
26737 `S'. */
26745 /* A parameter declaration begins with a decl-specifier,
26746 which is either the "attribute" keyword, a storage class
26747 specifier, or (usually) a type-specifier. */
26749 {
26750 tree type;
26754 /* Names appearing in the type-specifier should be looked up
26755 in the scope of the class. */
26759 {
26762 {
26766 {
26769 }
26770 }
26772 }
26774 /* Inside the constructor parameter list, surrounding
26775 template-parameter-lists do not apply. */
26776 saved_num_template_parameter_lists
26780 /* Look for the type-specifier. */
26782 CP_PARSER_FLAGS_NONE,
26788 parser->num_template_parameter_lists
26791 /* Leave the scope of the class. */
26796 }
26797 }
26799 /* We did not really want to consume any tokens. */
26803 }
26805 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26806 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26807 they must be performed once we are in the scope of the function.
26809 Returns the function defined. */
26811 static tree
26812 cp_parser_function_definition_from_specifiers_and_declarator
26815 tree attributes,
26817 {
26818 tree fn;
26821 /* Begin the function-definition. */
26824 /* The things we're about to see are not directly qualified by any
26825 template headers we've seen thus far. */
26828 /* If there were names looked up in the decl-specifier-seq that we
26829 did not check, check them now. We must wait until we are in the
26830 scope of the function to perform the checks, since the function
26831 might be a friend. */
26835 {
26840 }
26843 {
26844 /* Skip the entire function. */
26847 }
26849 {
26850 /* Seen already, skip it. An error message has already been output. */
26854 /* If this is a function from a class, pop the nested class. */
26857 }
26858 else
26859 {
26860 timevar_id_t tv;
26863 else
26869 }
26872 }
26874 /* Parse the part of a function-definition that follows the
26875 declarator. INLINE_P is TRUE iff this function is an inline
26876 function defined within a class-specifier.
26878 Returns the function defined. */
26880 static tree
26883 {
26884 tree fn;
26889 bool fully_implicit_function_template_p
26892 tree implicit_template_parms
26895 cp_binding_level* implicit_template_scope
26901 /* If the next token is `return', then the code may be trying to
26902 make use of the "named return value" extension that G++ used to
26903 support. */
26906 {
26907 /* Consume the `return' keyword. */
26909 /* Look for the identifier that indicates what value is to be
26910 returned. */
26912 /* Issue an error message. */
26915 /* Skip tokens until we reach the start of the function body. */
26917 {
26924 }
26925 }
26926 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26927 anything declared inside `f'. */
26928 saved_in_unbraced_linkage_specification_p
26931 /* Inside the function, surrounding template-parameter-lists do not
26932 apply. */
26933 saved_num_template_parameter_lists
26937 /* If the next token is `try', `__transaction_atomic', or
26938 `__transaction_relaxed`, then we are looking at either function-try-block
26939 or function-transaction-block. Note that all of these include the
26940 function-body. */
26944 RID_TRANSACTION_RELAXED))
26948 else
26949 cp_parser_ctor_initializer_opt_and_function_body
26952 /* Finish the function. */
26954 /* Generate code for it, if necessary. */
26956 /* Restore the saved values. */
26957 parser->in_unbraced_linkage_specification_p
26959 parser->num_template_parameter_lists
26963 parser->fully_implicit_function_template_p
26965 parser->implicit_template_parms
26967 parser->implicit_template_scope
26974 }
26976 /* Parse a template-declaration body (following argument list). */
26978 static void
26980 tree parameter_list,
26982 {
26986 /* We just processed one more parameter list. */
26989 /* Get the deferred access checks from the parameter list. These
26990 will be checked once we know what is being declared, as for a
26991 member template the checks must be performed in the scope of the
26992 class containing the member. */
26995 /* Tentatively parse for a new template parameter list, which can either be
26996 the template keyword or a template introduction. */
27002 else
27003 {
27004 /* There are no access checks when parsing a template, as we do not
27005 know if a specialization will be a friend. */
27009 checks,
27010 member_p,
27015 /* If this is a member template declaration, let the front
27016 end know. */
27018 {
27023 }
27028 }
27029 /* We are done with the current parameter list. */
27034 /* Finish up. */
27037 /* Check the template arguments for a literal operator template. */
27041 {
27045 else
27046 {
27049 {
27055 }
27057 {
27066 }
27067 else
27069 }
27071 {
27074 " Expected non-type template argument pack <char...>"
27076 decl);
27077 else
27080 decl);
27081 }
27082 }
27084 /* Register member declarations. */
27087 /* If DECL is a function template, we must return to parse it later.
27088 (Even though there is no definition, there might be default
27089 arguments that need handling.) */
27093 }
27095 /* Parse a template introduction header for a template-declaration. Returns
27096 false if tentative parse fails. */
27098 static bool
27100 {
27107 /* Look for the optional `::' operator. */
27110 /* Look for the nested-name-specifier. */
27120 /* Look up the concept for which we will be matching
27121 template parameters. */
27131 /* Look for opening brace for introduction. */
27132 matching_braces braces;
27140 /* Build vector of placeholder parameters and grab
27141 matching identifiers. */
27144 /* The introduction-list shall not be empty. */
27147 {
27150 }
27152 /* Look for closing brace for introduction. */
27157 {
27161 }
27163 /* Build and associate the constraint. */
27166 {
27168 member_p);
27170 }
27174 }
27176 /* Parse a normal template-declaration following the template keyword. */
27178 static void
27180 {
27181 tree parameter_list;
27185 /* Look for the `<' token. */
27189 {
27190 /* 14.5.2.2 [temp.mem]
27192 A local class shall not have member templates. */
27197 }
27198 /* [temp]
27200 A template ... shall not have C linkage. */
27202 {
27205 /* Give it C++ linkage to avoid confusing other parts of the
27206 front end. */
27209 }
27210 else
27213 /* We cannot perform access checks on the template parameter
27214 declarations until we know what is being declared, just as we
27215 cannot check the decl-specifier list. */
27218 /* If the next token is `>', then we have an invalid
27219 specialization. Rather than complain about an invalid template
27220 parameter, issue an error message here. */
27222 {
27226 }
27227 else
27228 {
27229 /* Parse the template parameters. */
27231 }
27233 /* Look for the `>'. */
27236 /* Manage template requirements */
27238 {
27243 }
27246 member_p);
27248 /* For the erroneous case of a template with C linkage, we pushed an
27249 implicit C++ linkage scope; exit that scope now. */
27252 }
27254 /* Parse a template-declaration, assuming that the `export' (and
27255 `extern') keywords, if present, has already been scanned. MEMBER_P
27256 is as for cp_parser_template_declaration. */
27258 static bool
27260 {
27262 {
27266 }
27271 }
27273 /* Perform the deferred access checks from a template-parameter-list.
27274 CHECKS is a TREE_LIST of access checks, as returned by
27275 get_deferred_access_checks. */
27277 static void
27278 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27279 {
27283 }
27285 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27286 `function-definition' sequence that follows a template header.
27287 If MEMBER_P is true, this declaration appears in a class scope.
27289 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27290 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27292 static tree
27298 {
27301 cp_decl_specifier_seq decl_specifiers;
27305 /* This function is only used when processing a template
27306 declaration. */
27310 /* Defer access checks until we know what is being declared. */
27313 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27314 alternative. */
27317 CP_PARSER_FLAGS_OPTIONAL,
27323 /* There are no template typedefs. */
27325 {
27329 }
27331 /* Gather up the access checks that occurred the
27332 decl-specifier-seq. */
27335 /* Check for the declaration of a template class. */
27337 {
27340 {
27341 // If this is a declaration, but not a definition, associate
27342 // any constraints with the type declaration. Constraints
27343 // are associated with definitions in cp_parser_class_specifier.
27349 /* In this case:
27351 struct C {
27352 friend template <typename T> struct A<T>::B;
27353 };
27355 A<T>::B will be represented by a TYPENAME_TYPE, and
27356 therefore not recognized by shadow_tag. */
27358 && !decl
27365 else
27368 /* Perform access checks for template parameters. */
27371 /* Give a helpful diagnostic for
27372 template <class T> struct A { } a;
27373 if we aren't already recovering from an error. */
27376 {
27378 "a class template declaration must not declare "
27382 }
27383 }
27384 }
27386 /* Complain about missing 'typename' or other invalid type names. */
27389 {
27390 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27391 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27392 the rest of this declaration. */
27395 }
27397 /* If it's not a template class, try for a template function. If
27398 the next token is a `;', then this declaration does not declare
27399 anything. But, if there were errors in the decl-specifiers, then
27400 the error might well have come from an attempted class-specifier.
27401 In that case, there's no need to warn about a missing declarator. */
27405 {
27408 checks,
27410 member_p,
27411 declares_class_or_enum,
27415 /* 7.1.1-1 [dcl.stc]
27417 A storage-class-specifier shall not be specified in an explicit
27418 specialization... */
27420 && explicit_specialization_p
27422 {
27426 }
27430 }
27432 /* Look for a trailing `;' after the declaration. */
27438 out:
27441 /* Clear any current qualification; whatever comes next is the start
27442 of something new. */
27448 }
27450 /* Parse a cast-expression that is not the operand of a unary "&". */
27452 static cp_expr
27454 {
27457 }
27459 /* Parse a functional cast to TYPE. Returns an expression
27460 representing the cast. */
27462 static cp_expr
27464 {
27466 tree expression_list;
27467 cp_expr cast;
27476 {
27486 /* Create a location of the form:
27487 type_name{i, f}
27488 ^~~~~~~~~~~~~~~
27489 with caret == start at the start of the type name,
27490 finishing at the closing brace. */
27491 location_t finish_loc
27494 finish_loc);
27497 }
27506 else
27507 {
27510 }
27513 tf_warning_or_error);
27514 /* [expr.const]/1: In an integral constant expression "only type
27515 conversions to integral or enumeration type can be used". */
27521 NIC_CONSTRUCTOR))
27524 /* Create a location of the form:
27525 float(i)
27526 ^~~~~~~~
27527 with caret == start at the start of the type name,
27528 finishing at the closing paren. */
27529 location_t finish_loc
27534 }
27536 /* Save the tokens that make up the body of a member function defined
27537 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27538 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27539 specifiers applied to the declaration. Returns the FUNCTION_DECL
27540 for the member function. */
27542 static tree
27546 tree attributes)
27547 {
27550 tree fn;
27553 /* Create the FUNCTION_DECL. */
27557 /* If something went badly wrong, bail out now. */
27559 {
27560 /* If there's a function-body, skip it. */
27565 }
27567 /* Remember it, if there default args to post process. */
27570 /* Save away the tokens that make up the body of the
27571 function. */
27577 RID_TRANSACTION_ATOMIC))
27578 {
27580 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27587 {
27593 }
27594 else
27597 {
27601 }
27602 }
27604 /* Handle function try blocks. */
27606 {
27609 }
27610 /* We can have braced-init-list mem-initializers before the fn body. */
27612 {
27615 {
27616 /* cache_group will stop after an un-nested { } pair, too. */
27620 /* variadic mem-inits have ... after the ')'. */
27623 }
27624 }
27626 /* Handle function try blocks. */
27632 /* Save away the inline definition; we will process it when the
27633 class is complete. */
27637 /* We need to know that this was defined in the class, so that
27638 friend templates are handled correctly. */
27641 /* Add FN to the queue of functions to be parsed later. */
27645 }
27647 /* Save the tokens that make up the in-class initializer for a non-static
27648 data member. Returns a DEFAULT_ARG. */
27650 static tree
27652 {
27654 }
27656 /* Parse a template-argument-list, as well as the trailing ">" (but
27657 not the opening "<"). See cp_parser_template_argument_list for the
27658 return value. */
27660 static tree
27662 {
27663 tree arguments;
27664 tree saved_scope;
27665 tree saved_qualifying_scope;
27666 tree saved_object_scope;
27671 /* [temp.names]
27673 When parsing a template-id, the first non-nested `>' is taken as
27674 the end of the template-argument-list rather than a greater-than
27675 operator. */
27676 saved_greater_than_is_operator_p
27679 /* Parsing the argument list may modify SCOPE, so we save it
27680 here. */
27684 /* We need to evaluate the template arguments, even though this
27685 template-id may be nested within a "sizeof". */
27690 /* Parse the template-argument-list itself. */
27694 else
27696 /* Look for the `>' that ends the template-argument-list. If we find
27697 a '>>' instead, it's probably just a typo. */
27699 {
27701 {
27702 /* In C++0x, a `>>' in a template argument list or cast
27703 expression is considered to be two separate `>'
27704 tokens. So, change the current token to a `>', but don't
27705 consume it: it will be consumed later when the outer
27706 template argument list (or cast expression) is parsed.
27707 Note that this replacement of `>' for `>>' is necessary
27708 even if we are parsing tentatively: in the tentative
27709 case, after calling
27710 cp_parser_enclosed_template_argument_list we will always
27711 throw away all of the template arguments and the first
27712 closing `>', either because the template argument list
27713 was erroneous or because we are replacing those tokens
27714 with a CPP_TEMPLATE_ID token. The second `>' (which will
27715 not have been thrown away) is needed either to close an
27716 outer template argument list or to complete a new-style
27717 cast. */
27720 }
27722 {
27723 /* If we're in a nested template argument list, the '>>' has
27724 to be a typo for '> >'. We emit the error message, but we
27725 continue parsing and we push a '>' as next token, so that
27726 the argument list will be parsed correctly. Note that the
27727 global source location is still on the token before the
27728 '>>', so we need to say explicitly where we want it. */
27736 }
27737 else
27738 {
27739 /* If this is not a nested template argument list, the '>>'
27740 is a typo for '>'. Emit an error message and continue.
27741 Same deal about the token location, but here we can get it
27742 right by consuming the '>>' before issuing the diagnostic. */
27745 "spurious %<>>%>, use %<>%> to terminate "
27747 }
27748 }
27749 else
27751 /* The `>' token might be a greater-than operator again now. */
27752 parser->greater_than_is_operator_p
27754 /* Restore the SAVED_SCOPE. */
27762 }
27764 /* MEMBER_FUNCTION is a member function, or a friend. If default
27765 arguments, or the body of the function have not yet been parsed,
27766 parse them now. */
27768 static void
27770 {
27772 /* If this member is a template, get the underlying
27773 FUNCTION_DECL. */
27777 /* There should not be any class definitions in progress at this
27778 point; the bodies of members are only parsed outside of all class
27779 definitions. */
27781 /* While we're parsing the member functions we might encounter more
27782 classes. We want to handle them right away, but we don't want
27783 them getting mixed up with functions that are currently in the
27784 queue. */
27787 /* Make sure that any template parameters are in scope. */
27790 /* If the body of the function has not yet been parsed, parse it
27791 now. */
27793 {
27794 tree function_scope;
27797 /* The function is no longer pending; we are processing it. */
27802 /* If this is a local class, enter the scope of the containing
27803 function. */
27808 /* Push the body of the function onto the lexer stack. */
27811 /* Let the front end know that we going to be defining this
27812 function. */
27816 /* Don't do access checking if it is a templated function. */
27820 /* #pragma omp declare reduction needs special parsing. */
27822 {
27827 }
27828 else
27829 /* Now, parse the body of the function. */
27836 /* Leave the scope of the containing function. */
27840 }
27842 /* Remove any template parameters from the symbol table. */
27845 /* Restore the queue. */
27848 }
27850 /* If DECL contains any default args, remember it on the unparsed
27851 functions queue. */
27853 static void
27855 {
27856 tree probe;
27859 probe;
27862 {
27866 }
27867 }
27869 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27870 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27871 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27872 from the parameter-type-list. */
27874 static tree
27877 {
27879 tree parsed_arg;
27885 /* Push the saved tokens for the default argument onto the parser's
27886 lexer stack. */
27892 /* Parse the default argument. */
27903 {
27904 /* In a non-template class, check conversions now. In a template,
27905 we'll wait and instantiate these as needed. */
27908 tf_warning_or_error);
27911 else
27913 }
27915 /* If the token stream has not been completely used up, then
27916 there was extra junk after the end of the default
27917 argument. */
27919 {
27922 else
27924 }
27926 /* Revert to the main lexer. */
27930 }
27932 /* FIELD is a non-static data member with an initializer which we saved for
27933 later; parse it now. */
27935 static void
27937 {
27938 tree def;
27945 NULL_TREE);
27951 }
27953 /* FN is a FUNCTION_DECL which may contains a parameter with an
27954 unparsed DEFAULT_ARG. Parse the default args now. This function
27955 assumes that the current scope is the scope in which the default
27956 argument should be processed. */
27958 static void
27960 {
27964 /* While we're parsing the default args, we might (due to the
27965 statement expression extension) encounter more classes. We want
27966 to handle them right away, but we don't want them getting mixed
27967 up with default args that are currently in the queue. */
27970 /* Local variable names (and the `this' keyword) may not appear
27971 in a default argument. */
27982 {
27984 tree parsed_arg;
27986 tree copy;
27993 /* This can happen for a friend declaration for a function
27994 already declared with default arguments. */
27997 parsed_arg
27999 default_arg,
28003 /* Update any instantiations we've already created. */
28007 }
28011 /* Make sure no default arg is missing. */
28014 /* Restore the state of local_variables_forbidden_p. */
28017 /* Restore the queue. */
28019 }
28021 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28023 sizeof ... ( identifier )
28025 where the 'sizeof' token has already been consumed. */
28027 static tree
28029 {
28030 /* Consume the `...'. */
28034 matching_parens parens;
28038 else
28046 /* The name is not qualified. */
28065 }
28067 /* Parse the operand of `sizeof' (or a similar operator). Returns
28068 either a TYPE or an expression, depending on the form of the
28069 input. The KEYWORD indicates which kind of expression we have
28070 encountered. */
28072 static tree
28074 {
28081 /* If it's a `...', then we are computing the length of a parameter
28082 pack. */
28087 /* Types cannot be defined in a `sizeof' expression. Save away the
28088 old message. */
28090 /* And create the new one. */
28096 /* The restrictions on constant-expressions do not apply inside
28097 sizeof expressions. */
28098 saved_integral_constant_expression_p
28100 saved_non_integral_constant_expression_p
28104 /* Do not actually evaluate the expression. */
28107 /* If it's a `(', then we might be looking at the type-id
28108 construction. */
28110 {
28113 /* We can't be sure yet whether we're looking at a type-id or an
28114 expression. */
28117 matching_parens parens;
28120 /* Note: as a GNU Extension, compound literals are considered
28121 postfix-expressions as they are in C99, so they are valid
28122 arguments to sizeof. See comment in cp_parser_cast_expression
28123 for details. */
28126 else
28127 {
28130 /* Look for the type-id. */
28132 /* Look for the closing `)'. */
28135 }
28137 /* If all went well, then we're done. */
28139 {
28140 cp_decl_specifier_seq decl_specs;
28142 /* Build a trivial decl-specifier-seq. */
28146 /* Call grokdeclarator to figure out what type this is. */
28149 TYPENAME,
28152 }
28153 }
28155 /* If the type-id production did not work out, then we must be
28156 looking at the unary-expression production. */
28160 /* Go back to evaluating expressions. */
28164 /* Free the message we created. */
28166 /* And restore the old one. */
28168 parser->integral_constant_expression_p
28170 parser->non_integral_constant_expression_p
28174 }
28176 /* If the current declaration has no declarator, return true. */
28178 static bool
28180 {
28181 /* If the next token is a `;' or a `,' then there is no
28182 declarator. */
28185 }
28187 /* Update the DECL_SPECS to reflect the storage class indicated by
28188 KEYWORD. */
28190 static void
28195 {
28196 cp_storage_class storage_class;
28199 {
28203 }
28205 {
28208 }
28213 {
28216 }
28219 {
28237 }
28241 /* A storage class specifier cannot be applied alongside a typedef
28242 specifier. If there is a typedef specifier present then set
28243 conflicting_specifiers_p which will trigger an error later
28244 on in grokdeclarator. */
28247 }
28249 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28250 is true, the type is a class or enum definition. */
28252 static void
28254 tree type_spec,
28257 {
28260 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28261 (with, for example, in "typedef int wchar_t;") we remember that
28262 this is what happened. In system headers, we ignore these
28263 declarations so that G++ can work with system headers that are not
28264 C++-safe. */
28266 && !type_definition_p
28276 {
28279 ds_redefined_builtin_type_spec,
28280 token);
28282 {
28286 }
28287 }
28290 else
28291 {
28296 }
28297 }
28299 /* True iff TOKEN is the GNU keyword __thread. */
28301 static bool
28303 {
28306 }
28308 /* Set the location for a declarator specifier and check if it is
28309 duplicated.
28311 DECL_SPECS is the sequence of declarator specifiers onto which to
28312 set the location.
28314 DS is the single declarator specifier to set which location is to
28315 be set onto the existing sequence of declarators.
28317 LOCATION is the location for the declarator specifier to
28318 consider. */
28320 static void
28323 {
28332 {
28336 }
28337 else
28338 {
28340 {
28344 else
28345 {
28348 OPT_Wlong_long,
28350 }
28351 }
28353 {
28358 else
28359 {
28363 }
28364 }
28365 else
28366 {
28382 "__complex"
28383 };
28387 }
28388 }
28389 }
28391 /* Return true iff the declarator specifier DS is present in the
28392 sequence of declarator specifiers DECL_SPECS. */
28394 bool
28396 cp_decl_spec ds)
28397 {
28404 }
28406 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28407 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28409 static bool
28411 {
28413 }
28415 /* Issue an error message indicating that TOKEN_DESC was expected.
28416 If KEYWORD is true, it indicated this function is called by
28417 cp_parser_require_keword and the required token can only be
28418 a indicated keyword.
28420 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28421 within any error as the location of an "opening" token matching
28422 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28423 RT_CLOSE_PAREN). */
28425 static void
28427 required_token token_desc,
28429 location_t matching_location)
28430 {
28436 {
28505 }
28508 {
28510 {
28588 }
28589 }
28593 }
28596 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28597 issue an error message indicating that TOKEN_DESC was expected.
28599 Returns the token consumed, if the token had the appropriate type.
28600 Otherwise, returns NULL.
28602 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28603 within any error as the location of an "opening" token matching
28604 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28605 RT_CLOSE_PAREN). */
28610 required_token token_desc,
28611 location_t matching_location)
28612 {
28615 else
28616 {
28617 /* Output the MESSAGE -- unless we're parsing tentatively. */
28620 matching_location);
28622 }
28623 }
28625 /* An error message is produced if the next token is not '>'.
28626 All further tokens are skipped until the desired token is
28627 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28629 static void
28631 {
28632 /* Current level of '< ... >'. */
28634 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28637 /* Are we ready, yet? If not, issue error message. */
28641 /* Skip tokens until the desired token is found. */
28643 {
28644 /* Peek at the next token. */
28646 {
28654 /* C++0x views the `>>' operator as two `>' tokens, but
28655 C++98 does not. */
28658 {
28659 /* We've hit a `>>' where the first `>' closes the
28660 template argument list, and the second `>' is
28661 spurious. Just consume the `>>' and stop; we've
28662 already produced at least one error. */
28665 }
28666 /* Fall through for C++0x, so we handle the second `>' in
28667 the `>>'. */
28672 {
28673 /* We've reached the token we want, consume it and stop. */
28676 }
28695 /* The '>' was probably forgotten, don't look further. */
28700 }
28702 /* Consume this token. */
28704 }
28705 }
28707 /* If the next token is the indicated keyword, consume it. Otherwise,
28708 issue an error message indicating that TOKEN_DESC was expected.
28710 Returns the token consumed, if the token had the appropriate type.
28711 Otherwise, returns NULL. */
28716 required_token token_desc)
28717 {
28721 {
28723 UNKNOWN_LOCATION);
28725 }
28728 }
28730 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28731 function-definition. */
28733 static bool
28735 {
28738 /* A ctor-initializer begins with a `:'. */
28740 /* A function-try-block begins with `try'. */
28742 /* A function-transaction-block begins with `__transaction_atomic'
28743 or `__transaction_relaxed'. */
28746 /* The named return value extension begins with `return'. */
28748 }
28750 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28751 definition. */
28753 static bool
28755 {
28762 }
28764 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28765 C++0x) ending a template-argument. */
28767 static bool
28769 {
28777 }
28779 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28780 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28782 static bool
28785 {
28791 /* Check for the sequence `<::' in the original code. It would be lexed as
28792 `[:', where `[' is a digraph, and there is no whitespace before
28793 `:'. */
28795 {
28800 }
28802 }
28804 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28805 or none_type otherwise. */
28807 static enum tag_types
28809 {
28811 {
28821 }
28822 }
28824 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28825 or none_type otherwise or if the token is null. */
28827 static enum tag_types
28829 {
28834 {
28842 }
28843 }
28845 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28847 static void
28849 {
28853 {
28857 type))
28860 }
28861 }
28863 /* Issue an error message if DECL is redeclared with different
28864 access than its original declaration [class.access.spec/3].
28865 This applies to nested classes, nested class templates and
28866 enumerations [class.mem/1]. */
28868 static void
28870 {
28881 }
28883 /* Look for the `template' keyword, as a syntactic disambiguator.
28884 Return TRUE iff it is present, in which case it will be
28885 consumed. */
28887 static bool
28889 {
28891 {
28892 /* In C++98 the `template' keyword can only be used within templates;
28893 outside templates the parser can always figure out what is a
28894 template and what is not. In C++11, per the resolution of DR 468,
28895 `template' is allowed in cases where it is not strictly necessary. */
28898 {
28901 "in C++98 %<template%> (as a disambiguator) is only "
28903 /* If this part of the token stream is rescanned, the same
28904 error message would be generated. So, we purge the token
28905 from the stream. */
28908 }
28909 else
28910 {
28911 /* Consume the `template' keyword. */
28914 }
28915 }
28917 }
28919 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28920 set PARSER->SCOPE, and perform other related actions. */
28922 static void
28924 {
28927 /* Get the stored value. */
28929 /* Set the scope from the stored value. */
28933 }
28935 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28936 encounter the end of a block before what we were looking for. */
28938 static bool
28942 {
28944 {
28947 /* Abort a parenthesized expression if we encounter a semicolon. */
28951 /* If we've reached the end of the file, stop. */
28957 /* We've hit the end of an enclosing block, so there's been some
28958 kind of syntax error. */
28961 /* Consume the token. */
28963 /* See if it starts a new group. */
28965 {
28967 /* In theory this should probably check end == '}', but
28968 cp_parser_save_member_function_body needs it to exit
28969 after either '}' or ')' when called with ')'. */
28972 }
28974 {
28978 }
28983 }
28984 }
28986 /* Like above, for caching a default argument or NSDMI. Both of these are
28987 terminated by a non-nested comma, but it can be unclear whether or not a
28988 comma is nested in a template argument list unless we do more parsing.
28989 In order to handle this ambiguity, when we encounter a ',' after a '<'
28990 we try to parse what follows as a parameter-declaration-list (in the
28991 case of a default argument) or a member-declarator (in the case of an
28992 NSDMI). If that succeeds, then we stop caching. */
28994 static tree
28996 {
29001 tree default_argument;
29003 /* Add tokens until we have processed the entire default
29004 argument. We add the range [first_token, token). */
29007 {
29008 /* For list-initialization, this is straightforward. */
29011 }
29013 {
29016 /* Peek at the next token. */
29018 /* What we do depends on what token we have. */
29020 {
29021 /* In valid code, a default argument must be
29022 immediately followed by a `,' `)', or `...'. */
29025 {
29026 /* If we've seen a '<', we might be in a
29027 template-argument-list. Until Core issue 325 is
29028 resolved, we don't know how this situation ought
29029 to be handled, so try to DTRT. We check whether
29030 what comes after the comma is a valid parameter
29031 declaration list. If it is, then the comma ends
29032 the default argument; otherwise the default
29033 argument continues. */
29037 /* Set ITALP so cp_parser_parameter_declaration_list
29038 doesn't decide to commit to this parse. */
29045 {
29046 /* Parse declarators until we reach a non-comma or
29047 somthing that cannot be an initializer.
29048 Just checking whether we're looking at a single
29049 declarator is insufficient. Consider:
29050 int var = tuple<T,U>::x;
29051 The template parameter 'U' looks exactly like a
29052 declarator. */
29053 do
29054 {
29065 }
29067 /* If we met an '=' or ';' then the original comma
29068 was the end of the NSDMI. Otherwise assume
29069 we're still in the NSDMI. */
29072 }
29073 else
29074 {
29081 }
29088 }
29089 /* FALLTHRU */
29092 /* If we run into a non-nested `;', `}', or `]',
29093 then the code is invalid -- but the default
29094 argument is certainly over. */
29099 /* Handle correctly int n = sizeof ... ( p ); */
29102 /* Update DEPTH, if necessary. */
29117 /* This might be the comparison operator, or it might
29118 start a template argument list. */
29125 /* Fall through for C++0x, which treats the `>>'
29126 operator like two `>' tokens in certain
29127 cases. */
29132 {
29133 /* This might be an operator, or it might close a
29134 template argument list. But if a previous '<'
29135 started a template argument list, this will have
29136 closed it, so we can't be in one anymore. */
29140 }
29143 /* If we run out of tokens, issue an error message. */
29151 /* In these cases, we should look for template-ids.
29152 For example, if the default argument is
29153 `X<int, double>()', we need to do name lookup to
29154 figure out whether or not `X' is a template; if
29155 so, the `,' does not end the default argument.
29157 That is not yet done. */
29162 }
29164 /* If we've reached the end, stop. */
29168 /* Add the token to the token block. */
29170 }
29172 /* Create a DEFAULT_ARG to represent the unparsed default
29173 argument. */
29180 }
29182 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29184 location_t
29186 {
29191 }
29193 /* Begin parsing tentatively. We always save tokens while parsing
29194 tentatively so that if the tentative parsing fails we can restore the
29195 tokens. */
29197 static void
29199 {
29200 /* Enter a new parsing context. */
29202 /* Begin saving tokens. */
29204 /* In order to avoid repetitive access control error messages,
29205 access checks are queued up until we are no longer parsing
29206 tentatively. */
29208 }
29210 /* Commit to the currently active tentative parse. */
29212 static void
29214 {
29218 /* Mark all of the levels as committed. */
29221 {
29228 }
29229 }
29231 /* Commit to the topmost currently active tentative parse.
29233 Note that this function shouldn't be called when there are
29234 irreversible side-effects while in a tentative state. For
29235 example, we shouldn't create a permanent entry in the symbol
29236 table, or issue an error message that might not apply if the
29237 tentative parse is aborted. */
29239 static void
29241 {
29246 {
29254 }
29255 }
29257 /* Abort the currently active tentative parse. All consumed tokens
29258 will be rolled back, and no diagnostics will be issued. */
29260 static void
29262 {
29266 /* Now, pretend that we want to see if the construct was
29267 successfully parsed. */
29269 }
29271 /* Stop parsing tentatively. If a parse error has occurred, restore the
29272 token stream. Otherwise, commit to the tokens we have consumed.
29273 Returns true if no error occurred; false otherwise. */
29275 static bool
29277 {
29281 /* Remember whether or not an error occurred, since we are about to
29282 destroy that information. */
29284 /* Remove the topmost context from the stack. */
29287 /* If no parse errors occurred, commit to the tentative parse. */
29289 {
29290 /* Commit to the tokens read tentatively, unless that was
29291 already done. */
29296 }
29297 /* Otherwise, if errors occurred, roll back our state so that things
29298 are just as they were before we began the tentative parse. */
29299 else
29300 {
29303 }
29304 /* Add the context to the front of the free list. */
29309 }
29311 /* Returns true if we are parsing tentatively and are not committed to
29312 this tentative parse. */
29314 static bool
29316 {
29319 }
29321 /* Returns nonzero iff an error has occurred during the most recent
29322 tentative parse. */
29324 static bool
29326 {
29329 }
29331 /* Returns nonzero if GNU extensions are allowed. */
29333 static bool
29335 {
29337 }
29338 \f
29339 /* Objective-C++ Productions */
29342 /* Parse an Objective-C expression, which feeds into a primary-expression
29343 above.
29345 objc-expression:
29346 objc-message-expression
29347 objc-string-literal
29348 objc-encode-expression
29349 objc-protocol-expression
29350 objc-selector-expression
29352 Returns a tree representation of the expression. */
29354 static cp_expr
29356 {
29357 /* Try to figure out what kind of declaration is present. */
29361 {
29371 {
29383 }
29384 /* FALLTHRU */
29390 }
29393 }
29395 /* Parse an Objective-C message expression.
29397 objc-message-expression:
29398 [ objc-message-receiver objc-message-args ]
29400 Returns a representation of an Objective-C message. */
29402 static tree
29404 {
29416 /* Construct a location e.g.
29417 [self func1:5]
29418 ^~~~~~~~~~~~~~
29419 ranging from the '[' to the ']', with the caret at the start. */
29424 }
29426 /* Parse an objc-message-receiver.
29428 objc-message-receiver:
29429 expression
29430 simple-type-specifier
29432 Returns a representation of the type or expression. */
29434 static tree
29436 {
29437 tree rcv;
29439 /* An Objective-C message receiver may be either (1) a type
29440 or (2) an expression. */
29444 /* If that worked out, fine. */
29451 CP_PARSER_FLAGS_NONE);
29458 }
29460 /* Parse the arguments and selectors comprising an Objective-C message.
29462 objc-message-args:
29463 objc-selector
29464 objc-selector-args
29465 objc-selector-args , objc-comma-args
29467 objc-selector-args:
29468 objc-selector [opt] : assignment-expression
29469 objc-selector-args objc-selector [opt] : assignment-expression
29471 objc-comma-args:
29472 assignment-expression
29473 objc-comma-args , assignment-expression
29475 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29476 selector arguments and TREE_VALUE containing a list of comma
29477 arguments. */
29479 static tree
29481 {
29487 {
29493 /* Detect if we have a unary selector. */
29502 sel_args
29507 }
29509 /* Handle non-selector arguments, if any. */
29511 {
29512 tree arg;
29517 addl_args
29522 }
29525 {
29528 }
29531 }
29533 /* Parse an Objective-C encode expression.
29535 objc-encode-expression:
29536 @encode objc-typename
29538 Returns an encoded representation of the type argument. */
29540 static cp_expr
29542 {
29543 tree type;
29548 matching_parens parens;
29555 {
29559 }
29561 /* This happens if we find @encode(T) (where T is a template
29562 typename or something dependent on a template typename) when
29563 parsing a template. In that case, we can't compile it
29564 immediately, but we rather create an AT_ENCODE_EXPR which will
29565 need to be instantiated when the template is used.
29566 */
29568 {
29572 }
29575 /* Build a location of the form:
29576 @encode(int)
29577 ^~~~~~~~~~~~
29578 with caret==start at the @ token, finishing at the close paren. */
29579 location_t combined_loc
29584 }
29586 /* Parse an Objective-C @defs expression. */
29588 static tree
29590 {
29591 tree name;
29594 matching_parens parens;
29600 }
29602 /* Parse an Objective-C protocol expression.
29604 objc-protocol-expression:
29605 @protocol ( identifier )
29607 Returns a representation of the protocol expression. */
29609 static tree
29611 {
29612 tree proto;
29616 matching_parens parens;
29621 /* Build a location of the form:
29622 @protocol(prot)
29623 ^~~~~~~~~~~~~~~
29624 with caret==start at the @ token, finishing at the close paren. */
29625 location_t combined_loc
29631 }
29633 /* Parse an Objective-C selector expression.
29635 objc-selector-expression:
29636 @selector ( objc-method-signature )
29638 objc-method-signature:
29639 objc-selector
29640 objc-selector-seq
29642 objc-selector-seq:
29643 objc-selector :
29644 objc-selector-seq objc-selector :
29646 Returns a representation of the method selector. */
29648 static tree
29650 {
29657 matching_parens parens;
29663 {
29672 {
29673 /* Detect if we have a unary selector. */
29675 {
29678 }
29679 else
29680 {
29682 }
29683 }
29688 {
29689 sel_seq
29692 sel_seq
29695 }
29696 else
29697 sel_seq
29702 }
29704 finish_selector:
29708 /* Build a location of the form:
29709 @selector(func)
29710 ^~~~~~~~~~~~~~~
29711 with caret==start at the @ token, finishing at the close paren. */
29712 location_t combined_loc
29716 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29719 }
29721 /* Parse a list of identifiers.
29723 objc-identifier-list:
29724 identifier
29725 objc-identifier-list , identifier
29727 Returns a TREE_LIST of identifier nodes. */
29729 static tree
29731 {
29732 tree identifier;
29733 tree list;
29744 {
29751 identifier));
29753 }
29756 }
29758 /* Parse an Objective-C alias declaration.
29760 objc-alias-declaration:
29761 @compatibility_alias identifier identifier ;
29763 This function registers the alias mapping with the Objective-C front end.
29764 It returns nothing. */
29766 static void
29768 {
29776 }
29778 /* Parse an Objective-C class forward-declaration.
29780 objc-class-declaration:
29781 @class objc-identifier-list ;
29783 The function registers the forward declarations with the Objective-C
29784 front end. It returns nothing. */
29786 static void
29788 {
29791 {
29792 tree id;
29802 else
29804 }
29806 }
29808 /* Parse a list of Objective-C protocol references.
29810 objc-protocol-refs-opt:
29811 objc-protocol-refs [opt]
29813 objc-protocol-refs:
29814 < objc-identifier-list >
29816 Returns a TREE_LIST of identifiers, if any. */
29818 static tree
29820 {
29824 {
29828 }
29831 }
29833 /* Parse a Objective-C visibility specification. */
29835 static void
29837 {
29841 {
29856 }
29858 /* Eat '@private'/'@protected'/'@public'. */
29860 }
29862 /* Parse an Objective-C method type. Return 'true' if it is a class
29863 (+) method, and 'false' if it is an instance (-) method. */
29867 {
29870 else
29872 }
29874 /* Parse an Objective-C protocol qualifier. */
29876 static tree
29878 {
29891 {
29896 }
29899 }
29901 /* Parse an Objective-C typename. */
29903 static tree
29905 {
29909 {
29912 matching_parens parens;
29916 /* An ObjC type name may consist of just protocol qualifiers, in which
29917 case the type shall default to 'id'. */
29919 {
29922 /* If the type could not be parsed, an error has already
29923 been produced. For error recovery, behave as if it had
29924 not been specified, which will use the default type
29925 'id'. */
29927 {
29929 /* We need to skip to the closing parenthesis as
29930 cp_parser_type_id() does not seem to do it for
29931 us. */
29936 }
29937 }
29941 }
29944 }
29946 /* Check to see if TYPE refers to an Objective-C selector name. */
29948 static bool
29950 {
29956 }
29958 /* Parse an Objective-C selector. */
29960 static tree
29962 {
29966 {
29969 }
29971 /* C++ operator names are allowed to appear in ObjC selectors. */
29973 {
29986 }
29987 }
29989 /* Parse an Objective-C params list. */
29991 static tree
29993 {
29999 {
30009 /* Detect if we have a unary selector. */
30012 {
30015 }
30019 {
30020 /* Something went quite wrong. There should be a colon
30021 here, but there is not. Stop parsing parameters. */
30023 }
30025 /* New ObjC allows attributes on parameters too. */
30030 params
30033 type_name,
30034 identifier,
30035 parm_attr));
30038 }
30041 {
30044 }
30046 /* We allow tail attributes for the method. */
30048 {
30056 }
30059 {
30062 }
30064 }
30066 /* Parse the non-keyword Objective-C params. */
30068 static tree
30071 {
30077 {
30079 tree parm;
30085 {
30090 }
30092 /* TODO: parse attributes for tail parameters. */
30101 }
30103 /* We allow tail attributes for the method. */
30105 {
30107 {
30112 }
30113 else
30114 /* We have an error, but parse the attributes, so that we can
30115 carry on. */
30121 }
30124 }
30126 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30128 static void
30130 {
30133 /* If the next token is `extern' and the following token is a string
30134 literal, then we have a linkage specification. */
30136 && cp_parser_is_pure_string_literal
30139 /* Handle #pragma, if any. */
30142 /* Allow stray semicolons. */
30145 /* Mark methods as optional or required, when building protocols. */
30147 {
30150 }
30152 {
30155 }
30158 /* Other stray characters must generate errors. */
30160 {
30164 }
30165 /* Finally, try to parse a block-declaration, or a function-definition. */
30166 else
30168 }
30170 /* Parse a method signature. */
30172 static tree
30174 {
30190 }
30192 static bool
30194 {
30195 tree tattr;
30200 /* If the attributes are followed by a method introducer, this is not allowed.
30201 Dump the attributes and flag the situation. */
30206 /* Otherwise, the attributes introduce some interstitial code, possibly so
30207 rewind to allow that check. */
30210 }
30212 /* Parse an Objective-C method prototype list. */
30214 static void
30216 {
30220 {
30222 {
30227 else
30231 {
30235 }
30238 }
30244 OPT_Wattributes,
30246 else
30247 /* Allow for interspersed non-ObjC++ code. */
30251 }
30255 else
30259 }
30261 /* Parse an Objective-C method definition list. */
30263 static void
30265 {
30269 {
30270 tree meth;
30273 {
30279 else
30284 {
30288 }
30290 NULL_TREE);
30292 /* For historical reasons, we accept an optional semicolon. */
30299 {
30306 }
30307 }
30308 /* The following case will be removed once @synthesize is
30309 completely implemented. */
30320 else
30321 /* Allow for interspersed non-ObjC++ code. */
30325 }
30329 else
30333 }
30335 /* Parse Objective-C ivars. */
30337 static void
30339 {
30350 {
30351 cp_decl_specifier_seq declspecs;
30353 tree prefix_attributes;
30361 CP_PARSER_FLAGS_OPTIONAL,
30365 /* auto, register, static, extern, mutable. */
30367 {
30370 }
30372 /* thread_local. */
30374 {
30377 }
30379 /* typedef. */
30381 {
30384 }
30389 /* Keep going until we hit the `;' at the end of the
30390 declaration. */
30392 {
30397 /* Check for a (possibly unnamed) bitfield declaration. */
30405 {
30406 /* Get the name of the bitfield. */
30409 sfk_none);
30411 eat_colon:
30413 /* Get the width of the bitfield. */
30414 width
30416 }
30417 else
30418 {
30419 /* Parse the declarator. */
30420 declarator
30426 }
30428 /* Look for attributes that apply to the ivar. */
30430 /* Remember which attributes are prefix attributes and
30431 which are not. */
30433 /* Combine the attributes. */
30437 /* Create the bitfield declaration. */
30440 else
30445 /* Add the instance variable. */
30449 /* Reset PREFIX_ATTRIBUTES. */
30451 {
30456 }
30461 {
30464 }
30466 }
30470 }
30475 /* Do not consume the RID_AT_END, so it will be read again as terminating
30476 the @interface of @implementation. */
30480 /* For historical reasons, we accept an optional semicolon. */
30483 }
30485 /* Parse an Objective-C protocol declaration. */
30487 static void
30489 {
30495 {
30500 }
30502 /* See if we have a forward declaration or a definition. */
30505 /* Try a forward declaration first. */
30507 {
30509 {
30510 tree id;
30520 else
30522 }
30524 }
30526 /* Ok, we got a full-fledged definition (or at least should). */
30527 else
30528 {
30533 }
30534 }
30536 /* Parse an Objective-C superclass or category. */
30538 static void
30543 {
30549 {
30552 }
30554 {
30555 matching_parens parens;
30558 /* If there is no category name, and this is an @interface, we
30559 have a class extension. */
30561 {
30564 }
30565 else
30569 }
30570 }
30572 /* Parse an Objective-C class interface. */
30574 static void
30576 {
30583 {
30584 /* It's hard to recover because even if valid @interface stuff
30585 is to follow, we can't compile it (or validate it) if we
30586 don't even know which class it refers to. Let's assume this
30587 was a stray '@interface' token in the stream and skip it.
30588 */
30590 }
30595 /* We have either a class or a category on our hands. */
30598 else
30599 {
30601 /* Handle instance variable declarations, if any. */
30604 }
30607 }
30609 /* Parse an Objective-C class implementation. */
30611 static void
30613 {
30620 {
30621 /* It's hard to recover because even if valid @implementation
30622 stuff is to follow, we can't compile it (or validate it) if
30623 we don't even know which class it refers to. Let's assume
30624 this was a stray '@implementation' token in the stream and
30625 skip it.
30626 */
30628 }
30632 /* We have either a class or a category on our hands. */
30635 else
30636 {
30638 /* Handle instance variable declarations, if any. */
30641 }
30644 }
30646 /* Consume the @end token and finish off the implementation. */
30648 static void
30650 {
30653 }
30655 /* Parse an Objective-C declaration. */
30657 static void
30659 {
30660 /* Try to figure out what kind of declaration is present. */
30665 {
30681 }
30684 {
30707 }
30708 }
30710 /* Parse an Objective-C try-catch-finally statement.
30712 objc-try-catch-finally-stmt:
30713 @try compound-statement objc-catch-clause-seq [opt]
30714 objc-finally-clause [opt]
30716 objc-catch-clause-seq:
30717 objc-catch-clause objc-catch-clause-seq [opt]
30719 objc-catch-clause:
30720 @catch ( objc-exception-declaration ) compound-statement
30722 objc-finally-clause:
30723 @finally compound-statement
30725 objc-exception-declaration:
30726 parameter-declaration
30727 '...'
30729 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30731 Returns NULL_TREE.
30733 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30734 for C. Keep them in sync. */
30736 static tree
30738 {
30739 location_t location;
30740 tree stmt;
30745 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30746 node, lest it get absorbed into the surrounding block. */
30752 {
30756 matching_parens parens;
30762 {
30763 /* We have "@catch (...)" (where the '...' are literally
30764 what is in the code). Skip the '...'.
30765 parameter_declaration is set to NULL_TREE, and
30766 objc_being_catch_clauses() knows that that means
30767 '...'. */
30770 }
30771 else
30772 {
30773 /* We have "@catch (NSException *exception)" or something
30774 like that. Parse the parameter declaration. */
30778 else
30783 }
30786 else
30787 {
30788 /* If there was no open parenthesis, we are recovering from
30789 an error, and we are trying to figure out what mistake
30790 the user has made. */
30792 /* If there is an immediate closing parenthesis, the user
30793 probably forgot the opening one (ie, they typed "@catch
30794 NSException *e)". Parse the closing parenthesis and keep
30795 going. */
30799 /* If these is no immediate closing parenthesis, the user
30800 probably doesn't know that parenthesis are required at
30801 all (ie, they typed "@catch NSException *e"). So, just
30802 forget about the closing parenthesis and keep going. */
30803 }
30807 }
30809 {
30812 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30813 node, lest it get absorbed into the surrounding block. */
30817 }
30820 }
30822 /* Parse an Objective-C synchronized statement.
30824 objc-synchronized-stmt:
30825 @synchronized ( expression ) compound-statement
30827 Returns NULL_TREE. */
30829 static tree
30831 {
30832 location_t location;
30839 matching_parens parens;
30844 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30845 node, lest it get absorbed into the surrounding block. */
30850 }
30852 /* Parse an Objective-C throw statement.
30854 objc-throw-stmt:
30855 @throw assignment-expression [opt] ;
30857 Returns a constructed '@throw' statement. */
30859 static tree
30861 {
30873 }
30875 /* Parse an Objective-C statement. */
30877 static tree
30879 {
30880 /* Try to figure out what kind of declaration is present. */
30884 {
30895 }
30898 }
30900 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30901 look ahead to see if an objc keyword follows the attributes. This
30902 is to detect the use of prefix attributes on ObjC @interface and
30903 @protocol. */
30905 static bool
30907 {
30912 {
30915 }
30918 }
30920 /* This routine is a minimal replacement for
30921 c_parser_struct_declaration () used when parsing the list of
30922 types/names or ObjC++ properties. For example, when parsing the
30923 code
30925 @property (readonly) int a, b, c;
30927 this function is responsible for parsing "int a, int b, int c" and
30928 returning the declarations as CHAIN of DECLs.
30930 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30931 similar parsing. */
30932 static tree
30934 {
30936 cp_decl_specifier_seq declspecs;
30938 tree prefix_attributes;
30941 CP_PARSER_FLAGS_NONE,
30948 /* auto, register, static, extern, mutable. */
30950 {
30953 }
30955 /* thread_local. */
30957 {
30960 }
30962 /* typedef. */
30964 {
30967 }
30972 /* Keep going until we hit the `;' at the end of the declaration. */
30974 {
30979 /* Parse the declarator. */
30983 /* Look for attributes that apply to the ivar. */
30985 /* Remember which attributes are prefix attributes and
30986 which are not. */
30988 /* Combine the attributes. */
30998 /* Reset PREFIX_ATTRIBUTES. */
31000 {
31005 }
31012 {
31015 }
31016 else
31018 }
31020 }
31022 /* Parse an Objective-C @property declaration. The syntax is:
31024 objc-property-declaration:
31025 '@property' objc-property-attributes[opt] struct-declaration ;
31027 objc-property-attributes:
31028 '(' objc-property-attribute-list ')'
31030 objc-property-attribute-list:
31031 objc-property-attribute
31032 objc-property-attribute-list, objc-property-attribute
31034 objc-property-attribute
31035 'getter' = identifier
31036 'setter' = identifier
31037 'readonly'
31038 'readwrite'
31039 'assign'
31040 'retain'
31041 'copy'
31042 'nonatomic'
31044 For example:
31045 @property NSString *name;
31046 @property (readonly) id object;
31047 @property (retain, nonatomic, getter=getTheName) id name;
31048 @property int a, b, c;
31050 PS: This function is identical to
31051 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31052 static void
31054 {
31055 /* The following variables hold the attributes of the properties as
31056 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31057 seen. When we see an attribute, we set them to 'true' (if they
31058 are boolean properties) or to the identifier (if they have an
31059 argument, ie, for getter and setter). Note that here we only
31060 parse the list of attributes, check the syntax and accumulate the
31061 attributes that we find. objc_add_property_declaration() will
31062 then process the information. */
31072 /* 'properties' is the list of properties that we read. Usually a
31073 single one, but maybe more (eg, in "@property int a, b, c;" there
31074 are three). */
31075 tree properties;
31076 location_t loc;
31082 /* Parse the optional attribute list... */
31084 {
31085 /* Eat the '('. */
31086 matching_parens parens;
31090 {
31096 {
31099 }
31103 {
31114 {
31118 else
31123 }
31126 {
31130 }
31132 {
31134 {
31137 }
31138 else
31142 else
31144 }
31145 else
31146 {
31148 {
31151 }
31152 else
31154 }
31160 }
31167 else
31169 }
31171 /* FIXME: "@property (setter, assign);" will generate a spurious
31172 "error: expected ‘)’ before ‘,’ token". This is because
31173 cp_parser_require, unlike the C counterpart, will produce an
31174 error even if we are in error recovery. */
31176 {
31181 }
31182 }
31184 /* ... and the property declaration(s). */
31188 {
31190 /* If the next token is now a `;', consume it. */
31194 }
31198 else
31199 {
31200 /* Comma-separated properties are chained together in
31201 reverse order; add them one by one. */
31210 }
31213 }
31215 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31217 objc-synthesize-declaration:
31218 @synthesize objc-synthesize-identifier-list ;
31220 objc-synthesize-identifier-list:
31221 objc-synthesize-identifier
31222 objc-synthesize-identifier-list, objc-synthesize-identifier
31224 objc-synthesize-identifier
31225 identifier
31226 identifier = identifier
31228 For example:
31229 @synthesize MyProperty;
31230 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31232 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31233 for C. Keep them in sync.
31234 */
31235 static void
31237 {
31239 location_t loc;
31244 {
31248 {
31251 }
31253 {
31257 {
31260 }
31261 }
31262 else
31267 else
31269 }
31272 }
31274 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31276 objc-dynamic-declaration:
31277 @dynamic identifier-list ;
31279 For example:
31280 @dynamic MyProperty;
31281 @dynamic MyProperty, AnotherProperty;
31283 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31284 for C. Keep them in sync.
31285 */
31286 static void
31288 {
31290 location_t loc;
31295 {
31296 tree property;
31299 {
31302 }
31306 else
31308 }
31311 }
31313 \f
31314 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31316 /* Returns name of the next clause.
31317 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31318 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31319 returned and the token is consumed. */
31321 static pragma_omp_clause
31323 {
31339 {
31344 {
31521 }
31522 }
31528 }
31530 /* Validate that a clause of the given type does not already exist. */
31532 static void
31535 {
31536 tree c;
31540 {
31543 }
31544 }
31546 /* OpenMP 2.5:
31547 variable-list:
31548 identifier
31549 variable-list , identifier
31551 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31552 colon). An opening parenthesis will have been consumed by the caller.
31554 If KIND is nonzero, create the appropriate node and install the decl
31555 in OMP_CLAUSE_DECL and add the node to the head of the list.
31557 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31558 return the list created.
31560 COLON can be NULL if only closing parenthesis should end the list,
31561 or pointer to bool which will receive false if the list is terminated
31562 by closing parenthesis or true if the list is terminated by colon. */
31564 static tree
31567 {
31571 {
31574 }
31576 {
31581 && current_class_ptr
31583 {
31589 }
31590 else
31591 {
31602 else
31607 }
31609 ;
31611 {
31613 {
31615 /* The OpenACC cache directive explicitly only allows "array
31616 elements or subarrays". */
31618 {
31622 }
31623 /* FALLTHROUGH. */
31628 {
31629 location_t loc
31634 decl
31638 }
31639 /* FALLTHROUGH. */
31643 {
31651 parser->colon_corrects_to_scope_p
31655 else
31656 {
31657 /* Look for `:'. */
31661 CPP_CLOSE_SQUARE))
31663 }
31664 /* Look for the closing `]'. */
31666 RT_CLOSE_SQUARE))
31670 }
31674 }
31680 }
31681 else
31684 get_comma:
31688 }
31694 {
31698 }
31701 {
31704 /* Try to resync to an unnested comma. Copied from
31705 cp_parser_parenthesized_expression_list. */
31706 skip_comma:
31715 }
31718 }
31720 /* Similarly, but expect leading and trailing parenthesis. This is a very
31721 common case for omp clauses. */
31723 static tree
31725 {
31729 }
31731 /* OpenACC 2.0:
31732 copy ( variable-list )
31733 copyin ( variable-list )
31734 copyout ( variable-list )
31735 create ( variable-list )
31736 delete ( variable-list )
31737 present ( variable-list )
31738 present_or_copy ( variable-list )
31739 pcopy ( variable-list )
31740 present_or_copyin ( variable-list )
31741 pcopyin ( variable-list )
31742 present_or_copyout ( variable-list )
31743 pcopyout ( variable-list )
31744 present_or_create ( variable-list )
31745 pcreate ( variable-list ) */
31747 static tree
31749 tree list)
31750 {
31753 {
31799 }
31807 }
31809 /* OpenACC 2.0:
31810 deviceptr ( variable-list ) */
31812 static tree
31814 {
31818 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31819 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31820 variable-list must only allow for pointer variables. */
31823 {
31830 }
31833 }
31835 /* OpenACC 2.0:
31836 auto
31837 independent
31838 nohost
31839 seq */
31841 static tree
31845 {
31850 }
31852 /* OpenACC:
31853 num_gangs ( expression )
31854 num_workers ( expression )
31855 vector_length ( expression ) */
31857 static tree
31860 {
31863 matching_parens parens;
31871 {
31876 }
31884 }
31886 /* OpenACC:
31888 gang [( gang-arg-list )]
31889 worker [( [num:] int-expr )]
31890 vector [( [length:] int-expr )]
31892 where gang-arg is one of:
31894 [num:] int-expr
31895 static: size-expr
31897 and size-expr may be:
31899 *
31900 int-expr
31901 */
31903 static tree
31906 {
31916 {
31917 matching_parens parens;
31920 do
31921 {
31925 /* Gang static argument. */
31928 {
31936 {
31939 }
31941 /* Check for the '*' argument. */
31945 CPP_CLOSE_PAREN)))
31946 {
31951 {
31954 }
31956 }
31957 }
31958 /* Worker num: argument and vector length: arguments. */
31962 {
31965 }
31967 /* Now collect the actual argument. */
31969 {
31972 }
31984 {
31987 }
31989 }
31994 }
32008 cleanup_error:
32011 }
32013 /* OpenACC 2.0:
32014 tile ( size-expr-list ) */
32016 static tree
32018 {
32022 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32023 so, but the spec authors never considered such a case and have
32024 differing opinions on what it might mean, including 'not
32025 allowed'.) */
32028 clause_loc);
32033 do
32034 {
32041 {
32044 }
32045 else
32049 }
32052 /* Consume the trailing ')'. */
32060 }
32062 /* OpenACC 2.0
32063 Parse wait clause or directive parameters. */
32065 static tree
32067 {
32077 {
32082 }
32089 {
32093 {
32096 else
32097 {
32104 }
32105 }
32106 }
32109 }
32111 /* OpenACC:
32112 wait ( int-expr-list ) */
32114 static tree
32116 {
32125 }
32127 /* OpenMP 3.0:
32128 collapse ( constant-expression ) */
32130 static tree
32132 {
32134 location_t loc;
32135 HOST_WIDE_INT n;
32138 matching_parens parens;
32156 {
32159 }
32168 }
32170 /* OpenMP 2.5:
32171 default ( none | shared )
32173 OpenACC:
32174 default ( none | present ) */
32176 static tree
32179 {
32181 tree c;
32183 matching_parens parens;
32187 {
32192 {
32213 }
32216 }
32217 else
32218 {
32219 invalid_kind:
32222 else
32224 }
32241 }
32243 /* OpenMP 3.1:
32244 final ( expression ) */
32246 static tree
32248 {
32251 matching_parens parens;
32270 }
32272 /* OpenMP 2.5:
32273 if ( expression )
32275 OpenMP 4.5:
32276 if ( directive-name-modifier : expression )
32278 directive-name-modifier:
32279 parallel | task | taskloop | target data | target | target update
32280 | target enter data | target exit data */
32282 static tree
32285 {
32289 matching_parens parens;
32294 {
32306 {
32309 {
32322 else
32323 {
32324 location_t loc
32329 }
32332 {
32334 {
32339 }
32341 {
32342 location_t loc
32346 }
32347 }
32348 }
32349 }
32351 {
32353 {
32356 }
32357 else
32358 {
32360 {
32361 location_t loc
32364 }
32366 }
32367 }
32368 }
32380 {
32383 {
32386 {
32396 }
32398 p);
32400 }
32402 {
32405 else
32408 }
32411 {
32415 }
32416 }
32424 }
32426 /* OpenMP 3.1:
32427 mergeable */
32429 static tree
32432 {
32433 tree c;
32436 location);
32441 }
32443 /* OpenMP 2.5:
32444 nowait */
32446 static tree
32449 {
32450 tree c;
32457 }
32459 /* OpenMP 2.5:
32460 num_threads ( expression ) */
32462 static tree
32464 location_t location)
32465 {
32468 matching_parens parens;
32488 }
32490 /* OpenMP 4.5:
32491 num_tasks ( expression ) */
32493 static tree
32495 location_t location)
32496 {
32499 matching_parens parens;
32519 }
32521 /* OpenMP 4.5:
32522 grainsize ( expression ) */
32524 static tree
32526 location_t location)
32527 {
32530 matching_parens parens;
32550 }
32552 /* OpenMP 4.5:
32553 priority ( expression ) */
32555 static tree
32557 location_t location)
32558 {
32561 matching_parens parens;
32581 }
32583 /* OpenMP 4.5:
32584 hint ( expression ) */
32586 static tree
32588 location_t location)
32589 {
32592 matching_parens parens;
32611 }
32613 /* OpenMP 4.5:
32614 defaultmap ( tofrom : scalar ) */
32616 static tree
32618 location_t location)
32619 {
32623 matching_parens parens;
32628 {
32631 }
32635 {
32638 }
32644 {
32647 }
32651 {
32654 }
32660 location);
32666 out_err:
32671 }
32673 /* OpenMP 2.5:
32674 ordered
32676 OpenMP 4.5:
32677 ordered ( constant-expression ) */
32679 static tree
32682 {
32684 HOST_WIDE_INT n;
32690 {
32691 matching_parens parens;
32708 {
32710 "ordered argument needs positive constant integer "
32713 }
32714 }
32720 }
32722 /* OpenMP 2.5:
32723 reduction ( reduction-operator : variable-list )
32725 reduction-operator:
32726 One of: + * - & ^ | && ||
32728 OpenMP 3.1:
32730 reduction-operator:
32731 One of: + * - & ^ | && || min max
32733 OpenMP 4.0:
32735 reduction-operator:
32736 One of: + * - & ^ | && ||
32737 id-expression */
32739 static tree
32741 {
32749 {
32759 }
32763 else
32764 {
32775 {
32805 }
32806 else
32807 {
32809 resync_fail:
32814 }
32815 }
32821 NULL);
32823 {
32826 }
32829 }
32831 /* OpenMP 2.5:
32832 schedule ( schedule-kind )
32833 schedule ( schedule-kind , expression )
32835 schedule-kind:
32836 static | dynamic | guided | runtime | auto
32838 OpenMP 4.5:
32839 schedule ( schedule-modifier : schedule-kind )
32840 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32842 schedule-modifier:
32843 simd
32844 monotonic
32845 nonmonotonic */
32847 static tree
32849 {
32853 matching_parens parens;
32860 {
32869 else
32875 else
32876 {
32879 }
32880 }
32883 {
32888 {
32909 }
32910 }
32915 else
32921 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32923 {
32927 }
32930 {
32945 else
32950 }
32962 invalid_kind:
32964 resync_fail:
32969 }
32971 /* OpenMP 3.0:
32972 untied */
32974 static tree
32977 {
32978 tree c;
32985 }
32987 /* OpenMP 4.0:
32988 inbranch
32989 notinbranch */
32991 static tree
32994 {
32999 }
33001 /* OpenMP 4.0:
33002 parallel
33003 for
33004 sections
33005 taskgroup */
33007 static tree
33011 {
33015 }
33017 /* OpenMP 4.5:
33018 nogroup */
33020 static tree
33023 {
33028 }
33030 /* OpenMP 4.5:
33031 simd
33032 threads */
33034 static tree
33038 {
33043 }
33045 /* OpenMP 4.0:
33046 num_teams ( expression ) */
33048 static tree
33050 location_t location)
33051 {
33054 matching_parens parens;
33074 }
33076 /* OpenMP 4.0:
33077 thread_limit ( expression ) */
33079 static tree
33081 location_t location)
33082 {
33085 matching_parens parens;
33105 }
33107 /* OpenMP 4.0:
33108 aligned ( variable-list )
33109 aligned ( variable-list : constant-expression ) */
33111 static tree
33113 {
33117 matching_parens parens;
33125 {
33135 }
33141 }
33143 /* OpenMP 4.0:
33144 linear ( variable-list )
33145 linear ( variable-list : expression )
33147 OpenMP 4.5:
33148 linear ( modifier ( variable-list ) )
33149 linear ( modifier ( variable-list ) : expression ) */
33151 static tree
33154 {
33159 matching_parens parens;
33164 {
33176 else
33178 }
33183 else
33184 {
33193 }
33196 {
33201 {
33212 {
33215 }
33218 }
33229 }
33232 {
33235 }
33238 }
33240 /* OpenMP 4.0:
33241 safelen ( constant-expression ) */
33243 static tree
33245 location_t location)
33246 {
33249 matching_parens parens;
33268 }
33270 /* OpenMP 4.0:
33271 simdlen ( constant-expression ) */
33273 static tree
33275 location_t location)
33276 {
33279 matching_parens parens;
33298 }
33300 /* OpenMP 4.5:
33301 vec:
33302 identifier [+/- integer]
33303 vec , identifier [+/- integer]
33304 */
33306 static tree
33308 tree list)
33309 {
33313 {
33316 }
33319 {
33326 else
33327 {
33328 t = cp_parser_lookup_name_simple
33333 id_loc);
33334 }
33340 {
33343 }
33347 {
33350 }
33354 {
33357 }
33360 add_to_vector:
33362 {
33366 }
33372 }
33375 {
33381 }
33383 }
33385 /* OpenMP 4.0:
33386 depend ( depend-kind : variable-list )
33388 depend-kind:
33389 in | out | inout
33391 OpenMP 4.5:
33392 depend ( source )
33394 depend ( sink : vec ) */
33396 static tree
33398 {
33402 matching_parens parens;
33407 {
33421 else
33423 }
33424 else
33430 {
33440 }
33447 else
33448 {
33454 }
33457 invalid_kind:
33459 resync_fail:
33464 }
33466 /* OpenMP 4.0:
33467 map ( map-kind : variable-list )
33468 map ( variable-list )
33470 map-kind:
33471 alloc | to | from | tofrom
33473 OpenMP 4.5:
33474 map-kind:
33475 alloc | to | from | tofrom | release | delete
33477 map ( always [,] map-kind: variable-list ) */
33479 static tree
33481 {
33490 {
33495 {
33498 nth++;
33504 {
33509 }
33510 }
33511 }
33515 {
33529 else
33530 {
33536 }
33539 }
33542 {
33546 }
33549 NULL);
33555 }
33557 /* OpenMP 4.0:
33558 device ( expression ) */
33560 static tree
33562 location_t location)
33563 {
33566 matching_parens parens;
33586 }
33588 /* OpenMP 4.0:
33589 dist_schedule ( static )
33590 dist_schedule ( static , expression ) */
33592 static tree
33594 location_t location)
33595 {
33598 matching_parens parens;
33609 {
33620 }
33625 location);
33629 invalid_kind:
33631 resync_fail:
33636 }
33638 /* OpenMP 4.0:
33639 proc_bind ( proc-bind-kind )
33641 proc-bind-kind:
33642 master | close | spread */
33644 static tree
33646 location_t location)
33647 {
33648 tree c;
33655 {
33665 else
33667 }
33668 else
33677 location);
33682 invalid_kind:
33684 resync_fail:
33689 }
33691 /* OpenACC:
33692 async [( int-expr )] */
33694 static tree
33696 {
33703 {
33704 matching_parens parens;
33713 }
33723 }
33725 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33726 is a bitmask in MASK. Return the list of clauses found. */
33728 static tree
33732 {
33737 {
33738 location_t here;
33739 pragma_omp_clause c_kind;
33740 omp_clause_code code;
33751 {
33803 clauses);
33821 OMP_CLAUSE_INDEPENDENT,
33833 clauses);
33839 clauses);
33863 clauses);
33885 clauses);
33897 clauses);
33911 }
33916 {
33917 /* Remove the invalid clause(s) from the list to avoid
33918 confusing the rest of the compiler. */
33921 }
33922 }
33924 saw_error:
33931 }
33933 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33934 is a bitmask in MASK. Return the list of clauses found; the result
33935 of clause default goes in *pdefault. */
33937 static tree
33941 {
33947 {
33948 pragma_omp_clause c_kind;
33959 {
33971 clauses);
33985 clauses);
34005 clauses);
34010 clauses);
34020 clauses);
34054 clauses);
34068 clauses);
34083 OMP_CLAUSE_NOTINBRANCH,
34092 {
34093 clause_not_first:
34097 }
34127 clauses);
34128 else
34138 clauses);
34156 {
34161 }
34204 clauses
34210 clauses
34218 }
34223 {
34224 /* Remove the invalid clause(s) from the list to avoid
34225 confusing the rest of the compiler. */
34228 }
34229 }
34230 saw_error:
34233 {
34236 else
34238 }
34240 }
34242 /* OpenMP 2.5:
34243 structured-block:
34244 statement
34246 In practice, we're also interested in adding the statement to an
34247 outer node. So it is convenient if we work around the fact that
34248 cp_parser_statement calls add_stmt. */
34250 static unsigned
34252 {
34255 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34256 This preserves the "not within loop or switch" style error messages
34257 for nonsense cases like
34258 void foo() {
34259 #pragma omp single
34260 break;
34261 }
34262 */
34267 }
34269 static void
34271 {
34273 }
34275 static tree
34277 {
34285 }
34287 /* OpenMP 2.5:
34288 # pragma omp atomic new-line
34289 expression-stmt
34291 expression-stmt:
34292 x binop= expr | x++ | ++x | x-- | --x
34293 binop:
34294 +, *, -, /, &, ^, |, <<, >>
34296 where x is an lvalue expression with scalar type.
34298 OpenMP 3.1:
34299 # pragma omp atomic new-line
34300 update-stmt
34302 # pragma omp atomic read new-line
34303 read-stmt
34305 # pragma omp atomic write new-line
34306 write-stmt
34308 # pragma omp atomic update new-line
34309 update-stmt
34311 # pragma omp atomic capture new-line
34312 capture-stmt
34314 # pragma omp atomic capture new-line
34315 capture-block
34317 read-stmt:
34318 v = x
34319 write-stmt:
34320 x = expr
34321 update-stmt:
34322 expression-stmt | x = x binop expr
34323 capture-stmt:
34324 v = expression-stmt
34325 capture-block:
34326 { v = x; update-stmt; } | { update-stmt; v = x; }
34328 OpenMP 4.0:
34329 update-stmt:
34330 expression-stmt | x = x binop expr | x = expr binop x
34331 capture-stmt:
34332 v = update-stmt
34333 capture-block:
34334 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34336 where x and v are lvalue expressions with scalar type. */
34338 static void
34340 {
34348 {
34353 {
34359 }
34360 }
34362 {
34374 else
34378 }
34380 {
34386 {
34391 {
34394 }
34395 }
34396 }
34400 {
34410 else
34415 {
34416 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34417 opcode. */
34422 }
34426 {
34429 }
34430 else
34431 {
34437 }
34440 }
34442 restart:
34446 {
34453 /* FALLTHROUGH */
34463 /* FALLTHROUGH */
34478 /* Undo effects of boolean_increment for post {in,de}crement. */
34480 /* FALLTHRU */
34484 {
34485 /* Undo effects of boolean_increment. */
34487 {
34488 /* This is pre or post increment. */
34493 && !structured_block
34497 }
34498 }
34499 /* FALLTHRU */
34502 {
34537 {
34541 }
34544 {
34550 {
34555 }
34557 {
34569 {
34571 {
34576 }
34577 else
34579 }
34583 }
34586 {
34593 }
34597 }
34601 {
34604 {
34612 }
34614 {
34619 }
34654 }
34665 /* FALLTHROUGH */
34670 }
34677 }
34678 stmt_done:
34680 {
34691 }
34693 {
34696 }
34697 done:
34703 saw_error:
34706 {
34710 {
34714 }
34715 }
34716 }
34719 /* OpenMP 2.5:
34720 # pragma omp barrier new-line */
34722 static void
34724 {
34727 }
34729 /* OpenMP 2.5:
34730 # pragma omp critical [(name)] new-line
34731 structured-block
34733 OpenMP 4.5:
34734 # pragma omp critical [(name) [hint(expression)]] new-line
34735 structured-block */
34737 #define OMP_CRITICAL_CLAUSE_MASK \
34738 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34740 static tree
34742 {
34746 {
34747 matching_parens parens;
34761 OMP_CRITICAL_CLAUSE_MASK,
34763 }
34764 else
34769 }
34771 /* OpenMP 2.5:
34772 # pragma omp flush flush-vars[opt] new-line
34774 flush-vars:
34775 ( variable-list ) */
34777 static void
34779 {
34785 }
34787 /* Helper function, to parse omp for increment expression. */
34789 static tree
34791 {
34796 {
34799 }
34802 {
34809 /* Fall through: OpenMP disallows NE_EXPR. */
34813 }
34815 /* If decl is an iterator, preserve LHS and RHS of the relational
34816 expr until finish_omp_for. */
34827 }
34829 /* Helper function, to parse omp for increment expression. */
34831 static tree
34833 {
34837 cp_id_kind idk;
34841 {
34850 }
34859 {
34864 }
34871 {
34875 }
34888 do
34889 {
34896 {
34898 {
34901 else
34903 tf_warning_or_error);
34904 }
34905 else
34908 }
34909 }
34913 {
34919 }
34920 else
34924 }
34926 /* Parse the initialization statement of an OpenMP for loop.
34928 Return true if the resulting construct should have an
34929 OMP_CLAUSE_PRIVATE added to it. */
34931 static tree
34939 {
34945 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34947 init-expr:
34948 var = lb
34949 integer-type var = lb
34950 random-access-iterator-type var = lb
34951 pointer-type var = lb
34952 */
34953 cp_decl_specifier_seq type_specifiers;
34955 /* First, try to parse as an initialized declaration. See
34956 cp_parser_condition, from whence the bulk of this is copied. */
34963 {
34964 /* If parsing a type specifier seq succeeded, then this
34965 MUST be a initialized declaration. */
34970 CP_PARSER_DECLARATOR_NAMED,
34981 else
34982 {
34992 {
34994 CPP_OPEN_PAREN))
34997 else
34998 /* Trigger an error. */
35003 }
35007 {
35015 {
35018 auto_node);
35023 }
35026 asm_specification,
35027 LOOKUP_ONLYCONVERTING);
35030 {
35033 }
35034 else
35035 {
35038 {
35040 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35042 {
35046 {
35050 }
35052 }
35054 {
35059 }
35060 }
35061 }
35063 }
35064 else
35065 {
35066 /* Consume '='. */
35070 non_class:
35073 else
35076 asm_specification,
35077 LOOKUP_ONLYCONVERTING);
35078 }
35082 }
35083 }
35084 else
35085 {
35086 cp_id_kind idk;
35087 /* If parsing a type specifier sequence failed, then
35088 this MUST be a simple expression. */
35094 && decl
35097 {
35108 {
35113 }
35118 }
35120 && decl
35123 {
35124 tree rhs;
35132 rhs,
35133 tf_warning_or_error));
35136 }
35137 else
35138 {
35143 {
35147 }
35148 }
35149 }
35151 }
35153 /* Parse the restricted form of the for statement allowed by OpenMP. */
35155 static tree
35158 {
35162 location_t loc_first;
35173 {
35176 }
35179 {
35182 }
35185 {
35191 }
35193 {
35196 {
35198 "%<linear%> clause may not be specified together "
35201 }
35202 else
35204 }
35217 {
35220 location_t loc;
35223 {
35227 }
35230 matching_parens parens;
35237 add_private_clause
35243 {
35246 {
35252 }
35253 else
35255 }
35262 {
35267 {
35271 }
35274 {
35275 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35279 {
35282 }
35283 else
35284 {
35287 }
35289 }
35290 else
35291 {
35296 }
35297 }
35300 {
35301 tree c;
35303 {
35312 decl);
35316 decl);
35317 }
35319 {
35324 else
35329 {
35332 /* For linear, signal that we need to fill up
35333 the so far unknown linear step. */
35336 }
35337 }
35338 }
35347 {
35348 /* If decl is an iterator, preserve the operator on decl
35349 until finish_omp_for. */
35351 && ((processing_template_decl
35356 else
35360 }
35372 {
35375 }
35380 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35381 in between the collapsed for loops to be still considered perfectly
35382 nested. Hopefully the final version clarifies this.
35383 For now handle (multiple) {'s and empty statements. */
35386 {
35390 {
35392 bracecount++;
35393 }
35397 else
35398 {
35405 }
35406 }
35409 {
35412 }
35413 }
35418 /* Note that we saved the original contents of this flag when we entered
35419 the structured block, and so we don't need to re-save it here. */
35422 /* Note that the grammar doesn't call for a structured block here,
35423 though the loop as a whole is a structured block. */
35430 else
35435 {
35437 {
35439 nbraces--;
35440 }
35443 else
35444 {
35446 {
35449 }
35454 }
35455 }
35458 {
35462 else
35464 }
35468 }
35470 /* Helper function for OpenMP parsing, split clauses and call
35471 finish_omp_clauses on each of the set of clauses afterwards. */
35473 static void
35476 {
35482 }
35484 /* OpenMP 4.0:
35485 #pragma omp simd simd-clause[optseq] new-line
35486 for-loop */
35488 #define OMP_SIMD_CLAUSE_MASK \
35489 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35498 static tree
35502 {
35513 {
35517 OMP_CLAUSE_ORDERED);
35519 {
35521 "%<ordered%> clause with parameter may not be specified "
35524 }
35525 }
35536 }
35538 /* OpenMP 2.5:
35539 #pragma omp for for-clause[optseq] new-line
35540 for-loop
35542 OpenMP 4.0:
35543 #pragma omp for simd for-simd-clause[optseq] new-line
35544 for-loop */
35546 #define OMP_FOR_CLAUSE_MASK \
35547 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35557 static tree
35561 {
35568 /* parallel for{, simd} disallows nowait clause, but for
35569 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35572 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35577 {
35582 {
35606 }
35607 }
35609 {
35612 }
35614 /* Composite distribute parallel for disallows linear clause. */
35621 {
35624 }
35635 }
35637 /* OpenMP 2.5:
35638 # pragma omp master new-line
35639 structured-block */
35641 static tree
35643 {
35647 }
35649 /* OpenMP 2.5:
35650 # pragma omp ordered new-line
35651 structured-block
35653 OpenMP 4.5:
35654 # pragma omp ordered ordered-clauses new-line
35655 structured-block */
35657 #define OMP_ORDERED_CLAUSE_MASK \
35658 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35661 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35662 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35664 static bool
35667 {
35671 {
35676 {
35678 {
35681 }
35683 {
35685 "%<depend%> clause may only be used in compound "
35689 }
35690 tree clauses
35692 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35696 }
35697 }
35699 tree clauses
35710 }
35712 /* OpenMP 2.5:
35714 section-scope:
35715 { section-sequence }
35717 section-sequence:
35718 section-directive[opt] structured-block
35719 section-sequence section-directive structured-block */
35721 static tree
35723 {
35728 matching_braces braces;
35736 {
35740 }
35743 {
35751 {
35755 }
35757 {
35760 }
35765 }
35776 }
35778 /* OpenMP 2.5:
35779 # pragma omp sections sections-clause[optseq] newline
35780 sections-scope */
35782 #define OMP_SECTIONS_CLAUSE_MASK \
35783 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35789 static tree
35792 {
35804 {
35807 }
35814 }
35816 /* OpenMP 2.5:
35817 # pragma omp parallel parallel-clause[optseq] new-line
35818 structured-block
35819 # pragma omp parallel for parallel-for-clause[optseq] new-line
35820 structured-block
35821 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35822 structured-block
35824 OpenMP 4.0:
35825 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35826 structured-block */
35828 #define OMP_PARALLEL_CLAUSE_MASK \
35829 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35839 static tree
35843 {
35850 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35856 {
35864 if_p);
35868 if_p);
35871 block);
35876 }
35877 /* When combined with distribute, parallel has to be followed by for.
35878 #pragma omp target parallel is allowed though. */
35882 {
35886 }
35888 {
35891 }
35893 {
35897 {
35907 block);
35910 }
35911 }
35916 {
35919 }
35927 }
35929 /* OpenMP 2.5:
35930 # pragma omp single single-clause[optseq] new-line
35931 structured-block */
35933 #define OMP_SINGLE_CLAUSE_MASK \
35934 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35939 static tree
35941 {
35951 }
35953 /* OpenMP 3.0:
35954 # pragma omp task task-clause[optseq] new-line
35955 structured-block */
35957 #define OMP_TASK_CLAUSE_MASK \
35958 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35969 static tree
35971 {
35982 }
35984 /* OpenMP 3.0:
35985 # pragma omp taskwait new-line */
35987 static void
35989 {
35992 }
35994 /* OpenMP 3.1:
35995 # pragma omp taskyield new-line */
35997 static void
35999 {
36002 }
36004 /* OpenMP 4.0:
36005 # pragma omp taskgroup new-line
36006 structured-block */
36008 static tree
36010 {
36014 if_p));
36015 }
36018 /* OpenMP 2.5:
36019 # pragma omp threadprivate (variable-list) */
36021 static void
36023 {
36024 tree vars;
36030 }
36032 /* OpenMP 4.0:
36033 # pragma omp cancel cancel-clause[optseq] new-line */
36035 #define OMP_CANCEL_CLAUSE_MASK \
36036 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36042 static void
36044 {
36048 }
36050 /* OpenMP 4.0:
36051 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36053 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36054 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36059 static void
36062 {
36063 tree clauses;
36067 {
36072 {
36075 }
36076 }
36078 {
36082 }
36085 {
36090 else
36094 }
36097 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36099 pragma_tok);
36101 }
36103 /* OpenMP 4.0:
36104 #pragma omp distribute distribute-clause[optseq] new-line
36105 for-loop */
36107 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36114 static tree
36118 {
36127 {
36135 else
36138 {
36144 {
36148 else
36151 }
36157 else
36171 }
36172 }
36174 {
36177 }
36182 {
36185 }
36196 }
36198 /* OpenMP 4.0:
36199 # pragma omp teams teams-clause[optseq] new-line
36200 structured-block */
36202 #define OMP_TEAMS_CLAUSE_MASK \
36203 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36211 static tree
36215 {
36224 {
36228 {
36253 }
36254 }
36256 {
36259 }
36264 {
36267 }
36276 }
36278 /* OpenMP 4.0:
36279 # pragma omp target data target-data-clause[optseq] new-line
36280 structured-block */
36282 #define OMP_TARGET_DATA_CLAUSE_MASK \
36283 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36288 static tree
36290 {
36291 tree clauses
36296 {
36299 {
36316 "%<#pragma omp target data%> with map-type other "
36317 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36321 }
36323 }
36326 {
36329 "%<#pragma omp target data%> must contain at least "
36332 }
36343 }
36345 /* OpenMP 4.5:
36346 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36347 structured-block */
36349 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36350 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36356 static tree
36359 {
36362 {
36367 {
36370 }
36371 }
36373 {
36377 }
36380 {
36386 }
36388 tree clauses
36393 {
36396 {
36409 "%<#pragma omp target enter data%> with map-type other "
36413 }
36415 }
36418 {
36421 "%<#pragma omp target enter data%> must contain at least "
36424 }
36431 }
36433 /* OpenMP 4.5:
36434 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36435 structured-block */
36437 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36438 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36444 static tree
36447 {
36450 {
36455 {
36458 }
36459 }
36461 {
36465 }
36468 {
36474 }
36476 tree clauses
36481 {
36484 {
36498 "%<#pragma omp target exit data%> with map-type other "
36499 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36503 }
36505 }
36508 {
36511 "%<#pragma omp target exit data%> must contain at least "
36514 }
36521 }
36523 /* OpenMP 4.0:
36524 # pragma omp target update target-update-clause[optseq] new-line */
36526 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36527 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36534 static bool
36537 {
36539 {
36545 }
36547 tree clauses
36552 {
36554 "%<#pragma omp target update%> must contain at least one "
36557 }
36565 }
36567 /* OpenMP 4.0:
36568 # pragma omp target target-clause[optseq] new-line
36569 structured-block */
36571 #define OMP_TARGET_CLAUSE_MASK \
36572 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36582 static bool
36585 {
36589 {
36601 {
36609 {
36610 tree stmt;
36612 {
36615 OMP_TARGET_CLAUSE_MASK,
36620 OMP_TARGET_CLAUSE_MASK,
36625 OMP_TARGET_CLAUSE_MASK,
36630 }
36632 }
36637 {
36641 if_p);
36646 if_p);
36651 if_p);
36655 }
36661 {
36662 /* For combined target teams, ensure the num_teams and
36663 thread_limit clause expressions are evaluated on the host,
36664 before entering the target construct. */
36665 tree c;
36671 {
36680 OMP_CLAUSE_FIRSTPRIVATE);
36685 }
36686 }
36696 }
36698 {
36701 }
36703 {
36707 }
36709 {
36713 }
36715 {
36719 }
36721 {
36724 }
36725 }
36727 {
36730 }
36745 check_clauses:
36747 {
36750 {
36764 "%<#pragma omp target%> with map-type other "
36765 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36769 }
36771 }
36773 }
36775 /* OpenACC 2.0:
36776 # pragma acc cache (variable-list) new-line
36777 */
36779 static tree
36781 {
36796 }
36798 /* OpenACC 2.0:
36799 # pragma acc data oacc-data-clause[optseq] new-line
36800 structured-block */
36802 #define OACC_DATA_CLAUSE_MASK \
36803 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36815 static tree
36817 {
36830 }
36832 /* OpenACC 2.0:
36833 # pragma acc host_data <clauses> new-line
36834 structured-block */
36836 #define OACC_HOST_DATA_CLAUSE_MASK \
36837 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36839 static tree
36841 {
36854 }
36856 /* OpenACC 2.0:
36857 # pragma acc declare oacc-data-clause[optseq] new-line
36858 */
36860 #define OACC_DECLARE_CLAUSE_MASK \
36861 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36874 static tree
36876 {
36885 {
36889 }
36892 {
36896 {
36900 }
36903 {
36915 {
36917 "%qD must be a global variable in "
36919 decl);
36922 }
36927 {
36931 }
36933 {
36935 "invalid use of %<extern%> variable %qD "
36939 }
36941 {
36943 "invalid use of %<global%> variable %qD "
36947 }
36949 }
36954 {
36959 }
36962 {
36963 tree id;
36967 else
36973 {
36976 {
36979 {
36983 }
36984 }
36985 }
36986 }
36987 }
37000 }
37002 /* OpenACC 2.0:
37003 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37005 or
37007 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37009 LOC is the location of the #pragma token.
37010 */
37012 #define OACC_ENTER_DATA_CLAUSE_MASK \
37013 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_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_WAIT) )
37028 static tree
37031 {
37040 {
37045 }
37052 else
37057 {
37061 }
37069 }
37071 /* OpenACC 2.0:
37072 # pragma acc loop oacc-loop-clause[optseq] new-line
37073 structured-block */
37075 #define OACC_LOOP_CLAUSE_MASK \
37076 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37087 static tree
37090 {
37099 {
37105 }
37114 }
37116 /* OpenACC 2.0:
37117 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37118 structured-block
37120 or
37122 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37123 structured-block
37124 */
37126 #define OACC_KERNELS_CLAUSE_MASK \
37127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37145 #define OACC_PARALLEL_CLAUSE_MASK \
37146 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37167 static tree
37170 {
37171 omp_clause_mask mask;
37174 {
37187 }
37190 {
37194 {
37197 tree clauses;
37199 if_p);
37201 }
37202 }
37211 }
37213 /* OpenACC 2.0:
37214 # pragma acc update oacc-update-clause[optseq] new-line
37215 */
37217 #define OACC_UPDATE_CLAUSE_MASK \
37218 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37225 static tree
37227 {
37234 {
37236 "%<#pragma acc update%> must contain at least one "
37239 }
37247 }
37249 /* OpenACC 2.0:
37250 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37252 LOC is the location of the #pragma token.
37253 */
37255 #define OACC_WAIT_CLAUSE_MASK \
37256 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37258 static tree
37260 {
37274 }
37276 /* OpenMP 4.0:
37277 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37279 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37280 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37287 static void
37290 {
37292 cp_omp_declare_simd_data data;
37294 {
37299 /* It is safe to take the address of a local variable; it will only be
37300 used while this scope is live. */
37302 }
37304 /* Store away all pragma tokens. */
37316 {
37320 {
37333 }
37338 "%<#pragma omp declare simd%> not immediately followed by "
37342 }
37343 }
37345 /* Finalize #pragma omp declare simd clauses after direct declarator has
37346 been parsed, and put that into "omp declare simd" attribute. */
37348 static tree
37350 {
37356 {
37360 }
37365 {
37383 }
37387 }
37390 /* OpenMP 4.0:
37391 # pragma omp declare target new-line
37392 declarations and definitions
37393 # pragma omp end declare target new-line
37395 OpenMP 4.5:
37396 # pragma omp declare target ( extended-list ) new-line
37398 # pragma omp declare target declare-target-clauses[seq] new-line */
37400 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37401 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37404 static void
37406 {
37409 clauses
37413 {
37415 clauses);
37418 }
37419 else
37420 {
37424 }
37427 "%<#pragma omp declare target%> with clauses in between "
37428 "%<#pragma omp declare target%> without clauses and "
37431 {
37437 {
37440 }
37441 else
37444 {
37446 "%qD specified both in declare target %<link%> and %<to%>"
37449 }
37451 {
37458 {
37461 {
37465 }
37466 }
37467 }
37468 }
37469 }
37471 static void
37473 {
37476 {
37479 }
37481 {
37485 {
37488 }
37491 else
37492 {
37496 }
37497 }
37498 else
37499 {
37503 }
37507 "%<#pragma omp end declare target%> without corresponding "
37509 else
37511 }
37513 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37514 expression and optional initializer clause of
37515 #pragma omp declare reduction. We store the expression(s) as
37516 either 3, 6 or 7 special statements inside of the artificial function's
37517 body. The first two statements are DECL_EXPRs for the artificial
37518 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37519 expression that uses those variables.
37520 If there was any INITIALIZER clause, this is followed by further statements,
37521 the fourth and fifth statements are DECL_EXPRs for the artificial
37522 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37523 constructor variant (first token after open paren is not omp_priv),
37524 then the sixth statement is a statement with the function call expression
37525 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37526 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37527 to initialize the OMP_PRIV artificial variable and there is seventh
37528 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37530 static bool
37532 {
37544 tree combiner;
37559 {
37562 }
37565 {
37567 matching_parens parens;
37573 {
37576 }
37592 {
37596 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37600 == CPP_CLOSE_PAREN
37603 {
37607 }
37612 }
37613 else
37614 {
37630 {
37635 }
37637 tree arg;
37650 }
37661 }
37665 UNKNOWN_LOCATION);
37668 }
37670 /* OpenMP 4.0
37671 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37672 initializer-clause[opt] new-line
37674 initializer-clause:
37675 initializer (omp_priv initializer)
37676 initializer (function-name (argument-list)) */
37678 static void
37681 {
37691 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37698 {
37730 }
37742 /* Types may not be defined in declare reduction type list. */
37745 parser->type_definition_forbidden_message
37751 saved_colon_doesnt_start_class_def_p
37756 {
37760 ;
37779 else
37784 else
37786 }
37788 /* Restore the saved message. */
37791 parser->colon_doesnt_start_class_def_p
37796 {
37797 fail:
37800 }
37806 {
37807 tree fntype
37810 NULL_TREE);
37830 {
37835 }
37837 {
37839 {
37848 }
37855 }
37856 else
37857 {
37860 }
37863 else
37866 {
37869 }
37871 {
37874 else
37879 }
37884 else
37885 {
37894 }
37901 }
37905 done:
37906 /* Free any declarators allocated. */
37908 }
37910 /* OpenMP 4.0
37911 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37912 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37913 initializer-clause[opt] new-line
37914 #pragma omp declare target new-line */
37916 static bool
37919 {
37921 {
37926 {
37929 context);
37931 }
37934 {
37937 context);
37939 }
37941 {
37944 }
37946 {
37950 }
37951 }
37956 }
37958 /* OpenMP 4.5:
37959 #pragma omp taskloop taskloop-clause[optseq] new-line
37960 for-loop
37962 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37963 for-loop */
37965 #define OMP_TASKLOOP_CLAUSE_MASK \
37966 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37981 static tree
37985 {
37994 {
37999 {
38023 }
38024 }
38026 {
38029 }
38034 {
38037 }
38043 if_p);
38049 }
38052 /* OpenACC 2.0:
38053 # pragma acc routine oacc-routine-clause[optseq] new-line
38054 function-definition
38056 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38057 */
38059 #define OACC_ROUTINE_CLAUSE_MASK \
38060 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38066 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38067 component, which must resolve to a declared namespace-scope
38068 function. The clauses are either processed directly (for a named
38069 function), or defered until the immediatley following declaration
38070 is parsed. */
38072 static void
38075 {
38077 /* The checking for "another pragma following this one" in the "no optional
38078 '( name )'" case makes sure that we dont re-enter. */
38081 cp_oacc_routine_data data;
38087 /* It is safe to take the address of a local variable; it will only be
38088 used while this scope is live. */
38091 /* Look for optional '( name )'. */
38093 {
38094 matching_parens parens;
38097 /* We parse the name as an id-expression. If it resolves to
38098 anything other than a non-overloaded function at namespace
38099 scope, it's an error. */
38115 {
38119 }
38121 data.clauses
38129 {
38134 }
38136 /* Perhaps we should use the same rule as declarations in different
38137 namespaces? */
38139 {
38144 }
38147 {
38151 }
38155 }
38157 {
38158 /* Store away all pragma tokens. */
38169 /* Emit a helpful diagnostic if there's another pragma following this
38170 one. */
38172 {
38175 /* ..., and then just keep going. */
38177 }
38179 /* We only have to consider the pragma_external case here. */
38184 else
38187 }
38188 }
38190 /* Finalize #pragma acc routine clauses after direct declarator has
38191 been parsed. */
38193 static tree
38195 {
38200 {
38202 "%<#pragma acc routine%> not immediately followed by "
38205 }
38222 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38223 fndecl_seen. */
38226 }
38228 /* Apply any saved OpenACC routine clauses to a just-parsed
38229 declaration. */
38231 static void
38233 {
38235 {
38236 /* Keep going if we're in error reporting mode. */
38242 {
38244 "%<#pragma acc routine%> not immediately followed by"
38248 }
38250 {
38253 }
38256 {
38261 }
38264 {
38272 }
38274 /* Process the routine's dimension clauses. */
38278 /* Add an "omp declare target" attribute. */
38283 /* Don't unset parser->oacc_routine here: we may still need it to
38284 diagnose wrong usage. But, remember that we've used this "#pragma acc
38285 routine". */
38287 }
38288 }
38290 /* Main entry point to OpenMP statement pragmas. */
38292 static void
38294 {
38295 tree stmt;
38300 {
38323 if_p);
38328 if_p);
38345 if_p);
38350 if_p);
38358 if_p);
38367 if_p);
38381 if_p);
38386 if_p);
38390 }
38393 }
38394 \f
38395 /* Transactional Memory parsing routines. */
38397 /* Parse a transaction attribute.
38399 txn-attribute:
38400 attribute
38401 [ [ identifier ] ]
38403 We use this instead of cp_parser_attributes_opt for transactions to avoid
38404 the pedwarn in C++98 mode. */
38406 static tree
38408 {
38423 {
38427 /* For keywords, use the canonical spelling,
38428 not the parsed identifier. */
38432 }
38433 else
38437 error1:
38440 }
38442 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38444 transaction-statement:
38445 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38446 compound-statement
38447 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38448 */
38450 static tree
38452 {
38463 else
38464 {
38468 }
38470 /* Parse a noexcept specification. */
38474 {
38475 /* cancel-and-throw is unimplemented. */
38478 }
38479 else
38482 /* Keep track if we're in the lexical scope of an outer transaction. */
38494 }
38496 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38498 transaction-expression:
38499 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38500 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38501 */
38503 static tree
38505 {
38518 keyword == RID_TRANSACTION_RELAXED
38532 /* Set this early. This might mean that we allow transaction_cancel in
38533 an expression that we find out later actually has to be a constexpr.
38534 However, we expect that cxx_constant_value will be able to deal with
38535 this; also, if the noexcept has no constexpr, then what we parse next
38536 really is a transaction's body. */
38539 /* Parse a noexcept specification. */
38545 {
38546 matching_parens parens;
38553 }
38554 else
38555 {
38556 /* The only expression that is available got parsed for the noexcept
38557 already. noexcept is true then. */
38560 }
38569 }
38571 /* Parse a function-transaction-block.
38573 function-transaction-block:
38574 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38575 function-body
38576 __transaction_atomic txn-attribute[opt] function-try-block
38577 __transaction_relaxed ctor-initializer[opt] function-body
38578 __transaction_relaxed function-try-block
38579 */
38581 static void
38583 {
38598 else
38599 {
38603 }
38611 else
38612 cp_parser_ctor_initializer_opt_and_function_body
38618 }
38620 /* Parse a __transaction_cancel statement.
38622 cancel-statement:
38623 __transaction_cancel txn-attribute[opt] ;
38624 __transaction_cancel txn-attribute[opt] throw-expression ;
38626 ??? Cancel and throw is not yet implemented. */
38628 static tree
38630 {
38636 RT_TRANSACTION_CANCEL);
38643 /* ??? Parse cancel-and-throw here. */
38648 {
38652 }
38654 {
38658 }
38660 {
38663 {
38669 }
38670 }
38672 {
38676 }
38682 }
38683 \f
38684 /* The parser. */
38688 \f
38689 /* Special handling for the first token or line in the file. The first
38690 thing in the file might be #pragma GCC pch_preprocess, which loads a
38691 PCH file, which is a GC collection point. So we need to handle this
38692 first pragma without benefit of an existing lexer structure.
38694 Always returns one token to the caller in *FIRST_TOKEN. This is
38695 either the true first token of the file, or the first token after
38696 the initial pragma. */
38698 static void
38700 {
38709 {
38716 }
38717 else
38720 /* Skip to the end of the pragma. */
38724 /* Now actually load the PCH file. */
38728 /* Read one more token to return to our caller. We have to do this
38729 after reading the PCH file in, since its pointers have to be
38730 live. */
38732 }
38734 /* Parse a pragma GCC ivdep. */
38736 static bool
38738 {
38741 }
38743 /* Parse a pragma GCC unroll. */
38745 static unsigned short
38747 {
38757 {
38759 " assignment-expression that evaluates to a non-negative"
38762 }
38763 else
38764 {
38768 }
38771 }
38773 /* Normal parsing of a pragma token. Here we can (and must) use the
38774 regular lexer. */
38776 static bool
38778 {
38781 tree stmt;
38792 {
38800 {
38810 }
38815 {
38825 }
38830 {
38841 }
38846 {
38857 }
38862 {
38873 }
38893 {
38898 }
38906 {
38911 }
38919 {
38923 }
38929 {
38934 }
38942 {
38947 }
39002 "%<#pragma omp section%> may only be used in "
39007 {
39009 {
39013 }
39019 {
39023 }
39024 else
39030 {
39033 }
39036 }
39039 {
39041 {
39045 }
39046 const unsigned short unroll
39052 {
39056 }
39057 else
39063 {
39066 }
39069 }
39076 bad_stmt:
39079 }
39083 }
39085 /* The interface the pragma parsers have to the lexer. */
39087 enum cpp_ttype
39089 {
39101 else
39102 {
39106 }
39109 }
39111 \f
39112 /* External interface. */
39114 /* Parse one entire translation unit. */
39116 void
39118 {
39131 }
39133 /* Create an identifier for a generic parameter type (a synthesized
39134 template parameter implied by `auto' or a concept identifier). */
39137 static tree
39139 {
39143 }
39145 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39146 (creating a new template parameter list if necessary). Returns the newly
39147 created template type parm. */
39149 static tree
39151 {
39154 /* Before committing to modifying any scope, if we're in an
39155 implicit template scope, and we're trying to synthesize a
39156 constrained parameter, try to find a previous parameter with
39157 the same name. This is the same-type rule for abbreviated
39158 function templates.
39160 NOTE: We can generate implicit parameters when tentatively
39161 parsing a nested name specifier, only to reject that parse
39162 later. However, matching the same template-id as part of a
39163 direct-declarator should generate an identical template
39164 parameter, so this rule will merge them. */
39166 {
39169 {
39171 {
39174 /* Return the TEMPLATE_PARM_INDEX. */
39177 }
39179 }
39180 }
39182 /* We are either continuing a function template that already contains implicit
39183 template parameters, creating a new fully-implicit function template, or
39184 extending an existing explicit function template with implicit template
39185 parameters. */
39193 {
39197 }
39198 else
39199 {
39200 /* Roll back to the existing template parameter scope (in the case of
39201 extending an explicit function template) or introduce a new template
39202 parameter scope ahead of the function parameter scope (or class scope
39203 in the case of out-of-line member definitions). The function scope is
39204 added back after template parameter synthesis below. */
39209 {
39212 }
39214 {
39215 /* If not defining a class, then any class scope is a scope level in
39216 an out-of-line member definition. In this case simply wind back
39217 beyond the first such scope to inject the template parameter list.
39218 Otherwise wind back to the class being defined. The latter can
39219 occur in class member friend declarations such as:
39221 class A {
39222 void foo (auto);
39223 };
39224 class B {
39225 friend void A::foo (auto);
39226 };
39228 The template parameter list synthesized for the friend declaration
39229 must be injected in the scope of 'B'. This can also occur in
39230 erroneous cases such as:
39232 struct A {
39233 struct B {
39234 void foo (auto);
39235 };
39236 void B::foo (auto) {}
39237 };
39239 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39240 but, nevertheless, the template parameter list synthesized for the
39241 declarator should be injected into the scope of 'A' as if the
39242 ill-formed template was specified explicitly. */
39245 {
39248 }
39249 }
39255 {
39256 /* Introduce a new template parameter list for implicit template
39257 parameters. */
39261 parser->implicit_template_scope
39268 }
39269 else
39270 {
39271 /* Synthesize implicit template parameters at the end of the explicit
39272 template parameter list. */
39279 parser->implicit_template_parms
39281 }
39282 }
39284 /* Synthesize a new template parameter and track the current template
39285 parameter chain with implicit_template_parms. */
39289 tree synth_tmpl_parm;
39293 synth_tmpl_parm
39296 synth_tmpl_parm
39298 else
39299 {
39303 }
39305 // Attach the constraint to the parm before processing.
39308 tree new_parm
39310 input_location,
39311 node,
39315 // Chain the new parameter to the list of implicit parameters.
39317 parser->implicit_template_parms
39319 else
39324 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39327 /* If creating a fully implicit function template, start the new implicit
39328 template parameter list with this synthesized type, otherwise grow the
39329 current template parameter list. */
39332 {
39339 }
39340 else
39341 {
39346 }
39348 // If the new parameter was constrained, we need to add that to the
39349 // constraints in the template parameter list.
39351 {
39355 }
39360 }
39362 /* Finish the declaration of a fully implicit function template. Such a
39363 template has no explicit template parameter list so has not been through the
39364 normal template head and tail processing. synthesize_implicit_template_parm
39365 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39366 provided if the declaration is a class member such that its template
39367 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39368 form is returned. Otherwise NULL_TREE is returned. */
39370 static tree
39372 {
39377 {
39381 }
39393 }
39395 /* Like finish_fully_implicit_template, but to be used in error
39396 recovery, rearranging scopes so that we restore the state we had
39397 before synthesize_implicit_template_parm inserted the implement
39398 template parms scope. */
39400 static void
39402 {
39407 {
39416 }
39417 else
39423 }
39425 /* Helper function for diagnostics that have complained about things
39426 being used with 'extern "C"' linkage.
39428 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39430 void
39432 {
39436 }