| blob | e946d0b722926891a80306a00a5efbcf41acb854 |
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 {
3502 {
3505 /* Have we found what we're looking for before the closing paren? */
3511 {
3514 /* If we've run out of tokens, then there is no closing `)'. */
3517 /* This is good for lambda expression capture-lists. */
3527 /* This matches the processing in skip_to_end_of_statement. */
3547 {
3551 }
3556 }
3558 /* Consume the token. */
3560 }
3561 }
3563 /* Consume tokens up to, and including, the next non-nested closing `)'.
3564 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3565 are doing error recovery. Returns -1 if OR_COMMA is true and we
3566 found an unnested token of that type. */
3568 static int
3573 {
3577 }
3579 /* Consume tokens until we reach the end of the current statement.
3580 Normally, that will be just before consuming a `;'. However, if a
3581 non-nested `}' comes first, then we stop before consuming that. */
3583 static void
3585 {
3588 /* Unwind generic function template scope if necessary. */
3593 {
3597 {
3600 /* If we've run out of tokens, stop. */
3604 /* If the next token is a `;', we have reached the end of the
3605 statement. */
3611 /* If this is a non-nested '}', stop before consuming it.
3612 That way, when confronted with something like:
3614 { 3 + }
3616 we stop before consuming the closing '}', even though we
3617 have not yet reached a `;'. */
3621 /* If it is the closing '}' for a block that we have
3622 scanned, stop -- but only after consuming the token.
3623 That way given:
3625 void f g () { ... }
3626 typedef int I;
3628 we will stop after the body of the erroneously declared
3629 function, but before consuming the following `typedef'
3630 declaration. */
3632 {
3635 }
3644 }
3646 /* Consume the token. */
3648 }
3649 }
3651 /* This function is called at the end of a statement or declaration.
3652 If the next token is a semicolon, it is consumed; otherwise, error
3653 recovery is attempted. */
3655 static void
3657 {
3658 /* Look for the trailing `;'. */
3660 {
3661 /* If there is additional (erroneous) input, skip to the end of
3662 the statement. */
3664 /* If the next token is now a `;', consume it. */
3667 }
3668 }
3670 /* Skip tokens until we have consumed an entire block, or until we
3671 have consumed a non-nested `;'. */
3673 static void
3675 {
3678 /* Unwind generic function template scope if necessary. */
3683 {
3687 {
3690 /* If we've run out of tokens, stop. */
3694 /* Stop if this is an unnested ';'. */
3700 /* Stop if this is an unnested '}', or closes the outermost
3701 nesting level. */
3702 nesting_depth--;
3710 /* Nest. */
3711 nesting_depth++;
3716 }
3718 /* Consume the token. */
3720 }
3721 }
3723 /* Skip tokens until a non-nested closing curly brace is the next
3724 token, or there are no more tokens. Return true in the first case,
3725 false otherwise. */
3727 static bool
3729 {
3733 {
3737 {
3740 /* If we've run out of tokens, stop. */
3744 /* If the next token is a non-nested `}', then we have reached
3745 the end of the current block. */
3751 /* If it the next token is a `{', then we are entering a new
3752 block. Consume the entire block. */
3758 }
3760 /* Consume the token. */
3762 }
3763 }
3765 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3766 parameter is the PRAGMA token, allowing us to purge the entire pragma
3767 sequence. */
3769 static void
3771 {
3776 do
3780 /* Ensure that the pragma is not parsed again. */
3782 }
3784 /* Require pragma end of line, resyncing with it as necessary. The
3785 arguments are as for cp_parser_skip_to_pragma_eol. */
3787 static void
3789 {
3793 }
3795 /* This is a simple wrapper around make_typename_type. When the id is
3796 an unresolved identifier node, we can provide a superior diagnostic
3797 using cp_parser_diagnose_invalid_type_name. */
3799 static tree
3801 location_t id_location)
3802 {
3803 tree result;
3805 {
3811 }
3813 }
3815 /* This is a wrapper around the
3816 make_{pointer,ptrmem,reference}_declarator functions that decides
3817 which one to call based on the CODE and CLASS_TYPE arguments. The
3818 CODE argument should be one of the values returned by
3819 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3820 appertain to the pointer or reference. */
3824 cp_cv_quals cv_qualifiers,
3826 tree attributes)
3827 {
3834 else
3844 }
3846 /* Create a new C++ parser. */
3850 {
3855 /* cp_lexer_new_main is called before doing GC allocation because
3856 cp_lexer_new_main might load a PCH file. */
3859 /* Initialize the binops_by_token so that we can get the tree
3860 directly from the token. */
3868 /* For now, we always accept GNU extensions. */
3871 /* The `>' token is a greater-than operator, not the end of a
3872 template-id. */
3877 /* We are not parsing a constant-expression. */
3882 /* Local variable names are not forbidden. */
3885 /* We are not processing an `extern "C"' declaration. */
3888 /* We are not processing a declarator. */
3891 /* We are not processing a template-argument-list. */
3894 /* We are not in an iteration statement. */
3897 /* We are not in a switch statement. */
3900 /* We are not parsing a type-id inside an expression. */
3903 /* Declarations aren't implicitly extern "C". */
3906 /* String literals should be translated to the execution character set. */
3909 /* We are not parsing a function body. */
3912 /* We can correct until told otherwise. */
3915 /* The unparsed function queue is empty. */
3918 /* There are no classes being defined. */
3921 /* No template parameters apply. */
3924 /* Special parsing data structures. */
3928 /* Not declaring an implicit function template. */
3934 /* Allow constrained-type-specifiers. */
3937 /* We haven't yet seen an 'extern "C"'. */
3941 }
3943 /* Create a cp_lexer structure which will emit the tokens in CACHE
3944 and push it onto the parser's lexer stack. This is used for delayed
3945 parsing of in-class method bodies and default arguments, and should
3946 not be confused with tentative parsing. */
3947 static void
3949 {
3954 /* Move the current source position to that of the first token in the
3955 new lexer. */
3957 }
3959 /* Pop the top lexer off the parser stack. This is never used for the
3960 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3961 static void
3963 {
3968 /* Put the current source position back where it was before this
3969 lexer was pushed. */
3971 }
3973 /* Lexical conventions [gram.lex] */
3975 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3976 identifier. */
3978 static cp_expr
3980 {
3983 /* Look for the identifier. */
3985 /* Return the value. */
3988 else
3990 }
3992 /* Parse a sequence of adjacent string constants. Returns a
3993 TREE_STRING representing the combined, nul-terminated string
3994 constant. If TRANSLATE is true, translate the string to the
3995 execution character set. If WIDE_OK is true, a wide string is
3996 invalid here.
3998 C++98 [lex.string] says that if a narrow string literal token is
3999 adjacent to a wide string literal token, the behavior is undefined.
4000 However, C99 6.4.5p4 says that this results in a wide string literal.
4001 We follow C99 here, for consistency with the C front end.
4003 This code is largely lifted from lex_string() in c-lex.c.
4005 FUTURE: ObjC++ will need to handle @-strings here. */
4006 static cp_expr
4009 {
4010 tree value;
4017 tree string_tree;
4023 {
4026 }
4031 {
4035 }
4036 else
4037 {
4040 }
4043 /* Try to avoid the overhead of creating and destroying an obstack
4044 for the common case of just one string. */
4047 {
4055 {
4059 }
4060 else
4064 }
4065 else
4066 {
4071 do
4072 {
4074 count++;
4079 {
4082 {
4085 }
4088 {
4093 }
4095 }
4096 else
4100 {
4104 {
4108 "unsupported non-standard concatenation "
4110 }
4111 }
4119 {
4123 }
4124 else
4125 {
4129 }
4130 }
4133 /* A string literal built by concatenation has its caret=start at
4134 the start of the initial string, and its finish at the finish of
4135 the final string literal. */
4139 }
4142 {
4145 }
4149 {
4154 {
4169 }
4174 {
4179 else
4181 }
4182 }
4183 else
4184 /* cpp_interpret_string has issued an error. */
4191 }
4193 /* Look up a literal operator with the name and the exact arguments. */
4195 static tree
4197 {
4198 tree decl;
4204 {
4210 {
4213 {
4223 }
4226 /* May be this should be sufficient_parms_p instead,
4227 depending on how exactly should user-defined literals
4228 work in presence of default arguments on the literal
4229 operator parameters. */
4232 }
4233 }
4236 }
4238 /* Parse a user-defined char constant. Returns a call to a user-defined
4239 literal operator taking the character as an argument. */
4241 static cp_expr
4243 {
4251 /* Build up a call to the user-defined operator */
4252 /* Lookup the name we got back from the id-expression. */
4257 {
4262 }
4266 }
4268 /* A subroutine of cp_parser_userdef_numeric_literal to
4269 create a char... template parameter pack from a string node. */
4271 static tree
4273 {
4274 tree charvec;
4280 /* Fill in CHARVEC with all of the parameters. */
4285 /* Build the argument packs. */
4291 }
4293 /* A subroutine of cp_parser_userdef_numeric_literal to
4294 create a char... template parameter pack from a string node. */
4296 static tree
4298 {
4299 tree charvec;
4310 /* First template parm is character type. */
4313 /* Fill in CHARVEC with all of the parameters. */
4320 /* Build the argument packs. */
4326 }
4328 /* Parse a user-defined numeric constant. returns a call to a user-defined
4329 literal operator. */
4331 static cp_expr
4333 {
4344 /* Look for a literal operator taking the exact type of numeric argument
4345 as the literal value. */
4350 {
4352 tf_warning_or_error);
4355 {
4358 long_long_unsigned_type_node);
4359 }
4360 else
4361 {
4365 long_double_type_node);
4369 }
4373 }
4376 /* If the numeric argument didn't work, look for a raw literal
4377 operator taking a const char* argument consisting of the number
4378 in string format. */
4383 {
4385 tf_warning_or_error);
4388 }
4391 /* If the raw literal didn't work, look for a non-type template
4392 function with parameter pack char.... Call the function with
4393 template parameter characters representing the number. */
4397 {
4401 tf_warning_or_error);
4404 }
4408 /* In C++14 the standard library defines complex number suffixes that
4409 conflict with GNU extensions. Prefer them if <complex> is #included. */
4419 {
4424 {
4425 /* No <complex>, so pedwarn and use GNU semantics. */
4428 }
4429 }
4431 bool complained
4438 {
4440 "(from <complex>) to enable the C++14 user-defined literal "
4445 }
4452 else
4453 {
4454 /* Use the built-in semantics. */
4455 tree type;
4457 {
4460 else
4462 }
4471 }
4474 /* Avoid repeated diagnostics. */
4477 }
4479 /* Parse a user-defined string constant. Returns a call to a user-defined
4480 literal operator taking a character pointer and the length of the string
4481 as arguments. */
4483 static tree
4485 {
4494 /* Build up a call to the user-defined operator. */
4495 /* Lookup the name we got back from the id-expression. */
4502 {
4504 tf_warning_or_error);
4507 }
4510 /* Look for a template function with typename parameter CharT
4511 and parameter pack CharT... Call the function with
4512 template parameter characters representing the string. */
4516 {
4520 tf_warning_or_error);
4523 }
4529 }
4532 /* Basic concepts [gram.basic] */
4534 /* Parse a translation-unit.
4536 translation-unit:
4537 declaration-seq [opt]
4539 Returns TRUE if all went well. */
4541 static bool
4543 {
4544 /* The address of the first non-permanent object on the declarator
4545 obstack. */
4550 /* Create the declarator obstack, if necessary. */
4552 {
4554 /* Create the error declarator. */
4556 /* Create the empty parameter list. */
4558 UNKNOWN_LOCATION);
4559 /* Remember where the base of the declarator obstack lies. */
4561 }
4565 /* If there are no tokens left then all went well. */
4567 {
4568 /* Get rid of the token array; we don't need it any more. */
4572 /* This file might have been a context that's implicitly extern
4573 "C". If so, pop the lang context. (Only relevant for PCH.) */
4575 {
4578 }
4580 /* Finish up. */
4584 }
4585 else
4586 {
4589 }
4591 /* Make sure the declarator obstack was fully cleaned up. */
4595 /* All went well. */
4597 }
4599 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4600 decltype context. */
4604 {
4609 }
4611 /* We're about to parse a collection of statements. If we're currently
4612 parsing tentatively, set up a firewall so that any nested
4613 cp_parser_commit_to_tentative_parse won't affect the current context. */
4615 static cp_token_position
4617 {
4624 }
4626 /* We've finished parsing the collection of statements. Wrap up the
4627 firewall and replace the relevant tokens with the parsed form. */
4629 static void
4631 tree expr)
4632 {
4636 /* Finish the firewall level. */
4638 /* And remember the result of the parse for when we try again. */
4644 }
4646 /* Like the above functions, but let the user modify the tokens. Used by
4647 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4648 later parses, so it makes sense to localize the effects of
4649 cp_parser_commit_to_tentative_parse. */
4651 struct tentative_firewall
4652 {
4657 {
4658 /* If we're currently parsing tentatively, start a committed level as a
4659 firewall and then an inner tentative parse. */
4661 {
4665 }
4666 }
4669 {
4671 {
4672 /* Finish the inner tentative parse and the firewall, propagating any
4673 uncommitted error state to the outer tentative parse. */
4679 }
4680 }
4681 };
4683 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4684 This class is for tracking such a matching pair of symbols.
4685 In particular, it tracks the location of the first token,
4686 so that if the second token is missing, we can highlight the
4687 location of the first token when notifying the user about the
4688 problem. */
4691 class token_pair
4692 {
4694 /* token_pair's ctor. */
4697 /* If the next token is the opening symbol for this pair, consume it and
4698 return true.
4699 Otherwise, issue an error and return false.
4700 In either case, record the location of the opening token. */
4703 {
4707 }
4709 /* Consume the next token from PARSER, recording its location as
4710 that of the opening token within the pair. */
4713 {
4718 }
4720 /* If the next token is the closing symbol for this pair, consume it
4721 and return it.
4722 Otherwise, issue an error, highlighting the location of the
4723 corresponding opening token, and return NULL. */
4726 {
4729 m_open_loc);
4730 }
4733 location_t m_open_loc;
4734 };
4736 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4738 struct matching_paren_traits
4739 {
4744 };
4746 /* "matching_parens" is a token_pair<T> class for tracking matching
4747 pairs of parentheses. */
4751 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4753 struct matching_brace_traits
4754 {
4759 };
4761 /* "matching_braces" is a token_pair<T> class for tracking matching
4762 pairs of braces. */
4767 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4768 enclosing parentheses. */
4770 static cp_expr
4772 {
4775 /* Consume the '('. */
4777 matching_parens parens;
4779 /* Start the statement-expression. */
4781 /* Parse the compound-statement. */
4783 /* Finish up. */
4785 /* Consume the ')'. */
4793 }
4795 /* Expressions [gram.expr] */
4797 /* Parse a fold-operator.
4799 fold-operator:
4800 - * / % ^ & | = < > << >>
4801 = -= *= /= %= ^= &= |= <<= >>=
4802 == != <= >= && || , .* ->*
4804 This returns the tree code corresponding to the matched operator
4805 as an int. When the current token matches a compound assignment
4806 opertor, the resulting tree code is the negative value of the
4807 non-assignment operator. */
4809 static int
4811 {
4813 {
4853 }
4854 }
4856 /* Returns true if CODE indicates a binary expression, which is not allowed in
4857 the LHS of a fold-expression. More codes will need to be added to use this
4858 function in other contexts. */
4860 static bool
4862 {
4864 {
4897 }
4898 }
4900 /* If the next token is a suitable fold operator, consume it and return as
4901 the function above. */
4903 static int
4905 {
4911 }
4913 /* Parse a fold-expression.
4915 fold-expression:
4916 ( ... folding-operator cast-expression)
4917 ( cast-expression folding-operator ... )
4918 ( cast-expression folding operator ... folding-operator cast-expression)
4920 Note that the '(' and ')' are matched in primary expression. */
4922 static cp_expr
4924 {
4925 cp_id_kind pidk;
4927 // Left fold.
4929 {
4933 {
4936 }
4943 }
4948 {
4951 }
4954 {
4957 }
4960 /* The operands of a fold-expression are cast-expressions, so binary or
4961 conditional expressions are not allowed. We check this here to avoid
4962 tentative parsing. */
4974 // Right fold.
4979 {
4982 }
4985 // Binary left or right fold.
4990 }
4992 /* Parse a primary-expression.
4994 primary-expression:
4995 literal
4996 this
4997 ( expression )
4998 id-expression
4999 lambda-expression (C++11)
5001 GNU Extensions:
5003 primary-expression:
5004 ( compound-statement )
5005 __builtin_va_arg ( assignment-expression , type-id )
5006 __builtin_offsetof ( type-id , offsetof-expression )
5008 C++ Extensions:
5009 __has_nothrow_assign ( type-id )
5010 __has_nothrow_constructor ( type-id )
5011 __has_nothrow_copy ( type-id )
5012 __has_trivial_assign ( type-id )
5013 __has_trivial_constructor ( type-id )
5014 __has_trivial_copy ( type-id )
5015 __has_trivial_destructor ( type-id )
5016 __has_virtual_destructor ( type-id )
5017 __is_abstract ( type-id )
5018 __is_base_of ( type-id , type-id )
5019 __is_class ( type-id )
5020 __is_empty ( type-id )
5021 __is_enum ( type-id )
5022 __is_final ( type-id )
5023 __is_literal_type ( type-id )
5024 __is_pod ( type-id )
5025 __is_polymorphic ( type-id )
5026 __is_std_layout ( type-id )
5027 __is_trivial ( type-id )
5028 __is_union ( type-id )
5030 Objective-C++ Extension:
5032 primary-expression:
5033 objc-expression
5035 literal:
5036 __null
5038 ADDRESS_P is true iff this expression was immediately preceded by
5039 "&" and therefore might denote a pointer-to-member. CAST_P is true
5040 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5041 true iff this expression is a template argument.
5043 Returns a representation of the expression. Upon return, *IDK
5044 indicates what kind of id-expression (if any) was present. */
5046 static cp_expr
5053 {
5056 /* Assume the primary expression is not an id-expression. */
5059 /* Peek at the next token. */
5062 {
5063 /* literal:
5064 integer-literal
5065 character-literal
5066 floating-literal
5067 string-literal
5068 boolean-literal
5069 pointer-literal
5070 user-defined-literal */
5082 {
5086 }
5087 /* Floating-point literals are only allowed in an integral
5088 constant expression if they are cast to an integral or
5089 enumeration type. */
5093 {
5094 /* CAST_P will be set even in invalid code like "int(2.7 +
5095 ...)". Therefore, we have to check that the next token
5096 is sure to end the cast. */
5098 {
5103 enumerator-definition. */
5105 /* The curly brace at the end of an enum-specifier. */
5107 /* The end of a statement. */
5109 /* The end of the cast-expression. */
5111 /* The end of an array bound. */
5113 /* The closing ">" in a template-argument-list. */
5116 /* C++0x only: A ">>" treated like two ">" tokens,
5117 in a template-argument-list. */
5122 }
5124 /* If we are within a cast, then the constraint that the
5125 cast is to an integral or enumeration type will be
5126 checked at that point. If we are not within a cast, then
5127 this code is invalid. */
5130 }
5150 /* ??? Should wide strings be allowed when parser->translate_strings_p
5151 is false (i.e. in attributes)? If not, we can kill the third
5152 argument to cp_parser_string_literal. */
5158 /* If we see `( { ' then we are looking at the beginning of
5159 a GNU statement-expression. */
5162 {
5163 /* Statement-expressions are not allowed by the standard. */
5167 /* And they're not allowed outside of a function-body; you
5168 cannot, for example, write:
5170 int i = ({ int j = 3; j + 1; });
5172 at class or namespace scope. */
5175 {
5177 "statement-expressions are not allowed outside "
5183 }
5184 else
5186 }
5187 /* Otherwise it's a normal parenthesized expression. */
5188 {
5189 cp_expr expr;
5194 /* Consume the `('. */
5195 matching_parens parens;
5197 /* Within a parenthesized expression, a `>' token is always
5198 the greater-than operator. */
5199 saved_greater_than_is_operator_p
5204 /* Left fold expression. */
5206 else
5207 /* Parse the parenthesized expression. */
5212 {
5219 }
5220 else
5221 /* Let the front end know that this expression was
5222 enclosed in parentheses. This matters in case, for
5223 example, the expression is of the form `A::B', since
5224 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5225 not. */
5228 /* DR 705: Wrapping an unqualified name in parentheses
5229 suppresses arg-dependent lookup. We want to pass back
5230 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5231 (c++/37862), but none of the others. */
5235 /* The `>' token might be the end of a template-id or
5236 template-parameter-list now. */
5237 parser->greater_than_is_operator_p
5240 /* Consume the `)'. */
5249 }
5252 {
5254 {
5255 /* We might have an Objective-C++ message. */
5258 /* If that works out, we're done ... */
5261 /* ... else, fall though to see if it's a lambda. */
5262 }
5264 /* Don't warn about a failed tentative parse. */
5269 }
5273 /* We have an Objective-C++ string literal. */
5280 {
5281 /* These two are the boolean literals. */
5289 /* The `__null' literal. */
5294 /* The `nullptr' literal. */
5299 /* Recognize the `this' keyword. */
5303 {
5307 }
5308 /* Pointers cannot appear in constant-expressions. */
5313 /* The `operator' keyword can be the beginning of an
5314 id-expression. */
5321 {
5322 non_integral_constant name;
5324 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5325 __func__ are the names of variables -- but they are
5326 treated specially. Therefore, they are handled here,
5327 rather than relying on the generic id-expression logic
5328 below. Grammatically, these names are id-expressions.
5330 Consume the token. */
5334 {
5346 }
5351 /* Look up the name. */
5353 }
5356 {
5357 tree expression;
5358 tree type;
5359 source_location type_location;
5360 location_t start_loc
5362 /* The `__builtin_va_arg' construct is used to handle
5363 `va_arg'. Consume the `__builtin_va_arg' token. */
5365 /* Look for the opening `('. */
5366 matching_parens parens;
5368 /* Now, parse the assignment-expression. */
5370 /* Look for the `,'. */
5373 /* Parse the type-id. */
5374 {
5377 }
5378 /* Look for the closing `)'. */
5379 location_t finish_loc
5382 /* Using `va_arg' in a constant-expression is not
5383 allowed. */
5385 NIC_VA_ARG))
5387 /* Construct a location of the form:
5388 __builtin_va_arg (v, int)
5389 ~~~~~~~~~~~~~~~~~~~~~^~~~
5390 with the caret at the type, ranging from the start of the
5391 "__builtin_va_arg" token to the close paren. */
5392 location_t combined_loc
5395 }
5430 // C++ concepts
5434 /* Objective-C++ expressions. */
5444 {
5449 }
5450 /* FALLTHRU */
5454 }
5456 /* An id-expression can start with either an identifier, a
5457 `::' as the beginning of a qualified-id, or the "operator"
5458 keyword. */
5463 {
5464 id_expression:
5465 cp_expr id_expression;
5466 cp_expr decl;
5472 /* Parse the id-expression. */
5473 id_expression
5490 /* If we have a template-id, then no further lookup is
5491 required. If the template-id was for a template-class, we
5492 will sometimes have a TYPE_DECL at this point. */
5496 /* Look up the name. */
5497 else
5498 {
5499 tree ambiguous_decls;
5501 /* If we already know that this lookup is ambiguous, then
5502 we've already issued an error message; there's no reason
5503 to check again. */
5506 {
5509 }
5512 none_type,
5513 template_p,
5518 /* If the lookup was ambiguous, an error will already have
5519 been issued. */
5523 /* In Objective-C++, we may have an Objective-C 2.0
5524 dot-syntax for classes here. */
5529 {
5530 tree component;
5537 component);
5538 /* Build a location of the form:
5539 expr.component
5540 ~~~~~^~~~~~~~~
5541 with caret at the start of the component name (at
5542 input_location), ranging from the start of the id_expression
5543 to the end of the component name. */
5544 location_t combined_loc
5549 }
5551 /* In Objective-C++, an instance variable (ivar) may be preferred
5552 to whatever cp_parser_lookup_name() found.
5553 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5554 rest of c-family, we have to do a little extra work to preserve
5555 any location information in cp_expr "decl". Given that
5556 objc_lookup_ivar is implemented in "c-family" and "objc", we
5557 have a trip through the pure "tree" type, rather than cp_expr.
5558 Naively copying it back to "decl" would implicitly give the
5559 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5560 store an EXPR_LOCATION. Hence we only update "decl" (and
5561 hence its location_t) if we get back a different tree node. */
5563 id_expression);
5567 /* If name lookup gives us a SCOPE_REF, then the
5568 qualifying scope was dependent. */
5570 {
5571 /* At this point, we do not know if DECL is a valid
5572 integral constant expression. We assume that it is
5573 in fact such an expression, so that code like:
5575 template <int N> struct A {
5576 int a[B<N>::i];
5577 };
5579 is accepted. At template-instantiation time, we
5580 will check that B<N>::i is actually a constant. */
5582 }
5583 /* Check to see if DECL is a local variable in a context
5584 where that is forbidden. */
5587 {
5588 /* It might be that we only found DECL because we are
5589 trying to be generous with pre-ISO scoping rules.
5590 For example, consider:
5592 int i;
5593 void g() {
5594 for (int i = 0; i < 10; ++i) {}
5595 extern void f(int j = i);
5596 }
5598 Here, name look up will originally find the out
5599 of scope `i'. We need to issue a warning message,
5600 but then use the global `i'. */
5603 {
5608 }
5609 }
5610 }
5612 decl = (finish_id_expression
5614 idk,
5619 template_arg_p,
5626 }
5628 /* Anything else is an error. */
5632 }
5633 }
5641 {
5644 }
5646 /* Parse an id-expression.
5648 id-expression:
5649 unqualified-id
5650 qualified-id
5652 qualified-id:
5653 :: [opt] nested-name-specifier template [opt] unqualified-id
5654 :: identifier
5655 :: operator-function-id
5656 :: template-id
5658 Return a representation of the unqualified portion of the
5659 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5660 a `::' or nested-name-specifier.
5662 Often, if the id-expression was a qualified-id, the caller will
5663 want to make a SCOPE_REF to represent the qualified-id. This
5664 function does not do this in order to avoid wastefully creating
5665 SCOPE_REFs when they are not required.
5667 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5668 `template' keyword.
5670 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5671 uninstantiated templates.
5673 If *TEMPLATE_P is non-NULL, it is set to true iff the
5674 `template' keyword is used to explicitly indicate that the entity
5675 named is a template.
5677 If DECLARATOR_P is true, the id-expression is appearing as part of
5678 a declarator, rather than as part of an expression. */
5680 static cp_expr
5687 {
5691 /* Assume the `template' keyword was not used. */
5695 /* Look for the optional `::' operator. */
5696 global_scope_p
5697 = (!template_keyword_p
5702 /* Look for the optional nested-name-specifier. */
5703 nested_name_specifier_p
5706 check_dependency_p,
5708 declarator_p,
5709 template_keyword_p)
5712 /* If there is a nested-name-specifier, then we are looking at
5713 the first qualified-id production. */
5715 {
5716 tree saved_scope;
5717 tree saved_object_scope;
5718 tree saved_qualifying_scope;
5719 cp_expr unqualified_id;
5722 /* See if the next token is the `template' keyword. */
5726 /* Name lookup we do during the processing of the
5727 unqualified-id might obliterate SCOPE. */
5731 /* Process the final unqualified-id. */
5733 check_dependency_p,
5734 declarator_p,
5736 /* Restore the SAVED_SCOPE for our caller. */
5742 }
5743 /* Otherwise, if we are in global scope, then we are looking at one
5744 of the other qualified-id productions. */
5746 {
5748 tree id;
5750 /* Peek at the next token. */
5753 /* If it's an identifier, and the next token is not a "<", then
5754 we can avoid the template-id case. This is an optimization
5755 for this common case. */
5757 && !cp_parser_nth_token_starts_template_argument_list_p
5762 /* Try a template-id. */
5766 none_type,
5767 declarator_p);
5768 /* If that worked, we're done. */
5772 /* Peek at the next token. (Changes in the token buffer may
5773 have invalidated the pointer obtained above.) */
5777 {
5784 /* Fall through. */
5789 }
5790 }
5791 else
5794 declarator_p,
5795 optional_p);
5796 }
5798 /* Parse an unqualified-id.
5800 unqualified-id:
5801 identifier
5802 operator-function-id
5803 conversion-function-id
5804 ~ class-name
5805 template-id
5807 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5808 keyword, in a construct like `A::template ...'.
5810 Returns a representation of unqualified-id. For the `identifier'
5811 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5812 production a BIT_NOT_EXPR is returned; the operand of the
5813 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5814 other productions, see the documentation accompanying the
5815 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5816 names are looked up in uninstantiated templates. If DECLARATOR_P
5817 is true, the unqualified-id is appearing as part of a declarator,
5818 rather than as part of an expression. */
5820 static cp_expr
5826 {
5829 /* Peek at the next token. */
5833 {
5835 {
5836 tree id;
5838 /* We don't know yet whether or not this will be a
5839 template-id. */
5841 /* Try a template-id. */
5843 check_dependency_p,
5844 none_type,
5845 declarator_p);
5846 /* If it worked, we're done. */
5849 /* Otherwise, it's an ordinary identifier. */
5851 }
5855 check_dependency_p,
5856 none_type,
5857 declarator_p);
5860 {
5861 tree type_decl;
5862 tree qualifying_scope;
5863 tree object_scope;
5864 tree scope;
5867 /* Consume the `~' token. */
5869 /* Parse the class-name. The standard, as written, seems to
5870 say that:
5872 template <typename T> struct S { ~S (); };
5873 template <typename T> S<T>::~S() {}
5875 is invalid, since `~' must be followed by a class-name, but
5876 `S<T>' is dependent, and so not known to be a class.
5877 That's not right; we need to look in uninstantiated
5878 templates. A further complication arises from:
5880 template <typename T> void f(T t) {
5881 t.T::~T();
5882 }
5884 Here, it is not possible to look up `T' in the scope of `T'
5885 itself. We must look in both the current scope, and the
5886 scope of the containing complete expression.
5888 Yet another issue is:
5890 struct S {
5891 int S;
5892 ~S();
5893 };
5895 S::~S() {}
5897 The standard does not seem to say that the `S' in `~S'
5898 should refer to the type `S' and not the data member
5899 `S::S'. */
5901 /* DR 244 says that we look up the name after the "~" in the
5902 same scope as we looked up the qualifying name. That idea
5903 isn't fully worked out; it's more complicated than that. */
5908 /* Check for invalid scopes. */
5910 {
5914 }
5916 {
5920 scope);
5925 }
5928 /* If the name is of the form "X::~X" it's OK even if X is a
5929 typedef. */
5938 {
5941 }
5943 /* ~auto means the destructor of whatever the object is. */
5945 {
5948 "%<~auto%> only available with "
5952 }
5954 /* If there was an explicit qualification (S::~T), first look
5955 in the scope given by the qualification (i.e., S).
5957 Note: in the calls to cp_parser_class_name below we pass
5958 typename_type so that lookup finds the injected-class-name
5959 rather than the constructor. */
5963 {
5968 typename_type,
5971 declarator_p);
5974 }
5975 /* In "N::S::~S", look in "N" as well. */
5977 {
5982 type_decl
5986 typename_type,
5989 declarator_p);
5992 }
5993 /* In "p->S::~T", look in the scope given by "*p" as well. */
5995 {
6000 type_decl
6004 typename_type,
6007 declarator_p);
6010 }
6011 /* Look in the surrounding context. */
6013 {
6019 type_decl
6023 typename_type,
6026 declarator_p);
6029 {
6030 /* We couldn't find a type with this name. If we're parsing
6031 tentatively, fail and try something else. */
6033 {
6036 }
6037 /* Otherwise, accept it and check for a match at instantiation
6038 time. */
6043 }
6044 }
6045 /* If an error occurred, assume that the name of the
6046 destructor is the same as the name of the qualifying
6047 class. That allows us to keep parsing after running
6048 into ill-formed destructor names. */
6054 /* Check that destructor name and scope match. */
6056 {
6063 }
6065 /* [class.dtor]
6067 A typedef-name that names a class shall not be used as the
6068 identifier in the declarator for a destructor declaration. */
6075 type_decl);
6078 }
6082 {
6083 cp_expr id;
6085 /* This could be a template-id, so we try that first. */
6087 /* Try a template-id. */
6090 none_type,
6091 declarator_p);
6092 /* If that worked, we're done. */
6095 /* We still don't know whether we're looking at an
6096 operator-function-id or a conversion-function-id. */
6098 /* Try an operator-function-id. */
6100 /* If that didn't work, try a conversion-function-id. */
6104 {
6105 /* 17.6.3.3.5 */
6110 "literal operator suffixes not preceded by %<_%>"
6112 }
6115 }
6116 /* Fall through. */
6123 }
6124 }
6126 /* Parse an (optional) nested-name-specifier.
6128 nested-name-specifier: [C++98]
6129 class-or-namespace-name :: nested-name-specifier [opt]
6130 class-or-namespace-name :: template nested-name-specifier [opt]
6132 nested-name-specifier: [C++0x]
6133 type-name ::
6134 namespace-name ::
6135 nested-name-specifier identifier ::
6136 nested-name-specifier template [opt] simple-template-id ::
6138 PARSER->SCOPE should be set appropriately before this function is
6139 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6140 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6141 in name lookups.
6143 Sets PARSER->SCOPE to the class (TYPE) or namespace
6144 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6145 it unchanged if there is no nested-name-specifier. Returns the new
6146 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6148 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6149 part of a declaration and/or decl-specifier. */
6151 static tree
6158 {
6163 /* Remember where the nested-name-specifier starts. */
6165 {
6168 }
6171 {
6172 tree new_scope;
6173 tree old_scope;
6174 tree saved_qualifying_scope;
6176 /* Spot cases that cannot be the beginning of a
6177 nested-name-specifier. */
6180 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6181 the already parsed nested-name-specifier. */
6183 {
6184 /* Grab the nested-name-specifier and continue the loop. */
6186 /* If we originally encountered this nested-name-specifier
6187 with IS_DECLARATION set to false, we will not have
6188 resolved TYPENAME_TYPEs, so we must do so here. */
6191 {
6196 }
6199 }
6201 /* Spot cases that cannot be the beginning of a
6202 nested-name-specifier. On the second and subsequent times
6203 through the loop, we look for the `template' keyword. */
6205 ;
6206 /* A template-id can start a nested-name-specifier. */
6208 ;
6209 /* DR 743: decltype can be used in a nested-name-specifier. */
6211 ;
6212 else
6213 {
6214 /* If the next token is not an identifier, then it is
6215 definitely not a type-name or namespace-name. */
6218 /* If the following token is neither a `<' (to begin a
6219 template-id), nor a `::', then we are not looking at a
6220 nested-name-specifier. */
6226 {
6230 "found %<:%> in nested-name-specifier, "
6233 }
6236 && !cp_parser_nth_token_starts_template_argument_list_p
6239 }
6241 /* The nested-name-specifier is optional, so we parse
6242 tentatively. */
6245 /* Look for the optional `template' keyword, if this isn't the
6246 first time through the loop. */
6250 /* Save the old scope since the name lookup we are about to do
6251 might destroy it. */
6254 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6255 look up names in "X<T>::I" in order to determine that "Y" is
6256 a template. So, if we have a typename at this point, we make
6257 an effort to look through it. */
6259 && !typename_keyword_p
6264 /* Parse the qualifying entity. */
6265 new_scope
6267 typename_keyword_p,
6268 template_keyword_p,
6269 check_dependency_p,
6270 type_p,
6271 is_declaration);
6272 /* Look for the `::' token. */
6275 /* If we found what we wanted, we keep going; otherwise, we're
6276 done. */
6278 {
6281 /* Restore the OLD_SCOPE since it was valid before the
6282 failed attempt at finding the last
6283 class-or-namespace-name. */
6287 /* If the next token is a decltype, and the one after that is a
6288 `::', then the decltype has failed to resolve to a class or
6289 enumeration type. Give this error even when parsing
6290 tentatively since it can't possibly be valid--and we're going
6291 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6292 won't get another chance.*/
6296 {
6303 /* As below. */
6306 }
6310 {
6311 /* If we have a non-type template-id followed by ::, it can't
6312 possibly be valid. */
6317 {
6320 {
6326 }
6327 else
6328 {
6329 /* Variable template. */
6334 }
6341 /* As below. */
6345 }
6346 }
6350 /* If the next token is an identifier, and the one after
6351 that is a `::', then any valid interpretation would have
6352 found a class-or-namespace-name. */
6358 {
6361 {
6363 {
6364 tree decl;
6365 tree ambiguous_decls;
6368 none_type,
6377 decl);
6379 {
6380 // cp_parser_lookup_name has the same diagnostic,
6381 // thus make sure to emit it at most once.
6384 {
6389 }
6391 }
6392 else
6393 {
6395 cp_parser_name_lookup_error
6398 else
6399 cp_parser_name_lookup_error
6402 }
6403 }
6406 /* Treat this as a successful nested-name-specifier
6407 due to:
6409 [basic.lookup.qual]
6411 If the name found is not a class-name (clause
6412 _class_) or namespace-name (_namespace.def_), the
6413 program is ill-formed. */
6415 }
6417 }
6419 }
6420 /* We've found one valid nested-name-specifier. */
6422 /* Name lookup always gives us a DECL. */
6425 /* Uses of "template" must be followed by actual templates. */
6437 new_scope);
6438 /* If it is a class scope, try to complete it; we are about to
6439 be looking up names inside the class. */
6441 /* Since checking types for dependency can be expensive,
6442 avoid doing it if the type is already complete. */
6444 /* Do not try to complete dependent types. */
6446 {
6448 /* If it is a typedef to current class, use the current
6449 class instead, as the typedef won't have any names inside
6450 it yet. */
6454 }
6455 /* Make sure we look in the right scope the next time through
6456 the loop. */
6458 }
6460 /* If parsing tentatively, replace the sequence of tokens that makes
6461 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6462 token. That way, should we re-parse the token stream, we will
6463 not have to repeat the effort required to do the parse, nor will
6464 we issue duplicate error messages. */
6466 {
6470 /* Reset the contents of the START token. */
6472 /* Retrieve any deferred checks. Do not pop this access checks yet
6473 so the memory will not be reclaimed during token replacing below. */
6481 /* Purge all subsequent tokens. */
6483 }
6489 }
6491 /* Parse a nested-name-specifier. See
6492 cp_parser_nested_name_specifier_opt for details. This function
6493 behaves identically, except that it will an issue an error if no
6494 nested-name-specifier is present. */
6496 static tree
6502 {
6503 tree scope;
6505 /* Look for the nested-name-specifier. */
6507 typename_keyword_p,
6508 check_dependency_p,
6509 type_p,
6510 is_declaration);
6511 /* If it was not present, issue an error message. */
6513 {
6516 }
6519 }
6521 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6522 this is either a class-name or a namespace-name (which corresponds
6523 to the class-or-namespace-name production in the grammar). For
6524 C++0x, it can also be a type-name that refers to an enumeration
6525 type or a simple-template-id.
6527 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6528 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6529 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6530 TYPE_P is TRUE iff the next name should be taken as a class-name,
6531 even the same name is declared to be another entity in the same
6532 scope.
6534 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6535 specified by the class-or-namespace-name. If neither is found the
6536 ERROR_MARK_NODE is returned. */
6538 static tree
6545 {
6546 tree saved_scope;
6547 tree saved_qualifying_scope;
6548 tree saved_object_scope;
6549 tree scope;
6553 /* DR 743: decltype can appear in a nested-name-specifier. */
6555 {
6559 {
6562 }
6566 }
6568 /* Before we try to parse the class-name, we must save away the
6569 current PARSER->SCOPE since cp_parser_class_name will destroy
6570 it. */
6574 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6575 there is no need to look for a namespace-name. */
6576 only_class_p = template_keyword_p
6581 typename_keyword_p,
6582 template_keyword_p,
6584 check_dependency_p,
6586 is_declaration,
6589 /* If that didn't work, try for a namespace-name. */
6591 {
6592 /* Restore the saved scope. */
6596 /* If we are not looking at an identifier followed by the scope
6597 resolution operator, then this is not part of a
6598 nested-name-specifier. (Note that this function is only used
6599 to parse the components of a nested-name-specifier.) */
6604 }
6607 }
6609 /* Return true if we are looking at a compound-literal, false otherwise. */
6611 static bool
6613 {
6616 /* Skip tokens until the next token is a closing parenthesis.
6617 If we find the closing `)', and the next token is a `{', then
6618 we are looking at a compound-literal. */
6619 bool compound_literal_p
6624 /* Roll back the tokens we skipped. */
6628 }
6630 /* Return true if EXPR is the integer constant zero or a complex constant
6631 of zero, without any folding, but ignoring location wrappers. */
6633 static bool
6635 {
6638 }
6640 /* Parse a postfix-expression.
6642 postfix-expression:
6643 primary-expression
6644 postfix-expression [ expression ]
6645 postfix-expression ( expression-list [opt] )
6646 simple-type-specifier ( expression-list [opt] )
6647 typename :: [opt] nested-name-specifier identifier
6648 ( expression-list [opt] )
6649 typename :: [opt] nested-name-specifier template [opt] template-id
6650 ( expression-list [opt] )
6651 postfix-expression . template [opt] id-expression
6652 postfix-expression -> template [opt] id-expression
6653 postfix-expression . pseudo-destructor-name
6654 postfix-expression -> pseudo-destructor-name
6655 postfix-expression ++
6656 postfix-expression --
6657 dynamic_cast < type-id > ( expression )
6658 static_cast < type-id > ( expression )
6659 reinterpret_cast < type-id > ( expression )
6660 const_cast < type-id > ( expression )
6661 typeid ( expression )
6662 typeid ( type-id )
6664 GNU Extension:
6666 postfix-expression:
6667 ( type-id ) { initializer-list , [opt] }
6669 This extension is a GNU version of the C99 compound-literal
6670 construct. (The C99 grammar uses `type-name' instead of `type-id',
6671 but they are essentially the same concept.)
6673 If ADDRESS_P is true, the postfix expression is the operand of the
6674 `&' operator. CAST_P is true if this expression is the target of a
6675 cast.
6677 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6678 class member access expressions [expr.ref].
6680 Returns a representation of the expression. */
6682 static cp_expr
6686 {
6688 location_t loc;
6694 /* Peek at the next token. */
6699 /* Some of the productions are determined by keywords. */
6702 {
6707 {
6708 tree type;
6709 cp_expr expression;
6713 /* All of these can be handled in the same way from the point
6714 of view of parsing. Begin by consuming the token
6715 identifying the cast. */
6718 /* New types cannot be defined in the cast. */
6720 parser->type_definition_forbidden_message
6723 /* Look for the opening `<'. */
6725 /* Parse the type to which we are casting. */
6730 /* Look for the closing `>'. */
6732 /* Restore the old message. */
6735 bool saved_greater_than_is_operator_p
6739 /* And the expression which is being cast. */
6740 matching_parens parens;
6744 RT_CLOSE_PAREN);
6748 parser->greater_than_is_operator_p
6751 /* Only type conversions to integral or enumeration types
6752 can be used in constant-expressions. */
6755 {
6758 }
6761 {
6763 postfix_expression
6767 postfix_expression
6771 postfix_expression
6773 tf_warning_or_error);
6776 postfix_expression
6781 }
6783 /* Construct a location e.g. :
6784 reinterpret_cast <int *> (expr)
6785 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6786 ranging from the start of the "*_cast" token to the final closing
6787 paren, with the caret at the start. */
6790 }
6794 {
6795 tree type;
6799 /* Consume the `typeid' token. */
6801 /* Look for the `(' token. */
6802 matching_parens parens;
6804 /* Types cannot be defined in a `typeid' expression. */
6806 parser->type_definition_forbidden_message
6808 /* We can't be sure yet whether we're looking at a type-id or an
6809 expression. */
6811 /* Try a type-id first. */
6816 /* Look for the `)' token. Otherwise, we can't be sure that
6817 we're not looking at an expression: consider `typeid (int
6818 (3))', for example. */
6820 /* If all went well, simply lookup the type-id. */
6823 /* Otherwise, fall back to the expression variant. */
6824 else
6825 {
6826 tree expression;
6828 /* Look for an expression. */
6830 /* Compute its typeid. */
6832 /* Look for the `)' token. */
6834 }
6835 /* Restore the saved message. */
6837 /* `typeid' may not appear in an integral constant expression. */
6841 /* Construct a location e.g. :
6842 typeid (expr)
6843 ^~~~~~~~~~~~~
6844 ranging from the start of the "typeid" token to the final closing
6845 paren, with the caret at the start. */
6847 {
6848 location_t typeid_loc
6852 }
6853 }
6857 {
6858 tree type;
6859 /* The syntax permitted here is the same permitted for an
6860 elaborated-type-specifier. */
6867 }
6873 {
6876 tree p;
6883 {
6886 }
6892 {
6895 postfix_expression
6897 else
6898 {
6902 }
6908 tf_warning_or_error);
6909 else
6910 {
6914 }
6919 postfix_expression
6923 postfix_expression
6926 else
6927 {
6931 }
6936 }
6938 }
6941 {
6942 tree type;
6944 /* If the next thing is a simple-type-specifier, we may be
6945 looking at a functional cast. We could also be looking at
6946 an id-expression. So, we try the functional cast, and if
6947 that doesn't work we fall back to the primary-expression. */
6949 /* Look for the simple-type-specifier. */
6953 CP_PARSER_FLAGS_NONE);
6955 /* Parse the cast itself. */
6957 postfix_expression
6959 /* If that worked, we're done. */
6963 /* If the functional-cast didn't work out, try a
6964 compound-literal. */
6967 {
6972 matching_parens parens;
6975 /* Avoid calling cp_parser_type_id pointlessly, see comment
6976 in cp_parser_cast_expression about c++/29234. */
6979 else
6980 {
6981 /* Parse the type. */
6987 }
6989 /* If things aren't going well, there's no need to
6990 keep going. */
6992 {
6994 /* Parse the brace-enclosed initializer list. */
6997 }
6998 /* If that worked, we're definitely looking at a
6999 compound-literal expression. */
7001 {
7002 /* Warn the user that a compound literal is not
7003 allowed in standard C++. */
7006 /* For simplicity, we disallow compound literals in
7007 constant-expressions. We could
7008 allow compound literals of integer type, whose
7009 initializer was a constant, in constant
7010 expressions. Permitting that usage, as a further
7011 extension, would not change the meaning of any
7012 currently accepted programs. (Of course, as
7013 compound literals are not part of ISO C++, the
7014 standard has nothing to say.) */
7016 NIC_NCC))
7017 {
7020 }
7021 /* Form the representation of the compound-literal. */
7022 postfix_expression
7027 }
7028 }
7030 /* It must be a primary-expression. */
7031 postfix_expression
7034 decltype_p,
7036 }
7038 }
7040 /* Note that we don't need to worry about calling build_cplus_new on a
7041 class-valued CALL_EXPR in decltype when it isn't the end of the
7042 postfix-expression; unary_complex_lvalue will take care of that for
7043 all these cases. */
7045 /* Keep looping until the postfix-expression is complete. */
7047 {
7051 /* It is not a Koenig lookup function call. */
7052 postfix_expression
7055 /* Peek at the next token. */
7059 {
7062 {
7064 "two consecutive %<[%> shall "
7067 }
7068 postfix_expression
7070 postfix_expression,
7072 decltype_p);
7081 /* postfix-expression ( expression-list [opt] ) */
7082 {
7093 is_builtin_constant_p
7096 {
7097 /* The whole point of __builtin_constant_p is to allow
7098 non-constant expressions to appear as arguments. */
7099 saved_integral_constant_expression_p
7101 saved_non_integral_constant_expression_p
7104 }
7105 args = (cp_parser_parenthesized_expression_list
7112 {
7113 parser->integral_constant_expression_p
7115 parser->non_integral_constant_expression_p
7117 }
7120 {
7123 }
7125 /* Function calls are not permitted in
7126 constant-expressions. */
7129 NIC_FUNC_CALL))
7130 {
7134 }
7139 {
7141 {
7143 {
7146 postfix_expression
7148 complain);
7149 }
7150 else
7151 postfix_expression
7153 }
7154 /* We do not perform argument-dependent lookup if
7155 normal lookup finds a non-function, in accordance
7156 with the expected resolution of DR 218. */
7159 {
7163 /* Do not do argument dependent lookup if regular
7164 lookup finds a member function or a block-scope
7165 function declaration. [basic.lookup.argdep]/3 */
7168 {
7171 postfix_expression
7173 complain);
7174 }
7175 }
7176 }
7182 {
7189 }
7192 {
7202 {
7204 postfix_expression
7208 }
7211 {
7212 postfix_expression
7213 = (build_new_method_call
7219 complain));
7220 }
7221 else
7222 postfix_expression
7226 complain);
7227 }
7231 postfix_expression = (build_offset_ref_call_from_tree
7233 complain));
7235 /* A call to a static class member, or a namespace-scope
7236 function. */
7237 postfix_expression
7240 koenig_p,
7241 complain);
7242 else
7243 /* All other function calls. */
7244 postfix_expression
7247 koenig_p,
7248 complain);
7251 {
7253 start_loc,
7254 close_paren_loc);
7256 }
7258 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7262 }
7267 /* postfix-expression . template [opt] id-expression
7268 postfix-expression . pseudo-destructor-name
7269 postfix-expression -> template [opt] id-expression
7270 postfix-expression -> pseudo-destructor-name */
7272 /* Consume the `.' or `->' operator. */
7275 postfix_expression
7277 postfix_expression,
7284 /* postfix-expression ++ */
7285 /* Consume the `++' token. */
7287 /* Generate a representation for the complete expression. */
7288 postfix_expression
7290 POSTINCREMENT_EXPR);
7291 /* Increments may not appear in constant-expressions. */
7299 /* postfix-expression -- */
7300 /* Consume the `--' token. */
7302 /* Generate a representation for the complete expression. */
7303 postfix_expression
7305 POSTDECREMENT_EXPR);
7306 /* Decrements may not appear in constant-expressions. */
7317 return is_member_access
7318 ? postfix_expression
7320 else
7322 }
7323 }
7325 /* We should never get here. */
7328 }
7330 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7331 by cp_parser_builtin_offsetof. We're looking for
7333 postfix-expression [ expression ]
7334 postfix-expression [ braced-init-list ] (C++11)
7336 FOR_OFFSETOF is set if we're being called in that context, which
7337 changes how we deal with integer constant expressions. */
7339 static tree
7341 tree postfix_expression,
7344 {
7349 /* Consume the `[' token. */
7355 /* Parse the index expression. */
7356 /* ??? For offsetof, there is a question of what to allow here. If
7357 offsetof is not being used in an integral constant expression context,
7358 then we *could* get the right answer by computing the value at runtime.
7359 If we are in an integral constant expression context, then we might
7360 could accept any constant expression; hard to say without analysis.
7361 Rather than open the barn door too wide right away, allow only integer
7362 constant expressions here. */
7365 else
7366 {
7368 {
7373 }
7374 else
7376 }
7380 /* Look for the closing `]'. */
7383 /* Build the ARRAY_REF. */
7387 /* When not doing offsetof, array references are not permitted in
7388 constant-expressions. */
7394 }
7396 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7397 dereference of incomplete type, returns true if error_mark_node should
7398 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7399 and *DEPENDENT_P. */
7401 bool
7404 {
7405 /* In a template, be permissive by treating an object expression
7406 of incomplete type as dependent (after a pedwarn). */
7407 diagnostic_t kind = (processing_template_decl
7411 {
7423 /* Don't emit any diagnostic for OVERLOADs. */
7427 /* Avoid clobbering e.g. DECLs. */
7431 }
7443 {
7446 }
7448 }
7450 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7451 by cp_parser_builtin_offsetof. We're looking for
7453 postfix-expression . template [opt] id-expression
7454 postfix-expression . pseudo-destructor-name
7455 postfix-expression -> template [opt] id-expression
7456 postfix-expression -> pseudo-destructor-name
7458 FOR_OFFSETOF is set if we're being called in that context. That sorta
7459 limits what of the above we'll actually accept, but nevermind.
7460 TOKEN_TYPE is the "." or "->" token, which will already have been
7461 removed from the stream. */
7463 static tree
7466 cp_expr postfix_expression,
7468 location_t location)
7469 {
7470 tree name;
7476 /* If this is a `->' operator, dereference the pointer. */
7479 tf_warning_or_error);
7480 /* Check to see whether or not the expression is type-dependent and
7481 not the current instantiation. */
7483 /* The identifier following the `->' or `.' is not qualified. */
7489 /* Enter the scope corresponding to the type of the object
7490 given by the POSTFIX_EXPRESSION. */
7492 {
7494 /* According to the standard, no expression should ever have
7495 reference type. Unfortunately, we do not currently match
7496 the standard in this respect in that our internal representation
7497 of an expression may have reference type even when the standard
7498 says it does not. Therefore, we have to manually obtain the
7499 underlying type here. */
7501 /* The type of the POSTFIX_EXPRESSION must be complete. */
7502 /* Unlike the object expression in other contexts, *this is not
7503 required to be of complete type for purposes of class member
7504 access (5.2.5) outside the member function body. */
7507 && !(processing_template_decl
7508 && current_class_type
7509 && (same_type_ignoring_top_level_qualifiers_p
7511 {
7517 }
7520 {
7521 /* Let the name lookup machinery know that we are processing a
7522 class member access expression. */
7524 /* If something went wrong, we want to be able to discern that case,
7525 as opposed to the case where there was no SCOPE due to the type
7526 of expression being dependent. */
7529 /* If the SCOPE was erroneous, make the various semantic analysis
7530 functions exit quickly -- and without issuing additional error
7531 messages. */
7534 }
7535 }
7538 /* Tell cp_parser_lookup_name that there was an object, even though it's
7539 type-dependent. */
7542 /* Assume this expression is not a pseudo-destructor access. */
7545 /* If the SCOPE is a scalar type, then, if this is a valid program,
7546 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7547 is type dependent, it can be pseudo-destructor-name or something else.
7548 Try to parse it as pseudo-destructor-name first. */
7550 {
7551 tree s;
7552 tree type;
7555 /* Parse the pseudo-destructor-name. */
7564 {
7566 postfix_expression
7569 }
7570 }
7573 {
7574 /* If the SCOPE is not a scalar type, we are looking at an
7575 ordinary class member access expression, rather than a
7576 pseudo-destructor-name. */
7579 /* Parse the id-expression. */
7580 name = (cp_parser_id_expression
7587 /* In general, build a SCOPE_REF if the member name is qualified.
7588 However, if the name was not dependent and has already been
7589 resolved; there is no need to build the SCOPE_REF. For example;
7591 struct X { void f(); };
7592 template <typename T> void f(T* t) { t->X::f(); }
7594 Even though "t" is dependent, "X::f" is not and has been resolved
7595 to a BASELINK; there is no need to include scope information. */
7597 /* But we do need to remember that there was an explicit scope for
7598 virtual function calls. */
7602 /* If the name is a template-id that names a type, we will get a
7603 TYPE_DECL here. That is invalid code. */
7605 {
7608 }
7609 else
7610 {
7612 {
7614 {
7618 }
7619 else
7622 name,
7623 template_p);
7627 }
7629 adjust_result_of_qualified_name_lookup
7631 postfix_expression
7633 template_p,
7634 tf_warning_or_error);
7635 /* Build a location e.g.:
7636 ptr->access_expr
7637 ~~~^~~~~~~~~~~~~
7638 where the caret is at the deref token, ranging from
7639 the start of postfix_expression to the end of the access expr. */
7640 location_t end_loc
7642 location_t combined_loc
7645 }
7646 }
7648 /* We no longer need to look up names in the scope of the object on
7649 the left-hand side of the `.' or `->' operator. */
7652 /* Outside of offsetof, these operators may not appear in
7653 constant-expressions. */
7655 && (cp_parser_non_integral_constant_expression
7660 }
7662 /* Parse a parenthesized expression-list.
7664 expression-list:
7665 assignment-expression
7666 expression-list, assignment-expression
7668 attribute-list:
7669 expression-list
7670 identifier
7671 identifier, expression-list
7673 CAST_P is true if this expression is the target of a cast.
7675 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7676 argument pack.
7678 WRAP_LOCATIONS_P is true if expressions within this list for which
7679 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7680 their source locations.
7682 Returns a vector of trees. Each element is a representation of an
7683 assignment-expression. NULL is returned if the ( and or ) are
7684 missing. An empty, but allocated, vector is returned on no
7685 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7686 if we are parsing an attribute list for an attribute that wants a
7687 plain identifier argument, normal_attr for an attribute that wants
7688 an expression, or non_attr if we aren't parsing an attribute list. If
7689 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7690 not all of the expressions in the list were constant.
7691 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7692 will be written to with the location of the closing parenthesis. If
7693 an error occurs, it may or may not be written to. */
7703 {
7709 /* Assume all the expressions will be constant. */
7713 matching_parens parens;
7719 /* Within a parenthesized expression, a `>' token is always
7720 the greater-than operator. */
7721 saved_greater_than_is_operator_p
7727 /* Consume expressions until there are no more. */
7730 {
7731 /* At the beginning of attribute lists, check to see if the
7732 next token is an identifier. */
7735 {
7738 /* Consume the identifier. */
7740 /* Save the identifier. */
7742 }
7743 else
7744 {
7747 /* Parse the next assignment-expression. */
7749 {
7750 /* A braced-init-list. */
7756 }
7758 {
7759 expr = (cp_parser_constant_expression
7764 }
7765 else
7767 cast_p);
7772 /* If we have an ellipsis, then this is an expression
7773 expansion. */
7776 {
7777 /* Consume the `...'. */
7780 /* Build the argument pack. */
7782 }
7787 /* Add it to the list. We add error_mark_node
7788 expressions to the list, so that we can still tell if
7789 the correct form for a parenthesized expression-list
7790 is found. That gives better errors. */
7795 }
7797 /* After the first item, attribute lists look the same as
7798 expression lists. */
7801 get_comma:;
7802 /* If the next token isn't a `,', then we are done. */
7806 /* Otherwise, consume the `,' and keep going. */
7808 }
7814 {
7817 skip_comma:;
7818 /* We try and resync to an unnested comma, as that will give the
7819 user better diagnostics. */
7827 {
7828 parser->greater_than_is_operator_p
7831 }
7832 }
7834 parser->greater_than_is_operator_p
7841 }
7843 /* Parse a pseudo-destructor-name.
7845 pseudo-destructor-name:
7846 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7847 :: [opt] nested-name-specifier template template-id :: ~ type-name
7848 :: [opt] nested-name-specifier [opt] ~ type-name
7850 If either of the first two productions is used, sets *SCOPE to the
7851 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7852 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7853 or ERROR_MARK_NODE if the parse fails. */
7855 static void
7857 tree object,
7860 {
7863 /* Handle ~auto. */
7867 {
7870 "%<~auto%> only available with "
7877 }
7879 /* Assume that things will not work out. */
7882 /* Look for the optional `::' operator. */
7884 /* Look for the optional nested-name-specifier. */
7885 nested_name_specifier_p
7892 /* Now, if we saw a nested-name-specifier, we might be doing the
7893 second production. */
7896 {
7897 /* Consume the `template' keyword. */
7899 /* Parse the template-id. */
7903 class_type,
7905 /* Look for the `::' token. */
7907 }
7908 /* If the next token is not a `~', then there might be some
7909 additional qualification. */
7911 {
7912 /* At this point, we're looking for "type-name :: ~". The type-name
7913 must not be a class-name, since this is a pseudo-destructor. So,
7914 it must be either an enum-name, or a typedef-name -- both of which
7915 are just identifiers. So, we peek ahead to check that the "::"
7916 and "~" tokens are present; if they are not, then we can avoid
7917 calling type_name. */
7921 {
7924 }
7926 /* Look for the type-name. */
7931 /* Look for the `::' token. */
7933 }
7934 else
7937 /* Look for the `~'. */
7940 /* Once we see the ~, this has to be a pseudo-destructor. */
7944 /* Look for the type-name again. We are not responsible for
7945 checking that it matches the first type-name. */
7947 }
7949 /* Parse a unary-expression.
7951 unary-expression:
7952 postfix-expression
7953 ++ cast-expression
7954 -- cast-expression
7955 unary-operator cast-expression
7956 sizeof unary-expression
7957 sizeof ( type-id )
7958 alignof ( type-id ) [C++0x]
7959 new-expression
7960 delete-expression
7962 GNU Extensions:
7964 unary-expression:
7965 __extension__ cast-expression
7966 __alignof__ unary-expression
7967 __alignof__ ( type-id )
7968 alignof unary-expression [C++0x]
7969 __real__ cast-expression
7970 __imag__ cast-expression
7971 && identifier
7972 sizeof ( type-id ) { initializer-list , [opt] }
7973 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7974 __alignof__ ( type-id ) { initializer-list , [opt] }
7976 ADDRESS_P is true iff the unary-expression is appearing as the
7977 operand of the `&' operator. CAST_P is true if this expression is
7978 the target of a cast.
7980 Returns a representation of the expression. */
7982 static cp_expr
7985 {
7989 /* Peek at the next token. */
7991 /* Some keywords give away the kind of expression. */
7993 {
7997 {
8000 {
8006 /* Consume the token. */
8008 /* Parse the operand. */
8013 else
8014 {
8015 /* ISO C++ defines alignof only with types, not with
8016 expressions. So pedwarn if alignof is used with a non-
8017 type expression. However, __alignof__ is ok. */
8020 "ISO C++ does not allow %<alignof%> "
8024 }
8025 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8026 SIZEOF_EXPR with the original operand. */
8028 {
8030 {
8032 {
8035 error_mark_node));
8037 }
8038 else
8042 }
8043 }
8045 /* Construct a location e.g. :
8046 alignof (expr)
8047 ^~~~~~~~~~~~~~
8048 with start == caret at the start of the "alignof"/"sizeof"
8049 token, with the endpoint at the final closing paren. */
8050 location_t finish_loc
8052 location_t compound_loc
8059 }
8068 {
8069 /* The saved value of the PEDANTIC flag. */
8071 tree expr;
8073 /* Save away the PEDANTIC flag. */
8075 /* Parse the cast-expression. */
8077 /* Restore the PEDANTIC flag. */
8081 }
8085 {
8086 tree expression;
8088 /* Consume the `__real__' or `__imag__' token. */
8090 /* Parse the cast-expression. */
8092 /* Create the complete representation. */
8096 expression,
8097 tf_warning_or_error);
8098 }
8106 {
8107 tree expr;
8116 matching_parens parens;
8120 parser->type_definition_forbidden_message
8123 saved_integral_constant_expression_p
8125 saved_non_integral_constant_expression_p
8129 saved_greater_than_is_operator_p
8141 parser->greater_than_is_operator_p
8144 parser->integral_constant_expression_p
8146 parser->non_integral_constant_expression_p
8151 location_t finish_loc
8155 /* Construct a location of the form:
8156 noexcept (expr)
8157 ^~~~~~~~~~~~~~~
8158 with start == caret, finishing at the close-paren. */
8159 location_t noexcept_loc
8163 noexcept_loc);
8164 }
8168 }
8169 }
8171 /* Look for the `:: new' and `:: delete', which also signal the
8172 beginning of a new-expression, or delete-expression,
8173 respectively. If the next token is `::', then it might be one of
8174 these. */
8176 {
8179 /* See if the token after the `::' is one of the keywords in
8180 which we're interested. */
8182 /* If it's `new', we have a new-expression. */
8185 /* Similarly, for `delete'. */
8188 }
8190 /* Look for a unary operator. */
8192 /* The `++' and `--' operators can be handled similarly, even though
8193 they are not technically unary-operators in the grammar. */
8195 {
8200 /* Handle the GNU address-of-label extension. */
8203 {
8204 tree identifier;
8205 tree expression;
8208 /* Consume the '&&' token. */
8210 /* Look for the identifier. */
8211 location_t finish_loc
8214 /* Construct a location of the form:
8215 &&label
8216 ^~~~~~~
8217 with caret==start at the "&&", finish at the end of the label. */
8218 location_t combined_loc
8220 /* Create an expression representing the address. */
8223 NIC_ADDR_LABEL))
8226 }
8227 }
8229 {
8230 cp_expr cast_expression;
8236 /* Consume the operator token. */
8240 /* Parse the cast-expression. */
8241 cast_expression
8246 pidk);
8248 /* Make a location:
8249 OP_TOKEN CAST_EXPRESSION
8250 ^~~~~~~~~~~~~~~~~~~~~~~~~
8251 with start==caret at the operator token, and
8252 extending to the end of the cast_expression. */
8255 /* Now, build an appropriate representation. */
8257 {
8261 RO_UNARY_STAR,
8262 complain);
8263 /* TODO: build_x_indirect_ref does not always honor the
8264 location, so ensure it is set. */
8270 /* Fall through. */
8273 cast_expression,
8274 complain);
8275 /* TODO: build_x_unary_op does not always honor the location,
8276 so ensure it is set. */
8284 /* Fall through. */
8286 /* Immediately fold negation of a constant, unless the constant is 0
8287 (since -0 == 0) or it would overflow. */
8292 {
8295 cast_expression);
8297 {
8300 }
8301 }
8302 /* Fall through. */
8311 }
8315 non_constant_p))
8319 }
8323 decltype_p,
8324 pidk);
8325 }
8327 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8328 unary-operator, the corresponding tree code is returned. */
8330 static enum tree_code
8332 {
8334 {
8355 }
8356 }
8358 /* Parse a new-expression.
8360 new-expression:
8361 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8362 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8364 Returns a representation of the expression. */
8366 static tree
8368 {
8371 tree type;
8374 tree ret;
8378 /* Look for the optional `::' operator. */
8379 global_scope_p
8383 /* Look for the `new' operator. */
8385 /* There's no easy way to tell a new-placement from the
8386 `( type-id )' construct. */
8388 /* Look for a new-placement. */
8390 /* If that didn't work out, there's no new-placement. */
8392 {
8396 }
8398 /* If the next token is a `(', then we have a parenthesized
8399 type-id. */
8401 {
8405 /* Consume the `('. */
8406 matching_parens parens;
8409 /* Parse the type-id. */
8410 parser->type_definition_forbidden_message
8412 {
8415 }
8418 /* Look for the closing `)'. */
8421 /* There should not be a direct-new-declarator in this production,
8422 but GCC used to allowed this, so we check and emit a sensible error
8423 message for this case. */
8425 {
8431 }
8432 }
8433 /* Otherwise, there must be a new-type-id. */
8434 else
8437 /* If the next token is a `(' or '{', then we have a new-initializer. */
8442 else
8445 /* A new-expression may not appear in an integral constant
8446 expression. */
8449 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8450 of a new-type-id or type-id of a new-expression, the new-expression shall
8451 contain a new-initializer of the form ( assignment-expression )".
8452 Additionally, consistently with the spirit of DR 1467, we want to accept
8453 'new auto { 2 }' too. */
8459 {
8461 "initialization of new-expression for type %<auto%> "
8464 }
8465 else
8466 {
8467 /* Construct a location e.g.:
8468 ptr = new int[100]
8469 ^~~~~~~~~~~~
8470 with caret == start at the start of the "new" token, and the end
8471 at the end of the final token we consumed. */
8476 /* Create a representation of the new-expression. */
8478 tf_warning_or_error);
8480 }
8488 }
8490 /* Parse a new-placement.
8492 new-placement:
8493 ( expression-list )
8495 Returns the same representation as for an expression-list. */
8499 {
8502 /* Parse the expression-list. */
8503 expression_list = (cp_parser_parenthesized_expression_list
8512 }
8514 /* Parse a new-type-id.
8516 new-type-id:
8517 type-specifier-seq new-declarator [opt]
8519 Returns the TYPE allocated. If the new-type-id indicates an array
8520 type, *NELTS is set to the number of elements in the last array
8521 bound; the TYPE will not include the last array bound. */
8523 static tree
8525 {
8526 cp_decl_specifier_seq type_specifier_seq;
8532 /* The type-specifier sequence must not contain type definitions.
8533 (It cannot contain declarations of new types either, but if they
8534 are not definitions we will catch that because they are not
8535 complete.) */
8537 parser->type_definition_forbidden_message
8539 /* Parse the type-specifier-seq. */
8543 /* Restore the old message. */
8549 /* Parse the new-declarator. */
8552 /* Determine the number of elements in the last array dimension, if
8553 any. */
8555 /* Skip down to the last array dimension. */
8560 {
8563 }
8568 {
8571 }
8574 {
8581 else
8583 }
8586 }
8588 /* Parse an (optional) new-declarator.
8590 new-declarator:
8591 ptr-operator new-declarator [opt]
8592 direct-new-declarator
8594 Returns the declarator. */
8598 {
8601 cp_cv_quals cv_quals;
8603 /* We don't know if there's a ptr-operator next, or not. */
8605 /* Look for a ptr-operator. */
8607 /* If that worked, look for more new-declarators. */
8609 {
8612 /* Parse another optional declarator. */
8615 declarator = cp_parser_make_indirect_declarator
8619 }
8621 /* If the next token is a `[', there is a direct-new-declarator. */
8626 }
8628 /* Parse a direct-new-declarator.
8630 direct-new-declarator:
8631 [ expression ]
8632 direct-new-declarator [constant-expression]
8634 */
8638 {
8642 {
8643 tree expression;
8646 /* Look for the opening `['. */
8651 /* The standard requires that the expression have integral
8652 type. DR 74 adds enumeration types. We believe that the
8653 real intent is that these expressions be handled like the
8654 expression in a `switch' condition, which also allows
8655 classes with a single conversion to integral or
8656 enumeration type. */
8658 {
8659 expression
8661 expression,
8664 {
8666 "expression in new-declarator must have integral "
8669 }
8670 }
8672 /* Look for the closing `]'. */
8675 /* Add this bound to the declarator. */
8678 /* If the next token is not a `[', then there are no more
8679 bounds. */
8682 }
8685 }
8687 /* Parse a new-initializer.
8689 new-initializer:
8690 ( expression-list [opt] )
8691 braced-init-list
8693 Returns a representation of the expression-list. */
8697 {
8701 {
8702 tree t;
8709 }
8710 else
8711 expression_list = (cp_parser_parenthesized_expression_list
8717 }
8719 /* Parse a delete-expression.
8721 delete-expression:
8722 :: [opt] delete cast-expression
8723 :: [opt] delete [ ] cast-expression
8725 Returns a representation of the expression. */
8727 static tree
8729 {
8732 tree expression;
8734 /* Look for the optional `::' operator. */
8735 global_scope_p
8739 /* Look for the `delete' keyword. */
8741 /* See if the array syntax is in use. */
8743 {
8744 /* Consume the `[' token. */
8746 /* Look for the `]' token. */
8748 /* Remember that this is the `[]' construct. */
8750 }
8751 else
8754 /* Parse the cast-expression. */
8757 /* A delete-expression may not appear in an integral constant
8758 expression. */
8763 tf_warning_or_error);
8764 }
8766 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8767 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8768 0 otherwise. */
8770 static int
8772 {
8775 {
8817 /* In ((type ()) () the last () isn't a valid cast-expression,
8818 so the whole must be parsed as postfix-expression. */
8823 /* '[' may start a primary-expression in obj-c++ and in C++11,
8824 as a lambda-expression, eg, '(void)[]{}'. */
8831 /* '++' and '--' may or may not start a cast-expression:
8833 struct T { void operator++(int); };
8834 void f() { (T())++; }
8836 vs
8838 int a;
8839 (int)++a; */
8844 }
8845 }
8847 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8848 in the order: const_cast, static_cast, reinterpret_cast.
8850 Don't suggest dynamic_cast.
8852 Return the first legal cast kind found, or NULL otherwise. */
8856 {
8857 tree trial;
8859 /* Reuse the parser logic by attempting to build the various kinds of
8860 cast, with "complain" disabled.
8861 Identify the first such cast that is valid. */
8863 /* Don't attempt to run such logic within template processing. */
8867 /* First try const_cast. */
8872 /* If that fails, try static_cast. */
8877 /* Finally, try reinterpret_cast. */
8882 /* No such cast possible. */
8884 }
8886 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8887 suggesting how to convert a C-style cast of the form:
8889 (DST_TYPE)ORIG_EXPR
8891 to a C++-style cast.
8893 The primary range of RICHLOC is asssumed to be that of the original
8894 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8895 of the parens in the C-style cast. */
8897 static void
8900 tree dst_type)
8901 {
8902 /* This function is non-trivial, so bail out now if the warning isn't
8903 going to be emitted. */
8907 /* Try to find a legal C++ cast, trying them in order:
8908 const_cast, static_cast, reinterpret_cast. */
8913 /* Replace the open paren with "CAST_SUGGESTION<". */
8914 pretty_printer pp;
8918 /* Replace the close paren with "> (". */
8921 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8923 }
8926 /* Parse a cast-expression.
8928 cast-expression:
8929 unary-expression
8930 ( type-id ) cast-expression
8932 ADDRESS_P is true iff the unary-expression is appearing as the
8933 operand of the `&' operator. CAST_P is true if this expression is
8934 the target of a cast.
8936 Returns a representation of the expression. */
8938 static cp_expr
8941 {
8942 /* If it's a `(', then we might be looking at a cast. */
8944 {
8950 /* There's no way to know yet whether or not this is a cast.
8951 For example, `(int (3))' is a unary-expression, while `(int)
8952 3' is a cast. So, we resort to parsing tentatively. */
8954 /* Types may not be defined in a cast. */
8956 parser->type_definition_forbidden_message
8958 /* Consume the `('. */
8959 matching_parens parens;
8964 /* A very tricky bit is that `(struct S) { 3 }' is a
8965 compound-literal (which we permit in C++ as an extension).
8966 But, that construct is not a cast-expression -- it is a
8967 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8968 is legal; if the compound-literal were a cast-expression,
8969 you'd need an extra set of parentheses.) But, if we parse
8970 the type-id, and it happens to be a class-specifier, then we
8971 will commit to the parse at that point, because we cannot
8972 undo the action that is done when creating a new class. So,
8973 then we cannot back up and do a postfix-expression.
8975 Another tricky case is the following (c++/29234):
8977 struct S { void operator () (); };
8979 void foo ()
8980 {
8981 ( S()() );
8982 }
8984 As a type-id we parse the parenthesized S()() as a function
8985 returning a function, groktypename complains and we cannot
8986 back up in this case either.
8988 Therefore, we scan ahead to the closing `)', and check to see
8989 if the tokens after the `)' can start a cast-expression. Otherwise
8990 we are dealing with an unary-expression, a postfix-expression
8991 or something else.
8993 Yet another tricky case, in C++11, is the following (c++/54891):
8995 (void)[]{};
8997 The issue is that usually, besides the case of lambda-expressions,
8998 the parenthesized type-id cannot be followed by '[', and, eg, we
8999 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9000 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9001 we don't commit, we try a cast-expression, then an unary-expression.
9003 Save tokens so that we can put them back. */
9006 /* We may be looking at a cast-expression. */
9009 cast_expression
9012 /* Roll back the tokens we skipped. */
9014 /* If we aren't looking at a cast-expression, simulate an error so
9015 that the call to cp_parser_error_occurred below returns true. */
9018 else
9019 {
9022 /* Look for the type-id. */
9024 /* Look for the closing `)'. */
9029 }
9031 /* Restore the saved message. */
9034 /* At this point this can only be either a cast or a
9035 parenthesized ctor such as `(T ())' that looks like a cast to
9036 function returning T. */
9038 {
9039 /* Only commit if the cast-expression doesn't start with
9040 '++', '--', or '[' in C++11. */
9048 pidk);
9051 {
9052 /* Warn about old-style casts, if so requested. */
9057 {
9063 }
9065 /* Only type conversions to integral or enumeration types
9066 can be used in constant-expressions. */
9069 NIC_CAST))
9072 /* Perform the cast. */
9073 /* Make a location:
9074 (TYPE) EXPR
9075 ^~~~~~~~~~~
9076 with start==caret at the open paren, extending to the
9077 end of "expr". */
9079 open_paren_loc,
9083 }
9084 }
9085 else
9087 }
9089 /* If we get here, then it's not a cast, so it must be a
9090 unary-expression. */
9093 }
9095 /* Parse a binary expression of the general form:
9097 pm-expression:
9098 cast-expression
9099 pm-expression .* cast-expression
9100 pm-expression ->* cast-expression
9102 multiplicative-expression:
9103 pm-expression
9104 multiplicative-expression * pm-expression
9105 multiplicative-expression / pm-expression
9106 multiplicative-expression % pm-expression
9108 additive-expression:
9109 multiplicative-expression
9110 additive-expression + multiplicative-expression
9111 additive-expression - multiplicative-expression
9113 shift-expression:
9114 additive-expression
9115 shift-expression << additive-expression
9116 shift-expression >> additive-expression
9118 relational-expression:
9119 shift-expression
9120 relational-expression < shift-expression
9121 relational-expression > shift-expression
9122 relational-expression <= shift-expression
9123 relational-expression >= shift-expression
9125 GNU Extension:
9127 relational-expression:
9128 relational-expression <? shift-expression
9129 relational-expression >? shift-expression
9131 equality-expression:
9132 relational-expression
9133 equality-expression == relational-expression
9134 equality-expression != relational-expression
9136 and-expression:
9137 equality-expression
9138 and-expression & equality-expression
9140 exclusive-or-expression:
9141 and-expression
9142 exclusive-or-expression ^ and-expression
9144 inclusive-or-expression:
9145 exclusive-or-expression
9146 inclusive-or-expression | exclusive-or-expression
9148 logical-and-expression:
9149 inclusive-or-expression
9150 logical-and-expression && inclusive-or-expression
9152 logical-or-expression:
9153 logical-and-expression
9154 logical-or-expression || logical-and-expression
9156 All these are implemented with a single function like:
9158 binary-expression:
9159 simple-cast-expression
9160 binary-expression <token> binary-expression
9162 CAST_P is true if this expression is the target of a cast.
9164 The binops_by_token map is used to get the tree codes for each <token> type.
9165 binary-expressions are associated according to a precedence table. */
9167 #define TOKEN_PRECEDENCE(token) \
9168 (((token->type == CPP_GREATER \
9169 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9170 && !parser->greater_than_is_operator_p) \
9171 ? PREC_NOT_OPERATOR \
9172 : binops_by_token[token->type].prec)
9174 static cp_expr
9180 {
9181 cp_parser_expression_stack stack;
9183 cp_parser_expression_stack_entry current;
9184 cp_expr rhs;
9188 tree overload;
9190 /* Parse the first expression. */
9201 {
9202 /* Get an operator token. */
9208 {
9210 "%<>>%> operator is treated"
9214 }
9219 /* This is a fold-expression; handle it later. */
9222 /* Popping an entry off the stack means we completed a subexpression:
9223 - either we found a token which is not an operator (`>' where it is not
9224 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9225 will happen repeatedly;
9226 - or, we found an operator which has lower priority. This is the case
9227 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9228 parsing `3 * 4'. */
9230 {
9233 else
9235 }
9237 get_rhs:
9241 /* We used the operator token. */
9244 /* For "false && x" or "true || x", x will never be executed;
9245 disable warnings while evaluating it. */
9247 c_inhibit_evaluation_warnings +=
9250 c_inhibit_evaluation_warnings +=
9253 /* Extract another operand. It may be the RHS of this expression
9254 or the LHS of a new, higher priority expression. */
9259 /* Get another operator token. Look up its precedence to avoid
9260 building a useless (immediately popped) stack entry for common
9261 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9268 {
9269 /* ... and prepare to parse the RHS of the new, higher priority
9270 expression. Since precedence levels on the stack are
9271 monotonically increasing, we do not have to care about
9272 stack overflows. */
9281 pop:
9283 /* If the stack is not empty, we have parsed into LHS the right side
9284 (`4' in the example above) of an expression we had suspended.
9285 We can use the information on the stack to recover the LHS (`3')
9286 from the stack together with the tree code (`MULT_EXPR'), and
9287 the precedence of the higher level subexpression
9288 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9289 which will be used to actually build the additive expression. */
9294 }
9296 /* Undo the disabling of warnings done above. */
9298 c_inhibit_evaluation_warnings -=
9301 c_inhibit_evaluation_warnings -=
9307 /* Avoid warning for !!x == y. */
9312 /* Avoid warning for !b == y where b is boolean. */
9316 /* Avoid warning for !!b == y where b is boolean. */
9329 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9330 ERROR_MARK for everything that is not a binary expression.
9331 This makes warn_about_parentheses miss some warnings that
9332 involve unary operators. For unary expressions we should
9333 pass the correct tree_code unless the unary expression was
9334 surrounded by parentheses.
9335 */
9339 {
9342 else
9343 {
9344 current.lhs
9347 == tcc_comparison
9351 }
9352 }
9353 else
9354 {
9359 /* TODO: build_x_binary_op doesn't always honor the location. */
9361 }
9364 /* If the binary operator required the use of an overloaded operator,
9365 then this expression cannot be an integral constant-expression.
9366 An overloaded operator can be used even if both operands are
9367 otherwise permissible in an integral constant-expression if at
9368 least one of the operands is of enumeration type. */
9372 NIC_OVERLOADED))
9374 }
9377 }
9379 static cp_expr
9384 {
9387 }
9389 /* Parse the `? expression : assignment-expression' part of a
9390 conditional-expression. The LOGICAL_OR_EXPR is the
9391 logical-or-expression that started the conditional-expression.
9392 Returns a representation of the entire conditional-expression.
9394 This routine is used by cp_parser_assignment_expression.
9396 ? expression : assignment-expression
9398 GNU Extensions:
9400 ? : assignment-expression */
9402 static tree
9404 {
9406 cp_expr assignment_expr;
9410 /* Consume the `?' token. */
9415 {
9418 /* Implicit true clause. */
9420 c_inhibit_evaluation_warnings +=
9423 }
9424 else
9425 {
9428 /* Parse the expression. */
9429 c_inhibit_evaluation_warnings +=
9432 c_inhibit_evaluation_warnings +=
9436 }
9438 /* The next token should be a `:'. */
9440 /* Parse the assignment-expression. */
9442 c_inhibit_evaluation_warnings -=
9445 /* Make a location:
9446 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9447 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9448 with the caret at the "?", ranging from the start of
9449 the logical_or_expr to the end of the assignment_expr. */
9454 /* Build the conditional-expression. */
9456 expr,
9457 assignment_expr,
9458 tf_warning_or_error);
9459 }
9461 /* Parse an assignment-expression.
9463 assignment-expression:
9464 conditional-expression
9465 logical-or-expression assignment-operator assignment_expression
9466 throw-expression
9468 CAST_P is true if this expression is the target of a cast.
9469 DECLTYPE_P is true if this expression is the operand of decltype.
9471 Returns a representation for the expression. */
9473 static cp_expr
9476 {
9477 cp_expr expr;
9479 /* If the next token is the `throw' keyword, then we're looking at
9480 a throw-expression. */
9483 /* Otherwise, it must be that we are looking at a
9484 logical-or-expression. */
9485 else
9486 {
9487 /* Parse the binary expressions (logical-or-expression). */
9489 decltype_p,
9491 /* If the next token is a `?' then we're actually looking at a
9492 conditional-expression. */
9495 else
9496 {
9499 /* If it's an assignment-operator, we're using the second
9500 production. */
9501 enum tree_code assignment_operator
9504 {
9507 /* Parse the right-hand side of the assignment. */
9514 /* An assignment may not appear in a
9515 constant-expression. */
9517 NIC_ASSIGNMENT))
9519 /* Build the assignment expression. Its default
9520 location:
9521 LHS = RHS
9522 ~~~~^~~~~
9523 is the location of the '=' token as the
9524 caret, ranging from the start of the lhs to the
9525 end of the rhs. */
9530 assignment_operator,
9531 rhs,
9533 /* TODO: build_x_modify_expr doesn't honor the location,
9534 so we must set it here. */
9536 }
9537 }
9538 }
9541 }
9543 /* Parse an (optional) assignment-operator.
9545 assignment-operator: one of
9546 = *= /= %= += -= >>= <<= &= ^= |=
9548 GNU Extension:
9550 assignment-operator: one of
9551 <?= >?=
9553 If the next token is an assignment operator, the corresponding tree
9554 code is returned, and the token is consumed. For example, for
9555 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9556 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9557 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9558 operator, ERROR_MARK is returned. */
9560 static enum tree_code
9562 {
9566 /* Peek at the next token. */
9570 {
9616 /* Nothing else is an assignment operator. */
9618 }
9620 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9625 /* If it was an assignment operator, consume it. */
9630 }
9632 /* Parse an expression.
9634 expression:
9635 assignment-expression
9636 expression , assignment-expression
9638 CAST_P is true if this expression is the target of a cast.
9639 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9640 except possibly parenthesized or on the RHS of a comma (N3276).
9642 Returns a representation of the expression. */
9644 static cp_expr
9647 {
9652 {
9653 cp_expr assignment_expression;
9655 /* Parse the next assignment-expression. */
9656 assignment_expression
9659 /* We don't create a temporary for a call that is the immediate operand
9660 of decltype or on the RHS of a comma. But when we see a comma, we
9661 need to create a temporary for a call on the LHS. */
9666 assignment_expression
9670 /* If this is the first assignment-expression, we can just
9671 save it away. */
9674 else
9675 {
9676 /* Create a location with caret at the comma, ranging
9677 from the start of the LHS to the end of the RHS. */
9682 assignment_expression,
9685 }
9686 /* If the next token is not a comma, or we're in a fold-expression, then
9687 we are done with the expression. */
9691 /* Consume the `,'. */
9694 /* A comma operator cannot appear in a constant-expression. */
9697 }
9700 }
9702 /* Parse a constant-expression.
9704 constant-expression:
9705 conditional-expression
9707 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9708 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9709 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9710 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9711 only parse a conditional-expression, otherwise parse an
9712 assignment-expression. See below for rationale. */
9714 static cp_expr
9719 {
9723 cp_expr expression;
9725 /* It might seem that we could simply parse the
9726 conditional-expression, and then check to see if it were
9727 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9728 one that the compiler can figure out is constant, possibly after
9729 doing some simplifications or optimizations. The standard has a
9730 precise definition of constant-expression, and we must honor
9731 that, even though it is somewhat more restrictive.
9733 For example:
9735 int i[(2, 3)];
9737 is not a legal declaration, because `(2, 3)' is not a
9738 constant-expression. The `,' operator is forbidden in a
9739 constant-expression. However, GCC's constant-folding machinery
9740 will fold this operation to an INTEGER_CST for `3'. */
9742 /* Save the old settings. */
9744 saved_allow_non_integral_constant_expression_p
9747 /* We are now parsing a constant-expression. */
9749 parser->allow_non_integral_constant_expression_p
9752 /* Although the grammar says "conditional-expression", when not STRICT_P,
9753 we parse an "assignment-expression", which also permits
9754 "throw-expression" and the use of assignment operators. In the case
9755 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9756 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9757 actually essential that we look for an assignment-expression.
9758 For example, cp_parser_initializer_clauses uses this function to
9759 determine whether a particular assignment-expression is in fact
9760 constant. */
9762 {
9763 /* Parse the binary expressions (logical-or-expression). */
9766 /* If the next token is a `?' then we're actually looking at
9767 a conditional-expression; otherwise we're done. */
9770 }
9771 else
9773 /* Restore the old settings. */
9774 parser->integral_constant_expression_p
9776 parser->allow_non_integral_constant_expression_p
9779 {
9780 /* Require an rvalue constant expression here; that's what our
9781 callers expect. Reference constant expressions are handled
9782 separately in e.g. cp_parser_template_argument. */
9791 }
9794 parser->non_integral_constant_expression_p
9798 }
9800 /* Parse __builtin_offsetof.
9802 offsetof-expression:
9803 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9805 offsetof-member-designator:
9806 id-expression
9807 | offsetof-member-designator "." id-expression
9808 | offsetof-member-designator "[" expression "]"
9809 | offsetof-member-designator "->" id-expression */
9811 static cp_expr
9813 {
9815 tree type;
9816 cp_expr expr;
9817 cp_id_kind dummy;
9819 location_t finish_loc;
9821 /* We're about to accept non-integral-constant things, but will
9822 definitely yield an integral constant expression. Save and
9823 restore these values around our local parsing. */
9829 /* Consume the "__builtin_offsetof" token. */
9831 /* Consume the opening `('. */
9832 matching_parens parens;
9834 /* Parse the type-id. */
9837 /* Look for the `,'. */
9841 /* Build the (type *)null that begins the traditional offsetof macro. */
9842 tree object_ptr
9844 tf_warning_or_error);
9846 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9850 {
9853 {
9855 /* offsetof-member-designator "[" expression "]" */
9861 /* offsetof-member-designator "->" identifier */
9864 /* FALLTHRU */
9867 /* offsetof-member-designator "." identifier */
9875 /* Consume the ")" token. */
9881 /* Error. We know the following require will fail, but
9882 that gives the proper error message. */
9887 }
9888 }
9890 success:
9891 /* Make a location of the form:
9892 __builtin_offsetof (struct s, f)
9893 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9894 with caret at the type-id, ranging from the start of the
9895 "_builtin_offsetof" token to the close paren. */
9897 /* The result will be an INTEGER_CST, so we need to explicitly
9898 preserve the location. */
9901 failure:
9907 }
9909 /* Parse a trait expression.
9911 Returns a representation of the expression, the underlying type
9912 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9914 static cp_expr
9916 {
9917 cp_trait_kind kind;
9923 {
10025 }
10027 /* Get location of initial token. */
10030 /* Consume the token. */
10033 matching_parens parens;
10036 {
10039 }
10045 {
10048 {
10051 }
10055 }
10057 {
10059 {
10063 {
10066 }
10070 }
10071 }
10076 /* Construct a location of the form:
10077 __is_trivially_copyable(_Tp)
10078 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10079 with start == caret, finishing at the close-paren. */
10082 /* Complete the trait expression, which may mean either processing
10083 the trait expr now or saving it for template instantiation. */
10085 {
10094 }
10095 }
10097 /* Parse a lambda expression.
10099 lambda-expression:
10100 lambda-introducer lambda-declarator [opt] compound-statement
10102 Returns a representation of the expression. */
10104 static cp_expr
10106 {
10108 tree type;
10116 {
10118 {
10122 }
10124 }
10126 {
10128 {
10131 }
10133 }
10135 /* We may be in the middle of deferred access check. Disable
10136 it now. */
10147 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10150 /* Now that we've started the type, add the capture fields for any
10151 explicit captures. */
10154 {
10155 /* Inside the class, surrounding template-parameter-lists do not apply. */
10156 unsigned int saved_num_template_parameter_lists
10160 bool fully_implicit_function_template_p
10164 bool auto_is_implicit_function_template_parm_p
10175 /* By virtue of defining a local class, a lambda expression has access to
10176 the private variables of enclosing classes. */
10184 {
10189 }
10191 {
10194 }
10196 /* The capture list was built up in reverse order; fix that now. */
10208 parser->fully_implicit_function_template_p
10212 parser->auto_is_implicit_function_template_parm_p
10214 }
10216 /* This field is only used during parsing of the lambda. */
10219 /* This lambda shouldn't have any proxies left at this point. */
10221 /* And now that we're done, push proxies for an enclosing lambda. */
10226 else
10234 }
10236 /* Parse the beginning of a lambda expression.
10238 lambda-introducer:
10239 [ lambda-capture [opt] ]
10241 LAMBDA_EXPR is the current representation of the lambda expression. */
10243 static void
10245 {
10246 /* Need commas after the first capture. */
10249 /* Eat the leading `['. */
10252 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10260 {
10263 }
10266 {
10268 tree capture_id;
10269 tree capture_init_expr;
10273 enum capture_kind_type
10274 {
10275 BY_COPY,
10276 BY_REFERENCE
10277 };
10281 {
10284 }
10288 else
10291 /* Possibly capture `this'. */
10293 {
10304 explicit_init_p);
10306 }
10308 /* Possibly capture `*this'. */
10311 {
10322 explicit_init_p);
10324 }
10326 /* Remember whether we want to capture as a reference or not. */
10328 {
10331 }
10333 /* Get the identifier. */
10338 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10339 delimiters, but I modified this to stop on unnested ']' as well. It
10340 was already changed to stop on unnested '}', so the
10341 "closing_parenthesis" name is no more misleading with my change. */
10342 {
10348 }
10350 /* Find the initializer for this capture. */
10354 {
10356 /* An explicit initializer exists. */
10359 "lambda capture initializers "
10365 {
10368 }
10369 }
10370 else
10371 {
10374 /* Turn the identifier into an id-expression. */
10375 capture_init_expr
10380 {
10383 }
10386 {
10389 capture_init_expr);
10394 }
10397 {
10400 capture_init_expr))
10404 }
10406 capture_init_expr
10407 = finish_id_expression
10409 capture_init_expr,
10423 {
10426 }
10427 }
10431 {
10436 capture_id);
10440 "capture of %qD redundant with by-reference capture "
10442 }
10445 capture_id,
10446 capture_init_expr,
10448 explicit_init_p);
10450 /* If there is any qualification still in effect, clear it
10451 now; we will be starting fresh with the next capture. */
10455 }
10458 }
10460 /* Parse the (optional) middle of a lambda expression.
10462 lambda-declarator:
10463 < template-parameter-list [opt] >
10464 ( parameter-declaration-clause [opt] )
10465 attribute-specifier [opt]
10466 decl-specifier-seq [opt]
10467 exception-specification [opt]
10468 lambda-return-type-clause [opt]
10470 LAMBDA_EXPR is the current representation of the lambda expression. */
10472 static bool
10474 {
10475 /* 5.1.1.4 of the standard says:
10476 If a lambda-expression does not include a lambda-declarator, it is as if
10477 the lambda-declarator were ().
10478 This means an empty parameter list, no attributes, and no exception
10479 specification. */
10486 cp_decl_specifier_seq lambda_specs;
10489 /* The template-parameter-list is optional, but must begin with
10490 an opening angle if present. */
10492 {
10495 "lambda templates are only available with "
10499 "lambda templates are only available with "
10508 /* We just processed one more parameter list. */
10510 }
10512 /* The parameter-declaration-clause is optional (unless
10513 template-parameter-list was given), but must begin with an
10514 opening parenthesis if present. */
10516 {
10517 matching_parens parens;
10522 /* Parse parameters. */
10525 /* Default arguments shall not be specified in the
10526 parameter-declaration-clause of a lambda-declarator. */
10537 /* In the decl-specifier-seq of the lambda-declarator, each
10538 decl-specifier shall either be mutable or constexpr. */
10542 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10545 {
10550 }
10554 /* Parse optional exception specification. */
10557 /* Parse optional trailing return type. */
10559 {
10562 }
10564 /* The function parameters must be in scope all the way until after the
10565 trailing-return-type in case of decltype. */
10567 }
10571 /* Create the function call operator.
10573 Messing with declarators like this is no uglier than building up the
10574 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10575 other code. */
10576 {
10577 cp_decl_specifier_seq return_type_specs;
10579 tree fco;
10586 else
10587 /* Maybe we will deduce the return type later. */
10591 {
10595 else
10598 }
10607 VIRT_SPEC_UNSPECIFIED,
10608 REF_QUAL_NONE,
10609 tx_qual,
10610 exception_spec,
10616 declarator,
10617 attributes);
10619 {
10622 /* Give the object parameter a different name. */
10626 }
10628 {
10632 }
10641 }
10642 }
10644 /* Parse the body of a lambda expression, which is simply
10646 compound-statement
10648 but which requires special handling.
10649 LAMBDA_EXPR is the current representation of the lambda expression. */
10651 static void
10653 {
10660 else
10661 /* Still increment function_depth so that we don't GC in the
10662 middle of an expression. */
10667 /* Clear this in case we're in the middle of a default argument. */
10671 {
10675 matching_braces braces;
10678 {
10681 /* Originally C++11 required us to peek for 'return expr'; and
10682 process it specially here to deduce the return type. N3638
10683 removed the need for that. */
10691 }
10694 }
10701 else
10703 }
10705 /* Statements [gram.stmt.stmt] */
10707 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10709 static void
10711 {
10715 /* A concept is never expanded normally. */
10721 }
10723 /* Parse a statement.
10725 statement:
10726 labeled-statement
10727 expression-statement
10728 compound-statement
10729 selection-statement
10730 iteration-statement
10731 jump-statement
10732 declaration-statement
10733 try-block
10735 C++11:
10737 statement:
10738 labeled-statement
10739 attribute-specifier-seq (opt) expression-statement
10740 attribute-specifier-seq (opt) compound-statement
10741 attribute-specifier-seq (opt) selection-statement
10742 attribute-specifier-seq (opt) iteration-statement
10743 attribute-specifier-seq (opt) jump-statement
10744 declaration-statement
10745 attribute-specifier-seq (opt) try-block
10747 init-statement:
10748 expression-statement
10749 simple-declaration
10751 TM Extension:
10753 statement:
10754 atomic-statement
10756 IN_COMPOUND is true when the statement is nested inside a
10757 cp_parser_compound_statement; this matters for certain pragmas.
10759 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10760 is a (possibly labeled) if statement which is not enclosed in braces
10761 and has an else clause. This is used to implement -Wparentheses.
10763 CHAIN is a vector of if-else-if conditions. */
10765 static void
10769 {
10774 restart:
10777 /* There is no statement yet. */
10783 /* In obj-c++, seeing '[[' might be the either the beginning of
10784 c++11 attributes, or a nested objc-message-expression. So
10785 let's parse the c++11 attributes tentatively. */
10789 {
10792 }
10794 /* Peek at the next token. */
10796 /* Remember the location of the first token in the statement. */
10799 /* If this is a keyword, then that will often determine what kind of
10800 statement we have. */
10802 {
10806 {
10809 /* Looks like a labeled-statement with a case label.
10810 Parse the label, and then use tail recursion to parse
10811 the statement. */
10834 /* Objective-C++ exception-handling constructs. */
10848 /* This must be a namespace alias definition. */
10864 /* It might be a keyword like `int' that can start a
10865 declaration-statement. */
10867 }
10868 }
10870 {
10871 /* If the next token is a `:', then we are looking at a
10872 labeled-statement. */
10875 {
10876 /* Looks like a labeled-statement with an ordinary label.
10877 Parse the label, and then use tail recursion to parse
10878 the statement. */
10883 }
10884 }
10885 /* Anything that starts with a `{' must be a compound-statement. */
10888 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10889 a statement all its own. */
10891 {
10892 /* Only certain OpenMP pragmas are attached to statements, and thus
10893 are considered statements themselves. All others are not. In
10894 the context of a compound, accept the pragma as a "statement" and
10895 return so that we can check for a close brace. Otherwise we
10896 require a real statement and must go back and read one. */
10902 }
10904 {
10907 }
10909 /* Everything else must be a declaration-statement or an
10910 expression-statement. Try for the declaration-statement
10911 first, unless we are looking at a `;', in which case we know that
10912 we have an expression-statement. */
10914 {
10916 {
10918 {
10919 /* Attributes should be parsed as part of the the
10920 declaration, so let's un-parse them. */
10923 }
10926 /* Try to parse the declaration-statement. */
10928 /* If that worked, we're done. */
10931 }
10932 /* All preceding labels have been parsed at this point. */
10936 /* Look for an expression-statement instead. */
10939 /* Handle [[fallthrough]];. */
10941 {
10942 /* The next token after the fallthrough attribute is ';'. */
10944 {
10945 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10947 IFN_FALLTHROUGH,
10950 }
10951 else
10955 }
10956 }
10958 /* Set the line number for the statement. */
10962 /* Allow "[[fallthrough]];", but warn otherwise. */
10965 OPT_Wattributes,
10967 }
10969 /* Append ATTR to attribute list ATTRS. */
10971 static tree
10973 {
10979 }
10981 /* Parse the label for a labeled-statement, i.e.
10983 identifier :
10984 case constant-expression :
10985 default :
10987 GNU Extension:
10988 case constant-expression ... constant-expression : statement
10990 When a label is parsed without errors, the label is added to the
10991 parse tree by the finish_* functions, so this function doesn't
10992 have to return the label. */
10994 static void
10996 {
11001 /* The next token should be an identifier. */
11005 {
11008 }
11010 /* Remember whether this case or a user-defined label is allowed to fall
11011 through to. */
11016 {
11018 {
11022 /* Consume the `case' token. */
11024 /* Parse the constant-expression. */
11031 {
11032 /* Consume the `...' token. */
11038 /* We don't need to emit warnings here, as the common code
11039 will do this for us. */
11040 }
11041 else
11045 {
11049 }
11050 else
11053 expr);
11054 }
11058 /* Consume the `default' token. */
11062 {
11066 }
11067 else
11072 /* Anything else must be an ordinary label. */
11077 }
11079 /* Require the `:' token. */
11082 /* An ordinary label may optionally be followed by attributes.
11083 However, this is only permitted if the attributes are then
11084 followed by a semicolon. This is because, for backward
11085 compatibility, when parsing
11086 lab: __attribute__ ((unused)) int i;
11087 we want the attribute to attach to "i", not "lab". */
11090 {
11091 tree attrs;
11098 ;
11099 else
11101 }
11107 }
11109 /* Parse an expression-statement.
11111 expression-statement:
11112 expression [opt] ;
11114 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11115 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11116 indicates whether this expression-statement is part of an
11117 expression statement. */
11119 static tree
11121 {
11126 /* There might be attribute fallthrough. */
11129 /* If the next token is a ';', then there is no expression
11130 statement. */
11132 {
11136 {
11139 }
11140 }
11142 /* Handle [[fallthrough]];. */
11144 {
11145 /* The next token after the fallthrough attribute is ';'. */
11147 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11150 else
11154 }
11156 /* Allow "[[fallthrough]];", but warn otherwise. */
11161 /* Give a helpful message for "A<T>::type t;" and the like. */
11164 {
11171 {
11172 /* A::A a; */
11177 }
11178 }
11180 /* Consume the final `;'. */
11185 /* This is the final expression statement of a statement
11186 expression. */
11192 }
11194 /* Parse a compound-statement.
11196 compound-statement:
11197 { statement-seq [opt] }
11199 GNU extension:
11201 compound-statement:
11202 { label-declaration-seq [opt] statement-seq [opt] }
11204 label-declaration-seq:
11205 label-declaration
11206 label-declaration-seq label-declaration
11208 Returns a tree representing the statement. */
11210 static tree
11213 {
11214 tree compound_stmt;
11215 matching_braces braces;
11217 /* Consume the `{'. */
11224 /* Begin the compound-statement. */
11226 /* If the next keyword is `__label__' we have a label declaration. */
11229 /* Parse an (optional) statement-seq. */
11231 /* Finish the compound-statement. */
11233 /* Consume the `}'. */
11237 }
11239 /* Parse an (optional) statement-seq.
11241 statement-seq:
11242 statement
11243 statement-seq [opt] statement */
11245 static void
11247 {
11248 /* Scan statements until there aren't any more. */
11250 {
11253 /* If we are looking at a `}', then we have run out of
11254 statements; the same is true if we have reached the end
11255 of file, or have stumbled upon a stray '@end'. */
11262 /* If we are in a compound statement and find 'else' then
11263 something went wrong. */
11265 {
11268 else
11269 {
11272 }
11273 }
11275 /* Parse the statement. */
11277 }
11278 }
11280 /* Return true if we're looking at (init; cond), false otherwise. */
11282 static bool
11284 {
11285 /* Save tokens so that we can put them back. */
11288 /* Look for ';' that is not nested in () or {}. */
11291 CPP_SEMICOLON,
11294 /* Roll back the tokens we skipped. */
11298 }
11300 /* Parse a selection-statement.
11302 selection-statement:
11303 if ( init-statement [opt] condition ) statement
11304 if ( init-statement [opt] condition ) statement else statement
11305 switch ( init-statement [opt] condition ) statement
11307 Returns the new IF_STMT or SWITCH_STMT.
11309 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11310 is a (possibly labeled) if statement which is not enclosed in
11311 braces and has an else clause. This is used to implement
11312 -Wparentheses.
11314 CHAIN is a vector of if-else-if conditions. This is used to implement
11315 -Wduplicated-cond. */
11317 static tree
11320 {
11323 token_indent_info guard_tinfo;
11328 /* Peek at the next token. */
11332 /* See what kind of keyword it is. */
11335 {
11338 {
11339 tree statement;
11340 tree condition;
11345 RID_CONSTEXPR))
11346 {
11352 }
11354 /* Look for the `('. */
11355 matching_parens parens;
11357 {
11360 }
11362 /* Begin the selection-statement. */
11364 {
11367 }
11368 else
11371 /* Parse the optional init-statement. */
11373 {
11374 tree decl;
11377 "init-statement in selection statements only available "
11380 }
11382 /* Parse the condition. */
11384 /* Look for the `)'. */
11390 {
11394 /* Add the condition. */
11401 /* Parse the then-clause. */
11405 /* Outside a template, the non-selected branch of a constexpr
11406 if is a 'discarded statement', i.e. unevaluated. */
11411 {
11414 }
11417 guard_tinfo);
11424 {
11428 }
11430 /* If the next token is `else', parse the else-clause. */
11432 RID_ELSE))
11433 {
11437 {
11440 }
11442 guard_tinfo
11444 /* Consume the `else' keyword. */
11447 {
11449 RID_IF)
11451 {
11452 /* We've got "if (COND) else if (COND2)". Start
11453 the condition chain and add COND as the first
11454 element. */
11458 {
11459 /* Wrap it in a NOP_EXPR so that we can set the
11460 location of the condition. */
11462 condition);
11465 }
11466 }
11468 RID_IF))
11469 {
11470 /* This is if-else without subsequent if. Zap the
11471 condition chain; we would have already warned at
11472 this point. */
11475 }
11476 }
11478 /* Parse the else-clause. */
11484 /* If we are currently parsing a then-clause, then
11485 IF_P will not be NULL. We set it to true to
11486 indicate that this if statement has an else clause.
11487 This may trigger the Wparentheses warning below
11488 when we get back up to the parent if statement. */
11493 {
11497 }
11498 }
11499 else
11500 {
11501 /* This if statement does not have an else clause. If
11502 NESTED_IF is true, then the then-clause has an if
11503 statement which does have an else clause. We warn
11504 about the potential ambiguity. */
11507 "suggest explicit braces to avoid ambiguous"
11510 {
11511 /* We don't need the condition chain anymore. */
11514 }
11515 }
11517 /* Now we're all done with the if-statement. */
11519 }
11520 else
11521 {
11525 /* Add the condition. */
11528 /* Parse the body of the switch-statement. */
11534 guard_tinfo);
11538 /* Now we're all done with the switch-statement. */
11540 }
11543 }
11549 }
11550 }
11552 /* Parse a condition.
11554 condition:
11555 expression
11556 type-specifier-seq declarator = initializer-clause
11557 type-specifier-seq declarator braced-init-list
11559 GNU Extension:
11561 condition:
11562 type-specifier-seq declarator asm-specification [opt]
11563 attributes [opt] = assignment-expression
11565 Returns the expression that should be tested. */
11567 static tree
11569 {
11570 cp_decl_specifier_seq type_specifiers;
11574 /* Try the declaration first. */
11576 /* New types are not allowed in the type-specifier-seq for a
11577 condition. */
11579 parser->type_definition_forbidden_message
11581 /* Parse the type-specifier-seq. */
11583 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11586 /* Restore the saved message. */
11588 /* If all is well, we might be looking at a declaration. */
11590 {
11591 tree decl;
11592 tree asm_specification;
11593 tree attributes;
11597 /* Parse the declarator. */
11603 /* Parse the attributes. */
11605 /* Parse the asm-specification. */
11607 /* If the next token is not an `=' or '{', then we might still be
11608 looking at an expression. For example:
11610 if (A(a).x)
11612 looks like a decl-specifier-seq and a declarator -- but then
11613 there is no `=', so this is an expression. */
11618 /* If we did see an `=' or '{', then we are looking at a declaration
11619 for sure. */
11621 {
11622 tree pushed_scope;
11626 /* Create the declaration. */
11632 /* Parse the initializer. */
11634 {
11638 }
11639 else
11640 {
11641 /* Consume the `='. */
11644 }
11648 /* Process the initializer. */
11651 asm_specification,
11652 flags);
11658 }
11659 }
11660 /* If we didn't even get past the declarator successfully, we are
11661 definitely not looking at a declaration. */
11662 else
11665 /* Otherwise, we are looking at an expression. */
11667 }
11669 /* Parses a for-statement or range-for-statement until the closing ')',
11670 not included. */
11672 static tree
11674 {
11678 /* Begin the for-statement. */
11681 /* Parse the initialization. */
11686 else
11688 }
11690 static tree
11693 {
11694 /* Normal for loop */
11697 tree stmt;
11700 /* The init-statement has already been parsed in
11701 cp_parser_init_statement, so no work is needed here. */
11704 /* If there's a condition, process it. */
11708 {
11712 }
11714 {
11718 }
11720 /* Look for the `;'. */
11723 /* If there's an expression, process it. */
11729 }
11731 /* Tries to parse a range-based for-statement:
11733 range-based-for:
11734 decl-specifier-seq declarator : expression
11736 The decl-specifier-seq declarator and the `:' are already parsed by
11737 cp_parser_init_statement. If processing_template_decl it returns a
11738 newly created RANGE_FOR_STMT; if not, it is converted to a
11739 regular FOR_STMT. */
11741 static tree
11744 {
11751 /* Get the range declaration momentarily out of the way so that
11752 the range expression doesn't clash with it. */
11754 {
11756 {
11758 /* For decomposition declaration get all of the corresponding
11759 declarations out of the way. */
11763 {
11769 {
11775 }
11776 }
11777 }
11779 {
11784 }
11785 }
11788 {
11791 }
11792 else
11795 /* Put the range declaration(s) back into scope. */
11797 {
11801 }
11803 /* If in template, STMT is converted to a normal for-statement
11804 at instantiation. If not, it is done just ahead. */
11806 {
11816 /* do_auto_deduction doesn't mess with template init-lists. */
11819 }
11820 else
11821 {
11825 unroll);
11826 }
11828 }
11830 /* Subroutine of cp_convert_range_for: given the initializer expression,
11831 builds up the range temporary. */
11833 static tree
11835 {
11838 /* Find out the type deduced by the declaration
11839 `auto &&__range = range_expr'. */
11844 /* Create the __range variable. */
11851 }
11853 /* Used by cp_parser_range_for in template context: we aren't going to
11854 do a full conversion yet, but we still need to resolve auto in the
11855 type of the for-range-declaration if present. This is basically
11856 a shortcut version of cp_convert_range_for. */
11858 static void
11860 {
11863 {
11866 iter_type = (cp_parser_perform_range_for_lookup
11869 {
11871 iter_type);
11873 RO_UNARY_STAR,
11874 tf_warning_or_error);
11877 }
11878 }
11879 }
11881 /* Converts a range-based for-statement into a normal
11882 for-statement, as per the definition.
11884 for (RANGE_DECL : RANGE_EXPR)
11885 BLOCK
11887 should be equivalent to:
11889 {
11890 auto &&__range = RANGE_EXPR;
11891 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11892 __begin != __end;
11893 ++__begin)
11894 {
11895 RANGE_DECL = *__begin;
11896 BLOCK
11897 }
11898 }
11900 If RANGE_EXPR is an array:
11901 BEGIN_EXPR = __range
11902 END_EXPR = __range + ARRAY_SIZE(__range)
11903 Else if RANGE_EXPR has a member 'begin' or 'end':
11904 BEGIN_EXPR = __range.begin()
11905 END_EXPR = __range.end()
11906 Else:
11907 BEGIN_EXPR = begin(__range)
11908 END_EXPR = end(__range);
11910 If __range has a member 'begin' but not 'end', or vice versa, we must
11911 still use the second alternative (it will surely fail, however).
11912 When calling begin()/end() in the third alternative we must use
11913 argument dependent lookup, but always considering 'std' as an associated
11914 namespace. */
11916 tree
11920 {
11928 /* If an error happened previously do nothing or else a lot of
11929 unhelpful errors would be issued. */
11931 else
11932 {
11933 tree range_temp;
11937 /* Can't bind a reference to an array of runtime bound. */
11939 else
11940 {
11945 LOOKUP_ONLYCONVERTING);
11947 }
11950 }
11952 /* The new for initialization statement. */
11960 LOOKUP_ONLYCONVERTING);
11971 LOOKUP_ONLYCONVERTING);
11975 /* The new for condition. */
11982 /* The new increment expression. */
11985 tf_warning_or_error);
11991 /* The declaration is initialized with *__begin inside the loop body. */
11994 tf_warning_or_error),
11996 LOOKUP_ONLYCONVERTING);
12001 }
12003 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12004 We need to solve both at the same time because the method used
12005 depends on the existence of members begin or end.
12006 Returns the type deduced for the iterator expression. */
12008 static tree
12010 {
12012 {
12015 }
12018 {
12023 }
12025 {
12026 /* If RANGE is an array, we will use pointer arithmetic. */
12029 range,
12033 }
12034 else
12035 {
12036 /* If it is not an array, we must do a bit of magic. */
12046 tf_warning_or_error);
12049 tf_warning_or_error);
12052 {
12053 /* Use the member functions. */
12056 else
12062 else
12065 }
12066 else
12067 {
12068 /* Use global functions with ADL. */
12075 tf_warning_or_error);
12077 tf_warning_or_error);
12079 tf_warning_or_error);
12081 tf_warning_or_error);
12084 }
12086 /* Last common checks. */
12088 {
12089 /* If one of the expressions is an error do no more checks. */
12092 }
12095 /* Can happen, when, eg, in a template context, Koenig lookup
12096 can't resolve begin/end (c++/58503). */
12098 else
12099 {
12101 /* The unqualified type of the __begin and __end temporaries should
12102 be the same, as required by the multiple auto declaration. */
12104 {
12111 /* P0184R0 allows __begin and __end to have different types,
12112 but make sure they are comparable so we can give a better
12114 else
12118 }
12120 }
12121 }
12122 }
12124 /* Helper function for cp_parser_perform_range_for_lookup.
12125 Builds a tree for RANGE.IDENTIFIER(). */
12127 static tree
12129 {
12142 tf_warning_or_error);
12145 }
12147 /* Parse an iteration-statement.
12149 iteration-statement:
12150 while ( condition ) statement
12151 do statement while ( expression ) ;
12152 for ( init-statement condition [opt] ; expression [opt] )
12153 statement
12155 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12157 static tree
12160 {
12163 tree statement;
12165 token_indent_info guard_tinfo;
12167 /* Peek at the next token. */
12174 /* Remember whether or not we are already within an iteration
12175 statement. */
12178 /* See what kind of keyword it is. */
12181 {
12183 {
12184 tree condition;
12186 /* Begin the while-statement. */
12188 /* Look for the `('. */
12189 matching_parens parens;
12191 /* Parse the condition. */
12194 /* Look for the `)'. */
12196 /* Parse the dependent statement. */
12202 /* We're done with the while-statement. */
12204 }
12208 {
12209 tree expression;
12211 /* Begin the do-statement. */
12213 /* Parse the body of the do-statement. */
12220 /* Look for the `while' keyword. */
12222 /* Look for the `('. */
12223 matching_parens parens;
12225 /* Parse the expression. */
12227 /* We're done with the do-statement. */
12229 /* Look for the `)'. */
12231 /* Look for the `;'. */
12233 }
12237 {
12238 /* Look for the `('. */
12239 matching_parens parens;
12244 /* Look for the `)'. */
12247 /* Parse the body of the for-statement. */
12254 /* We're done with the for-statement. */
12256 }
12263 }
12266 }
12268 /* Parse a init-statement or the declarator of a range-based-for.
12269 Returns true if a range-based-for declaration is seen.
12271 init-statement:
12272 expression-statement
12273 simple-declaration */
12275 static bool
12277 {
12278 /* If the next token is a `;', then we have an empty
12279 expression-statement. Grammatically, this is also a
12280 simple-declaration, but an invalid one, because it does not
12281 declare anything. Therefore, if we did not handle this case
12282 specially, we would issue an error message about an invalid
12283 declaration. */
12285 {
12289 /* A colon is used in range-based for. */
12292 /* We're going to speculatively look for a declaration, falling back
12293 to an expression, if necessary. */
12295 /* Parse the declaration. */
12298 decl);
12301 {
12302 /* It is a range-for, consume the ':' */
12306 {
12308 "range-based %<for%> loops only available with "
12311 }
12312 }
12313 else
12314 /* The ';' is not consumed yet because we told
12315 cp_parser_simple_declaration not to. */
12320 /* If the tentative parse failed, then we shall need to look for an
12321 expression-statement. */
12322 }
12323 /* If we are here, it is an expression-statement. */
12326 }
12328 /* Parse a jump-statement.
12330 jump-statement:
12331 break ;
12332 continue ;
12333 return expression [opt] ;
12334 return braced-init-list ;
12335 goto identifier ;
12337 GNU extension:
12339 jump-statement:
12340 goto * expression ;
12342 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12344 static tree
12346 {
12352 /* Peek at the next token. */
12357 /* See what kind of keyword it is. */
12360 {
12364 {
12381 }
12387 {
12391 /* Fall through. */
12401 }
12406 {
12407 tree expr;
12411 {
12415 }
12418 else
12419 /* If the next token is a `;', then there is no
12420 expression. */
12422 /* Build the return-statement. */
12425 else
12427 /* Look for the final `;'. */
12429 }
12435 {
12438 }
12440 /* Create the goto-statement. */
12442 {
12443 /* Issue a warning about this use of a GNU extension. */
12445 /* Consume the '*' token. */
12447 /* Parse the dependent expression. */
12449 }
12450 else
12452 /* Look for the final `;'. */
12459 }
12462 }
12464 /* Parse a declaration-statement.
12466 declaration-statement:
12467 block-declaration */
12469 static void
12471 {
12474 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12477 /* Parse the block-declaration. */
12480 /* Free any declarators allocated. */
12482 }
12484 /* Some dependent statements (like `if (cond) statement'), are
12485 implicitly in their own scope. In other words, if the statement is
12486 a single statement (as opposed to a compound-statement), it is
12487 none-the-less treated as if it were enclosed in braces. Any
12488 declarations appearing in the dependent statement are out of scope
12489 after control passes that point. This function parses a statement,
12490 but ensures that is in its own scope, even if it is not a
12491 compound-statement.
12493 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12494 is a (possibly labeled) if statement which is not enclosed in
12495 braces and has an else clause. This is used to implement
12496 -Wparentheses.
12498 CHAIN is a vector of if-else-if conditions. This is used to implement
12499 -Wduplicated-cond.
12501 Returns the new statement. */
12503 static tree
12507 {
12508 tree statement;
12511 token_indent_info body_tinfo
12517 /* Mark if () ; with a special NOP_EXPR. */
12519 {
12530 }
12531 /* if a compound is opened, we simply parse the statement directly. */
12534 /* If the token is not a `{', then we must take special action. */
12535 else
12536 {
12537 /* Create a compound-statement. */
12539 /* Parse the dependent-statement. */
12542 /* Finish the dummy compound-statement. */
12544 }
12546 token_indent_info next_tinfo
12555 /* Return the statement. */
12557 }
12559 /* For some dependent statements (like `while (cond) statement'), we
12560 have already created a scope. Therefore, even if the dependent
12561 statement is a compound-statement, we do not want to create another
12562 scope. */
12564 static void
12567 {
12568 /* If the token is a `{', then we must take special action. */
12570 {
12571 token_indent_info body_tinfo
12577 token_indent_info next_tinfo
12586 }
12587 else
12588 {
12589 /* Avoid calling cp_parser_compound_statement, so that we
12590 don't create a new scope. Do everything else by hand. */
12591 matching_braces braces;
12593 /* If the next keyword is `__label__' we have a label declaration. */
12596 /* Parse an (optional) statement-seq. */
12599 }
12600 }
12602 /* Declarations [gram.dcl.dcl] */
12604 /* Parse an optional declaration-sequence.
12606 declaration-seq:
12607 declaration
12608 declaration-seq declaration */
12610 static void
12612 {
12614 {
12625 {
12626 /* A declaration consisting of a single semicolon is
12627 invalid. Allow it unless we're being pedantic. */
12632 }
12634 /* If we're entering or exiting a region that's implicitly
12635 extern "C", modify the lang context appropriately. */
12637 {
12640 }
12642 {
12645 }
12648 {
12649 /* A top-level declaration can consist solely of a #pragma.
12650 A nested declaration cannot, so this is done here and not
12651 in cp_parser_declaration. (A #pragma at block scope is
12652 handled in cp_parser_statement.) */
12655 }
12657 /* Parse the declaration itself. */
12659 }
12660 }
12662 /* Parse a declaration.
12664 declaration:
12665 block-declaration
12666 function-definition
12667 template-declaration
12668 explicit-instantiation
12669 explicit-specialization
12670 linkage-specification
12671 namespace-definition
12673 C++17:
12674 deduction-guide
12676 GNU extension:
12678 declaration:
12679 __extension__ declaration */
12681 static void
12683 {
12684 cp_token token1;
12685 cp_token token2;
12690 /* Check for the `__extension__' keyword. */
12692 {
12693 /* Parse the qualified declaration. */
12695 /* Restore the PEDANTIC flag. */
12699 }
12701 /* Try to figure out what kind of declaration is present. */
12706 else
12707 {
12710 }
12712 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12715 /* If the next token is `extern' and the following token is a string
12716 literal, then we have a linkage specification. */
12720 /* If the next token is `template', then we have either a template
12721 declaration, an explicit instantiation, or an explicit
12722 specialization. */
12724 {
12725 /* `template <>' indicates a template specialization. */
12729 /* `template <' indicates a template declaration. */
12732 /* Anything else must be an explicit instantiation. */
12733 else
12735 }
12736 /* If the next token is `export', then we have a template
12737 declaration. */
12740 /* If the next token is `extern', 'static' or 'inline' and the one
12741 after that is `template', we have a GNU extended explicit
12742 instantiation directive. */
12749 /* If the next token is `namespace', check for a named or unnamed
12750 namespace definition. */
12759 /* An unnamed namespace definition. */
12763 /* An inline (associated) namespace definition. */
12767 /* Objective-C++ declaration/definition. */
12774 /* At this point we may have a template declared by a concept
12775 introduction. */
12780 else
12781 /* Try to parse a block-declaration, or a function-definition. */
12784 /* Free any declarators allocated. */
12786 }
12788 /* Parse a block-declaration.
12790 block-declaration:
12791 simple-declaration
12792 asm-definition
12793 namespace-alias-definition
12794 using-declaration
12795 using-directive
12797 GNU Extension:
12799 block-declaration:
12800 __extension__ block-declaration
12802 C++0x Extension:
12804 block-declaration:
12805 static_assert-declaration
12807 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12808 part of a declaration-statement. */
12810 static void
12813 {
12817 /* Check for the `__extension__' keyword. */
12819 {
12820 /* Parse the qualified declaration. */
12822 /* Restore the PEDANTIC flag. */
12826 }
12828 /* Peek at the next token to figure out which kind of declaration is
12829 present. */
12832 /* If the next keyword is `asm', we have an asm-definition. */
12834 {
12838 }
12839 /* If the next keyword is `namespace', we have a
12840 namespace-alias-definition. */
12843 /* If the next keyword is `using', we have a
12844 using-declaration, a using-directive, or an alias-declaration. */
12846 {
12851 /* If the token after `using' is `namespace', then we have a
12852 using-directive. */
12856 /* If the second token after 'using' is '=', then we have an
12857 alias-declaration. */
12863 /* Otherwise, it's a using-declaration. */
12864 else
12867 }
12868 /* If the next keyword is `__label__' we have a misplaced label
12869 declaration. */
12871 {
12875 /* If the next token is now a `;', consume it. */
12878 }
12879 /* If the next token is `static_assert' we have a static assertion. */
12882 /* Anything else must be a simple-declaration. */
12883 else
12886 }
12888 /* Parse a simple-declaration.
12890 simple-declaration:
12891 decl-specifier-seq [opt] init-declarator-list [opt] ;
12892 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12893 brace-or-equal-initializer ;
12895 init-declarator-list:
12896 init-declarator
12897 init-declarator-list , init-declarator
12899 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12900 function-definition as a simple-declaration.
12902 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12903 parsed declaration if it is an uninitialized single declarator not followed
12904 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12905 if present, will not be consumed. */
12907 static void
12911 {
12912 cp_decl_specifier_seq decl_specifiers;
12921 /* Defer access checks until we know what is being declared; the
12922 checks for names appearing in the decl-specifier-seq should be
12923 done as if we were in the scope of the thing being declared. */
12926 /* Parse the decl-specifier-seq. We have to keep track of whether
12927 or not the decl-specifier-seq declares a named class or
12928 enumeration type, since that is the only case in which the
12929 init-declarator-list is allowed to be empty.
12931 [dcl.dcl]
12933 In a simple-declaration, the optional init-declarator-list can be
12934 omitted only when declaring a class or enumeration, that is when
12935 the decl-specifier-seq contains either a class-specifier, an
12936 elaborated-type-specifier, or an enum-specifier. */
12938 CP_PARSER_FLAGS_OPTIONAL,
12941 /* We no longer need to defer access checks. */
12944 /* In a block scope, a valid declaration must always have a
12945 decl-specifier-seq. By not trying to parse declarators, we can
12946 resolve the declaration/expression ambiguity more quickly. */
12949 {
12952 }
12954 /* If the next two tokens are both identifiers, the code is
12955 erroneous. The usual cause of this situation is code like:
12957 T t;
12959 where "T" should name a type -- but does not. */
12962 {
12963 /* If parsing tentatively, we should commit; we really are
12964 looking at a declaration. */
12966 /* Give up. */
12968 }
12970 /* If we have seen at least one decl-specifier, and the next token
12971 is not a parenthesis, then we must be looking at a declaration.
12972 (After "int (" we might be looking at a functional cast.) */
12979 /* Look for C++17 decomposition declaration. */
12987 {
12988 tree decl
12990 maybe_range_for_decl,
12993 /* The next token should be either a `,' or a `;'. */
12995 /* If it's a `;', we are done. */
12998 /* Anything else is an error. */
12999 else
13000 {
13001 /* If we have already issued an error message we don't need
13002 to issue another one. */
13007 /* Skip tokens until we reach the end of the statement. */
13009 /* If the next token is now a `;', consume it. */
13013 }
13014 }
13015 else
13018 tree last_type;
13020 /* NULL_TREE if both variable and function declaration are allowed,
13021 error_mark_node if function declaration are not allowed and
13022 a FUNCTION_DECL that should be diagnosed if it is followed by
13023 variable declarations. */
13024 tree auto_function_declaration;
13027 auto_specifier_p
13031 /* Keep going until we hit the `;' at the end of the simple
13032 declaration. */
13035 CPP_SEMICOLON))
13036 {
13039 tree decl;
13043 {
13044 /* If we are processing next declarator, comma is expected */
13049 {
13053 }
13054 }
13055 else
13058 /* Parse the init-declarator. */
13061 function_definition_allowed_p,
13063 declares_class_or_enum,
13065 maybe_range_for_decl,
13068 /* If an error occurred while parsing tentatively, exit quickly.
13069 (That usually happens when in the body of a function; each
13070 statement is treated as a declaration-statement until proven
13071 otherwise.) */
13076 {
13077 /* If the init-declarator-list contains more than one
13078 init-declarator, they shall all form declarations of
13079 variables. */
13081 auto_function_declaration
13085 {
13087 "non-variable %qD in declaration with more than one "
13092 }
13093 }
13097 {
13101 {
13102 /* If the list of declarators contains more than one declarator,
13103 the type of each declared variable is determined as described
13104 above. If the type deduced for the template parameter U is not
13105 the same in each deduction, the program is ill-formed. */
13110 }
13111 else
13113 }
13115 /* Handle function definitions specially. */
13117 {
13118 /* If the next token is a `,', then we are probably
13119 processing something like:
13121 void f() {}, *p;
13123 which is erroneous. */
13125 {
13128 "mixing"
13130 }
13131 /* Otherwise, we're done with the list of declarators. */
13132 else
13133 {
13136 }
13137 }
13140 /* The next token should be either a `,' or a `;'. */
13142 /* If it's a `,', there are more declarators to come. */
13145 /* If it's a `;', we are done. */
13149 {
13154 }
13155 /* Anything else is an error. */
13156 else
13157 {
13158 /* If we have already issued an error message we don't need
13159 to issue another one. */
13164 /* Skip tokens until we reach the end of the statement. */
13166 /* If the next token is now a `;', consume it. */
13170 }
13171 /* After the first time around, a function-definition is not
13172 allowed -- even if it was OK at first. For example:
13174 int i, f() {}
13176 is not valid. */
13178 }
13180 /* Issue an error message if no declarators are present, and the
13181 decl-specifier-seq does not itself declare a class or
13182 enumeration: [dcl.dcl]/3. */
13184 {
13186 {
13190 /* Ensure an error is issued anyway when finish_decltype_type,
13191 called via cp_parser_decl_specifier_seq, returns a class or
13192 an enumeration (c++/51786). */
13195 }
13196 /* Perform any deferred access checks. */
13198 }
13200 /* Consume the `;'. */
13201 finish:
13205 {
13211 }
13213 done:
13215 }
13217 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13218 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13219 initializer ; */
13221 static tree
13226 {
13231 /* Parse the identifier-list. */
13235 {
13243 }
13247 {
13253 else
13254 {
13257 }
13258 }
13264 tree pushed_scope;
13271 NULL_TREE);
13278 cp_expr e;
13279 cp_decl_specifier_seq decl_specs;
13284 {
13287 else
13290 tree elt_pushed_scope;
13296 {
13297 /* Ensure we've diagnosed redeclaration if we aren't creating
13298 a new VAR_DECL. */
13301 }
13302 else
13306 }
13309 {
13312 }
13316 {
13324 || (is_direct_init
13327 {
13331 }
13334 {
13339 }
13340 }
13342 {
13344 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13345 the underlying DECL. */
13347 }
13353 {
13356 }
13359 }
13361 /* Parse a decl-specifier-seq.
13363 decl-specifier-seq:
13364 decl-specifier-seq [opt] decl-specifier
13365 decl-specifier attribute-specifier-seq [opt] (C++11)
13367 decl-specifier:
13368 storage-class-specifier
13369 type-specifier
13370 function-specifier
13371 friend
13372 typedef
13374 GNU Extension:
13376 decl-specifier:
13377 attributes
13379 Concepts Extension:
13381 decl-specifier:
13382 concept
13384 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13386 The parser flags FLAGS is used to control type-specifier parsing.
13388 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13389 flags:
13391 1: one of the decl-specifiers is an elaborated-type-specifier
13392 (i.e., a type declaration)
13393 2: one of the decl-specifiers is an enum-specifier or a
13394 class-specifier (i.e., a type definition)
13396 */
13398 static void
13400 cp_parser_flags flags,
13403 {
13407 cp_decl_spec ds;
13409 /* Clear DECL_SPECS. */
13412 /* Assume no class or enumeration type is declared. */
13415 /* Keep reading specifiers until there are no more to read. */
13417 {
13422 /* Peek at the next token. */
13425 /* Save the first token of the decl spec list for error
13426 reporting. */
13429 /* Handle attributes. */
13431 {
13432 /* Parse the attributes. */
13435 /* In a sequence of declaration specifiers, c++11 attributes
13436 appertain to the type that precede them. In that case
13437 [dcl.spec]/1 says:
13439 The attribute-specifier-seq affects the type only for
13440 the declaration it appears in, not other declarations
13441 involving the same type.
13443 But for now let's force the user to position the
13444 attribute either at the beginning of the declaration or
13445 after the declarator-id, which would clearly mean that it
13446 applies to the declarator. */
13448 {
13450 /* The c++11 attribute is at the beginning of the
13451 declaration. It appertains to the entity being
13453 else
13454 {
13456 {
13457 /* This is an attribute following a
13458 class-specifier. */
13463 }
13464 else
13465 {
13466 decl_specs->std_attributes
13470 }
13472 }
13473 }
13475 decl_specs->attributes
13480 }
13481 /* Assume we will find a decl-specifier keyword. */
13483 /* If the next token is an appropriate keyword, we can simply
13484 add it to the list. */
13486 {
13487 /* decl-specifier:
13488 friend
13489 constexpr */
13492 {
13497 }
13498 else
13499 {
13501 /* Consume the token. */
13503 }
13516 /* function-specifier:
13517 inline
13518 virtual
13519 explicit */
13526 /* decl-specifier:
13527 typedef */
13530 /* Consume the token. */
13532 /* A constructor declarator cannot appear in a typedef. */
13534 /* The "typedef" keyword can only occur in a declaration; we
13535 may as well commit at this point. */
13542 /* storage-class-specifier:
13543 auto
13544 register
13545 static
13546 extern
13547 mutable
13549 GNU Extension:
13550 thread */
13553 {
13554 /* Consume the token. */
13557 /* Complain about `auto' as a storage specifier, if
13558 we're complaining about C++0x compatibility. */
13562 "%<auto%> changes meaning in C++11; "
13565 /* Set the storage class anyway. */
13567 token);
13568 }
13569 else
13570 /* C++0x auto type-specifier. */
13578 /* Consume the token. */
13581 token);
13584 /* Consume the token. */
13590 /* We did not yet find a decl-specifier yet. */
13593 }
13610 /* Constructors are a special case. The `S' in `S()' is not a
13611 decl-specifier; it is the beginning of the declarator. */
13612 constructor_p
13613 = (!found_decl_spec
13614 && constructor_possible_p
13615 && (cp_parser_constructor_declarator_p
13618 /* If we don't have a DECL_SPEC yet, then we must be looking at
13619 a type-specifier. */
13621 {
13624 tree type_spec;
13626 type_spec
13628 decl_specs,
13634 /* If this type-specifier referenced a user-defined type
13635 (a typedef, class-name, etc.), then we can't allow any
13636 more such type-specifiers henceforth.
13638 [dcl.spec]
13640 The longest sequence of decl-specifiers that could
13641 possibly be a type name is taken as the
13642 decl-specifier-seq of a declaration. The sequence shall
13643 be self-consistent as described below.
13645 [dcl.type]
13647 As a general rule, at most one type-specifier is allowed
13648 in the complete decl-specifier-seq of a declaration. The
13649 only exceptions are the following:
13651 -- const or volatile can be combined with any other
13652 type-specifier.
13654 -- signed or unsigned can be combined with char, long,
13655 short, or int.
13657 -- ..
13659 Example:
13661 typedef char* Pc;
13662 void g (const int Pc);
13664 Here, Pc is *not* part of the decl-specifier seq; it's
13665 the declarator. Therefore, once we see a type-specifier
13666 (other than a cv-qualifier), we forbid any additional
13667 user-defined types. We *do* still allow things like `int
13668 int' to be considered a decl-specifier-seq, and issue the
13669 error message later. */
13672 /* A constructor declarator cannot follow a type-specifier. */
13674 {
13679 }
13680 }
13682 /* If we still do not have a DECL_SPEC, then there are no more
13683 decl-specifiers. */
13688 /* After we see one decl-specifier, further decl-specifiers are
13689 always optional. */
13691 }
13693 /* Don't allow a friend specifier with a class definition. */
13698 }
13700 /* Parse an (optional) storage-class-specifier.
13702 storage-class-specifier:
13703 auto
13704 register
13705 static
13706 extern
13707 mutable
13709 GNU Extension:
13711 storage-class-specifier:
13712 thread
13714 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13716 static tree
13718 {
13720 {
13724 /* Fall through for C++98. */
13732 /* Consume the token. */
13737 }
13738 }
13740 /* Parse an (optional) function-specifier.
13742 function-specifier:
13743 inline
13744 virtual
13745 explicit
13747 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13748 Updates DECL_SPECS, if it is non-NULL. */
13750 static tree
13753 {
13756 {
13762 /* 14.5.2.3 [temp.mem]
13764 A member function template shall not be virtual. */
13768 else
13778 }
13780 /* Consume the token. */
13782 }
13784 /* Parse a linkage-specification.
13786 linkage-specification:
13787 extern string-literal { declaration-seq [opt] }
13788 extern string-literal declaration */
13790 static void
13792 {
13793 tree linkage;
13795 /* Look for the `extern' keyword. */
13796 cp_token *extern_token
13799 /* Look for the string-literal. */
13803 /* Transform the literal into an identifier. If the literal is a
13804 wide-character string, or contains embedded NULs, then we can't
13805 handle it as the user wants. */
13808 {
13810 /* Assume C++ linkage. */
13812 }
13813 else
13816 /* We're now using the new linkage. */
13819 /* Preserve the location of the the innermost linkage specification,
13820 tracking the locations of nested specifications via a local. */
13821 location_t saved_location
13823 /* Construct a location ranging from the start of the "extern" to
13824 the end of the string-literal, with the caret at the start, e.g.:
13825 extern "C" {
13826 ^~~~~~~~~~
13827 */
13828 parser->innermost_linkage_specification_location
13833 /* If the next token is a `{', then we're using the first
13834 production. */
13836 {
13840 /* Consume the `{' token. */
13841 matching_braces braces;
13843 /* Parse the declarations. */
13845 /* Look for the closing `}'. */
13847 }
13848 /* Otherwise, there's just one declaration. */
13849 else
13850 {
13853 saved_in_unbraced_linkage_specification_p
13857 parser->in_unbraced_linkage_specification_p
13859 }
13861 /* We're done with the linkage-specification. */
13864 /* Restore location of parent linkage specification, if any. */
13866 }
13868 /* Parse a static_assert-declaration.
13870 static_assert-declaration:
13871 static_assert ( constant-expression , string-literal ) ;
13872 static_assert ( constant-expression ) ; (C++17)
13874 If MEMBER_P, this static_assert is a class member. */
13876 static void
13878 {
13879 cp_expr condition;
13880 location_t token_loc;
13881 tree message;
13884 /* Peek at the `static_assert' token so we can keep track of exactly
13885 where the static assertion started. */
13888 /* Look for the `static_assert' keyword. */
13890 RT_STATIC_ASSERT))
13893 /* We know we are in a static assertion; commit to any tentative
13894 parse. */
13898 /* Parse the `(' starting the static assertion condition. */
13899 matching_parens parens;
13902 /* Parse the constant-expression. Allow a non-constant expression
13903 here in order to give better diagnostics in finish_static_assert. */
13904 condition =
13910 {
13913 "static_assert without a message "
13915 /* Eat the ')' */
13920 }
13921 else
13922 {
13923 /* Parse the separating `,'. */
13926 /* Parse the string-literal message. */
13931 /* A `)' completes the static assertion. */
13937 }
13939 /* A semicolon terminates the declaration. */
13942 /* Get the location for the static assertion. Use that of the
13943 condition if available, otherwise, use that of the "static_assert"
13944 token. */
13949 /* Complete the static assertion, which may mean either processing
13950 the static assert now or saving it for template instantiation. */
13952 }
13954 /* Parse the expression in decltype ( expression ). */
13956 static tree
13959 {
13961 tree expr;
13963 /* Since we're going to preserve any side-effects from this parse, set up a
13964 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13965 in the expression. */
13968 /* First, try parsing an id-expression. */
13979 {
13982 cp_id_kind idk;
13986 /* Lookup the name we got back from the id-expression. */
13991 /* A template without args is not a complete id-expression. */
14000 {
14001 /* Complete lookup of the id-expression. */
14002 expr = (finish_id_expression
14015 /* We found an id-expression, but it was something that we
14016 should not have found. This is an error, not something
14017 we can recover from, so note that we found an
14018 id-expression and we'll recover as gracefully as
14019 possible. */
14021 }
14026 /* We have an id-expression. */
14028 }
14031 {
14032 /* Abort the id-expression parse. */
14035 /* Parsing tentatively, again. */
14038 /* Parse a class member access. */
14046 /* We have an id-expression. */
14048 }
14051 /* We have parsed the complete id-expression or member access. */
14053 else
14054 {
14055 /* Abort our attempt to parse an id-expression or member access
14056 expression. */
14059 /* Commit to the tentative_firewall so we get syntax errors. */
14062 /* Parse a full expression. */
14065 }
14068 }
14070 /* Parse a `decltype' type. Returns the type.
14072 simple-type-specifier:
14073 decltype ( expression )
14074 C++14 proposal:
14075 decltype ( auto ) */
14077 static tree
14079 {
14084 {
14085 /* Already parsed. */
14088 }
14090 /* Look for the `decltype' token. */
14094 /* Parse the opening `('. */
14095 matching_parens parens;
14105 /* decltype (auto) */
14107 else
14108 {
14109 /* decltype (expression) */
14111 /* Types cannot be defined in a `decltype' expression. Save away the
14112 old message and set the new one. */
14114 parser->type_definition_forbidden_message
14117 /* The restrictions on constant-expressions do not apply inside
14118 decltype expressions. */
14119 bool saved_integral_constant_expression_p
14121 bool saved_non_integral_constant_expression_p
14125 /* Within a parenthesized expression, a `>' token is always
14126 the greater-than operator. */
14127 bool saved_greater_than_is_operator_p
14131 /* Do not actually evaluate the expression. */
14134 /* Do not warn about problems with the expression. */
14139 /* Go back to evaluating expressions. */
14143 /* The `>' token might be the end of a template-id or
14144 template-parameter-list now. */
14145 parser->greater_than_is_operator_p
14148 /* Restore the old message and the integral constant expression
14149 flags. */
14151 parser->integral_constant_expression_p
14153 parser->non_integral_constant_expression_p
14155 }
14157 /* Parse to the closing `)'. */
14159 {
14164 }
14167 {
14168 /* Build auto. */
14171 }
14172 else
14174 tf_warning_or_error);
14176 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14177 it again. */
14188 }
14190 /* Special member functions [gram.special] */
14192 /* Parse a conversion-function-id.
14194 conversion-function-id:
14195 operator conversion-type-id
14197 Returns an IDENTIFIER_NODE representing the operator. */
14199 static tree
14201 {
14202 tree type;
14203 tree saved_scope;
14204 tree saved_qualifying_scope;
14205 tree saved_object_scope;
14208 /* Look for the `operator' token. */
14211 /* When we parse the conversion-type-id, the current scope will be
14212 reset. However, we need that information in able to look up the
14213 conversion function later, so we save it here. */
14217 /* We must enter the scope of the class so that the names of
14218 entities declared within the class are available in the
14219 conversion-type-id. For example, consider:
14221 struct S {
14222 typedef int I;
14223 operator I();
14224 };
14226 S::operator I() { ... }
14228 In order to see that `I' is a type-name in the definition, we
14229 must be in the scope of `S'. */
14232 /* Parse the conversion-type-id. */
14234 /* Leave the scope of the class, if any. */
14237 /* Restore the saved scope. */
14241 /* If the TYPE is invalid, indicate failure. */
14245 }
14247 /* Parse a conversion-type-id:
14249 conversion-type-id:
14250 type-specifier-seq conversion-declarator [opt]
14252 Returns the TYPE specified. */
14254 static tree
14256 {
14257 tree attributes;
14258 cp_decl_specifier_seq type_specifiers;
14260 tree type_specified;
14263 /* Parse the attributes. */
14267 parser->type_definition_forbidden_message
14270 /* Parse the type-specifiers. */
14277 /* If that didn't work, stop. */
14280 /* Parse the conversion-declarator. */
14288 /* Don't give this error when parsing tentatively. This happens to
14289 work because we always parse this definitively once. */
14292 {
14294 {
14297 }
14301 }
14304 }
14306 /* Parse an (optional) conversion-declarator.
14308 conversion-declarator:
14309 ptr-operator conversion-declarator [opt]
14311 */
14315 {
14318 cp_cv_quals cv_quals;
14320 /* We don't know if there's a ptr-operator next, or not. */
14322 /* Try the ptr-operator. */
14325 /* If it worked, look for more conversion-declarators. */
14327 {
14330 /* Parse another optional declarator. */
14333 declarator = cp_parser_make_indirect_declarator
14337 }
14340 }
14342 /* Parse an (optional) ctor-initializer.
14344 ctor-initializer:
14345 : mem-initializer-list */
14347 static void
14349 {
14350 /* If the next token is not a `:', then there is no
14351 ctor-initializer. */
14353 {
14354 /* Do default initialization of any bases and members. */
14358 }
14360 /* Consume the `:' token. */
14362 /* And the mem-initializer-list. */
14364 }
14366 /* Parse a mem-initializer-list.
14368 mem-initializer-list:
14369 mem-initializer ... [opt]
14370 mem-initializer ... [opt] , mem-initializer-list */
14372 static void
14374 {
14379 /* Let the semantic analysis code know that we are starting the
14380 mem-initializer-list. */
14385 /* Loop through the list. */
14387 {
14388 tree mem_initializer;
14391 /* Parse the mem-initializer. */
14393 /* If the next token is a `...', we're expanding member initializers. */
14395 {
14396 /* Consume the `...'. */
14399 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14400 can be expanded but members cannot. */
14403 {
14408 }
14410 /* Construct the pack expansion type. */
14413 }
14416 {
14420 }
14421 /* Look for a target constructor. */
14425 {
14428 {
14432 }
14434 }
14435 /* Add it to the list, unless it was erroneous. */
14437 {
14440 }
14441 /* If the next token is not a `,', we're done. */
14444 /* Consume the `,' token. */
14446 }
14448 /* Perform semantic analysis. */
14451 }
14453 /* Parse a mem-initializer.
14455 mem-initializer:
14456 mem-initializer-id ( expression-list [opt] )
14457 mem-initializer-id braced-init-list
14459 GNU extension:
14461 mem-initializer:
14462 ( expression-list [opt] )
14464 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14465 class) or FIELD_DECL (for a non-static data member) to initialize;
14466 the TREE_VALUE is the expression-list. An empty initialization
14467 list is represented by void_list_node. */
14469 static tree
14471 {
14472 tree mem_initializer_id;
14473 tree expression_list;
14474 tree member;
14477 /* Find out what is being initialized. */
14479 {
14483 }
14484 else
14485 {
14489 }
14495 {
14502 }
14503 else
14504 {
14514 }
14524 }
14526 /* Parse a mem-initializer-id.
14528 mem-initializer-id:
14529 :: [opt] nested-name-specifier [opt] class-name
14530 decltype-specifier (C++11)
14531 identifier
14533 Returns a TYPE indicating the class to be initialized for the first
14534 production (and the second in C++11). Returns an IDENTIFIER_NODE
14535 indicating the data member to be initialized for the last production. */
14537 static tree
14539 {
14543 tree id;
14547 /* `typename' is not allowed in this context ([temp.res]). */
14549 {
14551 "keyword %<typename%> not allowed in this context (a qualified "
14554 }
14555 /* Look for the optional `::' operator. */
14556 global_scope_p
14560 /* Look for the optional nested-name-specifier. The simplest way to
14561 implement:
14563 [temp.res]
14565 The keyword `typename' is not permitted in a base-specifier or
14566 mem-initializer; in these contexts a qualified name that
14567 depends on a template-parameter is implicitly assumed to be a
14568 type name.
14570 is to assume that we have seen the `typename' keyword at this
14571 point. */
14572 nested_name_specifier_p
14581 /* If there is a `::' operator or a nested-name-specifier, then we
14582 are definitely looking for a class-name. */
14587 typename_type,
14591 /* Otherwise, we could also be looking for an ordinary identifier. */
14594 /* Try a decltype-specifier. */
14596 else
14597 /* Otherwise, try a class-name. */
14601 none_type,
14605 /* If we found one, we're done. */
14608 /* Otherwise, look for an ordinary identifier. */
14610 }
14612 /* Overloading [gram.over] */
14614 /* Parse an operator-function-id.
14616 operator-function-id:
14617 operator operator
14619 Returns an IDENTIFIER_NODE for the operator which is a
14620 human-readable spelling of the identifier, e.g., `operator +'. */
14622 static cp_expr
14624 {
14625 /* Look for the `operator' keyword. */
14628 /* And then the name of the operator itself. */
14630 }
14632 /* Return an identifier node for a user-defined literal operator.
14633 The suffix identifier is chained to the operator name identifier. */
14635 tree
14637 {
14638 tree identifier;
14645 }
14647 /* Parse an operator.
14649 operator:
14650 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14651 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14652 || ++ -- , ->* -> () []
14654 GNU Extensions:
14656 operator:
14657 <? >? <?= >?=
14659 Returns an IDENTIFIER_NODE for the operator which is a
14660 human-readable spelling of the identifier, e.g., `operator +'. */
14662 static cp_expr
14664 {
14669 /* Peek at the next token. */
14674 /* Figure out which operator we have. */
14679 {
14681 {
14682 /* The keyword should be either `new' or `delete'. */
14687 else
14690 /* Consume the `new' or `delete' token. */
14693 /* Peek at the next token. */
14695 /* If it's a `[' token then this is the array variant of the
14696 operator. */
14698 {
14699 /* Consume the `[' token. */
14701 /* Look for the `]' token. */
14706 }
14710 }
14868 {
14869 /* Consume the `('. */
14870 matching_parens parens;
14872 /* Look for the matching `)'. */
14877 }
14880 /* Consume the `['. */
14882 /* Look for the matching `]'. */
14891 /* FALLTHRU */
14900 {
14907 /* Consume the string. */
14913 {
14916 }
14917 else
14918 {
14920 /* Look for the suffix identifier. */
14925 {
14929 }
14930 else
14931 {
14934 }
14935 }
14940 {
14943 }
14946 {
14949 }
14951 {
14954 }
14956 }
14959 /* Anything else is an error. */
14961 }
14963 /* If we have selected an identifier, we need to consume the
14964 operator token. */
14966 {
14970 }
14971 /* Otherwise, no valid operator name was present. */
14972 else
14973 {
14976 }
14979 }
14981 /* Parse a template-declaration.
14983 template-declaration:
14984 export [opt] template < template-parameter-list > declaration
14986 If MEMBER_P is TRUE, this template-declaration occurs within a
14987 class-specifier.
14989 The grammar rule given by the standard isn't correct. What
14990 is really meant is:
14992 template-declaration:
14993 export [opt] template-parameter-list-seq
14994 decl-specifier-seq [opt] init-declarator [opt] ;
14995 export [opt] template-parameter-list-seq
14996 function-definition
14998 template-parameter-list-seq:
14999 template-parameter-list-seq [opt]
15000 template < template-parameter-list >
15002 Concept Extensions:
15004 template-parameter-list-seq:
15005 template < template-parameter-list > requires-clause [opt]
15007 requires-clause:
15008 requires logical-or-expression */
15010 static void
15012 {
15013 /* Check for `export'. */
15015 {
15016 /* Consume the `export' token. */
15018 /* Warn that we do not support `export'. */
15020 }
15023 }
15025 /* Parse a template-parameter-list.
15027 template-parameter-list:
15028 template-parameter
15029 template-parameter-list , template-parameter
15031 Returns a TREE_LIST. Each node represents a template parameter.
15032 The nodes are connected via their TREE_CHAINs. */
15034 static tree
15036 {
15041 /* The loop below parses the template parms. We first need to know
15042 the total number of template parms to be able to compute proper
15043 canonical types of each dependent type. So after the loop, when
15044 we know the total number of template parms,
15045 end_template_parm_list computes the proper canonical types and
15046 fixes up the dependent types accordingly. */
15048 {
15049 tree parameter;
15052 location_t parm_loc;
15054 /* Parse the template-parameter. */
15059 /* Add it to the list. */
15062 parm_loc,
15063 parameter,
15064 is_non_type,
15065 is_parameter_pack);
15066 else
15067 {
15070 }
15072 /* If the next token is not a `,', we're done. */
15075 /* Otherwise, consume the `,' token. */
15077 }
15080 }
15082 /* Parse a introduction-list.
15084 introduction-list:
15085 introduced-parameter
15086 introduction-list , introduced-parameter
15088 introduced-parameter:
15089 ...[opt] identifier
15091 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15092 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15093 WILDCARD_DECL will also have DECL_NAME set and token location in
15094 DECL_SOURCE_LOCATION. */
15096 static tree
15098 {
15102 {
15107 /* Build placeholder. */
15115 /* If the next token is not a `,', we're done. */
15118 /* Otherwise, consume the `,' token. */
15120 }
15122 /* Convert the vec into a TREE_VEC. */
15125 tree parm;
15131 }
15133 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15134 is an abstract declarator. */
15138 {
15143 }
15145 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15146 is an abstract declarator. */
15150 {
15154 else
15156 }
15158 /* Returns true if DECL represents a constrained-parameter. */
15162 {
15167 }
15169 /* Returns true if PARM declares a constrained-parameter. */
15173 {
15175 }
15177 /* Check that the type parameter is only a declarator-id, and that its
15178 type is not cv-qualified. */
15180 bool
15183 {
15188 {
15191 }
15193 /* Don't allow cv-qualified type parameters. */
15196 {
15199 }
15202 }
15204 /* Finish parsing/processing a template type parameter and checking
15205 various restrictions. */
15209 tree id,
15211 {
15214 else
15216 }
15218 static tree
15220 {
15221 /* FIXME: This should probably be copied, and we may need to adjust
15222 the template parameter depths. */
15232 }
15234 /* Finish parsing/processing a template template parameter by borrowing
15235 the template parameter list from the prototype parameter. */
15237 static tree
15239 tree proto,
15240 tree id,
15242 {
15246 }
15248 /* Create a new non-type template parameter from the given PARM
15249 declarator. */
15251 static tree
15254 {
15260 }
15262 /* Build a constrained template parameter based on the PARMDECL
15263 declarator. The type of PARMDECL is the constrained type, which
15264 refers to the prototype template parameter that ultimately
15265 specifies the type of the declared parameter. */
15267 static tree
15272 {
15278 /* A template parameter constrained by a variadic concept shall also
15279 be declared as a template parameter pack. */
15284 /* Build the parameter. Return an error if the declarator was invalid. */
15285 tree parm;
15290 parmdecl);
15291 else
15296 /* Finish the parameter decl and create a node attaching the
15297 default argument and constraint. */
15302 }
15304 /* Returns true if the parsed type actually represents the declaration
15305 of a type template-parameter. */
15309 {
15312 }
15315 /* Returns true if the parsed type actually represents the declaration of
15316 a template template-parameter. */
15318 static bool
15320 {
15323 }
15325 /* Parse a default argument for a type template-parameter.
15326 Note that diagnostics are handled in cp_parser_template_parameter. */
15328 static tree
15330 {
15333 /* Consume the `=' token. */
15338 /* Parse the default-argument. */
15344 {
15348 }
15351 }
15353 /* Parse a default argument for a template template-parameter. */
15355 static tree
15357 {
15362 /* Consume the `='. */
15364 /* Parse the id-expression. */
15366 /* save token before parsing the id-expression, for error
15367 reporting */
15369 tree default_argument
15377 /* If the id-expression was a template-id that refers to
15378 a template-class, we already have the declaration here,
15379 so no further lookup is needed. */
15380 ;
15381 else
15382 /* Look up the name. */
15383 default_argument
15385 none_type,
15391 /* See if the default argument is valid. */
15395 }
15397 /* Parse a template-parameter.
15399 template-parameter:
15400 type-parameter
15401 parameter-declaration
15403 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15404 the parameter. The TREE_PURPOSE is the default value, if any.
15405 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15406 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15407 set to true iff this parameter is a parameter pack. */
15409 static tree
15412 {
15415 tree parm;
15417 /* Assume it is a type parameter or a template parameter. */
15419 /* Assume it not a parameter pack. */
15421 /* Peek at the next token. */
15423 /* If it is `template', we have a type-parameter. */
15426 /* If it is `class' or `typename' we do not know yet whether it is a
15427 type parameter or a non-type parameter. Consider:
15429 template <typename T, typename T::X X> ...
15431 or:
15433 template <class C, class D*> ...
15435 Here, the first parameter is a type parameter, and the second is
15436 a non-type parameter. We can tell by looking at the token after
15437 the identifier -- if it is a `,', `=', or `>' then we have a type
15438 parameter. */
15440 {
15441 /* Peek at the token after `class' or `typename'. */
15443 /* If it's an ellipsis, we have a template type parameter
15444 pack. */
15447 /* If it's an identifier, skip it. */
15450 /* Now, see if the token looks like the end of a template
15451 parameter. */
15456 }
15458 /* Otherwise, it is a non-type parameter or a constrained parameter.
15460 [temp.param]
15462 When parsing a default template-argument for a non-type
15463 template-parameter, the first non-nested `>' is taken as the end
15464 of the template parameter-list rather than a greater-than
15465 operator. */
15466 parameter_declarator
15473 /* If the parameter declaration is marked as a parameter pack, set
15474 *IS_PARAMETER_PACK to notify the caller. */
15479 {
15480 /* Can happen in some cases of erroneous input (c++/34892). */
15482 /* Consume the `...' for better error recovery. */
15484 }
15486 // The parameter may have been constrained.
15489 parameter_declarator,
15490 is_non_type,
15491 is_parameter_pack);
15493 // Now we're sure that the parameter is a non-type parameter.
15504 }
15506 /* Parse a type-parameter.
15508 type-parameter:
15509 class identifier [opt]
15510 class identifier [opt] = type-id
15511 typename identifier [opt]
15512 typename identifier [opt] = type-id
15513 template < template-parameter-list > class identifier [opt]
15514 template < template-parameter-list > class identifier [opt]
15515 = id-expression
15517 GNU Extension (variadic templates):
15519 type-parameter:
15520 class ... identifier [opt]
15521 typename ... identifier [opt]
15523 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15524 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15525 the declaration of the parameter.
15527 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15529 static tree
15531 {
15533 tree parameter;
15535 /* Look for a keyword to tell us what kind of parameter this is. */
15541 {
15544 {
15545 tree identifier;
15546 tree default_argument;
15548 /* If the next token is an ellipsis, we have a template
15549 argument pack. */
15551 {
15552 /* Consume the `...' token. */
15557 }
15559 /* If the next token is an identifier, then it names the
15560 parameter. */
15563 else
15566 /* Create the parameter. */
15569 /* If the next token is an `=', we have a default argument. */
15571 {
15572 default_argument
15575 /* Template parameter packs cannot have default
15576 arguments. */
15578 {
15581 "template parameter pack %qD cannot have a "
15583 else
15585 "template parameter packs cannot have "
15588 }
15591 }
15592 else
15595 /* Create the combined representation of the parameter and the
15596 default argument. */
15598 }
15602 {
15603 tree identifier;
15604 tree default_argument;
15606 /* Look for the `<'. */
15608 /* Parse the template-parameter-list. */
15610 /* Look for the `>'. */
15613 // If template requirements are present, parse them.
15615 {
15620 }
15622 /* Look for the `class' or 'typename' keywords. */
15624 /* If the next token is an ellipsis, we have a template
15625 argument pack. */
15627 {
15628 /* Consume the `...' token. */
15633 }
15634 /* If the next token is an `=', then there is a
15635 default-argument. If the next token is a `>', we are at
15636 the end of the parameter-list. If the next token is a `,',
15637 then we are at the end of this parameter. */
15641 {
15643 /* Treat invalid names as if the parameter were nameless. */
15646 }
15647 else
15650 /* Create the template parameter. */
15652 identifier);
15654 /* If the next token is an `=', then there is a
15655 default-argument. */
15657 {
15658 default_argument
15661 /* Template parameter packs cannot have default
15662 arguments. */
15664 {
15667 "template parameter pack %qD cannot "
15669 identifier);
15670 else
15674 }
15675 }
15676 else
15679 /* Create the combined representation of the parameter and the
15680 default argument. */
15682 }
15688 }
15691 }
15693 /* Parse a template-id.
15695 template-id:
15696 template-name < template-argument-list [opt] >
15698 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15699 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15700 returned. Otherwise, if the template-name names a function, or set
15701 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15702 names a class, returns a TYPE_DECL for the specialization.
15704 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15705 uninstantiated templates. */
15707 static tree
15713 {
15714 tree templ;
15715 tree arguments;
15716 tree template_id;
15721 /* If the next token corresponds to a template-id, there is no need
15722 to reparse it. */
15725 {
15728 }
15730 /* Avoid performing name lookup if there is no possibility of
15731 finding a template-id. */
15734 && !cp_parser_nth_token_starts_template_argument_list_p
15736 {
15739 }
15741 /* Remember where the template-id starts. */
15747 /* Parse the template-name. */
15750 check_dependency_p,
15751 is_declaration,
15752 tag_type,
15755 {
15758 }
15760 /* Since we're going to preserve any side-effects from this parse, set up a
15761 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15762 in the template arguments. */
15765 /* If we find the sequence `[:' after a template-name, it's probably
15766 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15767 parse correctly the argument list. */
15774 {
15776 /* Change `:' into `::'. */
15778 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15779 CPP_LESS. */
15782 /* Parse the arguments. */
15785 {
15786 /* If we couldn't parse an argument list, then we revert our changes
15787 and return simply an error. Maybe this is not a template-id
15788 after all. */
15793 }
15794 /* Otherwise, emit an error about the invalid digraph, but continue
15795 parsing because we got our argument list. */
15798 {
15801 "%<<:%> is an alternate spelling for %<[%>."
15804 {
15806 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15809 }
15810 }
15811 }
15812 else
15813 {
15814 /* Look for the `<' that starts the template-argument-list. */
15816 {
15819 }
15820 /* Parse the arguments. */
15822 }
15824 /* Set the location to be of the form:
15825 template-name < template-argument-list [opt] >
15826 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15827 with caret == start at the start of the template-name,
15828 ranging until the closing '>'. */
15829 location_t finish_loc
15831 location_t combined_loc
15834 /* Build a representation of the specialization. */
15837 TEMPLATE_ID_EXPR,
15841 {
15843 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15844 template (rather than some instantiation thereof) only if
15845 is not nested within some other construct. For example, in
15846 "template <typename T> void f(T) { A<T>::", A<T> is just an
15847 instantiation of A. */
15850 CPP_SCOPE));
15851 template_id
15853 }
15854 /* A template-like identifier may be a partial concept id. */
15860 {
15864 }
15865 else
15866 {
15867 /* If it's not a class-template or a template-template, it should be
15868 a function-template. */
15876 }
15878 /* If parsing tentatively, replace the sequence of tokens that makes
15879 up the template-id with a CPP_TEMPLATE_ID token. That way,
15880 should we re-parse the token stream, we will not have to repeat
15881 the effort required to do the parse, nor will we issue duplicate
15882 error messages about problems during instantiation of the
15883 template. */
15885 /* Don't do this if we had a parse error in a declarator; re-parsing
15886 might succeed if a name changes meaning (60361). */
15890 {
15891 /* Reset the contents of the START_OF_ID token. */
15895 /* We must mark the lookup as kept, so we don't throw it away on
15896 the first parse. */
15900 /* Retrieve any deferred checks. Do not pop this access checks yet
15901 so the memory will not be reclaimed during token replacing below. */
15907 /* Purge all subsequent tokens. */
15910 /* ??? Can we actually assume that, if template_id ==
15911 error_mark_node, we will have issued a diagnostic to the
15912 user, as opposed to simply marking the tentative parse as
15913 failed? */
15916 }
15920 }
15922 /* Parse a template-name.
15924 template-name:
15925 identifier
15927 The standard should actually say:
15929 template-name:
15930 identifier
15931 operator-function-id
15933 A defect report has been filed about this issue.
15935 A conversion-function-id cannot be a template name because they cannot
15936 be part of a template-id. In fact, looking at this code:
15938 a.operator K<int>()
15940 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15941 It is impossible to call a templated conversion-function-id with an
15942 explicit argument list, since the only allowed template parameter is
15943 the type to which it is converting.
15945 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15946 `template' keyword, in a construction like:
15948 T::template f<3>()
15950 In that case `f' is taken to be a template-name, even though there
15951 is no way of knowing for sure.
15953 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15954 name refers to a set of overloaded functions, at least one of which
15955 is a template, or an IDENTIFIER_NODE with the name of the template,
15956 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15957 names are looked up inside uninstantiated templates. */
15959 static tree
15966 {
15967 tree identifier;
15968 tree decl;
15971 /* If the next token is `operator', then we have either an
15972 operator-function-id or a conversion-function-id. */
15974 {
15975 /* We don't know whether we're looking at an
15976 operator-function-id or a conversion-function-id. */
15978 /* Try an operator-function-id. */
15980 /* If that didn't work, try a conversion-function-id. */
15982 {
15985 }
15986 }
15987 /* Look for the identifier. */
15988 else
15991 /* If we didn't find an identifier, we don't have a template-id. */
15995 /* If the name immediately followed the `template' keyword, then it
15996 is a template-name. However, if the next token is not `<', then
15997 we do not treat it as a template-name, since it is not being used
15998 as part of a template-id. This enables us to handle constructs
15999 like:
16001 template <typename T> struct S { S(); };
16002 template <typename T> S<T>::S();
16004 correctly. We would treat `S' as a template -- if it were `S<T>'
16005 -- but we do not if there is no `<'. */
16009 {
16010 /* In a declaration, in a dependent context, we pretend that the
16011 "template" keyword was present in order to improve error
16012 recovery. For example, given:
16014 template <typename T> void f(T::X<int>);
16016 we want to treat "X<int>" as a template-id. */
16018 && !template_keyword_p
16020 && check_dependency_p
16022 /* Do not do this for dtors (or ctors), since they never
16023 need the template keyword before their name. */
16025 {
16028 /* Explain what went wrong. */
16030 identifier);
16033 /* If parsing tentatively, find the location of the "<" token. */
16036 /* Parse the template arguments so that we can issue error
16037 messages about them. */
16040 /* Skip tokens until we find a good place from which to
16041 continue parsing. */
16046 /* If parsing tentatively, permanently remove the
16047 template argument list. That will prevent duplicate
16048 error messages from being issued about the missing
16049 "template" keyword. */
16056 }
16058 /* If the "template" keyword is present, then there is generally
16059 no point in doing name-lookup, so we just return IDENTIFIER.
16060 But, if the qualifying scope is non-dependent then we can
16061 (and must) do name-lookup normally. */
16063 {
16069 {
16070 /* We're optimizing away the call to cp_parser_lookup_name, but
16071 we still need to do this. */
16074 }
16075 }
16076 }
16078 /* Look up the name. */
16080 tag_type,
16083 check_dependency_p,
16089 /* If DECL is a template, then the name was a template-name. */
16091 {
16095 }
16096 else
16097 {
16098 /* The standard does not explicitly indicate whether a name that
16099 names a set of overloaded declarations, some of which are
16100 templates, is a template-name. However, such a name should
16101 be a template-name; otherwise, there is no way to form a
16102 template-id for the overloaded templates. */
16111 {
16112 /* The name does not name a template. */
16115 }
16116 }
16118 /* If DECL is dependent, and refers to a function, then just return
16119 its name; we will look it up again during template instantiation. */
16121 {
16125 }
16128 }
16130 /* Parse a template-argument-list.
16132 template-argument-list:
16133 template-argument ... [opt]
16134 template-argument-list , template-argument ... [opt]
16136 Returns a TREE_VEC containing the arguments. */
16138 static tree
16140 {
16145 tree vec;
16152 /* Even if the template-id appears in an integral
16153 constant-expression, the contents of the argument list do
16154 not. */
16160 /* Parse the arguments. */
16161 do
16162 {
16163 tree argument;
16166 /* Consume the comma. */
16169 /* Parse the template-argument. */
16172 /* If the next token is an ellipsis, we're expanding a template
16173 argument pack. */
16175 {
16177 {
16181 }
16182 /* Consume the `...' token. */
16185 /* Make the argument into a TYPE_PACK_EXPANSION or
16186 EXPR_PACK_EXPANSION. */
16188 }
16191 {
16195 {
16198 }
16199 else
16201 }
16203 }
16219 }
16221 /* Parse a template-argument.
16223 template-argument:
16224 assignment-expression
16225 type-id
16226 id-expression
16228 The representation is that of an assignment-expression, type-id, or
16229 id-expression -- except that the qualified id-expression is
16230 evaluated, so that the value returned is either a DECL or an
16231 OVERLOAD.
16233 Although the standard says "assignment-expression", it forbids
16234 throw-expressions or assignments in the template argument.
16235 Therefore, we use "conditional-expression" instead. */
16237 static tree
16239 {
16240 tree argument;
16246 cp_id_kind idk;
16248 /* There's really no way to know what we're looking at, so we just
16249 try each alternative in order.
16251 [temp.arg]
16253 In a template-argument, an ambiguity between a type-id and an
16254 expression is resolved to a type-id, regardless of the form of
16255 the corresponding template-parameter.
16257 Therefore, we try a type-id first. */
16260 /* If there was no error parsing the type-id but the next token is a
16261 '>>', our behavior depends on which dialect of C++ we're
16262 parsing. In C++98, we probably found a typo for '> >'. But there
16263 are type-id which are also valid expressions. For instance:
16265 struct X { int operator >> (int); };
16266 template <int V> struct Foo {};
16267 Foo<X () >> 5> r;
16269 Here 'X()' is a valid type-id of a function type, but the user just
16270 wanted to write the expression "X() >> 5". Thus, we remember that we
16271 found a valid type-id, but we still try to parse the argument as an
16272 expression to see what happens.
16274 In C++0x, the '>>' will be considered two separate '>'
16275 tokens. */
16279 {
16282 }
16283 else
16284 {
16285 /* If the next token isn't a `,' or a `>', then this argument wasn't
16286 really finished. This means that the argument is not a valid
16287 type-id. */
16290 /* If that worked, we're done. */
16293 }
16294 /* We're still not sure what the argument will be. */
16296 /* Try a template. */
16304 /* If the next token isn't a `,' or a `>', then this argument wasn't
16305 really finished. */
16309 {
16310 /* Figure out what is being referred to. If the id-expression
16311 was for a class template specialization, then we will have a
16312 TYPE_DECL at this point. There is no need to do name lookup
16313 at this point in that case. */
16316 none_type,
16322 /* Handle a constrained-type-specifier for a non-type template
16323 parameter. */
16329 }
16331 {
16335 }
16336 /* It must be a non-type argument. In C++17 any constant-expression is
16337 allowed. */
16341 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16343 -- an integral constant-expression of integral or enumeration
16344 type; or
16346 -- the name of a non-type template-parameter; or
16348 -- the name of an object or function with external linkage...
16350 -- the address of an object or function with external linkage...
16352 -- a pointer to member... */
16353 /* Look for a non-type template parameter. */
16355 {
16367 }
16369 /* If the next token is "&", the argument must be the address of an
16370 object or function with external linkage. */
16373 {
16376 }
16377 /* See if we might have an id-expression. */
16384 {
16387 address_p,
16394 else
16395 {
16396 tree probe;
16399 {
16400 /* Strip the dereference temporarily. */
16403 }
16405 /* If we're in a template, we represent a qualified-id referring
16406 to a static data member as a SCOPE_REF even if the scope isn't
16407 dependent so that we can check access control later. */
16412 {
16413 /* A variable without external linkage might still be a
16414 valid constant-expression, so no error is issued here
16415 if the external-linkage check fails. */
16418 }
16420 /* All overloaded functions are allowed; if the external
16421 linkage test does not pass, an error will be issued
16422 later. */
16423 ;
16427 /* A pointer-to-member. */
16428 ;
16430 ;
16431 else
16435 {
16438 tf_warning_or_error);
16439 else
16442 }
16443 }
16444 }
16445 /* If the argument started with "&", there are no other valid
16446 alternatives at this point. */
16448 {
16451 }
16453 general_expr:
16454 /* If the argument wasn't successfully parsed as a type-id followed
16455 by '>>', the argument can only be a constant expression now.
16456 Otherwise, we try parsing the constant-expression tentatively,
16457 because the argument could really be a type-id. */
16463 else
16464 {
16465 /* With C++17 generalized non-type template arguments we need to handle
16466 lvalue constant expressions, too. */
16469 }
16477 /* We did our best to parse the argument as a non type-id, but that
16478 was the only alternative that matched (albeit with a '>' after
16479 it). We can assume it's just a typo from the user, and a
16480 diagnostic will then be issued. */
16482 }
16484 /* Parse an explicit-instantiation.
16486 explicit-instantiation:
16487 template declaration
16489 Although the standard says `declaration', what it really means is:
16491 explicit-instantiation:
16492 template decl-specifier-seq [opt] declarator [opt] ;
16494 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16495 supposed to be allowed. A defect report has been filed about this
16496 issue.
16498 GNU Extension:
16500 explicit-instantiation:
16501 storage-class-specifier template
16502 decl-specifier-seq [opt] declarator [opt] ;
16503 function-specifier template
16504 decl-specifier-seq [opt] declarator [opt] ; */
16506 static void
16508 {
16510 cp_decl_specifier_seq decl_specifiers;
16515 /* Look for an (optional) storage-class-specifier or
16516 function-specifier. */
16518 {
16519 extension_specifier
16522 extension_specifier
16525 }
16527 /* Look for the `template' keyword. */
16529 /* Let the front end know that we are processing an explicit
16530 instantiation. */
16532 /* [temp.explicit] says that we are supposed to ignore access
16533 control while processing explicit instantiation directives. */
16535 /* Parse a decl-specifier-seq. */
16537 CP_PARSER_FLAGS_OPTIONAL,
16540 /* If there was exactly one decl-specifier, and it declared a class,
16541 and there's no declarator, then we have an explicit type
16542 instantiation. */
16544 {
16545 tree type;
16549 /* Turn access control back on for names used during
16550 template instantiation. */
16555 }
16556 else
16557 {
16559 tree decl;
16561 /* Parse the declarator. */
16562 declarator
16573 {
16576 "explicit instantiation shall not use"
16580 "explicit instantiation shall not use"
16585 /* Turn access control back on for names used during
16586 template instantiation. */
16588 /* Do the explicit instantiation. */
16590 }
16591 else
16592 {
16594 /* Skip the body of the explicit instantiation. */
16596 }
16597 }
16598 /* We're done with the instantiation. */
16604 }
16606 /* Parse an explicit-specialization.
16608 explicit-specialization:
16609 template < > declaration
16611 Although the standard says `declaration', what it really means is:
16613 explicit-specialization:
16614 template <> decl-specifier [opt] init-declarator [opt] ;
16615 template <> function-definition
16616 template <> explicit-specialization
16617 template <> template-declaration */
16619 static void
16621 {
16625 /* Look for the `template' keyword. */
16627 /* Look for the `<'. */
16629 /* Look for the `>'. */
16631 /* We have processed another parameter list. */
16633 /* [temp]
16635 A template ... explicit specialization ... shall not have C
16636 linkage. */
16638 {
16641 /* Give it C++ linkage to avoid confusing other parts of the
16642 front end. */
16645 }
16646 else
16648 /* Let the front end know that we are beginning a specialization. */
16650 {
16653 }
16655 /* If the next keyword is `template', we need to figure out whether
16656 or not we're looking a template-declaration. */
16658 {
16663 else
16665 }
16666 else
16667 /* Parse the dependent declaration. */
16673 /* We're done with the specialization. */
16675 /* For the erroneous case of a template with C linkage, we pushed an
16676 implicit C++ linkage scope; exit that scope now. */
16679 /* We're done with this parameter list. */
16681 }
16683 /* Parse a type-specifier.
16685 type-specifier:
16686 simple-type-specifier
16687 class-specifier
16688 enum-specifier
16689 elaborated-type-specifier
16690 cv-qualifier
16692 GNU Extension:
16694 type-specifier:
16695 __complex__
16697 Returns a representation of the type-specifier. For a
16698 class-specifier, enum-specifier, or elaborated-type-specifier, a
16699 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16701 The parser flags FLAGS is used to control type-specifier parsing.
16703 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16704 in a decl-specifier-seq.
16706 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16707 class-specifier, enum-specifier, or elaborated-type-specifier, then
16708 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16709 if a type is declared; 2 if it is defined. Otherwise, it is set to
16710 zero.
16712 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16713 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16714 is set to FALSE. */
16716 static tree
16718 cp_parser_flags flags,
16723 {
16729 /* Assume this type-specifier does not declare a new type. */
16732 /* And that it does not specify a cv-qualifier. */
16735 /* Peek at the next token. */
16738 /* If we're looking at a keyword, we can use that to guide the
16739 production we choose. */
16742 {
16747 /* Look for the enum-specifier. */
16749 /* If that worked, we're done. */
16751 {
16756 type_spec,
16757 token,
16760 }
16761 else
16764 /* Any of these indicate either a class-specifier, or an
16765 elaborated-type-specifier. */
16772 /* Parse tentatively so that we can back up if we don't find a
16773 class-specifier. */
16775 /* Look for the class-specifier. */
16778 /* If that worked, we're done. */
16780 {
16785 type_spec,
16786 token,
16789 }
16791 /* Fall through. */
16792 elaborated_type_specifier:
16793 /* We're declaring (not defining) a class or enum. */
16797 /* Fall through. */
16799 /* Look for an elaborated-type-specifier. */
16800 type_spec
16801 = (cp_parser_elaborated_type_specifier
16804 is_declaration));
16807 type_spec,
16808 token,
16831 /* The `__complex__' keyword is a GNU extension. */
16837 }
16839 /* Handle simple keywords. */
16841 {
16843 {
16846 }
16848 }
16850 /* If we do not already have a type-specifier, assume we are looking
16851 at a simple-type-specifier. */
16853 decl_specs,
16854 flags);
16856 /* If we didn't find a type-specifier, and a type-specifier was not
16857 optional in this context, issue an error message. */
16859 {
16862 }
16865 }
16867 /* Parse a simple-type-specifier.
16869 simple-type-specifier:
16870 :: [opt] nested-name-specifier [opt] type-name
16871 :: [opt] nested-name-specifier template template-id
16872 char
16873 wchar_t
16874 bool
16875 short
16876 int
16877 long
16878 signed
16879 unsigned
16880 float
16881 double
16882 void
16884 C++11 Extension:
16886 simple-type-specifier:
16887 auto
16888 decltype ( expression )
16889 char16_t
16890 char32_t
16891 __underlying_type ( type-id )
16893 C++17 extension:
16895 nested-name-specifier(opt) template-name
16897 GNU Extension:
16899 simple-type-specifier:
16900 __int128
16901 __typeof__ unary-expression
16902 __typeof__ ( type-id )
16903 __typeof__ ( type-id ) { initializer-list , [opt] }
16905 Concepts Extension:
16907 simple-type-specifier:
16908 constrained-type-specifier
16910 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16911 appropriately updated. */
16913 static tree
16916 cp_parser_flags flags)
16917 {
16922 /* Peek at the next token. */
16925 /* If we're looking at a keyword, things are easy. */
16927 {
16962 {
16965 }
16994 {
16995 /* The 'auto' might be the placeholder return type for a function decl
16996 with trailing return type. */
17005 {
17007 {
17014 }
17017 {
17020 }
17023 }
17027 {
17030 }
17033 {
17036 }
17037 else
17041 {
17044 "use of %<auto%> in lambda parameter declaration "
17045 "only available with "
17047 }
17050 "use of %<auto%> in parameter declaration "
17051 "only available with "
17055 "use of %<auto%> in parameter declaration "
17057 }
17058 else
17063 /* Since DR 743, decltype can either be a simple-type-specifier by
17064 itself or begin a nested-name-specifier. Parsing it will replace
17065 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17066 handling below decide what to do. */
17072 /* Consume the `typeof' token. */
17074 /* Parse the operand to `typeof'. */
17076 /* If it is not already a TYPE, take its type. */
17082 token,
17091 token,
17101 token,
17106 }
17108 /* If token is an already-parsed decltype not followed by ::,
17109 it's a simple-type-specifier. */
17112 {
17115 {
17117 token,
17119 /* Remember that we are handling a decltype in order to
17120 implement the resolution of DR 1510 when the argument
17121 isn't instantiation dependent. */
17123 }
17126 }
17128 /* If the type-specifier was for a built-in type, we're done. */
17130 {
17131 /* Record the type. */
17138 type,
17139 token,
17144 /* Consume the token. */
17150 /* There is no valid C++ program where a non-template type is
17151 followed by a "<". That usually indicates that the user thought
17152 that the type was a template. */
17157 }
17159 /* The type-specifier must be a user-defined type. */
17161 {
17165 /* Don't gobble tokens or issue error messages if this is an
17166 optional type-specifier. */
17172 /* Look for the optional `::' operator. */
17173 global_p
17177 /* Look for the nested-name specifier. */
17178 qualified_p
17185 /* If we have seen a nested-name-specifier, and the next token
17186 is `template', then we are using the template-id production. */
17189 {
17190 /* Look for the template-id. */
17194 none_type,
17196 /* If the template-id did not name a type, we are out of
17197 luck. */
17199 {
17202 }
17203 }
17204 /* Otherwise, look for a type-name. */
17205 else
17207 /* Keep track of all name-lookups performed in class scopes. */
17209 && !global_p
17210 && !qualified_p
17214 /* If it didn't work out, we don't have a TYPE. */
17219 {
17233 {
17235 none_type,
17245 else
17246 {
17251 }
17252 }
17253 else
17259 }
17262 token,
17264 }
17266 /* If we didn't get a type-name, issue an error message. */
17268 {
17271 }
17274 {
17275 /* See if TYPE is an Objective-C type, and if so, parse and
17276 accept any protocol references following it. Do this before
17277 the cp_parser_check_for_invalid_template_id() call, because
17278 Objective-C types can be followed by '<...>' which would
17279 enclose protocol names rather than template arguments, and so
17280 everything is fine. */
17283 {
17287 /* Clobber the "unqualified" type previously entered into
17288 DECL_SPECS with the new, improved protocol-qualified version. */
17293 }
17295 /* There is no valid C++ program where a non-template type is
17296 followed by a "<". That usually indicates that the user
17297 thought that the type was a template. */
17299 none_type,
17301 }
17304 }
17306 /* Parse a type-name.
17308 type-name:
17309 class-name
17310 enum-name
17311 typedef-name
17312 simple-template-id [in c++0x]
17314 enum-name:
17315 identifier
17317 typedef-name:
17318 identifier
17320 Concepts:
17322 type-name:
17323 concept-name
17324 partial-concept-id
17326 concept-name:
17327 identifier
17329 Returns a TYPE_DECL for the type. */
17331 static tree
17333 {
17335 }
17337 /* See above. */
17338 static tree
17340 {
17341 tree type_decl;
17343 /* We can't know yet whether it is a class-name or not. */
17345 /* Try a class-name. */
17347 typename_keyword_p,
17349 none_type,
17353 /* If it's not a class-name, keep looking. */
17355 {
17357 /* It must be a typedef-name or an enum-name. */
17361 /* It is either a simple-template-id representing an
17362 instantiation of an alias template... */
17366 none_type,
17368 /* Note that this must be an instantiation of an alias template
17369 because [temp.names]/6 says:
17371 A template-id that names an alias template specialization
17372 is a type-name.
17374 Whereas [temp.names]/7 says:
17376 A simple-template-id that names a class template
17377 specialization is a class-name.
17379 With concepts, this could also be a partial-concept-id that
17380 declares a non-type template parameter. */
17387 else
17391 /* ... Or a typedef-name or an enum-name. */
17393 }
17396 }
17398 /* Check if DECL and ARGS can form a constrained-type-specifier.
17399 If ARGS is non-null, we try to form a concept check of the
17400 form DECL<?, ARGS> where ? is a wildcard that matches any
17401 kind of template argument. If ARGS is NULL, then we try to
17402 form a concept check of the form DECL<?>. */
17404 static tree
17407 {
17410 /* If we a constrained-type-specifier cannot be deduced. */
17414 /* A constrained type specifier can only be found in an
17415 overload set or as a reference to a template declaration.
17417 FIXME: This might be masking a bug. It's possible that
17418 that the deduction below is causing template specializations
17419 to be formed with the wildcard as an argument. */
17423 /* Try to build a call expression that evaluates the
17424 concept. This can fail if the overload set refers
17425 only to non-templates. */
17431 /* Deduce the checked constraint and the prototype parameter.
17433 FIXME: In certain cases, failure to deduce should be a
17434 diagnosable error. */
17435 tree conc;
17436 tree proto;
17440 /* In template parameter scope, this results in a constrained
17441 parameter. Return a descriptor of that parm. */
17445 /* In a parameter-declaration-clause, constrained-type
17446 specifiers result in invented template parameters. */
17448 {
17451 }
17452 else
17453 {
17454 /* Otherwise, we're in a context where the constrained
17455 type name is deduced and the constraint applies
17456 after deduction. */
17458 }
17461 }
17463 /* If DECL refers to a concept, return a TYPE_DECL representing
17464 the result of using the constrained type specifier in the
17465 current context. DECL refers to a concept if
17467 - it is an overload set containing a function concept taking a single
17468 type argument, or
17470 - it is a variable concept taking a single type argument. */
17472 static tree
17474 {
17480 else
17482 }
17484 /* Check if DECL and ARGS form a partial-concept-id. If so,
17485 assign ID to the resulting constrained placeholder.
17487 Returns true if the partial-concept-id designates a placeholder
17488 and false otherwise. Note that *id is set to NULL_TREE in
17489 this case. */
17491 static tree
17493 {
17495 }
17497 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17498 or a concept-name.
17500 enum-name:
17501 identifier
17503 typedef-name:
17504 identifier
17506 concept-name:
17507 identifier
17509 Returns a TYPE_DECL for the type. */
17511 static tree
17513 {
17514 tree type_decl;
17515 tree identifier;
17522 /* Look up the type-name. */
17527 /* If we found an overload set, then it may refer to a concept-name. */
17533 {
17534 /* See if this is an Objective-C type. */
17539 }
17541 /* Issue an error if we did not find a type-name. */
17543 /* In Objective-C, we have the complication that class names are
17544 normally type names and start declarations (eg, the
17545 "NSObject" in "NSObject *object;"), but can be used in an
17546 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17547 is an expression. So, a classname followed by a dot is not a
17548 valid type-name. */
17551 {
17556 }
17557 /* Remember that the name was used in the definition of the
17558 current class so that we can check later to see if the
17559 meaning would have been different after the class was
17560 entirely defined. */
17566 }
17568 /* Parse an elaborated-type-specifier. Note that the grammar given
17569 here incorporates the resolution to DR68.
17571 elaborated-type-specifier:
17572 class-key :: [opt] nested-name-specifier [opt] identifier
17573 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17574 enum-key :: [opt] nested-name-specifier [opt] identifier
17575 typename :: [opt] nested-name-specifier identifier
17576 typename :: [opt] nested-name-specifier template [opt]
17577 template-id
17579 GNU extension:
17581 elaborated-type-specifier:
17582 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17583 class-key attributes :: [opt] nested-name-specifier [opt]
17584 template [opt] template-id
17585 enum attributes :: [opt] nested-name-specifier [opt] identifier
17587 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17588 declared `friend'. If IS_DECLARATION is TRUE, then this
17589 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17590 something is being declared.
17592 Returns the TYPE specified. */
17594 static tree
17598 {
17600 tree identifier;
17603 tree globalscope;
17606 /* See if we're looking at the `enum' keyword. */
17608 {
17609 /* Consume the `enum' token. */
17611 /* Remember that it's an enumeration type. */
17613 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17614 enums) is used here. */
17618 {
17625 /* Consume the `struct' or `class' and parse it anyway. */
17627 }
17628 /* Parse the attributes. */
17630 }
17631 /* Or, it might be `typename'. */
17633 RID_TYPENAME))
17634 {
17635 /* Consume the `typename' token. */
17637 /* Remember that it's a `typename' type. */
17639 }
17640 /* Otherwise it must be a class-key. */
17641 else
17642 {
17646 /* Parse the attributes. */
17648 }
17650 /* Look for the `::' operator. */
17653 /* Look for the nested-name-specifier. */
17654 tree nested_name_specifier;
17656 {
17657 nested_name_specifier
17662 is_declaration);
17665 }
17666 else
17667 /* Even though `typename' is not present, the proposed resolution
17668 to Core Issue 180 says that in `class A<T>::B', `B' should be
17669 considered a type-name, even if `A<T>' is dependent. */
17670 nested_name_specifier
17675 is_declaration);
17676 /* For everything but enumeration types, consider a template-id.
17677 For an enumeration type, consider only a plain identifier. */
17679 {
17681 tree decl;
17683 /* Allow the `template' keyword. */
17685 /* If we didn't see `template', we don't know if there's a
17686 template-id or not. */
17689 /* Parse the template-id. */
17693 tag_type,
17694 is_declaration);
17695 /* If we didn't find a template-id, look for an ordinary
17696 identifier. */
17698 ;
17699 /* We can get here when cp_parser_template_id, called by
17700 cp_parser_class_name with tag_type == none_type, succeeds
17701 and caches a BASELINK. Then, when called again here,
17702 instead of failing and returning an error_mark_node
17703 returns it (see template/typename17.C in C++11).
17704 ??? Could we diagnose this earlier? */
17706 {
17709 }
17710 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17711 in effect, then we must assume that, upon instantiation, the
17712 template will correspond to a class. */
17716 typename_type,
17718 /* If the `typename' keyword is in effect and DECL is not a type
17719 decl, then type is non existent. */
17721 ;
17723 {
17727 /* If the next token is a semicolon, this must be a specialization,
17728 instantiation, or friend declaration. Check the scope while we
17729 still know whether or not we had a nested-name-specifier. */
17734 }
17737 }
17740 {
17745 {
17748 }
17750 /* For a `typename', we needn't call xref_tag. */
17756 /* Template parameter lists apply only if we are not within a
17757 function parameter list. */
17758 bool template_parm_lists_apply
17767 /* Look up a qualified name in the usual way. */
17769 {
17770 tree decl;
17771 tree ambiguous_decls;
17774 tag_type,
17781 /* If the lookup was ambiguous, an error will already have been
17782 issued. */
17786 /* If we are parsing friend declaration, DECL may be a
17787 TEMPLATE_DECL tree node here. However, we need to check
17788 whether this TEMPLATE_DECL results in valid code. Consider
17789 the following example:
17791 namespace N {
17792 template <class T> class C {};
17793 }
17794 class X {
17795 template <class T> friend class N::C; // #1, valid code
17796 };
17797 template <class T> class Y {
17798 friend class N::C; // #2, invalid code
17799 };
17801 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17802 name lookup of `N::C'. We see that friend declaration must
17803 be template for the code to be valid. Note that
17804 processing_template_decl does not work here since it is
17805 always 1 for the above two cases. */
17807 decl = (cp_parser_maybe_treat_template_as_class
17812 {
17814 identifier,
17817 }
17820 {
17824 allow_template);
17828 }
17830 /* Forward declarations of nested types, such as
17832 class C1::C2;
17833 class C1::C2::C3;
17835 are invalid unless all components preceding the final '::'
17836 are complete. If all enclosing types are complete, these
17837 declarations become merely pointless.
17839 Invalid forward declarations of nested types are errors
17840 caught elsewhere in parsing. Those that are pointless arrive
17841 here. */
17848 }
17849 else
17850 {
17851 /* An elaborated-type-specifier sometimes introduces a new type and
17852 sometimes names an existing type. Normally, the rule is that it
17853 introduces a new type only if there is not an existing type of
17854 the same name already in scope. For example, given:
17856 struct S {};
17857 void f() { struct S s; }
17859 the `struct S' in the body of `f' is the same `struct S' as in
17860 the global scope; the existing definition is used. However, if
17861 there were no global declaration, this would introduce a new
17862 local class named `S'.
17864 An exception to this rule applies to the following code:
17866 namespace N { struct S; }
17868 Here, the elaborated-type-specifier names a new type
17869 unconditionally; even if there is already an `S' in the
17870 containing scope this declaration names a new type.
17871 This exception only applies if the elaborated-type-specifier
17872 forms the complete declaration:
17874 [class.name]
17876 A declaration consisting solely of `class-key identifier ;' is
17877 either a redeclaration of the name in the current scope or a
17878 forward declaration of the identifier as a class name. It
17879 introduces the name into the current scope.
17881 We are in this situation precisely when the next token is a `;'.
17883 An exception to the exception is that a `friend' declaration does
17884 *not* name a new type; i.e., given:
17886 struct S { friend struct T; };
17888 `T' is not a new type in the scope of `S'.
17890 Also, `new struct S' or `sizeof (struct S)' never results in the
17891 definition of a new type; a new type can only be declared in a
17892 declaration context. */
17894 tag_scope ts;
17898 /* Friends have special name lookup rules. */
17902 CPP_SEMICOLON))
17903 /* This is a `class-key identifier ;' */
17905 else
17908 template_p =
17909 (template_parm_lists_apply
17912 /* An unqualified name was used to reference this type, so
17913 there were no qualifying templates. */
17921 }
17922 }
17927 /* Allow attributes on forward declarations of classes. */
17929 {
17939 else
17942 }
17945 {
17946 /* Indicate whether this class was declared as a `class' or as a
17947 `struct'. */
17951 }
17953 /* A "<" cannot follow an elaborated type specifier. If that
17954 happens, the user was probably trying to form a template-id. */
17959 }
17961 /* Parse an enum-specifier.
17963 enum-specifier:
17964 enum-head { enumerator-list [opt] }
17965 enum-head { enumerator-list , } [C++0x]
17967 enum-head:
17968 enum-key identifier [opt] enum-base [opt]
17969 enum-key nested-name-specifier identifier enum-base [opt]
17971 enum-key:
17972 enum
17973 enum class [C++0x]
17974 enum struct [C++0x]
17976 enum-base: [C++0x]
17977 : type-specifier-seq
17979 opaque-enum-specifier:
17980 enum-key identifier enum-base [opt] ;
17982 GNU Extensions:
17983 enum-key attributes[opt] identifier [opt] enum-base [opt]
17984 { enumerator-list [opt] }attributes[opt]
17985 enum-key attributes[opt] identifier [opt] enum-base [opt]
17986 { enumerator-list, }attributes[opt] [C++0x]
17988 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17989 if the token stream isn't an enum-specifier after all. */
17991 static tree
17993 {
17994 tree identifier;
17996 tree prev_scope;
17998 tree attributes;
18011 /* Parse tentatively so that we can back up if we don't find a
18012 enum-specifier. */
18015 /* Caller guarantees that the current token is 'enum', an identifier
18016 possibly follows, and the token after that is an opening brace.
18017 If we don't have an identifier, fabricate an anonymous name for
18018 the enumeration being defined. */
18021 /* Parse the "class" or "struct", which indicates a scoped
18022 enumeration type in C++0x. */
18025 {
18029 /* Consume the `struct' or `class' token. */
18033 }
18037 /* Clear the qualification. */
18042 /* Figure out in what scope the declaration is being placed. */
18048 nested_name_specifier
18056 {
18057 tree name;
18061 enum_type,
18066 input_location);
18068 {
18071 {
18072 /* Are template enums allowed in ISO? */
18076 /* ignore a typename reference, for it will be solved by name
18077 in start_enum. */
18079 }
18080 }
18083 else
18084 {
18089 }
18090 }
18091 else
18092 {
18095 else
18096 {
18102 }
18103 }
18106 /* Check for the `:' that denotes a specified underlying type in C++0x.
18107 Note that a ':' could also indicate a bitfield width, however. */
18109 {
18110 cp_decl_specifier_seq type_specifiers;
18112 /* Consume the `:'. */
18115 /* Parse the type-specifier-seq. */
18120 /* At this point this is surely not elaborated type specifier. */
18129 /* If that didn't work, stop. */
18131 {
18137 }
18138 }
18140 /* Look for the `{' but don't consume it yet. */
18142 {
18144 {
18147 {
18150 }
18151 }
18152 /* An opaque-enum-specifier must have a ';' here. */
18155 {
18158 {
18161 }
18162 }
18163 }
18169 {
18171 {
18175 }
18177 {
18179 }
18180 }
18182 /* Issue an error message if type-definitions are forbidden here. */
18185 else
18186 /* Create the new type. We do this before consuming the opening
18187 brace so the enum will be recorded as being on the line of its
18188 tag (or the 'enum' keyword, if there is no tag). */
18192 /* If the next token is not '{' it is an opaque-enum-specifier or an
18193 elaborated-type-specifier. */
18195 {
18199 {
18200 /* The following catches invalid code such as:
18201 enum class S<int>::E { A, B, C }; */
18209 {
18213 nested_name_specifier);
18215 }
18218 {
18220 "%qT for enum declaration does not name a class "
18223 }
18224 /* If that scope does not contain the scope in which the
18225 class was originally declared, the program is invalid. */
18227 nested_name_specifier))
18228 {
18231 "declaration of %qD in namespace %qD which does not "
18234 else
18236 "declaration of %qD in %qD which does not "
18240 }
18241 /* If that scope is the scope where the declaration is being placed
18242 the program is invalid. */
18246 {
18250 }
18251 }
18256 /* Consume the opening brace. */
18257 matching_braces braces;
18264 {
18268 }
18269 else
18270 {
18276 }
18280 /* If the next token is not '}', then there are some enumerators. */
18282 {
18286 }
18287 else
18290 /* Consume the final '}'. */
18296 }
18297 else
18298 {
18299 /* If a ';' follows, then it is an opaque-enum-specifier
18300 and additional restrictions apply. */
18302 {
18309 }
18310 }
18312 /* Look for trailing attributes to apply to this enumeration, and
18313 apply them if appropriate. */
18315 {
18318 trailing_attr,
18320 }
18322 /* Finish up the enumeration. */
18324 {
18329 }
18332 {
18334 {
18337 }
18339 {
18341 }
18342 }
18343 out:
18346 }
18348 /* Parse an enumerator-list. The enumerators all have the indicated
18349 TYPE.
18351 enumerator-list:
18352 enumerator-definition
18353 enumerator-list , enumerator-definition */
18355 static void
18357 {
18359 {
18360 /* Parse an enumerator-definition. */
18363 /* If the next token is not a ',', we've reached the end of
18364 the list. */
18367 /* Otherwise, consume the `,' and keep going. */
18369 /* If the next token is a `}', there is a trailing comma. */
18371 {
18376 }
18377 }
18378 }
18380 /* Parse an enumerator-definition. The enumerator has the indicated
18381 TYPE.
18383 enumerator-definition:
18384 enumerator
18385 enumerator = constant-expression
18387 enumerator:
18388 identifier
18390 GNU Extensions:
18392 enumerator-definition:
18393 enumerator attributes [opt]
18394 enumerator attributes [opt] = constant-expression */
18396 static void
18398 {
18399 tree identifier;
18400 tree value;
18401 location_t loc;
18403 /* Save the input location because we are interested in the location
18404 of the identifier and not the location of the explicit value. */
18407 /* Look for the identifier. */
18412 /* Parse any specified attributes. */
18415 /* If the next token is an '=', then there is an explicit value. */
18417 {
18418 /* Consume the `=' token. */
18420 /* Parse the value. */
18422 }
18423 else
18426 /* If we are processing a template, make sure the initializer of the
18427 enumerator doesn't contain any bare template parameter pack. */
18431 /* Create the enumerator. */
18433 }
18435 /* Parse a namespace-name.
18437 namespace-name:
18438 original-namespace-name
18439 namespace-alias
18441 Returns the NAMESPACE_DECL for the namespace. */
18443 static tree
18445 {
18446 tree identifier;
18447 tree namespace_decl;
18451 /* Get the name of the namespace. */
18456 /* Look up the identifier in the currently active scope. Look only
18457 for namespaces, due to:
18459 [basic.lookup.udir]
18461 When looking up a namespace-name in a using-directive or alias
18462 definition, only namespace names are considered.
18464 And:
18466 [basic.lookup.qual]
18468 During the lookup of a name preceding the :: scope resolution
18469 operator, object, function, and enumerator names are ignored.
18471 (Note that cp_parser_qualifying_entity only calls this
18472 function if the token after the name is the scope resolution
18473 operator.) */
18475 none_type,
18481 /* If it's not a namespace, issue an error. */
18484 {
18486 {
18492 }
18495 }
18498 }
18500 /* Parse a namespace-definition.
18502 namespace-definition:
18503 named-namespace-definition
18504 unnamed-namespace-definition
18506 named-namespace-definition:
18507 original-namespace-definition
18508 extension-namespace-definition
18510 original-namespace-definition:
18511 namespace identifier { namespace-body }
18513 extension-namespace-definition:
18514 namespace original-namespace-name { namespace-body }
18516 unnamed-namespace-definition:
18517 namespace { namespace-body } */
18519 static void
18521 {
18522 tree identifier;
18531 {
18534 }
18536 /* Look for the `namespace' keyword. */
18537 cp_token* token
18540 /* Parse any specified attributes before the identifier. */
18544 {
18548 {
18551 /* Parse any attributes specified after the identifier. */
18553 }
18560 "nested namespace definitions only available with "
18563 /* Nested namespace names can create new namespaces (unlike
18564 other qualified-ids). */
18567 else
18570 }
18582 /* Start the namespace. */
18589 /* Look for the `{' to validate starting the namespace. */
18590 matching_braces braces;
18592 {
18593 /* Parse the body of the namespace. */
18596 /* Look for the final `}'. */
18598 }
18603 /* Pop the nested namespace definitions. */
18606 }
18608 /* Parse a namespace-body.
18610 namespace-body:
18611 declaration-seq [opt] */
18613 static void
18615 {
18617 }
18619 /* Parse a namespace-alias-definition.
18621 namespace-alias-definition:
18622 namespace identifier = qualified-namespace-specifier ; */
18624 static void
18626 {
18627 tree identifier;
18628 tree namespace_specifier;
18632 /* Look for the `namespace' keyword. */
18634 /* Look for the identifier. */
18638 /* Look for the `=' token. */
18641 {
18643 /* Skip the definition. */
18648 }
18650 /* Look for the qualified-namespace-specifier. */
18651 namespace_specifier
18653 /* Look for the `;' token. */
18656 /* Register the alias in the symbol table. */
18658 }
18660 /* Parse a qualified-namespace-specifier.
18662 qualified-namespace-specifier:
18663 :: [opt] nested-name-specifier [opt] namespace-name
18665 Returns a NAMESPACE_DECL corresponding to the specified
18666 namespace. */
18668 static tree
18670 {
18671 /* Look for the optional `::'. */
18675 /* Look for the optional nested-name-specifier. */
18683 }
18685 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18686 access declaration.
18688 using-declaration:
18689 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18690 using :: unqualified-id ;
18692 access-declaration:
18693 qualified-id ;
18695 */
18697 static bool
18700 {
18704 tree decl;
18705 tree identifier;
18706 tree qscope;
18711 {
18714 }
18715 else
18716 {
18717 /* Look for the `using' keyword. */
18720 again:
18721 /* Peek at the next token. */
18723 /* See if it's `typename'. */
18725 {
18726 /* Remember that we've seen it. */
18728 /* Consume the `typename' token. */
18730 }
18731 }
18733 /* Look for the optional global scope qualification. */
18734 global_scope_p
18739 /* If we saw `typename', or didn't see `::', then there must be a
18740 nested-name-specifier present. */
18742 {
18748 {
18751 }
18752 }
18753 /* Otherwise, we could be in either of the two productions. In that
18754 case, treat the nested-name-specifier as optional. */
18755 else
18767 /* Something has already gone wrong; there's no need to parse
18768 further. Since an error has occurred, the return value of
18769 cp_parser_parse_definitely will be false, as required. */
18773 /* Parse the unqualified-id. */
18781 {
18786 }
18788 {
18793 "pack expansion in using-declaration only available "
18796 }
18798 /* The function we call to handle a using-declaration is different
18799 depending on what scope we are in. */
18801 ;
18804 /* [namespace.udecl]
18806 A using declaration shall not name a template-id. */
18809 else
18810 {
18812 {
18813 /* Create the USING_DECL. */
18820 {
18823 }
18824 else
18825 /* Add it to the list of members in this class. */
18827 }
18828 else
18829 {
18831 identifier,
18838 {
18841 }
18844 else
18846 }
18847 }
18851 {
18855 "comma-separated list in using-declaration only available "
18858 }
18860 /* Look for the final `;'. */
18865 "access declarations are deprecated "
18866 "in favour of using-declarations; "
18870 }
18872 /* Parse an alias-declaration.
18874 alias-declaration:
18875 using identifier attribute-specifier-seq [opt] = type-id */
18877 static tree
18879 {
18881 location_t id_location;
18883 cp_decl_specifier_seq decl_specs;
18887 /* Look for the `using' keyword. */
18888 cp_token *using_token
18910 /* Now we are going to parse the type-id of the declaration. */
18912 /*
18913 [dcl.type]/3 says:
18915 "A type-specifier-seq shall not define a class or enumeration
18916 unless it appears in the type-id of an alias-declaration (7.1.3) that
18917 is not the declaration of a template-declaration."
18919 In other words, if we currently are in an alias template, the
18920 type-id should not define a type.
18922 So let's set parser->type_definition_forbidden_message in that
18923 case; cp_parser_check_type_definition (called by
18924 cp_parser_class_specifier) will then emit an error if a type is
18925 defined in the type-id. */
18927 {
18931 }
18935 /* Restore the error message if need be. */
18941 {
18944 }
18946 /* A typedef-name can also be introduced by an alias-declaration. The
18947 identifier following the using keyword becomes a typedef-name. It has
18948 the same semantics as if it were introduced by the typedef
18949 specifier. In particular, it does not define a new type and it shall
18950 not appear in the type-id. */
18955 {
18958 ds_attribute,
18959 attrs_token);
18960 }
18962 ds_typedef,
18963 using_token);
18965 ds_alias,
18966 using_token);
18971 id_location,
18982 else
18988 // Attach constraints to the alias declaration.
18990 {
18994 }
19001 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19002 added into the symbol table; otherwise, return the TYPE_DECL. */
19006 {
19010 }
19013 }
19015 /* Parse a using-directive.
19017 using-directive:
19018 using namespace :: [opt] nested-name-specifier [opt]
19019 namespace-name ; */
19021 static void
19023 {
19024 tree namespace_decl;
19025 tree attribs;
19027 /* Look for the `using' keyword. */
19029 /* And the `namespace' keyword. */
19031 /* Look for the optional `::' operator. */
19033 /* And the optional nested-name-specifier. */
19039 /* Get the namespace being used. */
19041 /* And any specified attributes. */
19044 /* Update the symbol table. */
19047 else
19050 /* Look for the final `;'. */
19052 }
19054 /* Parse an asm-definition.
19056 asm-definition:
19057 asm ( string-literal ) ;
19059 GNU Extension:
19061 asm-definition:
19062 asm volatile [opt] ( string-literal ) ;
19063 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19064 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19065 : asm-operand-list [opt] ) ;
19066 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19067 : asm-operand-list [opt]
19068 : asm-clobber-list [opt] ) ;
19069 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19070 : asm-clobber-list [opt]
19071 : asm-goto-list ) ; */
19073 static void
19075 {
19076 tree string;
19081 tree asm_stmt;
19089 /* Look for the `asm' keyword. */
19094 {
19097 }
19099 /* See if the next token is `volatile'. */
19102 {
19103 /* Remember that we saw the `volatile' keyword. */
19105 /* Consume the token. */
19107 }
19111 {
19112 /* Remember that we saw the `goto' keyword. */
19114 /* Consume the token. */
19116 }
19117 /* Look for the opening `('. */
19120 /* Look for the string. */
19123 {
19127 }
19129 /* If we're allowing GNU extensions, check for the extended assembly
19130 syntax. Unfortunately, the `:' tokens need not be separated by
19131 a space in C, and so, for compatibility, we tolerate that here
19132 too. Doing that means that we have to treat the `::' operator as
19133 two `:' tokens. */
19138 {
19143 /* The extended syntax was used. */
19146 /* Look for outputs. */
19148 {
19149 /* Consume the `:'. */
19151 /* Parse the output-operands. */
19153 CPP_COLON)
19155 CPP_SCOPE)
19157 CPP_CLOSE_PAREN)
19159 {
19163 }
19164 }
19165 /* If the next token is `::', there are no outputs, and the
19166 next token is the beginning of the inputs. */
19168 /* The inputs are coming next. */
19171 /* Look for inputs. */
19174 {
19175 /* Consume the `:' or `::'. */
19177 /* Parse the output-operands. */
19179 CPP_COLON)
19181 CPP_SCOPE)
19183 CPP_CLOSE_PAREN))
19184 {
19188 }
19189 }
19191 /* The clobbers are coming next. */
19194 /* Look for clobbers. */
19197 {
19199 /* Consume the `:' or `::'. */
19201 /* Parse the clobbers. */
19203 CPP_COLON)
19205 CPP_CLOSE_PAREN))
19207 }
19210 /* The labels are coming next. */
19213 /* Look for labels. */
19216 {
19218 /* Consume the `:' or `::'. */
19220 /* Parse the labels. */
19222 }
19226 }
19230 /* Look for the closing `)'. */
19238 {
19239 /* Create the ASM_EXPR. */
19241 {
19244 /* If the extended syntax was not used, mark the ASM_EXPR. */
19246 {
19252 }
19253 }
19254 else
19256 }
19257 }
19259 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19260 type that comes from the decl-specifier-seq. */
19262 static tree
19264 {
19267 {
19280 }
19283 }
19285 /* Declarators [gram.dcl.decl] */
19287 /* Parse an init-declarator.
19289 init-declarator:
19290 declarator initializer [opt]
19292 GNU Extension:
19294 init-declarator:
19295 declarator asm-specification [opt] attributes [opt] initializer [opt]
19297 function-definition:
19298 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19299 function-body
19300 decl-specifier-seq [opt] declarator function-try-block
19302 GNU Extension:
19304 function-definition:
19305 __extension__ function-definition
19307 TM Extension:
19309 function-definition:
19310 decl-specifier-seq [opt] declarator function-transaction-block
19312 The DECL_SPECIFIERS apply to this declarator. Returns a
19313 representation of the entity declared. If MEMBER_P is TRUE, then
19314 this declarator appears in a class scope. The new DECL created by
19315 this declarator is returned.
19317 The CHECKS are access checks that should be performed once we know
19318 what entity is being declared (and, therefore, what classes have
19319 befriended it).
19321 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19322 for a function-definition here as well. If the declarator is a
19323 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19324 be TRUE upon return. By that point, the function-definition will
19325 have been completely parsed.
19327 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19328 is FALSE.
19330 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19331 parsed declaration if it is an uninitialized single declarator not followed
19332 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19333 if present, will not be consumed. If returned, this declarator will be
19334 created with SD_INITIALIZED but will not call cp_finish_decl.
19336 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19337 and there is an initializer, the pointed location_t is set to the
19338 location of the '=' or `(', or '{' in C++11 token introducing the
19339 initializer. */
19341 static tree
19352 {
19356 tree prefix_attributes;
19358 tree asm_specification;
19359 tree initializer;
19361 tree scope;
19363 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19364 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19365 "(...)". */
19376 /* Gather the attributes that were provided with the
19377 decl-specifiers. */
19380 /* Assume that this is not the declarator for a function
19381 definition. */
19385 /* Default arguments are only permitted for function parameters. */
19389 /* Defer access checks while parsing the declarator; we cannot know
19390 what names are accessible until we know what is being
19391 declared. */
19396 /* Parse the declarator. */
19397 declarator
19402 /* Gather up the deferred checks. */
19407 /* If the DECLARATOR was erroneous, there's no need to go
19408 further. */
19412 /* Check that the number of template-parameter-lists is OK. */
19422 /* Figure out what scope the entity declared by the DECLARATOR is
19423 located in. `grokdeclarator' sometimes changes the scope, so
19424 we compute it now. */
19427 /* Perform any lookups in the declared type which were thought to be
19428 dependent, but are not in the scope of the declarator. */
19429 decl_specifiers->type
19432 /* If we're allowing GNU extensions, look for an
19433 asm-specification. */
19435 {
19436 /* Look for an asm-specification. */
19439 }
19440 else
19443 /* Look for attributes. */
19447 /* Peek at the next token. */
19453 {
19454 /* Handle C++17 deduction guides. */
19458 {
19466 {
19470 }
19471 }
19473 /* Check to see if the token indicates the start of a
19474 function-definition. */
19476 {
19478 {
19479 /* If a function-definition should not appear here, issue an
19480 error message. */
19484 }
19486 location_t func_brace_location
19489 /* Neither attributes nor an asm-specification are allowed
19490 on a function-definition. */
19493 "an asm-specification is not allowed "
19497 "attributes are not allowed "
19499 /* This is a function-definition. */
19502 /* Parse the function definition. */
19505 decl_specifiers,
19506 declarator,
19507 prefix_attributes);
19508 else
19509 decl =
19510 (cp_parser_function_definition_from_specifiers_and_declarator
19514 {
19515 /* This is where the prologue starts... */
19518 }
19521 }
19522 }
19524 {
19525 /* A non-template declaration involving a function parameter list
19526 containing an implicit template parameter will be made into a
19527 template. If the resulting declaration is not going to be an
19528 actual function then finish the template scope here to prevent it.
19529 An error message will be issued once we have a decl to talk about.
19531 FIXME probably we should do type deduction rather than create an
19532 implicit template, but the standard currently doesn't allow it. */
19535 }
19537 /* [dcl.dcl]
19539 Only in function declarations for constructors, destructors, type
19540 conversions, and deduction guides can the decl-specifier-seq be omitted.
19542 We explicitly postpone this check past the point where we handle
19543 function-definitions because we tolerate function-definitions
19544 that are missing their return types in some modes. */
19546 {
19550 }
19552 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19556 {
19567 {
19573 }
19574 }
19575 else
19576 {
19577 /* If the init-declarator isn't initialized and isn't followed by a
19578 `,' or `;', it's not a valid init-declarator. */
19581 {
19584 else
19585 {
19589 }
19590 }
19593 }
19595 /* Because start_decl has side-effects, we should only call it if we
19596 know we're going ahead. By this point, we know that we cannot
19597 possibly be looking at any other construct. */
19600 /* Enter the newly declared entry in the symbol table. If we're
19601 processing a declaration in a class-specifier, we wait until
19602 after processing the initializer. */
19604 {
19612 /* Adjust location of decl if declarator->id_loc is more appropriate:
19613 set, and decl wasn't merged with another decl, in which case its
19614 location would be different from input_location, and more accurate. */
19619 }
19621 /* Enter the SCOPE. That way unqualified names appearing in the
19622 initializer will be looked up in SCOPE. */
19625 /* Perform deferred access control checks, now that we know in which
19626 SCOPE the declared entity resides. */
19628 {
19631 /* If the entity being declared is a function, pretend that we
19632 are in its scope. If it is a `friend', it may have access to
19633 things that would not otherwise be accessible. */
19635 {
19638 }
19640 /* Perform access checks for template parameters. */
19643 /* Perform the access control checks for the declarator and the
19644 decl-specifiers. */
19647 /* Restore the saved value. */
19650 }
19652 /* Parse the initializer. */
19657 {
19659 {
19662 else
19663 {
19664 /* If the declaration was erroneous, we don't really
19665 know what the user intended, so just silently
19666 consume the initializer. */
19673 }
19674 }
19675 else
19676 {
19677 /* We want to record the extra mangling scope for in-class
19678 initializers of class members and initializers of static data
19679 member templates. The former involves deferring
19680 parsing of the initializer until end of class as with default
19681 arguments. So right here we only handle the latter. */
19691 }
19692 }
19694 /* The old parser allows attributes to appear after a parenthesized
19695 initializer. Mark Mitchell proposed removing this functionality
19696 on the GCC mailing lists on 2002-08-13. This parser accepts the
19697 attributes -- but ignores them. Made a permerror in GCC 8. */
19703 {
19706 {
19710 }
19711 }
19713 /* And now complain about a non-function implicit template. */
19718 /* For an in-class declaration, use `grokfield' to create the
19719 declaration. */
19721 {
19723 {
19726 }
19735 }
19737 /* Finish processing the declaration. But, skip member
19738 declarations. */
19740 {
19743 asm_specification,
19744 /* If the initializer is in parentheses, then this is
19745 a direct-initialization, which means that an
19746 `explicit' constructor is OK. Otherwise, an
19747 `explicit' constructor cannot be used. */
19750 }
19753 /* Core issue #226 (C++0x only): A default template-argument
19754 shall not be specified in a friend class template
19755 declaration. */
19764 {
19767 else
19769 }
19776 }
19778 /* Parse a declarator.
19780 declarator:
19781 direct-declarator
19782 ptr-operator declarator
19784 abstract-declarator:
19785 ptr-operator abstract-declarator [opt]
19786 direct-abstract-declarator
19788 GNU Extensions:
19790 declarator:
19791 attributes [opt] direct-declarator
19792 attributes [opt] ptr-operator declarator
19794 abstract-declarator:
19795 attributes [opt] ptr-operator abstract-declarator [opt]
19796 attributes [opt] direct-abstract-declarator
19798 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19799 detect constructors, destructors, deduction guides, or conversion operators.
19800 It is set to -1 if the declarator is a name, and +1 if it is a
19801 function. Otherwise it is set to zero. Usually you just want to
19802 test for >0, but internally the negative value is used.
19804 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19805 a decl-specifier-seq unless it declares a constructor, destructor,
19806 or conversion. It might seem that we could check this condition in
19807 semantic analysis, rather than parsing, but that makes it difficult
19808 to handle something like `f()'. We want to notice that there are
19809 no decl-specifiers, and therefore realize that this is an
19810 expression, not a declaration.)
19812 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19813 the declarator is a direct-declarator of the form "(...)".
19815 MEMBER_P is true iff this declarator is a member-declarator.
19817 FRIEND_P is true iff this declarator is a friend. */
19821 cp_parser_declarator_kind dcl_kind,
19825 {
19828 cp_cv_quals cv_quals;
19829 tree class_type;
19832 /* Assume this is not a constructor, destructor, or type-conversion
19833 operator. */
19840 /* Check for the ptr-operator production. */
19842 /* Parse the ptr-operator. */
19848 /* If that worked, then we have a ptr-operator. */
19850 {
19851 /* If a ptr-operator was found, then this declarator was not
19852 parenthesized. */
19855 /* The dependent declarator is optional if we are parsing an
19856 abstract-declarator. */
19860 /* Parse the dependent declarator. */
19865 friend_p);
19867 /* If we are parsing an abstract-declarator, we must handle the
19868 case where the dependent declarator is absent. */
19873 declarator = cp_parser_make_indirect_declarator
19875 }
19876 /* Everything else is a direct-declarator. */
19877 else
19878 {
19881 CPP_OPEN_PAREN);
19883 ctor_dtor_or_conv_p,
19885 }
19890 }
19892 /* Parse a direct-declarator or direct-abstract-declarator.
19894 direct-declarator:
19895 declarator-id
19896 direct-declarator ( parameter-declaration-clause )
19897 cv-qualifier-seq [opt]
19898 ref-qualifier [opt]
19899 exception-specification [opt]
19900 direct-declarator [ constant-expression [opt] ]
19901 ( declarator )
19903 direct-abstract-declarator:
19904 direct-abstract-declarator [opt]
19905 ( parameter-declaration-clause )
19906 cv-qualifier-seq [opt]
19907 ref-qualifier [opt]
19908 exception-specification [opt]
19909 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19910 ( abstract-declarator )
19912 Returns a representation of the declarator. DCL_KIND is
19913 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19914 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19915 we are parsing a direct-declarator. It is
19916 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19917 of ambiguity we prefer an abstract declarator, as per
19918 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19919 as for cp_parser_declarator. */
19923 cp_parser_declarator_kind dcl_kind,
19926 {
19937 {
19938 /* Peek at the next token. */
19941 {
19942 /* This is either a parameter-declaration-clause, or a
19943 parenthesized declarator. When we know we are parsing a
19944 named declarator, it must be a parenthesized declarator
19945 if FIRST is true. For instance, `(int)' is a
19946 parameter-declaration-clause, with an omitted
19947 direct-abstract-declarator. But `((*))', is a
19948 parenthesized abstract declarator. Finally, when T is a
19949 template parameter `(T)' is a
19950 parameter-declaration-clause, and not a parenthesized
19951 named declarator.
19953 We first try and parse a parameter-declaration-clause,
19954 and then try a nested declarator (if FIRST is true).
19956 It is not an error for it not to be a
19957 parameter-declaration-clause, even when FIRST is
19958 false. Consider,
19960 int i (int);
19961 int i (3);
19963 The first is the declaration of a function while the
19964 second is the definition of a variable, including its
19965 initializer.
19967 Having seen only the parenthesis, we cannot know which of
19968 these two alternatives should be selected. Even more
19969 complex are examples like:
19971 int i (int (a));
19972 int i (int (3));
19974 The former is a function-declaration; the latter is a
19975 variable initialization.
19977 Thus again, we try a parameter-declaration-clause, and if
19978 that fails, we back out and return. */
19981 {
19982 tree params;
19987 /* In a member-declarator, the only valid interpretation
19988 of a parenthesis is the start of a
19989 parameter-declaration-clause. (It is invalid to
19990 initialize a static data member with a parenthesized
19991 initializer; only the "=" form of initialization is
19992 permitted.) */
19996 /* Consume the `('. */
19997 matching_parens parens;
20000 {
20001 /* If this is going to be an abstract declarator, we're
20002 in a declarator and we can't have default args. */
20005 }
20009 /* Parse the parameter-declaration-clause. */
20012 /* Consume the `)'. */
20015 /* If all went well, parse the cv-qualifier-seq,
20016 ref-qualifier and the exception-specification. */
20018 {
20019 cp_cv_quals cv_quals;
20020 cp_virt_specifiers virt_specifiers;
20021 cp_ref_qualifier ref_qual;
20022 tree exception_specification;
20023 tree late_return;
20024 tree attrs;
20034 /* Parse the cv-qualifier-seq. */
20036 /* Parse the ref-qualifier. */
20038 /* Parse the tx-qualifier. */
20040 /* And the exception-specification. */
20041 exception_specification
20046 /* In here, we handle cases where attribute is used after
20047 the function declaration. For example:
20048 void func (int x) __attribute__((vector(..))); */
20051 late_return = (cp_parser_late_return_type_opt
20055 /* Parse the virt-specifier-seq. */
20058 /* Create the function-declarator. */
20060 params,
20061 cv_quals,
20062 virt_specifiers,
20063 ref_qual,
20064 tx_qual,
20065 exception_specification,
20066 late_return,
20067 requires_clause);
20070 /* Any subsequent parameter lists are to do with
20071 return type, so are not those of the declared
20072 function. */
20074 }
20076 /* Remove the function parms from scope. */
20080 /* Repeat the main loop. */
20082 }
20084 /* If this is the first, we can try a parenthesized
20085 declarator. */
20087 {
20094 /* Consume the `('. */
20095 matching_parens parens;
20097 /* Parse the nested declarator. */
20100 declarator
20106 /* Expect a `)'. */
20114 }
20115 /* Otherwise, we must be done. */
20116 else
20118 }
20122 {
20123 /* Parse an array-declarator. */
20133 /* Consume the `['. */
20135 /* Peek at the next token. */
20137 /* If the next token is `]', then there is no
20138 constant-expression. */
20140 {
20142 bounds
20152 {
20153 /* Normally, the array bound must be an integral constant
20154 expression. However, as an extension, we allow VLAs
20155 in function scopes as long as they aren't part of a
20156 parameter declaration. */
20160 }
20163 {
20164 /* Remember this wasn't a constant-expression. */
20167 }
20168 }
20169 else
20171 /* Look for the closing `]'. */
20173 {
20176 }
20181 }
20183 {
20184 {
20185 tree qualifying_scope;
20186 tree unqualified_name;
20187 tree attrs;
20188 special_function_kind sfk;
20193 /* Parse a declarator-id */
20196 {
20199 /* If we see an ellipsis, we should be looking at a
20200 parameter pack. */
20202 {
20203 /* Consume the `...' */
20207 }
20208 }
20211 unqualified_name
20215 {
20219 {
20220 /* Check whether an error occurred. */
20223 /* We already consumed the ellipsis to mark a
20224 parameter pack, but we have no way to report it,
20225 so abort the tentative parse. We will be exiting
20226 immediately anyway. */
20228 }
20229 else
20235 && (qualifying_scope
20237 {
20240 }
20241 }
20246 {
20251 }
20257 {
20258 /* In the declaration of a member of a template class
20259 outside of the class itself, the SCOPE will sometimes
20260 be a TYPENAME_TYPE. For example, given:
20262 template <typename T>
20263 int S<T>::R::i = 3;
20265 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20266 this context, we must resolve S<T>::R to an ordinary
20267 type, rather than a typename type.
20269 The reason we normally avoid resolving TYPENAME_TYPEs
20270 is that a specialization of `S' might render
20271 `S<T>::R' not a type. However, if `S' is
20272 specialized, then this `i' will not be used, so there
20273 is no harm in resolving the types here. */
20274 tree type;
20276 /* Resolve the TYPENAME_TYPE. */
20279 /* If that failed, the declarator is invalid. */
20281 {
20284 "cannot define member of dependent typedef "
20286 else
20291 }
20293 }
20298 {
20299 tree class_type;
20304 else
20308 {
20312 {
20313 /* We do not attempt to print the declarator
20314 here because we do not have enough
20315 information about its original syntactic
20316 form. */
20320 }
20323 {
20327 "use %<%T::%D%> instead of %<%T::%D%> to "
20329 class_type,
20334 }
20336 }
20339 {
20346 for an unnamed type, even if the type
20347 got a name for linkage purposes. */
20349 /* Handle correctly (c++/19200):
20351 struct S {
20352 struct T{};
20353 friend void S(T);
20354 };
20356 and also:
20358 namespace N {
20359 void S();
20360 }
20362 struct S {
20363 friend void N::S();
20364 }; */
20367 class_type))
20376 }
20377 }
20379 unqualified_name,
20380 sfk);
20387 }
20389 handle_declarator:;
20392 {
20393 /* Any names that appear after the declarator-id for a
20394 member are looked up in the containing scope. */
20396 {
20397 /* But declarations with qualified-ids can't appear in a
20398 function. */
20402 }
20404 }
20408 /* Default args are only allowed on function
20409 declarations. */
20411 else
20415 }
20416 /* We're done. */
20417 else
20419 }
20421 /* For an abstract declarator, we might wind up with nothing at this
20422 point. That's an error; the declarator is not optional. */
20426 {
20427 /* Record overly parenthesized declarator so we can give a
20428 diagnostic about confusing decl/expr disambiguation. */
20430 {
20431 /* If the open and close parens are on different lines, this
20432 is probably a formatting thing, so ignore. */
20437 }
20440 }
20442 /* If we entered a scope, we must exit it now. */
20450 }
20452 /* Parse a ptr-operator.
20454 ptr-operator:
20455 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20456 * cv-qualifier-seq [opt]
20457 &
20458 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20459 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20461 GNU Extension:
20463 ptr-operator:
20464 & cv-qualifier-seq [opt]
20466 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20467 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20468 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20469 filled in with the TYPE containing the member. *CV_QUALS is
20470 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20471 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20472 Note that the tree codes returned by this function have nothing
20473 to do with the types of trees that will be eventually be created
20474 to represent the pointer or reference type being parsed. They are
20475 just constants with suggestive names. */
20476 static enum tree_code
20481 {
20486 /* Assume that it's not a pointer-to-member. */
20488 /* And that there are no cv-qualifiers. */
20491 /* Peek at the next token. */
20494 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20504 {
20505 /* Consume the `*', `&' or `&&'. */
20508 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20509 `&', if we are allowing GNU extensions. (The only qualifier
20510 that can legally appear after `&' is `restrict', but that is
20511 enforced during semantic analysis. */
20519 }
20520 else
20521 {
20522 /* Try the pointer-to-member case. */
20524 /* Look for the optional `::' operator. */
20527 /* Look for the nested-name specifier. */
20534 /* If we found it, and the next token is a `*', then we are
20535 indeed looking at a pointer-to-member operator. */
20538 {
20539 /* Indicate that the `*' operator was used. */
20547 else
20548 {
20549 /* The type of which the member is a member is given by the
20550 current SCOPE. */
20552 /* The next name will not be qualified. */
20556 /* Look for optional c++11 attributes. */
20560 /* Look for the optional cv-qualifier-seq. */
20562 }
20563 }
20564 /* If that didn't work we don't have a ptr-operator. */
20567 }
20570 }
20572 /* Parse an (optional) cv-qualifier-seq.
20574 cv-qualifier-seq:
20575 cv-qualifier cv-qualifier-seq [opt]
20577 cv-qualifier:
20578 const
20579 volatile
20581 GNU Extension:
20583 cv-qualifier:
20584 __restrict__
20586 Returns a bitmask representing the cv-qualifiers. */
20588 static cp_cv_quals
20590 {
20594 {
20596 cp_cv_quals cv_qualifier;
20598 /* Peek at the next token. */
20600 /* See if it's a cv-qualifier. */
20602 {
20618 }
20624 {
20629 }
20630 else
20631 {
20634 }
20635 }
20638 }
20640 /* Parse an (optional) ref-qualifier
20642 ref-qualifier:
20643 &
20644 &&
20646 Returns cp_ref_qualifier representing ref-qualifier. */
20648 static cp_ref_qualifier
20650 {
20653 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20658 {
20663 {
20675 }
20680 {
20683 }
20684 else
20685 {
20688 }
20689 }
20692 }
20694 /* Parse an optional tx-qualifier.
20696 tx-qualifier:
20697 transaction_safe
20698 transaction_safe_dynamic */
20700 static tree
20702 {
20705 {
20710 {
20714 {
20717 {
20720 }
20721 else
20723 }
20724 }
20725 }
20727 }
20729 /* Parse an (optional) virt-specifier-seq.
20731 virt-specifier-seq:
20732 virt-specifier virt-specifier-seq [opt]
20734 virt-specifier:
20735 override
20736 final
20738 Returns a bitmask representing the virt-specifiers. */
20740 static cp_virt_specifiers
20742 {
20746 {
20748 cp_virt_specifiers virt_specifier;
20750 /* Peek at the next token. */
20752 /* See if it's a virt-specifier-qualifier. */
20756 {
20759 }
20761 {
20764 }
20766 {
20768 }
20769 else
20773 {
20778 }
20779 else
20780 {
20783 }
20784 }
20786 }
20788 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20789 is in scope even though it isn't real. */
20791 void
20793 {
20794 tree this_parm;
20797 {
20798 /* We don't clear this between NSDMIs. Is it already what we want? */
20805 }
20808 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20810 current_class_ref
20813 }
20815 /* Return true iff our current scope is a non-static data member
20816 initializer. */
20818 bool
20820 {
20821 /* We recognize NSDMI context by the context-less 'this' pointer set up
20822 by the function above. */
20828 }
20830 /* Parse a late-specified return type, if any. This is not a separate
20831 non-terminal, but part of a function declarator, which looks like
20833 -> trailing-type-specifier-seq abstract-declarator(opt)
20835 Returns the type indicated by the type-id.
20837 In addition to this, parse any queued up #pragma omp declare simd
20838 clauses, and #pragma acc routine clauses.
20840 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20841 function. */
20843 static tree
20846 {
20850 && declarator
20854 && declarator
20857 /* Peek at the next token. */
20859 /* A late-specified return type is indicated by an initial '->'. */
20870 {
20871 /* DR 1207: 'this' is in scope in the trailing return type. */
20873 }
20876 {
20877 /* Consume the ->. */
20881 }
20883 /* Function declarations may be followed by a trailing
20884 requires-clause. */
20888 declarator->attributes
20892 declarator->attributes
20897 {
20900 }
20903 }
20905 /* Parse a declarator-id.
20907 declarator-id:
20908 id-expression
20909 :: [opt] nested-name-specifier [opt] type-name
20911 In the `id-expression' case, the value returned is as for
20912 cp_parser_id_expression if the id-expression was an unqualified-id.
20913 If the id-expression was a qualified-id, then a SCOPE_REF is
20914 returned. The first operand is the scope (either a NAMESPACE_DECL
20915 or TREE_TYPE), but the second is still just a representation of an
20916 unqualified-id. */
20918 static tree
20920 {
20921 tree id;
20922 /* The expression must be an id-expression. Assume that qualified
20923 names are the names of types so that:
20925 template <class T>
20926 int S<T>::R::i = 3;
20928 will work; we must treat `S<T>::R' as the name of a type.
20929 Similarly, assume that qualified names are templates, where
20930 required, so that:
20932 template <class T>
20933 int S<T>::R<T>::i = 3;
20935 will work, too. */
20941 optional_p);
20945 }
20947 /* Parse a type-id.
20949 type-id:
20950 type-specifier-seq abstract-declarator [opt]
20952 Returns the TYPE specified. */
20954 static tree
20957 {
20958 cp_decl_specifier_seq type_specifier_seq;
20961 /* Parse the type-specifier-seq. */
20963 is_trailing_return,
20968 /* A bare template name as a template argument is a template template
20969 argument, not a placeholder, so fail parsing it as a type argument. */
20970 {
20974 }
20978 /* There might or might not be an abstract declarator. */
20980 /* Look for the declarator. */
20981 abstract_declarator
20986 /* Check to see if there really was a declarator. */
20991 /* The concepts TS allows 'auto' as a type-id. */
20993 /* None of the valid uses of 'auto' in C++14 involve the type-id
20994 nonterminal, but it is valid in a trailing-return-type. */
20997 {
20998 /* A type-id with type 'auto' is only ok if the abstract declarator
20999 is a function declarator with a late-specified return type.
21001 A type-id with 'auto' is also valid in a trailing-return-type
21002 in a compound-requirement. */
21009 else
21010 {
21013 {
21015 auto_node);
21017 tmpl);
21018 }
21019 else
21022 }
21023 }
21026 is_template_arg);
21027 }
21029 static tree
21031 {
21033 }
21035 static tree
21037 {
21038 tree r;
21040 parser->type_definition_forbidden_message
21045 {
21048 }
21050 }
21052 static tree
21054 {
21056 }
21058 /* Parse a type-specifier-seq.
21060 type-specifier-seq:
21061 type-specifier type-specifier-seq [opt]
21063 GNU extension:
21065 type-specifier-seq:
21066 attributes type-specifier-seq [opt]
21068 If IS_DECLARATION is true, we are at the start of a "condition" or
21069 exception-declaration, so we might be followed by a declarator-id.
21071 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21072 i.e. we've just seen "->".
21074 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21076 static void
21081 {
21086 /* Clear the TYPE_SPECIFIER_SEQ. */
21089 /* In the context of a trailing return type, enum E { } is an
21090 elaborated-type-specifier followed by a function-body, not an
21091 enum-specifier. */
21095 /* Parse the type-specifiers and attributes. */
21097 {
21098 tree type_specifier;
21101 /* Check for attributes first. */
21103 {
21104 type_specifier_seq->attributes
21108 }
21110 /* record the token of the beginning of the type specifier seq,
21111 for error reporting purposes*/
21115 /* Look for the type-specifier. */
21117 flags,
21118 type_specifier_seq,
21120 NULL,
21123 {
21124 /* If the first type-specifier could not be found, this is not a
21125 type-specifier-seq at all. */
21127 {
21128 /* Set in_declarator_p to avoid skipping to the semicolon. */
21140 }
21141 /* If subsequent type-specifiers could not be found, the
21142 type-specifier-seq is complete. */
21144 }
21147 /* The standard says that a condition can be:
21149 type-specifier-seq declarator = assignment-expression
21151 However, given:
21153 struct S {};
21154 if (int S = ...)
21156 we should treat the "S" as a declarator, not as a
21157 type-specifier. The standard doesn't say that explicitly for
21158 type-specifier-seq, but it does say that for
21159 decl-specifier-seq in an ordinary declaration. Perhaps it
21160 would be clearer just to allow a decl-specifier-seq here, and
21161 then add a semantic restriction that if any decl-specifiers
21162 that are not type-specifiers appear, the program is invalid. */
21165 }
21166 }
21168 /* Return whether the function currently being declared has an associated
21169 template parameter list. */
21171 static bool
21173 {
21186 }
21188 /* Parse a parameter-declaration-clause.
21190 parameter-declaration-clause:
21191 parameter-declaration-list [opt] ... [opt]
21192 parameter-declaration-list , ...
21194 Returns a representation for the parameter declarations. A return
21195 value of NULL indicates a parameter-declaration-clause consisting
21196 only of an ellipsis. */
21198 static tree
21200 {
21201 tree parameters;
21210 && !processing_template_parmlist
21211 && !processing_explicit_instantiation
21212 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21213 actual function or a random abstract declarator. */
21219 /* Peek at the next token. */
21221 /* Check for trivial parameter-declaration-clauses. */
21223 {
21224 /* Consume the `...' token. */
21227 }
21229 /* There are no parameters. */
21230 {
21231 #ifndef NO_IMPLICIT_EXTERN_C
21236 else
21237 #endif
21239 }
21240 /* Check for `(void)', too, which is a special case. */
21244 {
21245 /* Consume the `void' token. */
21247 /* There are no parameters. */
21249 }
21251 /* Parse the parameter-declaration-list. */
21253 /* If a parse error occurred while parsing the
21254 parameter-declaration-list, then the entire
21255 parameter-declaration-clause is erroneous. */
21259 /* Peek at the next token. */
21261 /* If it's a `,', the clause should terminate with an ellipsis. */
21263 {
21264 /* Consume the `,'. */
21266 /* Expect an ellipsis. */
21267 ellipsis_p
21269 }
21270 /* It might also be `...' if the optional trailing `,' was
21271 omitted. */
21273 {
21274 /* Consume the `...' token. */
21276 /* And remember that we saw it. */
21278 }
21279 else
21282 /* Finish the parameter list. */
21287 }
21289 /* Parse a parameter-declaration-list.
21291 parameter-declaration-list:
21292 parameter-declaration
21293 parameter-declaration-list , parameter-declaration
21295 Returns a representation of the parameter-declaration-list, as for
21296 cp_parser_parameter_declaration_clause. However, the
21297 `void_list_node' is never appended to the list. Upon return,
21298 *IS_ERROR will be true iff an error occurred. */
21300 static tree
21302 {
21308 /* Assume all will go well. */
21310 /* The special considerations that apply to a function within an
21311 unbraced linkage specifications do not apply to the parameters
21312 to the function. */
21313 saved_in_unbraced_linkage_specification_p
21317 /* Look for more parameters. */
21319 {
21327 /* Parse the parameter. */
21328 parameter
21333 /* We don't know yet if the enclosing context is deprecated, so wait
21334 and warn in grokparms if appropriate. */
21338 {
21339 /* If a function parameter pack was specified and an implicit template
21340 parameter was introduced during cp_parser_parameter_declaration,
21341 change any implicit parameters introduced into packs. */
21345 {
21353 }
21357 PARM,
21362 }
21366 /* If a parse error occurred parsing the parameter declaration,
21367 then the entire parameter-declaration-list is erroneous. */
21369 {
21373 }
21383 {
21387 }
21389 /* Add the new parameter to the list. */
21393 /* Peek at the next token. */
21396 /* These are for Objective-C++ */
21399 /* The parameter-declaration-list is complete. */
21402 {
21405 /* Peek at the next token. */
21407 /* If it's an ellipsis, then the list is complete. */
21410 /* Otherwise, there must be more parameters. Consume the
21411 `,'. */
21413 /* When parsing something like:
21415 int i(float f, double d)
21417 we can tell after seeing the declaration for "f" that we
21418 are not looking at an initialization of a variable "i",
21419 but rather at the declaration of a function "i".
21421 Due to the fact that the parsing of template arguments
21422 (as specified to a template-id) requires backtracking we
21423 cannot use this technique when inside a template argument
21424 list. */
21428 /* However, a parameter-declaration of the form
21429 "float(f)" (which is a valid declaration of a
21430 parameter "f") can also be interpreted as an
21431 expression (the conversion of "f" to "float"). */
21434 }
21435 else
21436 {
21444 }
21445 }
21447 parser->in_unbraced_linkage_specification_p
21450 /* Reset implicit_template_scope if we are about to leave the function
21451 parameter list that introduced it. Note that for out-of-line member
21452 definitions, there will be one or more class scopes before we get to
21453 the template parameter scope. */
21457 {
21461 {
21464 }
21465 }
21468 }
21470 /* Parse a parameter declaration.
21472 parameter-declaration:
21473 decl-specifier-seq ... [opt] declarator
21474 decl-specifier-seq declarator = assignment-expression
21475 decl-specifier-seq ... [opt] abstract-declarator [opt]
21476 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21478 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21479 declares a template parameter. (In that case, a non-nested `>'
21480 token encountered during the parsing of the assignment-expression
21481 is not interpreted as a greater-than operator.)
21483 Returns a representation of the parameter, or NULL if an error
21484 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21485 true iff the declarator is of the form "(p)". */
21491 {
21493 cp_decl_specifier_seq decl_specifiers;
21495 tree default_argument;
21500 /* In a template parameter, `>' is not an operator.
21502 [temp.param]
21504 When parsing a default template-argument for a non-type
21505 template-parameter, the first non-nested `>' is taken as the end
21506 of the template parameter-list rather than a greater-than
21507 operator. */
21509 /* Type definitions may not appear in parameter types. */
21511 parser->type_definition_forbidden_message
21514 /* Parse the declaration-specifiers. */
21517 CP_PARSER_FLAGS_NONE,
21521 /* Complain about missing 'typename' or other invalid type names. */
21526 /* If an error occurred, there's no reason to attempt to parse the
21527 rest of the declaration. */
21529 {
21532 }
21534 /* Peek at the next token. */
21537 /* If the next token is a `)', `,', `=', `>', or `...', then there
21538 is no declarator. However, when variadic templates are enabled,
21539 there may be a declarator following `...'. */
21544 {
21548 }
21549 /* Otherwise, there should be a declarator. */
21550 else
21551 {
21555 /* After seeing a decl-specifier-seq, if the next token is not a
21556 "(", there is no possibility that the code is a valid
21557 expression. Therefore, if parsing tentatively, we commit at
21558 this point. */
21560 /* In an expression context, having seen:
21562 (int((char ...
21564 we cannot be sure whether we are looking at a
21565 function-type (taking a "char" as a parameter) or a cast
21566 of some object of type "char" to "int". */
21572 /* Parse the declarator. */
21575 CP_PARSER_DECLARATOR_EITHER,
21577 parenthesized_p,
21581 /* After the declarator, allow more attributes. */
21582 decl_specifiers.attributes
21586 /* If the declarator is a template parameter pack, remember that and
21587 clear the flag in the declarator itself so we don't get errors
21588 from grokdeclarator. */
21590 {
21593 }
21594 }
21596 /* If the next token is an ellipsis, and we have not seen a declarator
21597 name, and if either the type of the declarator contains parameter
21598 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21599 for, eg, abbreviated integral type names), then we actually have a
21600 parameter pack expansion expression. Otherwise, leave the ellipsis
21601 for a C-style variadic function. */
21604 {
21615 {
21616 /* Consume the `...'. */
21620 /* Build a pack expansion type */
21625 else
21627 }
21628 }
21630 /* The restriction on defining new types applies only to the type
21631 of the parameter, not to the default argument. */
21634 /* If the next token is `=', then process a default argument. */
21636 {
21639 /* If we are defining a class, then the tokens that make up the
21640 default argument must be saved and processed later. */
21646 // A constrained-type-specifier may declare a type template-parameter.
21648 default_argument
21651 // A constrained-type-specifier may declare a template-template-parameter.
21653 default_argument
21656 /* Outside of a class definition, we can just parse the
21657 assignment-expression. */
21658 else
21659 default_argument
21663 {
21665 "default arguments are only "
21667 }
21669 || template_parameter_pack_p
21672 {
21673 /* Find the name of the parameter pack. */
21680 template_parm_p
21686 else
21688 template_parm_p
21695 }
21696 }
21697 else
21700 /* Generate a location for the parameter, ranging from the start of the
21701 initial token to the end of the final token (using input_location for
21702 the latter, set up by cp_lexer_set_source_position_from_token when
21703 consuming tokens).
21705 If we have a identifier, then use it for the caret location, e.g.
21707 extern int callee (int one, int (*two)(int, int), float three);
21708 ~~~~~~^~~~~~~~~~~~~~
21710 otherwise, reuse the start location for the caret location e.g.:
21712 extern int callee (int one, int (*)(int, int), float three);
21713 ^~~~~~~~~~~~~~~~~
21715 */
21721 input_location);
21724 declarator,
21725 default_argument,
21726 param_loc,
21727 template_parameter_pack_p);
21728 }
21730 /* Parse a default argument and return it.
21732 TEMPLATE_PARM_P is true if this is a default argument for a
21733 non-type template parameter. */
21734 static tree
21736 {
21742 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21743 set correctly. */
21746 /* Local variable names (and the `this' keyword) may not
21747 appear in a default argument. */
21750 /* Parse the assignment-expression. */
21755 /* The "this" pointer is not valid in a default argument. */
21757 {
21762 }
21763 default_argument
21765 /* Restore the "this" pointer. */
21767 {
21770 }
21779 }
21781 /* Parse a function-body.
21783 function-body:
21784 compound_statement */
21786 static void
21788 {
21792 }
21794 /* Parse a ctor-initializer-opt followed by a function-body. Return
21795 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21796 is true we are parsing a function-try-block. */
21798 static void
21801 {
21808 /* Begin the function body. */
21810 /* Parse the optional ctor-initializer. */
21813 /* If we're parsing a constexpr constructor definition, we need
21814 to check that the constructor body is indeed empty. However,
21815 before we get to cp_parser_function_body lot of junk has been
21816 generated, so we can't just check that we have an empty block.
21817 Rather we take a snapshot of the outermost block, and check whether
21818 cp_parser_function_body changed its state. */
21820 {
21824 }
21825 /* Parse the function-body. */
21829 /* Finish the function body. */
21831 }
21833 /* Parse an initializer.
21835 initializer:
21836 = initializer-clause
21837 ( expression-list )
21839 Returns an expression representing the initializer. If no
21840 initializer is present, NULL_TREE is returned.
21842 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21843 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21844 set to TRUE if there is no initializer present. If there is an
21845 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21846 is set to true; otherwise it is set to false. */
21848 static tree
21851 {
21853 tree init;
21855 /* Peek at the next token. */
21858 /* Let our caller know whether or not this initializer was
21859 parenthesized. */
21861 /* Assume that the initializer is constant. */
21865 {
21866 /* Consume the `='. */
21868 /* Parse the initializer-clause. */
21870 }
21872 {
21877 non_constant_p);
21882 }
21884 {
21889 }
21890 else
21891 {
21892 /* Anything else is an error. */
21895 }
21901 }
21903 /* Parse an initializer-clause.
21905 initializer-clause:
21906 assignment-expression
21907 braced-init-list
21909 Returns an expression representing the initializer.
21911 If the `assignment-expression' production is used the value
21912 returned is simply a representation for the expression.
21914 Otherwise, calls cp_parser_braced_list. */
21916 static cp_expr
21918 {
21919 cp_expr initializer;
21921 /* Assume the expression is constant. */
21924 /* If it is not a `{', then we are looking at an
21925 assignment-expression. */
21927 {
21928 initializer
21931 non_constant_p);
21932 }
21933 else
21937 }
21939 /* Parse a brace-enclosed initializer list.
21941 braced-init-list:
21942 { initializer-list , [opt] }
21943 { designated-initializer-list , [opt] }
21944 { }
21946 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21947 the elements of the initializer-list (or NULL, if the last
21948 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21949 NULL_TREE. There is no way to detect whether or not the optional
21950 trailing `,' was provided. NON_CONSTANT_P is as for
21951 cp_parser_initializer. */
21953 static cp_expr
21955 {
21956 tree initializer;
21959 /* Consume the `{' token. */
21960 matching_braces braces;
21962 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21964 /* If it's not a `}', then there is a non-trivial initializer. */
21966 {
21967 /* Parse the initializer list. */
21970 /* A trailing `,' token is allowed. */
21973 }
21974 else
21976 /* Now, there should be a trailing `}'. */
21982 /* Build a location of the form:
21983 { ... }
21984 ^~~~~~~
21985 with caret==start at the open brace, finish at the close brace. */
21989 }
21991 /* Consume tokens up to, and including, the next non-nested closing `]'.
21992 Returns true iff we found a closing `]'. */
21994 static bool
21996 {
22000 {
22004 {
22007 /* If we've run out of tokens, then there is no closing `]'. */
22016 {
22019 }
22024 }
22026 /* Consume the token. */
22028 }
22029 }
22031 /* Return true if we are looking at an array-designator, false otherwise. */
22033 static bool
22035 {
22036 /* Consume the `['. */
22041 /* Skip tokens until the next token is a closing square bracket.
22042 If we find the closing `]', and the next token is a `=', then
22043 we are looking at an array designator. */
22044 bool array_designator_p
22048 /* Roll back the tokens we skipped. */
22052 }
22054 /* Parse an initializer-list.
22056 initializer-list:
22057 initializer-clause ... [opt]
22058 initializer-list , initializer-clause ... [opt]
22060 C++2A Extension:
22062 designated-initializer-list:
22063 designated-initializer-clause
22064 designated-initializer-list , designated-initializer-clause
22066 designated-initializer-clause:
22067 designator brace-or-equal-initializer
22069 designator:
22070 . identifier
22072 GNU Extension:
22074 initializer-list:
22075 designation initializer-clause ...[opt]
22076 initializer-list , designation initializer-clause ...[opt]
22078 designation:
22079 . identifier =
22080 identifier :
22081 [ constant-expression ] =
22083 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22084 for the initializer. If the INDEX of the elt is non-NULL, it is the
22085 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22086 as for cp_parser_initializer. */
22090 {
22095 /* Assume all of the expressions are constant. */
22098 /* Parse the rest of the list. */
22100 {
22102 tree designator;
22103 tree initializer;
22107 /* Handle the C++2A syntax, '. id ='. */
22115 {
22118 "C++ designated initializers only available with "
22120 /* Consume the `.'. */
22122 /* Consume the identifier. */
22125 /* Consume the `='. */
22127 }
22128 /* Also, if the next token is an identifier and the following one is a
22129 colon, we are looking at the GNU designated-initializer
22130 syntax. */
22135 {
22136 /* Warn the user that they are using an extension. */
22139 /* Consume the identifier. */
22141 /* Consume the `:'. */
22143 }
22144 /* Also handle C99 array designators, '[ const ] ='. */
22148 {
22149 /* In C++11, [ could start a lambda-introducer. */
22155 {
22158 }
22159 else
22160 {
22165 }
22170 && (!require_potential_rvalue_constant_expression
22174 /* Warn the user that they are using an extension. */
22177 }
22178 else
22182 {
22185 }
22189 {
22193 }
22197 /* Parse the initializer. */
22200 /* If any clause is non-constant, so is the entire initializer. */
22204 /* If we have an ellipsis, this is an initializer pack
22205 expansion. */
22207 {
22210 /* Consume the `...'. */
22217 /* Turn the initializer into an initializer expansion. */
22219 }
22221 /* Add it to the vector. */
22224 /* If the next token is not a comma, we have reached the end of
22225 the list. */
22229 /* Peek at the next token. */
22231 /* If the next token is a `}', then we're still done. An
22232 initializer-clause can have a trailing `,' after the
22233 initializer-list and before the closing `}'. */
22237 /* Consume the `,' token. */
22239 }
22241 /* The same identifier shall not appear in multiple designators
22242 of a designated-initializer-list. */
22244 {
22249 {
22251 {
22253 "%<.%s%> designator used multiple times in "
22257 }
22258 else
22260 }
22264 }
22267 }
22269 /* Classes [gram.class] */
22271 /* Parse a class-name.
22273 class-name:
22274 identifier
22275 template-id
22277 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22278 to indicate that names looked up in dependent types should be
22279 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22280 keyword has been used to indicate that the name that appears next
22281 is a template. TAG_TYPE indicates the explicit tag given before
22282 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22283 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22284 is the class being defined in a class-head. If ENUM_OK is TRUE,
22285 enum-names are also accepted.
22287 Returns the TYPE_DECL representing the class. */
22289 static tree
22298 {
22299 tree decl;
22300 tree scope;
22305 /* All class-names start with an identifier. */
22308 {
22311 }
22313 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22314 to a template-id, so we save it here. */
22319 /* Any name names a type if we're following the `typename' keyword
22320 in a qualified name where the enclosing scope is type-dependent. */
22323 /* Handle the common case (an identifier, but not a template-id)
22324 efficiently. */
22327 {
22331 /* Look for the identifier. */
22335 /* If the next token isn't an identifier, we are certainly not
22336 looking at a class-name. */
22339 /* If we know this is a type-name, there's no need to look it
22340 up. */
22343 else
22344 {
22345 tree ambiguous_decls;
22346 /* If we already know that this lookup is ambiguous, then
22347 we've already issued an error message; there's no reason
22348 to check again. */
22350 {
22353 }
22354 /* If the next token is a `::', then the name must be a type
22355 name.
22357 [basic.lookup.qual]
22359 During the lookup for a name preceding the :: scope
22360 resolution operator, object, function, and enumerator
22361 names are ignored. */
22364 /* Look up the name. */
22366 tag_type,
22369 check_dependency_p,
22373 {
22377 }
22378 }
22379 }
22380 else
22381 {
22382 /* Try a template-id. */
22384 check_dependency_p,
22385 tag_type,
22386 is_declaration);
22389 }
22393 /* If this is a typename, create a TYPENAME_TYPE. */
22395 {
22400 }
22404 /* Check to see that it is really the name of a class. */
22408 /* Situations like this:
22410 template <typename T> struct A {
22411 typename T::template X<int>::I i;
22412 };
22414 are problematic. Is `T::template X<int>' a class-name? The
22415 standard does not seem to be definitive, but there is no other
22416 valid interpretation of the following `::'. Therefore, those
22417 names are considered class-names. */
22418 {
22422 }
22427 /* In Objective-C 2.0, a classname followed by '.' starts a
22428 dot-syntax expression, and it's not a type-name. */
22440 }
22442 /* Parse a class-specifier.
22444 class-specifier:
22445 class-head { member-specification [opt] }
22447 Returns the TREE_TYPE representing the class. */
22449 static tree
22451 {
22452 tree type;
22466 /* Parse the class-head. */
22469 /* If the class-head was a semantic disaster, skip the entire body
22470 of the class. */
22472 {
22476 }
22478 /* Look for the `{'. */
22479 matching_braces braces;
22481 {
22484 }
22489 /* Issue an error message if type-definitions are forbidden here. */
22491 /* Remember that we are defining one more class. */
22493 /* Inside the class, surrounding template-parameter-lists do not
22494 apply. */
22495 saved_num_template_parameter_lists
22498 /* We are not in a function body. */
22501 /* Or in a loop. */
22504 /* Or in a switch. */
22507 /* We are not immediately inside an extern "lang" block. */
22508 saved_in_unbraced_linkage_specification_p
22512 // Associate constraints with the type.
22516 /* Start the class. */
22518 {
22521 }
22525 /* If the type is erroneous, skip the entire body of the class. */
22527 else
22528 /* Parse the member-specification. */
22531 /* Look for the trailing `}'. */
22533 /* Look for trailing attributes to apply to this class. */
22541 /* We've finished a type definition. Check for the common syntax
22542 error of forgetting a semicolon after the definition. We need to
22543 be careful, as we can't just check for not-a-semicolon and be done
22544 with it; the user might have typed:
22546 class X { } c = ...;
22547 class X { } *p = ...;
22549 and so forth. Instead, enumerate all the possible tokens that
22550 might follow this production; if we don't see one of them, then
22551 complain and silently insert the semicolon. */
22552 {
22557 /* Don't try to parse c++11 attributes here. As per the
22558 grammar, that should be a task for
22559 cp_parser_decl_specifier_seq. */
22563 {
22574 /* While it's legal for type qualifiers and storage class
22575 specifiers to follow type definitions in the grammar, only
22576 compiler testsuites contain code like that. Assume that if
22577 we see such code, then what we're really seeing is a case
22578 like:
22580 class X { }
22581 const <type> var = ...;
22583 or
22585 class Y { }
22586 static <type> func (...) ...
22588 i.e. the qualifier or specifier applies to the next
22589 declaration. To do so, however, we need to look ahead one
22590 more token to see if *that* token is a type specifier.
22592 This code could be improved to handle:
22594 class Z { }
22595 static const <type> var = ...; */
22598 {
22601 /* Handling user-defined types here would be nice, but very
22602 tricky. */
22603 want_semicolon
22606 }
22610 }
22612 /* If we don't have a type, then something is very wrong and we
22613 shouldn't try to do anything clever. Likewise for not seeing the
22614 closing brace. */
22616 {
22617 /* Locate the closing brace. */
22618 cp_token_position prev
22623 /* We want to suggest insertion of a ';' immediately *after* the
22624 closing brace, so, if we can, offset the location by 1 column. */
22631 /* If we successfully offset the location, suggest the fix-it. */
22644 else
22647 /* Unget one token and smash it to look as though we encountered
22648 a semicolon in the input stream. */
22653 }
22654 }
22656 /* If this class is not itself within the scope of another class,
22657 then we need to parse the bodies of all of the queued function
22658 definitions. Note that the queued functions defined in a class
22659 are not always processed immediately following the
22660 class-specifier for that class. Consider:
22662 struct A {
22663 struct B { void f() { sizeof (A); } };
22664 };
22666 If `f' were processed before the processing of `A' were
22667 completed, there would be no way to compute the size of `A'.
22668 Note that the nesting we are interested in here is lexical --
22669 not the semantic nesting given by TYPE_CONTEXT. In particular,
22670 for:
22672 struct A { struct B; };
22673 struct A::B { void f() { } };
22675 there is no need to delay the parsing of `A::B::f'. */
22677 {
22678 tree decl;
22686 {
22687 /* Skip default arguments, NSDMIs, etc, in order to improve
22688 error recovery (c++/71169, c++/71832). */
22693 }
22695 /* In a first pass, parse default arguments to the functions.
22696 Then, in a second pass, parse the bodies of the functions.
22697 This two-phased approach handles cases like:
22699 struct S {
22700 void f() { g(); }
22701 void g(int i = 3);
22702 };
22704 */
22706 {
22708 /* If there are default arguments that have not yet been processed,
22709 take care of them now. */
22711 {
22716 }
22717 /* Make sure that any template parameters are in scope. */
22719 /* Parse the default argument expressions. */
22721 /* Remove any template parameters from the symbol table. */
22723 }
22725 /* Now parse any NSDMIs. */
22729 {
22731 {
22736 }
22739 }
22746 /* Now do some post-NSDMI bookkeeping. */
22752 /* Now parse the body of the functions. */
22754 {
22755 /* OpenMP UDRs need to be parsed before all other functions. */
22762 }
22763 else
22767 }
22768 else
22771 /* Put back any saved access checks. */
22774 /* Restore saved state. */
22778 parser->num_template_parameter_lists
22780 parser->in_unbraced_linkage_specification_p
22784 }
22786 static tree
22788 {
22789 tree ret;
22794 }
22796 /* Parse a class-head.
22798 class-head:
22799 class-key identifier [opt] base-clause [opt]
22800 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22801 class-key nested-name-specifier [opt] template-id
22802 base-clause [opt]
22804 class-virt-specifier:
22805 final
22807 GNU Extensions:
22808 class-key attributes identifier [opt] base-clause [opt]
22809 class-key attributes nested-name-specifier identifier base-clause [opt]
22810 class-key attributes nested-name-specifier [opt] template-id
22811 base-clause [opt]
22813 Upon return BASES is initialized to the list of base classes (or
22814 NULL, if there are none) in the same form returned by
22815 cp_parser_base_clause.
22817 Returns the TYPE of the indicated class. Sets
22818 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22819 involving a nested-name-specifier was used, and FALSE otherwise.
22821 Returns error_mark_node if this is not a class-head.
22823 Returns NULL_TREE if the class-head is syntactically valid, but
22824 semantically invalid in a way that means we should skip the entire
22825 body of the class. */
22827 static tree
22830 {
22831 tree nested_name_specifier;
22835 tree attributes;
22836 tree bases;
22846 /* Assume no nested-name-specifier will be present. */
22848 /* Assume no template parameter lists will be used in defining the
22849 type. */
22853 /* Look for the class-key. */
22860 /* Parse the attributes. */
22863 /* If the next token is `::', that is invalid -- but sometimes
22864 people do try to write:
22866 struct ::S {};
22868 Handle this gracefully by accepting the extra qualifier, and then
22869 issuing an error about it later if this really is a
22870 class-head. If it turns out just to be an elaborated type
22871 specifier, remain silent. */
22877 /* Determine the name of the class. Begin by looking for an
22878 optional nested-name-specifier. */
22880 nested_name_specifier
22886 /* If there was a nested-name-specifier, then there *must* be an
22887 identifier. */
22892 {
22894 /* Although the grammar says `identifier', it really means
22895 `class-name' or `template-name'. You are only allowed to
22896 define a class that has already been declared with this
22897 syntax.
22899 The proposed resolution for Core Issue 180 says that wherever
22900 you see `class T::X' you should treat `X' as a type-name.
22902 It is OK to define an inaccessible class; for example:
22904 class A { class B; };
22905 class A::B {};
22907 We do not know if we will see a class-name, or a
22908 template-name. We look for a class-name first, in case the
22909 class-name is a template-id; if we looked for the
22910 template-name first we would stop after the template-name. */
22917 class_type,
22921 /* If that didn't work, ignore the nested-name-specifier. */
22923 {
22929 }
22930 /* If we could not find a corresponding TYPE, treat this
22931 declaration like an unqualified declaration. */
22934 /* Otherwise, count the number of templates used in TYPE and its
22935 containing scopes. */
22936 else
22937 {
22938 tree scope;
22950 }
22951 }
22952 /* Otherwise, the identifier is optional. */
22953 else
22954 {
22955 /* We don't know whether what comes next is a template-id,
22956 an identifier, or nothing at all. */
22958 /* Check for a template-id. */
22963 class_key,
22965 /* If that didn't work, it could still be an identifier. */
22967 {
22969 {
22972 }
22973 else
22975 }
22976 else
22977 {
22980 }
22981 }
22986 {
22988 class_key,
22990 }
22993 /* If it's not a `:' or a `{' then we can't really be looking at a
22994 class-head, since a class-head only appears as part of a
22995 class-specifier. We have to detect this situation before calling
22996 xref_tag, since that has irreversible side-effects. */
22998 {
23002 }
23004 /* At this point, we're going ahead with the class-specifier, even
23005 if some other problem occurs. */
23008 {
23013 }
23014 /* Issue the error about the overly-qualified name now. */
23016 {
23021 }
23023 {
23028 }
23030 {
23031 tree scope;
23034 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23035 keyword template shall not appear at the top level. */
23039 /* Reject typedef-names in class heads. */
23041 {
23044 type);
23047 }
23049 /* Figure out in what scope the declaration is being placed. */
23051 /* If that scope does not contain the scope in which the
23052 class was originally declared, the program is invalid. */
23054 {
23057 "declaration of %qD in namespace %qD which does not "
23060 else
23066 }
23067 /* [dcl.meaning]
23069 A declarator-id shall not be qualified except for the
23070 definition of a ... nested class outside of its class
23071 ... [or] the definition or explicit instantiation of a
23072 class member of a namespace outside of its namespace. */
23074 {
23079 }
23080 }
23081 /* An explicit-specialization must be preceded by "template <>". If
23082 it is not, try to recover gracefully. */
23085 && !processing_template_parmlist
23087 {
23088 /* Build a location of this form:
23089 struct typename <ARGS>
23090 ^~~~~~~~~~~~~~~~~~~~~~
23091 with caret==start at the start token, and
23092 finishing at the end of the type. */
23093 location_t reported_loc
23095 class_head_start_location,
23101 "an explicit specialization must be preceded by"
23104 /* Take the same action that would have been taken by
23105 cp_parser_explicit_specialization. */
23108 }
23109 /* There must be no "return" statements between this point and the
23110 end of this function; set "type "to the correct return value and
23111 use "goto done;" to return. */
23112 /* Make sure that the right number of template parameters were
23113 present. */
23117 {
23118 /* If something went wrong, there is no point in even trying to
23119 process the class-definition. */
23122 }
23124 /* Look up the type. */
23126 {
23130 {
23134 }
23135 else
23136 {
23140 /* Check the scope while we still know whether or not we had a
23141 nested-name-specifier. */
23144 }
23147 }
23149 {
23150 tree class_type;
23152 /* Given:
23154 template <typename T> struct S { struct T };
23155 template <typename T> struct S<T>::T { };
23157 we will get a TYPENAME_TYPE when processing the definition of
23158 `S::T'. We need to resolve it to the actual type before we
23159 try to define it. */
23161 {
23166 else
23167 {
23170 }
23171 }
23175 {
23178 }
23181 /* Enter the scope indicated by the nested-name-specifier. */
23183 /* Get the canonical version of this type. */
23185 /* Call push_template_decl if it seems like we should be defining a
23186 template either from the template headers or the type we're
23187 defining, so that we diagnose both extra and missing headers. */
23191 {
23194 {
23197 }
23198 }
23202 }
23204 {
23205 /* If the class was unnamed, create a dummy name. */
23209 ? ts_within_enclosing_non_class
23213 }
23215 /* Indicate whether this class was declared as a `class' or as a
23216 `struct'. */
23221 /* If this type was already complete, and we see another definition,
23222 that's an error. */
23224 {
23226 type);
23228 type);
23231 }
23236 {
23237 /* Apply attributes now, before any use of the class as a template
23238 argument in its base list. */
23241 }
23243 /* We will have entered the scope containing the class; the names of
23244 base classes should be looked up in that context. For example:
23246 struct A { struct B {}; struct C; };
23247 struct A::C : B {};
23249 is valid. */
23251 /* Get the list of base-classes, if there is one. */
23253 {
23254 /* PR59482: enter the class scope so that base-specifiers are looked
23255 up correctly. */
23259 /* PR59482: get out of the previously pushed class scope so that the
23260 subsequent pops pop the right thing. */
23263 }
23264 else
23267 /* If we're really defining a class, process the base classes.
23268 If they're invalid, fail. */
23272 done:
23273 /* Leave the scope given by the nested-name-specifier. We will
23274 enter the class scope itself while processing the members. */
23279 {
23282 }
23288 out:
23291 }
23293 /* Parse a class-key.
23295 class-key:
23296 class
23297 struct
23298 union
23300 Returns the kind of class-key specified, or none_type to indicate
23301 error. */
23303 static enum tag_types
23305 {
23309 /* Look for the class-key. */
23314 /* Check to see if the TOKEN is a class-key. */
23319 }
23321 /* Parse a type-parameter-key.
23323 type-parameter-key:
23324 class
23325 typename
23326 */
23328 static void
23330 {
23331 /* Look for the type-parameter-key. */
23335 {
23338 /* typename is not allowed in a template template parameter
23339 by the standard until C++17. */
23341 "ISO C++ forbids typename key in template template parameter;"
23343 }
23344 else
23348 }
23350 /* Parse an (optional) member-specification.
23352 member-specification:
23353 member-declaration member-specification [opt]
23354 access-specifier : member-specification [opt] */
23356 static void
23358 {
23360 {
23364 /* Peek at the next token. */
23366 /* If it's a `}', or EOF then we've seen all the members. */
23372 /* See if this token is a keyword. */
23375 {
23379 /* Consume the access-specifier. */
23381 /* Remember which access-specifier is active. */
23383 /* Look for the `:'. */
23388 /* Accept #pragmas at class scope. */
23390 {
23393 }
23395 /* Otherwise, the next construction must be a
23396 member-declaration. */
23398 }
23399 }
23400 }
23402 /* Parse a member-declaration.
23404 member-declaration:
23405 decl-specifier-seq [opt] member-declarator-list [opt] ;
23406 function-definition ; [opt]
23407 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23408 using-declaration
23409 template-declaration
23410 alias-declaration
23412 member-declarator-list:
23413 member-declarator
23414 member-declarator-list , member-declarator
23416 member-declarator:
23417 declarator pure-specifier [opt]
23418 declarator constant-initializer [opt]
23419 identifier [opt] : constant-expression
23421 GNU Extensions:
23423 member-declaration:
23424 __extension__ member-declaration
23426 member-declarator:
23427 declarator attributes [opt] pure-specifier [opt]
23428 declarator attributes [opt] constant-initializer [opt]
23429 identifier [opt] attributes [opt] : constant-expression
23431 C++0x Extensions:
23433 member-declaration:
23434 static_assert-declaration */
23436 static void
23438 {
23439 cp_decl_specifier_seq decl_specifiers;
23440 tree prefix_attributes;
23441 tree decl;
23450 /* Check for the `__extension__' keyword. */
23452 {
23453 /* Recurse. */
23455 /* Restore the old value of the PEDANTIC flag. */
23459 }
23461 /* Check for a template-declaration. */
23463 {
23464 /* An explicit specialization here is an error condition, and we
23465 expect the specialization handler to detect and report this. */
23469 else
23473 }
23474 /* Check for a template introduction. */
23478 /* Check for a using-declaration. */
23480 {
23482 {
23483 /* Parse the using-declaration. */
23487 }
23488 else
23489 {
23490 tree decl;
23494 /* Note that if we actually see the '=' token after the
23495 identifier, cp_parser_alias_declaration commits the
23496 tentative parse. In that case, we really expect an
23497 alias-declaration. Otherwise, we expect a using
23498 declaration. */
23499 alias_decl_expected =
23505 else
23509 }
23510 }
23512 /* Check for @defs. */
23514 {
23519 {
23524 }
23526 }
23528 /* If the next token is `static_assert' we have a static assertion. */
23530 {
23533 }
23540 /* Parse the decl-specifier-seq. */
23543 CP_PARSER_FLAGS_OPTIONAL,
23546 /* Check for an invalid type-name. */
23550 /* If there is no declarator, then the decl-specifier-seq should
23551 specify a type. */
23553 {
23554 /* If there was no decl-specifier-seq, and the next token is a
23555 `;', then we have something like:
23557 struct S { ; };
23559 [class.mem]
23561 Each member-declaration shall declare at least one member
23562 name of the class. */
23564 {
23567 {
23571 }
23572 }
23573 else
23574 {
23575 tree type;
23577 /* See if this declaration is a friend. */
23579 /* If there were decl-specifiers, check to see if there was
23580 a class-declaration. */
23583 /* Nested classes have already been added to the class, but
23584 a `friend' needs to be explicitly registered. */
23586 {
23587 /* If the `friend' keyword was present, the friend must
23588 be introduced with a class-key. */
23591 "in C++03 a class-key must be used "
23593 /* In this case:
23595 template <typename T> struct A {
23596 friend struct A<T>::B;
23597 };
23599 A<T>::B will be represented by a TYPENAME_TYPE, and
23600 therefore not recognized by check_tag_decl. */
23602 {
23606 }
23609 "friend declaration does not name a class or "
23611 else
23614 }
23615 /* If there is no TYPE, an error message will already have
23616 been issued. */
23618 ;
23619 /* An anonymous aggregate has to be handled specially; such
23620 a declaration really declares a data member (with a
23621 particular type), as opposed to a nested class. */
23623 {
23624 /* C++11 9.5/6. */
23627 "a storage class on an anonymous aggregate "
23630 /* Remove constructors and such from TYPE, now that we
23631 know it is an anonymous aggregate. */
23633 /* And make the corresponding data member. */
23636 /* Add it to the class. */
23638 }
23639 else
23640 cp_parser_check_access_in_redeclaration
23643 }
23644 }
23645 else
23646 {
23649 /* Clear attributes from the decl_specifiers but keep them
23650 around as prefix attributes that apply them to the entity
23651 being declared. */
23655 /* See if these declarations will be friends. */
23658 /* Keep going until we hit the `;' at the end of the
23659 declaration. */
23661 {
23663 tree first_attribute;
23664 tree initializer;
23667 /* Peek at the next token. */
23670 /* The following code wants to know early if it is a bit-field
23671 or some other declaration. Attributes can appear before
23672 the `:' token. Skip over them without consuming any tokens
23673 to peek if they are followed by `:'. */
23678 {
23679 size_t n
23682 }
23684 /* Check for a bitfield declaration. */
23690 {
23691 tree identifier;
23692 tree width;
23697 else
23700 /* Look for attributes that apply to the bitfield. */
23703 /* Consume the `:' token. */
23706 /* Get the width of the bitfield. */
23710 /* In C++2A and as extension for C++11 and above we allow
23711 default member initializers for bit-fields. */
23716 CPP_OPEN_BRACE)))
23717 {
23718 location_t loc
23724 "default member initializers for bit-fields "
23725 "only available with -std=c++2a or "
23730 {
23734 }
23735 }
23736 else
23737 {
23738 /* Look for attributes that apply to the bitfield after
23739 the `:' token and width. This is where GCC used to
23740 parse attributes in the past, pedwarn if there is
23741 a std attribute. */
23744 "ISO C++ allows bit-field attributes only "
23748 }
23752 /* Remember which attributes are prefix attributes and
23753 which are not. */
23755 /* Combine the attributes. */
23758 /* Create the bitfield declaration. */
23761 identifier,
23762 sfk_none)
23766 attributes);
23767 }
23768 else
23769 {
23771 tree asm_specification;
23774 /* Parse the declarator. */
23775 declarator
23780 friend_p);
23782 /* If something went wrong parsing the declarator, make sure
23783 that we at least consume some tokens. */
23785 {
23786 /* Skip to the end of the statement. */
23788 /* If the next token is not a semicolon, that is
23789 probably because we just skipped over the body of
23790 a function. So, we consume a semicolon if
23791 present, but do not issue an error message if it
23792 is not present. */
23794 CPP_SEMICOLON))
23797 }
23800 cp_parser_check_for_definition_in_return_type
23804 /* Look for an asm-specification. */
23806 /* Look for attributes that apply to the declaration. */
23808 /* Remember which attributes are prefix attributes and
23809 which are not. */
23811 /* Combine the attributes. */
23814 /* If it's an `=', then we have a constant-initializer or a
23815 pure-specifier. It is not correct to parse the
23816 initializer before registering the member declaration
23817 since the member declaration should be in scope while
23818 its initializer is processed. However, the rest of the
23819 front end does not yet provide an interface that allows
23820 us to handle this correctly. */
23822 {
23823 /* In [class.mem]:
23825 A pure-specifier shall be used only in the declaration of
23826 a virtual function.
23828 A member-declarator can contain a constant-initializer
23829 only if it declares a static member of integral or
23830 enumeration type.
23832 Therefore, if the DECLARATOR is for a function, we look
23833 for a pure-specifier; otherwise, we look for a
23834 constant-initializer. When we call `grokfield', it will
23835 perform more stringent semantics checks. */
23847 {
23849 /* Don't require a constant rvalue in C++11, since we
23850 might want a reference constant. We'll enforce
23851 constancy later. */
23853 /* Parse the initializer. */
23856 }
23857 else
23858 /* Parse the initializer. */
23860 }
23863 {
23867 else
23869 }
23870 /* Otherwise, there is no initializer. */
23871 else
23874 /* See if we are probably looking at a function
23875 definition. We are certainly not looking at a
23876 member-declarator. Calling `grokfield' has
23877 side-effects, so we must not do it unless we are sure
23878 that we are looking at a member-declarator. */
23881 {
23882 /* The grammar does not allow a pure-specifier to be
23883 used when a member function is defined. (It is
23884 possible that this fact is an oversight in the
23885 standard, since a pure function may be defined
23886 outside of the class-specifier. */
23892 declarator,
23893 attributes);
23896 /* If the member was not a friend, declare it here. */
23899 /* Peek at the next token. */
23901 /* If the next token is a semicolon, consume it. */
23903 {
23904 location_t semicolon_loc
23909 "extra %<;%> after in-class "
23911 }
23913 }
23914 else
23917 /* Create the declaration. */
23922 {
23925 else
23927 }
23928 }
23933 /* Reset PREFIX_ATTRIBUTES. */
23935 {
23940 }
23942 /* If there is any qualification still in effect, clear it
23943 now; we will be starting fresh with the next declarator. */
23947 /* If it's a `,', then there are more declarators. */
23949 {
23952 {
23958 }
23959 }
23960 /* If the next token isn't a `;', then we have a parse error. */
23962 CPP_SEMICOLON))
23963 {
23964 /* The next token might be a ways away from where the
23965 actual semicolon is missing. Find the previous token
23966 and use that for our error position. */
23973 /* Assume that the user meant to provide a semicolon. If
23974 we were to cp_parser_skip_to_end_of_statement, we might
23975 skip to a semicolon inside a member function definition
23976 and issue nonsensical error messages. */
23978 }
23981 {
23982 /* Add DECL to the list of members. */
23984 /* Explicitly include, eg, NSDMIs, for better error
23985 recovery (c++/58650). */
23993 /* Add DECL to the queue of NSDMI to be parsed later. */
23995 }
23999 }
24000 }
24003 out:
24005 }
24007 /* Parse a pure-specifier.
24009 pure-specifier:
24010 = 0
24012 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24013 Otherwise, ERROR_MARK_NODE is returned. */
24015 static tree
24017 {
24020 /* Look for the `=' token. */
24023 /* Look for the `0' token. */
24032 /* Accept = default or = delete in c++0x mode. */
24035 {
24038 }
24040 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24042 {
24047 }
24049 {
24052 }
24055 }
24057 /* Parse a constant-initializer.
24059 constant-initializer:
24060 = constant-expression
24062 Returns a representation of the constant-expression. */
24064 static tree
24066 {
24067 /* Look for the `=' token. */
24071 /* It is invalid to write:
24073 struct S { static const int i = { 7 }; };
24075 */
24077 {
24080 /* Consume the opening brace. */
24081 matching_braces braces;
24083 /* Skip the initializer. */
24085 /* Look for the trailing `}'. */
24089 }
24092 }
24094 /* Derived classes [gram.class.derived] */
24096 /* Parse a base-clause.
24098 base-clause:
24099 : base-specifier-list
24101 base-specifier-list:
24102 base-specifier ... [opt]
24103 base-specifier-list , base-specifier ... [opt]
24105 Returns a TREE_LIST representing the base-classes, in the order in
24106 which they were declared. The representation of each node is as
24107 described by cp_parser_base_specifier.
24109 In the case that no bases are specified, this function will return
24110 NULL_TREE, not ERROR_MARK_NODE. */
24112 static tree
24114 {
24117 /* Look for the `:' that begins the list. */
24120 /* Scan the base-specifier-list. */
24122 {
24124 tree base;
24127 /* Look for the base-specifier. */
24129 /* Look for the (optional) ellipsis. */
24131 {
24132 /* Consume the `...'. */
24136 }
24138 /* Add BASE to the front of the list. */
24140 {
24142 /* Make this a pack expansion type. */
24146 {
24149 }
24150 }
24151 /* Peek at the next token. */
24153 /* If it's not a comma, then the list is complete. */
24156 /* Consume the `,'. */
24158 }
24160 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24161 base class had a qualified name. However, the next name that
24162 appears is certainly not qualified. */
24168 }
24170 /* Parse a base-specifier.
24172 base-specifier:
24173 :: [opt] nested-name-specifier [opt] class-name
24174 virtual access-specifier [opt] :: [opt] nested-name-specifier
24175 [opt] class-name
24176 access-specifier virtual [opt] :: [opt] nested-name-specifier
24177 [opt] class-name
24179 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24180 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24181 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24182 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24184 static tree
24186 {
24194 tree type;
24196 /* Process the optional `virtual' and `access-specifier'. */
24198 {
24199 /* Peek at the next token. */
24201 /* Process `virtual'. */
24203 {
24205 /* If `virtual' appears more than once, issue an error. */
24207 {
24211 }
24215 /* Consume the `virtual' token. */
24223 /* If more than one access specifier appears, issue an
24224 error. */
24227 {
24231 }
24235 /* Consume the access-specifier. */
24243 }
24244 }
24245 /* It is not uncommon to see programs mechanically, erroneously, use
24246 the 'typename' keyword to denote (dependent) qualified types
24247 as base classes. */
24249 {
24254 else
24256 "keyword %<typename%> not allowed in this context "
24259 }
24261 /* Look for the optional `::' operator. */
24263 /* Look for the nested-name-specifier. The simplest way to
24264 implement:
24266 [temp.res]
24268 The keyword `typename' is not permitted in a base-specifier or
24269 mem-initializer; in these contexts a qualified name that
24270 depends on a template-parameter is implicitly assumed to be a
24271 type name.
24273 is to pretend that we have seen the `typename' keyword at this
24274 point. */
24280 /* If the base class is given by a qualified name, assume that names
24281 we see are type names or templates, as appropriate. */
24287 /* DR 950 allows decltype as a base-specifier. */
24289 else
24290 {
24291 /* Otherwise, look for the class-name. */
24293 class_scope_p,
24294 template_p,
24295 typename_type,
24300 }
24306 }
24308 /* Exception handling [gram.exception] */
24310 /* Parse an (optional) noexcept-specification.
24312 noexcept-specification:
24313 noexcept ( constant-expression ) [opt]
24315 If no noexcept-specification is present, returns NULL_TREE.
24316 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24317 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24318 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24319 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24320 in which case a boolean condition is returned instead. */
24322 static tree
24327 {
24331 /* Peek at the next token. */
24334 /* Is it a noexcept-specification? */
24336 {
24337 tree expr;
24341 {
24342 matching_parens parens;
24346 {
24347 /* Types may not be defined in an exception-specification. */
24349 parser->type_definition_forbidden_message
24354 /* Restore the saved message. */
24356 }
24357 else
24358 {
24361 }
24364 }
24365 else
24366 {
24370 }
24372 /* We cannot build a noexcept-spec right away because this will check
24373 that expr is a constexpr. */
24376 else
24378 }
24379 else
24381 }
24383 /* Parse an (optional) exception-specification.
24385 exception-specification:
24386 throw ( type-id-list [opt] )
24388 Returns a TREE_LIST representing the exception-specification. The
24389 TREE_VALUE of each node is a type. */
24391 static tree
24393 {
24395 tree type_id_list;
24398 /* Peek at the next token. */
24401 /* Is it a noexcept-specification? */
24407 /* If it's not `throw', then there's no exception-specification. */
24413 /* Consume the `throw'. */
24416 /* Look for the `('. */
24417 matching_parens parens;
24420 /* Peek at the next token. */
24422 /* If it's not a `)', then there is a type-id-list. */
24424 {
24425 /* Types may not be defined in an exception-specification. */
24427 parser->type_definition_forbidden_message
24429 /* Parse the type-id-list. */
24431 /* Restore the saved message. */
24435 {
24439 }
24442 "dynamic exception specifications are deprecated in "
24444 }
24445 /* In C++17, throw() is equivalent to noexcept (true). throw()
24446 is deprecated in C++11 and above as well, but is still widely used,
24447 so don't warn about it yet. */
24450 else
24453 /* Look for the `)'. */
24457 }
24459 /* Parse an (optional) type-id-list.
24461 type-id-list:
24462 type-id ... [opt]
24463 type-id-list , type-id ... [opt]
24465 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24466 in the order that the types were presented. */
24468 static tree
24470 {
24474 {
24476 tree type;
24480 /* Get the next type-id. */
24482 /* Check for invalid 'auto'. */
24484 {
24488 }
24489 /* Parse the optional ellipsis. */
24491 {
24492 /* Consume the `...'. */
24495 /* Turn the type into a pack expansion expression. */
24497 }
24498 /* Add it to the list. */
24500 /* Peek at the next token. */
24502 /* If it is not a `,', we are done. */
24505 /* Consume the `,'. */
24507 }
24510 }
24512 /* Parse a try-block.
24514 try-block:
24515 try compound-statement handler-seq */
24517 static tree
24519 {
24520 tree try_block;
24534 }
24536 /* Parse a function-try-block.
24538 function-try-block:
24539 try ctor-initializer [opt] function-body handler-seq */
24541 static void
24543 {
24544 tree compound_stmt;
24545 tree try_block;
24547 /* Look for the `try' keyword. */
24550 /* Let the rest of the front end know where we are. */
24552 /* Parse the function-body. */
24553 cp_parser_ctor_initializer_opt_and_function_body
24555 /* We're done with the `try' part. */
24557 /* Parse the handlers. */
24559 /* We're done with the handlers. */
24561 }
24563 /* Parse a handler-seq.
24565 handler-seq:
24566 handler handler-seq [opt] */
24568 static void
24570 {
24572 {
24575 /* Parse the handler. */
24577 /* Peek at the next token. */
24579 /* If it's not `catch' then there are no more handlers. */
24582 }
24583 }
24585 /* Parse a handler.
24587 handler:
24588 catch ( exception-declaration ) compound-statement */
24590 static void
24592 {
24593 tree handler;
24594 tree declaration;
24598 matching_parens parens;
24605 }
24607 /* Parse an exception-declaration.
24609 exception-declaration:
24610 type-specifier-seq declarator
24611 type-specifier-seq abstract-declarator
24612 type-specifier-seq
24613 ...
24615 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24616 ellipsis variant is used. */
24618 static tree
24620 {
24621 cp_decl_specifier_seq type_specifiers;
24625 /* If it's an ellipsis, it's easy to handle. */
24627 {
24628 /* Consume the `...' token. */
24631 }
24633 /* Types may not be defined in exception-declarations. */
24635 parser->type_definition_forbidden_message
24638 /* Parse the type-specifier-seq. */
24642 /* If it's a `)', then there is no declarator. */
24645 else
24652 /* Restore the saved message. */
24659 }
24661 /* Parse a throw-expression.
24663 throw-expression:
24664 throw assignment-expression [opt]
24666 Returns a THROW_EXPR representing the throw-expression. */
24668 static tree
24670 {
24671 tree expression;
24676 /* Figure out whether or not there is an assignment-expression
24677 following the "throw" keyword. */
24685 else
24689 }
24691 /* GNU Extensions */
24693 /* Parse an (optional) asm-specification.
24695 asm-specification:
24696 asm ( string-literal )
24698 If the asm-specification is present, returns a STRING_CST
24699 corresponding to the string-literal. Otherwise, returns
24700 NULL_TREE. */
24702 static tree
24704 {
24706 tree asm_specification;
24708 /* Peek at the next token. */
24710 /* If the next token isn't the `asm' keyword, then there's no
24711 asm-specification. */
24715 /* Consume the `asm' token. */
24717 /* Look for the `('. */
24718 matching_parens parens;
24721 /* Look for the string-literal. */
24724 /* Look for the `)'. */
24728 }
24730 /* Parse an asm-operand-list.
24732 asm-operand-list:
24733 asm-operand
24734 asm-operand-list , asm-operand
24736 asm-operand:
24737 string-literal ( expression )
24738 [ string-literal ] string-literal ( expression )
24740 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24741 each node is the expression. The TREE_PURPOSE is itself a
24742 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24743 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24744 is a STRING_CST for the string literal before the parenthesis. Returns
24745 ERROR_MARK_NODE if any of the operands are invalid. */
24747 static tree
24749 {
24754 {
24755 tree string_literal;
24756 tree expression;
24757 tree name;
24760 {
24761 /* Consume the `[' token. */
24763 /* Read the operand name. */
24768 /* Look for the closing `]'. */
24770 }
24771 else
24773 /* Look for the string-literal. */
24776 /* Look for the `('. */
24777 matching_parens parens;
24779 /* Parse the expression. */
24781 /* Look for the `)'. */
24789 /* Add this operand to the list. */
24791 expression,
24792 asm_operands);
24793 /* If the next token is not a `,', there are no more
24794 operands. */
24797 /* Consume the `,'. */
24799 }
24802 }
24804 /* Parse an asm-clobber-list.
24806 asm-clobber-list:
24807 string-literal
24808 asm-clobber-list , string-literal
24810 Returns a TREE_LIST, indicating the clobbers in the order that they
24811 appeared. The TREE_VALUE of each node is a STRING_CST. */
24813 static tree
24815 {
24819 {
24820 tree string_literal;
24822 /* Look for the string literal. */
24824 /* Add it to the list. */
24826 /* If the next token is not a `,', then the list is
24827 complete. */
24830 /* Consume the `,' token. */
24832 }
24835 }
24837 /* Parse an asm-label-list.
24839 asm-label-list:
24840 identifier
24841 asm-label-list , identifier
24843 Returns a TREE_LIST, indicating the labels in the order that they
24844 appeared. The TREE_VALUE of each node is a label. */
24846 static tree
24848 {
24852 {
24855 /* Look for the identifier. */
24858 {
24861 {
24867 }
24868 }
24869 /* If the next token is not a `,', then the list is
24870 complete. */
24873 /* Consume the `,' token. */
24875 }
24878 }
24880 /* Return TRUE iff the next tokens in the stream are possibly the
24881 beginning of a GNU extension attribute. */
24883 static bool
24885 {
24887 }
24889 /* Return TRUE iff the next tokens in the stream are possibly the
24890 beginning of a standard C++-11 attribute specifier. */
24892 static bool
24894 {
24896 }
24898 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24899 beginning of a standard C++-11 attribute specifier. */
24901 static bool
24903 {
24911 }
24913 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24914 beginning of a GNU extension attribute. */
24916 static bool
24918 {
24922 }
24924 /* Return true iff the next tokens can be the beginning of either a
24925 GNU attribute list, or a standard C++11 attribute sequence. */
24927 static bool
24929 {
24932 }
24934 /* Return true iff the next Nth tokens can be the beginning of either
24935 a GNU attribute list, or a standard C++11 attribute sequence. */
24937 static bool
24939 {
24942 }
24944 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24945 of GNU attributes, or return NULL. */
24947 static tree
24949 {
24953 }
24955 /* Parse an (optional) series of attributes.
24957 attributes:
24958 attributes attribute
24960 attribute:
24961 __attribute__ (( attribute-list [opt] ))
24963 The return value is as for cp_parser_gnu_attribute_list. */
24965 static tree
24967 {
24974 {
24976 tree attribute_list;
24979 /* Peek at the next token. */
24981 /* If it's not `__attribute__', then we're done. */
24985 /* Consume the `__attribute__' keyword. */
24987 /* Look for the two `(' tokens. */
24988 matching_parens outer_parens;
24990 matching_parens inner_parens;
24993 /* Peek at the next token. */
24996 /* Parse the attribute-list. */
24998 else
24999 /* If the next token is a `)', then there is no attribute
25000 list. */
25003 /* Look for the two `)' tokens. */
25011 /* Add these new attributes to the list. */
25013 }
25016 }
25018 /* Parse a GNU attribute-list.
25020 attribute-list:
25021 attribute
25022 attribute-list , attribute
25024 attribute:
25025 identifier
25026 identifier ( identifier )
25027 identifier ( identifier , expression-list )
25028 identifier ( expression-list )
25030 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25031 to an attribute. The TREE_PURPOSE of each node is the identifier
25032 indicating which attribute is in use. The TREE_VALUE represents
25033 the arguments, if any. */
25035 static tree
25037 {
25043 {
25045 tree identifier;
25046 tree attribute;
25048 /* Look for the identifier. We also allow keywords here; for
25049 example `__attribute__ ((const))' is legal. */
25053 {
25056 /* Consume the token, but save it since we need it for the
25057 SIMD enabled function parsing. */
25060 /* Save away the identifier that indicates which attribute
25061 this is. */
25063 /* For keywords, use the canonical spelling, not the
25064 parsed identifier. */
25071 /* Peek at the next token. */
25073 /* If it's an `(', then parse the attribute arguments. */
25075 {
25079 vec = cp_parser_parenthesized_expression_list
25085 else
25086 {
25089 }
25090 /* Save the arguments away. */
25092 }
25095 {
25096 /* Add this attribute to the list. */
25099 }
25102 }
25103 /* Now, look for more attributes. If the next token isn't a
25104 `,', we're done. */
25108 /* Consume the comma and keep going. */
25110 }
25113 /* We built up the list in reverse order. */
25115 }
25117 /* Parse a standard C++11 attribute.
25119 The returned representation is a TREE_LIST which TREE_PURPOSE is
25120 the scoped name of the attribute, and the TREE_VALUE is its
25121 arguments list.
25123 Note that the scoped name of the attribute is itself a TREE_LIST
25124 which TREE_PURPOSE is the namespace of the attribute, and
25125 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25126 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25127 and which TREE_PURPOSE is directly the attribute name.
25129 Clients of the attribute code should use get_attribute_namespace
25130 and get_attribute_name to get the actual namespace and name of
25131 attributes, regardless of their being GNU or C++11 attributes.
25133 attribute:
25134 attribute-token attribute-argument-clause [opt]
25136 attribute-token:
25137 identifier
25138 attribute-scoped-token
25140 attribute-scoped-token:
25141 attribute-namespace :: identifier
25143 attribute-namespace:
25144 identifier
25146 attribute-argument-clause:
25147 ( balanced-token-seq )
25149 balanced-token-seq:
25150 balanced-token [opt]
25151 balanced-token-seq balanced-token
25153 balanced-token:
25154 ( balanced-token-seq )
25155 [ balanced-token-seq ]
25156 { balanced-token-seq }. */
25158 static tree
25160 {
25167 /* First, parse name of the attribute, a.k.a attribute-token. */
25184 {
25185 /* We are seeing a scoped attribute token. */
25200 else
25201 {
25205 }
25209 NULL_TREE);
25211 }
25214 NULL_TREE);
25215 else
25216 {
25219 NULL_TREE);
25220 /* C++11 noreturn attribute is equivalent to GNU's. */
25223 /* C++14 deprecated attribute is equivalent to GNU's. */
25226 /* C++17 fallthrough attribute is equivalent to GNU's. */
25229 /* Transactional Memory TS optimize_for_synchronized attribute is
25230 equivalent to GNU transaction_callable. */
25234 /* Transactional Memory attributes are GNU attributes. */
25237 }
25239 /* Now parse the optional argument clause of the attribute. */
25244 {
25250 /* A GNU attribute that takes an identifier in parameter. */
25253 vec = cp_parser_parenthesized_expression_list
25259 else
25260 {
25263 }
25267 else
25269 }
25272 }
25274 /* Check that the attribute ATTRIBUTE appears at most once in the
25275 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25276 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25277 isn't implemented yet in GCC. */
25279 static void
25281 {
25283 {
25293 }
25294 }
25296 /* Parse a list of standard C++-11 attributes.
25298 attribute-list:
25299 attribute [opt]
25300 attribute-list , attribute[opt]
25301 attribute ...
25302 attribute-list , attribute ...
25303 */
25305 static tree
25307 {
25312 {
25317 {
25321 }
25324 {
25329 else
25330 {
25335 }
25337 }
25341 }
25344 }
25346 /* Parse a standard C++-11 attribute specifier.
25348 attribute-specifier:
25349 [ [ attribute-using-prefix [opt] attribute-list ] ]
25350 alignment-specifier
25352 attribute-using-prefix:
25353 using attribute-namespace :
25355 alignment-specifier:
25356 alignas ( type-id ... [opt] )
25357 alignas ( alignment-expression ... [opt] ). */
25359 static tree
25361 {
25367 {
25374 {
25385 {
25389 "attribute using prefix only available "
25395 }
25396 else
25398 }
25405 else
25406 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25407 when we are sure that we have actually parsed them. */
25409 }
25410 else
25411 {
25412 tree alignas_expr;
25414 /* Look for an alignment-specifier. */
25425 matching_parens parens;
25433 {
25440 }
25445 /* Handle alignas (pack...). */
25447 {
25450 }
25452 /* Something went wrong, so don't build the attribute. */
25459 /* Build the C++-11 representation of an 'aligned'
25460 attribute. */
25461 attributes =
25464 alignas_expr);
25465 }
25468 }
25470 /* Parse a standard C++-11 attribute-specifier-seq.
25472 attribute-specifier-seq:
25473 attribute-specifier-seq [opt] attribute-specifier
25474 */
25476 static tree
25478 {
25483 {
25492 else
25495 }
25498 }
25500 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25501 return index of the first token after balanced-token, or N on failure. */
25503 static size_t
25505 {
25508 do
25510 {
25513 /* Ran out of tokens. */
25535 }
25538 }
25540 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25541 return index of the first token after the GNU attribute tokens, or N on
25542 failure. */
25544 static size_t
25546 {
25548 {
25560 }
25562 }
25564 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25565 next token), return index of the first token after the standard C++11
25566 attribute tokens, or N on failure. */
25568 static size_t
25570 {
25572 {
25575 {
25582 }
25585 {
25590 }
25591 else
25593 }
25595 }
25597 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25598 as the next token), return index of the first token after the attribute
25599 tokens, or N on failure. */
25601 static size_t
25603 {
25607 }
25609 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25610 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25611 current value of the PEDANTIC flag, regardless of whether or not
25612 the `__extension__' keyword is present. The caller is responsible
25613 for restoring the value of the PEDANTIC flag. */
25615 static bool
25617 {
25618 /* Save the old value of the PEDANTIC flag. */
25622 {
25623 /* Consume the `__extension__' token. */
25625 /* We're not being pedantic while the `__extension__' keyword is
25626 in effect. */
25630 }
25633 }
25635 /* Parse a label declaration.
25637 label-declaration:
25638 __label__ label-declarator-seq ;
25640 label-declarator-seq:
25641 identifier , label-declarator-seq
25642 identifier */
25644 static void
25646 {
25647 /* Look for the `__label__' keyword. */
25651 {
25652 tree identifier;
25654 /* Look for an identifier. */
25656 /* If we failed, stop. */
25659 /* Declare it as a label. */
25661 /* If the next token is a `;', stop. */
25664 /* Look for the `,' separating the label declarations. */
25666 }
25668 /* Look for the final `;'. */
25670 }
25672 // -------------------------------------------------------------------------- //
25673 // Requires Clause
25675 // Parse a requires clause.
25676 //
25677 // requires-clause:
25678 // 'requires' logical-or-expression
25679 //
25680 // The required logical-or-expression must be a constant expression. Note
25681 // that we don't check that the expression is constepxr here. We defer until
25682 // we analyze constraints and then, we only check atomic constraints.
25683 static tree
25685 {
25686 // Parse the requires clause so that it is not automatically folded.
25694 }
25696 // Optionally parse a requires clause:
25697 static tree
25699 {
25702 {
25705 {
25708 /* Parse and discard the requires-clause. */
25711 }
25713 }
25716 }
25719 /*---------------------------------------------------------------------------
25720 Requires expressions
25721 ---------------------------------------------------------------------------*/
25723 /* Parse a requires expression
25725 requirement-expression:
25726 'requires' requirement-parameter-list [opt] requirement-body */
25727 static tree
25729 {
25733 /* A requires-expression shall appear only within a concept
25734 definition or a requires-clause.
25736 TODO: Implement this diagnostic correctly. */
25738 {
25742 }
25745 {
25746 /* Local parameters are delared as variables within the scope
25747 of the expression. They are not visible past the end of
25748 the expression. Expressions within the requires-expression
25749 are unevaluated. */
25750 struct scope_sentinel
25751 {
25753 {
25756 }
25759 {
25762 }
25765 /* Parse the optional parameter list. */
25767 {
25771 }
25772 else
25775 /* Parse the requirement body. */
25779 }
25781 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25782 the parm chain. */
25785 }
25787 /* Parse a parameterized requirement.
25789 requirement-parameter-list:
25790 '(' parameter-declaration-clause ')' */
25791 static tree
25793 {
25794 matching_parens parens;
25804 }
25806 /* Parse the body of a requirement.
25808 requirement-body:
25809 '{' requirement-list '}' */
25810 static tree
25812 {
25813 matching_braces braces;
25823 }
25825 /* Parse a list of requirements.
25827 requirement-list:
25828 requirement
25829 requirement-list ';' requirement[opt] */
25830 static tree
25832 {
25835 {
25842 /* If we see a semi-colon, consume it. */
25846 /* Stop processing at the end of the list. */
25849 }
25851 /* Reverse the order of requirements so they are analyzed in
25852 declaration order. */
25854 }
25856 /* Parse a syntactic requirement or type requirement.
25858 requirement:
25859 simple-requirement
25860 compound-requirement
25861 type-requirement
25862 nested-requirement */
25863 static tree
25865 {
25872 else
25874 }
25876 /* Parse a simple requirement.
25878 simple-requirement:
25879 expression ';' */
25880 static tree
25882 {
25891 }
25893 /* Parse a type requirement
25895 type-requirement
25896 nested-name-specifier [opt] required-type-name ';'
25898 required-type-name:
25899 type-name
25900 'template' [opt] simple-template-id */
25901 static tree
25903 {
25906 // Save the scope before parsing name specifiers.
25917 tree type;
25919 {
25928 }
25929 else
25948 }
25950 /* Parse a compound requirement
25952 compound-requirement:
25953 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25954 static tree
25956 {
25957 /* Parse an expression enclosed in '{ }'s. */
25958 matching_braces braces;
25969 /* Parse the optional noexcept. */
25972 {
25975 }
25977 /* Parse the optional trailing return type. */
25980 {
25988 }
25991 }
25993 /* Parse a nested requirement. This is the same as a requires clause.
25995 nested-requirement:
25996 requires-clause */
25997 static tree
25999 {
26005 }
26007 /* Support Functions */
26009 /* Return the appropriate prefer_type argument for lookup_name_real based on
26010 tag_type and template_mem_access. */
26014 {
26015 /* DR 141: When looking in the current enclosing context for a template-name
26016 after -> or ., only consider class templates. */
26020 {
26024 }
26025 }
26027 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26028 NAME should have one of the representations used for an
26029 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26030 is returned. If PARSER->SCOPE is a dependent type, then a
26031 SCOPE_REF is returned.
26033 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26034 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26035 was formed. Abstractly, such entities should not be passed to this
26036 function, because they do not need to be looked up, but it is
26037 simpler to check for this special case here, rather than at the
26038 call-sites.
26040 In cases not explicitly covered above, this function returns a
26041 DECL, OVERLOAD, or baselink representing the result of the lookup.
26042 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26043 is returned.
26045 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26046 (e.g., "struct") that was used. In that case bindings that do not
26047 refer to types are ignored.
26049 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26050 ignored.
26052 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26053 are ignored.
26055 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26056 types.
26058 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26059 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26060 NULL_TREE otherwise. */
26062 static cp_expr
26069 location_t name_location)
26070 {
26071 tree decl;
26074 /* Assume that the lookup will be unambiguous. */
26078 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26079 no longer valid. Note that if we are parsing tentatively, and
26080 the parse fails, OBJECT_TYPE will be automatically restored. */
26086 /* A template-id has already been resolved; there is no lookup to
26087 do. */
26091 {
26095 }
26097 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26098 it should already have been checked to make sure that the name
26099 used matches the type being destroyed. */
26101 {
26102 tree type;
26104 /* Figure out to which type this destructor applies. */
26109 else
26111 /* If that's not a class type, there is no destructor. */
26122 }
26124 /* By this point, the NAME should be an ordinary identifier. If
26125 the id-expression was a qualified name, the qualifying scope is
26126 stored in PARSER->SCOPE at this point. */
26129 /* Perform the lookup. */
26131 {
26137 /* If the SCOPE is dependent, the lookup must be deferred until
26138 the template is instantiated -- unless we are explicitly
26139 looking up names in uninstantiated templates. Even then, we
26140 cannot look up the name if the scope is not a class type; it
26141 might, for example, be a template type parameter. */
26146 /* Defer lookup. */
26148 else
26149 {
26152 /* If PARSER->SCOPE is a dependent type, then it must be a
26153 class type, and we must not be checking dependencies;
26154 otherwise, we would have processed this lookup above. So
26155 that PARSER->SCOPE is not considered a dependent base by
26156 lookup_member, we must enter the scope here. */
26160 /* If the PARSER->SCOPE is a template specialization, it
26161 may be instantiated during name lookup. In that case,
26162 errors may be issued. Even if we rollback the current
26163 tentative parse, those errors are valid. */
26168 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26169 lookup result and the nested-name-specifier nominates a class C:
26170 * if the name specified after the nested-name-specifier, when
26171 looked up in C, is the injected-class-name of C (Clause 9), or
26172 * if the name specified after the nested-name-specifier is the
26173 same as the identifier or the simple-template-id's template-
26174 name in the last component of the nested-name-specifier,
26175 the name is instead considered to name the constructor of
26176 class C. [ Note: for example, the constructor is not an
26177 acceptable lookup result in an elaborated-type-specifier so
26178 the constructor would not be used in place of the
26179 injected-class-name. --end note ] Such a constructor name
26180 shall be used only in the declarator-id of a declaration that
26181 names a constructor or in a using-declaration. */
26189 /* If we have a single function from a using decl, pull it out. */
26196 }
26198 /* If the scope is a dependent type and either we deferred lookup or
26199 we did lookup but didn't find the name, rememeber the name. */
26202 {
26204 {
26205 tree type;
26207 /* The resolution to Core Issue 180 says that `struct
26208 A::B' should be considered a type-name, even if `A'
26209 is dependent. */
26214 }
26218 CPP_CLOSE_PAREN)))
26222 else
26225 is_template);
26226 }
26229 }
26231 {
26232 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26233 OBJECT_TYPE is not a class. */
26235 /* If the OBJECT_TYPE is a template specialization, it may
26236 be instantiated during name lookup. In that case, errors
26237 may be issued. Even if we rollback the current tentative
26238 parse, those errors are valid. */
26240 name,
26243 tf_warning_or_error);
26244 else
26248 /* Look it up in the enclosing context. DR 141: When looking for a
26249 template-name after -> or ., only consider class templates. */
26254 /* The object is type-dependent, so we can't look anything up; we used
26255 this to get the DR 141 behavior. */
26259 }
26260 else
26261 {
26267 }
26269 /* If the lookup failed, let our caller know. */
26273 /* Pull out the template from an injected-class-name (or multiple). */
26277 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26279 {
26282 /* The error message we have to print is too complicated for
26283 cp_parser_error, so we incorporate its actions directly. */
26285 {
26287 name);
26289 }
26291 }
26299 /* If we have resolved the name of a member declaration, check to
26300 see if the declaration is accessible. When the name resolves to
26301 set of overloaded functions, accessibility is checked when
26302 overload resolution is done.
26304 During an explicit instantiation, access is not checked at all,
26305 as per [temp.explicit]. */
26312 }
26314 /* Like cp_parser_lookup_name, but for use in the typical case where
26315 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26316 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26318 static tree
26320 {
26322 none_type,
26327 location);
26328 }
26330 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26331 the current context, return the TYPE_DECL. If TAG_NAME_P is
26332 true, the DECL indicates the class being defined in a class-head,
26333 or declared in an elaborated-type-specifier.
26335 Otherwise, return DECL. */
26337 static tree
26339 {
26340 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26341 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26343 struct A {
26344 template <typename T> struct B;
26345 };
26347 template <typename T> struct A::B {};
26349 Similarly, in an elaborated-type-specifier:
26351 namespace N { struct X{}; }
26353 struct A {
26354 template <typename T> friend struct N::X;
26355 };
26357 However, if the DECL refers to a class type, and we are in
26358 the scope of the class, then the name lookup automatically
26359 finds the TYPE_DECL created by build_self_reference rather
26360 than a TEMPLATE_DECL. For example, in:
26362 template <class T> struct S {
26363 S s;
26364 };
26366 there is no need to handle such case. */
26372 }
26374 /* If too many, or too few, template-parameter lists apply to the
26375 declarator, issue an error message. Returns TRUE if all went well,
26376 and FALSE otherwise. */
26378 static bool
26381 location_t declarator_location)
26382 {
26384 {
26386 {
26394 /* If the DECLARATOR has the form `X<y>' then it uses one
26395 additional level of template parameters. */
26398 return cp_parser_check_template_parameters
26400 }
26416 }
26418 }
26420 /* NUM_TEMPLATES were used in the current declaration. If that is
26421 invalid, return FALSE and issue an error messages. Otherwise,
26422 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26423 declarator and we can print more accurate diagnostics. */
26425 static bool
26428 location_t location,
26430 {
26431 /* If there are the same number of template classes and parameter
26432 lists, that's OK. */
26435 /* If there are more, but only one more, then we are referring to a
26436 member template. That's OK too. */
26439 /* If there are more template classes than parameter lists, we have
26440 something like:
26442 template <class T> void S<T>::R<T>::f (); */
26444 {
26454 else
26457 }
26458 /* Otherwise, there are too many template parameter lists. We have
26459 something like:
26461 template <class T> template <class U> void S::f(); */
26464 }
26466 /* Parse an optional `::' token indicating that the following name is
26467 from the global namespace. If so, PARSER->SCOPE is set to the
26468 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26469 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26470 Returns the new value of PARSER->SCOPE, if the `::' token is
26471 present, and NULL_TREE otherwise. */
26473 static tree
26475 {
26478 /* Peek at the next token. */
26480 /* If we're looking at a `::' token then we're starting from the
26481 global namespace, not our current location. */
26483 {
26484 /* Consume the `::' token. */
26486 /* Set the SCOPE so that we know where to start the lookup. */
26492 }
26494 {
26498 }
26501 }
26503 /* Returns TRUE if the upcoming token sequence is the start of a
26504 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26505 declarator is preceded by the `friend' specifier. */
26507 static bool
26509 {
26512 tree nested_name_specifier;
26515 /* The common case is that this is not a constructor declarator, so
26516 try to avoid doing lots of work if at all possible. It's not
26517 valid declare a constructor at function scope. */
26520 /* And only certain tokens can begin a constructor declarator. */
26528 /* Parse tentatively; we are going to roll back all of the tokens
26529 consumed here. */
26531 /* Assume that we are looking at a constructor declarator. */
26534 /* Look for the optional `::' operator. */
26537 /* Look for the nested-name-specifier. */
26538 nested_name_specifier
26549 /* Outside of a class-specifier, there must be a
26550 nested-name-specifier. Except in C++17 mode, where we
26551 might be declaring a guiding declaration. */
26558 /* If we have a class scope, this is easy; DR 147 says that S::S always
26559 names the constructor, and no other qualified name could. */
26562 {
26572 }
26573 /* If we still think that this might be a constructor-declarator,
26574 look for a class-name. */
26576 {
26577 /* If we have:
26579 template <typename T> struct S {
26580 S();
26581 };
26583 we must recognize that the nested `S' names a class. */
26587 tree type_decl;
26591 none_type,
26598 {
26604 none_type,
26609 else
26611 }
26613 /* If there was no class-name, then this is not a constructor.
26614 Otherwise, if we are in a class-specifier and we aren't
26615 handling a friend declaration, check that its type matches
26616 current_class_type (c++/38313). Note: error_mark_node
26617 is left alone for error recovery purposes. */
26619 && (outside_class_specifier_p
26625 /* If we're still considering a constructor, we have to see a `(',
26626 to begin the parameter-declaration-clause, followed by either a
26627 `)', an `...', or a decl-specifier. We need to check for a
26628 type-specifier to avoid being fooled into thinking that:
26630 S (f) (int);
26632 is a constructor. (It is actually a function named `f' that
26633 takes one parameter (of type `int') and returns a value of type
26634 `S'. */
26642 /* A parameter declaration begins with a decl-specifier,
26643 which is either the "attribute" keyword, a storage class
26644 specifier, or (usually) a type-specifier. */
26646 {
26647 tree type;
26651 /* Names appearing in the type-specifier should be looked up
26652 in the scope of the class. */
26656 {
26659 {
26663 {
26666 }
26667 }
26669 }
26671 /* Inside the constructor parameter list, surrounding
26672 template-parameter-lists do not apply. */
26673 saved_num_template_parameter_lists
26677 /* Look for the type-specifier. */
26679 CP_PARSER_FLAGS_NONE,
26685 parser->num_template_parameter_lists
26688 /* Leave the scope of the class. */
26693 }
26694 }
26696 /* We did not really want to consume any tokens. */
26700 }
26702 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26703 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26704 they must be performed once we are in the scope of the function.
26706 Returns the function defined. */
26708 static tree
26709 cp_parser_function_definition_from_specifiers_and_declarator
26712 tree attributes,
26714 {
26715 tree fn;
26718 /* Begin the function-definition. */
26721 /* The things we're about to see are not directly qualified by any
26722 template headers we've seen thus far. */
26725 /* If there were names looked up in the decl-specifier-seq that we
26726 did not check, check them now. We must wait until we are in the
26727 scope of the function to perform the checks, since the function
26728 might be a friend. */
26732 {
26737 }
26740 {
26741 /* Skip the entire function. */
26744 }
26746 {
26747 /* Seen already, skip it. An error message has already been output. */
26751 /* If this is a function from a class, pop the nested class. */
26754 }
26755 else
26756 {
26757 timevar_id_t tv;
26760 else
26766 }
26769 }
26771 /* Parse the part of a function-definition that follows the
26772 declarator. INLINE_P is TRUE iff this function is an inline
26773 function defined within a class-specifier.
26775 Returns the function defined. */
26777 static tree
26780 {
26781 tree fn;
26786 bool fully_implicit_function_template_p
26789 tree implicit_template_parms
26792 cp_binding_level* implicit_template_scope
26798 /* If the next token is `return', then the code may be trying to
26799 make use of the "named return value" extension that G++ used to
26800 support. */
26803 {
26804 /* Consume the `return' keyword. */
26806 /* Look for the identifier that indicates what value is to be
26807 returned. */
26809 /* Issue an error message. */
26812 /* Skip tokens until we reach the start of the function body. */
26814 {
26821 }
26822 }
26823 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26824 anything declared inside `f'. */
26825 saved_in_unbraced_linkage_specification_p
26828 /* Inside the function, surrounding template-parameter-lists do not
26829 apply. */
26830 saved_num_template_parameter_lists
26834 /* If the next token is `try', `__transaction_atomic', or
26835 `__transaction_relaxed`, then we are looking at either function-try-block
26836 or function-transaction-block. Note that all of these include the
26837 function-body. */
26841 RID_TRANSACTION_RELAXED))
26845 else
26846 cp_parser_ctor_initializer_opt_and_function_body
26849 /* Finish the function. */
26851 /* Generate code for it, if necessary. */
26853 /* Restore the saved values. */
26854 parser->in_unbraced_linkage_specification_p
26856 parser->num_template_parameter_lists
26860 parser->fully_implicit_function_template_p
26862 parser->implicit_template_parms
26864 parser->implicit_template_scope
26871 }
26873 /* Parse a template-declaration body (following argument list). */
26875 static void
26877 tree parameter_list,
26879 {
26883 /* We just processed one more parameter list. */
26886 /* Get the deferred access checks from the parameter list. These
26887 will be checked once we know what is being declared, as for a
26888 member template the checks must be performed in the scope of the
26889 class containing the member. */
26892 /* Tentatively parse for a new template parameter list, which can either be
26893 the template keyword or a template introduction. */
26899 else
26900 {
26901 /* There are no access checks when parsing a template, as we do not
26902 know if a specialization will be a friend. */
26906 checks,
26907 member_p,
26912 /* If this is a member template declaration, let the front
26913 end know. */
26915 {
26920 }
26925 }
26926 /* We are done with the current parameter list. */
26931 /* Finish up. */
26934 /* Check the template arguments for a literal operator template. */
26938 {
26942 else
26943 {
26946 {
26952 }
26954 {
26963 }
26964 else
26966 }
26968 {
26971 " Expected non-type template argument pack <char...>"
26973 decl);
26974 else
26977 decl);
26978 }
26979 }
26981 /* Register member declarations. */
26984 /* If DECL is a function template, we must return to parse it later.
26985 (Even though there is no definition, there might be default
26986 arguments that need handling.) */
26990 }
26992 /* Parse a template introduction header for a template-declaration. Returns
26993 false if tentative parse fails. */
26995 static bool
26997 {
27004 /* Look for the optional `::' operator. */
27007 /* Look for the nested-name-specifier. */
27017 /* Look up the concept for which we will be matching
27018 template parameters. */
27028 /* Look for opening brace for introduction. */
27029 matching_braces braces;
27037 /* Build vector of placeholder parameters and grab
27038 matching identifiers. */
27041 /* The introduction-list shall not be empty. */
27044 {
27047 }
27049 /* Look for closing brace for introduction. */
27054 {
27058 }
27060 /* Build and associate the constraint. */
27063 {
27065 member_p);
27067 }
27071 }
27073 /* Parse a normal template-declaration following the template keyword. */
27075 static void
27077 {
27078 tree parameter_list;
27082 /* Look for the `<' token. */
27086 {
27087 /* 14.5.2.2 [temp.mem]
27089 A local class shall not have member templates. */
27094 }
27095 /* [temp]
27097 A template ... shall not have C linkage. */
27099 {
27102 /* Give it C++ linkage to avoid confusing other parts of the
27103 front end. */
27106 }
27107 else
27110 /* We cannot perform access checks on the template parameter
27111 declarations until we know what is being declared, just as we
27112 cannot check the decl-specifier list. */
27115 /* If the next token is `>', then we have an invalid
27116 specialization. Rather than complain about an invalid template
27117 parameter, issue an error message here. */
27119 {
27123 }
27124 else
27125 {
27126 /* Parse the template parameters. */
27128 }
27130 /* Look for the `>'. */
27133 /* Manage template requirements */
27135 {
27140 }
27143 member_p);
27145 /* For the erroneous case of a template with C linkage, we pushed an
27146 implicit C++ linkage scope; exit that scope now. */
27149 }
27151 /* Parse a template-declaration, assuming that the `export' (and
27152 `extern') keywords, if present, has already been scanned. MEMBER_P
27153 is as for cp_parser_template_declaration. */
27155 static bool
27157 {
27159 {
27163 }
27168 }
27170 /* Perform the deferred access checks from a template-parameter-list.
27171 CHECKS is a TREE_LIST of access checks, as returned by
27172 get_deferred_access_checks. */
27174 static void
27175 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27176 {
27180 }
27182 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27183 `function-definition' sequence that follows a template header.
27184 If MEMBER_P is true, this declaration appears in a class scope.
27186 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27187 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27189 static tree
27195 {
27198 cp_decl_specifier_seq decl_specifiers;
27202 /* This function is only used when processing a template
27203 declaration. */
27207 /* Defer access checks until we know what is being declared. */
27210 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27211 alternative. */
27214 CP_PARSER_FLAGS_OPTIONAL,
27220 /* There are no template typedefs. */
27222 {
27226 }
27228 /* Gather up the access checks that occurred the
27229 decl-specifier-seq. */
27232 /* Check for the declaration of a template class. */
27234 {
27237 {
27238 // If this is a declaration, but not a definition, associate
27239 // any constraints with the type declaration. Constraints
27240 // are associated with definitions in cp_parser_class_specifier.
27246 /* In this case:
27248 struct C {
27249 friend template <typename T> struct A<T>::B;
27250 };
27252 A<T>::B will be represented by a TYPENAME_TYPE, and
27253 therefore not recognized by shadow_tag. */
27255 && !decl
27262 else
27265 /* Perform access checks for template parameters. */
27268 /* Give a helpful diagnostic for
27269 template <class T> struct A { } a;
27270 if we aren't already recovering from an error. */
27273 {
27275 "a class template declaration must not declare "
27279 }
27280 }
27281 }
27283 /* Complain about missing 'typename' or other invalid type names. */
27286 {
27287 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27288 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27289 the rest of this declaration. */
27292 }
27294 /* If it's not a template class, try for a template function. If
27295 the next token is a `;', then this declaration does not declare
27296 anything. But, if there were errors in the decl-specifiers, then
27297 the error might well have come from an attempted class-specifier.
27298 In that case, there's no need to warn about a missing declarator. */
27302 {
27305 checks,
27307 member_p,
27308 declares_class_or_enum,
27312 /* 7.1.1-1 [dcl.stc]
27314 A storage-class-specifier shall not be specified in an explicit
27315 specialization... */
27317 && explicit_specialization_p
27319 {
27323 }
27327 }
27329 /* Look for a trailing `;' after the declaration. */
27335 out:
27338 /* Clear any current qualification; whatever comes next is the start
27339 of something new. */
27345 }
27347 /* Parse a cast-expression that is not the operand of a unary "&". */
27349 static cp_expr
27351 {
27354 }
27356 /* Parse a functional cast to TYPE. Returns an expression
27357 representing the cast. */
27359 static cp_expr
27361 {
27363 tree expression_list;
27364 cp_expr cast;
27373 {
27383 /* Create a location of the form:
27384 type_name{i, f}
27385 ^~~~~~~~~~~~~~~
27386 with caret == start at the start of the type name,
27387 finishing at the closing brace. */
27388 location_t finish_loc
27391 finish_loc);
27394 }
27403 else
27404 {
27407 }
27410 tf_warning_or_error);
27411 /* [expr.const]/1: In an integral constant expression "only type
27412 conversions to integral or enumeration type can be used". */
27418 NIC_CONSTRUCTOR))
27421 /* Create a location of the form:
27422 float(i)
27423 ^~~~~~~~
27424 with caret == start at the start of the type name,
27425 finishing at the closing paren. */
27426 location_t finish_loc
27431 }
27433 /* Save the tokens that make up the body of a member function defined
27434 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27435 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27436 specifiers applied to the declaration. Returns the FUNCTION_DECL
27437 for the member function. */
27439 static tree
27443 tree attributes)
27444 {
27447 tree fn;
27450 /* Create the FUNCTION_DECL. */
27454 /* If something went badly wrong, bail out now. */
27456 {
27457 /* If there's a function-body, skip it. */
27462 }
27464 /* Remember it, if there default args to post process. */
27467 /* Save away the tokens that make up the body of the
27468 function. */
27474 RID_TRANSACTION_ATOMIC))
27475 {
27477 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27484 {
27490 }
27491 else
27494 {
27498 }
27499 }
27501 /* Handle function try blocks. */
27503 {
27506 }
27507 /* We can have braced-init-list mem-initializers before the fn body. */
27509 {
27512 {
27513 /* cache_group will stop after an un-nested { } pair, too. */
27517 /* variadic mem-inits have ... after the ')'. */
27520 }
27521 }
27523 /* Handle function try blocks. */
27529 /* Save away the inline definition; we will process it when the
27530 class is complete. */
27534 /* We need to know that this was defined in the class, so that
27535 friend templates are handled correctly. */
27538 /* Add FN to the queue of functions to be parsed later. */
27542 }
27544 /* Save the tokens that make up the in-class initializer for a non-static
27545 data member. Returns a DEFAULT_ARG. */
27547 static tree
27549 {
27551 }
27553 /* Parse a template-argument-list, as well as the trailing ">" (but
27554 not the opening "<"). See cp_parser_template_argument_list for the
27555 return value. */
27557 static tree
27559 {
27560 tree arguments;
27561 tree saved_scope;
27562 tree saved_qualifying_scope;
27563 tree saved_object_scope;
27568 /* [temp.names]
27570 When parsing a template-id, the first non-nested `>' is taken as
27571 the end of the template-argument-list rather than a greater-than
27572 operator. */
27573 saved_greater_than_is_operator_p
27576 /* Parsing the argument list may modify SCOPE, so we save it
27577 here. */
27581 /* We need to evaluate the template arguments, even though this
27582 template-id may be nested within a "sizeof". */
27587 /* Parse the template-argument-list itself. */
27591 else
27593 /* Look for the `>' that ends the template-argument-list. If we find
27594 a '>>' instead, it's probably just a typo. */
27596 {
27598 {
27599 /* In C++0x, a `>>' in a template argument list or cast
27600 expression is considered to be two separate `>'
27601 tokens. So, change the current token to a `>', but don't
27602 consume it: it will be consumed later when the outer
27603 template argument list (or cast expression) is parsed.
27604 Note that this replacement of `>' for `>>' is necessary
27605 even if we are parsing tentatively: in the tentative
27606 case, after calling
27607 cp_parser_enclosed_template_argument_list we will always
27608 throw away all of the template arguments and the first
27609 closing `>', either because the template argument list
27610 was erroneous or because we are replacing those tokens
27611 with a CPP_TEMPLATE_ID token. The second `>' (which will
27612 not have been thrown away) is needed either to close an
27613 outer template argument list or to complete a new-style
27614 cast. */
27617 }
27619 {
27620 /* If we're in a nested template argument list, the '>>' has
27621 to be a typo for '> >'. We emit the error message, but we
27622 continue parsing and we push a '>' as next token, so that
27623 the argument list will be parsed correctly. Note that the
27624 global source location is still on the token before the
27625 '>>', so we need to say explicitly where we want it. */
27633 }
27634 else
27635 {
27636 /* If this is not a nested template argument list, the '>>'
27637 is a typo for '>'. Emit an error message and continue.
27638 Same deal about the token location, but here we can get it
27639 right by consuming the '>>' before issuing the diagnostic. */
27642 "spurious %<>>%>, use %<>%> to terminate "
27644 }
27645 }
27646 else
27648 /* The `>' token might be a greater-than operator again now. */
27649 parser->greater_than_is_operator_p
27651 /* Restore the SAVED_SCOPE. */
27659 }
27661 /* MEMBER_FUNCTION is a member function, or a friend. If default
27662 arguments, or the body of the function have not yet been parsed,
27663 parse them now. */
27665 static void
27667 {
27669 /* If this member is a template, get the underlying
27670 FUNCTION_DECL. */
27674 /* There should not be any class definitions in progress at this
27675 point; the bodies of members are only parsed outside of all class
27676 definitions. */
27678 /* While we're parsing the member functions we might encounter more
27679 classes. We want to handle them right away, but we don't want
27680 them getting mixed up with functions that are currently in the
27681 queue. */
27684 /* Make sure that any template parameters are in scope. */
27687 /* If the body of the function has not yet been parsed, parse it
27688 now. */
27690 {
27691 tree function_scope;
27694 /* The function is no longer pending; we are processing it. */
27699 /* If this is a local class, enter the scope of the containing
27700 function. */
27705 /* Push the body of the function onto the lexer stack. */
27708 /* Let the front end know that we going to be defining this
27709 function. */
27713 /* Don't do access checking if it is a templated function. */
27717 /* #pragma omp declare reduction needs special parsing. */
27719 {
27724 }
27725 else
27726 /* Now, parse the body of the function. */
27733 /* Leave the scope of the containing function. */
27737 }
27739 /* Remove any template parameters from the symbol table. */
27742 /* Restore the queue. */
27745 }
27747 /* If DECL contains any default args, remember it on the unparsed
27748 functions queue. */
27750 static void
27752 {
27753 tree probe;
27756 probe;
27759 {
27763 }
27764 }
27766 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27767 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27768 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27769 from the parameter-type-list. */
27771 static tree
27774 {
27776 tree parsed_arg;
27782 /* Push the saved tokens for the default argument onto the parser's
27783 lexer stack. */
27789 /* Parse the default argument. */
27800 {
27801 /* In a non-template class, check conversions now. In a template,
27802 we'll wait and instantiate these as needed. */
27805 tf_warning_or_error);
27808 else
27810 }
27812 /* If the token stream has not been completely used up, then
27813 there was extra junk after the end of the default
27814 argument. */
27816 {
27819 else
27821 }
27823 /* Revert to the main lexer. */
27827 }
27829 /* FIELD is a non-static data member with an initializer which we saved for
27830 later; parse it now. */
27832 static void
27834 {
27835 tree def;
27842 NULL_TREE);
27848 }
27850 /* FN is a FUNCTION_DECL which may contains a parameter with an
27851 unparsed DEFAULT_ARG. Parse the default args now. This function
27852 assumes that the current scope is the scope in which the default
27853 argument should be processed. */
27855 static void
27857 {
27861 /* While we're parsing the default args, we might (due to the
27862 statement expression extension) encounter more classes. We want
27863 to handle them right away, but we don't want them getting mixed
27864 up with default args that are currently in the queue. */
27867 /* Local variable names (and the `this' keyword) may not appear
27868 in a default argument. */
27879 {
27881 tree parsed_arg;
27883 tree copy;
27890 /* This can happen for a friend declaration for a function
27891 already declared with default arguments. */
27894 parsed_arg
27896 default_arg,
27900 /* Update any instantiations we've already created. */
27904 }
27908 /* Make sure no default arg is missing. */
27911 /* Restore the state of local_variables_forbidden_p. */
27914 /* Restore the queue. */
27916 }
27918 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27920 sizeof ... ( identifier )
27922 where the 'sizeof' token has already been consumed. */
27924 static tree
27926 {
27927 /* Consume the `...'. */
27931 matching_parens parens;
27935 else
27943 /* The name is not qualified. */
27962 }
27964 /* Parse the operand of `sizeof' (or a similar operator). Returns
27965 either a TYPE or an expression, depending on the form of the
27966 input. The KEYWORD indicates which kind of expression we have
27967 encountered. */
27969 static tree
27971 {
27978 /* If it's a `...', then we are computing the length of a parameter
27979 pack. */
27984 /* Types cannot be defined in a `sizeof' expression. Save away the
27985 old message. */
27987 /* And create the new one. */
27993 /* The restrictions on constant-expressions do not apply inside
27994 sizeof expressions. */
27995 saved_integral_constant_expression_p
27997 saved_non_integral_constant_expression_p
28001 /* Do not actually evaluate the expression. */
28004 /* If it's a `(', then we might be looking at the type-id
28005 construction. */
28007 {
28010 /* We can't be sure yet whether we're looking at a type-id or an
28011 expression. */
28014 matching_parens parens;
28017 /* Note: as a GNU Extension, compound literals are considered
28018 postfix-expressions as they are in C99, so they are valid
28019 arguments to sizeof. See comment in cp_parser_cast_expression
28020 for details. */
28023 else
28024 {
28027 /* Look for the type-id. */
28029 /* Look for the closing `)'. */
28032 }
28034 /* If all went well, then we're done. */
28036 {
28037 cp_decl_specifier_seq decl_specs;
28039 /* Build a trivial decl-specifier-seq. */
28043 /* Call grokdeclarator to figure out what type this is. */
28046 TYPENAME,
28049 }
28050 }
28052 /* If the type-id production did not work out, then we must be
28053 looking at the unary-expression production. */
28057 /* Go back to evaluating expressions. */
28061 /* Free the message we created. */
28063 /* And restore the old one. */
28065 parser->integral_constant_expression_p
28067 parser->non_integral_constant_expression_p
28071 }
28073 /* If the current declaration has no declarator, return true. */
28075 static bool
28077 {
28078 /* If the next token is a `;' or a `,' then there is no
28079 declarator. */
28082 }
28084 /* Update the DECL_SPECS to reflect the storage class indicated by
28085 KEYWORD. */
28087 static void
28092 {
28093 cp_storage_class storage_class;
28096 {
28100 }
28102 {
28105 }
28110 {
28113 }
28116 {
28134 }
28138 /* A storage class specifier cannot be applied alongside a typedef
28139 specifier. If there is a typedef specifier present then set
28140 conflicting_specifiers_p which will trigger an error later
28141 on in grokdeclarator. */
28144 }
28146 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28147 is true, the type is a class or enum definition. */
28149 static void
28151 tree type_spec,
28154 {
28157 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28158 (with, for example, in "typedef int wchar_t;") we remember that
28159 this is what happened. In system headers, we ignore these
28160 declarations so that G++ can work with system headers that are not
28161 C++-safe. */
28163 && !type_definition_p
28173 {
28176 ds_redefined_builtin_type_spec,
28177 token);
28179 {
28183 }
28184 }
28187 else
28188 {
28193 }
28194 }
28196 /* True iff TOKEN is the GNU keyword __thread. */
28198 static bool
28200 {
28203 }
28205 /* Set the location for a declarator specifier and check if it is
28206 duplicated.
28208 DECL_SPECS is the sequence of declarator specifiers onto which to
28209 set the location.
28211 DS is the single declarator specifier to set which location is to
28212 be set onto the existing sequence of declarators.
28214 LOCATION is the location for the declarator specifier to
28215 consider. */
28217 static void
28220 {
28229 {
28233 }
28234 else
28235 {
28237 {
28241 else
28242 {
28245 OPT_Wlong_long,
28247 }
28248 }
28250 {
28255 else
28256 {
28260 }
28261 }
28262 else
28263 {
28279 "__complex"
28280 };
28284 }
28285 }
28286 }
28288 /* Return true iff the declarator specifier DS is present in the
28289 sequence of declarator specifiers DECL_SPECS. */
28291 bool
28293 cp_decl_spec ds)
28294 {
28301 }
28303 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28304 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28306 static bool
28308 {
28310 }
28312 /* Issue an error message indicating that TOKEN_DESC was expected.
28313 If KEYWORD is true, it indicated this function is called by
28314 cp_parser_require_keword and the required token can only be
28315 a indicated keyword.
28317 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28318 within any error as the location of an "opening" token matching
28319 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28320 RT_CLOSE_PAREN). */
28322 static void
28324 required_token token_desc,
28326 location_t matching_location)
28327 {
28333 {
28402 }
28405 {
28407 {
28485 }
28486 }
28490 }
28493 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28494 issue an error message indicating that TOKEN_DESC was expected.
28496 Returns the token consumed, if the token had the appropriate type.
28497 Otherwise, returns NULL.
28499 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28500 within any error as the location of an "opening" token matching
28501 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28502 RT_CLOSE_PAREN). */
28507 required_token token_desc,
28508 location_t matching_location)
28509 {
28512 else
28513 {
28514 /* Output the MESSAGE -- unless we're parsing tentatively. */
28517 matching_location);
28519 }
28520 }
28522 /* An error message is produced if the next token is not '>'.
28523 All further tokens are skipped until the desired token is
28524 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28526 static void
28528 {
28529 /* Current level of '< ... >'. */
28531 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28534 /* Are we ready, yet? If not, issue error message. */
28538 /* Skip tokens until the desired token is found. */
28540 {
28541 /* Peek at the next token. */
28543 {
28551 /* C++0x views the `>>' operator as two `>' tokens, but
28552 C++98 does not. */
28555 {
28556 /* We've hit a `>>' where the first `>' closes the
28557 template argument list, and the second `>' is
28558 spurious. Just consume the `>>' and stop; we've
28559 already produced at least one error. */
28562 }
28563 /* Fall through for C++0x, so we handle the second `>' in
28564 the `>>'. */
28569 {
28570 /* We've reached the token we want, consume it and stop. */
28573 }
28592 /* The '>' was probably forgotten, don't look further. */
28597 }
28599 /* Consume this token. */
28601 }
28602 }
28604 /* If the next token is the indicated keyword, consume it. Otherwise,
28605 issue an error message indicating that TOKEN_DESC was expected.
28607 Returns the token consumed, if the token had the appropriate type.
28608 Otherwise, returns NULL. */
28613 required_token token_desc)
28614 {
28618 {
28620 UNKNOWN_LOCATION);
28622 }
28625 }
28627 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28628 function-definition. */
28630 static bool
28632 {
28635 /* A ctor-initializer begins with a `:'. */
28637 /* A function-try-block begins with `try'. */
28639 /* A function-transaction-block begins with `__transaction_atomic'
28640 or `__transaction_relaxed'. */
28643 /* The named return value extension begins with `return'. */
28645 }
28647 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28648 definition. */
28650 static bool
28652 {
28659 }
28661 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28662 C++0x) ending a template-argument. */
28664 static bool
28666 {
28674 }
28676 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28677 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28679 static bool
28682 {
28688 /* Check for the sequence `<::' in the original code. It would be lexed as
28689 `[:', where `[' is a digraph, and there is no whitespace before
28690 `:'. */
28692 {
28697 }
28699 }
28701 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28702 or none_type otherwise. */
28704 static enum tag_types
28706 {
28708 {
28718 }
28719 }
28721 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28722 or none_type otherwise or if the token is null. */
28724 static enum tag_types
28726 {
28731 {
28739 }
28740 }
28742 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28744 static void
28746 {
28750 {
28754 type))
28757 }
28758 }
28760 /* Issue an error message if DECL is redeclared with different
28761 access than its original declaration [class.access.spec/3].
28762 This applies to nested classes, nested class templates and
28763 enumerations [class.mem/1]. */
28765 static void
28767 {
28778 }
28780 /* Look for the `template' keyword, as a syntactic disambiguator.
28781 Return TRUE iff it is present, in which case it will be
28782 consumed. */
28784 static bool
28786 {
28788 {
28789 /* In C++98 the `template' keyword can only be used within templates;
28790 outside templates the parser can always figure out what is a
28791 template and what is not. In C++11, per the resolution of DR 468,
28792 `template' is allowed in cases where it is not strictly necessary. */
28795 {
28798 "in C++98 %<template%> (as a disambiguator) is only "
28800 /* If this part of the token stream is rescanned, the same
28801 error message would be generated. So, we purge the token
28802 from the stream. */
28805 }
28806 else
28807 {
28808 /* Consume the `template' keyword. */
28811 }
28812 }
28814 }
28816 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28817 set PARSER->SCOPE, and perform other related actions. */
28819 static void
28821 {
28824 /* Get the stored value. */
28826 /* Set the scope from the stored value. */
28830 }
28832 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28833 encounter the end of a block before what we were looking for. */
28835 static bool
28839 {
28841 {
28844 /* Abort a parenthesized expression if we encounter a semicolon. */
28848 /* If we've reached the end of the file, stop. */
28854 /* We've hit the end of an enclosing block, so there's been some
28855 kind of syntax error. */
28858 /* Consume the token. */
28860 /* See if it starts a new group. */
28862 {
28864 /* In theory this should probably check end == '}', but
28865 cp_parser_save_member_function_body needs it to exit
28866 after either '}' or ')' when called with ')'. */
28869 }
28871 {
28875 }
28880 }
28881 }
28883 /* Like above, for caching a default argument or NSDMI. Both of these are
28884 terminated by a non-nested comma, but it can be unclear whether or not a
28885 comma is nested in a template argument list unless we do more parsing.
28886 In order to handle this ambiguity, when we encounter a ',' after a '<'
28887 we try to parse what follows as a parameter-declaration-list (in the
28888 case of a default argument) or a member-declarator (in the case of an
28889 NSDMI). If that succeeds, then we stop caching. */
28891 static tree
28893 {
28898 tree default_argument;
28900 /* Add tokens until we have processed the entire default
28901 argument. We add the range [first_token, token). */
28904 {
28905 /* For list-initialization, this is straightforward. */
28908 }
28910 {
28913 /* Peek at the next token. */
28915 /* What we do depends on what token we have. */
28917 {
28918 /* In valid code, a default argument must be
28919 immediately followed by a `,' `)', or `...'. */
28922 {
28923 /* If we've seen a '<', we might be in a
28924 template-argument-list. Until Core issue 325 is
28925 resolved, we don't know how this situation ought
28926 to be handled, so try to DTRT. We check whether
28927 what comes after the comma is a valid parameter
28928 declaration list. If it is, then the comma ends
28929 the default argument; otherwise the default
28930 argument continues. */
28934 /* Set ITALP so cp_parser_parameter_declaration_list
28935 doesn't decide to commit to this parse. */
28942 {
28943 /* Parse declarators until we reach a non-comma or
28944 somthing that cannot be an initializer.
28945 Just checking whether we're looking at a single
28946 declarator is insufficient. Consider:
28947 int var = tuple<T,U>::x;
28948 The template parameter 'U' looks exactly like a
28949 declarator. */
28950 do
28951 {
28962 }
28964 /* If we met an '=' or ';' then the original comma
28965 was the end of the NSDMI. Otherwise assume
28966 we're still in the NSDMI. */
28969 }
28970 else
28971 {
28976 }
28983 }
28984 /* FALLTHRU */
28987 /* If we run into a non-nested `;', `}', or `]',
28988 then the code is invalid -- but the default
28989 argument is certainly over. */
28994 /* Handle correctly int n = sizeof ... ( p ); */
28997 /* Update DEPTH, if necessary. */
29012 /* This might be the comparison operator, or it might
29013 start a template argument list. */
29020 /* Fall through for C++0x, which treats the `>>'
29021 operator like two `>' tokens in certain
29022 cases. */
29027 {
29028 /* This might be an operator, or it might close a
29029 template argument list. But if a previous '<'
29030 started a template argument list, this will have
29031 closed it, so we can't be in one anymore. */
29035 }
29038 /* If we run out of tokens, issue an error message. */
29046 /* In these cases, we should look for template-ids.
29047 For example, if the default argument is
29048 `X<int, double>()', we need to do name lookup to
29049 figure out whether or not `X' is a template; if
29050 so, the `,' does not end the default argument.
29052 That is not yet done. */
29057 }
29059 /* If we've reached the end, stop. */
29063 /* Add the token to the token block. */
29065 }
29067 /* Create a DEFAULT_ARG to represent the unparsed default
29068 argument. */
29075 }
29077 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29079 location_t
29081 {
29086 }
29088 /* Begin parsing tentatively. We always save tokens while parsing
29089 tentatively so that if the tentative parsing fails we can restore the
29090 tokens. */
29092 static void
29094 {
29095 /* Enter a new parsing context. */
29097 /* Begin saving tokens. */
29099 /* In order to avoid repetitive access control error messages,
29100 access checks are queued up until we are no longer parsing
29101 tentatively. */
29103 }
29105 /* Commit to the currently active tentative parse. */
29107 static void
29109 {
29113 /* Mark all of the levels as committed. */
29116 {
29123 }
29124 }
29126 /* Commit to the topmost currently active tentative parse.
29128 Note that this function shouldn't be called when there are
29129 irreversible side-effects while in a tentative state. For
29130 example, we shouldn't create a permanent entry in the symbol
29131 table, or issue an error message that might not apply if the
29132 tentative parse is aborted. */
29134 static void
29136 {
29141 {
29149 }
29150 }
29152 /* Abort the currently active tentative parse. All consumed tokens
29153 will be rolled back, and no diagnostics will be issued. */
29155 static void
29157 {
29161 /* Now, pretend that we want to see if the construct was
29162 successfully parsed. */
29164 }
29166 /* Stop parsing tentatively. If a parse error has occurred, restore the
29167 token stream. Otherwise, commit to the tokens we have consumed.
29168 Returns true if no error occurred; false otherwise. */
29170 static bool
29172 {
29176 /* Remember whether or not an error occurred, since we are about to
29177 destroy that information. */
29179 /* Remove the topmost context from the stack. */
29182 /* If no parse errors occurred, commit to the tentative parse. */
29184 {
29185 /* Commit to the tokens read tentatively, unless that was
29186 already done. */
29191 }
29192 /* Otherwise, if errors occurred, roll back our state so that things
29193 are just as they were before we began the tentative parse. */
29194 else
29195 {
29198 }
29199 /* Add the context to the front of the free list. */
29204 }
29206 /* Returns true if we are parsing tentatively and are not committed to
29207 this tentative parse. */
29209 static bool
29211 {
29214 }
29216 /* Returns nonzero iff an error has occurred during the most recent
29217 tentative parse. */
29219 static bool
29221 {
29224 }
29226 /* Returns nonzero if GNU extensions are allowed. */
29228 static bool
29230 {
29232 }
29233 \f
29234 /* Objective-C++ Productions */
29237 /* Parse an Objective-C expression, which feeds into a primary-expression
29238 above.
29240 objc-expression:
29241 objc-message-expression
29242 objc-string-literal
29243 objc-encode-expression
29244 objc-protocol-expression
29245 objc-selector-expression
29247 Returns a tree representation of the expression. */
29249 static cp_expr
29251 {
29252 /* Try to figure out what kind of declaration is present. */
29256 {
29266 {
29278 }
29279 /* FALLTHRU */
29285 }
29288 }
29290 /* Parse an Objective-C message expression.
29292 objc-message-expression:
29293 [ objc-message-receiver objc-message-args ]
29295 Returns a representation of an Objective-C message. */
29297 static tree
29299 {
29311 /* Construct a location e.g.
29312 [self func1:5]
29313 ^~~~~~~~~~~~~~
29314 ranging from the '[' to the ']', with the caret at the start. */
29319 }
29321 /* Parse an objc-message-receiver.
29323 objc-message-receiver:
29324 expression
29325 simple-type-specifier
29327 Returns a representation of the type or expression. */
29329 static tree
29331 {
29332 tree rcv;
29334 /* An Objective-C message receiver may be either (1) a type
29335 or (2) an expression. */
29339 /* If that worked out, fine. */
29346 CP_PARSER_FLAGS_NONE);
29353 }
29355 /* Parse the arguments and selectors comprising an Objective-C message.
29357 objc-message-args:
29358 objc-selector
29359 objc-selector-args
29360 objc-selector-args , objc-comma-args
29362 objc-selector-args:
29363 objc-selector [opt] : assignment-expression
29364 objc-selector-args objc-selector [opt] : assignment-expression
29366 objc-comma-args:
29367 assignment-expression
29368 objc-comma-args , assignment-expression
29370 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29371 selector arguments and TREE_VALUE containing a list of comma
29372 arguments. */
29374 static tree
29376 {
29382 {
29388 /* Detect if we have a unary selector. */
29397 sel_args
29402 }
29404 /* Handle non-selector arguments, if any. */
29406 {
29407 tree arg;
29412 addl_args
29417 }
29420 {
29423 }
29426 }
29428 /* Parse an Objective-C encode expression.
29430 objc-encode-expression:
29431 @encode objc-typename
29433 Returns an encoded representation of the type argument. */
29435 static cp_expr
29437 {
29438 tree type;
29443 matching_parens parens;
29450 {
29454 }
29456 /* This happens if we find @encode(T) (where T is a template
29457 typename or something dependent on a template typename) when
29458 parsing a template. In that case, we can't compile it
29459 immediately, but we rather create an AT_ENCODE_EXPR which will
29460 need to be instantiated when the template is used.
29461 */
29463 {
29467 }
29470 /* Build a location of the form:
29471 @encode(int)
29472 ^~~~~~~~~~~~
29473 with caret==start at the @ token, finishing at the close paren. */
29474 location_t combined_loc
29479 }
29481 /* Parse an Objective-C @defs expression. */
29483 static tree
29485 {
29486 tree name;
29489 matching_parens parens;
29495 }
29497 /* Parse an Objective-C protocol expression.
29499 objc-protocol-expression:
29500 @protocol ( identifier )
29502 Returns a representation of the protocol expression. */
29504 static tree
29506 {
29507 tree proto;
29511 matching_parens parens;
29516 /* Build a location of the form:
29517 @protocol(prot)
29518 ^~~~~~~~~~~~~~~
29519 with caret==start at the @ token, finishing at the close paren. */
29520 location_t combined_loc
29526 }
29528 /* Parse an Objective-C selector expression.
29530 objc-selector-expression:
29531 @selector ( objc-method-signature )
29533 objc-method-signature:
29534 objc-selector
29535 objc-selector-seq
29537 objc-selector-seq:
29538 objc-selector :
29539 objc-selector-seq objc-selector :
29541 Returns a representation of the method selector. */
29543 static tree
29545 {
29552 matching_parens parens;
29558 {
29567 {
29568 /* Detect if we have a unary selector. */
29570 {
29573 }
29574 else
29575 {
29577 }
29578 }
29583 {
29584 sel_seq
29587 sel_seq
29590 }
29591 else
29592 sel_seq
29597 }
29599 finish_selector:
29603 /* Build a location of the form:
29604 @selector(func)
29605 ^~~~~~~~~~~~~~~
29606 with caret==start at the @ token, finishing at the close paren. */
29607 location_t combined_loc
29611 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29614 }
29616 /* Parse a list of identifiers.
29618 objc-identifier-list:
29619 identifier
29620 objc-identifier-list , identifier
29622 Returns a TREE_LIST of identifier nodes. */
29624 static tree
29626 {
29627 tree identifier;
29628 tree list;
29639 {
29646 identifier));
29648 }
29651 }
29653 /* Parse an Objective-C alias declaration.
29655 objc-alias-declaration:
29656 @compatibility_alias identifier identifier ;
29658 This function registers the alias mapping with the Objective-C front end.
29659 It returns nothing. */
29661 static void
29663 {
29671 }
29673 /* Parse an Objective-C class forward-declaration.
29675 objc-class-declaration:
29676 @class objc-identifier-list ;
29678 The function registers the forward declarations with the Objective-C
29679 front end. It returns nothing. */
29681 static void
29683 {
29686 {
29687 tree id;
29697 else
29699 }
29701 }
29703 /* Parse a list of Objective-C protocol references.
29705 objc-protocol-refs-opt:
29706 objc-protocol-refs [opt]
29708 objc-protocol-refs:
29709 < objc-identifier-list >
29711 Returns a TREE_LIST of identifiers, if any. */
29713 static tree
29715 {
29719 {
29723 }
29726 }
29728 /* Parse a Objective-C visibility specification. */
29730 static void
29732 {
29736 {
29751 }
29753 /* Eat '@private'/'@protected'/'@public'. */
29755 }
29757 /* Parse an Objective-C method type. Return 'true' if it is a class
29758 (+) method, and 'false' if it is an instance (-) method. */
29762 {
29765 else
29767 }
29769 /* Parse an Objective-C protocol qualifier. */
29771 static tree
29773 {
29786 {
29791 }
29794 }
29796 /* Parse an Objective-C typename. */
29798 static tree
29800 {
29804 {
29807 matching_parens parens;
29811 /* An ObjC type name may consist of just protocol qualifiers, in which
29812 case the type shall default to 'id'. */
29814 {
29817 /* If the type could not be parsed, an error has already
29818 been produced. For error recovery, behave as if it had
29819 not been specified, which will use the default type
29820 'id'. */
29822 {
29824 /* We need to skip to the closing parenthesis as
29825 cp_parser_type_id() does not seem to do it for
29826 us. */
29831 }
29832 }
29836 }
29839 }
29841 /* Check to see if TYPE refers to an Objective-C selector name. */
29843 static bool
29845 {
29851 }
29853 /* Parse an Objective-C selector. */
29855 static tree
29857 {
29861 {
29864 }
29866 /* C++ operator names are allowed to appear in ObjC selectors. */
29868 {
29881 }
29882 }
29884 /* Parse an Objective-C params list. */
29886 static tree
29888 {
29894 {
29904 /* Detect if we have a unary selector. */
29907 {
29910 }
29914 {
29915 /* Something went quite wrong. There should be a colon
29916 here, but there is not. Stop parsing parameters. */
29918 }
29920 /* New ObjC allows attributes on parameters too. */
29925 params
29928 type_name,
29929 identifier,
29930 parm_attr));
29933 }
29936 {
29939 }
29941 /* We allow tail attributes for the method. */
29943 {
29951 }
29954 {
29957 }
29959 }
29961 /* Parse the non-keyword Objective-C params. */
29963 static tree
29966 {
29972 {
29974 tree parm;
29980 {
29985 }
29987 /* TODO: parse attributes for tail parameters. */
29996 }
29998 /* We allow tail attributes for the method. */
30000 {
30002 {
30007 }
30008 else
30009 /* We have an error, but parse the attributes, so that we can
30010 carry on. */
30016 }
30019 }
30021 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30023 static void
30025 {
30028 /* If the next token is `extern' and the following token is a string
30029 literal, then we have a linkage specification. */
30031 && cp_parser_is_pure_string_literal
30034 /* Handle #pragma, if any. */
30037 /* Allow stray semicolons. */
30040 /* Mark methods as optional or required, when building protocols. */
30042 {
30045 }
30047 {
30050 }
30053 /* Other stray characters must generate errors. */
30055 {
30059 }
30060 /* Finally, try to parse a block-declaration, or a function-definition. */
30061 else
30063 }
30065 /* Parse a method signature. */
30067 static tree
30069 {
30085 }
30087 static bool
30089 {
30090 tree tattr;
30095 /* If the attributes are followed by a method introducer, this is not allowed.
30096 Dump the attributes and flag the situation. */
30101 /* Otherwise, the attributes introduce some interstitial code, possibly so
30102 rewind to allow that check. */
30105 }
30107 /* Parse an Objective-C method prototype list. */
30109 static void
30111 {
30115 {
30117 {
30122 else
30126 {
30130 }
30133 }
30139 OPT_Wattributes,
30141 else
30142 /* Allow for interspersed non-ObjC++ code. */
30146 }
30150 else
30154 }
30156 /* Parse an Objective-C method definition list. */
30158 static void
30160 {
30164 {
30165 tree meth;
30168 {
30174 else
30179 {
30183 }
30185 NULL_TREE);
30187 /* For historical reasons, we accept an optional semicolon. */
30194 {
30201 }
30202 }
30203 /* The following case will be removed once @synthesize is
30204 completely implemented. */
30215 else
30216 /* Allow for interspersed non-ObjC++ code. */
30220 }
30224 else
30228 }
30230 /* Parse Objective-C ivars. */
30232 static void
30234 {
30245 {
30246 cp_decl_specifier_seq declspecs;
30248 tree prefix_attributes;
30256 CP_PARSER_FLAGS_OPTIONAL,
30260 /* auto, register, static, extern, mutable. */
30262 {
30265 }
30267 /* thread_local. */
30269 {
30272 }
30274 /* typedef. */
30276 {
30279 }
30284 /* Keep going until we hit the `;' at the end of the
30285 declaration. */
30287 {
30292 /* Check for a (possibly unnamed) bitfield declaration. */
30300 {
30301 /* Get the name of the bitfield. */
30304 sfk_none);
30306 eat_colon:
30308 /* Get the width of the bitfield. */
30309 width
30311 }
30312 else
30313 {
30314 /* Parse the declarator. */
30315 declarator
30321 }
30323 /* Look for attributes that apply to the ivar. */
30325 /* Remember which attributes are prefix attributes and
30326 which are not. */
30328 /* Combine the attributes. */
30332 /* Create the bitfield declaration. */
30335 else
30340 /* Add the instance variable. */
30344 /* Reset PREFIX_ATTRIBUTES. */
30346 {
30351 }
30356 {
30359 }
30361 }
30365 }
30370 /* Do not consume the RID_AT_END, so it will be read again as terminating
30371 the @interface of @implementation. */
30375 /* For historical reasons, we accept an optional semicolon. */
30378 }
30380 /* Parse an Objective-C protocol declaration. */
30382 static void
30384 {
30390 {
30395 }
30397 /* See if we have a forward declaration or a definition. */
30400 /* Try a forward declaration first. */
30402 {
30404 {
30405 tree id;
30415 else
30417 }
30419 }
30421 /* Ok, we got a full-fledged definition (or at least should). */
30422 else
30423 {
30428 }
30429 }
30431 /* Parse an Objective-C superclass or category. */
30433 static void
30438 {
30444 {
30447 }
30449 {
30450 matching_parens parens;
30453 /* If there is no category name, and this is an @interface, we
30454 have a class extension. */
30456 {
30459 }
30460 else
30464 }
30465 }
30467 /* Parse an Objective-C class interface. */
30469 static void
30471 {
30478 {
30479 /* It's hard to recover because even if valid @interface stuff
30480 is to follow, we can't compile it (or validate it) if we
30481 don't even know which class it refers to. Let's assume this
30482 was a stray '@interface' token in the stream and skip it.
30483 */
30485 }
30490 /* We have either a class or a category on our hands. */
30493 else
30494 {
30496 /* Handle instance variable declarations, if any. */
30499 }
30502 }
30504 /* Parse an Objective-C class implementation. */
30506 static void
30508 {
30515 {
30516 /* It's hard to recover because even if valid @implementation
30517 stuff is to follow, we can't compile it (or validate it) if
30518 we don't even know which class it refers to. Let's assume
30519 this was a stray '@implementation' token in the stream and
30520 skip it.
30521 */
30523 }
30527 /* We have either a class or a category on our hands. */
30530 else
30531 {
30533 /* Handle instance variable declarations, if any. */
30536 }
30539 }
30541 /* Consume the @end token and finish off the implementation. */
30543 static void
30545 {
30548 }
30550 /* Parse an Objective-C declaration. */
30552 static void
30554 {
30555 /* Try to figure out what kind of declaration is present. */
30560 {
30576 }
30579 {
30602 }
30603 }
30605 /* Parse an Objective-C try-catch-finally statement.
30607 objc-try-catch-finally-stmt:
30608 @try compound-statement objc-catch-clause-seq [opt]
30609 objc-finally-clause [opt]
30611 objc-catch-clause-seq:
30612 objc-catch-clause objc-catch-clause-seq [opt]
30614 objc-catch-clause:
30615 @catch ( objc-exception-declaration ) compound-statement
30617 objc-finally-clause:
30618 @finally compound-statement
30620 objc-exception-declaration:
30621 parameter-declaration
30622 '...'
30624 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30626 Returns NULL_TREE.
30628 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30629 for C. Keep them in sync. */
30631 static tree
30633 {
30634 location_t location;
30635 tree stmt;
30640 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30641 node, lest it get absorbed into the surrounding block. */
30647 {
30651 matching_parens parens;
30657 {
30658 /* We have "@catch (...)" (where the '...' are literally
30659 what is in the code). Skip the '...'.
30660 parameter_declaration is set to NULL_TREE, and
30661 objc_being_catch_clauses() knows that that means
30662 '...'. */
30665 }
30666 else
30667 {
30668 /* We have "@catch (NSException *exception)" or something
30669 like that. Parse the parameter declaration. */
30673 else
30678 }
30681 else
30682 {
30683 /* If there was no open parenthesis, we are recovering from
30684 an error, and we are trying to figure out what mistake
30685 the user has made. */
30687 /* If there is an immediate closing parenthesis, the user
30688 probably forgot the opening one (ie, they typed "@catch
30689 NSException *e)". Parse the closing parenthesis and keep
30690 going. */
30694 /* If these is no immediate closing parenthesis, the user
30695 probably doesn't know that parenthesis are required at
30696 all (ie, they typed "@catch NSException *e"). So, just
30697 forget about the closing parenthesis and keep going. */
30698 }
30702 }
30704 {
30707 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30708 node, lest it get absorbed into the surrounding block. */
30712 }
30715 }
30717 /* Parse an Objective-C synchronized statement.
30719 objc-synchronized-stmt:
30720 @synchronized ( expression ) compound-statement
30722 Returns NULL_TREE. */
30724 static tree
30726 {
30727 location_t location;
30734 matching_parens parens;
30739 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30740 node, lest it get absorbed into the surrounding block. */
30745 }
30747 /* Parse an Objective-C throw statement.
30749 objc-throw-stmt:
30750 @throw assignment-expression [opt] ;
30752 Returns a constructed '@throw' statement. */
30754 static tree
30756 {
30768 }
30770 /* Parse an Objective-C statement. */
30772 static tree
30774 {
30775 /* Try to figure out what kind of declaration is present. */
30779 {
30790 }
30793 }
30795 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30796 look ahead to see if an objc keyword follows the attributes. This
30797 is to detect the use of prefix attributes on ObjC @interface and
30798 @protocol. */
30800 static bool
30802 {
30807 {
30810 }
30813 }
30815 /* This routine is a minimal replacement for
30816 c_parser_struct_declaration () used when parsing the list of
30817 types/names or ObjC++ properties. For example, when parsing the
30818 code
30820 @property (readonly) int a, b, c;
30822 this function is responsible for parsing "int a, int b, int c" and
30823 returning the declarations as CHAIN of DECLs.
30825 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30826 similar parsing. */
30827 static tree
30829 {
30831 cp_decl_specifier_seq declspecs;
30833 tree prefix_attributes;
30836 CP_PARSER_FLAGS_NONE,
30843 /* auto, register, static, extern, mutable. */
30845 {
30848 }
30850 /* thread_local. */
30852 {
30855 }
30857 /* typedef. */
30859 {
30862 }
30867 /* Keep going until we hit the `;' at the end of the declaration. */
30869 {
30874 /* Parse the declarator. */
30878 /* Look for attributes that apply to the ivar. */
30880 /* Remember which attributes are prefix attributes and
30881 which are not. */
30883 /* Combine the attributes. */
30893 /* Reset PREFIX_ATTRIBUTES. */
30895 {
30900 }
30907 {
30910 }
30911 else
30913 }
30915 }
30917 /* Parse an Objective-C @property declaration. The syntax is:
30919 objc-property-declaration:
30920 '@property' objc-property-attributes[opt] struct-declaration ;
30922 objc-property-attributes:
30923 '(' objc-property-attribute-list ')'
30925 objc-property-attribute-list:
30926 objc-property-attribute
30927 objc-property-attribute-list, objc-property-attribute
30929 objc-property-attribute
30930 'getter' = identifier
30931 'setter' = identifier
30932 'readonly'
30933 'readwrite'
30934 'assign'
30935 'retain'
30936 'copy'
30937 'nonatomic'
30939 For example:
30940 @property NSString *name;
30941 @property (readonly) id object;
30942 @property (retain, nonatomic, getter=getTheName) id name;
30943 @property int a, b, c;
30945 PS: This function is identical to
30946 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30947 static void
30949 {
30950 /* The following variables hold the attributes of the properties as
30951 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30952 seen. When we see an attribute, we set them to 'true' (if they
30953 are boolean properties) or to the identifier (if they have an
30954 argument, ie, for getter and setter). Note that here we only
30955 parse the list of attributes, check the syntax and accumulate the
30956 attributes that we find. objc_add_property_declaration() will
30957 then process the information. */
30967 /* 'properties' is the list of properties that we read. Usually a
30968 single one, but maybe more (eg, in "@property int a, b, c;" there
30969 are three). */
30970 tree properties;
30971 location_t loc;
30977 /* Parse the optional attribute list... */
30979 {
30980 /* Eat the '('. */
30981 matching_parens parens;
30985 {
30991 {
30994 }
30998 {
31009 {
31013 else
31018 }
31021 {
31025 }
31027 {
31029 {
31032 }
31033 else
31037 else
31039 }
31040 else
31041 {
31043 {
31046 }
31047 else
31049 }
31055 }
31062 else
31064 }
31066 /* FIXME: "@property (setter, assign);" will generate a spurious
31067 "error: expected ‘)’ before ‘,’ token". This is because
31068 cp_parser_require, unlike the C counterpart, will produce an
31069 error even if we are in error recovery. */
31071 {
31076 }
31077 }
31079 /* ... and the property declaration(s). */
31083 {
31085 /* If the next token is now a `;', consume it. */
31089 }
31093 else
31094 {
31095 /* Comma-separated properties are chained together in
31096 reverse order; add them one by one. */
31105 }
31108 }
31110 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31112 objc-synthesize-declaration:
31113 @synthesize objc-synthesize-identifier-list ;
31115 objc-synthesize-identifier-list:
31116 objc-synthesize-identifier
31117 objc-synthesize-identifier-list, objc-synthesize-identifier
31119 objc-synthesize-identifier
31120 identifier
31121 identifier = identifier
31123 For example:
31124 @synthesize MyProperty;
31125 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31127 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31128 for C. Keep them in sync.
31129 */
31130 static void
31132 {
31134 location_t loc;
31139 {
31143 {
31146 }
31148 {
31152 {
31155 }
31156 }
31157 else
31162 else
31164 }
31167 }
31169 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31171 objc-dynamic-declaration:
31172 @dynamic identifier-list ;
31174 For example:
31175 @dynamic MyProperty;
31176 @dynamic MyProperty, AnotherProperty;
31178 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31179 for C. Keep them in sync.
31180 */
31181 static void
31183 {
31185 location_t loc;
31190 {
31191 tree property;
31194 {
31197 }
31201 else
31203 }
31206 }
31208 \f
31209 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31211 /* Returns name of the next clause.
31212 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31213 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31214 returned and the token is consumed. */
31216 static pragma_omp_clause
31218 {
31234 {
31239 {
31416 }
31417 }
31423 }
31425 /* Validate that a clause of the given type does not already exist. */
31427 static void
31430 {
31431 tree c;
31435 {
31438 }
31439 }
31441 /* OpenMP 2.5:
31442 variable-list:
31443 identifier
31444 variable-list , identifier
31446 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31447 colon). An opening parenthesis will have been consumed by the caller.
31449 If KIND is nonzero, create the appropriate node and install the decl
31450 in OMP_CLAUSE_DECL and add the node to the head of the list.
31452 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31453 return the list created.
31455 COLON can be NULL if only closing parenthesis should end the list,
31456 or pointer to bool which will receive false if the list is terminated
31457 by closing parenthesis or true if the list is terminated by colon. */
31459 static tree
31462 {
31466 {
31469 }
31471 {
31476 && current_class_ptr
31478 {
31484 }
31485 else
31486 {
31497 else
31502 }
31504 ;
31506 {
31508 {
31510 /* The OpenACC cache directive explicitly only allows "array
31511 elements or subarrays". */
31513 {
31517 }
31518 /* FALLTHROUGH. */
31523 {
31524 location_t loc
31529 decl
31533 }
31534 /* FALLTHROUGH. */
31538 {
31546 parser->colon_corrects_to_scope_p
31550 else
31551 {
31552 /* Look for `:'. */
31556 CPP_CLOSE_SQUARE))
31558 }
31559 /* Look for the closing `]'. */
31561 RT_CLOSE_SQUARE))
31565 }
31569 }
31575 }
31576 else
31579 get_comma:
31583 }
31589 {
31593 }
31596 {
31599 /* Try to resync to an unnested comma. Copied from
31600 cp_parser_parenthesized_expression_list. */
31601 skip_comma:
31610 }
31613 }
31615 /* Similarly, but expect leading and trailing parenthesis. This is a very
31616 common case for omp clauses. */
31618 static tree
31620 {
31624 }
31626 /* OpenACC 2.0:
31627 copy ( variable-list )
31628 copyin ( variable-list )
31629 copyout ( variable-list )
31630 create ( variable-list )
31631 delete ( variable-list )
31632 present ( variable-list )
31633 present_or_copy ( variable-list )
31634 pcopy ( variable-list )
31635 present_or_copyin ( variable-list )
31636 pcopyin ( variable-list )
31637 present_or_copyout ( variable-list )
31638 pcopyout ( variable-list )
31639 present_or_create ( variable-list )
31640 pcreate ( variable-list ) */
31642 static tree
31644 tree list)
31645 {
31648 {
31694 }
31702 }
31704 /* OpenACC 2.0:
31705 deviceptr ( variable-list ) */
31707 static tree
31709 {
31713 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31714 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31715 variable-list must only allow for pointer variables. */
31718 {
31725 }
31728 }
31730 /* OpenACC 2.0:
31731 auto
31732 independent
31733 nohost
31734 seq */
31736 static tree
31740 {
31745 }
31747 /* OpenACC:
31748 num_gangs ( expression )
31749 num_workers ( expression )
31750 vector_length ( expression ) */
31752 static tree
31755 {
31758 matching_parens parens;
31766 {
31771 }
31779 }
31781 /* OpenACC:
31783 gang [( gang-arg-list )]
31784 worker [( [num:] int-expr )]
31785 vector [( [length:] int-expr )]
31787 where gang-arg is one of:
31789 [num:] int-expr
31790 static: size-expr
31792 and size-expr may be:
31794 *
31795 int-expr
31796 */
31798 static tree
31801 {
31811 {
31812 matching_parens parens;
31815 do
31816 {
31820 /* Gang static argument. */
31823 {
31831 {
31834 }
31836 /* Check for the '*' argument. */
31840 CPP_CLOSE_PAREN)))
31841 {
31846 {
31849 }
31851 }
31852 }
31853 /* Worker num: argument and vector length: arguments. */
31857 {
31860 }
31862 /* Now collect the actual argument. */
31864 {
31867 }
31879 {
31882 }
31884 }
31889 }
31903 cleanup_error:
31906 }
31908 /* OpenACC 2.0:
31909 tile ( size-expr-list ) */
31911 static tree
31913 {
31917 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31918 so, but the spec authors never considered such a case and have
31919 differing opinions on what it might mean, including 'not
31920 allowed'.) */
31923 clause_loc);
31928 do
31929 {
31936 {
31939 }
31940 else
31944 }
31947 /* Consume the trailing ')'. */
31955 }
31957 /* OpenACC 2.0
31958 Parse wait clause or directive parameters. */
31960 static tree
31962 {
31972 {
31977 }
31984 {
31988 {
31991 else
31992 {
31999 }
32000 }
32001 }
32004 }
32006 /* OpenACC:
32007 wait ( int-expr-list ) */
32009 static tree
32011 {
32020 }
32022 /* OpenMP 3.0:
32023 collapse ( constant-expression ) */
32025 static tree
32027 {
32029 location_t loc;
32030 HOST_WIDE_INT n;
32033 matching_parens parens;
32051 {
32054 }
32063 }
32065 /* OpenMP 2.5:
32066 default ( none | shared )
32068 OpenACC:
32069 default ( none | present ) */
32071 static tree
32074 {
32076 tree c;
32078 matching_parens parens;
32082 {
32087 {
32108 }
32111 }
32112 else
32113 {
32114 invalid_kind:
32117 else
32119 }
32136 }
32138 /* OpenMP 3.1:
32139 final ( expression ) */
32141 static tree
32143 {
32146 matching_parens parens;
32165 }
32167 /* OpenMP 2.5:
32168 if ( expression )
32170 OpenMP 4.5:
32171 if ( directive-name-modifier : expression )
32173 directive-name-modifier:
32174 parallel | task | taskloop | target data | target | target update
32175 | target enter data | target exit data */
32177 static tree
32180 {
32184 matching_parens parens;
32189 {
32201 {
32204 {
32217 else
32218 {
32219 location_t loc
32224 }
32227 {
32229 {
32234 }
32236 {
32237 location_t loc
32241 }
32242 }
32243 }
32244 }
32246 {
32248 {
32251 }
32252 else
32253 {
32255 {
32256 location_t loc
32259 }
32261 }
32262 }
32263 }
32275 {
32278 {
32281 {
32291 }
32293 p);
32295 }
32297 {
32300 else
32303 }
32306 {
32310 }
32311 }
32319 }
32321 /* OpenMP 3.1:
32322 mergeable */
32324 static tree
32327 {
32328 tree c;
32331 location);
32336 }
32338 /* OpenMP 2.5:
32339 nowait */
32341 static tree
32344 {
32345 tree c;
32352 }
32354 /* OpenMP 2.5:
32355 num_threads ( expression ) */
32357 static tree
32359 location_t location)
32360 {
32363 matching_parens parens;
32383 }
32385 /* OpenMP 4.5:
32386 num_tasks ( expression ) */
32388 static tree
32390 location_t location)
32391 {
32394 matching_parens parens;
32414 }
32416 /* OpenMP 4.5:
32417 grainsize ( expression ) */
32419 static tree
32421 location_t location)
32422 {
32425 matching_parens parens;
32445 }
32447 /* OpenMP 4.5:
32448 priority ( expression ) */
32450 static tree
32452 location_t location)
32453 {
32456 matching_parens parens;
32476 }
32478 /* OpenMP 4.5:
32479 hint ( expression ) */
32481 static tree
32483 location_t location)
32484 {
32487 matching_parens parens;
32506 }
32508 /* OpenMP 4.5:
32509 defaultmap ( tofrom : scalar ) */
32511 static tree
32513 location_t location)
32514 {
32518 matching_parens parens;
32523 {
32526 }
32530 {
32533 }
32539 {
32542 }
32546 {
32549 }
32555 location);
32561 out_err:
32566 }
32568 /* OpenMP 2.5:
32569 ordered
32571 OpenMP 4.5:
32572 ordered ( constant-expression ) */
32574 static tree
32577 {
32579 HOST_WIDE_INT n;
32585 {
32586 matching_parens parens;
32603 {
32605 "ordered argument needs positive constant integer "
32608 }
32609 }
32615 }
32617 /* OpenMP 2.5:
32618 reduction ( reduction-operator : variable-list )
32620 reduction-operator:
32621 One of: + * - & ^ | && ||
32623 OpenMP 3.1:
32625 reduction-operator:
32626 One of: + * - & ^ | && || min max
32628 OpenMP 4.0:
32630 reduction-operator:
32631 One of: + * - & ^ | && ||
32632 id-expression */
32634 static tree
32636 {
32644 {
32654 }
32658 else
32659 {
32670 {
32700 }
32701 else
32702 {
32704 resync_fail:
32709 }
32710 }
32716 NULL);
32718 {
32721 }
32724 }
32726 /* OpenMP 2.5:
32727 schedule ( schedule-kind )
32728 schedule ( schedule-kind , expression )
32730 schedule-kind:
32731 static | dynamic | guided | runtime | auto
32733 OpenMP 4.5:
32734 schedule ( schedule-modifier : schedule-kind )
32735 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32737 schedule-modifier:
32738 simd
32739 monotonic
32740 nonmonotonic */
32742 static tree
32744 {
32748 matching_parens parens;
32755 {
32764 else
32770 else
32771 {
32774 }
32775 }
32778 {
32783 {
32804 }
32805 }
32810 else
32816 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32818 {
32822 }
32825 {
32840 else
32845 }
32857 invalid_kind:
32859 resync_fail:
32864 }
32866 /* OpenMP 3.0:
32867 untied */
32869 static tree
32872 {
32873 tree c;
32880 }
32882 /* OpenMP 4.0:
32883 inbranch
32884 notinbranch */
32886 static tree
32889 {
32894 }
32896 /* OpenMP 4.0:
32897 parallel
32898 for
32899 sections
32900 taskgroup */
32902 static tree
32906 {
32910 }
32912 /* OpenMP 4.5:
32913 nogroup */
32915 static tree
32918 {
32923 }
32925 /* OpenMP 4.5:
32926 simd
32927 threads */
32929 static tree
32933 {
32938 }
32940 /* OpenMP 4.0:
32941 num_teams ( expression ) */
32943 static tree
32945 location_t location)
32946 {
32949 matching_parens parens;
32969 }
32971 /* OpenMP 4.0:
32972 thread_limit ( expression ) */
32974 static tree
32976 location_t location)
32977 {
32980 matching_parens parens;
33000 }
33002 /* OpenMP 4.0:
33003 aligned ( variable-list )
33004 aligned ( variable-list : constant-expression ) */
33006 static tree
33008 {
33012 matching_parens parens;
33020 {
33030 }
33036 }
33038 /* OpenMP 4.0:
33039 linear ( variable-list )
33040 linear ( variable-list : expression )
33042 OpenMP 4.5:
33043 linear ( modifier ( variable-list ) )
33044 linear ( modifier ( variable-list ) : expression ) */
33046 static tree
33049 {
33054 matching_parens parens;
33059 {
33071 else
33073 }
33078 else
33079 {
33088 }
33091 {
33096 {
33107 {
33110 }
33113 }
33124 }
33127 {
33130 }
33133 }
33135 /* OpenMP 4.0:
33136 safelen ( constant-expression ) */
33138 static tree
33140 location_t location)
33141 {
33144 matching_parens parens;
33163 }
33165 /* OpenMP 4.0:
33166 simdlen ( constant-expression ) */
33168 static tree
33170 location_t location)
33171 {
33174 matching_parens parens;
33193 }
33195 /* OpenMP 4.5:
33196 vec:
33197 identifier [+/- integer]
33198 vec , identifier [+/- integer]
33199 */
33201 static tree
33203 tree list)
33204 {
33208 {
33211 }
33214 {
33221 else
33222 {
33223 t = cp_parser_lookup_name_simple
33228 id_loc);
33229 }
33235 {
33238 }
33242 {
33245 }
33249 {
33252 }
33255 add_to_vector:
33257 {
33261 }
33267 }
33270 {
33276 }
33278 }
33280 /* OpenMP 4.0:
33281 depend ( depend-kind : variable-list )
33283 depend-kind:
33284 in | out | inout
33286 OpenMP 4.5:
33287 depend ( source )
33289 depend ( sink : vec ) */
33291 static tree
33293 {
33297 matching_parens parens;
33302 {
33316 else
33318 }
33319 else
33325 {
33335 }
33342 else
33343 {
33349 }
33352 invalid_kind:
33354 resync_fail:
33359 }
33361 /* OpenMP 4.0:
33362 map ( map-kind : variable-list )
33363 map ( variable-list )
33365 map-kind:
33366 alloc | to | from | tofrom
33368 OpenMP 4.5:
33369 map-kind:
33370 alloc | to | from | tofrom | release | delete
33372 map ( always [,] map-kind: variable-list ) */
33374 static tree
33376 {
33385 {
33390 {
33393 nth++;
33399 {
33404 }
33405 }
33406 }
33410 {
33424 else
33425 {
33431 }
33434 }
33437 {
33441 }
33444 NULL);
33450 }
33452 /* OpenMP 4.0:
33453 device ( expression ) */
33455 static tree
33457 location_t location)
33458 {
33461 matching_parens parens;
33481 }
33483 /* OpenMP 4.0:
33484 dist_schedule ( static )
33485 dist_schedule ( static , expression ) */
33487 static tree
33489 location_t location)
33490 {
33493 matching_parens parens;
33504 {
33515 }
33520 location);
33524 invalid_kind:
33526 resync_fail:
33531 }
33533 /* OpenMP 4.0:
33534 proc_bind ( proc-bind-kind )
33536 proc-bind-kind:
33537 master | close | spread */
33539 static tree
33541 location_t location)
33542 {
33543 tree c;
33550 {
33560 else
33562 }
33563 else
33572 location);
33577 invalid_kind:
33579 resync_fail:
33584 }
33586 /* OpenACC:
33587 async [( int-expr )] */
33589 static tree
33591 {
33598 {
33599 matching_parens parens;
33608 }
33618 }
33620 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33621 is a bitmask in MASK. Return the list of clauses found. */
33623 static tree
33627 {
33632 {
33633 location_t here;
33634 pragma_omp_clause c_kind;
33635 omp_clause_code code;
33646 {
33698 clauses);
33716 OMP_CLAUSE_INDEPENDENT,
33728 clauses);
33734 clauses);
33758 clauses);
33780 clauses);
33792 clauses);
33806 }
33811 {
33812 /* Remove the invalid clause(s) from the list to avoid
33813 confusing the rest of the compiler. */
33816 }
33817 }
33819 saw_error:
33826 }
33828 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33829 is a bitmask in MASK. Return the list of clauses found; the result
33830 of clause default goes in *pdefault. */
33832 static tree
33836 {
33842 {
33843 pragma_omp_clause c_kind;
33854 {
33866 clauses);
33880 clauses);
33900 clauses);
33905 clauses);
33915 clauses);
33949 clauses);
33963 clauses);
33978 OMP_CLAUSE_NOTINBRANCH,
33987 {
33988 clause_not_first:
33992 }
34022 clauses);
34023 else
34033 clauses);
34051 {
34056 }
34099 clauses
34105 clauses
34113 }
34118 {
34119 /* Remove the invalid clause(s) from the list to avoid
34120 confusing the rest of the compiler. */
34123 }
34124 }
34125 saw_error:
34128 {
34131 else
34133 }
34135 }
34137 /* OpenMP 2.5:
34138 structured-block:
34139 statement
34141 In practice, we're also interested in adding the statement to an
34142 outer node. So it is convenient if we work around the fact that
34143 cp_parser_statement calls add_stmt. */
34145 static unsigned
34147 {
34150 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34151 This preserves the "not within loop or switch" style error messages
34152 for nonsense cases like
34153 void foo() {
34154 #pragma omp single
34155 break;
34156 }
34157 */
34162 }
34164 static void
34166 {
34168 }
34170 static tree
34172 {
34180 }
34182 /* OpenMP 2.5:
34183 # pragma omp atomic new-line
34184 expression-stmt
34186 expression-stmt:
34187 x binop= expr | x++ | ++x | x-- | --x
34188 binop:
34189 +, *, -, /, &, ^, |, <<, >>
34191 where x is an lvalue expression with scalar type.
34193 OpenMP 3.1:
34194 # pragma omp atomic new-line
34195 update-stmt
34197 # pragma omp atomic read new-line
34198 read-stmt
34200 # pragma omp atomic write new-line
34201 write-stmt
34203 # pragma omp atomic update new-line
34204 update-stmt
34206 # pragma omp atomic capture new-line
34207 capture-stmt
34209 # pragma omp atomic capture new-line
34210 capture-block
34212 read-stmt:
34213 v = x
34214 write-stmt:
34215 x = expr
34216 update-stmt:
34217 expression-stmt | x = x binop expr
34218 capture-stmt:
34219 v = expression-stmt
34220 capture-block:
34221 { v = x; update-stmt; } | { update-stmt; v = x; }
34223 OpenMP 4.0:
34224 update-stmt:
34225 expression-stmt | x = x binop expr | x = expr binop x
34226 capture-stmt:
34227 v = update-stmt
34228 capture-block:
34229 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34231 where x and v are lvalue expressions with scalar type. */
34233 static void
34235 {
34243 {
34248 {
34254 }
34255 }
34257 {
34269 else
34273 }
34275 {
34281 {
34286 {
34289 }
34290 }
34291 }
34295 {
34305 else
34310 {
34311 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34312 opcode. */
34317 }
34321 {
34324 }
34325 else
34326 {
34332 }
34335 }
34337 restart:
34341 {
34348 /* FALLTHROUGH */
34358 /* FALLTHROUGH */
34373 /* Undo effects of boolean_increment for post {in,de}crement. */
34375 /* FALLTHRU */
34379 {
34380 /* Undo effects of boolean_increment. */
34382 {
34383 /* This is pre or post increment. */
34388 && !structured_block
34392 }
34393 }
34394 /* FALLTHRU */
34397 {
34432 {
34436 }
34439 {
34445 {
34450 }
34452 {
34464 {
34466 {
34471 }
34472 else
34474 }
34478 }
34481 {
34488 }
34492 }
34496 {
34499 {
34507 }
34509 {
34514 }
34549 }
34560 /* FALLTHROUGH */
34565 }
34572 }
34573 stmt_done:
34575 {
34586 }
34588 {
34591 }
34592 done:
34598 saw_error:
34601 {
34605 {
34609 }
34610 }
34611 }
34614 /* OpenMP 2.5:
34615 # pragma omp barrier new-line */
34617 static void
34619 {
34622 }
34624 /* OpenMP 2.5:
34625 # pragma omp critical [(name)] new-line
34626 structured-block
34628 OpenMP 4.5:
34629 # pragma omp critical [(name) [hint(expression)]] new-line
34630 structured-block */
34632 #define OMP_CRITICAL_CLAUSE_MASK \
34633 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34635 static tree
34637 {
34641 {
34642 matching_parens parens;
34656 OMP_CRITICAL_CLAUSE_MASK,
34658 }
34659 else
34664 }
34666 /* OpenMP 2.5:
34667 # pragma omp flush flush-vars[opt] new-line
34669 flush-vars:
34670 ( variable-list ) */
34672 static void
34674 {
34680 }
34682 /* Helper function, to parse omp for increment expression. */
34684 static tree
34686 {
34691 {
34694 }
34697 {
34704 /* Fall through: OpenMP disallows NE_EXPR. */
34708 }
34710 /* If decl is an iterator, preserve LHS and RHS of the relational
34711 expr until finish_omp_for. */
34722 }
34724 /* Helper function, to parse omp for increment expression. */
34726 static tree
34728 {
34732 cp_id_kind idk;
34736 {
34745 }
34754 {
34759 }
34766 {
34770 }
34783 do
34784 {
34791 {
34793 {
34796 else
34798 tf_warning_or_error);
34799 }
34800 else
34803 }
34804 }
34808 {
34814 }
34815 else
34819 }
34821 /* Parse the initialization statement of an OpenMP for loop.
34823 Return true if the resulting construct should have an
34824 OMP_CLAUSE_PRIVATE added to it. */
34826 static tree
34834 {
34840 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34842 init-expr:
34843 var = lb
34844 integer-type var = lb
34845 random-access-iterator-type var = lb
34846 pointer-type var = lb
34847 */
34848 cp_decl_specifier_seq type_specifiers;
34850 /* First, try to parse as an initialized declaration. See
34851 cp_parser_condition, from whence the bulk of this is copied. */
34858 {
34859 /* If parsing a type specifier seq succeeded, then this
34860 MUST be a initialized declaration. */
34865 CP_PARSER_DECLARATOR_NAMED,
34876 else
34877 {
34887 {
34889 CPP_OPEN_PAREN))
34892 else
34893 /* Trigger an error. */
34898 }
34902 {
34910 {
34913 auto_node);
34918 }
34921 asm_specification,
34922 LOOKUP_ONLYCONVERTING);
34925 {
34928 }
34929 else
34930 {
34933 {
34935 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34937 {
34941 {
34945 }
34947 }
34949 {
34954 }
34955 }
34956 }
34958 }
34959 else
34960 {
34961 /* Consume '='. */
34965 non_class:
34968 else
34971 asm_specification,
34972 LOOKUP_ONLYCONVERTING);
34973 }
34977 }
34978 }
34979 else
34980 {
34981 cp_id_kind idk;
34982 /* If parsing a type specifier sequence failed, then
34983 this MUST be a simple expression. */
34989 && decl
34992 {
35003 {
35008 }
35013 }
35015 && decl
35018 {
35019 tree rhs;
35027 rhs,
35028 tf_warning_or_error));
35031 }
35032 else
35033 {
35038 {
35042 }
35043 }
35044 }
35046 }
35048 /* Parse the restricted form of the for statement allowed by OpenMP. */
35050 static tree
35053 {
35057 location_t loc_first;
35068 {
35071 }
35074 {
35077 }
35080 {
35086 }
35088 {
35091 {
35093 "%<linear%> clause may not be specified together "
35096 }
35097 else
35099 }
35112 {
35115 location_t loc;
35118 {
35122 }
35125 matching_parens parens;
35132 add_private_clause
35138 {
35141 {
35147 }
35148 else
35150 }
35157 {
35162 {
35166 }
35169 {
35170 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35174 {
35177 }
35178 else
35179 {
35182 }
35184 }
35185 else
35186 {
35191 }
35192 }
35195 {
35196 tree c;
35198 {
35207 decl);
35211 decl);
35212 }
35214 {
35219 else
35224 {
35227 /* For linear, signal that we need to fill up
35228 the so far unknown linear step. */
35231 }
35232 }
35233 }
35242 {
35243 /* If decl is an iterator, preserve the operator on decl
35244 until finish_omp_for. */
35246 && ((processing_template_decl
35251 else
35255 }
35267 {
35270 }
35275 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35276 in between the collapsed for loops to be still considered perfectly
35277 nested. Hopefully the final version clarifies this.
35278 For now handle (multiple) {'s and empty statements. */
35281 {
35285 {
35287 bracecount++;
35288 }
35292 else
35293 {
35300 }
35301 }
35304 {
35307 }
35308 }
35313 /* Note that we saved the original contents of this flag when we entered
35314 the structured block, and so we don't need to re-save it here. */
35317 /* Note that the grammar doesn't call for a structured block here,
35318 though the loop as a whole is a structured block. */
35325 else
35330 {
35332 {
35334 nbraces--;
35335 }
35338 else
35339 {
35341 {
35344 }
35349 }
35350 }
35353 {
35357 else
35359 }
35363 }
35365 /* Helper function for OpenMP parsing, split clauses and call
35366 finish_omp_clauses on each of the set of clauses afterwards. */
35368 static void
35371 {
35377 }
35379 /* OpenMP 4.0:
35380 #pragma omp simd simd-clause[optseq] new-line
35381 for-loop */
35383 #define OMP_SIMD_CLAUSE_MASK \
35384 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35393 static tree
35397 {
35408 {
35412 OMP_CLAUSE_ORDERED);
35414 {
35416 "%<ordered%> clause with parameter may not be specified "
35419 }
35420 }
35431 }
35433 /* OpenMP 2.5:
35434 #pragma omp for for-clause[optseq] new-line
35435 for-loop
35437 OpenMP 4.0:
35438 #pragma omp for simd for-simd-clause[optseq] new-line
35439 for-loop */
35441 #define OMP_FOR_CLAUSE_MASK \
35442 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35452 static tree
35456 {
35463 /* parallel for{, simd} disallows nowait clause, but for
35464 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35467 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35472 {
35477 {
35501 }
35502 }
35504 {
35507 }
35509 /* Composite distribute parallel for disallows linear clause. */
35516 {
35519 }
35530 }
35532 /* OpenMP 2.5:
35533 # pragma omp master new-line
35534 structured-block */
35536 static tree
35538 {
35542 }
35544 /* OpenMP 2.5:
35545 # pragma omp ordered new-line
35546 structured-block
35548 OpenMP 4.5:
35549 # pragma omp ordered ordered-clauses new-line
35550 structured-block */
35552 #define OMP_ORDERED_CLAUSE_MASK \
35553 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35556 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35557 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35559 static bool
35562 {
35566 {
35571 {
35573 {
35576 }
35578 {
35580 "%<depend%> clause may only be used in compound "
35584 }
35585 tree clauses
35587 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35591 }
35592 }
35594 tree clauses
35605 }
35607 /* OpenMP 2.5:
35609 section-scope:
35610 { section-sequence }
35612 section-sequence:
35613 section-directive[opt] structured-block
35614 section-sequence section-directive structured-block */
35616 static tree
35618 {
35623 matching_braces braces;
35631 {
35635 }
35638 {
35646 {
35650 }
35652 {
35655 }
35660 }
35671 }
35673 /* OpenMP 2.5:
35674 # pragma omp sections sections-clause[optseq] newline
35675 sections-scope */
35677 #define OMP_SECTIONS_CLAUSE_MASK \
35678 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35684 static tree
35687 {
35699 {
35702 }
35709 }
35711 /* OpenMP 2.5:
35712 # pragma omp parallel parallel-clause[optseq] new-line
35713 structured-block
35714 # pragma omp parallel for parallel-for-clause[optseq] new-line
35715 structured-block
35716 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35717 structured-block
35719 OpenMP 4.0:
35720 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35721 structured-block */
35723 #define OMP_PARALLEL_CLAUSE_MASK \
35724 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35734 static tree
35738 {
35745 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35751 {
35759 if_p);
35763 if_p);
35766 block);
35771 }
35772 /* When combined with distribute, parallel has to be followed by for.
35773 #pragma omp target parallel is allowed though. */
35777 {
35781 }
35783 {
35786 }
35788 {
35792 {
35802 block);
35805 }
35806 }
35811 {
35814 }
35822 }
35824 /* OpenMP 2.5:
35825 # pragma omp single single-clause[optseq] new-line
35826 structured-block */
35828 #define OMP_SINGLE_CLAUSE_MASK \
35829 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35834 static tree
35836 {
35846 }
35848 /* OpenMP 3.0:
35849 # pragma omp task task-clause[optseq] new-line
35850 structured-block */
35852 #define OMP_TASK_CLAUSE_MASK \
35853 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35864 static tree
35866 {
35877 }
35879 /* OpenMP 3.0:
35880 # pragma omp taskwait new-line */
35882 static void
35884 {
35887 }
35889 /* OpenMP 3.1:
35890 # pragma omp taskyield new-line */
35892 static void
35894 {
35897 }
35899 /* OpenMP 4.0:
35900 # pragma omp taskgroup new-line
35901 structured-block */
35903 static tree
35905 {
35909 if_p));
35910 }
35913 /* OpenMP 2.5:
35914 # pragma omp threadprivate (variable-list) */
35916 static void
35918 {
35919 tree vars;
35925 }
35927 /* OpenMP 4.0:
35928 # pragma omp cancel cancel-clause[optseq] new-line */
35930 #define OMP_CANCEL_CLAUSE_MASK \
35931 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35937 static void
35939 {
35943 }
35945 /* OpenMP 4.0:
35946 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35948 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35949 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35951 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35952 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35954 static void
35957 {
35958 tree clauses;
35962 {
35967 {
35970 }
35971 }
35973 {
35977 }
35980 {
35985 else
35989 }
35992 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35994 pragma_tok);
35996 }
35998 /* OpenMP 4.0:
35999 #pragma omp distribute distribute-clause[optseq] new-line
36000 for-loop */
36002 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36003 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36009 static tree
36013 {
36022 {
36030 else
36033 {
36039 {
36043 else
36046 }
36052 else
36066 }
36067 }
36069 {
36072 }
36077 {
36080 }
36091 }
36093 /* OpenMP 4.0:
36094 # pragma omp teams teams-clause[optseq] new-line
36095 structured-block */
36097 #define OMP_TEAMS_CLAUSE_MASK \
36098 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36106 static tree
36110 {
36119 {
36123 {
36148 }
36149 }
36151 {
36154 }
36159 {
36162 }
36171 }
36173 /* OpenMP 4.0:
36174 # pragma omp target data target-data-clause[optseq] new-line
36175 structured-block */
36177 #define OMP_TARGET_DATA_CLAUSE_MASK \
36178 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36183 static tree
36185 {
36186 tree clauses
36191 {
36194 {
36211 "%<#pragma omp target data%> with map-type other "
36212 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36216 }
36218 }
36221 {
36224 "%<#pragma omp target data%> must contain at least "
36227 }
36238 }
36240 /* OpenMP 4.5:
36241 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36242 structured-block */
36244 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36245 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36251 static tree
36254 {
36257 {
36262 {
36265 }
36266 }
36268 {
36272 }
36275 {
36281 }
36283 tree clauses
36288 {
36291 {
36304 "%<#pragma omp target enter data%> with map-type other "
36308 }
36310 }
36313 {
36316 "%<#pragma omp target enter data%> must contain at least "
36319 }
36326 }
36328 /* OpenMP 4.5:
36329 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36330 structured-block */
36332 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36333 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36339 static tree
36342 {
36345 {
36350 {
36353 }
36354 }
36356 {
36360 }
36363 {
36369 }
36371 tree clauses
36376 {
36379 {
36393 "%<#pragma omp target exit data%> with map-type other "
36394 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36398 }
36400 }
36403 {
36406 "%<#pragma omp target exit data%> must contain at least "
36409 }
36416 }
36418 /* OpenMP 4.0:
36419 # pragma omp target update target-update-clause[optseq] new-line */
36421 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36422 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36429 static bool
36432 {
36434 {
36440 }
36442 tree clauses
36447 {
36449 "%<#pragma omp target update%> must contain at least one "
36452 }
36460 }
36462 /* OpenMP 4.0:
36463 # pragma omp target target-clause[optseq] new-line
36464 structured-block */
36466 #define OMP_TARGET_CLAUSE_MASK \
36467 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36477 static bool
36480 {
36484 {
36496 {
36504 {
36505 tree stmt;
36507 {
36510 OMP_TARGET_CLAUSE_MASK,
36515 OMP_TARGET_CLAUSE_MASK,
36520 OMP_TARGET_CLAUSE_MASK,
36525 }
36527 }
36532 {
36536 if_p);
36541 if_p);
36546 if_p);
36550 }
36556 {
36557 /* For combined target teams, ensure the num_teams and
36558 thread_limit clause expressions are evaluated on the host,
36559 before entering the target construct. */
36560 tree c;
36566 {
36575 OMP_CLAUSE_FIRSTPRIVATE);
36580 }
36581 }
36591 }
36593 {
36596 }
36598 {
36602 }
36604 {
36608 }
36610 {
36614 }
36616 {
36619 }
36620 }
36622 {
36625 }
36640 check_clauses:
36642 {
36645 {
36659 "%<#pragma omp target%> with map-type other "
36660 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36664 }
36666 }
36668 }
36670 /* OpenACC 2.0:
36671 # pragma acc cache (variable-list) new-line
36672 */
36674 static tree
36676 {
36691 }
36693 /* OpenACC 2.0:
36694 # pragma acc data oacc-data-clause[optseq] new-line
36695 structured-block */
36697 #define OACC_DATA_CLAUSE_MASK \
36698 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36710 static tree
36712 {
36725 }
36727 /* OpenACC 2.0:
36728 # pragma acc host_data <clauses> new-line
36729 structured-block */
36731 #define OACC_HOST_DATA_CLAUSE_MASK \
36732 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36734 static tree
36736 {
36749 }
36751 /* OpenACC 2.0:
36752 # pragma acc declare oacc-data-clause[optseq] new-line
36753 */
36755 #define OACC_DECLARE_CLAUSE_MASK \
36756 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36769 static tree
36771 {
36780 {
36784 }
36787 {
36791 {
36795 }
36798 {
36810 {
36812 "%qD must be a global variable in "
36814 decl);
36817 }
36822 {
36826 }
36828 {
36830 "invalid use of %<extern%> variable %qD "
36834 }
36836 {
36838 "invalid use of %<global%> variable %qD "
36842 }
36844 }
36849 {
36854 }
36857 {
36858 tree id;
36862 else
36868 {
36871 {
36874 {
36878 }
36879 }
36880 }
36881 }
36882 }
36895 }
36897 /* OpenACC 2.0:
36898 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36900 or
36902 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36904 LOC is the location of the #pragma token.
36905 */
36907 #define OACC_ENTER_DATA_CLAUSE_MASK \
36908 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36916 #define OACC_EXIT_DATA_CLAUSE_MASK \
36917 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36923 static tree
36926 {
36935 {
36940 }
36947 else
36952 {
36956 }
36964 }
36966 /* OpenACC 2.0:
36967 # pragma acc loop oacc-loop-clause[optseq] new-line
36968 structured-block */
36970 #define OACC_LOOP_CLAUSE_MASK \
36971 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36982 static tree
36985 {
36994 {
37000 }
37009 }
37011 /* OpenACC 2.0:
37012 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37013 structured-block
37015 or
37017 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37018 structured-block
37019 */
37021 #define OACC_KERNELS_CLAUSE_MASK \
37022 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37040 #define OACC_PARALLEL_CLAUSE_MASK \
37041 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37062 static tree
37065 {
37066 omp_clause_mask mask;
37069 {
37082 }
37085 {
37089 {
37092 tree clauses;
37094 if_p);
37096 }
37097 }
37106 }
37108 /* OpenACC 2.0:
37109 # pragma acc update oacc-update-clause[optseq] new-line
37110 */
37112 #define OACC_UPDATE_CLAUSE_MASK \
37113 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37120 static tree
37122 {
37129 {
37131 "%<#pragma acc update%> must contain at least one "
37134 }
37142 }
37144 /* OpenACC 2.0:
37145 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37147 LOC is the location of the #pragma token.
37148 */
37150 #define OACC_WAIT_CLAUSE_MASK \
37151 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37153 static tree
37155 {
37169 }
37171 /* OpenMP 4.0:
37172 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37174 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37175 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37182 static void
37185 {
37187 cp_omp_declare_simd_data data;
37189 {
37194 /* It is safe to take the address of a local variable; it will only be
37195 used while this scope is live. */
37197 }
37199 /* Store away all pragma tokens. */
37211 {
37215 {
37228 }
37233 "%<#pragma omp declare simd%> not immediately followed by "
37237 }
37238 }
37240 /* Finalize #pragma omp declare simd clauses after direct declarator has
37241 been parsed, and put that into "omp declare simd" attribute. */
37243 static tree
37245 {
37251 {
37255 }
37260 {
37278 }
37282 }
37285 /* OpenMP 4.0:
37286 # pragma omp declare target new-line
37287 declarations and definitions
37288 # pragma omp end declare target new-line
37290 OpenMP 4.5:
37291 # pragma omp declare target ( extended-list ) new-line
37293 # pragma omp declare target declare-target-clauses[seq] new-line */
37295 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37299 static void
37301 {
37304 clauses
37308 {
37310 clauses);
37313 }
37314 else
37315 {
37319 }
37322 "%<#pragma omp declare target%> with clauses in between "
37323 "%<#pragma omp declare target%> without clauses and "
37326 {
37332 {
37335 }
37336 else
37339 {
37341 "%qD specified both in declare target %<link%> and %<to%>"
37344 }
37346 {
37353 {
37356 {
37360 }
37361 }
37362 }
37363 }
37364 }
37366 static void
37368 {
37371 {
37374 }
37376 {
37380 {
37383 }
37386 else
37387 {
37391 }
37392 }
37393 else
37394 {
37398 }
37402 "%<#pragma omp end declare target%> without corresponding "
37404 else
37406 }
37408 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37409 expression and optional initializer clause of
37410 #pragma omp declare reduction. We store the expression(s) as
37411 either 3, 6 or 7 special statements inside of the artificial function's
37412 body. The first two statements are DECL_EXPRs for the artificial
37413 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37414 expression that uses those variables.
37415 If there was any INITIALIZER clause, this is followed by further statements,
37416 the fourth and fifth statements are DECL_EXPRs for the artificial
37417 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37418 constructor variant (first token after open paren is not omp_priv),
37419 then the sixth statement is a statement with the function call expression
37420 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37421 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37422 to initialize the OMP_PRIV artificial variable and there is seventh
37423 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37425 static bool
37427 {
37439 tree combiner;
37454 {
37457 }
37460 {
37462 matching_parens parens;
37468 {
37471 }
37487 {
37491 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37495 == CPP_CLOSE_PAREN
37498 {
37502 }
37507 }
37508 else
37509 {
37525 {
37530 }
37532 tree arg;
37545 }
37556 }
37560 UNKNOWN_LOCATION);
37563 }
37565 /* OpenMP 4.0
37566 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37567 initializer-clause[opt] new-line
37569 initializer-clause:
37570 initializer (omp_priv initializer)
37571 initializer (function-name (argument-list)) */
37573 static void
37576 {
37586 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37593 {
37625 }
37637 /* Types may not be defined in declare reduction type list. */
37640 parser->type_definition_forbidden_message
37646 saved_colon_doesnt_start_class_def_p
37651 {
37655 ;
37674 else
37679 else
37681 }
37683 /* Restore the saved message. */
37686 parser->colon_doesnt_start_class_def_p
37691 {
37692 fail:
37695 }
37701 {
37702 tree fntype
37705 NULL_TREE);
37725 {
37730 }
37732 {
37734 {
37743 }
37750 }
37751 else
37752 {
37755 }
37758 else
37761 {
37764 }
37766 {
37769 else
37774 }
37779 else
37780 {
37789 }
37796 }
37800 done:
37801 /* Free any declarators allocated. */
37803 }
37805 /* OpenMP 4.0
37806 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37807 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37808 initializer-clause[opt] new-line
37809 #pragma omp declare target new-line */
37811 static bool
37814 {
37816 {
37821 {
37824 context);
37826 }
37829 {
37832 context);
37834 }
37836 {
37839 }
37841 {
37845 }
37846 }
37851 }
37853 /* OpenMP 4.5:
37854 #pragma omp taskloop taskloop-clause[optseq] new-line
37855 for-loop
37857 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37858 for-loop */
37860 #define OMP_TASKLOOP_CLAUSE_MASK \
37861 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37876 static tree
37880 {
37889 {
37894 {
37918 }
37919 }
37921 {
37924 }
37929 {
37932 }
37938 if_p);
37944 }
37947 /* OpenACC 2.0:
37948 # pragma acc routine oacc-routine-clause[optseq] new-line
37949 function-definition
37951 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37952 */
37954 #define OACC_ROUTINE_CLAUSE_MASK \
37955 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37961 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37962 component, which must resolve to a declared namespace-scope
37963 function. The clauses are either processed directly (for a named
37964 function), or defered until the immediatley following declaration
37965 is parsed. */
37967 static void
37970 {
37972 /* The checking for "another pragma following this one" in the "no optional
37973 '( name )'" case makes sure that we dont re-enter. */
37976 cp_oacc_routine_data data;
37982 /* It is safe to take the address of a local variable; it will only be
37983 used while this scope is live. */
37986 /* Look for optional '( name )'. */
37988 {
37989 matching_parens parens;
37992 /* We parse the name as an id-expression. If it resolves to
37993 anything other than a non-overloaded function at namespace
37994 scope, it's an error. */
38010 {
38014 }
38016 data.clauses
38024 {
38029 }
38031 /* Perhaps we should use the same rule as declarations in different
38032 namespaces? */
38034 {
38039 }
38042 {
38046 }
38050 }
38052 {
38053 /* Store away all pragma tokens. */
38064 /* Emit a helpful diagnostic if there's another pragma following this
38065 one. */
38067 {
38070 /* ..., and then just keep going. */
38072 }
38074 /* We only have to consider the pragma_external case here. */
38079 else
38082 }
38083 }
38085 /* Finalize #pragma acc routine clauses after direct declarator has
38086 been parsed. */
38088 static tree
38090 {
38095 {
38097 "%<#pragma acc routine%> not immediately followed by "
38100 }
38117 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38118 fndecl_seen. */
38121 }
38123 /* Apply any saved OpenACC routine clauses to a just-parsed
38124 declaration. */
38126 static void
38128 {
38130 {
38131 /* Keep going if we're in error reporting mode. */
38137 {
38139 "%<#pragma acc routine%> not immediately followed by"
38143 }
38145 {
38148 }
38151 {
38156 }
38159 {
38167 }
38169 /* Process the routine's dimension clauses. */
38173 /* Add an "omp declare target" attribute. */
38178 /* Don't unset parser->oacc_routine here: we may still need it to
38179 diagnose wrong usage. But, remember that we've used this "#pragma acc
38180 routine". */
38182 }
38183 }
38185 /* Main entry point to OpenMP statement pragmas. */
38187 static void
38189 {
38190 tree stmt;
38195 {
38218 if_p);
38223 if_p);
38240 if_p);
38245 if_p);
38253 if_p);
38262 if_p);
38276 if_p);
38281 if_p);
38285 }
38288 }
38289 \f
38290 /* Transactional Memory parsing routines. */
38292 /* Parse a transaction attribute.
38294 txn-attribute:
38295 attribute
38296 [ [ identifier ] ]
38298 We use this instead of cp_parser_attributes_opt for transactions to avoid
38299 the pedwarn in C++98 mode. */
38301 static tree
38303 {
38318 {
38322 /* For keywords, use the canonical spelling,
38323 not the parsed identifier. */
38327 }
38328 else
38332 error1:
38335 }
38337 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38339 transaction-statement:
38340 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38341 compound-statement
38342 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38343 */
38345 static tree
38347 {
38358 else
38359 {
38363 }
38365 /* Parse a noexcept specification. */
38369 {
38370 /* cancel-and-throw is unimplemented. */
38373 }
38374 else
38377 /* Keep track if we're in the lexical scope of an outer transaction. */
38389 }
38391 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38393 transaction-expression:
38394 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38395 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38396 */
38398 static tree
38400 {
38413 keyword == RID_TRANSACTION_RELAXED
38427 /* Set this early. This might mean that we allow transaction_cancel in
38428 an expression that we find out later actually has to be a constexpr.
38429 However, we expect that cxx_constant_value will be able to deal with
38430 this; also, if the noexcept has no constexpr, then what we parse next
38431 really is a transaction's body. */
38434 /* Parse a noexcept specification. */
38440 {
38441 matching_parens parens;
38448 }
38449 else
38450 {
38451 /* The only expression that is available got parsed for the noexcept
38452 already. noexcept is true then. */
38455 }
38464 }
38466 /* Parse a function-transaction-block.
38468 function-transaction-block:
38469 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38470 function-body
38471 __transaction_atomic txn-attribute[opt] function-try-block
38472 __transaction_relaxed ctor-initializer[opt] function-body
38473 __transaction_relaxed function-try-block
38474 */
38476 static void
38478 {
38493 else
38494 {
38498 }
38506 else
38507 cp_parser_ctor_initializer_opt_and_function_body
38513 }
38515 /* Parse a __transaction_cancel statement.
38517 cancel-statement:
38518 __transaction_cancel txn-attribute[opt] ;
38519 __transaction_cancel txn-attribute[opt] throw-expression ;
38521 ??? Cancel and throw is not yet implemented. */
38523 static tree
38525 {
38531 RT_TRANSACTION_CANCEL);
38538 /* ??? Parse cancel-and-throw here. */
38543 {
38547 }
38549 {
38553 }
38555 {
38558 {
38564 }
38565 }
38567 {
38571 }
38577 }
38578 \f
38579 /* The parser. */
38583 \f
38584 /* Special handling for the first token or line in the file. The first
38585 thing in the file might be #pragma GCC pch_preprocess, which loads a
38586 PCH file, which is a GC collection point. So we need to handle this
38587 first pragma without benefit of an existing lexer structure.
38589 Always returns one token to the caller in *FIRST_TOKEN. This is
38590 either the true first token of the file, or the first token after
38591 the initial pragma. */
38593 static void
38595 {
38604 {
38611 }
38612 else
38615 /* Skip to the end of the pragma. */
38619 /* Now actually load the PCH file. */
38623 /* Read one more token to return to our caller. We have to do this
38624 after reading the PCH file in, since its pointers have to be
38625 live. */
38627 }
38629 /* Parse a pragma GCC ivdep. */
38631 static bool
38633 {
38636 }
38638 /* Parse a pragma GCC unroll. */
38640 static unsigned short
38642 {
38652 {
38654 " assignment-expression that evaluates to a non-negative"
38657 }
38658 else
38659 {
38663 }
38666 }
38668 /* Normal parsing of a pragma token. Here we can (and must) use the
38669 regular lexer. */
38671 static bool
38673 {
38676 tree stmt;
38687 {
38695 {
38705 }
38710 {
38720 }
38725 {
38736 }
38741 {
38752 }
38757 {
38768 }
38788 {
38793 }
38801 {
38806 }
38814 {
38818 }
38824 {
38829 }
38837 {
38842 }
38897 "%<#pragma omp section%> may only be used in "
38902 {
38904 {
38908 }
38914 {
38918 }
38919 else
38925 {
38928 }
38931 }
38934 {
38936 {
38940 }
38941 const unsigned short unroll
38947 {
38951 }
38952 else
38958 {
38961 }
38964 }
38971 bad_stmt:
38974 }
38978 }
38980 /* The interface the pragma parsers have to the lexer. */
38982 enum cpp_ttype
38984 {
38996 else
38997 {
39001 }
39004 }
39006 \f
39007 /* External interface. */
39009 /* Parse one entire translation unit. */
39011 void
39013 {
39026 }
39028 /* Create an identifier for a generic parameter type (a synthesized
39029 template parameter implied by `auto' or a concept identifier). */
39032 static tree
39034 {
39038 }
39040 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39041 (creating a new template parameter list if necessary). Returns the newly
39042 created template type parm. */
39044 static tree
39046 {
39049 /* Before committing to modifying any scope, if we're in an
39050 implicit template scope, and we're trying to synthesize a
39051 constrained parameter, try to find a previous parameter with
39052 the same name. This is the same-type rule for abbreviated
39053 function templates.
39055 NOTE: We can generate implicit parameters when tentatively
39056 parsing a nested name specifier, only to reject that parse
39057 later. However, matching the same template-id as part of a
39058 direct-declarator should generate an identical template
39059 parameter, so this rule will merge them. */
39061 {
39064 {
39066 {
39069 /* Return the TEMPLATE_PARM_INDEX. */
39072 }
39074 }
39075 }
39077 /* We are either continuing a function template that already contains implicit
39078 template parameters, creating a new fully-implicit function template, or
39079 extending an existing explicit function template with implicit template
39080 parameters. */
39088 {
39092 }
39093 else
39094 {
39095 /* Roll back to the existing template parameter scope (in the case of
39096 extending an explicit function template) or introduce a new template
39097 parameter scope ahead of the function parameter scope (or class scope
39098 in the case of out-of-line member definitions). The function scope is
39099 added back after template parameter synthesis below. */
39104 {
39107 }
39109 {
39110 /* If not defining a class, then any class scope is a scope level in
39111 an out-of-line member definition. In this case simply wind back
39112 beyond the first such scope to inject the template parameter list.
39113 Otherwise wind back to the class being defined. The latter can
39114 occur in class member friend declarations such as:
39116 class A {
39117 void foo (auto);
39118 };
39119 class B {
39120 friend void A::foo (auto);
39121 };
39123 The template parameter list synthesized for the friend declaration
39124 must be injected in the scope of 'B'. This can also occur in
39125 erroneous cases such as:
39127 struct A {
39128 struct B {
39129 void foo (auto);
39130 };
39131 void B::foo (auto) {}
39132 };
39134 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39135 but, nevertheless, the template parameter list synthesized for the
39136 declarator should be injected into the scope of 'A' as if the
39137 ill-formed template was specified explicitly. */
39140 {
39143 }
39144 }
39150 {
39151 /* Introduce a new template parameter list for implicit template
39152 parameters. */
39156 parser->implicit_template_scope
39163 }
39164 else
39165 {
39166 /* Synthesize implicit template parameters at the end of the explicit
39167 template parameter list. */
39174 parser->implicit_template_parms
39176 }
39177 }
39179 /* Synthesize a new template parameter and track the current template
39180 parameter chain with implicit_template_parms. */
39184 tree synth_tmpl_parm;
39188 synth_tmpl_parm
39191 synth_tmpl_parm
39193 else
39194 {
39198 }
39200 // Attach the constraint to the parm before processing.
39203 tree new_parm
39205 input_location,
39206 node,
39210 // Chain the new parameter to the list of implicit parameters.
39212 parser->implicit_template_parms
39214 else
39219 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39222 /* If creating a fully implicit function template, start the new implicit
39223 template parameter list with this synthesized type, otherwise grow the
39224 current template parameter list. */
39227 {
39234 }
39235 else
39236 {
39241 }
39243 // If the new parameter was constrained, we need to add that to the
39244 // constraints in the template parameter list.
39246 {
39250 }
39255 }
39257 /* Finish the declaration of a fully implicit function template. Such a
39258 template has no explicit template parameter list so has not been through the
39259 normal template head and tail processing. synthesize_implicit_template_parm
39260 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39261 provided if the declaration is a class member such that its template
39262 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39263 form is returned. Otherwise NULL_TREE is returned. */
39265 static tree
39267 {
39272 {
39276 }
39288 }
39290 /* Like finish_fully_implicit_template, but to be used in error
39291 recovery, rearranging scopes so that we restore the state we had
39292 before synthesize_implicit_template_parm inserted the implement
39293 template parms scope. */
39295 static void
39297 {
39302 {
39311 }
39312 else
39318 }
39320 /* Helper function for diagnostics that have complained about things
39321 being used with 'extern "C"' linkage.
39323 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39325 void
39327 {
39331 }