| blob | e1acb07d29ef5d84b4540a1037bfb612a1e7030a |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2268 /* Classes [gram.class] */
2270 static tree cp_parser_class_name
2272 static tree cp_parser_class_specifier
2274 static tree cp_parser_class_head
2276 static enum tag_types cp_parser_class_key
2278 static void cp_parser_type_parameter_key
2280 static void cp_parser_member_specification_opt
2282 static void cp_parser_member_declaration
2284 static tree cp_parser_pure_specifier
2286 static tree cp_parser_constant_initializer
2289 /* Derived classes [gram.class.derived] */
2291 static tree cp_parser_base_clause
2293 static tree cp_parser_base_specifier
2296 /* Special member functions [gram.special] */
2298 static tree cp_parser_conversion_function_id
2300 static tree cp_parser_conversion_type_id
2304 static void cp_parser_ctor_initializer_opt
2306 static void cp_parser_mem_initializer_list
2308 static tree cp_parser_mem_initializer
2310 static tree cp_parser_mem_initializer_id
2313 /* Overloading [gram.over] */
2315 static cp_expr cp_parser_operator_function_id
2317 static cp_expr cp_parser_operator
2320 /* Templates [gram.temp] */
2322 static void cp_parser_template_declaration
2324 static tree cp_parser_template_parameter_list
2326 static tree cp_parser_template_parameter
2328 static tree cp_parser_type_parameter
2330 static tree cp_parser_template_id
2332 static tree cp_parser_template_name
2334 static tree cp_parser_template_argument_list
2336 static tree cp_parser_template_argument
2338 static void cp_parser_explicit_instantiation
2340 static void cp_parser_explicit_specialization
2343 /* Exception handling [gram.exception] */
2345 static tree cp_parser_try_block
2347 static void cp_parser_function_try_block
2349 static void cp_parser_handler_seq
2351 static void cp_parser_handler
2353 static tree cp_parser_exception_declaration
2355 static tree cp_parser_throw_expression
2357 static tree cp_parser_exception_specification_opt
2359 static tree cp_parser_type_id_list
2362 /* GNU Extensions */
2364 static tree cp_parser_asm_specification_opt
2366 static tree cp_parser_asm_operand_list
2368 static tree cp_parser_asm_clobber_list
2370 static tree cp_parser_asm_label_list
2372 static bool cp_next_tokens_can_be_attribute_p
2374 static bool cp_next_tokens_can_be_gnu_attribute_p
2376 static bool cp_next_tokens_can_be_std_attribute_p
2378 static bool cp_nth_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_gnu_attribute_p
2382 static bool cp_nth_tokens_can_be_attribute_p
2384 static tree cp_parser_attributes_opt
2386 static tree cp_parser_gnu_attributes_opt
2388 static tree cp_parser_gnu_attribute_list
2390 static tree cp_parser_std_attribute
2392 static tree cp_parser_std_attribute_spec
2394 static tree cp_parser_std_attribute_spec_seq
2396 static size_t cp_parser_skip_attributes_opt
2398 static bool cp_parser_extension_opt
2400 static void cp_parser_label_declaration
2403 /* Concept Extensions */
2405 static tree cp_parser_requires_clause
2407 static tree cp_parser_requires_clause_opt
2409 static tree cp_parser_requires_expression
2411 static tree cp_parser_requirement_parameter_list
2413 static tree cp_parser_requirement_body
2415 static tree cp_parser_requirement_list
2417 static tree cp_parser_requirement
2419 static tree cp_parser_simple_requirement
2421 static tree cp_parser_compound_requirement
2423 static tree cp_parser_type_requirement
2425 static tree cp_parser_nested_requirement
2428 /* Transactional Memory Extensions */
2430 static tree cp_parser_transaction
2432 static tree cp_parser_transaction_expression
2434 static void cp_parser_function_transaction
2436 static tree cp_parser_transaction_cancel
2440 pragma_external,
2441 pragma_member,
2442 pragma_objc_icode,
2443 pragma_stmt,
2444 pragma_compound
2445 };
2446 static bool cp_parser_pragma
2449 /* Objective-C++ Productions */
2451 static tree cp_parser_objc_message_receiver
2453 static tree cp_parser_objc_message_args
2455 static tree cp_parser_objc_message_expression
2457 static cp_expr cp_parser_objc_encode_expression
2459 static tree cp_parser_objc_defs_expression
2461 static tree cp_parser_objc_protocol_expression
2463 static tree cp_parser_objc_selector_expression
2465 static cp_expr cp_parser_objc_expression
2467 static bool cp_parser_objc_selector_p
2469 static tree cp_parser_objc_selector
2471 static tree cp_parser_objc_protocol_refs_opt
2473 static void cp_parser_objc_declaration
2475 static tree cp_parser_objc_statement
2477 static bool cp_parser_objc_valid_prefix_attributes
2479 static void cp_parser_objc_at_property_declaration
2481 static void cp_parser_objc_at_synthesize_declaration
2483 static void cp_parser_objc_at_dynamic_declaration
2485 static tree cp_parser_objc_struct_declaration
2488 /* Utility Routines */
2490 static cp_expr cp_parser_lookup_name
2492 static tree cp_parser_lookup_name_simple
2494 static tree cp_parser_maybe_treat_template_as_class
2496 static bool cp_parser_check_declarator_template_parameters
2498 static bool cp_parser_check_template_parameters
2500 static cp_expr cp_parser_simple_cast_expression
2502 static tree cp_parser_global_scope_opt
2504 static bool cp_parser_constructor_declarator_p
2506 static tree cp_parser_function_definition_from_specifiers_and_declarator
2508 static tree cp_parser_function_definition_after_declarator
2510 static bool cp_parser_template_declaration_after_export
2512 static void cp_parser_perform_template_parameter_access_checks
2514 static tree cp_parser_single_declaration
2516 static cp_expr cp_parser_functional_cast
2518 static tree cp_parser_save_member_function_body
2520 static tree cp_parser_save_nsdmi
2522 static tree cp_parser_enclosed_template_argument_list
2524 static void cp_parser_save_default_args
2526 static void cp_parser_late_parsing_for_member
2528 static tree cp_parser_late_parse_one_default_arg
2530 static void cp_parser_late_parsing_nsdmi
2532 static void cp_parser_late_parsing_default_args
2534 static tree cp_parser_sizeof_operand
2536 static cp_expr cp_parser_trait_expr
2538 static bool cp_parser_declares_only_class_p
2540 static void cp_parser_set_storage_class
2542 static void cp_parser_set_decl_spec_type
2544 static void set_and_check_decl_spec_loc
2547 static bool cp_parser_friend_p
2549 static void cp_parser_required_error
2555 static bool cp_parser_token_starts_function_definition_p
2557 static bool cp_parser_next_token_starts_class_definition_p
2559 static bool cp_parser_next_token_ends_template_argument_p
2561 static bool cp_parser_nth_token_starts_template_argument_list_p
2563 static enum tag_types cp_parser_token_is_class_key
2565 static enum tag_types cp_parser_token_is_type_parameter_key
2567 static void cp_parser_check_class_key
2569 static void cp_parser_check_access_in_redeclaration
2571 static bool cp_parser_optional_template_keyword
2573 static void cp_parser_pre_parsed_nested_name_specifier
2575 static bool cp_parser_cache_group
2577 static tree cp_parser_cache_defarg
2579 static void cp_parser_parse_tentatively
2581 static void cp_parser_commit_to_tentative_parse
2583 static void cp_parser_commit_to_topmost_tentative_parse
2585 static void cp_parser_abort_tentative_parse
2587 static bool cp_parser_parse_definitely
2591 static bool cp_parser_uncommitted_to_tentative_parse_p
2593 static void cp_parser_error
2595 static void cp_parser_name_lookup_error
2597 static bool cp_parser_simulate_error
2599 static bool cp_parser_check_type_definition
2601 static void cp_parser_check_for_definition_in_return_type
2603 static void cp_parser_check_for_invalid_template_id
2605 static bool cp_parser_non_integral_constant_expression
2607 static void cp_parser_diagnose_invalid_type_name
2609 static bool cp_parser_parse_and_diagnose_invalid_type_name
2611 static int cp_parser_skip_to_closing_parenthesis
2613 static void cp_parser_skip_to_end_of_statement
2615 static void cp_parser_consume_semicolon_at_end_of_statement
2617 static void cp_parser_skip_to_end_of_block_or_statement
2619 static bool cp_parser_skip_to_closing_brace
2621 static void cp_parser_skip_to_end_of_template_parameter_list
2623 static void cp_parser_skip_to_pragma_eol
2625 static bool cp_parser_error_occurred
2627 static bool cp_parser_allow_gnu_extensions_p
2629 static bool cp_parser_is_pure_string_literal
2631 static bool cp_parser_is_string_literal
2633 static bool cp_parser_is_keyword
2635 static tree cp_parser_make_typename_type
2639 static bool cp_parser_compound_literal_p
2641 static bool cp_parser_array_designator_p
2643 static bool cp_parser_init_statement_p
2645 static bool cp_parser_skip_to_closing_square_bracket
2648 /* Concept-related syntactic transformations */
2653 // -------------------------------------------------------------------------- //
2654 // Unevaluated Operand Guard
2655 //
2656 // Implementation of an RAII helper for unevaluated operand parsing.
2658 {
2661 }
2664 {
2667 }
2669 // -------------------------------------------------------------------------- //
2670 // Tentative Parsing
2672 /* Returns nonzero if we are parsing tentatively. */
2676 {
2678 }
2680 /* Returns nonzero if TOKEN is a string literal. */
2682 static bool
2684 {
2690 }
2692 /* Returns nonzero if TOKEN is a string literal
2693 of a user-defined string literal. */
2695 static bool
2697 {
2704 }
2706 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2708 static bool
2710 {
2712 }
2714 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2715 PRAGMA_NONE. */
2717 static enum pragma_kind
2719 {
2722 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2724 }
2726 /* Helper function for cp_parser_error.
2727 Having peeked a token of kind TOK1_KIND that might signify
2728 a conflict marker, peek successor tokens to determine
2729 if we actually do have a conflict marker.
2730 Specifically, we consider a run of 7 '<', '=' or '>' characters
2731 at the start of a line as a conflict marker.
2732 These come through the lexer as three pairs and a single,
2733 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2734 If it returns true, *OUT_LOC is written to with the location/range
2735 of the marker. */
2737 static bool
2740 {
2751 /* It must be at the start of the line. */
2756 /* We have a conflict marker. Construct a location of the form:
2757 <<<<<<<
2758 ^~~~~~~
2759 with start == caret, finishing at the end of the marker. */
2764 }
2766 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2767 RT_CLOSE_PAREN. */
2771 {
2773 {
2781 }
2782 }
2784 /* Attempt to convert TOKEN_DESC from a required_token to an
2785 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2787 static enum cpp_ttype
2789 {
2791 {
2812 /* Use CPP_EOF as a "no completions possible" code. */
2814 }
2815 }
2818 /* Subroutine of cp_parser_error and cp_parser_required_error.
2820 Issue a diagnostic of the form
2821 FILE:LINE: MESSAGE before TOKEN
2822 where TOKEN is the next token in the input stream. MESSAGE
2823 (specified by the caller) is usually of the form "expected
2824 OTHER-TOKEN".
2826 This bypasses the check for tentative passing, and potentially
2827 adds material needed by cp_parser_required_error.
2829 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2830 suggesting insertion of the missing token.
2832 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2833 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2834 location. */
2836 static void
2838 required_token missing_token_desc,
2839 location_t matching_location)
2840 {
2842 /* This diagnostic makes more sense if it is tagged to the line
2843 of the token we just peeked at. */
2847 {
2852 }
2854 /* If this is actually a conflict marker, report it as such. */
2858 {
2859 location_t loc;
2861 {
2864 }
2865 }
2872 {
2873 /* Potentially supply a fix-it hint, suggesting to add the
2874 missing token immediately after the *previous* token.
2875 This may move the primary location within richloc. */
2877 location_t prev_token_loc
2881 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2882 Attempt to consolidate diagnostics by printing it as a
2883 secondary range within the main diagnostic. */
2885 added_matching_location
2887 }
2889 /* Actually emit the error. */
2891 /* Because c_parser_error does not understand
2892 CPP_KEYWORD, keywords are treated like
2893 identifiers. */
2898 {
2899 /* If we weren't able to consolidate matching_location, then
2900 print it as a secondary diagnostic. */
2905 }
2906 }
2908 /* If not parsing tentatively, issue a diagnostic of the form
2909 FILE:LINE: MESSAGE before TOKEN
2910 where TOKEN is the next token in the input stream. MESSAGE
2911 (specified by the caller) is usually of the form "expected
2912 OTHER-TOKEN". */
2914 static void
2916 {
2919 }
2921 /* Issue an error about name-lookup failing. NAME is the
2922 IDENTIFIER_NODE DECL is the result of
2923 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2924 the thing that we hoped to find. */
2926 static void
2928 tree name,
2929 tree decl,
2930 name_lookup_error desired,
2931 location_t location)
2932 {
2933 /* If name lookup completely failed, tell the user that NAME was not
2934 declared. */
2936 {
2949 else
2951 }
2953 {
2955 {
2972 }
2973 }
2975 {
2977 {
2987 name);
2991 }
2992 }
2993 else
2994 {
2996 {
3009 }
3010 }
3011 }
3013 /* If we are parsing tentatively, remember that an error has occurred
3014 during this tentative parse. Returns true if the error was
3015 simulated; false if a message should be issued by the caller. */
3017 static bool
3019 {
3021 {
3024 }
3026 }
3028 /* This function is called when a type is defined. If type
3029 definitions are forbidden at this point, an error message is
3030 issued. */
3032 static bool
3034 {
3035 /* If types are forbidden here, issue a message. */
3037 {
3038 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3039 in the message need to be interpreted. */
3042 }
3044 }
3046 /* This function is called when the DECLARATOR is processed. The TYPE
3047 was a type defined in the decl-specifiers. If it is invalid to
3048 define a type in the decl-specifiers for DECLARATOR, an error is
3049 issued. TYPE_LOCATION is the location of TYPE and is used
3050 for error reporting. */
3052 static void
3055 {
3056 /* [dcl.fct] forbids type definitions in return types.
3057 Unfortunately, it's not easy to know whether or not we are
3058 processing a return type until after the fact. */
3066 {
3071 type);
3072 }
3073 }
3075 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3076 "<" in any valid C++ program. If the next token is indeed "<",
3077 issue a message warning the user about what appears to be an
3078 invalid attempt to form a template-id. LOCATION is the location
3079 of the type-specifier (TYPE) */
3081 static void
3083 tree type,
3085 location_t location)
3086 {
3090 {
3096 {
3099 else
3101 }
3102 else
3104 /* Remember the location of the invalid "<". */
3107 /* Consume the "<". */
3109 /* Parse the template arguments. */
3111 /* Permanently remove the invalid template arguments so that
3112 this error message is not issued again. */
3115 }
3116 }
3118 /* If parsing an integral constant-expression, issue an error message
3119 about the fact that THING appeared and return true. Otherwise,
3120 return false. In either case, set
3121 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3123 static bool
3125 non_integral_constant thing)
3126 {
3129 {
3131 {
3134 {
3137 "ISO C++ forbids using a floating-point literal "
3142 "enumeration type cannot appear in a "
3233 }
3237 }
3238 }
3240 }
3242 /* Emit a diagnostic for an invalid type name. This function commits
3243 to the current active tentative parse, if any. (Otherwise, the
3244 problematic construct might be encountered again later, resulting
3245 in duplicate error messages.) LOCATION is the location of ID. */
3247 static void
3249 location_t location)
3250 {
3253 /* Try to lookup the identifier. */
3260 /* If the lookup was ambiguous, an error will already have
3261 been issued. */
3263 /* If the lookup found a template-name, it means that the user forgot
3264 to specify an argument list. Emit a useful error message. */
3266 {
3269 decl);
3274 }
3278 /* Something like 'unsigned A a;' */
3281 {
3282 /* Issue an error message. */
3283 name_hint hint;
3287 {
3293 }
3294 else
3296 /* If we're in a template class, it's possible that the user was
3297 referring to a type from a base class. For example:
3299 template <typename T> struct A { typedef T X; };
3300 template <typename T> struct B : public A<T> { X x; };
3302 The user should have said "typename A<T>::X". */
3318 {
3319 tree b;
3322 b;
3324 {
3328 {
3329 tree field;
3330 /* Go from a particular instantiation of the
3331 template (which will have an empty TYPE_FIELDs),
3332 to the main version. */
3335 field;
3339 {
3344 }
3347 }
3348 }
3349 }
3350 }
3351 /* Here we diagnose qualified-ids where the scope is actually correct,
3352 but the identifier does not resolve to a valid type name. */
3354 {
3356 {
3365 else
3374 }
3377 {
3378 /* A<T>::A<T>() */
3384 }
3387 {
3390 "need %<typename%> before %<%T::%D::%E%> because "
3394 id,
3397 else
3401 }
3403 {
3415 else
3421 }
3422 else
3424 }
3425 }
3427 /* Check for a common situation where a type-name should be present,
3428 but is not, and issue a sensible error message. Returns true if an
3429 invalid type-name was detected.
3431 The situation handled by this function are variable declarations of the
3432 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3433 Usually, `ID' should name a type, but if we got here it means that it
3434 does not. We try to emit the best possible error message depending on
3435 how exactly the id-expression looks like. */
3437 static bool
3439 {
3440 tree id;
3443 /* Avoid duplicate error about ambiguous lookup. */
3445 {
3449 }
3458 /* If the next token is a (, this is a function with no explicit return
3459 type, i.e. constructor, destructor or conversion op. */
3462 {
3465 }
3469 /* Emit a diagnostic for the invalid type. */
3471 out:
3472 /* If we aren't in the middle of a declarator (i.e. in a
3473 parameter-declaration-clause), skip to the end of the declaration;
3474 there's no point in trying to process it. */
3478 }
3480 /* Consume tokens up to, and including, the next non-nested closing `)'.
3481 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3482 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3483 found an unnested token of that type. */
3485 static int
3488 cpp_ttype or_ttype,
3490 {
3500 {
3503 /* Have we found what we're looking for before the closing paren? */
3509 {
3512 /* If we've run out of tokens, then there is no closing `)'. */
3515 /* This is good for lambda expression capture-lists. */
3525 /* This matches the processing in skip_to_end_of_statement. */
3545 {
3549 }
3554 }
3556 /* Consume the token. */
3558 }
3559 }
3561 /* Consume tokens up to, and including, the next non-nested closing `)'.
3562 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3563 are doing error recovery. Returns -1 if OR_COMMA is true and we
3564 found an unnested token of that type. */
3566 static int
3571 {
3575 }
3577 /* Consume tokens until we reach the end of the current statement.
3578 Normally, that will be just before consuming a `;'. However, if a
3579 non-nested `}' comes first, then we stop before consuming that. */
3581 static void
3583 {
3586 /* Unwind generic function template scope if necessary. */
3591 {
3595 {
3598 /* If we've run out of tokens, stop. */
3602 /* If the next token is a `;', we have reached the end of the
3603 statement. */
3609 /* If this is a non-nested '}', stop before consuming it.
3610 That way, when confronted with something like:
3612 { 3 + }
3614 we stop before consuming the closing '}', even though we
3615 have not yet reached a `;'. */
3619 /* If it is the closing '}' for a block that we have
3620 scanned, stop -- but only after consuming the token.
3621 That way given:
3623 void f g () { ... }
3624 typedef int I;
3626 we will stop after the body of the erroneously declared
3627 function, but before consuming the following `typedef'
3628 declaration. */
3630 {
3633 }
3642 }
3644 /* Consume the token. */
3646 }
3647 }
3649 /* This function is called at the end of a statement or declaration.
3650 If the next token is a semicolon, it is consumed; otherwise, error
3651 recovery is attempted. */
3653 static void
3655 {
3656 /* Look for the trailing `;'. */
3658 {
3659 /* If there is additional (erroneous) input, skip to the end of
3660 the statement. */
3662 /* If the next token is now a `;', consume it. */
3665 }
3666 }
3668 /* Skip tokens until we have consumed an entire block, or until we
3669 have consumed a non-nested `;'. */
3671 static void
3673 {
3676 /* Unwind generic function template scope if necessary. */
3681 {
3685 {
3688 /* If we've run out of tokens, stop. */
3692 /* Stop if this is an unnested ';'. */
3698 /* Stop if this is an unnested '}', or closes the outermost
3699 nesting level. */
3700 nesting_depth--;
3708 /* Nest. */
3709 nesting_depth++;
3714 }
3716 /* Consume the token. */
3718 }
3719 }
3721 /* Skip tokens until a non-nested closing curly brace is the next
3722 token, or there are no more tokens. Return true in the first case,
3723 false otherwise. */
3725 static bool
3727 {
3731 {
3735 {
3738 /* If we've run out of tokens, stop. */
3742 /* If the next token is a non-nested `}', then we have reached
3743 the end of the current block. */
3749 /* If it the next token is a `{', then we are entering a new
3750 block. Consume the entire block. */
3756 }
3758 /* Consume the token. */
3760 }
3761 }
3763 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3764 parameter is the PRAGMA token, allowing us to purge the entire pragma
3765 sequence. */
3767 static void
3769 {
3774 do
3778 /* Ensure that the pragma is not parsed again. */
3780 }
3782 /* Require pragma end of line, resyncing with it as necessary. The
3783 arguments are as for cp_parser_skip_to_pragma_eol. */
3785 static void
3787 {
3791 }
3793 /* This is a simple wrapper around make_typename_type. When the id is
3794 an unresolved identifier node, we can provide a superior diagnostic
3795 using cp_parser_diagnose_invalid_type_name. */
3797 static tree
3799 location_t id_location)
3800 {
3801 tree result;
3803 {
3809 }
3811 }
3813 /* This is a wrapper around the
3814 make_{pointer,ptrmem,reference}_declarator functions that decides
3815 which one to call based on the CODE and CLASS_TYPE arguments. The
3816 CODE argument should be one of the values returned by
3817 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3818 appertain to the pointer or reference. */
3822 cp_cv_quals cv_qualifiers,
3824 tree attributes)
3825 {
3832 else
3842 }
3844 /* Create a new C++ parser. */
3848 {
3853 /* cp_lexer_new_main is called before doing GC allocation because
3854 cp_lexer_new_main might load a PCH file. */
3857 /* Initialize the binops_by_token so that we can get the tree
3858 directly from the token. */
3866 /* For now, we always accept GNU extensions. */
3869 /* The `>' token is a greater-than operator, not the end of a
3870 template-id. */
3875 /* We are not parsing a constant-expression. */
3880 /* Local variable names are not forbidden. */
3883 /* We are not processing an `extern "C"' declaration. */
3886 /* We are not processing a declarator. */
3889 /* We are not processing a template-argument-list. */
3892 /* We are not in an iteration statement. */
3895 /* We are not in a switch statement. */
3898 /* We are not parsing a type-id inside an expression. */
3901 /* Declarations aren't implicitly extern "C". */
3904 /* String literals should be translated to the execution character set. */
3907 /* We are not parsing a function body. */
3910 /* We can correct until told otherwise. */
3913 /* The unparsed function queue is empty. */
3916 /* There are no classes being defined. */
3919 /* No template parameters apply. */
3922 /* Special parsing data structures. */
3926 /* Not declaring an implicit function template. */
3932 /* Allow constrained-type-specifiers. */
3935 /* We haven't yet seen an 'extern "C"'. */
3939 }
3941 /* Create a cp_lexer structure which will emit the tokens in CACHE
3942 and push it onto the parser's lexer stack. This is used for delayed
3943 parsing of in-class method bodies and default arguments, and should
3944 not be confused with tentative parsing. */
3945 static void
3947 {
3952 /* Move the current source position to that of the first token in the
3953 new lexer. */
3955 }
3957 /* Pop the top lexer off the parser stack. This is never used for the
3958 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3959 static void
3961 {
3966 /* Put the current source position back where it was before this
3967 lexer was pushed. */
3969 }
3971 /* Lexical conventions [gram.lex] */
3973 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3974 identifier. */
3976 static cp_expr
3978 {
3981 /* Look for the identifier. */
3983 /* Return the value. */
3986 else
3988 }
3990 /* Parse a sequence of adjacent string constants. Returns a
3991 TREE_STRING representing the combined, nul-terminated string
3992 constant. If TRANSLATE is true, translate the string to the
3993 execution character set. If WIDE_OK is true, a wide string is
3994 invalid here.
3996 C++98 [lex.string] says that if a narrow string literal token is
3997 adjacent to a wide string literal token, the behavior is undefined.
3998 However, C99 6.4.5p4 says that this results in a wide string literal.
3999 We follow C99 here, for consistency with the C front end.
4001 This code is largely lifted from lex_string() in c-lex.c.
4003 FUTURE: ObjC++ will need to handle @-strings here. */
4004 static cp_expr
4007 {
4008 tree value;
4015 tree string_tree;
4021 {
4024 }
4029 {
4033 }
4034 else
4035 {
4038 }
4041 /* Try to avoid the overhead of creating and destroying an obstack
4042 for the common case of just one string. */
4045 {
4053 {
4057 }
4058 else
4062 }
4063 else
4064 {
4069 do
4070 {
4072 count++;
4077 {
4080 {
4083 }
4086 {
4091 }
4093 }
4094 else
4098 {
4102 {
4106 "unsupported non-standard concatenation "
4108 }
4109 }
4117 {
4121 }
4122 else
4123 {
4127 }
4128 }
4131 /* A string literal built by concatenation has its caret=start at
4132 the start of the initial string, and its finish at the finish of
4133 the final string literal. */
4137 }
4140 {
4143 }
4147 {
4152 {
4167 }
4172 {
4177 else
4179 }
4180 }
4181 else
4182 /* cpp_interpret_string has issued an error. */
4189 }
4191 /* Look up a literal operator with the name and the exact arguments. */
4193 static tree
4195 {
4196 tree decl;
4202 {
4208 {
4211 {
4221 }
4224 /* May be this should be sufficient_parms_p instead,
4225 depending on how exactly should user-defined literals
4226 work in presence of default arguments on the literal
4227 operator parameters. */
4230 }
4231 }
4234 }
4236 /* Parse a user-defined char constant. Returns a call to a user-defined
4237 literal operator taking the character as an argument. */
4239 static cp_expr
4241 {
4249 /* Build up a call to the user-defined operator */
4250 /* Lookup the name we got back from the id-expression. */
4255 {
4260 }
4264 }
4266 /* A subroutine of cp_parser_userdef_numeric_literal to
4267 create a char... template parameter pack from a string node. */
4269 static tree
4271 {
4272 tree charvec;
4278 /* Fill in CHARVEC with all of the parameters. */
4283 /* Build the argument packs. */
4289 }
4291 /* A subroutine of cp_parser_userdef_numeric_literal to
4292 create a char... template parameter pack from a string node. */
4294 static tree
4296 {
4297 tree charvec;
4308 /* First template parm is character type. */
4311 /* Fill in CHARVEC with all of the parameters. */
4318 /* Build the argument packs. */
4324 }
4326 /* Parse a user-defined numeric constant. returns a call to a user-defined
4327 literal operator. */
4329 static cp_expr
4331 {
4342 /* Look for a literal operator taking the exact type of numeric argument
4343 as the literal value. */
4348 {
4350 tf_warning_or_error);
4353 {
4356 long_long_unsigned_type_node);
4357 }
4358 else
4359 {
4363 long_double_type_node);
4367 }
4371 }
4374 /* If the numeric argument didn't work, look for a raw literal
4375 operator taking a const char* argument consisting of the number
4376 in string format. */
4381 {
4383 tf_warning_or_error);
4386 }
4389 /* If the raw literal didn't work, look for a non-type template
4390 function with parameter pack char.... Call the function with
4391 template parameter characters representing the number. */
4395 {
4399 tf_warning_or_error);
4402 }
4406 /* In C++14 the standard library defines complex number suffixes that
4407 conflict with GNU extensions. Prefer them if <complex> is #included. */
4417 {
4422 {
4423 /* No <complex>, so pedwarn and use GNU semantics. */
4426 }
4427 }
4429 bool complained
4436 {
4438 "(from <complex>) to enable the C++14 user-defined literal "
4443 }
4450 else
4451 {
4452 /* Use the built-in semantics. */
4453 tree type;
4455 {
4458 else
4460 }
4469 }
4472 /* Avoid repeated diagnostics. */
4475 }
4477 /* Parse a user-defined string constant. Returns a call to a user-defined
4478 literal operator taking a character pointer and the length of the string
4479 as arguments. */
4481 static tree
4483 {
4492 /* Build up a call to the user-defined operator. */
4493 /* Lookup the name we got back from the id-expression. */
4500 {
4502 tf_warning_or_error);
4505 }
4508 /* Look for a template function with typename parameter CharT
4509 and parameter pack CharT... Call the function with
4510 template parameter characters representing the string. */
4514 {
4518 tf_warning_or_error);
4521 }
4527 }
4530 /* Basic concepts [gram.basic] */
4532 /* Parse a translation-unit.
4534 translation-unit:
4535 declaration-seq [opt]
4537 Returns TRUE if all went well. */
4539 static bool
4541 {
4542 /* The address of the first non-permanent object on the declarator
4543 obstack. */
4548 /* Create the declarator obstack, if necessary. */
4550 {
4552 /* Create the error declarator. */
4554 /* Create the empty parameter list. */
4556 UNKNOWN_LOCATION);
4557 /* Remember where the base of the declarator obstack lies. */
4559 }
4563 /* If there are no tokens left then all went well. */
4565 {
4566 /* Get rid of the token array; we don't need it any more. */
4570 /* This file might have been a context that's implicitly extern
4571 "C". If so, pop the lang context. (Only relevant for PCH.) */
4573 {
4576 }
4578 /* Finish up. */
4582 }
4583 else
4584 {
4587 }
4589 /* Make sure the declarator obstack was fully cleaned up. */
4593 /* All went well. */
4595 }
4597 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4598 decltype context. */
4602 {
4607 }
4609 /* We're about to parse a collection of statements. If we're currently
4610 parsing tentatively, set up a firewall so that any nested
4611 cp_parser_commit_to_tentative_parse won't affect the current context. */
4613 static cp_token_position
4615 {
4622 }
4624 /* We've finished parsing the collection of statements. Wrap up the
4625 firewall and replace the relevant tokens with the parsed form. */
4627 static void
4629 tree expr)
4630 {
4634 /* Finish the firewall level. */
4636 /* And remember the result of the parse for when we try again. */
4642 }
4644 /* Like the above functions, but let the user modify the tokens. Used by
4645 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4646 later parses, so it makes sense to localize the effects of
4647 cp_parser_commit_to_tentative_parse. */
4649 struct tentative_firewall
4650 {
4655 {
4656 /* If we're currently parsing tentatively, start a committed level as a
4657 firewall and then an inner tentative parse. */
4659 {
4663 }
4664 }
4667 {
4669 {
4670 /* Finish the inner tentative parse and the firewall, propagating any
4671 uncommitted error state to the outer tentative parse. */
4677 }
4678 }
4679 };
4681 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4682 This class is for tracking such a matching pair of symbols.
4683 In particular, it tracks the location of the first token,
4684 so that if the second token is missing, we can highlight the
4685 location of the first token when notifying the user about the
4686 problem. */
4689 class token_pair
4690 {
4692 /* token_pair's ctor. */
4695 /* If the next token is the opening symbol for this pair, consume it and
4696 return true.
4697 Otherwise, issue an error and return false.
4698 In either case, record the location of the opening token. */
4701 {
4705 }
4707 /* Consume the next token from PARSER, recording its location as
4708 that of the opening token within the pair. */
4711 {
4716 }
4718 /* If the next token is the closing symbol for this pair, consume it
4719 and return it.
4720 Otherwise, issue an error, highlighting the location of the
4721 corresponding opening token, and return NULL. */
4724 {
4727 m_open_loc);
4728 }
4731 location_t m_open_loc;
4732 };
4734 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4736 struct matching_paren_traits
4737 {
4742 };
4744 /* "matching_parens" is a token_pair<T> class for tracking matching
4745 pairs of parentheses. */
4749 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4751 struct matching_brace_traits
4752 {
4757 };
4759 /* "matching_braces" is a token_pair<T> class for tracking matching
4760 pairs of braces. */
4765 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4766 enclosing parentheses. */
4768 static cp_expr
4770 {
4773 /* Consume the '('. */
4775 matching_parens parens;
4777 /* Start the statement-expression. */
4779 /* Parse the compound-statement. */
4781 /* Finish up. */
4783 /* Consume the ')'. */
4791 }
4793 /* Expressions [gram.expr] */
4795 /* Parse a fold-operator.
4797 fold-operator:
4798 - * / % ^ & | = < > << >>
4799 = -= *= /= %= ^= &= |= <<= >>=
4800 == != <= >= && || , .* ->*
4802 This returns the tree code corresponding to the matched operator
4803 as an int. When the current token matches a compound assignment
4804 opertor, the resulting tree code is the negative value of the
4805 non-assignment operator. */
4807 static int
4809 {
4811 {
4851 }
4852 }
4854 /* Returns true if CODE indicates a binary expression, which is not allowed in
4855 the LHS of a fold-expression. More codes will need to be added to use this
4856 function in other contexts. */
4858 static bool
4860 {
4862 {
4895 }
4896 }
4898 /* If the next token is a suitable fold operator, consume it and return as
4899 the function above. */
4901 static int
4903 {
4909 }
4911 /* Parse a fold-expression.
4913 fold-expression:
4914 ( ... folding-operator cast-expression)
4915 ( cast-expression folding-operator ... )
4916 ( cast-expression folding operator ... folding-operator cast-expression)
4918 Note that the '(' and ')' are matched in primary expression. */
4920 static cp_expr
4922 {
4923 cp_id_kind pidk;
4925 // Left fold.
4927 {
4931 {
4934 }
4941 }
4946 {
4949 }
4952 {
4955 }
4958 /* The operands of a fold-expression are cast-expressions, so binary or
4959 conditional expressions are not allowed. We check this here to avoid
4960 tentative parsing. */
4970 // Right fold.
4975 {
4978 }
4981 // Binary left or right fold.
4986 }
4988 /* Parse a primary-expression.
4990 primary-expression:
4991 literal
4992 this
4993 ( expression )
4994 id-expression
4995 lambda-expression (C++11)
4997 GNU Extensions:
4999 primary-expression:
5000 ( compound-statement )
5001 __builtin_va_arg ( assignment-expression , type-id )
5002 __builtin_offsetof ( type-id , offsetof-expression )
5004 C++ Extensions:
5005 __has_nothrow_assign ( type-id )
5006 __has_nothrow_constructor ( type-id )
5007 __has_nothrow_copy ( type-id )
5008 __has_trivial_assign ( type-id )
5009 __has_trivial_constructor ( type-id )
5010 __has_trivial_copy ( type-id )
5011 __has_trivial_destructor ( type-id )
5012 __has_virtual_destructor ( type-id )
5013 __is_abstract ( type-id )
5014 __is_base_of ( type-id , type-id )
5015 __is_class ( type-id )
5016 __is_empty ( type-id )
5017 __is_enum ( type-id )
5018 __is_final ( type-id )
5019 __is_literal_type ( type-id )
5020 __is_pod ( type-id )
5021 __is_polymorphic ( type-id )
5022 __is_std_layout ( type-id )
5023 __is_trivial ( type-id )
5024 __is_union ( type-id )
5026 Objective-C++ Extension:
5028 primary-expression:
5029 objc-expression
5031 literal:
5032 __null
5034 ADDRESS_P is true iff this expression was immediately preceded by
5035 "&" and therefore might denote a pointer-to-member. CAST_P is true
5036 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5037 true iff this expression is a template argument.
5039 Returns a representation of the expression. Upon return, *IDK
5040 indicates what kind of id-expression (if any) was present. */
5042 static cp_expr
5049 {
5052 /* Assume the primary expression is not an id-expression. */
5055 /* Peek at the next token. */
5058 {
5059 /* literal:
5060 integer-literal
5061 character-literal
5062 floating-literal
5063 string-literal
5064 boolean-literal
5065 pointer-literal
5066 user-defined-literal */
5078 {
5082 }
5083 /* Floating-point literals are only allowed in an integral
5084 constant expression if they are cast to an integral or
5085 enumeration type. */
5089 {
5090 /* CAST_P will be set even in invalid code like "int(2.7 +
5091 ...)". Therefore, we have to check that the next token
5092 is sure to end the cast. */
5094 {
5099 enumerator-definition. */
5101 /* The curly brace at the end of an enum-specifier. */
5103 /* The end of a statement. */
5105 /* The end of the cast-expression. */
5107 /* The end of an array bound. */
5109 /* The closing ">" in a template-argument-list. */
5112 /* C++0x only: A ">>" treated like two ">" tokens,
5113 in a template-argument-list. */
5118 }
5120 /* If we are within a cast, then the constraint that the
5121 cast is to an integral or enumeration type will be
5122 checked at that point. If we are not within a cast, then
5123 this code is invalid. */
5126 }
5146 /* ??? Should wide strings be allowed when parser->translate_strings_p
5147 is false (i.e. in attributes)? If not, we can kill the third
5148 argument to cp_parser_string_literal. */
5154 /* If we see `( { ' then we are looking at the beginning of
5155 a GNU statement-expression. */
5158 {
5159 /* Statement-expressions are not allowed by the standard. */
5163 /* And they're not allowed outside of a function-body; you
5164 cannot, for example, write:
5166 int i = ({ int j = 3; j + 1; });
5168 at class or namespace scope. */
5171 {
5173 "statement-expressions are not allowed outside "
5179 }
5180 else
5182 }
5183 /* Otherwise it's a normal parenthesized expression. */
5184 {
5185 cp_expr expr;
5190 /* Consume the `('. */
5191 matching_parens parens;
5193 /* Within a parenthesized expression, a `>' token is always
5194 the greater-than operator. */
5195 saved_greater_than_is_operator_p
5200 /* Left fold expression. */
5202 else
5203 /* Parse the parenthesized expression. */
5208 {
5215 }
5216 else
5217 /* Let the front end know that this expression was
5218 enclosed in parentheses. This matters in case, for
5219 example, the expression is of the form `A::B', since
5220 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5221 not. */
5224 /* DR 705: Wrapping an unqualified name in parentheses
5225 suppresses arg-dependent lookup. We want to pass back
5226 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5227 (c++/37862), but none of the others. */
5231 /* The `>' token might be the end of a template-id or
5232 template-parameter-list now. */
5233 parser->greater_than_is_operator_p
5236 /* Consume the `)'. */
5245 }
5248 {
5250 {
5251 /* We might have an Objective-C++ message. */
5254 /* If that works out, we're done ... */
5257 /* ... else, fall though to see if it's a lambda. */
5258 }
5260 /* Don't warn about a failed tentative parse. */
5265 }
5269 /* We have an Objective-C++ string literal. */
5276 {
5277 /* These two are the boolean literals. */
5285 /* The `__null' literal. */
5290 /* The `nullptr' literal. */
5295 /* Recognize the `this' keyword. */
5299 {
5303 }
5304 /* Pointers cannot appear in constant-expressions. */
5309 /* The `operator' keyword can be the beginning of an
5310 id-expression. */
5317 {
5318 non_integral_constant name;
5320 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5321 __func__ are the names of variables -- but they are
5322 treated specially. Therefore, they are handled here,
5323 rather than relying on the generic id-expression logic
5324 below. Grammatically, these names are id-expressions.
5326 Consume the token. */
5330 {
5342 }
5347 /* Look up the name. */
5349 }
5352 {
5353 tree expression;
5354 tree type;
5355 source_location type_location;
5356 location_t start_loc
5358 /* The `__builtin_va_arg' construct is used to handle
5359 `va_arg'. Consume the `__builtin_va_arg' token. */
5361 /* Look for the opening `('. */
5362 matching_parens parens;
5364 /* Now, parse the assignment-expression. */
5366 /* Look for the `,'. */
5369 /* Parse the type-id. */
5370 {
5373 }
5374 /* Look for the closing `)'. */
5375 location_t finish_loc
5378 /* Using `va_arg' in a constant-expression is not
5379 allowed. */
5381 NIC_VA_ARG))
5383 /* Construct a location of the form:
5384 __builtin_va_arg (v, int)
5385 ~~~~~~~~~~~~~~~~~~~~~^~~~
5386 with the caret at the type, ranging from the start of the
5387 "__builtin_va_arg" token to the close paren. */
5388 location_t combined_loc
5391 }
5426 // C++ concepts
5430 /* Objective-C++ expressions. */
5440 {
5445 }
5446 /* FALLTHRU */
5450 }
5452 /* An id-expression can start with either an identifier, a
5453 `::' as the beginning of a qualified-id, or the "operator"
5454 keyword. */
5459 {
5460 id_expression:
5461 cp_expr id_expression;
5462 cp_expr decl;
5468 /* Parse the id-expression. */
5469 id_expression
5486 /* If we have a template-id, then no further lookup is
5487 required. If the template-id was for a template-class, we
5488 will sometimes have a TYPE_DECL at this point. */
5492 /* Look up the name. */
5493 else
5494 {
5495 tree ambiguous_decls;
5497 /* If we already know that this lookup is ambiguous, then
5498 we've already issued an error message; there's no reason
5499 to check again. */
5502 {
5505 }
5508 none_type,
5509 template_p,
5514 /* If the lookup was ambiguous, an error will already have
5515 been issued. */
5519 /* In Objective-C++, we may have an Objective-C 2.0
5520 dot-syntax for classes here. */
5525 {
5526 tree component;
5533 component);
5534 /* Build a location of the form:
5535 expr.component
5536 ~~~~~^~~~~~~~~
5537 with caret at the start of the component name (at
5538 input_location), ranging from the start of the id_expression
5539 to the end of the component name. */
5540 location_t combined_loc
5545 }
5547 /* In Objective-C++, an instance variable (ivar) may be preferred
5548 to whatever cp_parser_lookup_name() found.
5549 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5550 rest of c-family, we have to do a little extra work to preserve
5551 any location information in cp_expr "decl". Given that
5552 objc_lookup_ivar is implemented in "c-family" and "objc", we
5553 have a trip through the pure "tree" type, rather than cp_expr.
5554 Naively copying it back to "decl" would implicitly give the
5555 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5556 store an EXPR_LOCATION. Hence we only update "decl" (and
5557 hence its location_t) if we get back a different tree node. */
5559 id_expression);
5563 /* If name lookup gives us a SCOPE_REF, then the
5564 qualifying scope was dependent. */
5566 {
5567 /* At this point, we do not know if DECL is a valid
5568 integral constant expression. We assume that it is
5569 in fact such an expression, so that code like:
5571 template <int N> struct A {
5572 int a[B<N>::i];
5573 };
5575 is accepted. At template-instantiation time, we
5576 will check that B<N>::i is actually a constant. */
5578 }
5579 /* Check to see if DECL is a local variable in a context
5580 where that is forbidden. */
5583 {
5584 /* It might be that we only found DECL because we are
5585 trying to be generous with pre-ISO scoping rules.
5586 For example, consider:
5588 int i;
5589 void g() {
5590 for (int i = 0; i < 10; ++i) {}
5591 extern void f(int j = i);
5592 }
5594 Here, name look up will originally find the out
5595 of scope `i'. We need to issue a warning message,
5596 but then use the global `i'. */
5599 {
5604 }
5605 }
5606 }
5608 decl = (finish_id_expression
5610 idk,
5615 template_arg_p,
5622 }
5624 /* Anything else is an error. */
5628 }
5629 }
5637 {
5640 }
5642 /* Parse an id-expression.
5644 id-expression:
5645 unqualified-id
5646 qualified-id
5648 qualified-id:
5649 :: [opt] nested-name-specifier template [opt] unqualified-id
5650 :: identifier
5651 :: operator-function-id
5652 :: template-id
5654 Return a representation of the unqualified portion of the
5655 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5656 a `::' or nested-name-specifier.
5658 Often, if the id-expression was a qualified-id, the caller will
5659 want to make a SCOPE_REF to represent the qualified-id. This
5660 function does not do this in order to avoid wastefully creating
5661 SCOPE_REFs when they are not required.
5663 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5664 `template' keyword.
5666 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5667 uninstantiated templates.
5669 If *TEMPLATE_P is non-NULL, it is set to true iff the
5670 `template' keyword is used to explicitly indicate that the entity
5671 named is a template.
5673 If DECLARATOR_P is true, the id-expression is appearing as part of
5674 a declarator, rather than as part of an expression. */
5676 static cp_expr
5683 {
5687 /* Assume the `template' keyword was not used. */
5691 /* Look for the optional `::' operator. */
5692 global_scope_p
5693 = (!template_keyword_p
5698 /* Look for the optional nested-name-specifier. */
5699 nested_name_specifier_p
5702 check_dependency_p,
5704 declarator_p,
5705 template_keyword_p)
5708 /* If there is a nested-name-specifier, then we are looking at
5709 the first qualified-id production. */
5711 {
5712 tree saved_scope;
5713 tree saved_object_scope;
5714 tree saved_qualifying_scope;
5715 cp_expr unqualified_id;
5718 /* See if the next token is the `template' keyword. */
5722 /* Name lookup we do during the processing of the
5723 unqualified-id might obliterate SCOPE. */
5727 /* Process the final unqualified-id. */
5729 check_dependency_p,
5730 declarator_p,
5732 /* Restore the SAVED_SCOPE for our caller. */
5738 }
5739 /* Otherwise, if we are in global scope, then we are looking at one
5740 of the other qualified-id productions. */
5742 {
5744 tree id;
5746 /* Peek at the next token. */
5749 /* If it's an identifier, and the next token is not a "<", then
5750 we can avoid the template-id case. This is an optimization
5751 for this common case. */
5753 && !cp_parser_nth_token_starts_template_argument_list_p
5758 /* Try a template-id. */
5762 none_type,
5763 declarator_p);
5764 /* If that worked, we're done. */
5768 /* Peek at the next token. (Changes in the token buffer may
5769 have invalidated the pointer obtained above.) */
5773 {
5780 /* Fall through. */
5785 }
5786 }
5787 else
5790 declarator_p,
5791 optional_p);
5792 }
5794 /* Parse an unqualified-id.
5796 unqualified-id:
5797 identifier
5798 operator-function-id
5799 conversion-function-id
5800 ~ class-name
5801 template-id
5803 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5804 keyword, in a construct like `A::template ...'.
5806 Returns a representation of unqualified-id. For the `identifier'
5807 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5808 production a BIT_NOT_EXPR is returned; the operand of the
5809 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5810 other productions, see the documentation accompanying the
5811 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5812 names are looked up in uninstantiated templates. If DECLARATOR_P
5813 is true, the unqualified-id is appearing as part of a declarator,
5814 rather than as part of an expression. */
5816 static cp_expr
5822 {
5825 /* Peek at the next token. */
5829 {
5831 {
5832 tree id;
5834 /* We don't know yet whether or not this will be a
5835 template-id. */
5837 /* Try a template-id. */
5839 check_dependency_p,
5840 none_type,
5841 declarator_p);
5842 /* If it worked, we're done. */
5845 /* Otherwise, it's an ordinary identifier. */
5847 }
5851 check_dependency_p,
5852 none_type,
5853 declarator_p);
5856 {
5857 tree type_decl;
5858 tree qualifying_scope;
5859 tree object_scope;
5860 tree scope;
5863 /* Consume the `~' token. */
5865 /* Parse the class-name. The standard, as written, seems to
5866 say that:
5868 template <typename T> struct S { ~S (); };
5869 template <typename T> S<T>::~S() {}
5871 is invalid, since `~' must be followed by a class-name, but
5872 `S<T>' is dependent, and so not known to be a class.
5873 That's not right; we need to look in uninstantiated
5874 templates. A further complication arises from:
5876 template <typename T> void f(T t) {
5877 t.T::~T();
5878 }
5880 Here, it is not possible to look up `T' in the scope of `T'
5881 itself. We must look in both the current scope, and the
5882 scope of the containing complete expression.
5884 Yet another issue is:
5886 struct S {
5887 int S;
5888 ~S();
5889 };
5891 S::~S() {}
5893 The standard does not seem to say that the `S' in `~S'
5894 should refer to the type `S' and not the data member
5895 `S::S'. */
5897 /* DR 244 says that we look up the name after the "~" in the
5898 same scope as we looked up the qualifying name. That idea
5899 isn't fully worked out; it's more complicated than that. */
5904 /* Check for invalid scopes. */
5906 {
5910 }
5912 {
5916 scope);
5921 }
5924 /* If the name is of the form "X::~X" it's OK even if X is a
5925 typedef. */
5934 {
5937 }
5939 /* ~auto means the destructor of whatever the object is. */
5941 {
5944 "%<~auto%> only available with "
5948 }
5950 /* If there was an explicit qualification (S::~T), first look
5951 in the scope given by the qualification (i.e., S).
5953 Note: in the calls to cp_parser_class_name below we pass
5954 typename_type so that lookup finds the injected-class-name
5955 rather than the constructor. */
5959 {
5964 typename_type,
5967 declarator_p);
5970 }
5971 /* In "N::S::~S", look in "N" as well. */
5973 {
5978 type_decl
5982 typename_type,
5985 declarator_p);
5988 }
5989 /* In "p->S::~T", look in the scope given by "*p" as well. */
5991 {
5996 type_decl
6000 typename_type,
6003 declarator_p);
6006 }
6007 /* Look in the surrounding context. */
6009 {
6015 type_decl
6019 typename_type,
6022 declarator_p);
6025 {
6026 /* We couldn't find a type with this name. If we're parsing
6027 tentatively, fail and try something else. */
6029 {
6032 }
6033 /* Otherwise, accept it and check for a match at instantiation
6034 time. */
6039 }
6040 }
6041 /* If an error occurred, assume that the name of the
6042 destructor is the same as the name of the qualifying
6043 class. That allows us to keep parsing after running
6044 into ill-formed destructor names. */
6050 /* Check that destructor name and scope match. */
6052 {
6059 }
6061 /* [class.dtor]
6063 A typedef-name that names a class shall not be used as the
6064 identifier in the declarator for a destructor declaration. */
6071 type_decl);
6074 }
6078 {
6079 cp_expr id;
6081 /* This could be a template-id, so we try that first. */
6083 /* Try a template-id. */
6086 none_type,
6087 declarator_p);
6088 /* If that worked, we're done. */
6091 /* We still don't know whether we're looking at an
6092 operator-function-id or a conversion-function-id. */
6094 /* Try an operator-function-id. */
6096 /* If that didn't work, try a conversion-function-id. */
6100 {
6101 /* 17.6.3.3.5 */
6106 "literal operator suffixes not preceded by %<_%>"
6108 }
6111 }
6112 /* Fall through. */
6119 }
6120 }
6122 /* Parse an (optional) nested-name-specifier.
6124 nested-name-specifier: [C++98]
6125 class-or-namespace-name :: nested-name-specifier [opt]
6126 class-or-namespace-name :: template nested-name-specifier [opt]
6128 nested-name-specifier: [C++0x]
6129 type-name ::
6130 namespace-name ::
6131 nested-name-specifier identifier ::
6132 nested-name-specifier template [opt] simple-template-id ::
6134 PARSER->SCOPE should be set appropriately before this function is
6135 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6136 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6137 in name lookups.
6139 Sets PARSER->SCOPE to the class (TYPE) or namespace
6140 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6141 it unchanged if there is no nested-name-specifier. Returns the new
6142 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6144 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6145 part of a declaration and/or decl-specifier. */
6147 static tree
6154 {
6159 /* Remember where the nested-name-specifier starts. */
6161 {
6164 }
6167 {
6168 tree new_scope;
6169 tree old_scope;
6170 tree saved_qualifying_scope;
6172 /* Spot cases that cannot be the beginning of a
6173 nested-name-specifier. */
6176 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6177 the already parsed nested-name-specifier. */
6179 {
6180 /* Grab the nested-name-specifier and continue the loop. */
6182 /* If we originally encountered this nested-name-specifier
6183 with IS_DECLARATION set to false, we will not have
6184 resolved TYPENAME_TYPEs, so we must do so here. */
6187 {
6192 }
6195 }
6197 /* Spot cases that cannot be the beginning of a
6198 nested-name-specifier. On the second and subsequent times
6199 through the loop, we look for the `template' keyword. */
6201 ;
6202 /* A template-id can start a nested-name-specifier. */
6204 ;
6205 /* DR 743: decltype can be used in a nested-name-specifier. */
6207 ;
6208 else
6209 {
6210 /* If the next token is not an identifier, then it is
6211 definitely not a type-name or namespace-name. */
6214 /* If the following token is neither a `<' (to begin a
6215 template-id), nor a `::', then we are not looking at a
6216 nested-name-specifier. */
6222 {
6226 "found %<:%> in nested-name-specifier, "
6229 }
6232 && !cp_parser_nth_token_starts_template_argument_list_p
6235 }
6237 /* The nested-name-specifier is optional, so we parse
6238 tentatively. */
6241 /* Look for the optional `template' keyword, if this isn't the
6242 first time through the loop. */
6246 /* Save the old scope since the name lookup we are about to do
6247 might destroy it. */
6250 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6251 look up names in "X<T>::I" in order to determine that "Y" is
6252 a template. So, if we have a typename at this point, we make
6253 an effort to look through it. */
6255 && !typename_keyword_p
6260 /* Parse the qualifying entity. */
6261 new_scope
6263 typename_keyword_p,
6264 template_keyword_p,
6265 check_dependency_p,
6266 type_p,
6267 is_declaration);
6268 /* Look for the `::' token. */
6271 /* If we found what we wanted, we keep going; otherwise, we're
6272 done. */
6274 {
6277 /* Restore the OLD_SCOPE since it was valid before the
6278 failed attempt at finding the last
6279 class-or-namespace-name. */
6283 /* If the next token is a decltype, and the one after that is a
6284 `::', then the decltype has failed to resolve to a class or
6285 enumeration type. Give this error even when parsing
6286 tentatively since it can't possibly be valid--and we're going
6287 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6288 won't get another chance.*/
6292 {
6299 /* As below. */
6302 }
6306 {
6307 /* If we have a non-type template-id followed by ::, it can't
6308 possibly be valid. */
6313 {
6316 {
6322 }
6323 else
6324 {
6325 /* Variable template. */
6330 }
6337 /* As below. */
6341 }
6342 }
6346 /* If the next token is an identifier, and the one after
6347 that is a `::', then any valid interpretation would have
6348 found a class-or-namespace-name. */
6354 {
6357 {
6359 {
6360 tree decl;
6361 tree ambiguous_decls;
6364 none_type,
6373 decl);
6375 {
6376 // cp_parser_lookup_name has the same diagnostic,
6377 // thus make sure to emit it at most once.
6380 {
6385 }
6387 }
6388 else
6389 {
6391 cp_parser_name_lookup_error
6394 else
6395 cp_parser_name_lookup_error
6398 }
6399 }
6402 /* Treat this as a successful nested-name-specifier
6403 due to:
6405 [basic.lookup.qual]
6407 If the name found is not a class-name (clause
6408 _class_) or namespace-name (_namespace.def_), the
6409 program is ill-formed. */
6411 }
6413 }
6415 }
6416 /* We've found one valid nested-name-specifier. */
6418 /* Name lookup always gives us a DECL. */
6421 /* Uses of "template" must be followed by actual templates. */
6433 new_scope);
6434 /* If it is a class scope, try to complete it; we are about to
6435 be looking up names inside the class. */
6437 /* Since checking types for dependency can be expensive,
6438 avoid doing it if the type is already complete. */
6440 /* Do not try to complete dependent types. */
6442 {
6444 /* If it is a typedef to current class, use the current
6445 class instead, as the typedef won't have any names inside
6446 it yet. */
6450 }
6451 /* Make sure we look in the right scope the next time through
6452 the loop. */
6454 }
6456 /* If parsing tentatively, replace the sequence of tokens that makes
6457 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6458 token. That way, should we re-parse the token stream, we will
6459 not have to repeat the effort required to do the parse, nor will
6460 we issue duplicate error messages. */
6462 {
6466 /* Reset the contents of the START token. */
6468 /* Retrieve any deferred checks. Do not pop this access checks yet
6469 so the memory will not be reclaimed during token replacing below. */
6477 /* Purge all subsequent tokens. */
6479 }
6485 }
6487 /* Parse a nested-name-specifier. See
6488 cp_parser_nested_name_specifier_opt for details. This function
6489 behaves identically, except that it will an issue an error if no
6490 nested-name-specifier is present. */
6492 static tree
6498 {
6499 tree scope;
6501 /* Look for the nested-name-specifier. */
6503 typename_keyword_p,
6504 check_dependency_p,
6505 type_p,
6506 is_declaration);
6507 /* If it was not present, issue an error message. */
6509 {
6512 }
6515 }
6517 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6518 this is either a class-name or a namespace-name (which corresponds
6519 to the class-or-namespace-name production in the grammar). For
6520 C++0x, it can also be a type-name that refers to an enumeration
6521 type or a simple-template-id.
6523 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6524 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6525 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6526 TYPE_P is TRUE iff the next name should be taken as a class-name,
6527 even the same name is declared to be another entity in the same
6528 scope.
6530 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6531 specified by the class-or-namespace-name. If neither is found the
6532 ERROR_MARK_NODE is returned. */
6534 static tree
6541 {
6542 tree saved_scope;
6543 tree saved_qualifying_scope;
6544 tree saved_object_scope;
6545 tree scope;
6549 /* DR 743: decltype can appear in a nested-name-specifier. */
6551 {
6555 {
6558 }
6562 }
6564 /* Before we try to parse the class-name, we must save away the
6565 current PARSER->SCOPE since cp_parser_class_name will destroy
6566 it. */
6570 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6571 there is no need to look for a namespace-name. */
6572 only_class_p = template_keyword_p
6577 typename_keyword_p,
6578 template_keyword_p,
6580 check_dependency_p,
6582 is_declaration,
6585 /* If that didn't work, try for a namespace-name. */
6587 {
6588 /* Restore the saved scope. */
6592 /* If we are not looking at an identifier followed by the scope
6593 resolution operator, then this is not part of a
6594 nested-name-specifier. (Note that this function is only used
6595 to parse the components of a nested-name-specifier.) */
6600 }
6603 }
6605 /* Return true if we are looking at a compound-literal, false otherwise. */
6607 static bool
6609 {
6612 /* Skip tokens until the next token is a closing parenthesis.
6613 If we find the closing `)', and the next token is a `{', then
6614 we are looking at a compound-literal. */
6615 bool compound_literal_p
6620 /* Roll back the tokens we skipped. */
6624 }
6626 /* Return true if EXPR is the integer constant zero or a complex constant
6627 of zero, without any folding, but ignoring location wrappers. */
6629 static bool
6631 {
6634 }
6636 /* Parse a postfix-expression.
6638 postfix-expression:
6639 primary-expression
6640 postfix-expression [ expression ]
6641 postfix-expression ( expression-list [opt] )
6642 simple-type-specifier ( expression-list [opt] )
6643 typename :: [opt] nested-name-specifier identifier
6644 ( expression-list [opt] )
6645 typename :: [opt] nested-name-specifier template [opt] template-id
6646 ( expression-list [opt] )
6647 postfix-expression . template [opt] id-expression
6648 postfix-expression -> template [opt] id-expression
6649 postfix-expression . pseudo-destructor-name
6650 postfix-expression -> pseudo-destructor-name
6651 postfix-expression ++
6652 postfix-expression --
6653 dynamic_cast < type-id > ( expression )
6654 static_cast < type-id > ( expression )
6655 reinterpret_cast < type-id > ( expression )
6656 const_cast < type-id > ( expression )
6657 typeid ( expression )
6658 typeid ( type-id )
6660 GNU Extension:
6662 postfix-expression:
6663 ( type-id ) { initializer-list , [opt] }
6665 This extension is a GNU version of the C99 compound-literal
6666 construct. (The C99 grammar uses `type-name' instead of `type-id',
6667 but they are essentially the same concept.)
6669 If ADDRESS_P is true, the postfix expression is the operand of the
6670 `&' operator. CAST_P is true if this expression is the target of a
6671 cast.
6673 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6674 class member access expressions [expr.ref].
6676 Returns a representation of the expression. */
6678 static cp_expr
6682 {
6684 location_t loc;
6690 /* Peek at the next token. */
6695 /* Some of the productions are determined by keywords. */
6698 {
6703 {
6704 tree type;
6705 cp_expr expression;
6709 /* All of these can be handled in the same way from the point
6710 of view of parsing. Begin by consuming the token
6711 identifying the cast. */
6714 /* New types cannot be defined in the cast. */
6716 parser->type_definition_forbidden_message
6719 /* Look for the opening `<'. */
6721 /* Parse the type to which we are casting. */
6726 /* Look for the closing `>'. */
6728 /* Restore the old message. */
6731 bool saved_greater_than_is_operator_p
6735 /* And the expression which is being cast. */
6736 matching_parens parens;
6740 RT_CLOSE_PAREN);
6744 parser->greater_than_is_operator_p
6747 /* Only type conversions to integral or enumeration types
6748 can be used in constant-expressions. */
6751 {
6754 }
6757 {
6759 postfix_expression
6763 postfix_expression
6767 postfix_expression
6769 tf_warning_or_error);
6772 postfix_expression
6777 }
6779 /* Construct a location e.g. :
6780 reinterpret_cast <int *> (expr)
6781 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6782 ranging from the start of the "*_cast" token to the final closing
6783 paren, with the caret at the start. */
6786 }
6790 {
6791 tree type;
6795 /* Consume the `typeid' token. */
6797 /* Look for the `(' token. */
6798 matching_parens parens;
6800 /* Types cannot be defined in a `typeid' expression. */
6802 parser->type_definition_forbidden_message
6804 /* We can't be sure yet whether we're looking at a type-id or an
6805 expression. */
6807 /* Try a type-id first. */
6812 /* Look for the `)' token. Otherwise, we can't be sure that
6813 we're not looking at an expression: consider `typeid (int
6814 (3))', for example. */
6816 /* If all went well, simply lookup the type-id. */
6819 /* Otherwise, fall back to the expression variant. */
6820 else
6821 {
6822 tree expression;
6824 /* Look for an expression. */
6826 /* Compute its typeid. */
6828 /* Look for the `)' token. */
6830 }
6831 /* Restore the saved message. */
6833 /* `typeid' may not appear in an integral constant expression. */
6837 /* Construct a location e.g. :
6838 typeid (expr)
6839 ^~~~~~~~~~~~~
6840 ranging from the start of the "typeid" token to the final closing
6841 paren, with the caret at the start. */
6843 {
6844 location_t typeid_loc
6848 }
6849 }
6853 {
6854 tree type;
6855 /* The syntax permitted here is the same permitted for an
6856 elaborated-type-specifier. */
6863 }
6869 {
6872 tree p;
6879 {
6882 }
6888 {
6891 postfix_expression
6893 else
6894 {
6898 }
6904 tf_warning_or_error);
6905 else
6906 {
6910 }
6915 postfix_expression
6919 postfix_expression
6922 else
6923 {
6927 }
6932 }
6934 }
6937 {
6938 tree type;
6940 /* If the next thing is a simple-type-specifier, we may be
6941 looking at a functional cast. We could also be looking at
6942 an id-expression. So, we try the functional cast, and if
6943 that doesn't work we fall back to the primary-expression. */
6945 /* Look for the simple-type-specifier. */
6949 CP_PARSER_FLAGS_NONE);
6951 /* Parse the cast itself. */
6953 postfix_expression
6955 /* If that worked, we're done. */
6959 /* If the functional-cast didn't work out, try a
6960 compound-literal. */
6963 {
6968 matching_parens parens;
6971 /* Avoid calling cp_parser_type_id pointlessly, see comment
6972 in cp_parser_cast_expression about c++/29234. */
6975 else
6976 {
6977 /* Parse the type. */
6983 }
6985 /* If things aren't going well, there's no need to
6986 keep going. */
6988 {
6990 /* Parse the brace-enclosed initializer list. */
6993 }
6994 /* If that worked, we're definitely looking at a
6995 compound-literal expression. */
6997 {
6998 /* Warn the user that a compound literal is not
6999 allowed in standard C++. */
7002 /* For simplicity, we disallow compound literals in
7003 constant-expressions. We could
7004 allow compound literals of integer type, whose
7005 initializer was a constant, in constant
7006 expressions. Permitting that usage, as a further
7007 extension, would not change the meaning of any
7008 currently accepted programs. (Of course, as
7009 compound literals are not part of ISO C++, the
7010 standard has nothing to say.) */
7012 NIC_NCC))
7013 {
7016 }
7017 /* Form the representation of the compound-literal. */
7018 postfix_expression
7023 }
7024 }
7026 /* It must be a primary-expression. */
7027 postfix_expression
7030 decltype_p,
7032 }
7034 }
7036 /* Note that we don't need to worry about calling build_cplus_new on a
7037 class-valued CALL_EXPR in decltype when it isn't the end of the
7038 postfix-expression; unary_complex_lvalue will take care of that for
7039 all these cases. */
7041 /* Keep looping until the postfix-expression is complete. */
7043 {
7047 /* It is not a Koenig lookup function call. */
7048 postfix_expression
7051 /* Peek at the next token. */
7055 {
7058 {
7060 "two consecutive %<[%> shall "
7063 }
7064 postfix_expression
7066 postfix_expression,
7068 decltype_p);
7077 /* postfix-expression ( expression-list [opt] ) */
7078 {
7089 is_builtin_constant_p
7092 {
7093 /* The whole point of __builtin_constant_p is to allow
7094 non-constant expressions to appear as arguments. */
7095 saved_integral_constant_expression_p
7097 saved_non_integral_constant_expression_p
7100 }
7101 args = (cp_parser_parenthesized_expression_list
7108 {
7109 parser->integral_constant_expression_p
7111 parser->non_integral_constant_expression_p
7113 }
7116 {
7119 }
7121 /* Function calls are not permitted in
7122 constant-expressions. */
7125 NIC_FUNC_CALL))
7126 {
7130 }
7135 {
7137 {
7139 {
7142 postfix_expression
7144 complain);
7145 }
7146 else
7147 postfix_expression
7149 }
7150 /* We do not perform argument-dependent lookup if
7151 normal lookup finds a non-function, in accordance
7152 with the expected resolution of DR 218. */
7155 {
7159 /* Do not do argument dependent lookup if regular
7160 lookup finds a member function or a block-scope
7161 function declaration. [basic.lookup.argdep]/3 */
7164 {
7167 postfix_expression
7169 complain);
7170 }
7171 }
7172 }
7178 {
7185 }
7188 {
7198 {
7200 postfix_expression
7204 }
7207 {
7208 postfix_expression
7209 = (build_new_method_call
7215 complain));
7216 }
7217 else
7218 postfix_expression
7222 complain);
7223 }
7227 postfix_expression = (build_offset_ref_call_from_tree
7229 complain));
7231 /* A call to a static class member, or a namespace-scope
7232 function. */
7233 postfix_expression
7236 koenig_p,
7237 complain);
7238 else
7239 /* All other function calls. */
7240 postfix_expression
7243 koenig_p,
7244 complain);
7247 {
7249 start_loc,
7250 close_paren_loc);
7252 }
7254 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7258 }
7263 /* postfix-expression . template [opt] id-expression
7264 postfix-expression . pseudo-destructor-name
7265 postfix-expression -> template [opt] id-expression
7266 postfix-expression -> pseudo-destructor-name */
7268 /* Consume the `.' or `->' operator. */
7271 postfix_expression
7273 postfix_expression,
7280 /* postfix-expression ++ */
7281 /* Consume the `++' token. */
7283 /* Generate a representation for the complete expression. */
7284 postfix_expression
7286 POSTINCREMENT_EXPR);
7287 /* Increments may not appear in constant-expressions. */
7295 /* postfix-expression -- */
7296 /* Consume the `--' token. */
7298 /* Generate a representation for the complete expression. */
7299 postfix_expression
7301 POSTDECREMENT_EXPR);
7302 /* Decrements may not appear in constant-expressions. */
7313 return is_member_access
7314 ? postfix_expression
7316 else
7318 }
7319 }
7321 /* We should never get here. */
7324 }
7326 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7327 by cp_parser_builtin_offsetof. We're looking for
7329 postfix-expression [ expression ]
7330 postfix-expression [ braced-init-list ] (C++11)
7332 FOR_OFFSETOF is set if we're being called in that context, which
7333 changes how we deal with integer constant expressions. */
7335 static tree
7337 tree postfix_expression,
7340 {
7345 /* Consume the `[' token. */
7351 /* Parse the index expression. */
7352 /* ??? For offsetof, there is a question of what to allow here. If
7353 offsetof is not being used in an integral constant expression context,
7354 then we *could* get the right answer by computing the value at runtime.
7355 If we are in an integral constant expression context, then we might
7356 could accept any constant expression; hard to say without analysis.
7357 Rather than open the barn door too wide right away, allow only integer
7358 constant expressions here. */
7361 else
7362 {
7364 {
7369 }
7370 else
7372 }
7376 /* Look for the closing `]'. */
7379 /* Build the ARRAY_REF. */
7383 /* When not doing offsetof, array references are not permitted in
7384 constant-expressions. */
7390 }
7392 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7393 dereference of incomplete type, returns true if error_mark_node should
7394 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7395 and *DEPENDENT_P. */
7397 bool
7400 {
7401 /* In a template, be permissive by treating an object expression
7402 of incomplete type as dependent (after a pedwarn). */
7403 diagnostic_t kind = (processing_template_decl
7407 {
7419 /* Don't emit any diagnostic for OVERLOADs. */
7423 /* Avoid clobbering e.g. DECLs. */
7427 }
7439 {
7442 }
7444 }
7446 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7447 by cp_parser_builtin_offsetof. We're looking for
7449 postfix-expression . template [opt] id-expression
7450 postfix-expression . pseudo-destructor-name
7451 postfix-expression -> template [opt] id-expression
7452 postfix-expression -> pseudo-destructor-name
7454 FOR_OFFSETOF is set if we're being called in that context. That sorta
7455 limits what of the above we'll actually accept, but nevermind.
7456 TOKEN_TYPE is the "." or "->" token, which will already have been
7457 removed from the stream. */
7459 static tree
7462 cp_expr postfix_expression,
7464 location_t location)
7465 {
7466 tree name;
7472 /* If this is a `->' operator, dereference the pointer. */
7475 tf_warning_or_error);
7476 /* Check to see whether or not the expression is type-dependent and
7477 not the current instantiation. */
7479 /* The identifier following the `->' or `.' is not qualified. */
7485 /* Enter the scope corresponding to the type of the object
7486 given by the POSTFIX_EXPRESSION. */
7488 {
7490 /* According to the standard, no expression should ever have
7491 reference type. Unfortunately, we do not currently match
7492 the standard in this respect in that our internal representation
7493 of an expression may have reference type even when the standard
7494 says it does not. Therefore, we have to manually obtain the
7495 underlying type here. */
7497 /* The type of the POSTFIX_EXPRESSION must be complete. */
7498 /* Unlike the object expression in other contexts, *this is not
7499 required to be of complete type for purposes of class member
7500 access (5.2.5) outside the member function body. */
7503 && !(processing_template_decl
7504 && current_class_type
7505 && (same_type_ignoring_top_level_qualifiers_p
7507 {
7513 }
7516 {
7517 /* Let the name lookup machinery know that we are processing a
7518 class member access expression. */
7520 /* If something went wrong, we want to be able to discern that case,
7521 as opposed to the case where there was no SCOPE due to the type
7522 of expression being dependent. */
7525 /* If the SCOPE was erroneous, make the various semantic analysis
7526 functions exit quickly -- and without issuing additional error
7527 messages. */
7530 }
7531 }
7534 /* Tell cp_parser_lookup_name that there was an object, even though it's
7535 type-dependent. */
7538 /* Assume this expression is not a pseudo-destructor access. */
7541 /* If the SCOPE is a scalar type, then, if this is a valid program,
7542 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7543 is type dependent, it can be pseudo-destructor-name or something else.
7544 Try to parse it as pseudo-destructor-name first. */
7546 {
7547 tree s;
7548 tree type;
7551 /* Parse the pseudo-destructor-name. */
7560 {
7562 postfix_expression
7565 }
7566 }
7569 {
7570 /* If the SCOPE is not a scalar type, we are looking at an
7571 ordinary class member access expression, rather than a
7572 pseudo-destructor-name. */
7575 /* Parse the id-expression. */
7576 name = (cp_parser_id_expression
7583 /* In general, build a SCOPE_REF if the member name is qualified.
7584 However, if the name was not dependent and has already been
7585 resolved; there is no need to build the SCOPE_REF. For example;
7587 struct X { void f(); };
7588 template <typename T> void f(T* t) { t->X::f(); }
7590 Even though "t" is dependent, "X::f" is not and has been resolved
7591 to a BASELINK; there is no need to include scope information. */
7593 /* But we do need to remember that there was an explicit scope for
7594 virtual function calls. */
7598 /* If the name is a template-id that names a type, we will get a
7599 TYPE_DECL here. That is invalid code. */
7601 {
7604 }
7605 else
7606 {
7608 {
7610 {
7614 }
7615 else
7618 name,
7619 template_p);
7623 }
7625 adjust_result_of_qualified_name_lookup
7627 postfix_expression
7629 template_p,
7630 tf_warning_or_error);
7631 /* Build a location e.g.:
7632 ptr->access_expr
7633 ~~~^~~~~~~~~~~~~
7634 where the caret is at the deref token, ranging from
7635 the start of postfix_expression to the end of the access expr. */
7636 location_t end_loc
7638 location_t combined_loc
7641 }
7642 }
7644 /* We no longer need to look up names in the scope of the object on
7645 the left-hand side of the `.' or `->' operator. */
7648 /* Outside of offsetof, these operators may not appear in
7649 constant-expressions. */
7651 && (cp_parser_non_integral_constant_expression
7656 }
7658 /* Parse a parenthesized expression-list.
7660 expression-list:
7661 assignment-expression
7662 expression-list, assignment-expression
7664 attribute-list:
7665 expression-list
7666 identifier
7667 identifier, expression-list
7669 CAST_P is true if this expression is the target of a cast.
7671 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7672 argument pack.
7674 WRAP_LOCATIONS_P is true if expressions within this list for which
7675 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7676 their source locations.
7678 Returns a vector of trees. Each element is a representation of an
7679 assignment-expression. NULL is returned if the ( and or ) are
7680 missing. An empty, but allocated, vector is returned on no
7681 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7682 if we are parsing an attribute list for an attribute that wants a
7683 plain identifier argument, normal_attr for an attribute that wants
7684 an expression, or non_attr if we aren't parsing an attribute list. If
7685 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7686 not all of the expressions in the list were constant.
7687 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7688 will be written to with the location of the closing parenthesis. If
7689 an error occurs, it may or may not be written to. */
7699 {
7705 /* Assume all the expressions will be constant. */
7709 matching_parens parens;
7715 /* Within a parenthesized expression, a `>' token is always
7716 the greater-than operator. */
7717 saved_greater_than_is_operator_p
7723 /* Consume expressions until there are no more. */
7726 {
7727 /* At the beginning of attribute lists, check to see if the
7728 next token is an identifier. */
7731 {
7734 /* Consume the identifier. */
7736 /* Save the identifier. */
7738 }
7739 else
7740 {
7743 /* Parse the next assignment-expression. */
7745 {
7746 /* A braced-init-list. */
7752 }
7754 {
7755 expr = (cp_parser_constant_expression
7760 }
7761 else
7763 cast_p);
7768 /* If we have an ellipsis, then this is an expression
7769 expansion. */
7772 {
7773 /* Consume the `...'. */
7776 /* Build the argument pack. */
7778 }
7783 /* Add it to the list. We add error_mark_node
7784 expressions to the list, so that we can still tell if
7785 the correct form for a parenthesized expression-list
7786 is found. That gives better errors. */
7791 }
7793 /* After the first item, attribute lists look the same as
7794 expression lists. */
7797 get_comma:;
7798 /* If the next token isn't a `,', then we are done. */
7802 /* Otherwise, consume the `,' and keep going. */
7804 }
7810 {
7813 skip_comma:;
7814 /* We try and resync to an unnested comma, as that will give the
7815 user better diagnostics. */
7823 {
7824 parser->greater_than_is_operator_p
7827 }
7828 }
7830 parser->greater_than_is_operator_p
7837 }
7839 /* Parse a pseudo-destructor-name.
7841 pseudo-destructor-name:
7842 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7843 :: [opt] nested-name-specifier template template-id :: ~ type-name
7844 :: [opt] nested-name-specifier [opt] ~ type-name
7846 If either of the first two productions is used, sets *SCOPE to the
7847 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7848 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7849 or ERROR_MARK_NODE if the parse fails. */
7851 static void
7853 tree object,
7856 {
7859 /* Handle ~auto. */
7863 {
7866 "%<~auto%> only available with "
7873 }
7875 /* Assume that things will not work out. */
7878 /* Look for the optional `::' operator. */
7880 /* Look for the optional nested-name-specifier. */
7881 nested_name_specifier_p
7888 /* Now, if we saw a nested-name-specifier, we might be doing the
7889 second production. */
7892 {
7893 /* Consume the `template' keyword. */
7895 /* Parse the template-id. */
7899 class_type,
7901 /* Look for the `::' token. */
7903 }
7904 /* If the next token is not a `~', then there might be some
7905 additional qualification. */
7907 {
7908 /* At this point, we're looking for "type-name :: ~". The type-name
7909 must not be a class-name, since this is a pseudo-destructor. So,
7910 it must be either an enum-name, or a typedef-name -- both of which
7911 are just identifiers. So, we peek ahead to check that the "::"
7912 and "~" tokens are present; if they are not, then we can avoid
7913 calling type_name. */
7917 {
7920 }
7922 /* Look for the type-name. */
7927 /* Look for the `::' token. */
7929 }
7930 else
7933 /* Look for the `~'. */
7936 /* Once we see the ~, this has to be a pseudo-destructor. */
7940 /* Look for the type-name again. We are not responsible for
7941 checking that it matches the first type-name. */
7943 }
7945 /* Parse a unary-expression.
7947 unary-expression:
7948 postfix-expression
7949 ++ cast-expression
7950 -- cast-expression
7951 unary-operator cast-expression
7952 sizeof unary-expression
7953 sizeof ( type-id )
7954 alignof ( type-id ) [C++0x]
7955 new-expression
7956 delete-expression
7958 GNU Extensions:
7960 unary-expression:
7961 __extension__ cast-expression
7962 __alignof__ unary-expression
7963 __alignof__ ( type-id )
7964 alignof unary-expression [C++0x]
7965 __real__ cast-expression
7966 __imag__ cast-expression
7967 && identifier
7968 sizeof ( type-id ) { initializer-list , [opt] }
7969 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7970 __alignof__ ( type-id ) { initializer-list , [opt] }
7972 ADDRESS_P is true iff the unary-expression is appearing as the
7973 operand of the `&' operator. CAST_P is true if this expression is
7974 the target of a cast.
7976 Returns a representation of the expression. */
7978 static cp_expr
7981 {
7985 /* Peek at the next token. */
7987 /* Some keywords give away the kind of expression. */
7989 {
7993 {
7996 {
8002 /* Consume the token. */
8004 /* Parse the operand. */
8009 else
8010 {
8011 /* ISO C++ defines alignof only with types, not with
8012 expressions. So pedwarn if alignof is used with a non-
8013 type expression. However, __alignof__ is ok. */
8016 "ISO C++ does not allow %<alignof%> "
8020 }
8021 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8022 SIZEOF_EXPR with the original operand. */
8024 {
8026 {
8028 {
8031 error_mark_node));
8033 }
8034 else
8038 }
8039 }
8041 /* Construct a location e.g. :
8042 alignof (expr)
8043 ^~~~~~~~~~~~~~
8044 with start == caret at the start of the "alignof"/"sizeof"
8045 token, with the endpoint at the final closing paren. */
8046 location_t finish_loc
8048 location_t compound_loc
8055 }
8064 {
8065 /* The saved value of the PEDANTIC flag. */
8067 tree expr;
8069 /* Save away the PEDANTIC flag. */
8071 /* Parse the cast-expression. */
8073 /* Restore the PEDANTIC flag. */
8077 }
8081 {
8082 tree expression;
8084 /* Consume the `__real__' or `__imag__' token. */
8086 /* Parse the cast-expression. */
8088 /* Create the complete representation. */
8092 expression,
8093 tf_warning_or_error);
8094 }
8102 {
8103 tree expr;
8112 matching_parens parens;
8116 parser->type_definition_forbidden_message
8119 saved_integral_constant_expression_p
8121 saved_non_integral_constant_expression_p
8125 saved_greater_than_is_operator_p
8137 parser->greater_than_is_operator_p
8140 parser->integral_constant_expression_p
8142 parser->non_integral_constant_expression_p
8147 location_t finish_loc
8151 /* Construct a location of the form:
8152 noexcept (expr)
8153 ^~~~~~~~~~~~~~~
8154 with start == caret, finishing at the close-paren. */
8155 location_t noexcept_loc
8159 noexcept_loc);
8160 }
8164 }
8165 }
8167 /* Look for the `:: new' and `:: delete', which also signal the
8168 beginning of a new-expression, or delete-expression,
8169 respectively. If the next token is `::', then it might be one of
8170 these. */
8172 {
8175 /* See if the token after the `::' is one of the keywords in
8176 which we're interested. */
8178 /* If it's `new', we have a new-expression. */
8181 /* Similarly, for `delete'. */
8184 }
8186 /* Look for a unary operator. */
8188 /* The `++' and `--' operators can be handled similarly, even though
8189 they are not technically unary-operators in the grammar. */
8191 {
8196 /* Handle the GNU address-of-label extension. */
8199 {
8200 tree identifier;
8201 tree expression;
8204 /* Consume the '&&' token. */
8206 /* Look for the identifier. */
8207 location_t finish_loc
8210 /* Construct a location of the form:
8211 &&label
8212 ^~~~~~~
8213 with caret==start at the "&&", finish at the end of the label. */
8214 location_t combined_loc
8216 /* Create an expression representing the address. */
8219 NIC_ADDR_LABEL))
8222 }
8223 }
8225 {
8226 cp_expr cast_expression;
8232 /* Consume the operator token. */
8236 /* Parse the cast-expression. */
8237 cast_expression
8242 pidk);
8244 /* Make a location:
8245 OP_TOKEN CAST_EXPRESSION
8246 ^~~~~~~~~~~~~~~~~~~~~~~~~
8247 with start==caret at the operator token, and
8248 extending to the end of the cast_expression. */
8251 /* Now, build an appropriate representation. */
8253 {
8257 RO_UNARY_STAR,
8258 complain);
8259 /* TODO: build_x_indirect_ref does not always honor the
8260 location, so ensure it is set. */
8266 /* Fall through. */
8269 cast_expression,
8270 complain);
8271 /* TODO: build_x_unary_op does not always honor the location,
8272 so ensure it is set. */
8280 /* Fall through. */
8282 /* Immediately fold negation of a constant, unless the constant is 0
8283 (since -0 == 0) or it would overflow. */
8288 {
8291 cast_expression);
8293 {
8296 }
8297 }
8298 /* Fall through. */
8307 }
8311 non_constant_p))
8315 }
8319 decltype_p,
8320 pidk);
8321 }
8323 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8324 unary-operator, the corresponding tree code is returned. */
8326 static enum tree_code
8328 {
8330 {
8351 }
8352 }
8354 /* Parse a new-expression.
8356 new-expression:
8357 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8358 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8360 Returns a representation of the expression. */
8362 static tree
8364 {
8367 tree type;
8370 tree ret;
8374 /* Look for the optional `::' operator. */
8375 global_scope_p
8379 /* Look for the `new' operator. */
8381 /* There's no easy way to tell a new-placement from the
8382 `( type-id )' construct. */
8384 /* Look for a new-placement. */
8386 /* If that didn't work out, there's no new-placement. */
8388 {
8392 }
8394 /* If the next token is a `(', then we have a parenthesized
8395 type-id. */
8397 {
8401 /* Consume the `('. */
8402 matching_parens parens;
8405 /* Parse the type-id. */
8406 parser->type_definition_forbidden_message
8408 {
8411 }
8414 /* Look for the closing `)'. */
8417 /* There should not be a direct-new-declarator in this production,
8418 but GCC used to allowed this, so we check and emit a sensible error
8419 message for this case. */
8421 {
8427 }
8428 }
8429 /* Otherwise, there must be a new-type-id. */
8430 else
8433 /* If the next token is a `(' or '{', then we have a new-initializer. */
8438 else
8441 /* A new-expression may not appear in an integral constant
8442 expression. */
8445 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8446 of a new-type-id or type-id of a new-expression, the new-expression shall
8447 contain a new-initializer of the form ( assignment-expression )".
8448 Additionally, consistently with the spirit of DR 1467, we want to accept
8449 'new auto { 2 }' too. */
8455 {
8457 "initialization of new-expression for type %<auto%> "
8460 }
8461 else
8462 {
8463 /* Construct a location e.g.:
8464 ptr = new int[100]
8465 ^~~~~~~~~~~~
8466 with caret == start at the start of the "new" token, and the end
8467 at the end of the final token we consumed. */
8472 /* Create a representation of the new-expression. */
8474 tf_warning_or_error);
8476 }
8484 }
8486 /* Parse a new-placement.
8488 new-placement:
8489 ( expression-list )
8491 Returns the same representation as for an expression-list. */
8495 {
8498 /* Parse the expression-list. */
8499 expression_list = (cp_parser_parenthesized_expression_list
8508 }
8510 /* Parse a new-type-id.
8512 new-type-id:
8513 type-specifier-seq new-declarator [opt]
8515 Returns the TYPE allocated. If the new-type-id indicates an array
8516 type, *NELTS is set to the number of elements in the last array
8517 bound; the TYPE will not include the last array bound. */
8519 static tree
8521 {
8522 cp_decl_specifier_seq type_specifier_seq;
8528 /* The type-specifier sequence must not contain type definitions.
8529 (It cannot contain declarations of new types either, but if they
8530 are not definitions we will catch that because they are not
8531 complete.) */
8533 parser->type_definition_forbidden_message
8535 /* Parse the type-specifier-seq. */
8539 /* Restore the old message. */
8545 /* Parse the new-declarator. */
8548 /* Determine the number of elements in the last array dimension, if
8549 any. */
8551 /* Skip down to the last array dimension. */
8556 {
8559 }
8564 {
8567 }
8570 {
8577 else
8579 }
8582 }
8584 /* Parse an (optional) new-declarator.
8586 new-declarator:
8587 ptr-operator new-declarator [opt]
8588 direct-new-declarator
8590 Returns the declarator. */
8594 {
8597 cp_cv_quals cv_quals;
8599 /* We don't know if there's a ptr-operator next, or not. */
8601 /* Look for a ptr-operator. */
8603 /* If that worked, look for more new-declarators. */
8605 {
8608 /* Parse another optional declarator. */
8611 declarator = cp_parser_make_indirect_declarator
8615 }
8617 /* If the next token is a `[', there is a direct-new-declarator. */
8622 }
8624 /* Parse a direct-new-declarator.
8626 direct-new-declarator:
8627 [ expression ]
8628 direct-new-declarator [constant-expression]
8630 */
8634 {
8638 {
8639 tree expression;
8642 /* Look for the opening `['. */
8647 /* The standard requires that the expression have integral
8648 type. DR 74 adds enumeration types. We believe that the
8649 real intent is that these expressions be handled like the
8650 expression in a `switch' condition, which also allows
8651 classes with a single conversion to integral or
8652 enumeration type. */
8654 {
8655 expression
8657 expression,
8660 {
8662 "expression in new-declarator must have integral "
8665 }
8666 }
8668 /* Look for the closing `]'. */
8671 /* Add this bound to the declarator. */
8674 /* If the next token is not a `[', then there are no more
8675 bounds. */
8678 }
8681 }
8683 /* Parse a new-initializer.
8685 new-initializer:
8686 ( expression-list [opt] )
8687 braced-init-list
8689 Returns a representation of the expression-list. */
8693 {
8697 {
8698 tree t;
8705 }
8706 else
8707 expression_list = (cp_parser_parenthesized_expression_list
8713 }
8715 /* Parse a delete-expression.
8717 delete-expression:
8718 :: [opt] delete cast-expression
8719 :: [opt] delete [ ] cast-expression
8721 Returns a representation of the expression. */
8723 static tree
8725 {
8728 tree expression;
8730 /* Look for the optional `::' operator. */
8731 global_scope_p
8735 /* Look for the `delete' keyword. */
8737 /* See if the array syntax is in use. */
8739 {
8740 /* Consume the `[' token. */
8742 /* Look for the `]' token. */
8744 /* Remember that this is the `[]' construct. */
8746 }
8747 else
8750 /* Parse the cast-expression. */
8753 /* A delete-expression may not appear in an integral constant
8754 expression. */
8759 tf_warning_or_error);
8760 }
8762 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8763 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8764 0 otherwise. */
8766 static int
8768 {
8771 {
8813 /* In ((type ()) () the last () isn't a valid cast-expression,
8814 so the whole must be parsed as postfix-expression. */
8819 /* '[' may start a primary-expression in obj-c++ and in C++11,
8820 as a lambda-expression, eg, '(void)[]{}'. */
8827 /* '++' and '--' may or may not start a cast-expression:
8829 struct T { void operator++(int); };
8830 void f() { (T())++; }
8832 vs
8834 int a;
8835 (int)++a; */
8840 }
8841 }
8843 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8844 in the order: const_cast, static_cast, reinterpret_cast.
8846 Don't suggest dynamic_cast.
8848 Return the first legal cast kind found, or NULL otherwise. */
8852 {
8853 tree trial;
8855 /* Reuse the parser logic by attempting to build the various kinds of
8856 cast, with "complain" disabled.
8857 Identify the first such cast that is valid. */
8859 /* Don't attempt to run such logic within template processing. */
8863 /* First try const_cast. */
8868 /* If that fails, try static_cast. */
8873 /* Finally, try reinterpret_cast. */
8878 /* No such cast possible. */
8880 }
8882 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8883 suggesting how to convert a C-style cast of the form:
8885 (DST_TYPE)ORIG_EXPR
8887 to a C++-style cast.
8889 The primary range of RICHLOC is asssumed to be that of the original
8890 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8891 of the parens in the C-style cast. */
8893 static void
8896 tree dst_type)
8897 {
8898 /* This function is non-trivial, so bail out now if the warning isn't
8899 going to be emitted. */
8903 /* Try to find a legal C++ cast, trying them in order:
8904 const_cast, static_cast, reinterpret_cast. */
8909 /* Replace the open paren with "CAST_SUGGESTION<". */
8910 pretty_printer pp;
8914 /* Replace the close paren with "> (". */
8917 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8919 }
8922 /* Parse a cast-expression.
8924 cast-expression:
8925 unary-expression
8926 ( type-id ) cast-expression
8928 ADDRESS_P is true iff the unary-expression is appearing as the
8929 operand of the `&' operator. CAST_P is true if this expression is
8930 the target of a cast.
8932 Returns a representation of the expression. */
8934 static cp_expr
8937 {
8938 /* If it's a `(', then we might be looking at a cast. */
8940 {
8946 /* There's no way to know yet whether or not this is a cast.
8947 For example, `(int (3))' is a unary-expression, while `(int)
8948 3' is a cast. So, we resort to parsing tentatively. */
8950 /* Types may not be defined in a cast. */
8952 parser->type_definition_forbidden_message
8954 /* Consume the `('. */
8955 matching_parens parens;
8960 /* A very tricky bit is that `(struct S) { 3 }' is a
8961 compound-literal (which we permit in C++ as an extension).
8962 But, that construct is not a cast-expression -- it is a
8963 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8964 is legal; if the compound-literal were a cast-expression,
8965 you'd need an extra set of parentheses.) But, if we parse
8966 the type-id, and it happens to be a class-specifier, then we
8967 will commit to the parse at that point, because we cannot
8968 undo the action that is done when creating a new class. So,
8969 then we cannot back up and do a postfix-expression.
8971 Another tricky case is the following (c++/29234):
8973 struct S { void operator () (); };
8975 void foo ()
8976 {
8977 ( S()() );
8978 }
8980 As a type-id we parse the parenthesized S()() as a function
8981 returning a function, groktypename complains and we cannot
8982 back up in this case either.
8984 Therefore, we scan ahead to the closing `)', and check to see
8985 if the tokens after the `)' can start a cast-expression. Otherwise
8986 we are dealing with an unary-expression, a postfix-expression
8987 or something else.
8989 Yet another tricky case, in C++11, is the following (c++/54891):
8991 (void)[]{};
8993 The issue is that usually, besides the case of lambda-expressions,
8994 the parenthesized type-id cannot be followed by '[', and, eg, we
8995 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8996 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8997 we don't commit, we try a cast-expression, then an unary-expression.
8999 Save tokens so that we can put them back. */
9002 /* We may be looking at a cast-expression. */
9005 cast_expression
9008 /* Roll back the tokens we skipped. */
9010 /* If we aren't looking at a cast-expression, simulate an error so
9011 that the call to cp_parser_error_occurred below returns true. */
9014 else
9015 {
9018 /* Look for the type-id. */
9020 /* Look for the closing `)'. */
9025 }
9027 /* Restore the saved message. */
9030 /* At this point this can only be either a cast or a
9031 parenthesized ctor such as `(T ())' that looks like a cast to
9032 function returning T. */
9034 {
9035 /* Only commit if the cast-expression doesn't start with
9036 '++', '--', or '[' in C++11. */
9044 pidk);
9047 {
9048 /* Warn about old-style casts, if so requested. */
9053 {
9059 }
9061 /* Only type conversions to integral or enumeration types
9062 can be used in constant-expressions. */
9065 NIC_CAST))
9068 /* Perform the cast. */
9069 /* Make a location:
9070 (TYPE) EXPR
9071 ^~~~~~~~~~~
9072 with start==caret at the open paren, extending to the
9073 end of "expr". */
9075 open_paren_loc,
9079 }
9080 }
9081 else
9083 }
9085 /* If we get here, then it's not a cast, so it must be a
9086 unary-expression. */
9089 }
9091 /* Parse a binary expression of the general form:
9093 pm-expression:
9094 cast-expression
9095 pm-expression .* cast-expression
9096 pm-expression ->* cast-expression
9098 multiplicative-expression:
9099 pm-expression
9100 multiplicative-expression * pm-expression
9101 multiplicative-expression / pm-expression
9102 multiplicative-expression % pm-expression
9104 additive-expression:
9105 multiplicative-expression
9106 additive-expression + multiplicative-expression
9107 additive-expression - multiplicative-expression
9109 shift-expression:
9110 additive-expression
9111 shift-expression << additive-expression
9112 shift-expression >> additive-expression
9114 relational-expression:
9115 shift-expression
9116 relational-expression < shift-expression
9117 relational-expression > shift-expression
9118 relational-expression <= shift-expression
9119 relational-expression >= shift-expression
9121 GNU Extension:
9123 relational-expression:
9124 relational-expression <? shift-expression
9125 relational-expression >? shift-expression
9127 equality-expression:
9128 relational-expression
9129 equality-expression == relational-expression
9130 equality-expression != relational-expression
9132 and-expression:
9133 equality-expression
9134 and-expression & equality-expression
9136 exclusive-or-expression:
9137 and-expression
9138 exclusive-or-expression ^ and-expression
9140 inclusive-or-expression:
9141 exclusive-or-expression
9142 inclusive-or-expression | exclusive-or-expression
9144 logical-and-expression:
9145 inclusive-or-expression
9146 logical-and-expression && inclusive-or-expression
9148 logical-or-expression:
9149 logical-and-expression
9150 logical-or-expression || logical-and-expression
9152 All these are implemented with a single function like:
9154 binary-expression:
9155 simple-cast-expression
9156 binary-expression <token> binary-expression
9158 CAST_P is true if this expression is the target of a cast.
9160 The binops_by_token map is used to get the tree codes for each <token> type.
9161 binary-expressions are associated according to a precedence table. */
9163 #define TOKEN_PRECEDENCE(token) \
9164 (((token->type == CPP_GREATER \
9165 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9166 && !parser->greater_than_is_operator_p) \
9167 ? PREC_NOT_OPERATOR \
9168 : binops_by_token[token->type].prec)
9170 static cp_expr
9176 {
9177 cp_parser_expression_stack stack;
9179 cp_parser_expression_stack_entry current;
9180 cp_expr rhs;
9184 tree overload;
9186 /* Parse the first expression. */
9197 {
9198 /* Get an operator token. */
9204 {
9206 "%<>>%> operator is treated"
9210 }
9215 /* This is a fold-expression; handle it later. */
9218 /* Popping an entry off the stack means we completed a subexpression:
9219 - either we found a token which is not an operator (`>' where it is not
9220 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9221 will happen repeatedly;
9222 - or, we found an operator which has lower priority. This is the case
9223 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9224 parsing `3 * 4'. */
9226 {
9229 else
9231 }
9233 get_rhs:
9237 /* We used the operator token. */
9240 /* For "false && x" or "true || x", x will never be executed;
9241 disable warnings while evaluating it. */
9243 c_inhibit_evaluation_warnings +=
9246 c_inhibit_evaluation_warnings +=
9249 /* Extract another operand. It may be the RHS of this expression
9250 or the LHS of a new, higher priority expression. */
9255 /* Get another operator token. Look up its precedence to avoid
9256 building a useless (immediately popped) stack entry for common
9257 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9264 {
9265 /* ... and prepare to parse the RHS of the new, higher priority
9266 expression. Since precedence levels on the stack are
9267 monotonically increasing, we do not have to care about
9268 stack overflows. */
9277 pop:
9279 /* If the stack is not empty, we have parsed into LHS the right side
9280 (`4' in the example above) of an expression we had suspended.
9281 We can use the information on the stack to recover the LHS (`3')
9282 from the stack together with the tree code (`MULT_EXPR'), and
9283 the precedence of the higher level subexpression
9284 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9285 which will be used to actually build the additive expression. */
9290 }
9292 /* Undo the disabling of warnings done above. */
9294 c_inhibit_evaluation_warnings -=
9297 c_inhibit_evaluation_warnings -=
9303 /* Avoid warning for !!x == y. */
9308 /* Avoid warning for !b == y where b is boolean. */
9312 /* Avoid warning for !!b == y where b is boolean. */
9325 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9326 ERROR_MARK for everything that is not a binary expression.
9327 This makes warn_about_parentheses miss some warnings that
9328 involve unary operators. For unary expressions we should
9329 pass the correct tree_code unless the unary expression was
9330 surrounded by parentheses.
9331 */
9335 {
9338 else
9339 {
9340 current.lhs
9343 == tcc_comparison
9347 }
9348 }
9349 else
9350 {
9355 /* TODO: build_x_binary_op doesn't always honor the location. */
9357 }
9360 /* If the binary operator required the use of an overloaded operator,
9361 then this expression cannot be an integral constant-expression.
9362 An overloaded operator can be used even if both operands are
9363 otherwise permissible in an integral constant-expression if at
9364 least one of the operands is of enumeration type. */
9368 NIC_OVERLOADED))
9370 }
9373 }
9375 static cp_expr
9380 {
9383 }
9385 /* Parse the `? expression : assignment-expression' part of a
9386 conditional-expression. The LOGICAL_OR_EXPR is the
9387 logical-or-expression that started the conditional-expression.
9388 Returns a representation of the entire conditional-expression.
9390 This routine is used by cp_parser_assignment_expression.
9392 ? expression : assignment-expression
9394 GNU Extensions:
9396 ? : assignment-expression */
9398 static tree
9400 {
9402 cp_expr assignment_expr;
9406 /* Consume the `?' token. */
9411 {
9414 /* Implicit true clause. */
9416 c_inhibit_evaluation_warnings +=
9419 }
9420 else
9421 {
9424 /* Parse the expression. */
9425 c_inhibit_evaluation_warnings +=
9428 c_inhibit_evaluation_warnings +=
9432 }
9434 /* The next token should be a `:'. */
9436 /* Parse the assignment-expression. */
9438 c_inhibit_evaluation_warnings -=
9441 /* Make a location:
9442 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9443 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9444 with the caret at the "?", ranging from the start of
9445 the logical_or_expr to the end of the assignment_expr. */
9450 /* Build the conditional-expression. */
9452 expr,
9453 assignment_expr,
9454 tf_warning_or_error);
9455 }
9457 /* Parse an assignment-expression.
9459 assignment-expression:
9460 conditional-expression
9461 logical-or-expression assignment-operator assignment_expression
9462 throw-expression
9464 CAST_P is true if this expression is the target of a cast.
9465 DECLTYPE_P is true if this expression is the operand of decltype.
9467 Returns a representation for the expression. */
9469 static cp_expr
9472 {
9473 cp_expr expr;
9475 /* If the next token is the `throw' keyword, then we're looking at
9476 a throw-expression. */
9479 /* Otherwise, it must be that we are looking at a
9480 logical-or-expression. */
9481 else
9482 {
9483 /* Parse the binary expressions (logical-or-expression). */
9485 decltype_p,
9487 /* If the next token is a `?' then we're actually looking at a
9488 conditional-expression. */
9491 else
9492 {
9495 /* If it's an assignment-operator, we're using the second
9496 production. */
9497 enum tree_code assignment_operator
9500 {
9503 /* Parse the right-hand side of the assignment. */
9510 /* An assignment may not appear in a
9511 constant-expression. */
9513 NIC_ASSIGNMENT))
9515 /* Build the assignment expression. Its default
9516 location:
9517 LHS = RHS
9518 ~~~~^~~~~
9519 is the location of the '=' token as the
9520 caret, ranging from the start of the lhs to the
9521 end of the rhs. */
9526 assignment_operator,
9527 rhs,
9529 /* TODO: build_x_modify_expr doesn't honor the location,
9530 so we must set it here. */
9532 }
9533 }
9534 }
9537 }
9539 /* Parse an (optional) assignment-operator.
9541 assignment-operator: one of
9542 = *= /= %= += -= >>= <<= &= ^= |=
9544 GNU Extension:
9546 assignment-operator: one of
9547 <?= >?=
9549 If the next token is an assignment operator, the corresponding tree
9550 code is returned, and the token is consumed. For example, for
9551 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9552 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9553 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9554 operator, ERROR_MARK is returned. */
9556 static enum tree_code
9558 {
9562 /* Peek at the next token. */
9566 {
9612 /* Nothing else is an assignment operator. */
9614 }
9616 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9621 /* If it was an assignment operator, consume it. */
9626 }
9628 /* Parse an expression.
9630 expression:
9631 assignment-expression
9632 expression , assignment-expression
9634 CAST_P is true if this expression is the target of a cast.
9635 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9636 except possibly parenthesized or on the RHS of a comma (N3276).
9638 Returns a representation of the expression. */
9640 static cp_expr
9643 {
9648 {
9649 cp_expr assignment_expression;
9651 /* Parse the next assignment-expression. */
9652 assignment_expression
9655 /* We don't create a temporary for a call that is the immediate operand
9656 of decltype or on the RHS of a comma. But when we see a comma, we
9657 need to create a temporary for a call on the LHS. */
9662 assignment_expression
9666 /* If this is the first assignment-expression, we can just
9667 save it away. */
9670 else
9671 {
9672 /* Create a location with caret at the comma, ranging
9673 from the start of the LHS to the end of the RHS. */
9678 assignment_expression,
9681 }
9682 /* If the next token is not a comma, or we're in a fold-expression, then
9683 we are done with the expression. */
9687 /* Consume the `,'. */
9690 /* A comma operator cannot appear in a constant-expression. */
9693 }
9696 }
9698 /* Parse a constant-expression.
9700 constant-expression:
9701 conditional-expression
9703 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9704 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9705 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9706 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9707 only parse a conditional-expression, otherwise parse an
9708 assignment-expression. See below for rationale. */
9710 static cp_expr
9715 {
9719 cp_expr expression;
9721 /* It might seem that we could simply parse the
9722 conditional-expression, and then check to see if it were
9723 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9724 one that the compiler can figure out is constant, possibly after
9725 doing some simplifications or optimizations. The standard has a
9726 precise definition of constant-expression, and we must honor
9727 that, even though it is somewhat more restrictive.
9729 For example:
9731 int i[(2, 3)];
9733 is not a legal declaration, because `(2, 3)' is not a
9734 constant-expression. The `,' operator is forbidden in a
9735 constant-expression. However, GCC's constant-folding machinery
9736 will fold this operation to an INTEGER_CST for `3'. */
9738 /* Save the old settings. */
9740 saved_allow_non_integral_constant_expression_p
9743 /* We are now parsing a constant-expression. */
9745 parser->allow_non_integral_constant_expression_p
9748 /* Although the grammar says "conditional-expression", when not STRICT_P,
9749 we parse an "assignment-expression", which also permits
9750 "throw-expression" and the use of assignment operators. In the case
9751 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9752 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9753 actually essential that we look for an assignment-expression.
9754 For example, cp_parser_initializer_clauses uses this function to
9755 determine whether a particular assignment-expression is in fact
9756 constant. */
9758 {
9759 /* Parse the binary expressions (logical-or-expression). */
9762 /* If the next token is a `?' then we're actually looking at
9763 a conditional-expression; otherwise we're done. */
9766 }
9767 else
9769 /* Restore the old settings. */
9770 parser->integral_constant_expression_p
9772 parser->allow_non_integral_constant_expression_p
9775 {
9776 /* Require an rvalue constant expression here; that's what our
9777 callers expect. Reference constant expressions are handled
9778 separately in e.g. cp_parser_template_argument. */
9787 }
9790 parser->non_integral_constant_expression_p
9794 }
9796 /* Parse __builtin_offsetof.
9798 offsetof-expression:
9799 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9801 offsetof-member-designator:
9802 id-expression
9803 | offsetof-member-designator "." id-expression
9804 | offsetof-member-designator "[" expression "]"
9805 | offsetof-member-designator "->" id-expression */
9807 static cp_expr
9809 {
9811 tree type;
9812 cp_expr expr;
9813 cp_id_kind dummy;
9815 location_t finish_loc;
9817 /* We're about to accept non-integral-constant things, but will
9818 definitely yield an integral constant expression. Save and
9819 restore these values around our local parsing. */
9825 /* Consume the "__builtin_offsetof" token. */
9827 /* Consume the opening `('. */
9828 matching_parens parens;
9830 /* Parse the type-id. */
9833 /* Look for the `,'. */
9837 /* Build the (type *)null that begins the traditional offsetof macro. */
9838 tree object_ptr
9840 tf_warning_or_error);
9842 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9846 {
9849 {
9851 /* offsetof-member-designator "[" expression "]" */
9857 /* offsetof-member-designator "->" identifier */
9860 /* FALLTHRU */
9863 /* offsetof-member-designator "." identifier */
9871 /* Consume the ")" token. */
9877 /* Error. We know the following require will fail, but
9878 that gives the proper error message. */
9883 }
9884 }
9886 success:
9887 /* Make a location of the form:
9888 __builtin_offsetof (struct s, f)
9889 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9890 with caret at the type-id, ranging from the start of the
9891 "_builtin_offsetof" token to the close paren. */
9893 /* The result will be an INTEGER_CST, so we need to explicitly
9894 preserve the location. */
9897 failure:
9903 }
9905 /* Parse a trait expression.
9907 Returns a representation of the expression, the underlying type
9908 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9910 static cp_expr
9912 {
9913 cp_trait_kind kind;
9919 {
10021 }
10023 /* Get location of initial token. */
10026 /* Consume the token. */
10029 matching_parens parens;
10032 {
10035 }
10041 {
10044 {
10047 }
10051 }
10053 {
10055 {
10059 {
10062 }
10066 }
10067 }
10072 /* Construct a location of the form:
10073 __is_trivially_copyable(_Tp)
10074 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10075 with start == caret, finishing at the close-paren. */
10078 /* Complete the trait expression, which may mean either processing
10079 the trait expr now or saving it for template instantiation. */
10081 {
10090 }
10091 }
10093 /* Parse a lambda expression.
10095 lambda-expression:
10096 lambda-introducer lambda-declarator [opt] compound-statement
10098 Returns a representation of the expression. */
10100 static cp_expr
10102 {
10104 tree type;
10112 {
10114 {
10118 }
10120 }
10122 {
10124 {
10127 }
10129 }
10131 /* We may be in the middle of deferred access check. Disable
10132 it now. */
10143 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10146 /* Now that we've started the type, add the capture fields for any
10147 explicit captures. */
10150 {
10151 /* Inside the class, surrounding template-parameter-lists do not apply. */
10152 unsigned int saved_num_template_parameter_lists
10156 bool fully_implicit_function_template_p
10160 bool auto_is_implicit_function_template_parm_p
10171 /* By virtue of defining a local class, a lambda expression has access to
10172 the private variables of enclosing classes. */
10180 {
10185 }
10187 {
10190 }
10192 /* The capture list was built up in reverse order; fix that now. */
10204 parser->fully_implicit_function_template_p
10208 parser->auto_is_implicit_function_template_parm_p
10210 }
10212 /* This field is only used during parsing of the lambda. */
10215 /* This lambda shouldn't have any proxies left at this point. */
10217 /* And now that we're done, push proxies for an enclosing lambda. */
10222 else
10230 }
10232 /* Parse the beginning of a lambda expression.
10234 lambda-introducer:
10235 [ lambda-capture [opt] ]
10237 LAMBDA_EXPR is the current representation of the lambda expression. */
10239 static void
10241 {
10242 /* Need commas after the first capture. */
10245 /* Eat the leading `['. */
10248 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10256 {
10259 }
10262 {
10264 tree capture_id;
10265 tree capture_init_expr;
10269 enum capture_kind_type
10270 {
10271 BY_COPY,
10272 BY_REFERENCE
10273 };
10277 {
10280 }
10284 else
10287 /* Possibly capture `this'. */
10289 {
10300 explicit_init_p);
10302 }
10304 /* Possibly capture `*this'. */
10307 {
10318 explicit_init_p);
10320 }
10322 /* Remember whether we want to capture as a reference or not. */
10324 {
10327 }
10329 /* Get the identifier. */
10334 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10335 delimiters, but I modified this to stop on unnested ']' as well. It
10336 was already changed to stop on unnested '}', so the
10337 "closing_parenthesis" name is no more misleading with my change. */
10338 {
10344 }
10346 /* Find the initializer for this capture. */
10350 {
10352 /* An explicit initializer exists. */
10355 "lambda capture initializers "
10361 {
10364 }
10365 }
10366 else
10367 {
10370 /* Turn the identifier into an id-expression. */
10371 capture_init_expr
10376 {
10379 }
10383 {
10386 capture_init_expr);
10390 }
10393 {
10396 capture_init_expr))
10400 }
10402 capture_init_expr
10403 = finish_id_expression
10405 capture_init_expr,
10419 {
10422 }
10423 }
10427 {
10432 capture_id);
10436 "capture of %qD redundant with by-reference capture "
10438 }
10441 capture_id,
10442 capture_init_expr,
10444 explicit_init_p);
10446 /* If there is any qualification still in effect, clear it
10447 now; we will be starting fresh with the next capture. */
10451 }
10454 }
10456 /* Parse the (optional) middle of a lambda expression.
10458 lambda-declarator:
10459 < template-parameter-list [opt] >
10460 ( parameter-declaration-clause [opt] )
10461 attribute-specifier [opt]
10462 decl-specifier-seq [opt]
10463 exception-specification [opt]
10464 lambda-return-type-clause [opt]
10466 LAMBDA_EXPR is the current representation of the lambda expression. */
10468 static bool
10470 {
10471 /* 5.1.1.4 of the standard says:
10472 If a lambda-expression does not include a lambda-declarator, it is as if
10473 the lambda-declarator were ().
10474 This means an empty parameter list, no attributes, and no exception
10475 specification. */
10482 cp_decl_specifier_seq lambda_specs;
10485 /* The template-parameter-list is optional, but must begin with
10486 an opening angle if present. */
10488 {
10491 "lambda templates are only available with "
10495 "lambda templates are only available with "
10504 /* We just processed one more parameter list. */
10506 }
10508 /* The parameter-declaration-clause is optional (unless
10509 template-parameter-list was given), but must begin with an
10510 opening parenthesis if present. */
10512 {
10513 matching_parens parens;
10518 /* Parse parameters. */
10521 /* Default arguments shall not be specified in the
10522 parameter-declaration-clause of a lambda-declarator. */
10533 /* In the decl-specifier-seq of the lambda-declarator, each
10534 decl-specifier shall either be mutable or constexpr. */
10538 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10541 {
10546 }
10550 /* Parse optional exception specification. */
10553 /* Parse optional trailing return type. */
10555 {
10558 }
10560 /* The function parameters must be in scope all the way until after the
10561 trailing-return-type in case of decltype. */
10563 }
10567 /* Create the function call operator.
10569 Messing with declarators like this is no uglier than building up the
10570 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10571 other code. */
10572 {
10573 cp_decl_specifier_seq return_type_specs;
10575 tree fco;
10582 else
10583 /* Maybe we will deduce the return type later. */
10587 {
10591 else
10594 }
10603 VIRT_SPEC_UNSPECIFIED,
10604 REF_QUAL_NONE,
10605 tx_qual,
10606 exception_spec,
10612 declarator,
10613 attributes);
10615 {
10618 /* Give the object parameter a different name. */
10622 }
10624 {
10628 }
10637 }
10638 }
10640 /* Parse the body of a lambda expression, which is simply
10642 compound-statement
10644 but which requires special handling.
10645 LAMBDA_EXPR is the current representation of the lambda expression. */
10647 static void
10649 {
10656 else
10657 /* Still increment function_depth so that we don't GC in the
10658 middle of an expression. */
10663 /* Clear this in case we're in the middle of a default argument. */
10667 {
10671 matching_braces braces;
10674 {
10677 /* Originally C++11 required us to peek for 'return expr'; and
10678 process it specially here to deduce the return type. N3638
10679 removed the need for that. */
10687 }
10690 }
10697 else
10699 }
10701 /* Statements [gram.stmt.stmt] */
10703 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10705 static void
10707 {
10711 /* A concept is never expanded normally. */
10717 }
10719 /* Parse a statement.
10721 statement:
10722 labeled-statement
10723 expression-statement
10724 compound-statement
10725 selection-statement
10726 iteration-statement
10727 jump-statement
10728 declaration-statement
10729 try-block
10731 C++11:
10733 statement:
10734 labeled-statement
10735 attribute-specifier-seq (opt) expression-statement
10736 attribute-specifier-seq (opt) compound-statement
10737 attribute-specifier-seq (opt) selection-statement
10738 attribute-specifier-seq (opt) iteration-statement
10739 attribute-specifier-seq (opt) jump-statement
10740 declaration-statement
10741 attribute-specifier-seq (opt) try-block
10743 init-statement:
10744 expression-statement
10745 simple-declaration
10747 TM Extension:
10749 statement:
10750 atomic-statement
10752 IN_COMPOUND is true when the statement is nested inside a
10753 cp_parser_compound_statement; this matters for certain pragmas.
10755 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10756 is a (possibly labeled) if statement which is not enclosed in braces
10757 and has an else clause. This is used to implement -Wparentheses.
10759 CHAIN is a vector of if-else-if conditions. */
10761 static void
10765 {
10770 restart:
10773 /* There is no statement yet. */
10779 /* In obj-c++, seeing '[[' might be the either the beginning of
10780 c++11 attributes, or a nested objc-message-expression. So
10781 let's parse the c++11 attributes tentatively. */
10785 {
10788 }
10790 /* Peek at the next token. */
10792 /* Remember the location of the first token in the statement. */
10795 /* If this is a keyword, then that will often determine what kind of
10796 statement we have. */
10798 {
10802 {
10805 /* Looks like a labeled-statement with a case label.
10806 Parse the label, and then use tail recursion to parse
10807 the statement. */
10830 /* Objective-C++ exception-handling constructs. */
10844 /* This must be a namespace alias definition. */
10860 /* It might be a keyword like `int' that can start a
10861 declaration-statement. */
10863 }
10864 }
10866 {
10867 /* If the next token is a `:', then we are looking at a
10868 labeled-statement. */
10871 {
10872 /* Looks like a labeled-statement with an ordinary label.
10873 Parse the label, and then use tail recursion to parse
10874 the statement. */
10879 }
10880 }
10881 /* Anything that starts with a `{' must be a compound-statement. */
10884 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10885 a statement all its own. */
10887 {
10888 /* Only certain OpenMP pragmas are attached to statements, and thus
10889 are considered statements themselves. All others are not. In
10890 the context of a compound, accept the pragma as a "statement" and
10891 return so that we can check for a close brace. Otherwise we
10892 require a real statement and must go back and read one. */
10898 }
10900 {
10903 }
10905 /* Everything else must be a declaration-statement or an
10906 expression-statement. Try for the declaration-statement
10907 first, unless we are looking at a `;', in which case we know that
10908 we have an expression-statement. */
10910 {
10912 {
10914 {
10915 /* Attributes should be parsed as part of the the
10916 declaration, so let's un-parse them. */
10919 }
10922 /* Try to parse the declaration-statement. */
10924 /* If that worked, we're done. */
10927 }
10928 /* All preceding labels have been parsed at this point. */
10932 /* Look for an expression-statement instead. */
10935 /* Handle [[fallthrough]];. */
10937 {
10938 /* The next token after the fallthrough attribute is ';'. */
10940 {
10941 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10943 IFN_FALLTHROUGH,
10946 }
10947 else
10951 }
10952 }
10954 /* Set the line number for the statement. */
10958 /* Allow "[[fallthrough]];", but warn otherwise. */
10961 OPT_Wattributes,
10963 }
10965 /* Append ATTR to attribute list ATTRS. */
10967 static tree
10969 {
10975 }
10977 /* Parse the label for a labeled-statement, i.e.
10979 identifier :
10980 case constant-expression :
10981 default :
10983 GNU Extension:
10984 case constant-expression ... constant-expression : statement
10986 When a label is parsed without errors, the label is added to the
10987 parse tree by the finish_* functions, so this function doesn't
10988 have to return the label. */
10990 static void
10992 {
10997 /* The next token should be an identifier. */
11001 {
11004 }
11006 /* Remember whether this case or a user-defined label is allowed to fall
11007 through to. */
11012 {
11014 {
11018 /* Consume the `case' token. */
11020 /* Parse the constant-expression. */
11027 {
11028 /* Consume the `...' token. */
11034 /* We don't need to emit warnings here, as the common code
11035 will do this for us. */
11036 }
11037 else
11041 {
11045 }
11046 else
11049 expr);
11050 }
11054 /* Consume the `default' token. */
11058 {
11062 }
11063 else
11068 /* Anything else must be an ordinary label. */
11073 }
11075 /* Require the `:' token. */
11078 /* An ordinary label may optionally be followed by attributes.
11079 However, this is only permitted if the attributes are then
11080 followed by a semicolon. This is because, for backward
11081 compatibility, when parsing
11082 lab: __attribute__ ((unused)) int i;
11083 we want the attribute to attach to "i", not "lab". */
11086 {
11087 tree attrs;
11094 ;
11095 else
11097 }
11103 }
11105 /* Parse an expression-statement.
11107 expression-statement:
11108 expression [opt] ;
11110 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11111 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11112 indicates whether this expression-statement is part of an
11113 expression statement. */
11115 static tree
11117 {
11122 /* There might be attribute fallthrough. */
11125 /* If the next token is a ';', then there is no expression
11126 statement. */
11128 {
11132 {
11135 }
11136 }
11138 /* Handle [[fallthrough]];. */
11140 {
11141 /* The next token after the fallthrough attribute is ';'. */
11143 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11146 else
11150 }
11152 /* Allow "[[fallthrough]];", but warn otherwise. */
11157 /* Give a helpful message for "A<T>::type t;" and the like. */
11160 {
11167 {
11168 /* A::A a; */
11173 }
11174 }
11176 /* Consume the final `;'. */
11181 /* This is the final expression statement of a statement
11182 expression. */
11188 }
11190 /* Parse a compound-statement.
11192 compound-statement:
11193 { statement-seq [opt] }
11195 GNU extension:
11197 compound-statement:
11198 { label-declaration-seq [opt] statement-seq [opt] }
11200 label-declaration-seq:
11201 label-declaration
11202 label-declaration-seq label-declaration
11204 Returns a tree representing the statement. */
11206 static tree
11209 {
11210 tree compound_stmt;
11211 matching_braces braces;
11213 /* Consume the `{'. */
11220 /* Begin the compound-statement. */
11222 /* If the next keyword is `__label__' we have a label declaration. */
11225 /* Parse an (optional) statement-seq. */
11227 /* Finish the compound-statement. */
11229 /* Consume the `}'. */
11233 }
11235 /* Parse an (optional) statement-seq.
11237 statement-seq:
11238 statement
11239 statement-seq [opt] statement */
11241 static void
11243 {
11244 /* Scan statements until there aren't any more. */
11246 {
11249 /* If we are looking at a `}', then we have run out of
11250 statements; the same is true if we have reached the end
11251 of file, or have stumbled upon a stray '@end'. */
11258 /* If we are in a compound statement and find 'else' then
11259 something went wrong. */
11261 {
11264 else
11265 {
11268 }
11269 }
11271 /* Parse the statement. */
11273 }
11274 }
11276 /* Return true if we're looking at (init; cond), false otherwise. */
11278 static bool
11280 {
11281 /* Save tokens so that we can put them back. */
11284 /* Look for ';' that is not nested in () or {}. */
11287 CPP_SEMICOLON,
11290 /* Roll back the tokens we skipped. */
11294 }
11296 /* Parse a selection-statement.
11298 selection-statement:
11299 if ( init-statement [opt] condition ) statement
11300 if ( init-statement [opt] condition ) statement else statement
11301 switch ( init-statement [opt] condition ) statement
11303 Returns the new IF_STMT or SWITCH_STMT.
11305 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11306 is a (possibly labeled) if statement which is not enclosed in
11307 braces and has an else clause. This is used to implement
11308 -Wparentheses.
11310 CHAIN is a vector of if-else-if conditions. This is used to implement
11311 -Wduplicated-cond. */
11313 static tree
11316 {
11319 token_indent_info guard_tinfo;
11324 /* Peek at the next token. */
11328 /* See what kind of keyword it is. */
11331 {
11334 {
11335 tree statement;
11336 tree condition;
11341 RID_CONSTEXPR))
11342 {
11348 }
11350 /* Look for the `('. */
11351 matching_parens parens;
11353 {
11356 }
11358 /* Begin the selection-statement. */
11360 {
11363 }
11364 else
11367 /* Parse the optional init-statement. */
11369 {
11370 tree decl;
11373 "init-statement in selection statements only available "
11376 }
11378 /* Parse the condition. */
11380 /* Look for the `)'. */
11386 {
11390 /* Add the condition. */
11397 /* Parse the then-clause. */
11401 /* Outside a template, the non-selected branch of a constexpr
11402 if is a 'discarded statement', i.e. unevaluated. */
11407 {
11410 }
11413 guard_tinfo);
11420 {
11424 }
11426 /* If the next token is `else', parse the else-clause. */
11428 RID_ELSE))
11429 {
11433 {
11436 }
11438 guard_tinfo
11440 /* Consume the `else' keyword. */
11443 {
11445 RID_IF)
11447 {
11448 /* We've got "if (COND) else if (COND2)". Start
11449 the condition chain and add COND as the first
11450 element. */
11454 {
11455 /* Wrap it in a NOP_EXPR so that we can set the
11456 location of the condition. */
11458 condition);
11461 }
11462 }
11464 RID_IF))
11465 {
11466 /* This is if-else without subsequent if. Zap the
11467 condition chain; we would have already warned at
11468 this point. */
11471 }
11472 }
11474 /* Parse the else-clause. */
11480 /* If we are currently parsing a then-clause, then
11481 IF_P will not be NULL. We set it to true to
11482 indicate that this if statement has an else clause.
11483 This may trigger the Wparentheses warning below
11484 when we get back up to the parent if statement. */
11489 {
11493 }
11494 }
11495 else
11496 {
11497 /* This if statement does not have an else clause. If
11498 NESTED_IF is true, then the then-clause has an if
11499 statement which does have an else clause. We warn
11500 about the potential ambiguity. */
11503 "suggest explicit braces to avoid ambiguous"
11506 {
11507 /* We don't need the condition chain anymore. */
11510 }
11511 }
11513 /* Now we're all done with the if-statement. */
11515 }
11516 else
11517 {
11521 /* Add the condition. */
11524 /* Parse the body of the switch-statement. */
11530 guard_tinfo);
11534 /* Now we're all done with the switch-statement. */
11536 }
11539 }
11545 }
11546 }
11548 /* Parse a condition.
11550 condition:
11551 expression
11552 type-specifier-seq declarator = initializer-clause
11553 type-specifier-seq declarator braced-init-list
11555 GNU Extension:
11557 condition:
11558 type-specifier-seq declarator asm-specification [opt]
11559 attributes [opt] = assignment-expression
11561 Returns the expression that should be tested. */
11563 static tree
11565 {
11566 cp_decl_specifier_seq type_specifiers;
11570 /* Try the declaration first. */
11572 /* New types are not allowed in the type-specifier-seq for a
11573 condition. */
11575 parser->type_definition_forbidden_message
11577 /* Parse the type-specifier-seq. */
11579 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11582 /* Restore the saved message. */
11584 /* If all is well, we might be looking at a declaration. */
11586 {
11587 tree decl;
11588 tree asm_specification;
11589 tree attributes;
11593 /* Parse the declarator. */
11599 /* Parse the attributes. */
11601 /* Parse the asm-specification. */
11603 /* If the next token is not an `=' or '{', then we might still be
11604 looking at an expression. For example:
11606 if (A(a).x)
11608 looks like a decl-specifier-seq and a declarator -- but then
11609 there is no `=', so this is an expression. */
11614 /* If we did see an `=' or '{', then we are looking at a declaration
11615 for sure. */
11617 {
11618 tree pushed_scope;
11622 /* Create the declaration. */
11628 /* Parse the initializer. */
11630 {
11634 }
11635 else
11636 {
11637 /* Consume the `='. */
11640 }
11644 /* Process the initializer. */
11647 asm_specification,
11648 flags);
11654 }
11655 }
11656 /* If we didn't even get past the declarator successfully, we are
11657 definitely not looking at a declaration. */
11658 else
11661 /* Otherwise, we are looking at an expression. */
11663 }
11665 /* Parses a for-statement or range-for-statement until the closing ')',
11666 not included. */
11668 static tree
11670 {
11674 /* Begin the for-statement. */
11677 /* Parse the initialization. */
11682 else
11684 }
11686 static tree
11689 {
11690 /* Normal for loop */
11693 tree stmt;
11696 /* The init-statement has already been parsed in
11697 cp_parser_init_statement, so no work is needed here. */
11700 /* If there's a condition, process it. */
11704 {
11708 }
11710 {
11714 }
11716 /* Look for the `;'. */
11719 /* If there's an expression, process it. */
11725 }
11727 /* Tries to parse a range-based for-statement:
11729 range-based-for:
11730 decl-specifier-seq declarator : expression
11732 The decl-specifier-seq declarator and the `:' are already parsed by
11733 cp_parser_init_statement. If processing_template_decl it returns a
11734 newly created RANGE_FOR_STMT; if not, it is converted to a
11735 regular FOR_STMT. */
11737 static tree
11740 {
11747 /* Get the range declaration momentarily out of the way so that
11748 the range expression doesn't clash with it. */
11750 {
11752 {
11754 /* For decomposition declaration get all of the corresponding
11755 declarations out of the way. */
11759 {
11765 {
11771 }
11772 }
11773 }
11775 {
11780 }
11781 }
11784 {
11787 }
11788 else
11791 /* Put the range declaration(s) back into scope. */
11793 {
11797 }
11799 /* If in template, STMT is converted to a normal for-statement
11800 at instantiation. If not, it is done just ahead. */
11802 {
11812 /* do_auto_deduction doesn't mess with template init-lists. */
11815 }
11816 else
11817 {
11821 unroll);
11822 }
11824 }
11826 /* Subroutine of cp_convert_range_for: given the initializer expression,
11827 builds up the range temporary. */
11829 static tree
11831 {
11834 /* Find out the type deduced by the declaration
11835 `auto &&__range = range_expr'. */
11840 /* Create the __range variable. */
11847 }
11849 /* Used by cp_parser_range_for in template context: we aren't going to
11850 do a full conversion yet, but we still need to resolve auto in the
11851 type of the for-range-declaration if present. This is basically
11852 a shortcut version of cp_convert_range_for. */
11854 static void
11856 {
11859 {
11862 iter_type = (cp_parser_perform_range_for_lookup
11865 {
11867 iter_type);
11869 RO_UNARY_STAR,
11870 tf_warning_or_error);
11873 }
11874 }
11875 }
11877 /* Converts a range-based for-statement into a normal
11878 for-statement, as per the definition.
11880 for (RANGE_DECL : RANGE_EXPR)
11881 BLOCK
11883 should be equivalent to:
11885 {
11886 auto &&__range = RANGE_EXPR;
11887 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11888 __begin != __end;
11889 ++__begin)
11890 {
11891 RANGE_DECL = *__begin;
11892 BLOCK
11893 }
11894 }
11896 If RANGE_EXPR is an array:
11897 BEGIN_EXPR = __range
11898 END_EXPR = __range + ARRAY_SIZE(__range)
11899 Else if RANGE_EXPR has a member 'begin' or 'end':
11900 BEGIN_EXPR = __range.begin()
11901 END_EXPR = __range.end()
11902 Else:
11903 BEGIN_EXPR = begin(__range)
11904 END_EXPR = end(__range);
11906 If __range has a member 'begin' but not 'end', or vice versa, we must
11907 still use the second alternative (it will surely fail, however).
11908 When calling begin()/end() in the third alternative we must use
11909 argument dependent lookup, but always considering 'std' as an associated
11910 namespace. */
11912 tree
11916 {
11924 /* If an error happened previously do nothing or else a lot of
11925 unhelpful errors would be issued. */
11927 else
11928 {
11929 tree range_temp;
11933 /* Can't bind a reference to an array of runtime bound. */
11935 else
11936 {
11941 LOOKUP_ONLYCONVERTING);
11943 }
11946 }
11948 /* The new for initialization statement. */
11956 LOOKUP_ONLYCONVERTING);
11967 LOOKUP_ONLYCONVERTING);
11971 /* The new for condition. */
11978 /* The new increment expression. */
11981 tf_warning_or_error);
11987 /* The declaration is initialized with *__begin inside the loop body. */
11990 tf_warning_or_error),
11992 LOOKUP_ONLYCONVERTING);
11997 }
11999 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12000 We need to solve both at the same time because the method used
12001 depends on the existence of members begin or end.
12002 Returns the type deduced for the iterator expression. */
12004 static tree
12006 {
12008 {
12011 }
12014 {
12019 }
12021 {
12022 /* If RANGE is an array, we will use pointer arithmetic. */
12025 range,
12029 }
12030 else
12031 {
12032 /* If it is not an array, we must do a bit of magic. */
12042 tf_warning_or_error);
12045 tf_warning_or_error);
12048 {
12049 /* Use the member functions. */
12052 else
12058 else
12061 }
12062 else
12063 {
12064 /* Use global functions with ADL. */
12071 tf_warning_or_error);
12073 tf_warning_or_error);
12075 tf_warning_or_error);
12077 tf_warning_or_error);
12080 }
12082 /* Last common checks. */
12084 {
12085 /* If one of the expressions is an error do no more checks. */
12088 }
12091 /* Can happen, when, eg, in a template context, Koenig lookup
12092 can't resolve begin/end (c++/58503). */
12094 else
12095 {
12097 /* The unqualified type of the __begin and __end temporaries should
12098 be the same, as required by the multiple auto declaration. */
12100 {
12107 /* P0184R0 allows __begin and __end to have different types,
12108 but make sure they are comparable so we can give a better
12110 else
12114 }
12116 }
12117 }
12118 }
12120 /* Helper function for cp_parser_perform_range_for_lookup.
12121 Builds a tree for RANGE.IDENTIFIER(). */
12123 static tree
12125 {
12138 tf_warning_or_error);
12141 }
12143 /* Parse an iteration-statement.
12145 iteration-statement:
12146 while ( condition ) statement
12147 do statement while ( expression ) ;
12148 for ( init-statement condition [opt] ; expression [opt] )
12149 statement
12151 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12153 static tree
12156 {
12159 tree statement;
12161 token_indent_info guard_tinfo;
12163 /* Peek at the next token. */
12170 /* Remember whether or not we are already within an iteration
12171 statement. */
12174 /* See what kind of keyword it is. */
12177 {
12179 {
12180 tree condition;
12182 /* Begin the while-statement. */
12184 /* Look for the `('. */
12185 matching_parens parens;
12187 /* Parse the condition. */
12190 /* Look for the `)'. */
12192 /* Parse the dependent statement. */
12198 /* We're done with the while-statement. */
12200 }
12204 {
12205 tree expression;
12207 /* Begin the do-statement. */
12209 /* Parse the body of the do-statement. */
12216 /* Look for the `while' keyword. */
12218 /* Look for the `('. */
12219 matching_parens parens;
12221 /* Parse the expression. */
12223 /* We're done with the do-statement. */
12225 /* Look for the `)'. */
12227 /* Look for the `;'. */
12229 }
12233 {
12234 /* Look for the `('. */
12235 matching_parens parens;
12240 /* Look for the `)'. */
12243 /* Parse the body of the for-statement. */
12250 /* We're done with the for-statement. */
12252 }
12259 }
12262 }
12264 /* Parse a init-statement or the declarator of a range-based-for.
12265 Returns true if a range-based-for declaration is seen.
12267 init-statement:
12268 expression-statement
12269 simple-declaration */
12271 static bool
12273 {
12274 /* If the next token is a `;', then we have an empty
12275 expression-statement. Grammatically, this is also a
12276 simple-declaration, but an invalid one, because it does not
12277 declare anything. Therefore, if we did not handle this case
12278 specially, we would issue an error message about an invalid
12279 declaration. */
12281 {
12285 /* A colon is used in range-based for. */
12288 /* We're going to speculatively look for a declaration, falling back
12289 to an expression, if necessary. */
12291 /* Parse the declaration. */
12294 decl);
12297 {
12298 /* It is a range-for, consume the ':' */
12302 {
12304 "range-based %<for%> loops only available with "
12307 }
12308 }
12309 else
12310 /* The ';' is not consumed yet because we told
12311 cp_parser_simple_declaration not to. */
12316 /* If the tentative parse failed, then we shall need to look for an
12317 expression-statement. */
12318 }
12319 /* If we are here, it is an expression-statement. */
12322 }
12324 /* Parse a jump-statement.
12326 jump-statement:
12327 break ;
12328 continue ;
12329 return expression [opt] ;
12330 return braced-init-list ;
12331 goto identifier ;
12333 GNU extension:
12335 jump-statement:
12336 goto * expression ;
12338 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12340 static tree
12342 {
12348 /* Peek at the next token. */
12353 /* See what kind of keyword it is. */
12356 {
12360 {
12377 }
12383 {
12387 /* Fall through. */
12397 }
12402 {
12403 tree expr;
12407 {
12411 }
12414 else
12415 /* If the next token is a `;', then there is no
12416 expression. */
12418 /* Build the return-statement. */
12421 else
12423 /* Look for the final `;'. */
12425 }
12431 {
12434 }
12436 /* Create the goto-statement. */
12438 {
12439 /* Issue a warning about this use of a GNU extension. */
12441 /* Consume the '*' token. */
12443 /* Parse the dependent expression. */
12445 }
12446 else
12448 /* Look for the final `;'. */
12455 }
12458 }
12460 /* Parse a declaration-statement.
12462 declaration-statement:
12463 block-declaration */
12465 static void
12467 {
12470 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12473 /* Parse the block-declaration. */
12476 /* Free any declarators allocated. */
12478 }
12480 /* Some dependent statements (like `if (cond) statement'), are
12481 implicitly in their own scope. In other words, if the statement is
12482 a single statement (as opposed to a compound-statement), it is
12483 none-the-less treated as if it were enclosed in braces. Any
12484 declarations appearing in the dependent statement are out of scope
12485 after control passes that point. This function parses a statement,
12486 but ensures that is in its own scope, even if it is not a
12487 compound-statement.
12489 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12490 is a (possibly labeled) if statement which is not enclosed in
12491 braces and has an else clause. This is used to implement
12492 -Wparentheses.
12494 CHAIN is a vector of if-else-if conditions. This is used to implement
12495 -Wduplicated-cond.
12497 Returns the new statement. */
12499 static tree
12503 {
12504 tree statement;
12507 token_indent_info body_tinfo
12513 /* Mark if () ; with a special NOP_EXPR. */
12515 {
12526 }
12527 /* if a compound is opened, we simply parse the statement directly. */
12530 /* If the token is not a `{', then we must take special action. */
12531 else
12532 {
12533 /* Create a compound-statement. */
12535 /* Parse the dependent-statement. */
12538 /* Finish the dummy compound-statement. */
12540 }
12542 token_indent_info next_tinfo
12551 /* Return the statement. */
12553 }
12555 /* For some dependent statements (like `while (cond) statement'), we
12556 have already created a scope. Therefore, even if the dependent
12557 statement is a compound-statement, we do not want to create another
12558 scope. */
12560 static void
12563 {
12564 /* If the token is a `{', then we must take special action. */
12566 {
12567 token_indent_info body_tinfo
12573 token_indent_info next_tinfo
12582 }
12583 else
12584 {
12585 /* Avoid calling cp_parser_compound_statement, so that we
12586 don't create a new scope. Do everything else by hand. */
12587 matching_braces braces;
12589 /* If the next keyword is `__label__' we have a label declaration. */
12592 /* Parse an (optional) statement-seq. */
12595 }
12596 }
12598 /* Declarations [gram.dcl.dcl] */
12600 /* Parse an optional declaration-sequence.
12602 declaration-seq:
12603 declaration
12604 declaration-seq declaration */
12606 static void
12608 {
12610 {
12621 {
12622 /* A declaration consisting of a single semicolon is
12623 invalid. Allow it unless we're being pedantic. */
12628 }
12630 /* If we're entering or exiting a region that's implicitly
12631 extern "C", modify the lang context appropriately. */
12633 {
12636 }
12638 {
12641 }
12644 {
12645 /* A top-level declaration can consist solely of a #pragma.
12646 A nested declaration cannot, so this is done here and not
12647 in cp_parser_declaration. (A #pragma at block scope is
12648 handled in cp_parser_statement.) */
12651 }
12653 /* Parse the declaration itself. */
12655 }
12656 }
12658 /* Parse a declaration.
12660 declaration:
12661 block-declaration
12662 function-definition
12663 template-declaration
12664 explicit-instantiation
12665 explicit-specialization
12666 linkage-specification
12667 namespace-definition
12669 C++17:
12670 deduction-guide
12672 GNU extension:
12674 declaration:
12675 __extension__ declaration */
12677 static void
12679 {
12680 cp_token token1;
12681 cp_token token2;
12686 /* Check for the `__extension__' keyword. */
12688 {
12689 /* Parse the qualified declaration. */
12691 /* Restore the PEDANTIC flag. */
12695 }
12697 /* Try to figure out what kind of declaration is present. */
12702 else
12703 {
12706 }
12708 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12711 /* If the next token is `extern' and the following token is a string
12712 literal, then we have a linkage specification. */
12716 /* If the next token is `template', then we have either a template
12717 declaration, an explicit instantiation, or an explicit
12718 specialization. */
12720 {
12721 /* `template <>' indicates a template specialization. */
12725 /* `template <' indicates a template declaration. */
12728 /* Anything else must be an explicit instantiation. */
12729 else
12731 }
12732 /* If the next token is `export', then we have a template
12733 declaration. */
12736 /* If the next token is `extern', 'static' or 'inline' and the one
12737 after that is `template', we have a GNU extended explicit
12738 instantiation directive. */
12745 /* If the next token is `namespace', check for a named or unnamed
12746 namespace definition. */
12755 /* An unnamed namespace definition. */
12759 /* An inline (associated) namespace definition. */
12763 /* Objective-C++ declaration/definition. */
12770 /* At this point we may have a template declared by a concept
12771 introduction. */
12776 else
12777 /* Try to parse a block-declaration, or a function-definition. */
12780 /* Free any declarators allocated. */
12782 }
12784 /* Parse a block-declaration.
12786 block-declaration:
12787 simple-declaration
12788 asm-definition
12789 namespace-alias-definition
12790 using-declaration
12791 using-directive
12793 GNU Extension:
12795 block-declaration:
12796 __extension__ block-declaration
12798 C++0x Extension:
12800 block-declaration:
12801 static_assert-declaration
12803 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12804 part of a declaration-statement. */
12806 static void
12809 {
12813 /* Check for the `__extension__' keyword. */
12815 {
12816 /* Parse the qualified declaration. */
12818 /* Restore the PEDANTIC flag. */
12822 }
12824 /* Peek at the next token to figure out which kind of declaration is
12825 present. */
12828 /* If the next keyword is `asm', we have an asm-definition. */
12830 {
12834 }
12835 /* If the next keyword is `namespace', we have a
12836 namespace-alias-definition. */
12839 /* If the next keyword is `using', we have a
12840 using-declaration, a using-directive, or an alias-declaration. */
12842 {
12847 /* If the token after `using' is `namespace', then we have a
12848 using-directive. */
12852 /* If the second token after 'using' is '=', then we have an
12853 alias-declaration. */
12859 /* Otherwise, it's a using-declaration. */
12860 else
12863 }
12864 /* If the next keyword is `__label__' we have a misplaced label
12865 declaration. */
12867 {
12871 /* If the next token is now a `;', consume it. */
12874 }
12875 /* If the next token is `static_assert' we have a static assertion. */
12878 /* Anything else must be a simple-declaration. */
12879 else
12882 }
12884 /* Parse a simple-declaration.
12886 simple-declaration:
12887 decl-specifier-seq [opt] init-declarator-list [opt] ;
12888 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12889 brace-or-equal-initializer ;
12891 init-declarator-list:
12892 init-declarator
12893 init-declarator-list , init-declarator
12895 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12896 function-definition as a simple-declaration.
12898 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12899 parsed declaration if it is an uninitialized single declarator not followed
12900 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12901 if present, will not be consumed. */
12903 static void
12907 {
12908 cp_decl_specifier_seq decl_specifiers;
12917 /* Defer access checks until we know what is being declared; the
12918 checks for names appearing in the decl-specifier-seq should be
12919 done as if we were in the scope of the thing being declared. */
12922 /* Parse the decl-specifier-seq. We have to keep track of whether
12923 or not the decl-specifier-seq declares a named class or
12924 enumeration type, since that is the only case in which the
12925 init-declarator-list is allowed to be empty.
12927 [dcl.dcl]
12929 In a simple-declaration, the optional init-declarator-list can be
12930 omitted only when declaring a class or enumeration, that is when
12931 the decl-specifier-seq contains either a class-specifier, an
12932 elaborated-type-specifier, or an enum-specifier. */
12934 CP_PARSER_FLAGS_OPTIONAL,
12937 /* We no longer need to defer access checks. */
12940 /* In a block scope, a valid declaration must always have a
12941 decl-specifier-seq. By not trying to parse declarators, we can
12942 resolve the declaration/expression ambiguity more quickly. */
12945 {
12948 }
12950 /* If the next two tokens are both identifiers, the code is
12951 erroneous. The usual cause of this situation is code like:
12953 T t;
12955 where "T" should name a type -- but does not. */
12958 {
12959 /* If parsing tentatively, we should commit; we really are
12960 looking at a declaration. */
12962 /* Give up. */
12964 }
12966 /* If we have seen at least one decl-specifier, and the next token
12967 is not a parenthesis, then we must be looking at a declaration.
12968 (After "int (" we might be looking at a functional cast.) */
12975 /* Look for C++17 decomposition declaration. */
12983 {
12984 tree decl
12986 maybe_range_for_decl,
12989 /* The next token should be either a `,' or a `;'. */
12991 /* If it's a `;', we are done. */
12994 /* Anything else is an error. */
12995 else
12996 {
12997 /* If we have already issued an error message we don't need
12998 to issue another one. */
13003 /* Skip tokens until we reach the end of the statement. */
13005 /* If the next token is now a `;', consume it. */
13009 }
13010 }
13011 else
13014 tree last_type;
13016 /* NULL_TREE if both variable and function declaration are allowed,
13017 error_mark_node if function declaration are not allowed and
13018 a FUNCTION_DECL that should be diagnosed if it is followed by
13019 variable declarations. */
13020 tree auto_function_declaration;
13023 auto_specifier_p
13027 /* Keep going until we hit the `;' at the end of the simple
13028 declaration. */
13031 CPP_SEMICOLON))
13032 {
13035 tree decl;
13039 {
13040 /* If we are processing next declarator, comma is expected */
13045 {
13049 }
13050 }
13051 else
13054 /* Parse the init-declarator. */
13057 function_definition_allowed_p,
13059 declares_class_or_enum,
13061 maybe_range_for_decl,
13064 /* If an error occurred while parsing tentatively, exit quickly.
13065 (That usually happens when in the body of a function; each
13066 statement is treated as a declaration-statement until proven
13067 otherwise.) */
13072 {
13073 /* If the init-declarator-list contains more than one
13074 init-declarator, they shall all form declarations of
13075 variables. */
13077 auto_function_declaration
13081 {
13083 "non-variable %qD in declaration with more than one "
13088 }
13089 }
13093 {
13097 {
13098 /* If the list of declarators contains more than one declarator,
13099 the type of each declared variable is determined as described
13100 above. If the type deduced for the template parameter U is not
13101 the same in each deduction, the program is ill-formed. */
13106 }
13107 else
13109 }
13111 /* Handle function definitions specially. */
13113 {
13114 /* If the next token is a `,', then we are probably
13115 processing something like:
13117 void f() {}, *p;
13119 which is erroneous. */
13121 {
13124 "mixing"
13126 }
13127 /* Otherwise, we're done with the list of declarators. */
13128 else
13129 {
13132 }
13133 }
13136 /* The next token should be either a `,' or a `;'. */
13138 /* If it's a `,', there are more declarators to come. */
13141 /* If it's a `;', we are done. */
13145 {
13150 }
13151 /* Anything else is an error. */
13152 else
13153 {
13154 /* If we have already issued an error message we don't need
13155 to issue another one. */
13160 /* Skip tokens until we reach the end of the statement. */
13162 /* If the next token is now a `;', consume it. */
13166 }
13167 /* After the first time around, a function-definition is not
13168 allowed -- even if it was OK at first. For example:
13170 int i, f() {}
13172 is not valid. */
13174 }
13176 /* Issue an error message if no declarators are present, and the
13177 decl-specifier-seq does not itself declare a class or
13178 enumeration: [dcl.dcl]/3. */
13180 {
13182 {
13186 /* Ensure an error is issued anyway when finish_decltype_type,
13187 called via cp_parser_decl_specifier_seq, returns a class or
13188 an enumeration (c++/51786). */
13191 }
13192 /* Perform any deferred access checks. */
13194 }
13196 /* Consume the `;'. */
13197 finish:
13201 {
13207 }
13209 done:
13211 }
13213 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13214 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13215 initializer ; */
13217 static tree
13222 {
13227 /* Parse the identifier-list. */
13231 {
13239 }
13243 {
13249 else
13250 {
13253 }
13254 }
13260 tree pushed_scope;
13267 NULL_TREE);
13274 cp_expr e;
13275 cp_decl_specifier_seq decl_specs;
13280 {
13283 else
13286 tree elt_pushed_scope;
13292 {
13293 /* Ensure we've diagnosed redeclaration if we aren't creating
13294 a new VAR_DECL. */
13297 }
13298 else
13302 }
13305 {
13308 }
13312 {
13320 || (is_direct_init
13323 {
13327 }
13330 {
13335 }
13336 }
13338 {
13340 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13341 the underlying DECL. */
13343 }
13349 {
13352 }
13355 }
13357 /* Parse a decl-specifier-seq.
13359 decl-specifier-seq:
13360 decl-specifier-seq [opt] decl-specifier
13361 decl-specifier attribute-specifier-seq [opt] (C++11)
13363 decl-specifier:
13364 storage-class-specifier
13365 type-specifier
13366 function-specifier
13367 friend
13368 typedef
13370 GNU Extension:
13372 decl-specifier:
13373 attributes
13375 Concepts Extension:
13377 decl-specifier:
13378 concept
13380 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13382 The parser flags FLAGS is used to control type-specifier parsing.
13384 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13385 flags:
13387 1: one of the decl-specifiers is an elaborated-type-specifier
13388 (i.e., a type declaration)
13389 2: one of the decl-specifiers is an enum-specifier or a
13390 class-specifier (i.e., a type definition)
13392 */
13394 static void
13396 cp_parser_flags flags,
13399 {
13403 cp_decl_spec ds;
13405 /* Clear DECL_SPECS. */
13408 /* Assume no class or enumeration type is declared. */
13411 /* Keep reading specifiers until there are no more to read. */
13413 {
13418 /* Peek at the next token. */
13421 /* Save the first token of the decl spec list for error
13422 reporting. */
13425 /* Handle attributes. */
13427 {
13428 /* Parse the attributes. */
13431 /* In a sequence of declaration specifiers, c++11 attributes
13432 appertain to the type that precede them. In that case
13433 [dcl.spec]/1 says:
13435 The attribute-specifier-seq affects the type only for
13436 the declaration it appears in, not other declarations
13437 involving the same type.
13439 But for now let's force the user to position the
13440 attribute either at the beginning of the declaration or
13441 after the declarator-id, which would clearly mean that it
13442 applies to the declarator. */
13444 {
13446 /* The c++11 attribute is at the beginning of the
13447 declaration. It appertains to the entity being
13449 else
13450 {
13452 {
13453 /* This is an attribute following a
13454 class-specifier. */
13459 }
13460 else
13461 {
13462 decl_specs->std_attributes
13466 }
13468 }
13469 }
13471 decl_specs->attributes
13476 }
13477 /* Assume we will find a decl-specifier keyword. */
13479 /* If the next token is an appropriate keyword, we can simply
13480 add it to the list. */
13482 {
13483 /* decl-specifier:
13484 friend
13485 constexpr */
13488 {
13493 }
13494 else
13495 {
13497 /* Consume the token. */
13499 }
13512 /* function-specifier:
13513 inline
13514 virtual
13515 explicit */
13522 /* decl-specifier:
13523 typedef */
13526 /* Consume the token. */
13528 /* A constructor declarator cannot appear in a typedef. */
13530 /* The "typedef" keyword can only occur in a declaration; we
13531 may as well commit at this point. */
13538 /* storage-class-specifier:
13539 auto
13540 register
13541 static
13542 extern
13543 mutable
13545 GNU Extension:
13546 thread */
13549 {
13550 /* Consume the token. */
13553 /* Complain about `auto' as a storage specifier, if
13554 we're complaining about C++0x compatibility. */
13558 "%<auto%> changes meaning in C++11; "
13561 /* Set the storage class anyway. */
13563 token);
13564 }
13565 else
13566 /* C++0x auto type-specifier. */
13574 /* Consume the token. */
13577 token);
13580 /* Consume the token. */
13586 /* We did not yet find a decl-specifier yet. */
13589 }
13606 /* Constructors are a special case. The `S' in `S()' is not a
13607 decl-specifier; it is the beginning of the declarator. */
13608 constructor_p
13609 = (!found_decl_spec
13610 && constructor_possible_p
13611 && (cp_parser_constructor_declarator_p
13614 /* If we don't have a DECL_SPEC yet, then we must be looking at
13615 a type-specifier. */
13617 {
13620 tree type_spec;
13622 type_spec
13624 decl_specs,
13630 /* If this type-specifier referenced a user-defined type
13631 (a typedef, class-name, etc.), then we can't allow any
13632 more such type-specifiers henceforth.
13634 [dcl.spec]
13636 The longest sequence of decl-specifiers that could
13637 possibly be a type name is taken as the
13638 decl-specifier-seq of a declaration. The sequence shall
13639 be self-consistent as described below.
13641 [dcl.type]
13643 As a general rule, at most one type-specifier is allowed
13644 in the complete decl-specifier-seq of a declaration. The
13645 only exceptions are the following:
13647 -- const or volatile can be combined with any other
13648 type-specifier.
13650 -- signed or unsigned can be combined with char, long,
13651 short, or int.
13653 -- ..
13655 Example:
13657 typedef char* Pc;
13658 void g (const int Pc);
13660 Here, Pc is *not* part of the decl-specifier seq; it's
13661 the declarator. Therefore, once we see a type-specifier
13662 (other than a cv-qualifier), we forbid any additional
13663 user-defined types. We *do* still allow things like `int
13664 int' to be considered a decl-specifier-seq, and issue the
13665 error message later. */
13668 /* A constructor declarator cannot follow a type-specifier. */
13670 {
13675 }
13676 }
13678 /* If we still do not have a DECL_SPEC, then there are no more
13679 decl-specifiers. */
13684 /* After we see one decl-specifier, further decl-specifiers are
13685 always optional. */
13687 }
13689 /* Don't allow a friend specifier with a class definition. */
13694 }
13696 /* Parse an (optional) storage-class-specifier.
13698 storage-class-specifier:
13699 auto
13700 register
13701 static
13702 extern
13703 mutable
13705 GNU Extension:
13707 storage-class-specifier:
13708 thread
13710 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13712 static tree
13714 {
13716 {
13720 /* Fall through for C++98. */
13728 /* Consume the token. */
13733 }
13734 }
13736 /* Parse an (optional) function-specifier.
13738 function-specifier:
13739 inline
13740 virtual
13741 explicit
13743 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13744 Updates DECL_SPECS, if it is non-NULL. */
13746 static tree
13749 {
13752 {
13758 /* 14.5.2.3 [temp.mem]
13760 A member function template shall not be virtual. */
13764 else
13774 }
13776 /* Consume the token. */
13778 }
13780 /* Parse a linkage-specification.
13782 linkage-specification:
13783 extern string-literal { declaration-seq [opt] }
13784 extern string-literal declaration */
13786 static void
13788 {
13789 tree linkage;
13791 /* Look for the `extern' keyword. */
13792 cp_token *extern_token
13795 /* Look for the string-literal. */
13799 /* Transform the literal into an identifier. If the literal is a
13800 wide-character string, or contains embedded NULs, then we can't
13801 handle it as the user wants. */
13804 {
13806 /* Assume C++ linkage. */
13808 }
13809 else
13812 /* We're now using the new linkage. */
13815 /* Preserve the location of the the innermost linkage specification,
13816 tracking the locations of nested specifications via a local. */
13817 location_t saved_location
13819 /* Construct a location ranging from the start of the "extern" to
13820 the end of the string-literal, with the caret at the start, e.g.:
13821 extern "C" {
13822 ^~~~~~~~~~
13823 */
13824 parser->innermost_linkage_specification_location
13829 /* If the next token is a `{', then we're using the first
13830 production. */
13832 {
13836 /* Consume the `{' token. */
13837 matching_braces braces;
13839 /* Parse the declarations. */
13841 /* Look for the closing `}'. */
13843 }
13844 /* Otherwise, there's just one declaration. */
13845 else
13846 {
13849 saved_in_unbraced_linkage_specification_p
13853 parser->in_unbraced_linkage_specification_p
13855 }
13857 /* We're done with the linkage-specification. */
13860 /* Restore location of parent linkage specification, if any. */
13862 }
13864 /* Parse a static_assert-declaration.
13866 static_assert-declaration:
13867 static_assert ( constant-expression , string-literal ) ;
13868 static_assert ( constant-expression ) ; (C++17)
13870 If MEMBER_P, this static_assert is a class member. */
13872 static void
13874 {
13875 cp_expr condition;
13876 location_t token_loc;
13877 tree message;
13880 /* Peek at the `static_assert' token so we can keep track of exactly
13881 where the static assertion started. */
13884 /* Look for the `static_assert' keyword. */
13886 RT_STATIC_ASSERT))
13889 /* We know we are in a static assertion; commit to any tentative
13890 parse. */
13894 /* Parse the `(' starting the static assertion condition. */
13895 matching_parens parens;
13898 /* Parse the constant-expression. Allow a non-constant expression
13899 here in order to give better diagnostics in finish_static_assert. */
13900 condition =
13906 {
13909 "static_assert without a message "
13911 /* Eat the ')' */
13916 }
13917 else
13918 {
13919 /* Parse the separating `,'. */
13922 /* Parse the string-literal message. */
13927 /* A `)' completes the static assertion. */
13933 }
13935 /* A semicolon terminates the declaration. */
13938 /* Get the location for the static assertion. Use that of the
13939 condition if available, otherwise, use that of the "static_assert"
13940 token. */
13945 /* Complete the static assertion, which may mean either processing
13946 the static assert now or saving it for template instantiation. */
13948 }
13950 /* Parse the expression in decltype ( expression ). */
13952 static tree
13955 {
13957 tree expr;
13959 /* Since we're going to preserve any side-effects from this parse, set up a
13960 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13961 in the expression. */
13964 /* First, try parsing an id-expression. */
13975 {
13978 cp_id_kind idk;
13982 /* Lookup the name we got back from the id-expression. */
13987 /* A template without args is not a complete id-expression. */
13996 {
13997 /* Complete lookup of the id-expression. */
13998 expr = (finish_id_expression
14011 /* We found an id-expression, but it was something that we
14012 should not have found. This is an error, not something
14013 we can recover from, so note that we found an
14014 id-expression and we'll recover as gracefully as
14015 possible. */
14017 }
14022 /* We have an id-expression. */
14024 }
14027 {
14028 /* Abort the id-expression parse. */
14031 /* Parsing tentatively, again. */
14034 /* Parse a class member access. */
14042 /* We have an id-expression. */
14044 }
14047 /* We have parsed the complete id-expression or member access. */
14049 else
14050 {
14051 /* Abort our attempt to parse an id-expression or member access
14052 expression. */
14055 /* Commit to the tentative_firewall so we get syntax errors. */
14058 /* Parse a full expression. */
14061 }
14064 }
14066 /* Parse a `decltype' type. Returns the type.
14068 simple-type-specifier:
14069 decltype ( expression )
14070 C++14 proposal:
14071 decltype ( auto ) */
14073 static tree
14075 {
14080 {
14081 /* Already parsed. */
14084 }
14086 /* Look for the `decltype' token. */
14090 /* Parse the opening `('. */
14091 matching_parens parens;
14101 /* decltype (auto) */
14103 else
14104 {
14105 /* decltype (expression) */
14107 /* Types cannot be defined in a `decltype' expression. Save away the
14108 old message and set the new one. */
14110 parser->type_definition_forbidden_message
14113 /* The restrictions on constant-expressions do not apply inside
14114 decltype expressions. */
14115 bool saved_integral_constant_expression_p
14117 bool saved_non_integral_constant_expression_p
14121 /* Within a parenthesized expression, a `>' token is always
14122 the greater-than operator. */
14123 bool saved_greater_than_is_operator_p
14127 /* Do not actually evaluate the expression. */
14130 /* Do not warn about problems with the expression. */
14135 /* Go back to evaluating expressions. */
14139 /* The `>' token might be the end of a template-id or
14140 template-parameter-list now. */
14141 parser->greater_than_is_operator_p
14144 /* Restore the old message and the integral constant expression
14145 flags. */
14147 parser->integral_constant_expression_p
14149 parser->non_integral_constant_expression_p
14151 }
14153 /* Parse to the closing `)'. */
14155 {
14160 }
14163 {
14164 /* Build auto. */
14167 }
14168 else
14170 tf_warning_or_error);
14172 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14173 it again. */
14184 }
14186 /* Special member functions [gram.special] */
14188 /* Parse a conversion-function-id.
14190 conversion-function-id:
14191 operator conversion-type-id
14193 Returns an IDENTIFIER_NODE representing the operator. */
14195 static tree
14197 {
14198 tree type;
14199 tree saved_scope;
14200 tree saved_qualifying_scope;
14201 tree saved_object_scope;
14204 /* Look for the `operator' token. */
14207 /* When we parse the conversion-type-id, the current scope will be
14208 reset. However, we need that information in able to look up the
14209 conversion function later, so we save it here. */
14213 /* We must enter the scope of the class so that the names of
14214 entities declared within the class are available in the
14215 conversion-type-id. For example, consider:
14217 struct S {
14218 typedef int I;
14219 operator I();
14220 };
14222 S::operator I() { ... }
14224 In order to see that `I' is a type-name in the definition, we
14225 must be in the scope of `S'. */
14228 /* Parse the conversion-type-id. */
14230 /* Leave the scope of the class, if any. */
14233 /* Restore the saved scope. */
14237 /* If the TYPE is invalid, indicate failure. */
14241 }
14243 /* Parse a conversion-type-id:
14245 conversion-type-id:
14246 type-specifier-seq conversion-declarator [opt]
14248 Returns the TYPE specified. */
14250 static tree
14252 {
14253 tree attributes;
14254 cp_decl_specifier_seq type_specifiers;
14256 tree type_specified;
14259 /* Parse the attributes. */
14263 parser->type_definition_forbidden_message
14266 /* Parse the type-specifiers. */
14273 /* If that didn't work, stop. */
14276 /* Parse the conversion-declarator. */
14284 /* Don't give this error when parsing tentatively. This happens to
14285 work because we always parse this definitively once. */
14288 {
14290 {
14293 }
14297 }
14300 }
14302 /* Parse an (optional) conversion-declarator.
14304 conversion-declarator:
14305 ptr-operator conversion-declarator [opt]
14307 */
14311 {
14314 cp_cv_quals cv_quals;
14316 /* We don't know if there's a ptr-operator next, or not. */
14318 /* Try the ptr-operator. */
14321 /* If it worked, look for more conversion-declarators. */
14323 {
14326 /* Parse another optional declarator. */
14329 declarator = cp_parser_make_indirect_declarator
14333 }
14336 }
14338 /* Parse an (optional) ctor-initializer.
14340 ctor-initializer:
14341 : mem-initializer-list */
14343 static void
14345 {
14346 /* If the next token is not a `:', then there is no
14347 ctor-initializer. */
14349 {
14350 /* Do default initialization of any bases and members. */
14354 }
14356 /* Consume the `:' token. */
14358 /* And the mem-initializer-list. */
14360 }
14362 /* Parse a mem-initializer-list.
14364 mem-initializer-list:
14365 mem-initializer ... [opt]
14366 mem-initializer ... [opt] , mem-initializer-list */
14368 static void
14370 {
14375 /* Let the semantic analysis code know that we are starting the
14376 mem-initializer-list. */
14381 /* Loop through the list. */
14383 {
14384 tree mem_initializer;
14387 /* Parse the mem-initializer. */
14389 /* If the next token is a `...', we're expanding member initializers. */
14391 {
14392 /* Consume the `...'. */
14395 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14396 can be expanded but members cannot. */
14399 {
14404 }
14406 /* Construct the pack expansion type. */
14409 }
14412 {
14416 }
14417 /* Look for a target constructor. */
14421 {
14424 {
14428 }
14430 }
14431 /* Add it to the list, unless it was erroneous. */
14433 {
14436 }
14437 /* If the next token is not a `,', we're done. */
14440 /* Consume the `,' token. */
14442 }
14444 /* Perform semantic analysis. */
14447 }
14449 /* Parse a mem-initializer.
14451 mem-initializer:
14452 mem-initializer-id ( expression-list [opt] )
14453 mem-initializer-id braced-init-list
14455 GNU extension:
14457 mem-initializer:
14458 ( expression-list [opt] )
14460 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14461 class) or FIELD_DECL (for a non-static data member) to initialize;
14462 the TREE_VALUE is the expression-list. An empty initialization
14463 list is represented by void_list_node. */
14465 static tree
14467 {
14468 tree mem_initializer_id;
14469 tree expression_list;
14470 tree member;
14473 /* Find out what is being initialized. */
14475 {
14479 }
14480 else
14481 {
14485 }
14491 {
14498 }
14499 else
14500 {
14510 }
14520 }
14522 /* Parse a mem-initializer-id.
14524 mem-initializer-id:
14525 :: [opt] nested-name-specifier [opt] class-name
14526 decltype-specifier (C++11)
14527 identifier
14529 Returns a TYPE indicating the class to be initialized for the first
14530 production (and the second in C++11). Returns an IDENTIFIER_NODE
14531 indicating the data member to be initialized for the last production. */
14533 static tree
14535 {
14539 tree id;
14543 /* `typename' is not allowed in this context ([temp.res]). */
14545 {
14547 "keyword %<typename%> not allowed in this context (a qualified "
14550 }
14551 /* Look for the optional `::' operator. */
14552 global_scope_p
14556 /* Look for the optional nested-name-specifier. The simplest way to
14557 implement:
14559 [temp.res]
14561 The keyword `typename' is not permitted in a base-specifier or
14562 mem-initializer; in these contexts a qualified name that
14563 depends on a template-parameter is implicitly assumed to be a
14564 type name.
14566 is to assume that we have seen the `typename' keyword at this
14567 point. */
14568 nested_name_specifier_p
14577 /* If there is a `::' operator or a nested-name-specifier, then we
14578 are definitely looking for a class-name. */
14583 typename_type,
14587 /* Otherwise, we could also be looking for an ordinary identifier. */
14590 /* Try a decltype-specifier. */
14592 else
14593 /* Otherwise, try a class-name. */
14597 none_type,
14601 /* If we found one, we're done. */
14604 /* Otherwise, look for an ordinary identifier. */
14606 }
14608 /* Overloading [gram.over] */
14610 /* Parse an operator-function-id.
14612 operator-function-id:
14613 operator operator
14615 Returns an IDENTIFIER_NODE for the operator which is a
14616 human-readable spelling of the identifier, e.g., `operator +'. */
14618 static cp_expr
14620 {
14621 /* Look for the `operator' keyword. */
14624 /* And then the name of the operator itself. */
14626 }
14628 /* Return an identifier node for a user-defined literal operator.
14629 The suffix identifier is chained to the operator name identifier. */
14631 tree
14633 {
14634 tree identifier;
14641 }
14643 /* Parse an operator.
14645 operator:
14646 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14647 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14648 || ++ -- , ->* -> () []
14650 GNU Extensions:
14652 operator:
14653 <? >? <?= >?=
14655 Returns an IDENTIFIER_NODE for the operator which is a
14656 human-readable spelling of the identifier, e.g., `operator +'. */
14658 static cp_expr
14660 {
14665 /* Peek at the next token. */
14670 /* Figure out which operator we have. */
14675 {
14677 {
14678 /* The keyword should be either `new' or `delete'. */
14683 else
14686 /* Consume the `new' or `delete' token. */
14689 /* Peek at the next token. */
14691 /* If it's a `[' token then this is the array variant of the
14692 operator. */
14694 {
14695 /* Consume the `[' token. */
14697 /* Look for the `]' token. */
14702 }
14706 }
14864 {
14865 /* Consume the `('. */
14866 matching_parens parens;
14868 /* Look for the matching `)'. */
14873 }
14876 /* Consume the `['. */
14878 /* Look for the matching `]'. */
14887 /* FALLTHRU */
14896 {
14903 /* Consume the string. */
14909 {
14912 }
14913 else
14914 {
14916 /* Look for the suffix identifier. */
14921 {
14925 }
14926 else
14927 {
14930 }
14931 }
14936 {
14939 }
14942 {
14945 }
14947 {
14950 }
14952 }
14955 /* Anything else is an error. */
14957 }
14959 /* If we have selected an identifier, we need to consume the
14960 operator token. */
14962 {
14966 }
14967 /* Otherwise, no valid operator name was present. */
14968 else
14969 {
14972 }
14975 }
14977 /* Parse a template-declaration.
14979 template-declaration:
14980 export [opt] template < template-parameter-list > declaration
14982 If MEMBER_P is TRUE, this template-declaration occurs within a
14983 class-specifier.
14985 The grammar rule given by the standard isn't correct. What
14986 is really meant is:
14988 template-declaration:
14989 export [opt] template-parameter-list-seq
14990 decl-specifier-seq [opt] init-declarator [opt] ;
14991 export [opt] template-parameter-list-seq
14992 function-definition
14994 template-parameter-list-seq:
14995 template-parameter-list-seq [opt]
14996 template < template-parameter-list >
14998 Concept Extensions:
15000 template-parameter-list-seq:
15001 template < template-parameter-list > requires-clause [opt]
15003 requires-clause:
15004 requires logical-or-expression */
15006 static void
15008 {
15009 /* Check for `export'. */
15011 {
15012 /* Consume the `export' token. */
15014 /* Warn that we do not support `export'. */
15016 }
15019 }
15021 /* Parse a template-parameter-list.
15023 template-parameter-list:
15024 template-parameter
15025 template-parameter-list , template-parameter
15027 Returns a TREE_LIST. Each node represents a template parameter.
15028 The nodes are connected via their TREE_CHAINs. */
15030 static tree
15032 {
15037 /* The loop below parses the template parms. We first need to know
15038 the total number of template parms to be able to compute proper
15039 canonical types of each dependent type. So after the loop, when
15040 we know the total number of template parms,
15041 end_template_parm_list computes the proper canonical types and
15042 fixes up the dependent types accordingly. */
15044 {
15045 tree parameter;
15048 location_t parm_loc;
15050 /* Parse the template-parameter. */
15055 /* Add it to the list. */
15058 parm_loc,
15059 parameter,
15060 is_non_type,
15061 is_parameter_pack);
15062 else
15063 {
15066 }
15068 /* If the next token is not a `,', we're done. */
15071 /* Otherwise, consume the `,' token. */
15073 }
15076 }
15078 /* Parse a introduction-list.
15080 introduction-list:
15081 introduced-parameter
15082 introduction-list , introduced-parameter
15084 introduced-parameter:
15085 ...[opt] identifier
15087 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15088 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15089 WILDCARD_DECL will also have DECL_NAME set and token location in
15090 DECL_SOURCE_LOCATION. */
15092 static tree
15094 {
15098 {
15103 /* Build placeholder. */
15111 /* If the next token is not a `,', we're done. */
15114 /* Otherwise, consume the `,' token. */
15116 }
15118 /* Convert the vec into a TREE_VEC. */
15121 tree parm;
15127 }
15129 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15130 is an abstract declarator. */
15134 {
15139 }
15141 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15142 is an abstract declarator. */
15146 {
15150 else
15152 }
15154 /* Returns true if DECL represents a constrained-parameter. */
15158 {
15163 }
15165 /* Returns true if PARM declares a constrained-parameter. */
15169 {
15171 }
15173 /* Check that the type parameter is only a declarator-id, and that its
15174 type is not cv-qualified. */
15176 bool
15179 {
15184 {
15187 }
15189 /* Don't allow cv-qualified type parameters. */
15192 {
15195 }
15198 }
15200 /* Finish parsing/processing a template type parameter and checking
15201 various restrictions. */
15205 tree id,
15207 {
15210 else
15212 }
15214 static tree
15216 {
15217 /* FIXME: This should probably be copied, and we may need to adjust
15218 the template parameter depths. */
15228 }
15230 /* Finish parsing/processing a template template parameter by borrowing
15231 the template parameter list from the prototype parameter. */
15233 static tree
15235 tree proto,
15236 tree id,
15238 {
15242 }
15244 /* Create a new non-type template parameter from the given PARM
15245 declarator. */
15247 static tree
15250 {
15256 }
15258 /* Build a constrained template parameter based on the PARMDECL
15259 declarator. The type of PARMDECL is the constrained type, which
15260 refers to the prototype template parameter that ultimately
15261 specifies the type of the declared parameter. */
15263 static tree
15268 {
15274 /* A template parameter constrained by a variadic concept shall also
15275 be declared as a template parameter pack. */
15280 /* Build the parameter. Return an error if the declarator was invalid. */
15281 tree parm;
15286 parmdecl);
15287 else
15292 /* Finish the parameter decl and create a node attaching the
15293 default argument and constraint. */
15298 }
15300 /* Returns true if the parsed type actually represents the declaration
15301 of a type template-parameter. */
15305 {
15308 }
15311 /* Returns true if the parsed type actually represents the declaration of
15312 a template template-parameter. */
15314 static bool
15316 {
15319 }
15321 /* Parse a default argument for a type template-parameter.
15322 Note that diagnostics are handled in cp_parser_template_parameter. */
15324 static tree
15326 {
15329 /* Consume the `=' token. */
15334 /* Parse the default-argument. */
15340 {
15344 }
15347 }
15349 /* Parse a default argument for a template template-parameter. */
15351 static tree
15353 {
15358 /* Consume the `='. */
15360 /* Parse the id-expression. */
15362 /* save token before parsing the id-expression, for error
15363 reporting */
15365 tree default_argument
15373 /* If the id-expression was a template-id that refers to
15374 a template-class, we already have the declaration here,
15375 so no further lookup is needed. */
15376 ;
15377 else
15378 /* Look up the name. */
15379 default_argument
15381 none_type,
15387 /* See if the default argument is valid. */
15391 }
15393 /* Parse a template-parameter.
15395 template-parameter:
15396 type-parameter
15397 parameter-declaration
15399 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15400 the parameter. The TREE_PURPOSE is the default value, if any.
15401 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15402 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15403 set to true iff this parameter is a parameter pack. */
15405 static tree
15408 {
15411 tree parm;
15413 /* Assume it is a type parameter or a template parameter. */
15415 /* Assume it not a parameter pack. */
15417 /* Peek at the next token. */
15419 /* If it is `template', we have a type-parameter. */
15422 /* If it is `class' or `typename' we do not know yet whether it is a
15423 type parameter or a non-type parameter. Consider:
15425 template <typename T, typename T::X X> ...
15427 or:
15429 template <class C, class D*> ...
15431 Here, the first parameter is a type parameter, and the second is
15432 a non-type parameter. We can tell by looking at the token after
15433 the identifier -- if it is a `,', `=', or `>' then we have a type
15434 parameter. */
15436 {
15437 /* Peek at the token after `class' or `typename'. */
15439 /* If it's an ellipsis, we have a template type parameter
15440 pack. */
15443 /* If it's an identifier, skip it. */
15446 /* Now, see if the token looks like the end of a template
15447 parameter. */
15452 }
15454 /* Otherwise, it is a non-type parameter or a constrained parameter.
15456 [temp.param]
15458 When parsing a default template-argument for a non-type
15459 template-parameter, the first non-nested `>' is taken as the end
15460 of the template parameter-list rather than a greater-than
15461 operator. */
15462 parameter_declarator
15469 /* If the parameter declaration is marked as a parameter pack, set
15470 *IS_PARAMETER_PACK to notify the caller. */
15475 {
15476 /* Can happen in some cases of erroneous input (c++/34892). */
15478 /* Consume the `...' for better error recovery. */
15480 }
15482 // The parameter may have been constrained.
15485 parameter_declarator,
15486 is_non_type,
15487 is_parameter_pack);
15489 // Now we're sure that the parameter is a non-type parameter.
15500 }
15502 /* Parse a type-parameter.
15504 type-parameter:
15505 class identifier [opt]
15506 class identifier [opt] = type-id
15507 typename identifier [opt]
15508 typename identifier [opt] = type-id
15509 template < template-parameter-list > class identifier [opt]
15510 template < template-parameter-list > class identifier [opt]
15511 = id-expression
15513 GNU Extension (variadic templates):
15515 type-parameter:
15516 class ... identifier [opt]
15517 typename ... identifier [opt]
15519 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15520 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15521 the declaration of the parameter.
15523 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15525 static tree
15527 {
15529 tree parameter;
15531 /* Look for a keyword to tell us what kind of parameter this is. */
15537 {
15540 {
15541 tree identifier;
15542 tree default_argument;
15544 /* If the next token is an ellipsis, we have a template
15545 argument pack. */
15547 {
15548 /* Consume the `...' token. */
15553 }
15555 /* If the next token is an identifier, then it names the
15556 parameter. */
15559 else
15562 /* Create the parameter. */
15565 /* If the next token is an `=', we have a default argument. */
15567 {
15568 default_argument
15571 /* Template parameter packs cannot have default
15572 arguments. */
15574 {
15577 "template parameter pack %qD cannot have a "
15579 else
15581 "template parameter packs cannot have "
15584 }
15587 }
15588 else
15591 /* Create the combined representation of the parameter and the
15592 default argument. */
15594 }
15598 {
15599 tree identifier;
15600 tree default_argument;
15602 /* Look for the `<'. */
15604 /* Parse the template-parameter-list. */
15606 /* Look for the `>'. */
15609 // If template requirements are present, parse them.
15611 {
15616 }
15618 /* Look for the `class' or 'typename' keywords. */
15620 /* If the next token is an ellipsis, we have a template
15621 argument pack. */
15623 {
15624 /* Consume the `...' token. */
15629 }
15630 /* If the next token is an `=', then there is a
15631 default-argument. If the next token is a `>', we are at
15632 the end of the parameter-list. If the next token is a `,',
15633 then we are at the end of this parameter. */
15637 {
15639 /* Treat invalid names as if the parameter were nameless. */
15642 }
15643 else
15646 /* Create the template parameter. */
15648 identifier);
15650 /* If the next token is an `=', then there is a
15651 default-argument. */
15653 {
15654 default_argument
15657 /* Template parameter packs cannot have default
15658 arguments. */
15660 {
15663 "template parameter pack %qD cannot "
15665 identifier);
15666 else
15670 }
15671 }
15672 else
15675 /* Create the combined representation of the parameter and the
15676 default argument. */
15678 }
15684 }
15687 }
15689 /* Parse a template-id.
15691 template-id:
15692 template-name < template-argument-list [opt] >
15694 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15695 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15696 returned. Otherwise, if the template-name names a function, or set
15697 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15698 names a class, returns a TYPE_DECL for the specialization.
15700 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15701 uninstantiated templates. */
15703 static tree
15709 {
15710 tree templ;
15711 tree arguments;
15712 tree template_id;
15717 /* If the next token corresponds to a template-id, there is no need
15718 to reparse it. */
15721 {
15724 }
15726 /* Avoid performing name lookup if there is no possibility of
15727 finding a template-id. */
15730 && !cp_parser_nth_token_starts_template_argument_list_p
15732 {
15735 }
15737 /* Remember where the template-id starts. */
15743 /* Parse the template-name. */
15746 check_dependency_p,
15747 is_declaration,
15748 tag_type,
15751 {
15754 }
15756 /* Since we're going to preserve any side-effects from this parse, set up a
15757 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15758 in the template arguments. */
15761 /* If we find the sequence `[:' after a template-name, it's probably
15762 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15763 parse correctly the argument list. */
15770 {
15772 /* Change `:' into `::'. */
15774 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15775 CPP_LESS. */
15778 /* Parse the arguments. */
15781 {
15782 /* If we couldn't parse an argument list, then we revert our changes
15783 and return simply an error. Maybe this is not a template-id
15784 after all. */
15789 }
15790 /* Otherwise, emit an error about the invalid digraph, but continue
15791 parsing because we got our argument list. */
15794 {
15797 "%<<:%> is an alternate spelling for %<[%>."
15800 {
15802 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15805 }
15806 }
15807 }
15808 else
15809 {
15810 /* Look for the `<' that starts the template-argument-list. */
15812 {
15815 }
15816 /* Parse the arguments. */
15818 }
15820 /* Set the location to be of the form:
15821 template-name < template-argument-list [opt] >
15822 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15823 with caret == start at the start of the template-name,
15824 ranging until the closing '>'. */
15825 location_t finish_loc
15827 location_t combined_loc
15830 /* Build a representation of the specialization. */
15833 TEMPLATE_ID_EXPR,
15837 {
15839 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15840 template (rather than some instantiation thereof) only if
15841 is not nested within some other construct. For example, in
15842 "template <typename T> void f(T) { A<T>::", A<T> is just an
15843 instantiation of A. */
15846 CPP_SCOPE));
15847 template_id
15849 }
15850 /* A template-like identifier may be a partial concept id. */
15856 {
15860 }
15861 else
15862 {
15863 /* If it's not a class-template or a template-template, it should be
15864 a function-template. */
15872 }
15874 /* If parsing tentatively, replace the sequence of tokens that makes
15875 up the template-id with a CPP_TEMPLATE_ID token. That way,
15876 should we re-parse the token stream, we will not have to repeat
15877 the effort required to do the parse, nor will we issue duplicate
15878 error messages about problems during instantiation of the
15879 template. */
15881 /* Don't do this if we had a parse error in a declarator; re-parsing
15882 might succeed if a name changes meaning (60361). */
15886 {
15887 /* Reset the contents of the START_OF_ID token. */
15891 /* We must mark the lookup as kept, so we don't throw it away on
15892 the first parse. */
15896 /* Retrieve any deferred checks. Do not pop this access checks yet
15897 so the memory will not be reclaimed during token replacing below. */
15903 /* Purge all subsequent tokens. */
15906 /* ??? Can we actually assume that, if template_id ==
15907 error_mark_node, we will have issued a diagnostic to the
15908 user, as opposed to simply marking the tentative parse as
15909 failed? */
15912 }
15916 }
15918 /* Parse a template-name.
15920 template-name:
15921 identifier
15923 The standard should actually say:
15925 template-name:
15926 identifier
15927 operator-function-id
15929 A defect report has been filed about this issue.
15931 A conversion-function-id cannot be a template name because they cannot
15932 be part of a template-id. In fact, looking at this code:
15934 a.operator K<int>()
15936 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15937 It is impossible to call a templated conversion-function-id with an
15938 explicit argument list, since the only allowed template parameter is
15939 the type to which it is converting.
15941 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15942 `template' keyword, in a construction like:
15944 T::template f<3>()
15946 In that case `f' is taken to be a template-name, even though there
15947 is no way of knowing for sure.
15949 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15950 name refers to a set of overloaded functions, at least one of which
15951 is a template, or an IDENTIFIER_NODE with the name of the template,
15952 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15953 names are looked up inside uninstantiated templates. */
15955 static tree
15962 {
15963 tree identifier;
15964 tree decl;
15967 /* If the next token is `operator', then we have either an
15968 operator-function-id or a conversion-function-id. */
15970 {
15971 /* We don't know whether we're looking at an
15972 operator-function-id or a conversion-function-id. */
15974 /* Try an operator-function-id. */
15976 /* If that didn't work, try a conversion-function-id. */
15978 {
15981 }
15982 }
15983 /* Look for the identifier. */
15984 else
15987 /* If we didn't find an identifier, we don't have a template-id. */
15991 /* If the name immediately followed the `template' keyword, then it
15992 is a template-name. However, if the next token is not `<', then
15993 we do not treat it as a template-name, since it is not being used
15994 as part of a template-id. This enables us to handle constructs
15995 like:
15997 template <typename T> struct S { S(); };
15998 template <typename T> S<T>::S();
16000 correctly. We would treat `S' as a template -- if it were `S<T>'
16001 -- but we do not if there is no `<'. */
16005 {
16006 /* In a declaration, in a dependent context, we pretend that the
16007 "template" keyword was present in order to improve error
16008 recovery. For example, given:
16010 template <typename T> void f(T::X<int>);
16012 we want to treat "X<int>" as a template-id. */
16014 && !template_keyword_p
16016 && check_dependency_p
16018 /* Do not do this for dtors (or ctors), since they never
16019 need the template keyword before their name. */
16021 {
16024 /* Explain what went wrong. */
16026 identifier);
16029 /* If parsing tentatively, find the location of the "<" token. */
16032 /* Parse the template arguments so that we can issue error
16033 messages about them. */
16036 /* Skip tokens until we find a good place from which to
16037 continue parsing. */
16042 /* If parsing tentatively, permanently remove the
16043 template argument list. That will prevent duplicate
16044 error messages from being issued about the missing
16045 "template" keyword. */
16052 }
16054 /* If the "template" keyword is present, then there is generally
16055 no point in doing name-lookup, so we just return IDENTIFIER.
16056 But, if the qualifying scope is non-dependent then we can
16057 (and must) do name-lookup normally. */
16059 {
16065 {
16066 /* We're optimizing away the call to cp_parser_lookup_name, but
16067 we still need to do this. */
16070 }
16071 }
16072 }
16074 /* Look up the name. */
16076 tag_type,
16079 check_dependency_p,
16085 /* If DECL is a template, then the name was a template-name. */
16087 {
16091 }
16092 else
16093 {
16094 /* The standard does not explicitly indicate whether a name that
16095 names a set of overloaded declarations, some of which are
16096 templates, is a template-name. However, such a name should
16097 be a template-name; otherwise, there is no way to form a
16098 template-id for the overloaded templates. */
16107 {
16108 /* The name does not name a template. */
16111 }
16112 }
16114 /* If DECL is dependent, and refers to a function, then just return
16115 its name; we will look it up again during template instantiation. */
16117 {
16121 }
16124 }
16126 /* Parse a template-argument-list.
16128 template-argument-list:
16129 template-argument ... [opt]
16130 template-argument-list , template-argument ... [opt]
16132 Returns a TREE_VEC containing the arguments. */
16134 static tree
16136 {
16141 tree vec;
16148 /* Even if the template-id appears in an integral
16149 constant-expression, the contents of the argument list do
16150 not. */
16156 /* Parse the arguments. */
16157 do
16158 {
16159 tree argument;
16162 /* Consume the comma. */
16165 /* Parse the template-argument. */
16168 /* If the next token is an ellipsis, we're expanding a template
16169 argument pack. */
16171 {
16173 {
16177 }
16178 /* Consume the `...' token. */
16181 /* Make the argument into a TYPE_PACK_EXPANSION or
16182 EXPR_PACK_EXPANSION. */
16184 }
16187 {
16191 {
16194 }
16195 else
16197 }
16199 }
16215 }
16217 /* Parse a template-argument.
16219 template-argument:
16220 assignment-expression
16221 type-id
16222 id-expression
16224 The representation is that of an assignment-expression, type-id, or
16225 id-expression -- except that the qualified id-expression is
16226 evaluated, so that the value returned is either a DECL or an
16227 OVERLOAD.
16229 Although the standard says "assignment-expression", it forbids
16230 throw-expressions or assignments in the template argument.
16231 Therefore, we use "conditional-expression" instead. */
16233 static tree
16235 {
16236 tree argument;
16242 cp_id_kind idk;
16244 /* There's really no way to know what we're looking at, so we just
16245 try each alternative in order.
16247 [temp.arg]
16249 In a template-argument, an ambiguity between a type-id and an
16250 expression is resolved to a type-id, regardless of the form of
16251 the corresponding template-parameter.
16253 Therefore, we try a type-id first. */
16256 /* If there was no error parsing the type-id but the next token is a
16257 '>>', our behavior depends on which dialect of C++ we're
16258 parsing. In C++98, we probably found a typo for '> >'. But there
16259 are type-id which are also valid expressions. For instance:
16261 struct X { int operator >> (int); };
16262 template <int V> struct Foo {};
16263 Foo<X () >> 5> r;
16265 Here 'X()' is a valid type-id of a function type, but the user just
16266 wanted to write the expression "X() >> 5". Thus, we remember that we
16267 found a valid type-id, but we still try to parse the argument as an
16268 expression to see what happens.
16270 In C++0x, the '>>' will be considered two separate '>'
16271 tokens. */
16275 {
16278 }
16279 else
16280 {
16281 /* If the next token isn't a `,' or a `>', then this argument wasn't
16282 really finished. This means that the argument is not a valid
16283 type-id. */
16286 /* If that worked, we're done. */
16289 }
16290 /* We're still not sure what the argument will be. */
16292 /* Try a template. */
16300 /* If the next token isn't a `,' or a `>', then this argument wasn't
16301 really finished. */
16305 {
16306 /* Figure out what is being referred to. If the id-expression
16307 was for a class template specialization, then we will have a
16308 TYPE_DECL at this point. There is no need to do name lookup
16309 at this point in that case. */
16312 none_type,
16318 /* Handle a constrained-type-specifier for a non-type template
16319 parameter. */
16325 }
16327 {
16331 }
16332 /* It must be a non-type argument. In C++17 any constant-expression is
16333 allowed. */
16337 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16339 -- an integral constant-expression of integral or enumeration
16340 type; or
16342 -- the name of a non-type template-parameter; or
16344 -- the name of an object or function with external linkage...
16346 -- the address of an object or function with external linkage...
16348 -- a pointer to member... */
16349 /* Look for a non-type template parameter. */
16351 {
16363 }
16365 /* If the next token is "&", the argument must be the address of an
16366 object or function with external linkage. */
16369 {
16372 }
16373 /* See if we might have an id-expression. */
16380 {
16383 address_p,
16390 else
16391 {
16392 tree probe;
16395 {
16396 /* Strip the dereference temporarily. */
16399 }
16401 /* If we're in a template, we represent a qualified-id referring
16402 to a static data member as a SCOPE_REF even if the scope isn't
16403 dependent so that we can check access control later. */
16408 {
16409 /* A variable without external linkage might still be a
16410 valid constant-expression, so no error is issued here
16411 if the external-linkage check fails. */
16414 }
16416 /* All overloaded functions are allowed; if the external
16417 linkage test does not pass, an error will be issued
16418 later. */
16419 ;
16423 /* A pointer-to-member. */
16424 ;
16426 ;
16427 else
16431 {
16434 tf_warning_or_error);
16435 else
16438 }
16439 }
16440 }
16441 /* If the argument started with "&", there are no other valid
16442 alternatives at this point. */
16444 {
16447 }
16449 general_expr:
16450 /* If the argument wasn't successfully parsed as a type-id followed
16451 by '>>', the argument can only be a constant expression now.
16452 Otherwise, we try parsing the constant-expression tentatively,
16453 because the argument could really be a type-id. */
16459 else
16460 {
16461 /* With C++17 generalized non-type template arguments we need to handle
16462 lvalue constant expressions, too. */
16465 }
16473 /* We did our best to parse the argument as a non type-id, but that
16474 was the only alternative that matched (albeit with a '>' after
16475 it). We can assume it's just a typo from the user, and a
16476 diagnostic will then be issued. */
16478 }
16480 /* Parse an explicit-instantiation.
16482 explicit-instantiation:
16483 template declaration
16485 Although the standard says `declaration', what it really means is:
16487 explicit-instantiation:
16488 template decl-specifier-seq [opt] declarator [opt] ;
16490 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16491 supposed to be allowed. A defect report has been filed about this
16492 issue.
16494 GNU Extension:
16496 explicit-instantiation:
16497 storage-class-specifier template
16498 decl-specifier-seq [opt] declarator [opt] ;
16499 function-specifier template
16500 decl-specifier-seq [opt] declarator [opt] ; */
16502 static void
16504 {
16506 cp_decl_specifier_seq decl_specifiers;
16511 /* Look for an (optional) storage-class-specifier or
16512 function-specifier. */
16514 {
16515 extension_specifier
16518 extension_specifier
16521 }
16523 /* Look for the `template' keyword. */
16525 /* Let the front end know that we are processing an explicit
16526 instantiation. */
16528 /* [temp.explicit] says that we are supposed to ignore access
16529 control while processing explicit instantiation directives. */
16531 /* Parse a decl-specifier-seq. */
16533 CP_PARSER_FLAGS_OPTIONAL,
16536 /* If there was exactly one decl-specifier, and it declared a class,
16537 and there's no declarator, then we have an explicit type
16538 instantiation. */
16540 {
16541 tree type;
16545 /* Turn access control back on for names used during
16546 template instantiation. */
16551 }
16552 else
16553 {
16555 tree decl;
16557 /* Parse the declarator. */
16558 declarator
16569 {
16572 "explicit instantiation shall not use"
16576 "explicit instantiation shall not use"
16581 /* Turn access control back on for names used during
16582 template instantiation. */
16584 /* Do the explicit instantiation. */
16586 }
16587 else
16588 {
16590 /* Skip the body of the explicit instantiation. */
16592 }
16593 }
16594 /* We're done with the instantiation. */
16600 }
16602 /* Parse an explicit-specialization.
16604 explicit-specialization:
16605 template < > declaration
16607 Although the standard says `declaration', what it really means is:
16609 explicit-specialization:
16610 template <> decl-specifier [opt] init-declarator [opt] ;
16611 template <> function-definition
16612 template <> explicit-specialization
16613 template <> template-declaration */
16615 static void
16617 {
16621 /* Look for the `template' keyword. */
16623 /* Look for the `<'. */
16625 /* Look for the `>'. */
16627 /* We have processed another parameter list. */
16629 /* [temp]
16631 A template ... explicit specialization ... shall not have C
16632 linkage. */
16634 {
16637 /* Give it C++ linkage to avoid confusing other parts of the
16638 front end. */
16641 }
16642 else
16644 /* Let the front end know that we are beginning a specialization. */
16646 {
16649 }
16651 /* If the next keyword is `template', we need to figure out whether
16652 or not we're looking a template-declaration. */
16654 {
16659 else
16661 }
16662 else
16663 /* Parse the dependent declaration. */
16669 /* We're done with the specialization. */
16671 /* For the erroneous case of a template with C linkage, we pushed an
16672 implicit C++ linkage scope; exit that scope now. */
16675 /* We're done with this parameter list. */
16677 }
16679 /* Parse a type-specifier.
16681 type-specifier:
16682 simple-type-specifier
16683 class-specifier
16684 enum-specifier
16685 elaborated-type-specifier
16686 cv-qualifier
16688 GNU Extension:
16690 type-specifier:
16691 __complex__
16693 Returns a representation of the type-specifier. For a
16694 class-specifier, enum-specifier, or elaborated-type-specifier, a
16695 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16697 The parser flags FLAGS is used to control type-specifier parsing.
16699 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16700 in a decl-specifier-seq.
16702 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16703 class-specifier, enum-specifier, or elaborated-type-specifier, then
16704 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16705 if a type is declared; 2 if it is defined. Otherwise, it is set to
16706 zero.
16708 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16709 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16710 is set to FALSE. */
16712 static tree
16714 cp_parser_flags flags,
16719 {
16725 /* Assume this type-specifier does not declare a new type. */
16728 /* And that it does not specify a cv-qualifier. */
16731 /* Peek at the next token. */
16734 /* If we're looking at a keyword, we can use that to guide the
16735 production we choose. */
16738 {
16743 /* Look for the enum-specifier. */
16745 /* If that worked, we're done. */
16747 {
16752 type_spec,
16753 token,
16756 }
16757 else
16760 /* Any of these indicate either a class-specifier, or an
16761 elaborated-type-specifier. */
16768 /* Parse tentatively so that we can back up if we don't find a
16769 class-specifier. */
16771 /* Look for the class-specifier. */
16774 /* If that worked, we're done. */
16776 {
16781 type_spec,
16782 token,
16785 }
16787 /* Fall through. */
16788 elaborated_type_specifier:
16789 /* We're declaring (not defining) a class or enum. */
16793 /* Fall through. */
16795 /* Look for an elaborated-type-specifier. */
16796 type_spec
16797 = (cp_parser_elaborated_type_specifier
16800 is_declaration));
16803 type_spec,
16804 token,
16827 /* The `__complex__' keyword is a GNU extension. */
16833 }
16835 /* Handle simple keywords. */
16837 {
16839 {
16842 }
16844 }
16846 /* If we do not already have a type-specifier, assume we are looking
16847 at a simple-type-specifier. */
16849 decl_specs,
16850 flags);
16852 /* If we didn't find a type-specifier, and a type-specifier was not
16853 optional in this context, issue an error message. */
16855 {
16858 }
16861 }
16863 /* Parse a simple-type-specifier.
16865 simple-type-specifier:
16866 :: [opt] nested-name-specifier [opt] type-name
16867 :: [opt] nested-name-specifier template template-id
16868 char
16869 wchar_t
16870 bool
16871 short
16872 int
16873 long
16874 signed
16875 unsigned
16876 float
16877 double
16878 void
16880 C++11 Extension:
16882 simple-type-specifier:
16883 auto
16884 decltype ( expression )
16885 char16_t
16886 char32_t
16887 __underlying_type ( type-id )
16889 C++17 extension:
16891 nested-name-specifier(opt) template-name
16893 GNU Extension:
16895 simple-type-specifier:
16896 __int128
16897 __typeof__ unary-expression
16898 __typeof__ ( type-id )
16899 __typeof__ ( type-id ) { initializer-list , [opt] }
16901 Concepts Extension:
16903 simple-type-specifier:
16904 constrained-type-specifier
16906 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16907 appropriately updated. */
16909 static tree
16912 cp_parser_flags flags)
16913 {
16918 /* Peek at the next token. */
16921 /* If we're looking at a keyword, things are easy. */
16923 {
16958 {
16961 }
16990 {
16991 /* The 'auto' might be the placeholder return type for a function decl
16992 with trailing return type. */
17001 {
17003 {
17010 }
17013 {
17016 }
17019 }
17023 {
17026 }
17029 {
17032 }
17033 else
17037 {
17040 "use of %<auto%> in lambda parameter declaration "
17041 "only available with "
17043 }
17046 "use of %<auto%> in parameter declaration "
17047 "only available with "
17051 "ISO C++ forbids use of %<auto%> in parameter "
17053 }
17054 else
17059 /* Since DR 743, decltype can either be a simple-type-specifier by
17060 itself or begin a nested-name-specifier. Parsing it will replace
17061 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17062 handling below decide what to do. */
17068 /* Consume the `typeof' token. */
17070 /* Parse the operand to `typeof'. */
17072 /* If it is not already a TYPE, take its type. */
17078 token,
17087 token,
17097 token,
17102 }
17104 /* If token is an already-parsed decltype not followed by ::,
17105 it's a simple-type-specifier. */
17108 {
17111 {
17113 token,
17115 /* Remember that we are handling a decltype in order to
17116 implement the resolution of DR 1510 when the argument
17117 isn't instantiation dependent. */
17119 }
17122 }
17124 /* If the type-specifier was for a built-in type, we're done. */
17126 {
17127 /* Record the type. */
17134 type,
17135 token,
17140 /* Consume the token. */
17146 /* There is no valid C++ program where a non-template type is
17147 followed by a "<". That usually indicates that the user thought
17148 that the type was a template. */
17153 }
17155 /* The type-specifier must be a user-defined type. */
17157 {
17161 /* Don't gobble tokens or issue error messages if this is an
17162 optional type-specifier. */
17168 /* Look for the optional `::' operator. */
17169 global_p
17173 /* Look for the nested-name specifier. */
17174 qualified_p
17181 /* If we have seen a nested-name-specifier, and the next token
17182 is `template', then we are using the template-id production. */
17185 {
17186 /* Look for the template-id. */
17190 none_type,
17192 /* If the template-id did not name a type, we are out of
17193 luck. */
17195 {
17198 }
17199 }
17200 /* Otherwise, look for a type-name. */
17201 else
17203 /* Keep track of all name-lookups performed in class scopes. */
17205 && !global_p
17206 && !qualified_p
17210 /* If it didn't work out, we don't have a TYPE. */
17215 {
17229 {
17231 none_type,
17241 else
17242 {
17247 }
17248 }
17249 else
17255 }
17258 token,
17260 }
17262 /* If we didn't get a type-name, issue an error message. */
17264 {
17267 }
17270 {
17271 /* See if TYPE is an Objective-C type, and if so, parse and
17272 accept any protocol references following it. Do this before
17273 the cp_parser_check_for_invalid_template_id() call, because
17274 Objective-C types can be followed by '<...>' which would
17275 enclose protocol names rather than template arguments, and so
17276 everything is fine. */
17279 {
17283 /* Clobber the "unqualified" type previously entered into
17284 DECL_SPECS with the new, improved protocol-qualified version. */
17289 }
17291 /* There is no valid C++ program where a non-template type is
17292 followed by a "<". That usually indicates that the user
17293 thought that the type was a template. */
17295 none_type,
17297 }
17300 }
17302 /* Parse a type-name.
17304 type-name:
17305 class-name
17306 enum-name
17307 typedef-name
17308 simple-template-id [in c++0x]
17310 enum-name:
17311 identifier
17313 typedef-name:
17314 identifier
17316 Concepts:
17318 type-name:
17319 concept-name
17320 partial-concept-id
17322 concept-name:
17323 identifier
17325 Returns a TYPE_DECL for the type. */
17327 static tree
17329 {
17331 }
17333 /* See above. */
17334 static tree
17336 {
17337 tree type_decl;
17339 /* We can't know yet whether it is a class-name or not. */
17341 /* Try a class-name. */
17343 typename_keyword_p,
17345 none_type,
17349 /* If it's not a class-name, keep looking. */
17351 {
17353 /* It must be a typedef-name or an enum-name. */
17357 /* It is either a simple-template-id representing an
17358 instantiation of an alias template... */
17362 none_type,
17364 /* Note that this must be an instantiation of an alias template
17365 because [temp.names]/6 says:
17367 A template-id that names an alias template specialization
17368 is a type-name.
17370 Whereas [temp.names]/7 says:
17372 A simple-template-id that names a class template
17373 specialization is a class-name.
17375 With concepts, this could also be a partial-concept-id that
17376 declares a non-type template parameter. */
17383 else
17387 /* ... Or a typedef-name or an enum-name. */
17389 }
17392 }
17394 /* Check if DECL and ARGS can form a constrained-type-specifier.
17395 If ARGS is non-null, we try to form a concept check of the
17396 form DECL<?, ARGS> where ? is a wildcard that matches any
17397 kind of template argument. If ARGS is NULL, then we try to
17398 form a concept check of the form DECL<?>. */
17400 static tree
17403 {
17406 /* If we a constrained-type-specifier cannot be deduced. */
17410 /* A constrained type specifier can only be found in an
17411 overload set or as a reference to a template declaration.
17413 FIXME: This might be masking a bug. It's possible that
17414 that the deduction below is causing template specializations
17415 to be formed with the wildcard as an argument. */
17419 /* Try to build a call expression that evaluates the
17420 concept. This can fail if the overload set refers
17421 only to non-templates. */
17427 /* Deduce the checked constraint and the prototype parameter.
17429 FIXME: In certain cases, failure to deduce should be a
17430 diagnosable error. */
17431 tree conc;
17432 tree proto;
17436 /* In template parameter scope, this results in a constrained
17437 parameter. Return a descriptor of that parm. */
17441 /* In a parameter-declaration-clause, constrained-type
17442 specifiers result in invented template parameters. */
17444 {
17447 }
17448 else
17449 {
17450 /* Otherwise, we're in a context where the constrained
17451 type name is deduced and the constraint applies
17452 after deduction. */
17454 }
17457 }
17459 /* If DECL refers to a concept, return a TYPE_DECL representing
17460 the result of using the constrained type specifier in the
17461 current context. DECL refers to a concept if
17463 - it is an overload set containing a function concept taking a single
17464 type argument, or
17466 - it is a variable concept taking a single type argument. */
17468 static tree
17470 {
17476 else
17478 }
17480 /* Check if DECL and ARGS form a partial-concept-id. If so,
17481 assign ID to the resulting constrained placeholder.
17483 Returns true if the partial-concept-id designates a placeholder
17484 and false otherwise. Note that *id is set to NULL_TREE in
17485 this case. */
17487 static tree
17489 {
17491 }
17493 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17494 or a concept-name.
17496 enum-name:
17497 identifier
17499 typedef-name:
17500 identifier
17502 concept-name:
17503 identifier
17505 Returns a TYPE_DECL for the type. */
17507 static tree
17509 {
17510 tree type_decl;
17511 tree identifier;
17518 /* Look up the type-name. */
17523 /* If we found an overload set, then it may refer to a concept-name. */
17529 {
17530 /* See if this is an Objective-C type. */
17535 }
17537 /* Issue an error if we did not find a type-name. */
17539 /* In Objective-C, we have the complication that class names are
17540 normally type names and start declarations (eg, the
17541 "NSObject" in "NSObject *object;"), but can be used in an
17542 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17543 is an expression. So, a classname followed by a dot is not a
17544 valid type-name. */
17547 {
17552 }
17553 /* Remember that the name was used in the definition of the
17554 current class so that we can check later to see if the
17555 meaning would have been different after the class was
17556 entirely defined. */
17562 }
17564 /* Parse an elaborated-type-specifier. Note that the grammar given
17565 here incorporates the resolution to DR68.
17567 elaborated-type-specifier:
17568 class-key :: [opt] nested-name-specifier [opt] identifier
17569 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17570 enum-key :: [opt] nested-name-specifier [opt] identifier
17571 typename :: [opt] nested-name-specifier identifier
17572 typename :: [opt] nested-name-specifier template [opt]
17573 template-id
17575 GNU extension:
17577 elaborated-type-specifier:
17578 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17579 class-key attributes :: [opt] nested-name-specifier [opt]
17580 template [opt] template-id
17581 enum attributes :: [opt] nested-name-specifier [opt] identifier
17583 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17584 declared `friend'. If IS_DECLARATION is TRUE, then this
17585 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17586 something is being declared.
17588 Returns the TYPE specified. */
17590 static tree
17594 {
17596 tree identifier;
17599 tree globalscope;
17602 /* See if we're looking at the `enum' keyword. */
17604 {
17605 /* Consume the `enum' token. */
17607 /* Remember that it's an enumeration type. */
17609 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17610 enums) is used here. */
17614 {
17621 /* Consume the `struct' or `class' and parse it anyway. */
17623 }
17624 /* Parse the attributes. */
17626 }
17627 /* Or, it might be `typename'. */
17629 RID_TYPENAME))
17630 {
17631 /* Consume the `typename' token. */
17633 /* Remember that it's a `typename' type. */
17635 }
17636 /* Otherwise it must be a class-key. */
17637 else
17638 {
17642 /* Parse the attributes. */
17644 }
17646 /* Look for the `::' operator. */
17649 /* Look for the nested-name-specifier. */
17650 tree nested_name_specifier;
17652 {
17653 nested_name_specifier
17658 is_declaration);
17661 }
17662 else
17663 /* Even though `typename' is not present, the proposed resolution
17664 to Core Issue 180 says that in `class A<T>::B', `B' should be
17665 considered a type-name, even if `A<T>' is dependent. */
17666 nested_name_specifier
17671 is_declaration);
17672 /* For everything but enumeration types, consider a template-id.
17673 For an enumeration type, consider only a plain identifier. */
17675 {
17677 tree decl;
17679 /* Allow the `template' keyword. */
17681 /* If we didn't see `template', we don't know if there's a
17682 template-id or not. */
17685 /* Parse the template-id. */
17689 tag_type,
17690 is_declaration);
17691 /* If we didn't find a template-id, look for an ordinary
17692 identifier. */
17694 ;
17695 /* We can get here when cp_parser_template_id, called by
17696 cp_parser_class_name with tag_type == none_type, succeeds
17697 and caches a BASELINK. Then, when called again here,
17698 instead of failing and returning an error_mark_node
17699 returns it (see template/typename17.C in C++11).
17700 ??? Could we diagnose this earlier? */
17702 {
17705 }
17706 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17707 in effect, then we must assume that, upon instantiation, the
17708 template will correspond to a class. */
17712 typename_type,
17714 /* If the `typename' keyword is in effect and DECL is not a type
17715 decl, then type is non existent. */
17717 ;
17719 {
17723 /* If the next token is a semicolon, this must be a specialization,
17724 instantiation, or friend declaration. Check the scope while we
17725 still know whether or not we had a nested-name-specifier. */
17730 }
17733 }
17736 {
17741 {
17744 }
17746 /* For a `typename', we needn't call xref_tag. */
17752 /* Template parameter lists apply only if we are not within a
17753 function parameter list. */
17754 bool template_parm_lists_apply
17763 /* Look up a qualified name in the usual way. */
17765 {
17766 tree decl;
17767 tree ambiguous_decls;
17770 tag_type,
17777 /* If the lookup was ambiguous, an error will already have been
17778 issued. */
17782 /* If we are parsing friend declaration, DECL may be a
17783 TEMPLATE_DECL tree node here. However, we need to check
17784 whether this TEMPLATE_DECL results in valid code. Consider
17785 the following example:
17787 namespace N {
17788 template <class T> class C {};
17789 }
17790 class X {
17791 template <class T> friend class N::C; // #1, valid code
17792 };
17793 template <class T> class Y {
17794 friend class N::C; // #2, invalid code
17795 };
17797 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17798 name lookup of `N::C'. We see that friend declaration must
17799 be template for the code to be valid. Note that
17800 processing_template_decl does not work here since it is
17801 always 1 for the above two cases. */
17803 decl = (cp_parser_maybe_treat_template_as_class
17808 {
17810 identifier,
17813 }
17816 {
17820 allow_template);
17824 }
17826 /* Forward declarations of nested types, such as
17828 class C1::C2;
17829 class C1::C2::C3;
17831 are invalid unless all components preceding the final '::'
17832 are complete. If all enclosing types are complete, these
17833 declarations become merely pointless.
17835 Invalid forward declarations of nested types are errors
17836 caught elsewhere in parsing. Those that are pointless arrive
17837 here. */
17844 }
17845 else
17846 {
17847 /* An elaborated-type-specifier sometimes introduces a new type and
17848 sometimes names an existing type. Normally, the rule is that it
17849 introduces a new type only if there is not an existing type of
17850 the same name already in scope. For example, given:
17852 struct S {};
17853 void f() { struct S s; }
17855 the `struct S' in the body of `f' is the same `struct S' as in
17856 the global scope; the existing definition is used. However, if
17857 there were no global declaration, this would introduce a new
17858 local class named `S'.
17860 An exception to this rule applies to the following code:
17862 namespace N { struct S; }
17864 Here, the elaborated-type-specifier names a new type
17865 unconditionally; even if there is already an `S' in the
17866 containing scope this declaration names a new type.
17867 This exception only applies if the elaborated-type-specifier
17868 forms the complete declaration:
17870 [class.name]
17872 A declaration consisting solely of `class-key identifier ;' is
17873 either a redeclaration of the name in the current scope or a
17874 forward declaration of the identifier as a class name. It
17875 introduces the name into the current scope.
17877 We are in this situation precisely when the next token is a `;'.
17879 An exception to the exception is that a `friend' declaration does
17880 *not* name a new type; i.e., given:
17882 struct S { friend struct T; };
17884 `T' is not a new type in the scope of `S'.
17886 Also, `new struct S' or `sizeof (struct S)' never results in the
17887 definition of a new type; a new type can only be declared in a
17888 declaration context. */
17890 tag_scope ts;
17894 /* Friends have special name lookup rules. */
17898 CPP_SEMICOLON))
17899 /* This is a `class-key identifier ;' */
17901 else
17904 template_p =
17905 (template_parm_lists_apply
17908 /* An unqualified name was used to reference this type, so
17909 there were no qualifying templates. */
17917 }
17918 }
17923 /* Allow attributes on forward declarations of classes. */
17925 {
17935 else
17938 }
17941 {
17942 /* Indicate whether this class was declared as a `class' or as a
17943 `struct'. */
17947 }
17949 /* A "<" cannot follow an elaborated type specifier. If that
17950 happens, the user was probably trying to form a template-id. */
17955 }
17957 /* Parse an enum-specifier.
17959 enum-specifier:
17960 enum-head { enumerator-list [opt] }
17961 enum-head { enumerator-list , } [C++0x]
17963 enum-head:
17964 enum-key identifier [opt] enum-base [opt]
17965 enum-key nested-name-specifier identifier enum-base [opt]
17967 enum-key:
17968 enum
17969 enum class [C++0x]
17970 enum struct [C++0x]
17972 enum-base: [C++0x]
17973 : type-specifier-seq
17975 opaque-enum-specifier:
17976 enum-key identifier enum-base [opt] ;
17978 GNU Extensions:
17979 enum-key attributes[opt] identifier [opt] enum-base [opt]
17980 { enumerator-list [opt] }attributes[opt]
17981 enum-key attributes[opt] identifier [opt] enum-base [opt]
17982 { enumerator-list, }attributes[opt] [C++0x]
17984 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17985 if the token stream isn't an enum-specifier after all. */
17987 static tree
17989 {
17990 tree identifier;
17992 tree prev_scope;
17994 tree attributes;
18007 /* Parse tentatively so that we can back up if we don't find a
18008 enum-specifier. */
18011 /* Caller guarantees that the current token is 'enum', an identifier
18012 possibly follows, and the token after that is an opening brace.
18013 If we don't have an identifier, fabricate an anonymous name for
18014 the enumeration being defined. */
18017 /* Parse the "class" or "struct", which indicates a scoped
18018 enumeration type in C++0x. */
18021 {
18025 /* Consume the `struct' or `class' token. */
18029 }
18033 /* Clear the qualification. */
18038 /* Figure out in what scope the declaration is being placed. */
18044 nested_name_specifier
18052 {
18053 tree name;
18057 enum_type,
18062 input_location);
18064 {
18067 {
18068 /* Are template enums allowed in ISO? */
18072 /* ignore a typename reference, for it will be solved by name
18073 in start_enum. */
18075 }
18076 }
18079 else
18080 {
18085 }
18086 }
18087 else
18088 {
18091 else
18092 {
18098 }
18099 }
18102 /* Check for the `:' that denotes a specified underlying type in C++0x.
18103 Note that a ':' could also indicate a bitfield width, however. */
18105 {
18106 cp_decl_specifier_seq type_specifiers;
18108 /* Consume the `:'. */
18111 /* Parse the type-specifier-seq. */
18116 /* At this point this is surely not elaborated type specifier. */
18125 /* If that didn't work, stop. */
18127 {
18133 }
18134 }
18136 /* Look for the `{' but don't consume it yet. */
18138 {
18140 {
18143 {
18146 }
18147 }
18148 /* An opaque-enum-specifier must have a ';' here. */
18151 {
18154 {
18157 }
18158 }
18159 }
18165 {
18167 {
18171 }
18173 {
18175 }
18176 }
18178 /* Issue an error message if type-definitions are forbidden here. */
18181 else
18182 /* Create the new type. We do this before consuming the opening
18183 brace so the enum will be recorded as being on the line of its
18184 tag (or the 'enum' keyword, if there is no tag). */
18188 /* If the next token is not '{' it is an opaque-enum-specifier or an
18189 elaborated-type-specifier. */
18191 {
18195 {
18196 /* The following catches invalid code such as:
18197 enum class S<int>::E { A, B, C }; */
18205 {
18209 nested_name_specifier);
18211 }
18214 {
18216 "%qT for enum declaration does not name a class "
18219 }
18220 /* If that scope does not contain the scope in which the
18221 class was originally declared, the program is invalid. */
18223 nested_name_specifier))
18224 {
18227 "declaration of %qD in namespace %qD which does not "
18230 else
18232 "declaration of %qD in %qD which does not "
18236 }
18237 /* If that scope is the scope where the declaration is being placed
18238 the program is invalid. */
18242 {
18246 }
18247 }
18252 /* Consume the opening brace. */
18253 matching_braces braces;
18260 {
18264 }
18265 else
18266 {
18272 }
18276 /* If the next token is not '}', then there are some enumerators. */
18278 {
18282 }
18283 else
18286 /* Consume the final '}'. */
18292 }
18293 else
18294 {
18295 /* If a ';' follows, then it is an opaque-enum-specifier
18296 and additional restrictions apply. */
18298 {
18305 }
18306 }
18308 /* Look for trailing attributes to apply to this enumeration, and
18309 apply them if appropriate. */
18311 {
18314 trailing_attr,
18316 }
18318 /* Finish up the enumeration. */
18320 {
18325 }
18328 {
18330 {
18333 }
18335 {
18337 }
18338 }
18339 out:
18342 }
18344 /* Parse an enumerator-list. The enumerators all have the indicated
18345 TYPE.
18347 enumerator-list:
18348 enumerator-definition
18349 enumerator-list , enumerator-definition */
18351 static void
18353 {
18355 {
18356 /* Parse an enumerator-definition. */
18359 /* If the next token is not a ',', we've reached the end of
18360 the list. */
18363 /* Otherwise, consume the `,' and keep going. */
18365 /* If the next token is a `}', there is a trailing comma. */
18367 {
18372 }
18373 }
18374 }
18376 /* Parse an enumerator-definition. The enumerator has the indicated
18377 TYPE.
18379 enumerator-definition:
18380 enumerator
18381 enumerator = constant-expression
18383 enumerator:
18384 identifier
18386 GNU Extensions:
18388 enumerator-definition:
18389 enumerator attributes [opt]
18390 enumerator attributes [opt] = constant-expression */
18392 static void
18394 {
18395 tree identifier;
18396 tree value;
18397 location_t loc;
18399 /* Save the input location because we are interested in the location
18400 of the identifier and not the location of the explicit value. */
18403 /* Look for the identifier. */
18408 /* Parse any specified attributes. */
18411 /* If the next token is an '=', then there is an explicit value. */
18413 {
18414 /* Consume the `=' token. */
18416 /* Parse the value. */
18418 }
18419 else
18422 /* If we are processing a template, make sure the initializer of the
18423 enumerator doesn't contain any bare template parameter pack. */
18427 /* Create the enumerator. */
18429 }
18431 /* Parse a namespace-name.
18433 namespace-name:
18434 original-namespace-name
18435 namespace-alias
18437 Returns the NAMESPACE_DECL for the namespace. */
18439 static tree
18441 {
18442 tree identifier;
18443 tree namespace_decl;
18447 /* Get the name of the namespace. */
18452 /* Look up the identifier in the currently active scope. Look only
18453 for namespaces, due to:
18455 [basic.lookup.udir]
18457 When looking up a namespace-name in a using-directive or alias
18458 definition, only namespace names are considered.
18460 And:
18462 [basic.lookup.qual]
18464 During the lookup of a name preceding the :: scope resolution
18465 operator, object, function, and enumerator names are ignored.
18467 (Note that cp_parser_qualifying_entity only calls this
18468 function if the token after the name is the scope resolution
18469 operator.) */
18471 none_type,
18477 /* If it's not a namespace, issue an error. */
18480 {
18482 {
18488 }
18491 }
18494 }
18496 /* Parse a namespace-definition.
18498 namespace-definition:
18499 named-namespace-definition
18500 unnamed-namespace-definition
18502 named-namespace-definition:
18503 original-namespace-definition
18504 extension-namespace-definition
18506 original-namespace-definition:
18507 namespace identifier { namespace-body }
18509 extension-namespace-definition:
18510 namespace original-namespace-name { namespace-body }
18512 unnamed-namespace-definition:
18513 namespace { namespace-body } */
18515 static void
18517 {
18518 tree identifier;
18527 {
18530 }
18532 /* Look for the `namespace' keyword. */
18533 cp_token* token
18536 /* Parse any specified attributes before the identifier. */
18540 {
18544 {
18547 /* Parse any attributes specified after the identifier. */
18549 }
18556 "nested namespace definitions only available with "
18559 /* Nested namespace names can create new namespaces (unlike
18560 other qualified-ids). */
18563 else
18566 }
18578 /* Start the namespace. */
18585 /* Look for the `{' to validate starting the namespace. */
18586 matching_braces braces;
18588 {
18589 /* Parse the body of the namespace. */
18592 /* Look for the final `}'. */
18594 }
18599 /* Pop the nested namespace definitions. */
18602 }
18604 /* Parse a namespace-body.
18606 namespace-body:
18607 declaration-seq [opt] */
18609 static void
18611 {
18613 }
18615 /* Parse a namespace-alias-definition.
18617 namespace-alias-definition:
18618 namespace identifier = qualified-namespace-specifier ; */
18620 static void
18622 {
18623 tree identifier;
18624 tree namespace_specifier;
18628 /* Look for the `namespace' keyword. */
18630 /* Look for the identifier. */
18634 /* Look for the `=' token. */
18637 {
18639 /* Skip the definition. */
18644 }
18646 /* Look for the qualified-namespace-specifier. */
18647 namespace_specifier
18649 /* Look for the `;' token. */
18652 /* Register the alias in the symbol table. */
18654 }
18656 /* Parse a qualified-namespace-specifier.
18658 qualified-namespace-specifier:
18659 :: [opt] nested-name-specifier [opt] namespace-name
18661 Returns a NAMESPACE_DECL corresponding to the specified
18662 namespace. */
18664 static tree
18666 {
18667 /* Look for the optional `::'. */
18671 /* Look for the optional nested-name-specifier. */
18679 }
18681 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18682 access declaration.
18684 using-declaration:
18685 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18686 using :: unqualified-id ;
18688 access-declaration:
18689 qualified-id ;
18691 */
18693 static bool
18696 {
18700 tree decl;
18701 tree identifier;
18702 tree qscope;
18707 {
18710 }
18711 else
18712 {
18713 /* Look for the `using' keyword. */
18716 again:
18717 /* Peek at the next token. */
18719 /* See if it's `typename'. */
18721 {
18722 /* Remember that we've seen it. */
18724 /* Consume the `typename' token. */
18726 }
18727 }
18729 /* Look for the optional global scope qualification. */
18730 global_scope_p
18735 /* If we saw `typename', or didn't see `::', then there must be a
18736 nested-name-specifier present. */
18738 {
18744 {
18747 }
18748 }
18749 /* Otherwise, we could be in either of the two productions. In that
18750 case, treat the nested-name-specifier as optional. */
18751 else
18763 /* Something has already gone wrong; there's no need to parse
18764 further. Since an error has occurred, the return value of
18765 cp_parser_parse_definitely will be false, as required. */
18769 /* Parse the unqualified-id. */
18777 {
18782 }
18784 {
18789 "pack expansion in using-declaration only available "
18792 }
18794 /* The function we call to handle a using-declaration is different
18795 depending on what scope we are in. */
18797 ;
18800 /* [namespace.udecl]
18802 A using declaration shall not name a template-id. */
18805 else
18806 {
18808 {
18809 /* Create the USING_DECL. */
18816 {
18819 }
18820 else
18821 /* Add it to the list of members in this class. */
18823 }
18824 else
18825 {
18827 identifier,
18834 {
18837 }
18840 else
18842 }
18843 }
18847 {
18851 "comma-separated list in using-declaration only available "
18854 }
18856 /* Look for the final `;'. */
18861 "access declarations are deprecated "
18862 "in favour of using-declarations; "
18866 }
18868 /* Parse an alias-declaration.
18870 alias-declaration:
18871 using identifier attribute-specifier-seq [opt] = type-id */
18873 static tree
18875 {
18877 location_t id_location;
18879 cp_decl_specifier_seq decl_specs;
18883 /* Look for the `using' keyword. */
18884 cp_token *using_token
18906 /* Now we are going to parse the type-id of the declaration. */
18908 /*
18909 [dcl.type]/3 says:
18911 "A type-specifier-seq shall not define a class or enumeration
18912 unless it appears in the type-id of an alias-declaration (7.1.3) that
18913 is not the declaration of a template-declaration."
18915 In other words, if we currently are in an alias template, the
18916 type-id should not define a type.
18918 So let's set parser->type_definition_forbidden_message in that
18919 case; cp_parser_check_type_definition (called by
18920 cp_parser_class_specifier) will then emit an error if a type is
18921 defined in the type-id. */
18923 {
18927 }
18931 /* Restore the error message if need be. */
18937 {
18940 }
18942 /* A typedef-name can also be introduced by an alias-declaration. The
18943 identifier following the using keyword becomes a typedef-name. It has
18944 the same semantics as if it were introduced by the typedef
18945 specifier. In particular, it does not define a new type and it shall
18946 not appear in the type-id. */
18951 {
18954 ds_attribute,
18955 attrs_token);
18956 }
18958 ds_typedef,
18959 using_token);
18961 ds_alias,
18962 using_token);
18971 else
18977 // Attach constraints to the alias declaration.
18979 {
18983 }
18990 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18991 added into the symbol table; otherwise, return the TYPE_DECL. */
18995 {
18999 }
19002 }
19004 /* Parse a using-directive.
19006 using-directive:
19007 using namespace :: [opt] nested-name-specifier [opt]
19008 namespace-name ; */
19010 static void
19012 {
19013 tree namespace_decl;
19014 tree attribs;
19016 /* Look for the `using' keyword. */
19018 /* And the `namespace' keyword. */
19020 /* Look for the optional `::' operator. */
19022 /* And the optional nested-name-specifier. */
19028 /* Get the namespace being used. */
19030 /* And any specified attributes. */
19033 /* Update the symbol table. */
19036 else
19039 /* Look for the final `;'. */
19041 }
19043 /* Parse an asm-definition.
19045 asm-definition:
19046 asm ( string-literal ) ;
19048 GNU Extension:
19050 asm-definition:
19051 asm volatile [opt] ( string-literal ) ;
19052 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19053 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19054 : asm-operand-list [opt] ) ;
19055 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19056 : asm-operand-list [opt]
19057 : asm-clobber-list [opt] ) ;
19058 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19059 : asm-clobber-list [opt]
19060 : asm-goto-list ) ; */
19062 static void
19064 {
19065 tree string;
19070 tree asm_stmt;
19078 /* Look for the `asm' keyword. */
19083 {
19086 }
19088 /* See if the next token is `volatile'. */
19091 {
19092 /* Remember that we saw the `volatile' keyword. */
19094 /* Consume the token. */
19096 }
19100 {
19101 /* Remember that we saw the `goto' keyword. */
19103 /* Consume the token. */
19105 }
19106 /* Look for the opening `('. */
19109 /* Look for the string. */
19112 {
19116 }
19118 /* If we're allowing GNU extensions, check for the extended assembly
19119 syntax. Unfortunately, the `:' tokens need not be separated by
19120 a space in C, and so, for compatibility, we tolerate that here
19121 too. Doing that means that we have to treat the `::' operator as
19122 two `:' tokens. */
19127 {
19132 /* The extended syntax was used. */
19135 /* Look for outputs. */
19137 {
19138 /* Consume the `:'. */
19140 /* Parse the output-operands. */
19142 CPP_COLON)
19144 CPP_SCOPE)
19146 CPP_CLOSE_PAREN)
19148 {
19152 }
19153 }
19154 /* If the next token is `::', there are no outputs, and the
19155 next token is the beginning of the inputs. */
19157 /* The inputs are coming next. */
19160 /* Look for inputs. */
19163 {
19164 /* Consume the `:' or `::'. */
19166 /* Parse the output-operands. */
19168 CPP_COLON)
19170 CPP_SCOPE)
19172 CPP_CLOSE_PAREN))
19173 {
19177 }
19178 }
19180 /* The clobbers are coming next. */
19183 /* Look for clobbers. */
19186 {
19188 /* Consume the `:' or `::'. */
19190 /* Parse the clobbers. */
19192 CPP_COLON)
19194 CPP_CLOSE_PAREN))
19196 }
19199 /* The labels are coming next. */
19202 /* Look for labels. */
19205 {
19207 /* Consume the `:' or `::'. */
19209 /* Parse the labels. */
19211 }
19215 }
19219 /* Look for the closing `)'. */
19227 {
19228 /* Create the ASM_EXPR. */
19230 {
19233 /* If the extended syntax was not used, mark the ASM_EXPR. */
19235 {
19241 }
19242 }
19243 else
19245 }
19246 }
19248 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19249 type that comes from the decl-specifier-seq. */
19251 static tree
19253 {
19256 {
19269 }
19272 }
19274 /* Declarators [gram.dcl.decl] */
19276 /* Parse an init-declarator.
19278 init-declarator:
19279 declarator initializer [opt]
19281 GNU Extension:
19283 init-declarator:
19284 declarator asm-specification [opt] attributes [opt] initializer [opt]
19286 function-definition:
19287 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19288 function-body
19289 decl-specifier-seq [opt] declarator function-try-block
19291 GNU Extension:
19293 function-definition:
19294 __extension__ function-definition
19296 TM Extension:
19298 function-definition:
19299 decl-specifier-seq [opt] declarator function-transaction-block
19301 The DECL_SPECIFIERS apply to this declarator. Returns a
19302 representation of the entity declared. If MEMBER_P is TRUE, then
19303 this declarator appears in a class scope. The new DECL created by
19304 this declarator is returned.
19306 The CHECKS are access checks that should be performed once we know
19307 what entity is being declared (and, therefore, what classes have
19308 befriended it).
19310 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19311 for a function-definition here as well. If the declarator is a
19312 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19313 be TRUE upon return. By that point, the function-definition will
19314 have been completely parsed.
19316 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19317 is FALSE.
19319 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19320 parsed declaration if it is an uninitialized single declarator not followed
19321 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19322 if present, will not be consumed. If returned, this declarator will be
19323 created with SD_INITIALIZED but will not call cp_finish_decl.
19325 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19326 and there is an initializer, the pointed location_t is set to the
19327 location of the '=' or `(', or '{' in C++11 token introducing the
19328 initializer. */
19330 static tree
19341 {
19345 tree prefix_attributes;
19347 tree asm_specification;
19348 tree initializer;
19350 tree scope;
19352 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19353 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19354 "(...)". */
19365 /* Gather the attributes that were provided with the
19366 decl-specifiers. */
19369 /* Assume that this is not the declarator for a function
19370 definition. */
19374 /* Default arguments are only permitted for function parameters. */
19378 /* Defer access checks while parsing the declarator; we cannot know
19379 what names are accessible until we know what is being
19380 declared. */
19385 /* Parse the declarator. */
19386 declarator
19391 /* Gather up the deferred checks. */
19396 /* If the DECLARATOR was erroneous, there's no need to go
19397 further. */
19401 /* Check that the number of template-parameter-lists is OK. */
19411 /* Figure out what scope the entity declared by the DECLARATOR is
19412 located in. `grokdeclarator' sometimes changes the scope, so
19413 we compute it now. */
19416 /* Perform any lookups in the declared type which were thought to be
19417 dependent, but are not in the scope of the declarator. */
19418 decl_specifiers->type
19421 /* If we're allowing GNU extensions, look for an
19422 asm-specification. */
19424 {
19425 /* Look for an asm-specification. */
19428 }
19429 else
19432 /* Look for attributes. */
19436 /* Peek at the next token. */
19442 {
19443 /* Handle C++17 deduction guides. */
19447 {
19455 {
19459 }
19460 }
19462 /* Check to see if the token indicates the start of a
19463 function-definition. */
19465 {
19467 {
19468 /* If a function-definition should not appear here, issue an
19469 error message. */
19473 }
19475 location_t func_brace_location
19478 /* Neither attributes nor an asm-specification are allowed
19479 on a function-definition. */
19482 "an asm-specification is not allowed "
19486 "attributes are not allowed "
19488 /* This is a function-definition. */
19491 /* Parse the function definition. */
19494 decl_specifiers,
19495 declarator,
19496 prefix_attributes);
19497 else
19498 decl =
19499 (cp_parser_function_definition_from_specifiers_and_declarator
19503 {
19504 /* This is where the prologue starts... */
19507 }
19510 }
19511 }
19513 {
19514 /* A non-template declaration involving a function parameter list
19515 containing an implicit template parameter will be made into a
19516 template. If the resulting declaration is not going to be an
19517 actual function then finish the template scope here to prevent it.
19518 An error message will be issued once we have a decl to talk about.
19520 FIXME probably we should do type deduction rather than create an
19521 implicit template, but the standard currently doesn't allow it. */
19524 }
19526 /* [dcl.dcl]
19528 Only in function declarations for constructors, destructors, type
19529 conversions, and deduction guides can the decl-specifier-seq be omitted.
19531 We explicitly postpone this check past the point where we handle
19532 function-definitions because we tolerate function-definitions
19533 that are missing their return types in some modes. */
19535 {
19539 }
19541 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19545 {
19556 {
19562 }
19563 }
19564 else
19565 {
19566 /* If the init-declarator isn't initialized and isn't followed by a
19567 `,' or `;', it's not a valid init-declarator. */
19570 {
19573 else
19574 {
19578 }
19579 }
19582 }
19584 /* Because start_decl has side-effects, we should only call it if we
19585 know we're going ahead. By this point, we know that we cannot
19586 possibly be looking at any other construct. */
19589 /* Enter the newly declared entry in the symbol table. If we're
19590 processing a declaration in a class-specifier, we wait until
19591 after processing the initializer. */
19593 {
19601 /* Adjust location of decl if declarator->id_loc is more appropriate:
19602 set, and decl wasn't merged with another decl, in which case its
19603 location would be different from input_location, and more accurate. */
19608 }
19610 /* Enter the SCOPE. That way unqualified names appearing in the
19611 initializer will be looked up in SCOPE. */
19614 /* Perform deferred access control checks, now that we know in which
19615 SCOPE the declared entity resides. */
19617 {
19620 /* If the entity being declared is a function, pretend that we
19621 are in its scope. If it is a `friend', it may have access to
19622 things that would not otherwise be accessible. */
19624 {
19627 }
19629 /* Perform access checks for template parameters. */
19632 /* Perform the access control checks for the declarator and the
19633 decl-specifiers. */
19636 /* Restore the saved value. */
19639 }
19641 /* Parse the initializer. */
19646 {
19648 {
19651 else
19652 {
19653 /* If the declaration was erroneous, we don't really
19654 know what the user intended, so just silently
19655 consume the initializer. */
19662 }
19663 }
19664 else
19665 {
19666 /* We want to record the extra mangling scope for in-class
19667 initializers of class members and initializers of static data
19668 member templates. The former involves deferring
19669 parsing of the initializer until end of class as with default
19670 arguments. So right here we only handle the latter. */
19680 }
19681 }
19683 /* The old parser allows attributes to appear after a parenthesized
19684 initializer. Mark Mitchell proposed removing this functionality
19685 on the GCC mailing lists on 2002-08-13. This parser accepts the
19686 attributes -- but ignores them. */
19693 /* And now complain about a non-function implicit template. */
19698 /* For an in-class declaration, use `grokfield' to create the
19699 declaration. */
19701 {
19703 {
19706 }
19715 }
19717 /* Finish processing the declaration. But, skip member
19718 declarations. */
19720 {
19723 asm_specification,
19724 /* If the initializer is in parentheses, then this is
19725 a direct-initialization, which means that an
19726 `explicit' constructor is OK. Otherwise, an
19727 `explicit' constructor cannot be used. */
19730 }
19733 /* Core issue #226 (C++0x only): A default template-argument
19734 shall not be specified in a friend class template
19735 declaration. */
19744 {
19747 else
19749 }
19756 }
19758 /* Parse a declarator.
19760 declarator:
19761 direct-declarator
19762 ptr-operator declarator
19764 abstract-declarator:
19765 ptr-operator abstract-declarator [opt]
19766 direct-abstract-declarator
19768 GNU Extensions:
19770 declarator:
19771 attributes [opt] direct-declarator
19772 attributes [opt] ptr-operator declarator
19774 abstract-declarator:
19775 attributes [opt] ptr-operator abstract-declarator [opt]
19776 attributes [opt] direct-abstract-declarator
19778 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19779 detect constructors, destructors, deduction guides, or conversion operators.
19780 It is set to -1 if the declarator is a name, and +1 if it is a
19781 function. Otherwise it is set to zero. Usually you just want to
19782 test for >0, but internally the negative value is used.
19784 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19785 a decl-specifier-seq unless it declares a constructor, destructor,
19786 or conversion. It might seem that we could check this condition in
19787 semantic analysis, rather than parsing, but that makes it difficult
19788 to handle something like `f()'. We want to notice that there are
19789 no decl-specifiers, and therefore realize that this is an
19790 expression, not a declaration.)
19792 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19793 the declarator is a direct-declarator of the form "(...)".
19795 MEMBER_P is true iff this declarator is a member-declarator.
19797 FRIEND_P is true iff this declarator is a friend. */
19801 cp_parser_declarator_kind dcl_kind,
19805 {
19808 cp_cv_quals cv_quals;
19809 tree class_type;
19812 /* Assume this is not a constructor, destructor, or type-conversion
19813 operator. */
19820 /* Check for the ptr-operator production. */
19822 /* Parse the ptr-operator. */
19828 /* If that worked, then we have a ptr-operator. */
19830 {
19831 /* If a ptr-operator was found, then this declarator was not
19832 parenthesized. */
19835 /* The dependent declarator is optional if we are parsing an
19836 abstract-declarator. */
19840 /* Parse the dependent declarator. */
19845 friend_p);
19847 /* If we are parsing an abstract-declarator, we must handle the
19848 case where the dependent declarator is absent. */
19853 declarator = cp_parser_make_indirect_declarator
19855 }
19856 /* Everything else is a direct-declarator. */
19857 else
19858 {
19861 CPP_OPEN_PAREN);
19863 ctor_dtor_or_conv_p,
19865 }
19870 }
19872 /* Parse a direct-declarator or direct-abstract-declarator.
19874 direct-declarator:
19875 declarator-id
19876 direct-declarator ( parameter-declaration-clause )
19877 cv-qualifier-seq [opt]
19878 ref-qualifier [opt]
19879 exception-specification [opt]
19880 direct-declarator [ constant-expression [opt] ]
19881 ( declarator )
19883 direct-abstract-declarator:
19884 direct-abstract-declarator [opt]
19885 ( parameter-declaration-clause )
19886 cv-qualifier-seq [opt]
19887 ref-qualifier [opt]
19888 exception-specification [opt]
19889 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19890 ( abstract-declarator )
19892 Returns a representation of the declarator. DCL_KIND is
19893 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19894 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19895 we are parsing a direct-declarator. It is
19896 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19897 of ambiguity we prefer an abstract declarator, as per
19898 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19899 as for cp_parser_declarator. */
19903 cp_parser_declarator_kind dcl_kind,
19906 {
19917 {
19918 /* Peek at the next token. */
19921 {
19922 /* This is either a parameter-declaration-clause, or a
19923 parenthesized declarator. When we know we are parsing a
19924 named declarator, it must be a parenthesized declarator
19925 if FIRST is true. For instance, `(int)' is a
19926 parameter-declaration-clause, with an omitted
19927 direct-abstract-declarator. But `((*))', is a
19928 parenthesized abstract declarator. Finally, when T is a
19929 template parameter `(T)' is a
19930 parameter-declaration-clause, and not a parenthesized
19931 named declarator.
19933 We first try and parse a parameter-declaration-clause,
19934 and then try a nested declarator (if FIRST is true).
19936 It is not an error for it not to be a
19937 parameter-declaration-clause, even when FIRST is
19938 false. Consider,
19940 int i (int);
19941 int i (3);
19943 The first is the declaration of a function while the
19944 second is the definition of a variable, including its
19945 initializer.
19947 Having seen only the parenthesis, we cannot know which of
19948 these two alternatives should be selected. Even more
19949 complex are examples like:
19951 int i (int (a));
19952 int i (int (3));
19954 The former is a function-declaration; the latter is a
19955 variable initialization.
19957 Thus again, we try a parameter-declaration-clause, and if
19958 that fails, we back out and return. */
19961 {
19962 tree params;
19967 /* In a member-declarator, the only valid interpretation
19968 of a parenthesis is the start of a
19969 parameter-declaration-clause. (It is invalid to
19970 initialize a static data member with a parenthesized
19971 initializer; only the "=" form of initialization is
19972 permitted.) */
19976 /* Consume the `('. */
19977 matching_parens parens;
19980 {
19981 /* If this is going to be an abstract declarator, we're
19982 in a declarator and we can't have default args. */
19985 }
19989 /* Parse the parameter-declaration-clause. */
19992 /* Consume the `)'. */
19995 /* If all went well, parse the cv-qualifier-seq,
19996 ref-qualifier and the exception-specification. */
19998 {
19999 cp_cv_quals cv_quals;
20000 cp_virt_specifiers virt_specifiers;
20001 cp_ref_qualifier ref_qual;
20002 tree exception_specification;
20003 tree late_return;
20004 tree attrs;
20014 /* Parse the cv-qualifier-seq. */
20016 /* Parse the ref-qualifier. */
20018 /* Parse the tx-qualifier. */
20020 /* And the exception-specification. */
20021 exception_specification
20026 /* In here, we handle cases where attribute is used after
20027 the function declaration. For example:
20028 void func (int x) __attribute__((vector(..))); */
20031 late_return = (cp_parser_late_return_type_opt
20035 /* Parse the virt-specifier-seq. */
20038 /* Create the function-declarator. */
20040 params,
20041 cv_quals,
20042 virt_specifiers,
20043 ref_qual,
20044 tx_qual,
20045 exception_specification,
20046 late_return,
20047 requires_clause);
20050 /* Any subsequent parameter lists are to do with
20051 return type, so are not those of the declared
20052 function. */
20054 }
20056 /* Remove the function parms from scope. */
20060 /* Repeat the main loop. */
20062 }
20064 /* If this is the first, we can try a parenthesized
20065 declarator. */
20067 {
20074 /* Consume the `('. */
20075 matching_parens parens;
20077 /* Parse the nested declarator. */
20080 declarator
20086 /* Expect a `)'. */
20094 }
20095 /* Otherwise, we must be done. */
20096 else
20098 }
20102 {
20103 /* Parse an array-declarator. */
20113 /* Consume the `['. */
20115 /* Peek at the next token. */
20117 /* If the next token is `]', then there is no
20118 constant-expression. */
20120 {
20122 bounds
20132 {
20133 /* Normally, the array bound must be an integral constant
20134 expression. However, as an extension, we allow VLAs
20135 in function scopes as long as they aren't part of a
20136 parameter declaration. */
20140 }
20143 {
20144 /* Remember this wasn't a constant-expression. */
20147 }
20148 }
20149 else
20151 /* Look for the closing `]'. */
20153 {
20156 }
20161 }
20163 {
20164 {
20165 tree qualifying_scope;
20166 tree unqualified_name;
20167 tree attrs;
20168 special_function_kind sfk;
20173 /* Parse a declarator-id */
20176 {
20179 /* If we see an ellipsis, we should be looking at a
20180 parameter pack. */
20182 {
20183 /* Consume the `...' */
20187 }
20188 }
20191 unqualified_name
20195 {
20199 {
20200 /* Check whether an error occurred. */
20203 /* We already consumed the ellipsis to mark a
20204 parameter pack, but we have no way to report it,
20205 so abort the tentative parse. We will be exiting
20206 immediately anyway. */
20208 }
20209 else
20215 && (qualifying_scope
20217 {
20220 }
20221 }
20226 {
20231 }
20237 {
20238 /* In the declaration of a member of a template class
20239 outside of the class itself, the SCOPE will sometimes
20240 be a TYPENAME_TYPE. For example, given:
20242 template <typename T>
20243 int S<T>::R::i = 3;
20245 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20246 this context, we must resolve S<T>::R to an ordinary
20247 type, rather than a typename type.
20249 The reason we normally avoid resolving TYPENAME_TYPEs
20250 is that a specialization of `S' might render
20251 `S<T>::R' not a type. However, if `S' is
20252 specialized, then this `i' will not be used, so there
20253 is no harm in resolving the types here. */
20254 tree type;
20256 /* Resolve the TYPENAME_TYPE. */
20259 /* If that failed, the declarator is invalid. */
20261 {
20264 "cannot define member of dependent typedef "
20266 else
20271 }
20273 }
20278 {
20279 tree class_type;
20284 else
20288 {
20292 {
20293 /* We do not attempt to print the declarator
20294 here because we do not have enough
20295 information about its original syntactic
20296 form. */
20300 }
20303 {
20307 "use %<%T::%D%> instead of %<%T::%D%> to "
20309 class_type,
20314 }
20316 }
20319 {
20326 for an unnamed type, even if the type
20327 got a name for linkage purposes. */
20329 /* Handle correctly (c++/19200):
20331 struct S {
20332 struct T{};
20333 friend void S(T);
20334 };
20336 and also:
20338 namespace N {
20339 void S();
20340 }
20342 struct S {
20343 friend void N::S();
20344 }; */
20347 class_type))
20356 }
20357 }
20359 unqualified_name,
20360 sfk);
20367 }
20369 handle_declarator:;
20372 {
20373 /* Any names that appear after the declarator-id for a
20374 member are looked up in the containing scope. */
20376 {
20377 /* But declarations with qualified-ids can't appear in a
20378 function. */
20382 }
20384 }
20388 /* Default args are only allowed on function
20389 declarations. */
20391 else
20395 }
20396 /* We're done. */
20397 else
20399 }
20401 /* For an abstract declarator, we might wind up with nothing at this
20402 point. That's an error; the declarator is not optional. */
20406 {
20407 /* Record overly parenthesized declarator so we can give a
20408 diagnostic about confusing decl/expr disambiguation. */
20410 {
20411 /* If the open and close parens are on different lines, this
20412 is probably a formatting thing, so ignore. */
20417 }
20420 }
20422 /* If we entered a scope, we must exit it now. */
20430 }
20432 /* Parse a ptr-operator.
20434 ptr-operator:
20435 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20436 * cv-qualifier-seq [opt]
20437 &
20438 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20439 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20441 GNU Extension:
20443 ptr-operator:
20444 & cv-qualifier-seq [opt]
20446 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20447 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20448 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20449 filled in with the TYPE containing the member. *CV_QUALS is
20450 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20451 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20452 Note that the tree codes returned by this function have nothing
20453 to do with the types of trees that will be eventually be created
20454 to represent the pointer or reference type being parsed. They are
20455 just constants with suggestive names. */
20456 static enum tree_code
20461 {
20466 /* Assume that it's not a pointer-to-member. */
20468 /* And that there are no cv-qualifiers. */
20471 /* Peek at the next token. */
20474 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20484 {
20485 /* Consume the `*', `&' or `&&'. */
20488 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20489 `&', if we are allowing GNU extensions. (The only qualifier
20490 that can legally appear after `&' is `restrict', but that is
20491 enforced during semantic analysis. */
20499 }
20500 else
20501 {
20502 /* Try the pointer-to-member case. */
20504 /* Look for the optional `::' operator. */
20507 /* Look for the nested-name specifier. */
20514 /* If we found it, and the next token is a `*', then we are
20515 indeed looking at a pointer-to-member operator. */
20518 {
20519 /* Indicate that the `*' operator was used. */
20527 else
20528 {
20529 /* The type of which the member is a member is given by the
20530 current SCOPE. */
20532 /* The next name will not be qualified. */
20536 /* Look for optional c++11 attributes. */
20540 /* Look for the optional cv-qualifier-seq. */
20542 }
20543 }
20544 /* If that didn't work we don't have a ptr-operator. */
20547 }
20550 }
20552 /* Parse an (optional) cv-qualifier-seq.
20554 cv-qualifier-seq:
20555 cv-qualifier cv-qualifier-seq [opt]
20557 cv-qualifier:
20558 const
20559 volatile
20561 GNU Extension:
20563 cv-qualifier:
20564 __restrict__
20566 Returns a bitmask representing the cv-qualifiers. */
20568 static cp_cv_quals
20570 {
20574 {
20576 cp_cv_quals cv_qualifier;
20578 /* Peek at the next token. */
20580 /* See if it's a cv-qualifier. */
20582 {
20598 }
20604 {
20609 }
20610 else
20611 {
20614 }
20615 }
20618 }
20620 /* Parse an (optional) ref-qualifier
20622 ref-qualifier:
20623 &
20624 &&
20626 Returns cp_ref_qualifier representing ref-qualifier. */
20628 static cp_ref_qualifier
20630 {
20633 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20638 {
20643 {
20655 }
20660 {
20663 }
20664 else
20665 {
20668 }
20669 }
20672 }
20674 /* Parse an optional tx-qualifier.
20676 tx-qualifier:
20677 transaction_safe
20678 transaction_safe_dynamic */
20680 static tree
20682 {
20685 {
20690 {
20694 {
20697 {
20700 }
20701 else
20703 }
20704 }
20705 }
20707 }
20709 /* Parse an (optional) virt-specifier-seq.
20711 virt-specifier-seq:
20712 virt-specifier virt-specifier-seq [opt]
20714 virt-specifier:
20715 override
20716 final
20718 Returns a bitmask representing the virt-specifiers. */
20720 static cp_virt_specifiers
20722 {
20726 {
20728 cp_virt_specifiers virt_specifier;
20730 /* Peek at the next token. */
20732 /* See if it's a virt-specifier-qualifier. */
20736 {
20739 }
20741 {
20744 }
20746 {
20748 }
20749 else
20753 {
20758 }
20759 else
20760 {
20763 }
20764 }
20766 }
20768 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20769 is in scope even though it isn't real. */
20771 void
20773 {
20774 tree this_parm;
20777 {
20778 /* We don't clear this between NSDMIs. Is it already what we want? */
20785 }
20788 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20790 current_class_ref
20793 }
20795 /* Return true iff our current scope is a non-static data member
20796 initializer. */
20798 bool
20800 {
20801 /* We recognize NSDMI context by the context-less 'this' pointer set up
20802 by the function above. */
20808 }
20810 /* Parse a late-specified return type, if any. This is not a separate
20811 non-terminal, but part of a function declarator, which looks like
20813 -> trailing-type-specifier-seq abstract-declarator(opt)
20815 Returns the type indicated by the type-id.
20817 In addition to this, parse any queued up #pragma omp declare simd
20818 clauses, and #pragma acc routine clauses.
20820 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20821 function. */
20823 static tree
20826 {
20830 && declarator
20834 && declarator
20837 /* Peek at the next token. */
20839 /* A late-specified return type is indicated by an initial '->'. */
20850 {
20851 /* DR 1207: 'this' is in scope in the trailing return type. */
20853 }
20856 {
20857 /* Consume the ->. */
20861 }
20863 /* Function declarations may be followed by a trailing
20864 requires-clause. */
20868 declarator->attributes
20872 declarator->attributes
20877 {
20880 }
20883 }
20885 /* Parse a declarator-id.
20887 declarator-id:
20888 id-expression
20889 :: [opt] nested-name-specifier [opt] type-name
20891 In the `id-expression' case, the value returned is as for
20892 cp_parser_id_expression if the id-expression was an unqualified-id.
20893 If the id-expression was a qualified-id, then a SCOPE_REF is
20894 returned. The first operand is the scope (either a NAMESPACE_DECL
20895 or TREE_TYPE), but the second is still just a representation of an
20896 unqualified-id. */
20898 static tree
20900 {
20901 tree id;
20902 /* The expression must be an id-expression. Assume that qualified
20903 names are the names of types so that:
20905 template <class T>
20906 int S<T>::R::i = 3;
20908 will work; we must treat `S<T>::R' as the name of a type.
20909 Similarly, assume that qualified names are templates, where
20910 required, so that:
20912 template <class T>
20913 int S<T>::R<T>::i = 3;
20915 will work, too. */
20921 optional_p);
20925 }
20927 /* Parse a type-id.
20929 type-id:
20930 type-specifier-seq abstract-declarator [opt]
20932 Returns the TYPE specified. */
20934 static tree
20937 {
20938 cp_decl_specifier_seq type_specifier_seq;
20941 /* Parse the type-specifier-seq. */
20943 is_trailing_return,
20948 /* A bare template name as a template argument is a template template
20949 argument, not a placeholder, so fail parsing it as a type argument. */
20950 {
20954 }
20958 /* There might or might not be an abstract declarator. */
20960 /* Look for the declarator. */
20961 abstract_declarator
20966 /* Check to see if there really was a declarator. */
20971 /* The concepts TS allows 'auto' as a type-id. */
20973 /* None of the valid uses of 'auto' in C++14 involve the type-id
20974 nonterminal, but it is valid in a trailing-return-type. */
20977 {
20978 /* A type-id with type 'auto' is only ok if the abstract declarator
20979 is a function declarator with a late-specified return type.
20981 A type-id with 'auto' is also valid in a trailing-return-type
20982 in a compound-requirement. */
20989 else
20990 {
20993 {
20995 auto_node);
20997 tmpl);
20998 }
20999 else
21002 }
21003 }
21006 is_template_arg);
21007 }
21009 static tree
21011 {
21013 }
21015 static tree
21017 {
21018 tree r;
21020 parser->type_definition_forbidden_message
21025 {
21028 }
21030 }
21032 static tree
21034 {
21036 }
21038 /* Parse a type-specifier-seq.
21040 type-specifier-seq:
21041 type-specifier type-specifier-seq [opt]
21043 GNU extension:
21045 type-specifier-seq:
21046 attributes type-specifier-seq [opt]
21048 If IS_DECLARATION is true, we are at the start of a "condition" or
21049 exception-declaration, so we might be followed by a declarator-id.
21051 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21052 i.e. we've just seen "->".
21054 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21056 static void
21061 {
21066 /* Clear the TYPE_SPECIFIER_SEQ. */
21069 /* In the context of a trailing return type, enum E { } is an
21070 elaborated-type-specifier followed by a function-body, not an
21071 enum-specifier. */
21075 /* Parse the type-specifiers and attributes. */
21077 {
21078 tree type_specifier;
21081 /* Check for attributes first. */
21083 {
21084 type_specifier_seq->attributes
21088 }
21090 /* record the token of the beginning of the type specifier seq,
21091 for error reporting purposes*/
21095 /* Look for the type-specifier. */
21097 flags,
21098 type_specifier_seq,
21100 NULL,
21103 {
21104 /* If the first type-specifier could not be found, this is not a
21105 type-specifier-seq at all. */
21107 {
21108 /* Set in_declarator_p to avoid skipping to the semicolon. */
21120 }
21121 /* If subsequent type-specifiers could not be found, the
21122 type-specifier-seq is complete. */
21124 }
21127 /* The standard says that a condition can be:
21129 type-specifier-seq declarator = assignment-expression
21131 However, given:
21133 struct S {};
21134 if (int S = ...)
21136 we should treat the "S" as a declarator, not as a
21137 type-specifier. The standard doesn't say that explicitly for
21138 type-specifier-seq, but it does say that for
21139 decl-specifier-seq in an ordinary declaration. Perhaps it
21140 would be clearer just to allow a decl-specifier-seq here, and
21141 then add a semantic restriction that if any decl-specifiers
21142 that are not type-specifiers appear, the program is invalid. */
21145 }
21146 }
21148 /* Return whether the function currently being declared has an associated
21149 template parameter list. */
21151 static bool
21153 {
21166 }
21168 /* Parse a parameter-declaration-clause.
21170 parameter-declaration-clause:
21171 parameter-declaration-list [opt] ... [opt]
21172 parameter-declaration-list , ...
21174 Returns a representation for the parameter declarations. A return
21175 value of NULL indicates a parameter-declaration-clause consisting
21176 only of an ellipsis. */
21178 static tree
21180 {
21181 tree parameters;
21190 parser->auto_is_implicit_function_template_parm_p
21192 }
21198 && !processing_template_parmlist
21204 /* Peek at the next token. */
21206 /* Check for trivial parameter-declaration-clauses. */
21208 {
21209 /* Consume the `...' token. */
21212 }
21214 /* There are no parameters. */
21215 {
21216 #ifndef NO_IMPLICIT_EXTERN_C
21221 else
21222 #endif
21224 }
21225 /* Check for `(void)', too, which is a special case. */
21229 {
21230 /* Consume the `void' token. */
21232 /* There are no parameters. */
21234 }
21236 /* Parse the parameter-declaration-list. */
21238 /* If a parse error occurred while parsing the
21239 parameter-declaration-list, then the entire
21240 parameter-declaration-clause is erroneous. */
21244 /* Peek at the next token. */
21246 /* If it's a `,', the clause should terminate with an ellipsis. */
21248 {
21249 /* Consume the `,'. */
21251 /* Expect an ellipsis. */
21252 ellipsis_p
21254 }
21255 /* It might also be `...' if the optional trailing `,' was
21256 omitted. */
21258 {
21259 /* Consume the `...' token. */
21261 /* And remember that we saw it. */
21263 }
21264 else
21267 /* Finish the parameter list. */
21272 }
21274 /* Parse a parameter-declaration-list.
21276 parameter-declaration-list:
21277 parameter-declaration
21278 parameter-declaration-list , parameter-declaration
21280 Returns a representation of the parameter-declaration-list, as for
21281 cp_parser_parameter_declaration_clause. However, the
21282 `void_list_node' is never appended to the list. Upon return,
21283 *IS_ERROR will be true iff an error occurred. */
21285 static tree
21287 {
21293 /* Assume all will go well. */
21295 /* The special considerations that apply to a function within an
21296 unbraced linkage specifications do not apply to the parameters
21297 to the function. */
21298 saved_in_unbraced_linkage_specification_p
21302 /* Look for more parameters. */
21304 {
21312 /* Parse the parameter. */
21313 parameter
21318 /* We don't know yet if the enclosing context is deprecated, so wait
21319 and warn in grokparms if appropriate. */
21323 {
21324 /* If a function parameter pack was specified and an implicit template
21325 parameter was introduced during cp_parser_parameter_declaration,
21326 change any implicit parameters introduced into packs. */
21330 {
21338 }
21342 PARM,
21347 }
21351 /* If a parse error occurred parsing the parameter declaration,
21352 then the entire parameter-declaration-list is erroneous. */
21354 {
21358 }
21368 {
21372 }
21374 /* Add the new parameter to the list. */
21378 /* Peek at the next token. */
21381 /* These are for Objective-C++ */
21384 /* The parameter-declaration-list is complete. */
21387 {
21390 /* Peek at the next token. */
21392 /* If it's an ellipsis, then the list is complete. */
21395 /* Otherwise, there must be more parameters. Consume the
21396 `,'. */
21398 /* When parsing something like:
21400 int i(float f, double d)
21402 we can tell after seeing the declaration for "f" that we
21403 are not looking at an initialization of a variable "i",
21404 but rather at the declaration of a function "i".
21406 Due to the fact that the parsing of template arguments
21407 (as specified to a template-id) requires backtracking we
21408 cannot use this technique when inside a template argument
21409 list. */
21413 /* However, a parameter-declaration of the form
21414 "float(f)" (which is a valid declaration of a
21415 parameter "f") can also be interpreted as an
21416 expression (the conversion of "f" to "float"). */
21419 }
21420 else
21421 {
21429 }
21430 }
21432 parser->in_unbraced_linkage_specification_p
21435 /* Reset implicit_template_scope if we are about to leave the function
21436 parameter list that introduced it. Note that for out-of-line member
21437 definitions, there will be one or more class scopes before we get to
21438 the template parameter scope. */
21442 {
21446 {
21449 }
21450 }
21453 }
21455 /* Parse a parameter declaration.
21457 parameter-declaration:
21458 decl-specifier-seq ... [opt] declarator
21459 decl-specifier-seq declarator = assignment-expression
21460 decl-specifier-seq ... [opt] abstract-declarator [opt]
21461 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21463 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21464 declares a template parameter. (In that case, a non-nested `>'
21465 token encountered during the parsing of the assignment-expression
21466 is not interpreted as a greater-than operator.)
21468 Returns a representation of the parameter, or NULL if an error
21469 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21470 true iff the declarator is of the form "(p)". */
21476 {
21478 cp_decl_specifier_seq decl_specifiers;
21480 tree default_argument;
21485 /* In a template parameter, `>' is not an operator.
21487 [temp.param]
21489 When parsing a default template-argument for a non-type
21490 template-parameter, the first non-nested `>' is taken as the end
21491 of the template parameter-list rather than a greater-than
21492 operator. */
21494 /* Type definitions may not appear in parameter types. */
21496 parser->type_definition_forbidden_message
21499 /* Parse the declaration-specifiers. */
21502 CP_PARSER_FLAGS_NONE,
21506 /* Complain about missing 'typename' or other invalid type names. */
21511 /* If an error occurred, there's no reason to attempt to parse the
21512 rest of the declaration. */
21514 {
21517 }
21519 /* Peek at the next token. */
21522 /* If the next token is a `)', `,', `=', `>', or `...', then there
21523 is no declarator. However, when variadic templates are enabled,
21524 there may be a declarator following `...'. */
21529 {
21533 }
21534 /* Otherwise, there should be a declarator. */
21535 else
21536 {
21540 /* After seeing a decl-specifier-seq, if the next token is not a
21541 "(", there is no possibility that the code is a valid
21542 expression. Therefore, if parsing tentatively, we commit at
21543 this point. */
21545 /* In an expression context, having seen:
21547 (int((char ...
21549 we cannot be sure whether we are looking at a
21550 function-type (taking a "char" as a parameter) or a cast
21551 of some object of type "char" to "int". */
21557 /* Parse the declarator. */
21560 CP_PARSER_DECLARATOR_EITHER,
21562 parenthesized_p,
21566 /* After the declarator, allow more attributes. */
21567 decl_specifiers.attributes
21571 /* If the declarator is a template parameter pack, remember that and
21572 clear the flag in the declarator itself so we don't get errors
21573 from grokdeclarator. */
21575 {
21578 }
21579 }
21581 /* If the next token is an ellipsis, and we have not seen a declarator
21582 name, and if either the type of the declarator contains parameter
21583 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21584 for, eg, abbreviated integral type names), then we actually have a
21585 parameter pack expansion expression. Otherwise, leave the ellipsis
21586 for a C-style variadic function. */
21589 {
21600 {
21601 /* Consume the `...'. */
21605 /* Build a pack expansion type */
21610 else
21612 }
21613 }
21615 /* The restriction on defining new types applies only to the type
21616 of the parameter, not to the default argument. */
21619 /* If the next token is `=', then process a default argument. */
21621 {
21624 /* If we are defining a class, then the tokens that make up the
21625 default argument must be saved and processed later. */
21631 // A constrained-type-specifier may declare a type template-parameter.
21633 default_argument
21636 // A constrained-type-specifier may declare a template-template-parameter.
21638 default_argument
21641 /* Outside of a class definition, we can just parse the
21642 assignment-expression. */
21643 else
21644 default_argument
21648 {
21650 "default arguments are only "
21652 }
21654 || template_parameter_pack_p
21657 {
21658 /* Find the name of the parameter pack. */
21665 template_parm_p
21671 else
21673 template_parm_p
21680 }
21681 }
21682 else
21685 /* Generate a location for the parameter, ranging from the start of the
21686 initial token to the end of the final token (using input_location for
21687 the latter, set up by cp_lexer_set_source_position_from_token when
21688 consuming tokens).
21690 If we have a identifier, then use it for the caret location, e.g.
21692 extern int callee (int one, int (*two)(int, int), float three);
21693 ~~~~~~^~~~~~~~~~~~~~
21695 otherwise, reuse the start location for the caret location e.g.:
21697 extern int callee (int one, int (*)(int, int), float three);
21698 ^~~~~~~~~~~~~~~~~
21700 */
21706 input_location);
21709 declarator,
21710 default_argument,
21711 param_loc,
21712 template_parameter_pack_p);
21713 }
21715 /* Parse a default argument and return it.
21717 TEMPLATE_PARM_P is true if this is a default argument for a
21718 non-type template parameter. */
21719 static tree
21721 {
21727 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21728 set correctly. */
21731 /* Local variable names (and the `this' keyword) may not
21732 appear in a default argument. */
21735 /* Parse the assignment-expression. */
21740 /* The "this" pointer is not valid in a default argument. */
21742 {
21747 }
21748 default_argument
21750 /* Restore the "this" pointer. */
21752 {
21755 }
21764 }
21766 /* Parse a function-body.
21768 function-body:
21769 compound_statement */
21771 static void
21773 {
21777 }
21779 /* Parse a ctor-initializer-opt followed by a function-body. Return
21780 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21781 is true we are parsing a function-try-block. */
21783 static void
21786 {
21793 /* Begin the function body. */
21795 /* Parse the optional ctor-initializer. */
21798 /* If we're parsing a constexpr constructor definition, we need
21799 to check that the constructor body is indeed empty. However,
21800 before we get to cp_parser_function_body lot of junk has been
21801 generated, so we can't just check that we have an empty block.
21802 Rather we take a snapshot of the outermost block, and check whether
21803 cp_parser_function_body changed its state. */
21805 {
21809 }
21810 /* Parse the function-body. */
21814 /* Finish the function body. */
21816 }
21818 /* Parse an initializer.
21820 initializer:
21821 = initializer-clause
21822 ( expression-list )
21824 Returns an expression representing the initializer. If no
21825 initializer is present, NULL_TREE is returned.
21827 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21828 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21829 set to TRUE if there is no initializer present. If there is an
21830 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21831 is set to true; otherwise it is set to false. */
21833 static tree
21836 {
21838 tree init;
21840 /* Peek at the next token. */
21843 /* Let our caller know whether or not this initializer was
21844 parenthesized. */
21846 /* Assume that the initializer is constant. */
21850 {
21851 /* Consume the `='. */
21853 /* Parse the initializer-clause. */
21855 }
21857 {
21862 non_constant_p);
21867 }
21869 {
21874 }
21875 else
21876 {
21877 /* Anything else is an error. */
21880 }
21886 }
21888 /* Parse an initializer-clause.
21890 initializer-clause:
21891 assignment-expression
21892 braced-init-list
21894 Returns an expression representing the initializer.
21896 If the `assignment-expression' production is used the value
21897 returned is simply a representation for the expression.
21899 Otherwise, calls cp_parser_braced_list. */
21901 static cp_expr
21903 {
21904 cp_expr initializer;
21906 /* Assume the expression is constant. */
21909 /* If it is not a `{', then we are looking at an
21910 assignment-expression. */
21912 {
21913 initializer
21916 non_constant_p);
21917 }
21918 else
21922 }
21924 /* Parse a brace-enclosed initializer list.
21926 braced-init-list:
21927 { initializer-list , [opt] }
21928 { designated-initializer-list , [opt] }
21929 { }
21931 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21932 the elements of the initializer-list (or NULL, if the last
21933 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21934 NULL_TREE. There is no way to detect whether or not the optional
21935 trailing `,' was provided. NON_CONSTANT_P is as for
21936 cp_parser_initializer. */
21938 static cp_expr
21940 {
21941 tree initializer;
21944 /* Consume the `{' token. */
21945 matching_braces braces;
21947 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21949 /* If it's not a `}', then there is a non-trivial initializer. */
21951 {
21952 /* Parse the initializer list. */
21955 /* A trailing `,' token is allowed. */
21958 }
21959 else
21961 /* Now, there should be a trailing `}'. */
21967 /* Build a location of the form:
21968 { ... }
21969 ^~~~~~~
21970 with caret==start at the open brace, finish at the close brace. */
21974 }
21976 /* Consume tokens up to, and including, the next non-nested closing `]'.
21977 Returns true iff we found a closing `]'. */
21979 static bool
21981 {
21985 {
21989 {
21992 /* If we've run out of tokens, then there is no closing `]'. */
22001 {
22004 }
22009 }
22011 /* Consume the token. */
22013 }
22014 }
22016 /* Return true if we are looking at an array-designator, false otherwise. */
22018 static bool
22020 {
22021 /* Consume the `['. */
22026 /* Skip tokens until the next token is a closing square bracket.
22027 If we find the closing `]', and the next token is a `=', then
22028 we are looking at an array designator. */
22029 bool array_designator_p
22033 /* Roll back the tokens we skipped. */
22037 }
22039 /* Parse an initializer-list.
22041 initializer-list:
22042 initializer-clause ... [opt]
22043 initializer-list , initializer-clause ... [opt]
22045 C++2A Extension:
22047 designated-initializer-list:
22048 designated-initializer-clause
22049 designated-initializer-list , designated-initializer-clause
22051 designated-initializer-clause:
22052 designator brace-or-equal-initializer
22054 designator:
22055 . identifier
22057 GNU Extension:
22059 initializer-list:
22060 designation initializer-clause ...[opt]
22061 initializer-list , designation initializer-clause ...[opt]
22063 designation:
22064 . identifier =
22065 identifier :
22066 [ constant-expression ] =
22068 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22069 for the initializer. If the INDEX of the elt is non-NULL, it is the
22070 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22071 as for cp_parser_initializer. */
22075 {
22080 /* Assume all of the expressions are constant. */
22083 /* Parse the rest of the list. */
22085 {
22087 tree designator;
22088 tree initializer;
22092 /* Handle the C++2A syntax, '. id ='. */
22100 {
22103 "C++ designated initializers only available with "
22105 /* Consume the `.'. */
22107 /* Consume the identifier. */
22110 /* Consume the `='. */
22112 }
22113 /* Also, if the next token is an identifier and the following one is a
22114 colon, we are looking at the GNU designated-initializer
22115 syntax. */
22120 {
22121 /* Warn the user that they are using an extension. */
22124 /* Consume the identifier. */
22126 /* Consume the `:'. */
22128 }
22129 /* Also handle C99 array designators, '[ const ] ='. */
22133 {
22134 /* In C++11, [ could start a lambda-introducer. */
22140 {
22143 }
22144 else
22145 {
22150 }
22155 && (!require_potential_rvalue_constant_expression
22159 /* Warn the user that they are using an extension. */
22162 }
22163 else
22167 {
22170 }
22174 {
22178 }
22182 /* Parse the initializer. */
22185 /* If any clause is non-constant, so is the entire initializer. */
22189 /* If we have an ellipsis, this is an initializer pack
22190 expansion. */
22192 {
22195 /* Consume the `...'. */
22202 /* Turn the initializer into an initializer expansion. */
22204 }
22206 /* Add it to the vector. */
22209 /* If the next token is not a comma, we have reached the end of
22210 the list. */
22214 /* Peek at the next token. */
22216 /* If the next token is a `}', then we're still done. An
22217 initializer-clause can have a trailing `,' after the
22218 initializer-list and before the closing `}'. */
22222 /* Consume the `,' token. */
22224 }
22226 /* The same identifier shall not appear in multiple designators
22227 of a designated-initializer-list. */
22229 {
22234 {
22236 {
22238 "%<.%s%> designator used multiple times in "
22242 }
22243 else
22245 }
22249 }
22252 }
22254 /* Classes [gram.class] */
22256 /* Parse a class-name.
22258 class-name:
22259 identifier
22260 template-id
22262 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22263 to indicate that names looked up in dependent types should be
22264 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22265 keyword has been used to indicate that the name that appears next
22266 is a template. TAG_TYPE indicates the explicit tag given before
22267 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22268 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22269 is the class being defined in a class-head. If ENUM_OK is TRUE,
22270 enum-names are also accepted.
22272 Returns the TYPE_DECL representing the class. */
22274 static tree
22283 {
22284 tree decl;
22285 tree scope;
22290 /* All class-names start with an identifier. */
22293 {
22296 }
22298 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22299 to a template-id, so we save it here. */
22304 /* Any name names a type if we're following the `typename' keyword
22305 in a qualified name where the enclosing scope is type-dependent. */
22308 /* Handle the common case (an identifier, but not a template-id)
22309 efficiently. */
22312 {
22316 /* Look for the identifier. */
22320 /* If the next token isn't an identifier, we are certainly not
22321 looking at a class-name. */
22324 /* If we know this is a type-name, there's no need to look it
22325 up. */
22328 else
22329 {
22330 tree ambiguous_decls;
22331 /* If we already know that this lookup is ambiguous, then
22332 we've already issued an error message; there's no reason
22333 to check again. */
22335 {
22338 }
22339 /* If the next token is a `::', then the name must be a type
22340 name.
22342 [basic.lookup.qual]
22344 During the lookup for a name preceding the :: scope
22345 resolution operator, object, function, and enumerator
22346 names are ignored. */
22349 /* Look up the name. */
22351 tag_type,
22354 check_dependency_p,
22358 {
22362 }
22363 }
22364 }
22365 else
22366 {
22367 /* Try a template-id. */
22369 check_dependency_p,
22370 tag_type,
22371 is_declaration);
22374 }
22378 /* If this is a typename, create a TYPENAME_TYPE. */
22380 {
22385 }
22389 /* Check to see that it is really the name of a class. */
22393 /* Situations like this:
22395 template <typename T> struct A {
22396 typename T::template X<int>::I i;
22397 };
22399 are problematic. Is `T::template X<int>' a class-name? The
22400 standard does not seem to be definitive, but there is no other
22401 valid interpretation of the following `::'. Therefore, those
22402 names are considered class-names. */
22403 {
22407 }
22412 /* In Objective-C 2.0, a classname followed by '.' starts a
22413 dot-syntax expression, and it's not a type-name. */
22425 }
22427 /* Parse a class-specifier.
22429 class-specifier:
22430 class-head { member-specification [opt] }
22432 Returns the TREE_TYPE representing the class. */
22434 static tree
22436 {
22437 tree type;
22451 /* Parse the class-head. */
22454 /* If the class-head was a semantic disaster, skip the entire body
22455 of the class. */
22457 {
22461 }
22463 /* Look for the `{'. */
22464 matching_braces braces;
22466 {
22469 }
22474 /* Issue an error message if type-definitions are forbidden here. */
22476 /* Remember that we are defining one more class. */
22478 /* Inside the class, surrounding template-parameter-lists do not
22479 apply. */
22480 saved_num_template_parameter_lists
22483 /* We are not in a function body. */
22486 /* Or in a loop. */
22489 /* Or in a switch. */
22492 /* We are not immediately inside an extern "lang" block. */
22493 saved_in_unbraced_linkage_specification_p
22497 // Associate constraints with the type.
22501 /* Start the class. */
22503 {
22506 }
22510 /* If the type is erroneous, skip the entire body of the class. */
22512 else
22513 /* Parse the member-specification. */
22516 /* Look for the trailing `}'. */
22518 /* Look for trailing attributes to apply to this class. */
22526 /* We've finished a type definition. Check for the common syntax
22527 error of forgetting a semicolon after the definition. We need to
22528 be careful, as we can't just check for not-a-semicolon and be done
22529 with it; the user might have typed:
22531 class X { } c = ...;
22532 class X { } *p = ...;
22534 and so forth. Instead, enumerate all the possible tokens that
22535 might follow this production; if we don't see one of them, then
22536 complain and silently insert the semicolon. */
22537 {
22542 /* Don't try to parse c++11 attributes here. As per the
22543 grammar, that should be a task for
22544 cp_parser_decl_specifier_seq. */
22548 {
22559 /* While it's legal for type qualifiers and storage class
22560 specifiers to follow type definitions in the grammar, only
22561 compiler testsuites contain code like that. Assume that if
22562 we see such code, then what we're really seeing is a case
22563 like:
22565 class X { }
22566 const <type> var = ...;
22568 or
22570 class Y { }
22571 static <type> func (...) ...
22573 i.e. the qualifier or specifier applies to the next
22574 declaration. To do so, however, we need to look ahead one
22575 more token to see if *that* token is a type specifier.
22577 This code could be improved to handle:
22579 class Z { }
22580 static const <type> var = ...; */
22583 {
22586 /* Handling user-defined types here would be nice, but very
22587 tricky. */
22588 want_semicolon
22591 }
22595 }
22597 /* If we don't have a type, then something is very wrong and we
22598 shouldn't try to do anything clever. Likewise for not seeing the
22599 closing brace. */
22601 {
22602 /* Locate the closing brace. */
22603 cp_token_position prev
22608 /* We want to suggest insertion of a ';' immediately *after* the
22609 closing brace, so, if we can, offset the location by 1 column. */
22616 /* If we successfully offset the location, suggest the fix-it. */
22629 else
22632 /* Unget one token and smash it to look as though we encountered
22633 a semicolon in the input stream. */
22638 }
22639 }
22641 /* If this class is not itself within the scope of another class,
22642 then we need to parse the bodies of all of the queued function
22643 definitions. Note that the queued functions defined in a class
22644 are not always processed immediately following the
22645 class-specifier for that class. Consider:
22647 struct A {
22648 struct B { void f() { sizeof (A); } };
22649 };
22651 If `f' were processed before the processing of `A' were
22652 completed, there would be no way to compute the size of `A'.
22653 Note that the nesting we are interested in here is lexical --
22654 not the semantic nesting given by TYPE_CONTEXT. In particular,
22655 for:
22657 struct A { struct B; };
22658 struct A::B { void f() { } };
22660 there is no need to delay the parsing of `A::B::f'. */
22662 {
22663 tree decl;
22670 /* In a first pass, parse default arguments to the functions.
22671 Then, in a second pass, parse the bodies of the functions.
22672 This two-phased approach handles cases like:
22674 struct S {
22675 void f() { g(); }
22676 void g(int i = 3);
22677 };
22679 */
22681 {
22683 /* If there are default arguments that have not yet been processed,
22684 take care of them now. */
22686 {
22691 }
22692 /* Make sure that any template parameters are in scope. */
22694 /* Parse the default argument expressions. */
22696 /* Remove any template parameters from the symbol table. */
22698 }
22700 /* Now parse any NSDMIs. */
22704 {
22706 {
22711 }
22714 }
22721 /* Now do some post-NSDMI bookkeeping. */
22727 /* Now parse the body of the functions. */
22729 {
22730 /* OpenMP UDRs need to be parsed before all other functions. */
22737 }
22738 else
22742 }
22743 else
22746 /* Put back any saved access checks. */
22749 /* Restore saved state. */
22753 parser->num_template_parameter_lists
22755 parser->in_unbraced_linkage_specification_p
22759 }
22761 static tree
22763 {
22764 tree ret;
22769 }
22771 /* Parse a class-head.
22773 class-head:
22774 class-key identifier [opt] base-clause [opt]
22775 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22776 class-key nested-name-specifier [opt] template-id
22777 base-clause [opt]
22779 class-virt-specifier:
22780 final
22782 GNU Extensions:
22783 class-key attributes identifier [opt] base-clause [opt]
22784 class-key attributes nested-name-specifier identifier base-clause [opt]
22785 class-key attributes nested-name-specifier [opt] template-id
22786 base-clause [opt]
22788 Upon return BASES is initialized to the list of base classes (or
22789 NULL, if there are none) in the same form returned by
22790 cp_parser_base_clause.
22792 Returns the TYPE of the indicated class. Sets
22793 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22794 involving a nested-name-specifier was used, and FALSE otherwise.
22796 Returns error_mark_node if this is not a class-head.
22798 Returns NULL_TREE if the class-head is syntactically valid, but
22799 semantically invalid in a way that means we should skip the entire
22800 body of the class. */
22802 static tree
22805 {
22806 tree nested_name_specifier;
22810 tree attributes;
22811 tree bases;
22821 /* Assume no nested-name-specifier will be present. */
22823 /* Assume no template parameter lists will be used in defining the
22824 type. */
22828 /* Look for the class-key. */
22835 /* Parse the attributes. */
22838 /* If the next token is `::', that is invalid -- but sometimes
22839 people do try to write:
22841 struct ::S {};
22843 Handle this gracefully by accepting the extra qualifier, and then
22844 issuing an error about it later if this really is a
22845 class-head. If it turns out just to be an elaborated type
22846 specifier, remain silent. */
22852 /* Determine the name of the class. Begin by looking for an
22853 optional nested-name-specifier. */
22855 nested_name_specifier
22861 /* If there was a nested-name-specifier, then there *must* be an
22862 identifier. */
22867 {
22869 /* Although the grammar says `identifier', it really means
22870 `class-name' or `template-name'. You are only allowed to
22871 define a class that has already been declared with this
22872 syntax.
22874 The proposed resolution for Core Issue 180 says that wherever
22875 you see `class T::X' you should treat `X' as a type-name.
22877 It is OK to define an inaccessible class; for example:
22879 class A { class B; };
22880 class A::B {};
22882 We do not know if we will see a class-name, or a
22883 template-name. We look for a class-name first, in case the
22884 class-name is a template-id; if we looked for the
22885 template-name first we would stop after the template-name. */
22892 class_type,
22896 /* If that didn't work, ignore the nested-name-specifier. */
22898 {
22904 }
22905 /* If we could not find a corresponding TYPE, treat this
22906 declaration like an unqualified declaration. */
22909 /* Otherwise, count the number of templates used in TYPE and its
22910 containing scopes. */
22911 else
22912 {
22913 tree scope;
22925 }
22926 }
22927 /* Otherwise, the identifier is optional. */
22928 else
22929 {
22930 /* We don't know whether what comes next is a template-id,
22931 an identifier, or nothing at all. */
22933 /* Check for a template-id. */
22938 class_key,
22940 /* If that didn't work, it could still be an identifier. */
22942 {
22944 {
22947 }
22948 else
22950 }
22951 else
22952 {
22955 }
22956 }
22961 {
22963 class_key,
22965 }
22968 /* If it's not a `:' or a `{' then we can't really be looking at a
22969 class-head, since a class-head only appears as part of a
22970 class-specifier. We have to detect this situation before calling
22971 xref_tag, since that has irreversible side-effects. */
22973 {
22977 }
22979 /* At this point, we're going ahead with the class-specifier, even
22980 if some other problem occurs. */
22983 {
22988 }
22989 /* Issue the error about the overly-qualified name now. */
22991 {
22996 }
22998 {
23003 }
23005 {
23006 tree scope;
23009 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23010 keyword template shall not appear at the top level. */
23014 /* Reject typedef-names in class heads. */
23016 {
23019 type);
23022 }
23024 /* Figure out in what scope the declaration is being placed. */
23026 /* If that scope does not contain the scope in which the
23027 class was originally declared, the program is invalid. */
23029 {
23032 "declaration of %qD in namespace %qD which does not "
23035 else
23041 }
23042 /* [dcl.meaning]
23044 A declarator-id shall not be qualified except for the
23045 definition of a ... nested class outside of its class
23046 ... [or] the definition or explicit instantiation of a
23047 class member of a namespace outside of its namespace. */
23049 {
23054 }
23055 }
23056 /* An explicit-specialization must be preceded by "template <>". If
23057 it is not, try to recover gracefully. */
23060 && !processing_template_parmlist
23062 {
23063 /* Build a location of this form:
23064 struct typename <ARGS>
23065 ^~~~~~~~~~~~~~~~~~~~~~
23066 with caret==start at the start token, and
23067 finishing at the end of the type. */
23068 location_t reported_loc
23070 class_head_start_location,
23076 "an explicit specialization must be preceded by"
23079 /* Take the same action that would have been taken by
23080 cp_parser_explicit_specialization. */
23083 }
23084 /* There must be no "return" statements between this point and the
23085 end of this function; set "type "to the correct return value and
23086 use "goto done;" to return. */
23087 /* Make sure that the right number of template parameters were
23088 present. */
23092 {
23093 /* If something went wrong, there is no point in even trying to
23094 process the class-definition. */
23097 }
23099 /* Look up the type. */
23101 {
23105 {
23109 }
23110 else
23111 {
23115 /* Check the scope while we still know whether or not we had a
23116 nested-name-specifier. */
23119 }
23122 }
23124 {
23125 tree class_type;
23127 /* Given:
23129 template <typename T> struct S { struct T };
23130 template <typename T> struct S<T>::T { };
23132 we will get a TYPENAME_TYPE when processing the definition of
23133 `S::T'. We need to resolve it to the actual type before we
23134 try to define it. */
23136 {
23141 else
23142 {
23145 }
23146 }
23150 {
23153 }
23156 /* Enter the scope indicated by the nested-name-specifier. */
23158 /* Get the canonical version of this type. */
23160 /* Call push_template_decl if it seems like we should be defining a
23161 template either from the template headers or the type we're
23162 defining, so that we diagnose both extra and missing headers. */
23166 {
23169 {
23172 }
23173 }
23177 }
23179 {
23180 /* If the class was unnamed, create a dummy name. */
23184 ? ts_within_enclosing_non_class
23188 }
23190 /* Indicate whether this class was declared as a `class' or as a
23191 `struct'. */
23196 /* If this type was already complete, and we see another definition,
23197 that's an error. */
23199 {
23201 type);
23203 type);
23206 }
23211 {
23212 /* Apply attributes now, before any use of the class as a template
23213 argument in its base list. */
23216 }
23218 /* We will have entered the scope containing the class; the names of
23219 base classes should be looked up in that context. For example:
23221 struct A { struct B {}; struct C; };
23222 struct A::C : B {};
23224 is valid. */
23226 /* Get the list of base-classes, if there is one. */
23228 {
23229 /* PR59482: enter the class scope so that base-specifiers are looked
23230 up correctly. */
23234 /* PR59482: get out of the previously pushed class scope so that the
23235 subsequent pops pop the right thing. */
23238 }
23239 else
23242 /* If we're really defining a class, process the base classes.
23243 If they're invalid, fail. */
23247 done:
23248 /* Leave the scope given by the nested-name-specifier. We will
23249 enter the class scope itself while processing the members. */
23254 {
23257 }
23263 out:
23266 }
23268 /* Parse a class-key.
23270 class-key:
23271 class
23272 struct
23273 union
23275 Returns the kind of class-key specified, or none_type to indicate
23276 error. */
23278 static enum tag_types
23280 {
23284 /* Look for the class-key. */
23289 /* Check to see if the TOKEN is a class-key. */
23294 }
23296 /* Parse a type-parameter-key.
23298 type-parameter-key:
23299 class
23300 typename
23301 */
23303 static void
23305 {
23306 /* Look for the type-parameter-key. */
23310 {
23313 /* typename is not allowed in a template template parameter
23314 by the standard until C++17. */
23316 "ISO C++ forbids typename key in template template parameter;"
23318 }
23319 else
23323 }
23325 /* Parse an (optional) member-specification.
23327 member-specification:
23328 member-declaration member-specification [opt]
23329 access-specifier : member-specification [opt] */
23331 static void
23333 {
23335 {
23339 /* Peek at the next token. */
23341 /* If it's a `}', or EOF then we've seen all the members. */
23347 /* See if this token is a keyword. */
23350 {
23354 /* Consume the access-specifier. */
23356 /* Remember which access-specifier is active. */
23358 /* Look for the `:'. */
23363 /* Accept #pragmas at class scope. */
23365 {
23368 }
23370 /* Otherwise, the next construction must be a
23371 member-declaration. */
23373 }
23374 }
23375 }
23377 /* Parse a member-declaration.
23379 member-declaration:
23380 decl-specifier-seq [opt] member-declarator-list [opt] ;
23381 function-definition ; [opt]
23382 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23383 using-declaration
23384 template-declaration
23385 alias-declaration
23387 member-declarator-list:
23388 member-declarator
23389 member-declarator-list , member-declarator
23391 member-declarator:
23392 declarator pure-specifier [opt]
23393 declarator constant-initializer [opt]
23394 identifier [opt] : constant-expression
23396 GNU Extensions:
23398 member-declaration:
23399 __extension__ member-declaration
23401 member-declarator:
23402 declarator attributes [opt] pure-specifier [opt]
23403 declarator attributes [opt] constant-initializer [opt]
23404 identifier [opt] attributes [opt] : constant-expression
23406 C++0x Extensions:
23408 member-declaration:
23409 static_assert-declaration */
23411 static void
23413 {
23414 cp_decl_specifier_seq decl_specifiers;
23415 tree prefix_attributes;
23416 tree decl;
23425 /* Check for the `__extension__' keyword. */
23427 {
23428 /* Recurse. */
23430 /* Restore the old value of the PEDANTIC flag. */
23434 }
23436 /* Check for a template-declaration. */
23438 {
23439 /* An explicit specialization here is an error condition, and we
23440 expect the specialization handler to detect and report this. */
23444 else
23448 }
23449 /* Check for a template introduction. */
23453 /* Check for a using-declaration. */
23455 {
23457 {
23458 /* Parse the using-declaration. */
23462 }
23463 else
23464 {
23465 tree decl;
23469 /* Note that if we actually see the '=' token after the
23470 identifier, cp_parser_alias_declaration commits the
23471 tentative parse. In that case, we really expect an
23472 alias-declaration. Otherwise, we expect a using
23473 declaration. */
23474 alias_decl_expected =
23480 else
23484 }
23485 }
23487 /* Check for @defs. */
23489 {
23494 {
23499 }
23501 }
23503 /* If the next token is `static_assert' we have a static assertion. */
23505 {
23508 }
23515 /* Parse the decl-specifier-seq. */
23518 CP_PARSER_FLAGS_OPTIONAL,
23521 /* Check for an invalid type-name. */
23525 /* If there is no declarator, then the decl-specifier-seq should
23526 specify a type. */
23528 {
23529 /* If there was no decl-specifier-seq, and the next token is a
23530 `;', then we have something like:
23532 struct S { ; };
23534 [class.mem]
23536 Each member-declaration shall declare at least one member
23537 name of the class. */
23539 {
23542 {
23546 }
23547 }
23548 else
23549 {
23550 tree type;
23552 /* See if this declaration is a friend. */
23554 /* If there were decl-specifiers, check to see if there was
23555 a class-declaration. */
23558 /* Nested classes have already been added to the class, but
23559 a `friend' needs to be explicitly registered. */
23561 {
23562 /* If the `friend' keyword was present, the friend must
23563 be introduced with a class-key. */
23566 "in C++03 a class-key must be used "
23568 /* In this case:
23570 template <typename T> struct A {
23571 friend struct A<T>::B;
23572 };
23574 A<T>::B will be represented by a TYPENAME_TYPE, and
23575 therefore not recognized by check_tag_decl. */
23577 {
23581 }
23584 "friend declaration does not name a class or "
23586 else
23589 }
23590 /* If there is no TYPE, an error message will already have
23591 been issued. */
23593 ;
23594 /* An anonymous aggregate has to be handled specially; such
23595 a declaration really declares a data member (with a
23596 particular type), as opposed to a nested class. */
23598 {
23599 /* C++11 9.5/6. */
23602 "a storage class on an anonymous aggregate "
23605 /* Remove constructors and such from TYPE, now that we
23606 know it is an anonymous aggregate. */
23608 /* And make the corresponding data member. */
23611 /* Add it to the class. */
23613 }
23614 else
23615 cp_parser_check_access_in_redeclaration
23618 }
23619 }
23620 else
23621 {
23624 /* Clear attributes from the decl_specifiers but keep them
23625 around as prefix attributes that apply them to the entity
23626 being declared. */
23630 /* See if these declarations will be friends. */
23633 /* Keep going until we hit the `;' at the end of the
23634 declaration. */
23636 {
23638 tree first_attribute;
23639 tree initializer;
23642 /* Peek at the next token. */
23645 /* The following code wants to know early if it is a bit-field
23646 or some other declaration. Attributes can appear before
23647 the `:' token. Skip over them without consuming any tokens
23648 to peek if they are followed by `:'. */
23653 {
23654 size_t n
23657 }
23659 /* Check for a bitfield declaration. */
23665 {
23666 tree identifier;
23667 tree width;
23672 else
23675 /* Look for attributes that apply to the bitfield. */
23678 /* Consume the `:' token. */
23681 /* Get the width of the bitfield. */
23685 /* In C++2A and as extension for C++11 and above we allow
23686 default member initializers for bit-fields. */
23691 CPP_OPEN_BRACE)))
23692 {
23693 location_t loc
23699 "default member initializers for bit-fields "
23700 "only available with -std=c++2a or "
23705 {
23709 }
23710 }
23711 else
23712 {
23713 /* Look for attributes that apply to the bitfield after
23714 the `:' token and width. This is where GCC used to
23715 parse attributes in the past, pedwarn if there is
23716 a std attribute. */
23719 "ISO C++ allows bit-field attributes only "
23723 }
23727 /* Remember which attributes are prefix attributes and
23728 which are not. */
23730 /* Combine the attributes. */
23733 /* Create the bitfield declaration. */
23736 identifier,
23737 sfk_none)
23741 attributes);
23742 }
23743 else
23744 {
23746 tree asm_specification;
23749 /* Parse the declarator. */
23750 declarator
23755 friend_p);
23757 /* If something went wrong parsing the declarator, make sure
23758 that we at least consume some tokens. */
23760 {
23761 /* Skip to the end of the statement. */
23763 /* If the next token is not a semicolon, that is
23764 probably because we just skipped over the body of
23765 a function. So, we consume a semicolon if
23766 present, but do not issue an error message if it
23767 is not present. */
23769 CPP_SEMICOLON))
23772 }
23775 cp_parser_check_for_definition_in_return_type
23779 /* Look for an asm-specification. */
23781 /* Look for attributes that apply to the declaration. */
23783 /* Remember which attributes are prefix attributes and
23784 which are not. */
23786 /* Combine the attributes. */
23789 /* If it's an `=', then we have a constant-initializer or a
23790 pure-specifier. It is not correct to parse the
23791 initializer before registering the member declaration
23792 since the member declaration should be in scope while
23793 its initializer is processed. However, the rest of the
23794 front end does not yet provide an interface that allows
23795 us to handle this correctly. */
23797 {
23798 /* In [class.mem]:
23800 A pure-specifier shall be used only in the declaration of
23801 a virtual function.
23803 A member-declarator can contain a constant-initializer
23804 only if it declares a static member of integral or
23805 enumeration type.
23807 Therefore, if the DECLARATOR is for a function, we look
23808 for a pure-specifier; otherwise, we look for a
23809 constant-initializer. When we call `grokfield', it will
23810 perform more stringent semantics checks. */
23822 {
23824 /* Don't require a constant rvalue in C++11, since we
23825 might want a reference constant. We'll enforce
23826 constancy later. */
23828 /* Parse the initializer. */
23831 }
23832 else
23833 /* Parse the initializer. */
23835 }
23838 {
23842 else
23844 }
23845 /* Otherwise, there is no initializer. */
23846 else
23849 /* See if we are probably looking at a function
23850 definition. We are certainly not looking at a
23851 member-declarator. Calling `grokfield' has
23852 side-effects, so we must not do it unless we are sure
23853 that we are looking at a member-declarator. */
23856 {
23857 /* The grammar does not allow a pure-specifier to be
23858 used when a member function is defined. (It is
23859 possible that this fact is an oversight in the
23860 standard, since a pure function may be defined
23861 outside of the class-specifier. */
23867 declarator,
23868 attributes);
23871 /* If the member was not a friend, declare it here. */
23874 /* Peek at the next token. */
23876 /* If the next token is a semicolon, consume it. */
23878 {
23879 location_t semicolon_loc
23884 "extra %<;%> after in-class "
23886 }
23888 }
23889 else
23892 /* Create the declaration. */
23897 {
23900 else
23902 }
23903 }
23908 /* Reset PREFIX_ATTRIBUTES. */
23910 {
23915 }
23917 /* If there is any qualification still in effect, clear it
23918 now; we will be starting fresh with the next declarator. */
23922 /* If it's a `,', then there are more declarators. */
23924 {
23927 {
23933 }
23934 }
23935 /* If the next token isn't a `;', then we have a parse error. */
23937 CPP_SEMICOLON))
23938 {
23939 /* The next token might be a ways away from where the
23940 actual semicolon is missing. Find the previous token
23941 and use that for our error position. */
23948 /* Assume that the user meant to provide a semicolon. If
23949 we were to cp_parser_skip_to_end_of_statement, we might
23950 skip to a semicolon inside a member function definition
23951 and issue nonsensical error messages. */
23953 }
23956 {
23957 /* Add DECL to the list of members. */
23959 /* Explicitly include, eg, NSDMIs, for better error
23960 recovery (c++/58650). */
23968 /* Add DECL to the queue of NSDMI to be parsed later. */
23970 }
23974 }
23975 }
23978 out:
23980 }
23982 /* Parse a pure-specifier.
23984 pure-specifier:
23985 = 0
23987 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23988 Otherwise, ERROR_MARK_NODE is returned. */
23990 static tree
23992 {
23995 /* Look for the `=' token. */
23998 /* Look for the `0' token. */
24007 /* Accept = default or = delete in c++0x mode. */
24010 {
24013 }
24015 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24017 {
24022 }
24024 {
24027 }
24030 }
24032 /* Parse a constant-initializer.
24034 constant-initializer:
24035 = constant-expression
24037 Returns a representation of the constant-expression. */
24039 static tree
24041 {
24042 /* Look for the `=' token. */
24046 /* It is invalid to write:
24048 struct S { static const int i = { 7 }; };
24050 */
24052 {
24055 /* Consume the opening brace. */
24056 matching_braces braces;
24058 /* Skip the initializer. */
24060 /* Look for the trailing `}'. */
24064 }
24067 }
24069 /* Derived classes [gram.class.derived] */
24071 /* Parse a base-clause.
24073 base-clause:
24074 : base-specifier-list
24076 base-specifier-list:
24077 base-specifier ... [opt]
24078 base-specifier-list , base-specifier ... [opt]
24080 Returns a TREE_LIST representing the base-classes, in the order in
24081 which they were declared. The representation of each node is as
24082 described by cp_parser_base_specifier.
24084 In the case that no bases are specified, this function will return
24085 NULL_TREE, not ERROR_MARK_NODE. */
24087 static tree
24089 {
24092 /* Look for the `:' that begins the list. */
24095 /* Scan the base-specifier-list. */
24097 {
24099 tree base;
24102 /* Look for the base-specifier. */
24104 /* Look for the (optional) ellipsis. */
24106 {
24107 /* Consume the `...'. */
24111 }
24113 /* Add BASE to the front of the list. */
24115 {
24117 /* Make this a pack expansion type. */
24121 {
24124 }
24125 }
24126 /* Peek at the next token. */
24128 /* If it's not a comma, then the list is complete. */
24131 /* Consume the `,'. */
24133 }
24135 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24136 base class had a qualified name. However, the next name that
24137 appears is certainly not qualified. */
24143 }
24145 /* Parse a base-specifier.
24147 base-specifier:
24148 :: [opt] nested-name-specifier [opt] class-name
24149 virtual access-specifier [opt] :: [opt] nested-name-specifier
24150 [opt] class-name
24151 access-specifier virtual [opt] :: [opt] nested-name-specifier
24152 [opt] class-name
24154 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24155 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24156 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24157 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24159 static tree
24161 {
24169 tree type;
24171 /* Process the optional `virtual' and `access-specifier'. */
24173 {
24174 /* Peek at the next token. */
24176 /* Process `virtual'. */
24178 {
24180 /* If `virtual' appears more than once, issue an error. */
24182 {
24186 }
24190 /* Consume the `virtual' token. */
24198 /* If more than one access specifier appears, issue an
24199 error. */
24202 {
24206 }
24210 /* Consume the access-specifier. */
24218 }
24219 }
24220 /* It is not uncommon to see programs mechanically, erroneously, use
24221 the 'typename' keyword to denote (dependent) qualified types
24222 as base classes. */
24224 {
24229 else
24231 "keyword %<typename%> not allowed in this context "
24234 }
24236 /* Look for the optional `::' operator. */
24238 /* Look for the nested-name-specifier. The simplest way to
24239 implement:
24241 [temp.res]
24243 The keyword `typename' is not permitted in a base-specifier or
24244 mem-initializer; in these contexts a qualified name that
24245 depends on a template-parameter is implicitly assumed to be a
24246 type name.
24248 is to pretend that we have seen the `typename' keyword at this
24249 point. */
24255 /* If the base class is given by a qualified name, assume that names
24256 we see are type names or templates, as appropriate. */
24262 /* DR 950 allows decltype as a base-specifier. */
24264 else
24265 {
24266 /* Otherwise, look for the class-name. */
24268 class_scope_p,
24269 template_p,
24270 typename_type,
24275 }
24281 }
24283 /* Exception handling [gram.exception] */
24285 /* Parse an (optional) noexcept-specification.
24287 noexcept-specification:
24288 noexcept ( constant-expression ) [opt]
24290 If no noexcept-specification is present, returns NULL_TREE.
24291 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24292 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24293 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24294 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24295 in which case a boolean condition is returned instead. */
24297 static tree
24302 {
24306 /* Peek at the next token. */
24309 /* Is it a noexcept-specification? */
24311 {
24312 tree expr;
24316 {
24317 matching_parens parens;
24321 {
24322 /* Types may not be defined in an exception-specification. */
24324 parser->type_definition_forbidden_message
24329 /* Restore the saved message. */
24331 }
24332 else
24333 {
24336 }
24339 }
24340 else
24341 {
24345 }
24347 /* We cannot build a noexcept-spec right away because this will check
24348 that expr is a constexpr. */
24351 else
24353 }
24354 else
24356 }
24358 /* Parse an (optional) exception-specification.
24360 exception-specification:
24361 throw ( type-id-list [opt] )
24363 Returns a TREE_LIST representing the exception-specification. The
24364 TREE_VALUE of each node is a type. */
24366 static tree
24368 {
24370 tree type_id_list;
24373 /* Peek at the next token. */
24376 /* Is it a noexcept-specification? */
24382 /* If it's not `throw', then there's no exception-specification. */
24388 /* Consume the `throw'. */
24391 /* Look for the `('. */
24392 matching_parens parens;
24395 /* Peek at the next token. */
24397 /* If it's not a `)', then there is a type-id-list. */
24399 {
24400 /* Types may not be defined in an exception-specification. */
24402 parser->type_definition_forbidden_message
24404 /* Parse the type-id-list. */
24406 /* Restore the saved message. */
24410 {
24414 }
24417 "dynamic exception specifications are deprecated in "
24419 }
24420 /* In C++17, throw() is equivalent to noexcept (true). throw()
24421 is deprecated in C++11 and above as well, but is still widely used,
24422 so don't warn about it yet. */
24425 else
24428 /* Look for the `)'. */
24432 }
24434 /* Parse an (optional) type-id-list.
24436 type-id-list:
24437 type-id ... [opt]
24438 type-id-list , type-id ... [opt]
24440 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24441 in the order that the types were presented. */
24443 static tree
24445 {
24449 {
24451 tree type;
24455 /* Get the next type-id. */
24457 /* Check for invalid 'auto'. */
24459 {
24463 }
24464 /* Parse the optional ellipsis. */
24466 {
24467 /* Consume the `...'. */
24470 /* Turn the type into a pack expansion expression. */
24472 }
24473 /* Add it to the list. */
24475 /* Peek at the next token. */
24477 /* If it is not a `,', we are done. */
24480 /* Consume the `,'. */
24482 }
24485 }
24487 /* Parse a try-block.
24489 try-block:
24490 try compound-statement handler-seq */
24492 static tree
24494 {
24495 tree try_block;
24509 }
24511 /* Parse a function-try-block.
24513 function-try-block:
24514 try ctor-initializer [opt] function-body handler-seq */
24516 static void
24518 {
24519 tree compound_stmt;
24520 tree try_block;
24522 /* Look for the `try' keyword. */
24525 /* Let the rest of the front end know where we are. */
24527 /* Parse the function-body. */
24528 cp_parser_ctor_initializer_opt_and_function_body
24530 /* We're done with the `try' part. */
24532 /* Parse the handlers. */
24534 /* We're done with the handlers. */
24536 }
24538 /* Parse a handler-seq.
24540 handler-seq:
24541 handler handler-seq [opt] */
24543 static void
24545 {
24547 {
24550 /* Parse the handler. */
24552 /* Peek at the next token. */
24554 /* If it's not `catch' then there are no more handlers. */
24557 }
24558 }
24560 /* Parse a handler.
24562 handler:
24563 catch ( exception-declaration ) compound-statement */
24565 static void
24567 {
24568 tree handler;
24569 tree declaration;
24573 matching_parens parens;
24580 }
24582 /* Parse an exception-declaration.
24584 exception-declaration:
24585 type-specifier-seq declarator
24586 type-specifier-seq abstract-declarator
24587 type-specifier-seq
24588 ...
24590 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24591 ellipsis variant is used. */
24593 static tree
24595 {
24596 cp_decl_specifier_seq type_specifiers;
24600 /* If it's an ellipsis, it's easy to handle. */
24602 {
24603 /* Consume the `...' token. */
24606 }
24608 /* Types may not be defined in exception-declarations. */
24610 parser->type_definition_forbidden_message
24613 /* Parse the type-specifier-seq. */
24617 /* If it's a `)', then there is no declarator. */
24620 else
24627 /* Restore the saved message. */
24634 }
24636 /* Parse a throw-expression.
24638 throw-expression:
24639 throw assignment-expression [opt]
24641 Returns a THROW_EXPR representing the throw-expression. */
24643 static tree
24645 {
24646 tree expression;
24651 /* Figure out whether or not there is an assignment-expression
24652 following the "throw" keyword. */
24660 else
24664 }
24666 /* GNU Extensions */
24668 /* Parse an (optional) asm-specification.
24670 asm-specification:
24671 asm ( string-literal )
24673 If the asm-specification is present, returns a STRING_CST
24674 corresponding to the string-literal. Otherwise, returns
24675 NULL_TREE. */
24677 static tree
24679 {
24681 tree asm_specification;
24683 /* Peek at the next token. */
24685 /* If the next token isn't the `asm' keyword, then there's no
24686 asm-specification. */
24690 /* Consume the `asm' token. */
24692 /* Look for the `('. */
24693 matching_parens parens;
24696 /* Look for the string-literal. */
24699 /* Look for the `)'. */
24703 }
24705 /* Parse an asm-operand-list.
24707 asm-operand-list:
24708 asm-operand
24709 asm-operand-list , asm-operand
24711 asm-operand:
24712 string-literal ( expression )
24713 [ string-literal ] string-literal ( expression )
24715 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24716 each node is the expression. The TREE_PURPOSE is itself a
24717 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24718 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24719 is a STRING_CST for the string literal before the parenthesis. Returns
24720 ERROR_MARK_NODE if any of the operands are invalid. */
24722 static tree
24724 {
24729 {
24730 tree string_literal;
24731 tree expression;
24732 tree name;
24735 {
24736 /* Consume the `[' token. */
24738 /* Read the operand name. */
24743 /* Look for the closing `]'. */
24745 }
24746 else
24748 /* Look for the string-literal. */
24751 /* Look for the `('. */
24752 matching_parens parens;
24754 /* Parse the expression. */
24756 /* Look for the `)'. */
24764 /* Add this operand to the list. */
24766 expression,
24767 asm_operands);
24768 /* If the next token is not a `,', there are no more
24769 operands. */
24772 /* Consume the `,'. */
24774 }
24777 }
24779 /* Parse an asm-clobber-list.
24781 asm-clobber-list:
24782 string-literal
24783 asm-clobber-list , string-literal
24785 Returns a TREE_LIST, indicating the clobbers in the order that they
24786 appeared. The TREE_VALUE of each node is a STRING_CST. */
24788 static tree
24790 {
24794 {
24795 tree string_literal;
24797 /* Look for the string literal. */
24799 /* Add it to the list. */
24801 /* If the next token is not a `,', then the list is
24802 complete. */
24805 /* Consume the `,' token. */
24807 }
24810 }
24812 /* Parse an asm-label-list.
24814 asm-label-list:
24815 identifier
24816 asm-label-list , identifier
24818 Returns a TREE_LIST, indicating the labels in the order that they
24819 appeared. The TREE_VALUE of each node is a label. */
24821 static tree
24823 {
24827 {
24830 /* Look for the identifier. */
24833 {
24836 {
24842 }
24843 }
24844 /* If the next token is not a `,', then the list is
24845 complete. */
24848 /* Consume the `,' token. */
24850 }
24853 }
24855 /* Return TRUE iff the next tokens in the stream are possibly the
24856 beginning of a GNU extension attribute. */
24858 static bool
24860 {
24862 }
24864 /* Return TRUE iff the next tokens in the stream are possibly the
24865 beginning of a standard C++-11 attribute specifier. */
24867 static bool
24869 {
24871 }
24873 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24874 beginning of a standard C++-11 attribute specifier. */
24876 static bool
24878 {
24886 }
24888 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24889 beginning of a GNU extension attribute. */
24891 static bool
24893 {
24897 }
24899 /* Return true iff the next tokens can be the beginning of either a
24900 GNU attribute list, or a standard C++11 attribute sequence. */
24902 static bool
24904 {
24907 }
24909 /* Return true iff the next Nth tokens can be the beginning of either
24910 a GNU attribute list, or a standard C++11 attribute sequence. */
24912 static bool
24914 {
24917 }
24919 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24920 of GNU attributes, or return NULL. */
24922 static tree
24924 {
24928 }
24930 /* Parse an (optional) series of attributes.
24932 attributes:
24933 attributes attribute
24935 attribute:
24936 __attribute__ (( attribute-list [opt] ))
24938 The return value is as for cp_parser_gnu_attribute_list. */
24940 static tree
24942 {
24946 {
24948 tree attribute_list;
24951 /* Peek at the next token. */
24953 /* If it's not `__attribute__', then we're done. */
24957 /* Consume the `__attribute__' keyword. */
24959 /* Look for the two `(' tokens. */
24960 matching_parens outer_parens;
24962 matching_parens inner_parens;
24965 /* Peek at the next token. */
24968 /* Parse the attribute-list. */
24970 else
24971 /* If the next token is a `)', then there is no attribute
24972 list. */
24975 /* Look for the two `)' tokens. */
24983 /* Add these new attributes to the list. */
24985 }
24988 }
24990 /* Parse a GNU attribute-list.
24992 attribute-list:
24993 attribute
24994 attribute-list , attribute
24996 attribute:
24997 identifier
24998 identifier ( identifier )
24999 identifier ( identifier , expression-list )
25000 identifier ( expression-list )
25002 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25003 to an attribute. The TREE_PURPOSE of each node is the identifier
25004 indicating which attribute is in use. The TREE_VALUE represents
25005 the arguments, if any. */
25007 static tree
25009 {
25015 {
25017 tree identifier;
25018 tree attribute;
25020 /* Look for the identifier. We also allow keywords here; for
25021 example `__attribute__ ((const))' is legal. */
25025 {
25028 /* Consume the token, but save it since we need it for the
25029 SIMD enabled function parsing. */
25032 /* Save away the identifier that indicates which attribute
25033 this is. */
25035 /* For keywords, use the canonical spelling, not the
25036 parsed identifier. */
25043 /* Peek at the next token. */
25045 /* If it's an `(', then parse the attribute arguments. */
25047 {
25051 vec = cp_parser_parenthesized_expression_list
25057 else
25058 {
25061 }
25062 /* Save the arguments away. */
25064 }
25067 {
25068 /* Add this attribute to the list. */
25071 }
25074 }
25075 /* Now, look for more attributes. If the next token isn't a
25076 `,', we're done. */
25080 /* Consume the comma and keep going. */
25082 }
25085 /* We built up the list in reverse order. */
25087 }
25089 /* Parse a standard C++11 attribute.
25091 The returned representation is a TREE_LIST which TREE_PURPOSE is
25092 the scoped name of the attribute, and the TREE_VALUE is its
25093 arguments list.
25095 Note that the scoped name of the attribute is itself a TREE_LIST
25096 which TREE_PURPOSE is the namespace of the attribute, and
25097 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25098 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25099 and which TREE_PURPOSE is directly the attribute name.
25101 Clients of the attribute code should use get_attribute_namespace
25102 and get_attribute_name to get the actual namespace and name of
25103 attributes, regardless of their being GNU or C++11 attributes.
25105 attribute:
25106 attribute-token attribute-argument-clause [opt]
25108 attribute-token:
25109 identifier
25110 attribute-scoped-token
25112 attribute-scoped-token:
25113 attribute-namespace :: identifier
25115 attribute-namespace:
25116 identifier
25118 attribute-argument-clause:
25119 ( balanced-token-seq )
25121 balanced-token-seq:
25122 balanced-token [opt]
25123 balanced-token-seq balanced-token
25125 balanced-token:
25126 ( balanced-token-seq )
25127 [ balanced-token-seq ]
25128 { balanced-token-seq }. */
25130 static tree
25132 {
25136 /* First, parse name of the attribute, a.k.a attribute-token. */
25153 {
25154 /* We are seeing a scoped attribute token. */
25169 else
25170 {
25174 }
25178 NULL_TREE);
25180 }
25183 NULL_TREE);
25184 else
25185 {
25188 NULL_TREE);
25189 /* C++11 noreturn attribute is equivalent to GNU's. */
25192 /* C++14 deprecated attribute is equivalent to GNU's. */
25195 /* C++17 fallthrough attribute is equivalent to GNU's. */
25198 /* Transactional Memory TS optimize_for_synchronized attribute is
25199 equivalent to GNU transaction_callable. */
25203 /* Transactional Memory attributes are GNU attributes. */
25206 }
25208 /* Now parse the optional argument clause of the attribute. */
25213 {
25219 /* A GNU attribute that takes an identifier in parameter. */
25222 vec = cp_parser_parenthesized_expression_list
25228 else
25229 {
25232 }
25236 else
25238 }
25241 }
25243 /* Check that the attribute ATTRIBUTE appears at most once in the
25244 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25245 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25246 isn't implemented yet in GCC. */
25248 static void
25250 {
25252 {
25262 }
25263 }
25265 /* Parse a list of standard C++-11 attributes.
25267 attribute-list:
25268 attribute [opt]
25269 attribute-list , attribute[opt]
25270 attribute ...
25271 attribute-list , attribute ...
25272 */
25274 static tree
25276 {
25281 {
25286 {
25290 }
25293 {
25298 else
25299 {
25304 }
25306 }
25310 }
25313 }
25315 /* Parse a standard C++-11 attribute specifier.
25317 attribute-specifier:
25318 [ [ attribute-using-prefix [opt] attribute-list ] ]
25319 alignment-specifier
25321 attribute-using-prefix:
25322 using attribute-namespace :
25324 alignment-specifier:
25325 alignas ( type-id ... [opt] )
25326 alignas ( alignment-expression ... [opt] ). */
25328 static tree
25330 {
25336 {
25343 {
25354 {
25358 "attribute using prefix only available "
25364 }
25365 else
25367 }
25374 else
25375 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25376 when we are sure that we have actually parsed them. */
25378 }
25379 else
25380 {
25381 tree alignas_expr;
25383 /* Look for an alignment-specifier. */
25394 matching_parens parens;
25402 {
25409 }
25414 /* Handle alignas (pack...). */
25416 {
25419 }
25421 /* Something went wrong, so don't build the attribute. */
25428 /* Build the C++-11 representation of an 'aligned'
25429 attribute. */
25430 attributes =
25433 alignas_expr);
25434 }
25437 }
25439 /* Parse a standard C++-11 attribute-specifier-seq.
25441 attribute-specifier-seq:
25442 attribute-specifier-seq [opt] attribute-specifier
25443 */
25445 static tree
25447 {
25452 {
25461 else
25464 }
25467 }
25469 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25470 return index of the first token after balanced-token, or N on failure. */
25472 static size_t
25474 {
25477 do
25479 {
25482 /* Ran out of tokens. */
25504 }
25507 }
25509 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25510 return index of the first token after the GNU attribute tokens, or N on
25511 failure. */
25513 static size_t
25515 {
25517 {
25529 }
25531 }
25533 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25534 next token), return index of the first token after the standard C++11
25535 attribute tokens, or N on failure. */
25537 static size_t
25539 {
25541 {
25544 {
25551 }
25554 {
25559 }
25560 else
25562 }
25564 }
25566 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25567 as the next token), return index of the first token after the attribute
25568 tokens, or N on failure. */
25570 static size_t
25572 {
25576 }
25578 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25579 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25580 current value of the PEDANTIC flag, regardless of whether or not
25581 the `__extension__' keyword is present. The caller is responsible
25582 for restoring the value of the PEDANTIC flag. */
25584 static bool
25586 {
25587 /* Save the old value of the PEDANTIC flag. */
25591 {
25592 /* Consume the `__extension__' token. */
25594 /* We're not being pedantic while the `__extension__' keyword is
25595 in effect. */
25599 }
25602 }
25604 /* Parse a label declaration.
25606 label-declaration:
25607 __label__ label-declarator-seq ;
25609 label-declarator-seq:
25610 identifier , label-declarator-seq
25611 identifier */
25613 static void
25615 {
25616 /* Look for the `__label__' keyword. */
25620 {
25621 tree identifier;
25623 /* Look for an identifier. */
25625 /* If we failed, stop. */
25628 /* Declare it as a label. */
25630 /* If the next token is a `;', stop. */
25633 /* Look for the `,' separating the label declarations. */
25635 }
25637 /* Look for the final `;'. */
25639 }
25641 // -------------------------------------------------------------------------- //
25642 // Requires Clause
25644 // Parse a requires clause.
25645 //
25646 // requires-clause:
25647 // 'requires' logical-or-expression
25648 //
25649 // The required logical-or-expression must be a constant expression. Note
25650 // that we don't check that the expression is constepxr here. We defer until
25651 // we analyze constraints and then, we only check atomic constraints.
25652 static tree
25654 {
25655 // Parse the requires clause so that it is not automatically folded.
25663 }
25665 // Optionally parse a requires clause:
25666 static tree
25668 {
25671 {
25674 {
25677 /* Parse and discard the requires-clause. */
25680 }
25682 }
25685 }
25688 /*---------------------------------------------------------------------------
25689 Requires expressions
25690 ---------------------------------------------------------------------------*/
25692 /* Parse a requires expression
25694 requirement-expression:
25695 'requires' requirement-parameter-list [opt] requirement-body */
25696 static tree
25698 {
25702 /* A requires-expression shall appear only within a concept
25703 definition or a requires-clause.
25705 TODO: Implement this diagnostic correctly. */
25707 {
25711 }
25714 {
25715 /* Local parameters are delared as variables within the scope
25716 of the expression. They are not visible past the end of
25717 the expression. Expressions within the requires-expression
25718 are unevaluated. */
25719 struct scope_sentinel
25720 {
25722 {
25725 }
25728 {
25731 }
25734 /* Parse the optional parameter list. */
25736 {
25740 }
25741 else
25744 /* Parse the requirement body. */
25748 }
25750 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25751 the parm chain. */
25754 }
25756 /* Parse a parameterized requirement.
25758 requirement-parameter-list:
25759 '(' parameter-declaration-clause ')' */
25760 static tree
25762 {
25763 matching_parens parens;
25773 }
25775 /* Parse the body of a requirement.
25777 requirement-body:
25778 '{' requirement-list '}' */
25779 static tree
25781 {
25782 matching_braces braces;
25792 }
25794 /* Parse a list of requirements.
25796 requirement-list:
25797 requirement
25798 requirement-list ';' requirement[opt] */
25799 static tree
25801 {
25804 {
25811 /* If we see a semi-colon, consume it. */
25815 /* Stop processing at the end of the list. */
25818 }
25820 /* Reverse the order of requirements so they are analyzed in
25821 declaration order. */
25823 }
25825 /* Parse a syntactic requirement or type requirement.
25827 requirement:
25828 simple-requirement
25829 compound-requirement
25830 type-requirement
25831 nested-requirement */
25832 static tree
25834 {
25841 else
25843 }
25845 /* Parse a simple requirement.
25847 simple-requirement:
25848 expression ';' */
25849 static tree
25851 {
25860 }
25862 /* Parse a type requirement
25864 type-requirement
25865 nested-name-specifier [opt] required-type-name ';'
25867 required-type-name:
25868 type-name
25869 'template' [opt] simple-template-id */
25870 static tree
25872 {
25875 // Save the scope before parsing name specifiers.
25886 tree type;
25888 {
25897 }
25898 else
25917 }
25919 /* Parse a compound requirement
25921 compound-requirement:
25922 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25923 static tree
25925 {
25926 /* Parse an expression enclosed in '{ }'s. */
25927 matching_braces braces;
25938 /* Parse the optional noexcept. */
25941 {
25944 }
25946 /* Parse the optional trailing return type. */
25949 {
25957 }
25960 }
25962 /* Parse a nested requirement. This is the same as a requires clause.
25964 nested-requirement:
25965 requires-clause */
25966 static tree
25968 {
25974 }
25976 /* Support Functions */
25978 /* Return the appropriate prefer_type argument for lookup_name_real based on
25979 tag_type and template_mem_access. */
25983 {
25984 /* DR 141: When looking in the current enclosing context for a template-name
25985 after -> or ., only consider class templates. */
25989 {
25993 }
25994 }
25996 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25997 NAME should have one of the representations used for an
25998 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25999 is returned. If PARSER->SCOPE is a dependent type, then a
26000 SCOPE_REF is returned.
26002 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26003 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26004 was formed. Abstractly, such entities should not be passed to this
26005 function, because they do not need to be looked up, but it is
26006 simpler to check for this special case here, rather than at the
26007 call-sites.
26009 In cases not explicitly covered above, this function returns a
26010 DECL, OVERLOAD, or baselink representing the result of the lookup.
26011 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26012 is returned.
26014 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26015 (e.g., "struct") that was used. In that case bindings that do not
26016 refer to types are ignored.
26018 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26019 ignored.
26021 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26022 are ignored.
26024 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26025 types.
26027 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26028 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26029 NULL_TREE otherwise. */
26031 static cp_expr
26038 location_t name_location)
26039 {
26040 tree decl;
26043 /* Assume that the lookup will be unambiguous. */
26047 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26048 no longer valid. Note that if we are parsing tentatively, and
26049 the parse fails, OBJECT_TYPE will be automatically restored. */
26055 /* A template-id has already been resolved; there is no lookup to
26056 do. */
26060 {
26064 }
26066 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26067 it should already have been checked to make sure that the name
26068 used matches the type being destroyed. */
26070 {
26071 tree type;
26073 /* Figure out to which type this destructor applies. */
26078 else
26080 /* If that's not a class type, there is no destructor. */
26091 }
26093 /* By this point, the NAME should be an ordinary identifier. If
26094 the id-expression was a qualified name, the qualifying scope is
26095 stored in PARSER->SCOPE at this point. */
26098 /* Perform the lookup. */
26100 {
26106 /* If the SCOPE is dependent, the lookup must be deferred until
26107 the template is instantiated -- unless we are explicitly
26108 looking up names in uninstantiated templates. Even then, we
26109 cannot look up the name if the scope is not a class type; it
26110 might, for example, be a template type parameter. */
26115 /* Defer lookup. */
26117 else
26118 {
26121 /* If PARSER->SCOPE is a dependent type, then it must be a
26122 class type, and we must not be checking dependencies;
26123 otherwise, we would have processed this lookup above. So
26124 that PARSER->SCOPE is not considered a dependent base by
26125 lookup_member, we must enter the scope here. */
26129 /* If the PARSER->SCOPE is a template specialization, it
26130 may be instantiated during name lookup. In that case,
26131 errors may be issued. Even if we rollback the current
26132 tentative parse, those errors are valid. */
26137 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26138 lookup result and the nested-name-specifier nominates a class C:
26139 * if the name specified after the nested-name-specifier, when
26140 looked up in C, is the injected-class-name of C (Clause 9), or
26141 * if the name specified after the nested-name-specifier is the
26142 same as the identifier or the simple-template-id's template-
26143 name in the last component of the nested-name-specifier,
26144 the name is instead considered to name the constructor of
26145 class C. [ Note: for example, the constructor is not an
26146 acceptable lookup result in an elaborated-type-specifier so
26147 the constructor would not be used in place of the
26148 injected-class-name. --end note ] Such a constructor name
26149 shall be used only in the declarator-id of a declaration that
26150 names a constructor or in a using-declaration. */
26158 /* If we have a single function from a using decl, pull it out. */
26165 }
26167 /* If the scope is a dependent type and either we deferred lookup or
26168 we did lookup but didn't find the name, rememeber the name. */
26171 {
26173 {
26174 tree type;
26176 /* The resolution to Core Issue 180 says that `struct
26177 A::B' should be considered a type-name, even if `A'
26178 is dependent. */
26183 }
26187 CPP_CLOSE_PAREN)))
26191 else
26194 is_template);
26195 }
26198 }
26200 {
26201 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26202 OBJECT_TYPE is not a class. */
26204 /* If the OBJECT_TYPE is a template specialization, it may
26205 be instantiated during name lookup. In that case, errors
26206 may be issued. Even if we rollback the current tentative
26207 parse, those errors are valid. */
26209 name,
26212 tf_warning_or_error);
26213 else
26217 /* Look it up in the enclosing context. DR 141: When looking for a
26218 template-name after -> or ., only consider class templates. */
26223 /* The object is type-dependent, so we can't look anything up; we used
26224 this to get the DR 141 behavior. */
26228 }
26229 else
26230 {
26236 }
26238 /* If the lookup failed, let our caller know. */
26242 /* Pull out the template from an injected-class-name (or multiple). */
26246 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26248 {
26251 /* The error message we have to print is too complicated for
26252 cp_parser_error, so we incorporate its actions directly. */
26254 {
26256 name);
26258 }
26260 }
26268 /* If we have resolved the name of a member declaration, check to
26269 see if the declaration is accessible. When the name resolves to
26270 set of overloaded functions, accessibility is checked when
26271 overload resolution is done.
26273 During an explicit instantiation, access is not checked at all,
26274 as per [temp.explicit]. */
26281 }
26283 /* Like cp_parser_lookup_name, but for use in the typical case where
26284 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26285 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26287 static tree
26289 {
26291 none_type,
26296 location);
26297 }
26299 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26300 the current context, return the TYPE_DECL. If TAG_NAME_P is
26301 true, the DECL indicates the class being defined in a class-head,
26302 or declared in an elaborated-type-specifier.
26304 Otherwise, return DECL. */
26306 static tree
26308 {
26309 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26310 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26312 struct A {
26313 template <typename T> struct B;
26314 };
26316 template <typename T> struct A::B {};
26318 Similarly, in an elaborated-type-specifier:
26320 namespace N { struct X{}; }
26322 struct A {
26323 template <typename T> friend struct N::X;
26324 };
26326 However, if the DECL refers to a class type, and we are in
26327 the scope of the class, then the name lookup automatically
26328 finds the TYPE_DECL created by build_self_reference rather
26329 than a TEMPLATE_DECL. For example, in:
26331 template <class T> struct S {
26332 S s;
26333 };
26335 there is no need to handle such case. */
26341 }
26343 /* If too many, or too few, template-parameter lists apply to the
26344 declarator, issue an error message. Returns TRUE if all went well,
26345 and FALSE otherwise. */
26347 static bool
26350 location_t declarator_location)
26351 {
26353 {
26355 {
26363 /* If the DECLARATOR has the form `X<y>' then it uses one
26364 additional level of template parameters. */
26367 return cp_parser_check_template_parameters
26369 }
26385 }
26387 }
26389 /* NUM_TEMPLATES were used in the current declaration. If that is
26390 invalid, return FALSE and issue an error messages. Otherwise,
26391 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26392 declarator and we can print more accurate diagnostics. */
26394 static bool
26397 location_t location,
26399 {
26400 /* If there are the same number of template classes and parameter
26401 lists, that's OK. */
26404 /* If there are more, but only one more, then we are referring to a
26405 member template. That's OK too. */
26408 /* If there are more template classes than parameter lists, we have
26409 something like:
26411 template <class T> void S<T>::R<T>::f (); */
26413 {
26423 else
26426 }
26427 /* Otherwise, there are too many template parameter lists. We have
26428 something like:
26430 template <class T> template <class U> void S::f(); */
26433 }
26435 /* Parse an optional `::' token indicating that the following name is
26436 from the global namespace. If so, PARSER->SCOPE is set to the
26437 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26438 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26439 Returns the new value of PARSER->SCOPE, if the `::' token is
26440 present, and NULL_TREE otherwise. */
26442 static tree
26444 {
26447 /* Peek at the next token. */
26449 /* If we're looking at a `::' token then we're starting from the
26450 global namespace, not our current location. */
26452 {
26453 /* Consume the `::' token. */
26455 /* Set the SCOPE so that we know where to start the lookup. */
26461 }
26463 {
26467 }
26470 }
26472 /* Returns TRUE if the upcoming token sequence is the start of a
26473 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26474 declarator is preceded by the `friend' specifier. */
26476 static bool
26478 {
26481 tree nested_name_specifier;
26484 /* The common case is that this is not a constructor declarator, so
26485 try to avoid doing lots of work if at all possible. It's not
26486 valid declare a constructor at function scope. */
26489 /* And only certain tokens can begin a constructor declarator. */
26497 /* Parse tentatively; we are going to roll back all of the tokens
26498 consumed here. */
26500 /* Assume that we are looking at a constructor declarator. */
26503 /* Look for the optional `::' operator. */
26506 /* Look for the nested-name-specifier. */
26507 nested_name_specifier
26518 /* Outside of a class-specifier, there must be a
26519 nested-name-specifier. Except in C++17 mode, where we
26520 might be declaring a guiding declaration. */
26527 /* If we have a class scope, this is easy; DR 147 says that S::S always
26528 names the constructor, and no other qualified name could. */
26531 {
26541 }
26542 /* If we still think that this might be a constructor-declarator,
26543 look for a class-name. */
26545 {
26546 /* If we have:
26548 template <typename T> struct S {
26549 S();
26550 };
26552 we must recognize that the nested `S' names a class. */
26556 tree type_decl;
26560 none_type,
26567 {
26573 none_type,
26578 else
26580 }
26582 /* If there was no class-name, then this is not a constructor.
26583 Otherwise, if we are in a class-specifier and we aren't
26584 handling a friend declaration, check that its type matches
26585 current_class_type (c++/38313). Note: error_mark_node
26586 is left alone for error recovery purposes. */
26588 && (outside_class_specifier_p
26594 /* If we're still considering a constructor, we have to see a `(',
26595 to begin the parameter-declaration-clause, followed by either a
26596 `)', an `...', or a decl-specifier. We need to check for a
26597 type-specifier to avoid being fooled into thinking that:
26599 S (f) (int);
26601 is a constructor. (It is actually a function named `f' that
26602 takes one parameter (of type `int') and returns a value of type
26603 `S'. */
26611 /* A parameter declaration begins with a decl-specifier,
26612 which is either the "attribute" keyword, a storage class
26613 specifier, or (usually) a type-specifier. */
26615 {
26616 tree type;
26620 /* Names appearing in the type-specifier should be looked up
26621 in the scope of the class. */
26625 {
26628 {
26632 {
26635 }
26636 }
26638 }
26640 /* Inside the constructor parameter list, surrounding
26641 template-parameter-lists do not apply. */
26642 saved_num_template_parameter_lists
26646 /* Look for the type-specifier. */
26648 CP_PARSER_FLAGS_NONE,
26654 parser->num_template_parameter_lists
26657 /* Leave the scope of the class. */
26662 }
26663 }
26665 /* We did not really want to consume any tokens. */
26669 }
26671 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26672 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26673 they must be performed once we are in the scope of the function.
26675 Returns the function defined. */
26677 static tree
26678 cp_parser_function_definition_from_specifiers_and_declarator
26681 tree attributes,
26683 {
26684 tree fn;
26687 /* Begin the function-definition. */
26690 /* The things we're about to see are not directly qualified by any
26691 template headers we've seen thus far. */
26694 /* If there were names looked up in the decl-specifier-seq that we
26695 did not check, check them now. We must wait until we are in the
26696 scope of the function to perform the checks, since the function
26697 might be a friend. */
26701 {
26706 }
26709 {
26710 /* Skip the entire function. */
26713 }
26715 {
26716 /* Seen already, skip it. An error message has already been output. */
26720 /* If this is a function from a class, pop the nested class. */
26723 }
26724 else
26725 {
26726 timevar_id_t tv;
26729 else
26735 }
26738 }
26740 /* Parse the part of a function-definition that follows the
26741 declarator. INLINE_P is TRUE iff this function is an inline
26742 function defined within a class-specifier.
26744 Returns the function defined. */
26746 static tree
26749 {
26750 tree fn;
26755 bool fully_implicit_function_template_p
26758 tree implicit_template_parms
26761 cp_binding_level* implicit_template_scope
26767 /* If the next token is `return', then the code may be trying to
26768 make use of the "named return value" extension that G++ used to
26769 support. */
26772 {
26773 /* Consume the `return' keyword. */
26775 /* Look for the identifier that indicates what value is to be
26776 returned. */
26778 /* Issue an error message. */
26781 /* Skip tokens until we reach the start of the function body. */
26783 {
26790 }
26791 }
26792 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26793 anything declared inside `f'. */
26794 saved_in_unbraced_linkage_specification_p
26797 /* Inside the function, surrounding template-parameter-lists do not
26798 apply. */
26799 saved_num_template_parameter_lists
26803 /* If the next token is `try', `__transaction_atomic', or
26804 `__transaction_relaxed`, then we are looking at either function-try-block
26805 or function-transaction-block. Note that all of these include the
26806 function-body. */
26810 RID_TRANSACTION_RELAXED))
26814 else
26815 cp_parser_ctor_initializer_opt_and_function_body
26818 /* Finish the function. */
26820 /* Generate code for it, if necessary. */
26822 /* Restore the saved values. */
26823 parser->in_unbraced_linkage_specification_p
26825 parser->num_template_parameter_lists
26829 parser->fully_implicit_function_template_p
26831 parser->implicit_template_parms
26833 parser->implicit_template_scope
26840 }
26842 /* Parse a template-declaration body (following argument list). */
26844 static void
26846 tree parameter_list,
26848 {
26852 /* We just processed one more parameter list. */
26855 /* Get the deferred access checks from the parameter list. These
26856 will be checked once we know what is being declared, as for a
26857 member template the checks must be performed in the scope of the
26858 class containing the member. */
26861 /* Tentatively parse for a new template parameter list, which can either be
26862 the template keyword or a template introduction. */
26868 else
26869 {
26870 /* There are no access checks when parsing a template, as we do not
26871 know if a specialization will be a friend. */
26875 checks,
26876 member_p,
26881 /* If this is a member template declaration, let the front
26882 end know. */
26884 {
26889 }
26894 }
26895 /* We are done with the current parameter list. */
26900 /* Finish up. */
26903 /* Check the template arguments for a literal operator template. */
26907 {
26911 else
26912 {
26915 {
26921 }
26923 {
26932 }
26933 else
26935 }
26937 {
26940 " Expected non-type template argument pack <char...>"
26942 decl);
26943 else
26946 decl);
26947 }
26948 }
26950 /* Register member declarations. */
26953 /* If DECL is a function template, we must return to parse it later.
26954 (Even though there is no definition, there might be default
26955 arguments that need handling.) */
26959 }
26961 /* Parse a template introduction header for a template-declaration. Returns
26962 false if tentative parse fails. */
26964 static bool
26966 {
26973 /* Look for the optional `::' operator. */
26976 /* Look for the nested-name-specifier. */
26986 /* Look up the concept for which we will be matching
26987 template parameters. */
26997 /* Look for opening brace for introduction. */
26998 matching_braces braces;
27006 /* Build vector of placeholder parameters and grab
27007 matching identifiers. */
27010 /* The introduction-list shall not be empty. */
27013 {
27016 }
27018 /* Look for closing brace for introduction. */
27023 {
27027 }
27029 /* Build and associate the constraint. */
27032 {
27034 member_p);
27036 }
27040 }
27042 /* Parse a normal template-declaration following the template keyword. */
27044 static void
27046 {
27047 tree parameter_list;
27051 /* Look for the `<' token. */
27055 {
27056 /* 14.5.2.2 [temp.mem]
27058 A local class shall not have member templates. */
27063 }
27064 /* [temp]
27066 A template ... shall not have C linkage. */
27068 {
27071 /* Give it C++ linkage to avoid confusing other parts of the
27072 front end. */
27075 }
27076 else
27079 /* We cannot perform access checks on the template parameter
27080 declarations until we know what is being declared, just as we
27081 cannot check the decl-specifier list. */
27084 /* If the next token is `>', then we have an invalid
27085 specialization. Rather than complain about an invalid template
27086 parameter, issue an error message here. */
27088 {
27092 }
27093 else
27094 {
27095 /* Parse the template parameters. */
27097 }
27099 /* Look for the `>'. */
27102 /* Manage template requirements */
27104 {
27109 }
27112 member_p);
27114 /* For the erroneous case of a template with C linkage, we pushed an
27115 implicit C++ linkage scope; exit that scope now. */
27118 }
27120 /* Parse a template-declaration, assuming that the `export' (and
27121 `extern') keywords, if present, has already been scanned. MEMBER_P
27122 is as for cp_parser_template_declaration. */
27124 static bool
27126 {
27128 {
27132 }
27137 }
27139 /* Perform the deferred access checks from a template-parameter-list.
27140 CHECKS is a TREE_LIST of access checks, as returned by
27141 get_deferred_access_checks. */
27143 static void
27144 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27145 {
27149 }
27151 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27152 `function-definition' sequence that follows a template header.
27153 If MEMBER_P is true, this declaration appears in a class scope.
27155 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27156 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27158 static tree
27164 {
27167 cp_decl_specifier_seq decl_specifiers;
27171 /* This function is only used when processing a template
27172 declaration. */
27176 /* Defer access checks until we know what is being declared. */
27179 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27180 alternative. */
27183 CP_PARSER_FLAGS_OPTIONAL,
27189 /* There are no template typedefs. */
27191 {
27195 }
27197 /* Gather up the access checks that occurred the
27198 decl-specifier-seq. */
27201 /* Check for the declaration of a template class. */
27203 {
27206 {
27207 // If this is a declaration, but not a definition, associate
27208 // any constraints with the type declaration. Constraints
27209 // are associated with definitions in cp_parser_class_specifier.
27215 /* In this case:
27217 struct C {
27218 friend template <typename T> struct A<T>::B;
27219 };
27221 A<T>::B will be represented by a TYPENAME_TYPE, and
27222 therefore not recognized by shadow_tag. */
27224 && !decl
27231 else
27234 /* Perform access checks for template parameters. */
27237 /* Give a helpful diagnostic for
27238 template <class T> struct A { } a;
27239 if we aren't already recovering from an error. */
27242 {
27244 "a class template declaration must not declare "
27248 }
27249 }
27250 }
27252 /* Complain about missing 'typename' or other invalid type names. */
27255 {
27256 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27257 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27258 the rest of this declaration. */
27261 }
27263 /* If it's not a template class, try for a template function. If
27264 the next token is a `;', then this declaration does not declare
27265 anything. But, if there were errors in the decl-specifiers, then
27266 the error might well have come from an attempted class-specifier.
27267 In that case, there's no need to warn about a missing declarator. */
27271 {
27274 checks,
27276 member_p,
27277 declares_class_or_enum,
27281 /* 7.1.1-1 [dcl.stc]
27283 A storage-class-specifier shall not be specified in an explicit
27284 specialization... */
27286 && explicit_specialization_p
27288 {
27292 }
27296 }
27298 /* Look for a trailing `;' after the declaration. */
27304 out:
27307 /* Clear any current qualification; whatever comes next is the start
27308 of something new. */
27314 }
27316 /* Parse a cast-expression that is not the operand of a unary "&". */
27318 static cp_expr
27320 {
27323 }
27325 /* Parse a functional cast to TYPE. Returns an expression
27326 representing the cast. */
27328 static cp_expr
27330 {
27332 tree expression_list;
27333 cp_expr cast;
27342 {
27352 /* Create a location of the form:
27353 type_name{i, f}
27354 ^~~~~~~~~~~~~~~
27355 with caret == start at the start of the type name,
27356 finishing at the closing brace. */
27357 location_t finish_loc
27360 finish_loc);
27363 }
27372 else
27373 {
27376 }
27379 tf_warning_or_error);
27380 /* [expr.const]/1: In an integral constant expression "only type
27381 conversions to integral or enumeration type can be used". */
27387 NIC_CONSTRUCTOR))
27390 /* Create a location of the form:
27391 float(i)
27392 ^~~~~~~~
27393 with caret == start at the start of the type name,
27394 finishing at the closing paren. */
27395 location_t finish_loc
27400 }
27402 /* Save the tokens that make up the body of a member function defined
27403 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27404 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27405 specifiers applied to the declaration. Returns the FUNCTION_DECL
27406 for the member function. */
27408 static tree
27412 tree attributes)
27413 {
27416 tree fn;
27419 /* Create the FUNCTION_DECL. */
27423 /* If something went badly wrong, bail out now. */
27425 {
27426 /* If there's a function-body, skip it. */
27431 }
27433 /* Remember it, if there default args to post process. */
27436 /* Save away the tokens that make up the body of the
27437 function. */
27443 RID_TRANSACTION_ATOMIC))
27444 {
27446 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27453 {
27459 }
27460 else
27463 {
27467 }
27468 }
27470 /* Handle function try blocks. */
27472 {
27475 }
27476 /* We can have braced-init-list mem-initializers before the fn body. */
27478 {
27481 {
27482 /* cache_group will stop after an un-nested { } pair, too. */
27486 /* variadic mem-inits have ... after the ')'. */
27489 }
27490 }
27492 /* Handle function try blocks. */
27498 /* Save away the inline definition; we will process it when the
27499 class is complete. */
27503 /* We need to know that this was defined in the class, so that
27504 friend templates are handled correctly. */
27507 /* Add FN to the queue of functions to be parsed later. */
27511 }
27513 /* Save the tokens that make up the in-class initializer for a non-static
27514 data member. Returns a DEFAULT_ARG. */
27516 static tree
27518 {
27520 }
27522 /* Parse a template-argument-list, as well as the trailing ">" (but
27523 not the opening "<"). See cp_parser_template_argument_list for the
27524 return value. */
27526 static tree
27528 {
27529 tree arguments;
27530 tree saved_scope;
27531 tree saved_qualifying_scope;
27532 tree saved_object_scope;
27537 /* [temp.names]
27539 When parsing a template-id, the first non-nested `>' is taken as
27540 the end of the template-argument-list rather than a greater-than
27541 operator. */
27542 saved_greater_than_is_operator_p
27545 /* Parsing the argument list may modify SCOPE, so we save it
27546 here. */
27550 /* We need to evaluate the template arguments, even though this
27551 template-id may be nested within a "sizeof". */
27556 /* Parse the template-argument-list itself. */
27560 else
27562 /* Look for the `>' that ends the template-argument-list. If we find
27563 a '>>' instead, it's probably just a typo. */
27565 {
27567 {
27568 /* In C++0x, a `>>' in a template argument list or cast
27569 expression is considered to be two separate `>'
27570 tokens. So, change the current token to a `>', but don't
27571 consume it: it will be consumed later when the outer
27572 template argument list (or cast expression) is parsed.
27573 Note that this replacement of `>' for `>>' is necessary
27574 even if we are parsing tentatively: in the tentative
27575 case, after calling
27576 cp_parser_enclosed_template_argument_list we will always
27577 throw away all of the template arguments and the first
27578 closing `>', either because the template argument list
27579 was erroneous or because we are replacing those tokens
27580 with a CPP_TEMPLATE_ID token. The second `>' (which will
27581 not have been thrown away) is needed either to close an
27582 outer template argument list or to complete a new-style
27583 cast. */
27586 }
27588 {
27589 /* If we're in a nested template argument list, the '>>' has
27590 to be a typo for '> >'. We emit the error message, but we
27591 continue parsing and we push a '>' as next token, so that
27592 the argument list will be parsed correctly. Note that the
27593 global source location is still on the token before the
27594 '>>', so we need to say explicitly where we want it. */
27602 }
27603 else
27604 {
27605 /* If this is not a nested template argument list, the '>>'
27606 is a typo for '>'. Emit an error message and continue.
27607 Same deal about the token location, but here we can get it
27608 right by consuming the '>>' before issuing the diagnostic. */
27611 "spurious %<>>%>, use %<>%> to terminate "
27613 }
27614 }
27615 else
27617 /* The `>' token might be a greater-than operator again now. */
27618 parser->greater_than_is_operator_p
27620 /* Restore the SAVED_SCOPE. */
27628 }
27630 /* MEMBER_FUNCTION is a member function, or a friend. If default
27631 arguments, or the body of the function have not yet been parsed,
27632 parse them now. */
27634 static void
27636 {
27638 /* If this member is a template, get the underlying
27639 FUNCTION_DECL. */
27643 /* There should not be any class definitions in progress at this
27644 point; the bodies of members are only parsed outside of all class
27645 definitions. */
27647 /* While we're parsing the member functions we might encounter more
27648 classes. We want to handle them right away, but we don't want
27649 them getting mixed up with functions that are currently in the
27650 queue. */
27653 /* Make sure that any template parameters are in scope. */
27656 /* If the body of the function has not yet been parsed, parse it
27657 now. */
27659 {
27660 tree function_scope;
27663 /* The function is no longer pending; we are processing it. */
27668 /* If this is a local class, enter the scope of the containing
27669 function. */
27674 /* Push the body of the function onto the lexer stack. */
27677 /* Let the front end know that we going to be defining this
27678 function. */
27682 /* Don't do access checking if it is a templated function. */
27686 /* #pragma omp declare reduction needs special parsing. */
27688 {
27693 }
27694 else
27695 /* Now, parse the body of the function. */
27702 /* Leave the scope of the containing function. */
27706 }
27708 /* Remove any template parameters from the symbol table. */
27711 /* Restore the queue. */
27714 }
27716 /* If DECL contains any default args, remember it on the unparsed
27717 functions queue. */
27719 static void
27721 {
27722 tree probe;
27725 probe;
27728 {
27732 }
27733 }
27735 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27736 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27737 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27738 from the parameter-type-list. */
27740 static tree
27743 {
27745 tree parsed_arg;
27751 /* Push the saved tokens for the default argument onto the parser's
27752 lexer stack. */
27758 /* Parse the default argument. */
27769 {
27770 /* In a non-template class, check conversions now. In a template,
27771 we'll wait and instantiate these as needed. */
27774 tf_warning_or_error);
27777 else
27779 }
27781 /* If the token stream has not been completely used up, then
27782 there was extra junk after the end of the default
27783 argument. */
27785 {
27788 else
27790 }
27792 /* Revert to the main lexer. */
27796 }
27798 /* FIELD is a non-static data member with an initializer which we saved for
27799 later; parse it now. */
27801 static void
27803 {
27804 tree def;
27811 NULL_TREE);
27817 }
27819 /* FN is a FUNCTION_DECL which may contains a parameter with an
27820 unparsed DEFAULT_ARG. Parse the default args now. This function
27821 assumes that the current scope is the scope in which the default
27822 argument should be processed. */
27824 static void
27826 {
27830 /* While we're parsing the default args, we might (due to the
27831 statement expression extension) encounter more classes. We want
27832 to handle them right away, but we don't want them getting mixed
27833 up with default args that are currently in the queue. */
27836 /* Local variable names (and the `this' keyword) may not appear
27837 in a default argument. */
27848 {
27850 tree parsed_arg;
27852 tree copy;
27859 /* This can happen for a friend declaration for a function
27860 already declared with default arguments. */
27863 parsed_arg
27865 default_arg,
27869 /* Update any instantiations we've already created. */
27873 }
27877 /* Make sure no default arg is missing. */
27880 /* Restore the state of local_variables_forbidden_p. */
27883 /* Restore the queue. */
27885 }
27887 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27889 sizeof ... ( identifier )
27891 where the 'sizeof' token has already been consumed. */
27893 static tree
27895 {
27896 /* Consume the `...'. */
27900 matching_parens parens;
27904 else
27912 /* The name is not qualified. */
27931 }
27933 /* Parse the operand of `sizeof' (or a similar operator). Returns
27934 either a TYPE or an expression, depending on the form of the
27935 input. The KEYWORD indicates which kind of expression we have
27936 encountered. */
27938 static tree
27940 {
27947 /* If it's a `...', then we are computing the length of a parameter
27948 pack. */
27953 /* Types cannot be defined in a `sizeof' expression. Save away the
27954 old message. */
27956 /* And create the new one. */
27962 /* The restrictions on constant-expressions do not apply inside
27963 sizeof expressions. */
27964 saved_integral_constant_expression_p
27966 saved_non_integral_constant_expression_p
27970 /* Do not actually evaluate the expression. */
27973 /* If it's a `(', then we might be looking at the type-id
27974 construction. */
27976 {
27979 /* We can't be sure yet whether we're looking at a type-id or an
27980 expression. */
27983 matching_parens parens;
27986 /* Note: as a GNU Extension, compound literals are considered
27987 postfix-expressions as they are in C99, so they are valid
27988 arguments to sizeof. See comment in cp_parser_cast_expression
27989 for details. */
27992 else
27993 {
27996 /* Look for the type-id. */
27998 /* Look for the closing `)'. */
28001 }
28003 /* If all went well, then we're done. */
28005 {
28006 cp_decl_specifier_seq decl_specs;
28008 /* Build a trivial decl-specifier-seq. */
28012 /* Call grokdeclarator to figure out what type this is. */
28015 TYPENAME,
28018 }
28019 }
28021 /* If the type-id production did not work out, then we must be
28022 looking at the unary-expression production. */
28026 /* Go back to evaluating expressions. */
28030 /* Free the message we created. */
28032 /* And restore the old one. */
28034 parser->integral_constant_expression_p
28036 parser->non_integral_constant_expression_p
28040 }
28042 /* If the current declaration has no declarator, return true. */
28044 static bool
28046 {
28047 /* If the next token is a `;' or a `,' then there is no
28048 declarator. */
28051 }
28053 /* Update the DECL_SPECS to reflect the storage class indicated by
28054 KEYWORD. */
28056 static void
28061 {
28062 cp_storage_class storage_class;
28065 {
28069 }
28071 {
28074 }
28079 {
28082 }
28085 {
28103 }
28107 /* A storage class specifier cannot be applied alongside a typedef
28108 specifier. If there is a typedef specifier present then set
28109 conflicting_specifiers_p which will trigger an error later
28110 on in grokdeclarator. */
28113 }
28115 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28116 is true, the type is a class or enum definition. */
28118 static void
28120 tree type_spec,
28123 {
28126 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28127 (with, for example, in "typedef int wchar_t;") we remember that
28128 this is what happened. In system headers, we ignore these
28129 declarations so that G++ can work with system headers that are not
28130 C++-safe. */
28132 && !type_definition_p
28142 {
28145 ds_redefined_builtin_type_spec,
28146 token);
28148 {
28152 }
28153 }
28156 else
28157 {
28162 }
28163 }
28165 /* True iff TOKEN is the GNU keyword __thread. */
28167 static bool
28169 {
28172 }
28174 /* Set the location for a declarator specifier and check if it is
28175 duplicated.
28177 DECL_SPECS is the sequence of declarator specifiers onto which to
28178 set the location.
28180 DS is the single declarator specifier to set which location is to
28181 be set onto the existing sequence of declarators.
28183 LOCATION is the location for the declarator specifier to
28184 consider. */
28186 static void
28189 {
28198 {
28202 }
28203 else
28204 {
28206 {
28210 else
28211 {
28214 OPT_Wlong_long,
28216 }
28217 }
28219 {
28224 else
28225 {
28229 }
28230 }
28231 else
28232 {
28248 "__complex"
28249 };
28253 }
28254 }
28255 }
28257 /* Return true iff the declarator specifier DS is present in the
28258 sequence of declarator specifiers DECL_SPECS. */
28260 bool
28262 cp_decl_spec ds)
28263 {
28270 }
28272 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28273 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28275 static bool
28277 {
28279 }
28281 /* Issue an error message indicating that TOKEN_DESC was expected.
28282 If KEYWORD is true, it indicated this function is called by
28283 cp_parser_require_keword and the required token can only be
28284 a indicated keyword.
28286 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28287 within any error as the location of an "opening" token matching
28288 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28289 RT_CLOSE_PAREN). */
28291 static void
28293 required_token token_desc,
28295 location_t matching_location)
28296 {
28302 {
28371 }
28374 {
28376 {
28454 }
28455 }
28459 }
28462 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28463 issue an error message indicating that TOKEN_DESC was expected.
28465 Returns the token consumed, if the token had the appropriate type.
28466 Otherwise, returns NULL.
28468 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28469 within any error as the location of an "opening" token matching
28470 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28471 RT_CLOSE_PAREN). */
28476 required_token token_desc,
28477 location_t matching_location)
28478 {
28481 else
28482 {
28483 /* Output the MESSAGE -- unless we're parsing tentatively. */
28486 matching_location);
28488 }
28489 }
28491 /* An error message is produced if the next token is not '>'.
28492 All further tokens are skipped until the desired token is
28493 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28495 static void
28497 {
28498 /* Current level of '< ... >'. */
28500 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28503 /* Are we ready, yet? If not, issue error message. */
28507 /* Skip tokens until the desired token is found. */
28509 {
28510 /* Peek at the next token. */
28512 {
28520 /* C++0x views the `>>' operator as two `>' tokens, but
28521 C++98 does not. */
28524 {
28525 /* We've hit a `>>' where the first `>' closes the
28526 template argument list, and the second `>' is
28527 spurious. Just consume the `>>' and stop; we've
28528 already produced at least one error. */
28531 }
28532 /* Fall through for C++0x, so we handle the second `>' in
28533 the `>>'. */
28538 {
28539 /* We've reached the token we want, consume it and stop. */
28542 }
28561 /* The '>' was probably forgotten, don't look further. */
28566 }
28568 /* Consume this token. */
28570 }
28571 }
28573 /* If the next token is the indicated keyword, consume it. Otherwise,
28574 issue an error message indicating that TOKEN_DESC was expected.
28576 Returns the token consumed, if the token had the appropriate type.
28577 Otherwise, returns NULL. */
28582 required_token token_desc)
28583 {
28587 {
28589 UNKNOWN_LOCATION);
28591 }
28594 }
28596 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28597 function-definition. */
28599 static bool
28601 {
28604 /* A ctor-initializer begins with a `:'. */
28606 /* A function-try-block begins with `try'. */
28608 /* A function-transaction-block begins with `__transaction_atomic'
28609 or `__transaction_relaxed'. */
28612 /* The named return value extension begins with `return'. */
28614 }
28616 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28617 definition. */
28619 static bool
28621 {
28628 }
28630 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28631 C++0x) ending a template-argument. */
28633 static bool
28635 {
28643 }
28645 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28646 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28648 static bool
28651 {
28657 /* Check for the sequence `<::' in the original code. It would be lexed as
28658 `[:', where `[' is a digraph, and there is no whitespace before
28659 `:'. */
28661 {
28666 }
28668 }
28670 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28671 or none_type otherwise. */
28673 static enum tag_types
28675 {
28677 {
28687 }
28688 }
28690 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28691 or none_type otherwise or if the token is null. */
28693 static enum tag_types
28695 {
28700 {
28708 }
28709 }
28711 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28713 static void
28715 {
28719 {
28723 type))
28726 }
28727 }
28729 /* Issue an error message if DECL is redeclared with different
28730 access than its original declaration [class.access.spec/3].
28731 This applies to nested classes, nested class templates and
28732 enumerations [class.mem/1]. */
28734 static void
28736 {
28747 }
28749 /* Look for the `template' keyword, as a syntactic disambiguator.
28750 Return TRUE iff it is present, in which case it will be
28751 consumed. */
28753 static bool
28755 {
28757 {
28758 /* In C++98 the `template' keyword can only be used within templates;
28759 outside templates the parser can always figure out what is a
28760 template and what is not. In C++11, per the resolution of DR 468,
28761 `template' is allowed in cases where it is not strictly necessary. */
28764 {
28767 "in C++98 %<template%> (as a disambiguator) is only "
28769 /* If this part of the token stream is rescanned, the same
28770 error message would be generated. So, we purge the token
28771 from the stream. */
28774 }
28775 else
28776 {
28777 /* Consume the `template' keyword. */
28780 }
28781 }
28783 }
28785 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28786 set PARSER->SCOPE, and perform other related actions. */
28788 static void
28790 {
28793 /* Get the stored value. */
28795 /* Set the scope from the stored value. */
28799 }
28801 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28802 encounter the end of a block before what we were looking for. */
28804 static bool
28808 {
28810 {
28813 /* Abort a parenthesized expression if we encounter a semicolon. */
28817 /* If we've reached the end of the file, stop. */
28823 /* We've hit the end of an enclosing block, so there's been some
28824 kind of syntax error. */
28827 /* Consume the token. */
28829 /* See if it starts a new group. */
28831 {
28833 /* In theory this should probably check end == '}', but
28834 cp_parser_save_member_function_body needs it to exit
28835 after either '}' or ')' when called with ')'. */
28838 }
28840 {
28844 }
28849 }
28850 }
28852 /* Like above, for caching a default argument or NSDMI. Both of these are
28853 terminated by a non-nested comma, but it can be unclear whether or not a
28854 comma is nested in a template argument list unless we do more parsing.
28855 In order to handle this ambiguity, when we encounter a ',' after a '<'
28856 we try to parse what follows as a parameter-declaration-list (in the
28857 case of a default argument) or a member-declarator (in the case of an
28858 NSDMI). If that succeeds, then we stop caching. */
28860 static tree
28862 {
28867 tree default_argument;
28869 /* Add tokens until we have processed the entire default
28870 argument. We add the range [first_token, token). */
28873 {
28874 /* For list-initialization, this is straightforward. */
28877 }
28879 {
28882 /* Peek at the next token. */
28884 /* What we do depends on what token we have. */
28886 {
28887 /* In valid code, a default argument must be
28888 immediately followed by a `,' `)', or `...'. */
28891 {
28892 /* If we've seen a '<', we might be in a
28893 template-argument-list. Until Core issue 325 is
28894 resolved, we don't know how this situation ought
28895 to be handled, so try to DTRT. We check whether
28896 what comes after the comma is a valid parameter
28897 declaration list. If it is, then the comma ends
28898 the default argument; otherwise the default
28899 argument continues. */
28903 /* Set ITALP so cp_parser_parameter_declaration_list
28904 doesn't decide to commit to this parse. */
28911 {
28912 /* Parse declarators until we reach a non-comma or
28913 somthing that cannot be an initializer.
28914 Just checking whether we're looking at a single
28915 declarator is insufficient. Consider:
28916 int var = tuple<T,U>::x;
28917 The template parameter 'U' looks exactly like a
28918 declarator. */
28919 do
28920 {
28931 }
28933 /* If we met an '=' or ';' then the original comma
28934 was the end of the NSDMI. Otherwise assume
28935 we're still in the NSDMI. */
28938 }
28939 else
28940 {
28945 }
28952 }
28953 /* FALLTHRU */
28956 /* If we run into a non-nested `;', `}', or `]',
28957 then the code is invalid -- but the default
28958 argument is certainly over. */
28963 /* Handle correctly int n = sizeof ... ( p ); */
28966 /* Update DEPTH, if necessary. */
28981 /* This might be the comparison operator, or it might
28982 start a template argument list. */
28989 /* Fall through for C++0x, which treats the `>>'
28990 operator like two `>' tokens in certain
28991 cases. */
28996 {
28997 /* This might be an operator, or it might close a
28998 template argument list. But if a previous '<'
28999 started a template argument list, this will have
29000 closed it, so we can't be in one anymore. */
29004 }
29007 /* If we run out of tokens, issue an error message. */
29015 /* In these cases, we should look for template-ids.
29016 For example, if the default argument is
29017 `X<int, double>()', we need to do name lookup to
29018 figure out whether or not `X' is a template; if
29019 so, the `,' does not end the default argument.
29021 That is not yet done. */
29026 }
29028 /* If we've reached the end, stop. */
29032 /* Add the token to the token block. */
29034 }
29036 /* Create a DEFAULT_ARG to represent the unparsed default
29037 argument. */
29044 }
29046 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29048 location_t
29050 {
29055 }
29057 /* Begin parsing tentatively. We always save tokens while parsing
29058 tentatively so that if the tentative parsing fails we can restore the
29059 tokens. */
29061 static void
29063 {
29064 /* Enter a new parsing context. */
29066 /* Begin saving tokens. */
29068 /* In order to avoid repetitive access control error messages,
29069 access checks are queued up until we are no longer parsing
29070 tentatively. */
29072 }
29074 /* Commit to the currently active tentative parse. */
29076 static void
29078 {
29082 /* Mark all of the levels as committed. */
29085 {
29092 }
29093 }
29095 /* Commit to the topmost currently active tentative parse.
29097 Note that this function shouldn't be called when there are
29098 irreversible side-effects while in a tentative state. For
29099 example, we shouldn't create a permanent entry in the symbol
29100 table, or issue an error message that might not apply if the
29101 tentative parse is aborted. */
29103 static void
29105 {
29110 {
29118 }
29119 }
29121 /* Abort the currently active tentative parse. All consumed tokens
29122 will be rolled back, and no diagnostics will be issued. */
29124 static void
29126 {
29130 /* Now, pretend that we want to see if the construct was
29131 successfully parsed. */
29133 }
29135 /* Stop parsing tentatively. If a parse error has occurred, restore the
29136 token stream. Otherwise, commit to the tokens we have consumed.
29137 Returns true if no error occurred; false otherwise. */
29139 static bool
29141 {
29145 /* Remember whether or not an error occurred, since we are about to
29146 destroy that information. */
29148 /* Remove the topmost context from the stack. */
29151 /* If no parse errors occurred, commit to the tentative parse. */
29153 {
29154 /* Commit to the tokens read tentatively, unless that was
29155 already done. */
29160 }
29161 /* Otherwise, if errors occurred, roll back our state so that things
29162 are just as they were before we began the tentative parse. */
29163 else
29164 {
29167 }
29168 /* Add the context to the front of the free list. */
29173 }
29175 /* Returns true if we are parsing tentatively and are not committed to
29176 this tentative parse. */
29178 static bool
29180 {
29183 }
29185 /* Returns nonzero iff an error has occurred during the most recent
29186 tentative parse. */
29188 static bool
29190 {
29193 }
29195 /* Returns nonzero if GNU extensions are allowed. */
29197 static bool
29199 {
29201 }
29202 \f
29203 /* Objective-C++ Productions */
29206 /* Parse an Objective-C expression, which feeds into a primary-expression
29207 above.
29209 objc-expression:
29210 objc-message-expression
29211 objc-string-literal
29212 objc-encode-expression
29213 objc-protocol-expression
29214 objc-selector-expression
29216 Returns a tree representation of the expression. */
29218 static cp_expr
29220 {
29221 /* Try to figure out what kind of declaration is present. */
29225 {
29235 {
29247 }
29248 /* FALLTHRU */
29254 }
29257 }
29259 /* Parse an Objective-C message expression.
29261 objc-message-expression:
29262 [ objc-message-receiver objc-message-args ]
29264 Returns a representation of an Objective-C message. */
29266 static tree
29268 {
29280 /* Construct a location e.g.
29281 [self func1:5]
29282 ^~~~~~~~~~~~~~
29283 ranging from the '[' to the ']', with the caret at the start. */
29288 }
29290 /* Parse an objc-message-receiver.
29292 objc-message-receiver:
29293 expression
29294 simple-type-specifier
29296 Returns a representation of the type or expression. */
29298 static tree
29300 {
29301 tree rcv;
29303 /* An Objective-C message receiver may be either (1) a type
29304 or (2) an expression. */
29308 /* If that worked out, fine. */
29315 CP_PARSER_FLAGS_NONE);
29322 }
29324 /* Parse the arguments and selectors comprising an Objective-C message.
29326 objc-message-args:
29327 objc-selector
29328 objc-selector-args
29329 objc-selector-args , objc-comma-args
29331 objc-selector-args:
29332 objc-selector [opt] : assignment-expression
29333 objc-selector-args objc-selector [opt] : assignment-expression
29335 objc-comma-args:
29336 assignment-expression
29337 objc-comma-args , assignment-expression
29339 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29340 selector arguments and TREE_VALUE containing a list of comma
29341 arguments. */
29343 static tree
29345 {
29351 {
29357 /* Detect if we have a unary selector. */
29366 sel_args
29371 }
29373 /* Handle non-selector arguments, if any. */
29375 {
29376 tree arg;
29381 addl_args
29386 }
29389 {
29392 }
29395 }
29397 /* Parse an Objective-C encode expression.
29399 objc-encode-expression:
29400 @encode objc-typename
29402 Returns an encoded representation of the type argument. */
29404 static cp_expr
29406 {
29407 tree type;
29412 matching_parens parens;
29419 {
29423 }
29425 /* This happens if we find @encode(T) (where T is a template
29426 typename or something dependent on a template typename) when
29427 parsing a template. In that case, we can't compile it
29428 immediately, but we rather create an AT_ENCODE_EXPR which will
29429 need to be instantiated when the template is used.
29430 */
29432 {
29436 }
29439 /* Build a location of the form:
29440 @encode(int)
29441 ^~~~~~~~~~~~
29442 with caret==start at the @ token, finishing at the close paren. */
29443 location_t combined_loc
29448 }
29450 /* Parse an Objective-C @defs expression. */
29452 static tree
29454 {
29455 tree name;
29458 matching_parens parens;
29464 }
29466 /* Parse an Objective-C protocol expression.
29468 objc-protocol-expression:
29469 @protocol ( identifier )
29471 Returns a representation of the protocol expression. */
29473 static tree
29475 {
29476 tree proto;
29480 matching_parens parens;
29485 /* Build a location of the form:
29486 @protocol(prot)
29487 ^~~~~~~~~~~~~~~
29488 with caret==start at the @ token, finishing at the close paren. */
29489 location_t combined_loc
29495 }
29497 /* Parse an Objective-C selector expression.
29499 objc-selector-expression:
29500 @selector ( objc-method-signature )
29502 objc-method-signature:
29503 objc-selector
29504 objc-selector-seq
29506 objc-selector-seq:
29507 objc-selector :
29508 objc-selector-seq objc-selector :
29510 Returns a representation of the method selector. */
29512 static tree
29514 {
29521 matching_parens parens;
29527 {
29536 {
29537 /* Detect if we have a unary selector. */
29539 {
29542 }
29543 else
29544 {
29546 }
29547 }
29552 {
29553 sel_seq
29556 sel_seq
29559 }
29560 else
29561 sel_seq
29566 }
29568 finish_selector:
29572 /* Build a location of the form:
29573 @selector(func)
29574 ^~~~~~~~~~~~~~~
29575 with caret==start at the @ token, finishing at the close paren. */
29576 location_t combined_loc
29580 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29583 }
29585 /* Parse a list of identifiers.
29587 objc-identifier-list:
29588 identifier
29589 objc-identifier-list , identifier
29591 Returns a TREE_LIST of identifier nodes. */
29593 static tree
29595 {
29596 tree identifier;
29597 tree list;
29608 {
29615 identifier));
29617 }
29620 }
29622 /* Parse an Objective-C alias declaration.
29624 objc-alias-declaration:
29625 @compatibility_alias identifier identifier ;
29627 This function registers the alias mapping with the Objective-C front end.
29628 It returns nothing. */
29630 static void
29632 {
29640 }
29642 /* Parse an Objective-C class forward-declaration.
29644 objc-class-declaration:
29645 @class objc-identifier-list ;
29647 The function registers the forward declarations with the Objective-C
29648 front end. It returns nothing. */
29650 static void
29652 {
29655 {
29656 tree id;
29666 else
29668 }
29670 }
29672 /* Parse a list of Objective-C protocol references.
29674 objc-protocol-refs-opt:
29675 objc-protocol-refs [opt]
29677 objc-protocol-refs:
29678 < objc-identifier-list >
29680 Returns a TREE_LIST of identifiers, if any. */
29682 static tree
29684 {
29688 {
29692 }
29695 }
29697 /* Parse a Objective-C visibility specification. */
29699 static void
29701 {
29705 {
29720 }
29722 /* Eat '@private'/'@protected'/'@public'. */
29724 }
29726 /* Parse an Objective-C method type. Return 'true' if it is a class
29727 (+) method, and 'false' if it is an instance (-) method. */
29731 {
29734 else
29736 }
29738 /* Parse an Objective-C protocol qualifier. */
29740 static tree
29742 {
29755 {
29760 }
29763 }
29765 /* Parse an Objective-C typename. */
29767 static tree
29769 {
29773 {
29776 matching_parens parens;
29780 /* An ObjC type name may consist of just protocol qualifiers, in which
29781 case the type shall default to 'id'. */
29783 {
29786 /* If the type could not be parsed, an error has already
29787 been produced. For error recovery, behave as if it had
29788 not been specified, which will use the default type
29789 'id'. */
29791 {
29793 /* We need to skip to the closing parenthesis as
29794 cp_parser_type_id() does not seem to do it for
29795 us. */
29800 }
29801 }
29805 }
29808 }
29810 /* Check to see if TYPE refers to an Objective-C selector name. */
29812 static bool
29814 {
29820 }
29822 /* Parse an Objective-C selector. */
29824 static tree
29826 {
29830 {
29833 }
29835 /* C++ operator names are allowed to appear in ObjC selectors. */
29837 {
29850 }
29851 }
29853 /* Parse an Objective-C params list. */
29855 static tree
29857 {
29863 {
29873 /* Detect if we have a unary selector. */
29876 {
29879 }
29883 {
29884 /* Something went quite wrong. There should be a colon
29885 here, but there is not. Stop parsing parameters. */
29887 }
29889 /* New ObjC allows attributes on parameters too. */
29894 params
29897 type_name,
29898 identifier,
29899 parm_attr));
29902 }
29905 {
29908 }
29910 /* We allow tail attributes for the method. */
29912 {
29920 }
29923 {
29926 }
29928 }
29930 /* Parse the non-keyword Objective-C params. */
29932 static tree
29935 {
29941 {
29943 tree parm;
29949 {
29954 }
29956 /* TODO: parse attributes for tail parameters. */
29965 }
29967 /* We allow tail attributes for the method. */
29969 {
29971 {
29976 }
29977 else
29978 /* We have an error, but parse the attributes, so that we can
29979 carry on. */
29985 }
29988 }
29990 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29992 static void
29994 {
29997 /* If the next token is `extern' and the following token is a string
29998 literal, then we have a linkage specification. */
30000 && cp_parser_is_pure_string_literal
30003 /* Handle #pragma, if any. */
30006 /* Allow stray semicolons. */
30009 /* Mark methods as optional or required, when building protocols. */
30011 {
30014 }
30016 {
30019 }
30022 /* Other stray characters must generate errors. */
30024 {
30028 }
30029 /* Finally, try to parse a block-declaration, or a function-definition. */
30030 else
30032 }
30034 /* Parse a method signature. */
30036 static tree
30038 {
30054 }
30056 static bool
30058 {
30059 tree tattr;
30064 /* If the attributes are followed by a method introducer, this is not allowed.
30065 Dump the attributes and flag the situation. */
30070 /* Otherwise, the attributes introduce some interstitial code, possibly so
30071 rewind to allow that check. */
30074 }
30076 /* Parse an Objective-C method prototype list. */
30078 static void
30080 {
30084 {
30086 {
30091 else
30095 {
30099 }
30102 }
30108 OPT_Wattributes,
30110 else
30111 /* Allow for interspersed non-ObjC++ code. */
30115 }
30119 else
30123 }
30125 /* Parse an Objective-C method definition list. */
30127 static void
30129 {
30133 {
30134 tree meth;
30137 {
30143 else
30148 {
30152 }
30154 NULL_TREE);
30156 /* For historical reasons, we accept an optional semicolon. */
30163 {
30170 }
30171 }
30172 /* The following case will be removed once @synthesize is
30173 completely implemented. */
30184 else
30185 /* Allow for interspersed non-ObjC++ code. */
30189 }
30193 else
30197 }
30199 /* Parse Objective-C ivars. */
30201 static void
30203 {
30214 {
30215 cp_decl_specifier_seq declspecs;
30217 tree prefix_attributes;
30225 CP_PARSER_FLAGS_OPTIONAL,
30229 /* auto, register, static, extern, mutable. */
30231 {
30234 }
30236 /* thread_local. */
30238 {
30241 }
30243 /* typedef. */
30245 {
30248 }
30253 /* Keep going until we hit the `;' at the end of the
30254 declaration. */
30256 {
30261 /* Check for a (possibly unnamed) bitfield declaration. */
30269 {
30270 /* Get the name of the bitfield. */
30273 sfk_none);
30275 eat_colon:
30277 /* Get the width of the bitfield. */
30278 width
30280 }
30281 else
30282 {
30283 /* Parse the declarator. */
30284 declarator
30290 }
30292 /* Look for attributes that apply to the ivar. */
30294 /* Remember which attributes are prefix attributes and
30295 which are not. */
30297 /* Combine the attributes. */
30301 /* Create the bitfield declaration. */
30304 else
30309 /* Add the instance variable. */
30313 /* Reset PREFIX_ATTRIBUTES. */
30315 {
30320 }
30325 {
30328 }
30330 }
30334 }
30339 /* Do not consume the RID_AT_END, so it will be read again as terminating
30340 the @interface of @implementation. */
30344 /* For historical reasons, we accept an optional semicolon. */
30347 }
30349 /* Parse an Objective-C protocol declaration. */
30351 static void
30353 {
30359 {
30364 }
30366 /* See if we have a forward declaration or a definition. */
30369 /* Try a forward declaration first. */
30371 {
30373 {
30374 tree id;
30384 else
30386 }
30388 }
30390 /* Ok, we got a full-fledged definition (or at least should). */
30391 else
30392 {
30397 }
30398 }
30400 /* Parse an Objective-C superclass or category. */
30402 static void
30407 {
30413 {
30416 }
30418 {
30419 matching_parens parens;
30422 /* If there is no category name, and this is an @interface, we
30423 have a class extension. */
30425 {
30428 }
30429 else
30433 }
30434 }
30436 /* Parse an Objective-C class interface. */
30438 static void
30440 {
30447 {
30448 /* It's hard to recover because even if valid @interface stuff
30449 is to follow, we can't compile it (or validate it) if we
30450 don't even know which class it refers to. Let's assume this
30451 was a stray '@interface' token in the stream and skip it.
30452 */
30454 }
30459 /* We have either a class or a category on our hands. */
30462 else
30463 {
30465 /* Handle instance variable declarations, if any. */
30468 }
30471 }
30473 /* Parse an Objective-C class implementation. */
30475 static void
30477 {
30484 {
30485 /* It's hard to recover because even if valid @implementation
30486 stuff is to follow, we can't compile it (or validate it) if
30487 we don't even know which class it refers to. Let's assume
30488 this was a stray '@implementation' token in the stream and
30489 skip it.
30490 */
30492 }
30496 /* We have either a class or a category on our hands. */
30499 else
30500 {
30502 /* Handle instance variable declarations, if any. */
30505 }
30508 }
30510 /* Consume the @end token and finish off the implementation. */
30512 static void
30514 {
30517 }
30519 /* Parse an Objective-C declaration. */
30521 static void
30523 {
30524 /* Try to figure out what kind of declaration is present. */
30529 {
30545 }
30548 {
30571 }
30572 }
30574 /* Parse an Objective-C try-catch-finally statement.
30576 objc-try-catch-finally-stmt:
30577 @try compound-statement objc-catch-clause-seq [opt]
30578 objc-finally-clause [opt]
30580 objc-catch-clause-seq:
30581 objc-catch-clause objc-catch-clause-seq [opt]
30583 objc-catch-clause:
30584 @catch ( objc-exception-declaration ) compound-statement
30586 objc-finally-clause:
30587 @finally compound-statement
30589 objc-exception-declaration:
30590 parameter-declaration
30591 '...'
30593 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30595 Returns NULL_TREE.
30597 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30598 for C. Keep them in sync. */
30600 static tree
30602 {
30603 location_t location;
30604 tree stmt;
30609 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30610 node, lest it get absorbed into the surrounding block. */
30616 {
30620 matching_parens parens;
30626 {
30627 /* We have "@catch (...)" (where the '...' are literally
30628 what is in the code). Skip the '...'.
30629 parameter_declaration is set to NULL_TREE, and
30630 objc_being_catch_clauses() knows that that means
30631 '...'. */
30634 }
30635 else
30636 {
30637 /* We have "@catch (NSException *exception)" or something
30638 like that. Parse the parameter declaration. */
30642 else
30647 }
30650 else
30651 {
30652 /* If there was no open parenthesis, we are recovering from
30653 an error, and we are trying to figure out what mistake
30654 the user has made. */
30656 /* If there is an immediate closing parenthesis, the user
30657 probably forgot the opening one (ie, they typed "@catch
30658 NSException *e)". Parse the closing parenthesis and keep
30659 going. */
30663 /* If these is no immediate closing parenthesis, the user
30664 probably doesn't know that parenthesis are required at
30665 all (ie, they typed "@catch NSException *e"). So, just
30666 forget about the closing parenthesis and keep going. */
30667 }
30671 }
30673 {
30676 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30677 node, lest it get absorbed into the surrounding block. */
30681 }
30684 }
30686 /* Parse an Objective-C synchronized statement.
30688 objc-synchronized-stmt:
30689 @synchronized ( expression ) compound-statement
30691 Returns NULL_TREE. */
30693 static tree
30695 {
30696 location_t location;
30703 matching_parens parens;
30708 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30709 node, lest it get absorbed into the surrounding block. */
30714 }
30716 /* Parse an Objective-C throw statement.
30718 objc-throw-stmt:
30719 @throw assignment-expression [opt] ;
30721 Returns a constructed '@throw' statement. */
30723 static tree
30725 {
30737 }
30739 /* Parse an Objective-C statement. */
30741 static tree
30743 {
30744 /* Try to figure out what kind of declaration is present. */
30748 {
30759 }
30762 }
30764 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30765 look ahead to see if an objc keyword follows the attributes. This
30766 is to detect the use of prefix attributes on ObjC @interface and
30767 @protocol. */
30769 static bool
30771 {
30776 {
30779 }
30782 }
30784 /* This routine is a minimal replacement for
30785 c_parser_struct_declaration () used when parsing the list of
30786 types/names or ObjC++ properties. For example, when parsing the
30787 code
30789 @property (readonly) int a, b, c;
30791 this function is responsible for parsing "int a, int b, int c" and
30792 returning the declarations as CHAIN of DECLs.
30794 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30795 similar parsing. */
30796 static tree
30798 {
30800 cp_decl_specifier_seq declspecs;
30802 tree prefix_attributes;
30805 CP_PARSER_FLAGS_NONE,
30812 /* auto, register, static, extern, mutable. */
30814 {
30817 }
30819 /* thread_local. */
30821 {
30824 }
30826 /* typedef. */
30828 {
30831 }
30836 /* Keep going until we hit the `;' at the end of the declaration. */
30838 {
30843 /* Parse the declarator. */
30847 /* Look for attributes that apply to the ivar. */
30849 /* Remember which attributes are prefix attributes and
30850 which are not. */
30852 /* Combine the attributes. */
30862 /* Reset PREFIX_ATTRIBUTES. */
30864 {
30869 }
30876 {
30879 }
30880 else
30882 }
30884 }
30886 /* Parse an Objective-C @property declaration. The syntax is:
30888 objc-property-declaration:
30889 '@property' objc-property-attributes[opt] struct-declaration ;
30891 objc-property-attributes:
30892 '(' objc-property-attribute-list ')'
30894 objc-property-attribute-list:
30895 objc-property-attribute
30896 objc-property-attribute-list, objc-property-attribute
30898 objc-property-attribute
30899 'getter' = identifier
30900 'setter' = identifier
30901 'readonly'
30902 'readwrite'
30903 'assign'
30904 'retain'
30905 'copy'
30906 'nonatomic'
30908 For example:
30909 @property NSString *name;
30910 @property (readonly) id object;
30911 @property (retain, nonatomic, getter=getTheName) id name;
30912 @property int a, b, c;
30914 PS: This function is identical to
30915 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30916 static void
30918 {
30919 /* The following variables hold the attributes of the properties as
30920 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30921 seen. When we see an attribute, we set them to 'true' (if they
30922 are boolean properties) or to the identifier (if they have an
30923 argument, ie, for getter and setter). Note that here we only
30924 parse the list of attributes, check the syntax and accumulate the
30925 attributes that we find. objc_add_property_declaration() will
30926 then process the information. */
30936 /* 'properties' is the list of properties that we read. Usually a
30937 single one, but maybe more (eg, in "@property int a, b, c;" there
30938 are three). */
30939 tree properties;
30940 location_t loc;
30946 /* Parse the optional attribute list... */
30948 {
30949 /* Eat the '('. */
30950 matching_parens parens;
30954 {
30960 {
30963 }
30967 {
30978 {
30982 else
30987 }
30990 {
30994 }
30996 {
30998 {
31001 }
31002 else
31006 else
31008 }
31009 else
31010 {
31012 {
31015 }
31016 else
31018 }
31024 }
31031 else
31033 }
31035 /* FIXME: "@property (setter, assign);" will generate a spurious
31036 "error: expected ‘)’ before ‘,’ token". This is because
31037 cp_parser_require, unlike the C counterpart, will produce an
31038 error even if we are in error recovery. */
31040 {
31045 }
31046 }
31048 /* ... and the property declaration(s). */
31052 {
31054 /* If the next token is now a `;', consume it. */
31058 }
31062 else
31063 {
31064 /* Comma-separated properties are chained together in
31065 reverse order; add them one by one. */
31074 }
31077 }
31079 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31081 objc-synthesize-declaration:
31082 @synthesize objc-synthesize-identifier-list ;
31084 objc-synthesize-identifier-list:
31085 objc-synthesize-identifier
31086 objc-synthesize-identifier-list, objc-synthesize-identifier
31088 objc-synthesize-identifier
31089 identifier
31090 identifier = identifier
31092 For example:
31093 @synthesize MyProperty;
31094 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31096 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31097 for C. Keep them in sync.
31098 */
31099 static void
31101 {
31103 location_t loc;
31108 {
31112 {
31115 }
31117 {
31121 {
31124 }
31125 }
31126 else
31131 else
31133 }
31136 }
31138 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31140 objc-dynamic-declaration:
31141 @dynamic identifier-list ;
31143 For example:
31144 @dynamic MyProperty;
31145 @dynamic MyProperty, AnotherProperty;
31147 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31148 for C. Keep them in sync.
31149 */
31150 static void
31152 {
31154 location_t loc;
31159 {
31160 tree property;
31163 {
31166 }
31170 else
31172 }
31175 }
31177 \f
31178 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31180 /* Returns name of the next clause.
31181 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31182 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31183 returned and the token is consumed. */
31185 static pragma_omp_clause
31187 {
31203 {
31208 {
31385 }
31386 }
31392 }
31394 /* Validate that a clause of the given type does not already exist. */
31396 static void
31399 {
31400 tree c;
31404 {
31407 }
31408 }
31410 /* OpenMP 2.5:
31411 variable-list:
31412 identifier
31413 variable-list , identifier
31415 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31416 colon). An opening parenthesis will have been consumed by the caller.
31418 If KIND is nonzero, create the appropriate node and install the decl
31419 in OMP_CLAUSE_DECL and add the node to the head of the list.
31421 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31422 return the list created.
31424 COLON can be NULL if only closing parenthesis should end the list,
31425 or pointer to bool which will receive false if the list is terminated
31426 by closing parenthesis or true if the list is terminated by colon. */
31428 static tree
31431 {
31435 {
31438 }
31440 {
31445 && current_class_ptr
31447 {
31453 }
31454 else
31455 {
31466 else
31471 }
31473 ;
31475 {
31477 {
31479 /* The OpenACC cache directive explicitly only allows "array
31480 elements or subarrays". */
31482 {
31486 }
31487 /* FALLTHROUGH. */
31492 {
31493 location_t loc
31498 decl
31502 }
31503 /* FALLTHROUGH. */
31507 {
31515 parser->colon_corrects_to_scope_p
31519 else
31520 {
31521 /* Look for `:'. */
31525 CPP_CLOSE_SQUARE))
31527 }
31528 /* Look for the closing `]'. */
31530 RT_CLOSE_SQUARE))
31534 }
31538 }
31544 }
31545 else
31548 get_comma:
31552 }
31558 {
31562 }
31565 {
31568 /* Try to resync to an unnested comma. Copied from
31569 cp_parser_parenthesized_expression_list. */
31570 skip_comma:
31579 }
31582 }
31584 /* Similarly, but expect leading and trailing parenthesis. This is a very
31585 common case for omp clauses. */
31587 static tree
31589 {
31593 }
31595 /* OpenACC 2.0:
31596 copy ( variable-list )
31597 copyin ( variable-list )
31598 copyout ( variable-list )
31599 create ( variable-list )
31600 delete ( variable-list )
31601 present ( variable-list )
31602 present_or_copy ( variable-list )
31603 pcopy ( variable-list )
31604 present_or_copyin ( variable-list )
31605 pcopyin ( variable-list )
31606 present_or_copyout ( variable-list )
31607 pcopyout ( variable-list )
31608 present_or_create ( variable-list )
31609 pcreate ( variable-list ) */
31611 static tree
31613 tree list)
31614 {
31617 {
31663 }
31671 }
31673 /* OpenACC 2.0:
31674 deviceptr ( variable-list ) */
31676 static tree
31678 {
31682 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31683 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31684 variable-list must only allow for pointer variables. */
31687 {
31694 }
31697 }
31699 /* OpenACC 2.0:
31700 auto
31701 independent
31702 nohost
31703 seq */
31705 static tree
31709 {
31714 }
31716 /* OpenACC:
31717 num_gangs ( expression )
31718 num_workers ( expression )
31719 vector_length ( expression ) */
31721 static tree
31724 {
31727 matching_parens parens;
31735 {
31740 }
31748 }
31750 /* OpenACC:
31752 gang [( gang-arg-list )]
31753 worker [( [num:] int-expr )]
31754 vector [( [length:] int-expr )]
31756 where gang-arg is one of:
31758 [num:] int-expr
31759 static: size-expr
31761 and size-expr may be:
31763 *
31764 int-expr
31765 */
31767 static tree
31770 {
31780 {
31781 matching_parens parens;
31784 do
31785 {
31789 /* Gang static argument. */
31792 {
31800 {
31803 }
31805 /* Check for the '*' argument. */
31809 CPP_CLOSE_PAREN)))
31810 {
31815 {
31818 }
31820 }
31821 }
31822 /* Worker num: argument and vector length: arguments. */
31826 {
31829 }
31831 /* Now collect the actual argument. */
31833 {
31836 }
31848 {
31851 }
31853 }
31858 }
31872 cleanup_error:
31875 }
31877 /* OpenACC 2.0:
31878 tile ( size-expr-list ) */
31880 static tree
31882 {
31886 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31887 so, but the spec authors never considered such a case and have
31888 differing opinions on what it might mean, including 'not
31889 allowed'.) */
31892 clause_loc);
31897 do
31898 {
31905 {
31908 }
31909 else
31913 }
31916 /* Consume the trailing ')'. */
31924 }
31926 /* OpenACC 2.0
31927 Parse wait clause or directive parameters. */
31929 static tree
31931 {
31941 {
31946 }
31953 {
31957 {
31960 else
31961 {
31968 }
31969 }
31970 }
31973 }
31975 /* OpenACC:
31976 wait ( int-expr-list ) */
31978 static tree
31980 {
31989 }
31991 /* OpenMP 3.0:
31992 collapse ( constant-expression ) */
31994 static tree
31996 {
31998 location_t loc;
31999 HOST_WIDE_INT n;
32002 matching_parens parens;
32020 {
32023 }
32032 }
32034 /* OpenMP 2.5:
32035 default ( none | shared )
32037 OpenACC:
32038 default ( none | present ) */
32040 static tree
32043 {
32045 tree c;
32047 matching_parens parens;
32051 {
32056 {
32077 }
32080 }
32081 else
32082 {
32083 invalid_kind:
32086 else
32088 }
32105 }
32107 /* OpenMP 3.1:
32108 final ( expression ) */
32110 static tree
32112 {
32115 matching_parens parens;
32134 }
32136 /* OpenMP 2.5:
32137 if ( expression )
32139 OpenMP 4.5:
32140 if ( directive-name-modifier : expression )
32142 directive-name-modifier:
32143 parallel | task | taskloop | target data | target | target update
32144 | target enter data | target exit data */
32146 static tree
32149 {
32153 matching_parens parens;
32158 {
32170 {
32173 {
32186 else
32187 {
32188 location_t loc
32193 }
32196 {
32198 {
32203 }
32205 {
32206 location_t loc
32210 }
32211 }
32212 }
32213 }
32215 {
32217 {
32220 }
32221 else
32222 {
32224 {
32225 location_t loc
32228 }
32230 }
32231 }
32232 }
32244 {
32247 {
32250 {
32260 }
32262 p);
32264 }
32266 {
32269 else
32272 }
32275 {
32279 }
32280 }
32288 }
32290 /* OpenMP 3.1:
32291 mergeable */
32293 static tree
32296 {
32297 tree c;
32300 location);
32305 }
32307 /* OpenMP 2.5:
32308 nowait */
32310 static tree
32313 {
32314 tree c;
32321 }
32323 /* OpenMP 2.5:
32324 num_threads ( expression ) */
32326 static tree
32328 location_t location)
32329 {
32332 matching_parens parens;
32352 }
32354 /* OpenMP 4.5:
32355 num_tasks ( expression ) */
32357 static tree
32359 location_t location)
32360 {
32363 matching_parens parens;
32383 }
32385 /* OpenMP 4.5:
32386 grainsize ( expression ) */
32388 static tree
32390 location_t location)
32391 {
32394 matching_parens parens;
32414 }
32416 /* OpenMP 4.5:
32417 priority ( expression ) */
32419 static tree
32421 location_t location)
32422 {
32425 matching_parens parens;
32445 }
32447 /* OpenMP 4.5:
32448 hint ( expression ) */
32450 static tree
32452 location_t location)
32453 {
32456 matching_parens parens;
32475 }
32477 /* OpenMP 4.5:
32478 defaultmap ( tofrom : scalar ) */
32480 static tree
32482 location_t location)
32483 {
32487 matching_parens parens;
32492 {
32495 }
32499 {
32502 }
32508 {
32511 }
32515 {
32518 }
32524 location);
32530 out_err:
32535 }
32537 /* OpenMP 2.5:
32538 ordered
32540 OpenMP 4.5:
32541 ordered ( constant-expression ) */
32543 static tree
32546 {
32548 HOST_WIDE_INT n;
32554 {
32555 matching_parens parens;
32572 {
32574 "ordered argument needs positive constant integer "
32577 }
32578 }
32584 }
32586 /* OpenMP 2.5:
32587 reduction ( reduction-operator : variable-list )
32589 reduction-operator:
32590 One of: + * - & ^ | && ||
32592 OpenMP 3.1:
32594 reduction-operator:
32595 One of: + * - & ^ | && || min max
32597 OpenMP 4.0:
32599 reduction-operator:
32600 One of: + * - & ^ | && ||
32601 id-expression */
32603 static tree
32605 {
32613 {
32623 }
32627 else
32628 {
32639 {
32669 }
32670 else
32671 {
32673 resync_fail:
32678 }
32679 }
32685 NULL);
32687 {
32690 }
32693 }
32695 /* OpenMP 2.5:
32696 schedule ( schedule-kind )
32697 schedule ( schedule-kind , expression )
32699 schedule-kind:
32700 static | dynamic | guided | runtime | auto
32702 OpenMP 4.5:
32703 schedule ( schedule-modifier : schedule-kind )
32704 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32706 schedule-modifier:
32707 simd
32708 monotonic
32709 nonmonotonic */
32711 static tree
32713 {
32717 matching_parens parens;
32724 {
32733 else
32739 else
32740 {
32743 }
32744 }
32747 {
32752 {
32773 }
32774 }
32779 else
32785 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32787 {
32791 }
32794 {
32809 else
32814 }
32826 invalid_kind:
32828 resync_fail:
32833 }
32835 /* OpenMP 3.0:
32836 untied */
32838 static tree
32841 {
32842 tree c;
32849 }
32851 /* OpenMP 4.0:
32852 inbranch
32853 notinbranch */
32855 static tree
32858 {
32863 }
32865 /* OpenMP 4.0:
32866 parallel
32867 for
32868 sections
32869 taskgroup */
32871 static tree
32875 {
32879 }
32881 /* OpenMP 4.5:
32882 nogroup */
32884 static tree
32887 {
32892 }
32894 /* OpenMP 4.5:
32895 simd
32896 threads */
32898 static tree
32902 {
32907 }
32909 /* OpenMP 4.0:
32910 num_teams ( expression ) */
32912 static tree
32914 location_t location)
32915 {
32918 matching_parens parens;
32938 }
32940 /* OpenMP 4.0:
32941 thread_limit ( expression ) */
32943 static tree
32945 location_t location)
32946 {
32949 matching_parens parens;
32969 }
32971 /* OpenMP 4.0:
32972 aligned ( variable-list )
32973 aligned ( variable-list : constant-expression ) */
32975 static tree
32977 {
32981 matching_parens parens;
32989 {
32999 }
33005 }
33007 /* OpenMP 4.0:
33008 linear ( variable-list )
33009 linear ( variable-list : expression )
33011 OpenMP 4.5:
33012 linear ( modifier ( variable-list ) )
33013 linear ( modifier ( variable-list ) : expression ) */
33015 static tree
33018 {
33023 matching_parens parens;
33028 {
33040 else
33042 }
33047 else
33048 {
33057 }
33060 {
33065 {
33076 {
33079 }
33082 }
33093 }
33096 {
33099 }
33102 }
33104 /* OpenMP 4.0:
33105 safelen ( constant-expression ) */
33107 static tree
33109 location_t location)
33110 {
33113 matching_parens parens;
33132 }
33134 /* OpenMP 4.0:
33135 simdlen ( constant-expression ) */
33137 static tree
33139 location_t location)
33140 {
33143 matching_parens parens;
33162 }
33164 /* OpenMP 4.5:
33165 vec:
33166 identifier [+/- integer]
33167 vec , identifier [+/- integer]
33168 */
33170 static tree
33172 tree list)
33173 {
33177 {
33180 }
33183 {
33190 else
33191 {
33192 t = cp_parser_lookup_name_simple
33197 id_loc);
33198 }
33204 {
33207 }
33211 {
33214 }
33218 {
33221 }
33224 add_to_vector:
33226 {
33230 }
33236 }
33239 {
33245 }
33247 }
33249 /* OpenMP 4.0:
33250 depend ( depend-kind : variable-list )
33252 depend-kind:
33253 in | out | inout
33255 OpenMP 4.5:
33256 depend ( source )
33258 depend ( sink : vec ) */
33260 static tree
33262 {
33266 matching_parens parens;
33271 {
33285 else
33287 }
33288 else
33294 {
33304 }
33311 else
33312 {
33318 }
33321 invalid_kind:
33323 resync_fail:
33328 }
33330 /* OpenMP 4.0:
33331 map ( map-kind : variable-list )
33332 map ( variable-list )
33334 map-kind:
33335 alloc | to | from | tofrom
33337 OpenMP 4.5:
33338 map-kind:
33339 alloc | to | from | tofrom | release | delete
33341 map ( always [,] map-kind: variable-list ) */
33343 static tree
33345 {
33354 {
33359 {
33362 nth++;
33368 {
33373 }
33374 }
33375 }
33379 {
33393 else
33394 {
33400 }
33403 }
33406 {
33410 }
33413 NULL);
33419 }
33421 /* OpenMP 4.0:
33422 device ( expression ) */
33424 static tree
33426 location_t location)
33427 {
33430 matching_parens parens;
33450 }
33452 /* OpenMP 4.0:
33453 dist_schedule ( static )
33454 dist_schedule ( static , expression ) */
33456 static tree
33458 location_t location)
33459 {
33462 matching_parens parens;
33473 {
33484 }
33489 location);
33493 invalid_kind:
33495 resync_fail:
33500 }
33502 /* OpenMP 4.0:
33503 proc_bind ( proc-bind-kind )
33505 proc-bind-kind:
33506 master | close | spread */
33508 static tree
33510 location_t location)
33511 {
33512 tree c;
33519 {
33529 else
33531 }
33532 else
33541 location);
33546 invalid_kind:
33548 resync_fail:
33553 }
33555 /* OpenACC:
33556 async [( int-expr )] */
33558 static tree
33560 {
33567 {
33568 matching_parens parens;
33577 }
33587 }
33589 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33590 is a bitmask in MASK. Return the list of clauses found. */
33592 static tree
33596 {
33601 {
33602 location_t here;
33603 pragma_omp_clause c_kind;
33604 omp_clause_code code;
33615 {
33667 clauses);
33685 OMP_CLAUSE_INDEPENDENT,
33697 clauses);
33703 clauses);
33727 clauses);
33749 clauses);
33761 clauses);
33775 }
33780 {
33781 /* Remove the invalid clause(s) from the list to avoid
33782 confusing the rest of the compiler. */
33785 }
33786 }
33788 saw_error:
33795 }
33797 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33798 is a bitmask in MASK. Return the list of clauses found; the result
33799 of clause default goes in *pdefault. */
33801 static tree
33805 {
33811 {
33812 pragma_omp_clause c_kind;
33823 {
33835 clauses);
33849 clauses);
33869 clauses);
33874 clauses);
33884 clauses);
33918 clauses);
33932 clauses);
33947 OMP_CLAUSE_NOTINBRANCH,
33956 {
33957 clause_not_first:
33961 }
33991 clauses);
33992 else
34002 clauses);
34020 {
34025 }
34068 clauses
34074 clauses
34082 }
34087 {
34088 /* Remove the invalid clause(s) from the list to avoid
34089 confusing the rest of the compiler. */
34092 }
34093 }
34094 saw_error:
34097 {
34100 else
34102 }
34104 }
34106 /* OpenMP 2.5:
34107 structured-block:
34108 statement
34110 In practice, we're also interested in adding the statement to an
34111 outer node. So it is convenient if we work around the fact that
34112 cp_parser_statement calls add_stmt. */
34114 static unsigned
34116 {
34119 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34120 This preserves the "not within loop or switch" style error messages
34121 for nonsense cases like
34122 void foo() {
34123 #pragma omp single
34124 break;
34125 }
34126 */
34131 }
34133 static void
34135 {
34137 }
34139 static tree
34141 {
34149 }
34151 /* OpenMP 2.5:
34152 # pragma omp atomic new-line
34153 expression-stmt
34155 expression-stmt:
34156 x binop= expr | x++ | ++x | x-- | --x
34157 binop:
34158 +, *, -, /, &, ^, |, <<, >>
34160 where x is an lvalue expression with scalar type.
34162 OpenMP 3.1:
34163 # pragma omp atomic new-line
34164 update-stmt
34166 # pragma omp atomic read new-line
34167 read-stmt
34169 # pragma omp atomic write new-line
34170 write-stmt
34172 # pragma omp atomic update new-line
34173 update-stmt
34175 # pragma omp atomic capture new-line
34176 capture-stmt
34178 # pragma omp atomic capture new-line
34179 capture-block
34181 read-stmt:
34182 v = x
34183 write-stmt:
34184 x = expr
34185 update-stmt:
34186 expression-stmt | x = x binop expr
34187 capture-stmt:
34188 v = expression-stmt
34189 capture-block:
34190 { v = x; update-stmt; } | { update-stmt; v = x; }
34192 OpenMP 4.0:
34193 update-stmt:
34194 expression-stmt | x = x binop expr | x = expr binop x
34195 capture-stmt:
34196 v = update-stmt
34197 capture-block:
34198 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34200 where x and v are lvalue expressions with scalar type. */
34202 static void
34204 {
34212 {
34217 {
34223 }
34224 }
34226 {
34238 else
34242 }
34244 {
34250 {
34255 {
34258 }
34259 }
34260 }
34264 {
34274 else
34279 {
34280 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34281 opcode. */
34286 }
34290 {
34293 }
34294 else
34295 {
34301 }
34304 }
34306 restart:
34310 {
34317 /* FALLTHROUGH */
34327 /* FALLTHROUGH */
34342 /* Undo effects of boolean_increment for post {in,de}crement. */
34344 /* FALLTHRU */
34348 {
34349 /* Undo effects of boolean_increment. */
34351 {
34352 /* This is pre or post increment. */
34357 && !structured_block
34361 }
34362 }
34363 /* FALLTHRU */
34366 {
34401 {
34405 }
34408 {
34414 {
34419 }
34421 {
34433 {
34435 {
34440 }
34441 else
34443 }
34447 }
34450 {
34457 }
34461 }
34465 {
34468 {
34476 }
34478 {
34483 }
34518 }
34529 /* FALLTHROUGH */
34534 }
34541 }
34542 stmt_done:
34544 {
34555 }
34557 {
34560 }
34561 done:
34567 saw_error:
34570 {
34574 {
34578 }
34579 }
34580 }
34583 /* OpenMP 2.5:
34584 # pragma omp barrier new-line */
34586 static void
34588 {
34591 }
34593 /* OpenMP 2.5:
34594 # pragma omp critical [(name)] new-line
34595 structured-block
34597 OpenMP 4.5:
34598 # pragma omp critical [(name) [hint(expression)]] new-line
34599 structured-block */
34601 #define OMP_CRITICAL_CLAUSE_MASK \
34602 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34604 static tree
34606 {
34610 {
34611 matching_parens parens;
34625 OMP_CRITICAL_CLAUSE_MASK,
34627 }
34628 else
34633 }
34635 /* OpenMP 2.5:
34636 # pragma omp flush flush-vars[opt] new-line
34638 flush-vars:
34639 ( variable-list ) */
34641 static void
34643 {
34649 }
34651 /* Helper function, to parse omp for increment expression. */
34653 static tree
34655 {
34660 {
34663 }
34666 {
34673 /* Fall through: OpenMP disallows NE_EXPR. */
34677 }
34679 /* If decl is an iterator, preserve LHS and RHS of the relational
34680 expr until finish_omp_for. */
34691 }
34693 /* Helper function, to parse omp for increment expression. */
34695 static tree
34697 {
34701 cp_id_kind idk;
34705 {
34714 }
34723 {
34728 }
34735 {
34739 }
34752 do
34753 {
34760 {
34762 {
34765 else
34767 tf_warning_or_error);
34768 }
34769 else
34772 }
34773 }
34777 {
34783 }
34784 else
34788 }
34790 /* Parse the initialization statement of an OpenMP for loop.
34792 Return true if the resulting construct should have an
34793 OMP_CLAUSE_PRIVATE added to it. */
34795 static tree
34803 {
34809 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34811 init-expr:
34812 var = lb
34813 integer-type var = lb
34814 random-access-iterator-type var = lb
34815 pointer-type var = lb
34816 */
34817 cp_decl_specifier_seq type_specifiers;
34819 /* First, try to parse as an initialized declaration. See
34820 cp_parser_condition, from whence the bulk of this is copied. */
34827 {
34828 /* If parsing a type specifier seq succeeded, then this
34829 MUST be a initialized declaration. */
34834 CP_PARSER_DECLARATOR_NAMED,
34845 else
34846 {
34856 {
34858 CPP_OPEN_PAREN))
34861 else
34862 /* Trigger an error. */
34867 }
34871 {
34879 {
34882 auto_node);
34887 }
34890 asm_specification,
34891 LOOKUP_ONLYCONVERTING);
34894 {
34897 }
34898 else
34899 {
34902 {
34904 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34906 {
34910 {
34914 }
34916 }
34918 {
34923 }
34924 }
34925 }
34927 }
34928 else
34929 {
34930 /* Consume '='. */
34934 non_class:
34937 else
34940 asm_specification,
34941 LOOKUP_ONLYCONVERTING);
34942 }
34946 }
34947 }
34948 else
34949 {
34950 cp_id_kind idk;
34951 /* If parsing a type specifier sequence failed, then
34952 this MUST be a simple expression. */
34958 && decl
34961 {
34972 {
34977 }
34982 }
34984 && decl
34987 {
34988 tree rhs;
34996 rhs,
34997 tf_warning_or_error));
35000 }
35001 else
35002 {
35007 {
35011 }
35012 }
35013 }
35015 }
35017 /* Parse the restricted form of the for statement allowed by OpenMP. */
35019 static tree
35022 {
35026 location_t loc_first;
35037 {
35040 }
35043 {
35046 }
35049 {
35055 }
35057 {
35060 {
35062 "%<linear%> clause may not be specified together "
35065 }
35066 else
35068 }
35081 {
35084 location_t loc;
35087 {
35091 }
35094 matching_parens parens;
35101 add_private_clause
35107 {
35110 {
35116 }
35117 else
35119 }
35126 {
35131 {
35135 }
35138 {
35139 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35143 {
35146 }
35147 else
35148 {
35151 }
35153 }
35154 else
35155 {
35160 }
35161 }
35164 {
35165 tree c;
35167 {
35176 decl);
35180 decl);
35181 }
35183 {
35188 else
35193 {
35196 /* For linear, signal that we need to fill up
35197 the so far unknown linear step. */
35200 }
35201 }
35202 }
35211 {
35212 /* If decl is an iterator, preserve the operator on decl
35213 until finish_omp_for. */
35215 && ((processing_template_decl
35220 else
35224 }
35236 {
35239 }
35244 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35245 in between the collapsed for loops to be still considered perfectly
35246 nested. Hopefully the final version clarifies this.
35247 For now handle (multiple) {'s and empty statements. */
35250 {
35254 {
35256 bracecount++;
35257 }
35261 else
35262 {
35269 }
35270 }
35273 {
35276 }
35277 }
35282 /* Note that we saved the original contents of this flag when we entered
35283 the structured block, and so we don't need to re-save it here. */
35286 /* Note that the grammar doesn't call for a structured block here,
35287 though the loop as a whole is a structured block. */
35294 else
35299 {
35301 {
35303 nbraces--;
35304 }
35307 else
35308 {
35310 {
35313 }
35318 }
35319 }
35322 {
35326 else
35328 }
35332 }
35334 /* Helper function for OpenMP parsing, split clauses and call
35335 finish_omp_clauses on each of the set of clauses afterwards. */
35337 static void
35340 {
35346 }
35348 /* OpenMP 4.0:
35349 #pragma omp simd simd-clause[optseq] new-line
35350 for-loop */
35352 #define OMP_SIMD_CLAUSE_MASK \
35353 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35362 static tree
35366 {
35377 {
35381 OMP_CLAUSE_ORDERED);
35383 {
35385 "%<ordered%> clause with parameter may not be specified "
35388 }
35389 }
35400 }
35402 /* OpenMP 2.5:
35403 #pragma omp for for-clause[optseq] new-line
35404 for-loop
35406 OpenMP 4.0:
35407 #pragma omp for simd for-simd-clause[optseq] new-line
35408 for-loop */
35410 #define OMP_FOR_CLAUSE_MASK \
35411 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35421 static tree
35425 {
35432 /* parallel for{, simd} disallows nowait clause, but for
35433 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35436 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35441 {
35446 {
35470 }
35471 }
35473 {
35476 }
35478 /* Composite distribute parallel for disallows linear clause. */
35485 {
35488 }
35499 }
35501 /* OpenMP 2.5:
35502 # pragma omp master new-line
35503 structured-block */
35505 static tree
35507 {
35511 }
35513 /* OpenMP 2.5:
35514 # pragma omp ordered new-line
35515 structured-block
35517 OpenMP 4.5:
35518 # pragma omp ordered ordered-clauses new-line
35519 structured-block */
35521 #define OMP_ORDERED_CLAUSE_MASK \
35522 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35525 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35526 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35528 static bool
35531 {
35535 {
35540 {
35542 {
35545 }
35547 {
35549 "%<depend%> clause may only be used in compound "
35553 }
35554 tree clauses
35556 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35560 }
35561 }
35563 tree clauses
35574 }
35576 /* OpenMP 2.5:
35578 section-scope:
35579 { section-sequence }
35581 section-sequence:
35582 section-directive[opt] structured-block
35583 section-sequence section-directive structured-block */
35585 static tree
35587 {
35592 matching_braces braces;
35600 {
35604 }
35607 {
35615 {
35619 }
35621 {
35624 }
35629 }
35640 }
35642 /* OpenMP 2.5:
35643 # pragma omp sections sections-clause[optseq] newline
35644 sections-scope */
35646 #define OMP_SECTIONS_CLAUSE_MASK \
35647 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35653 static tree
35656 {
35668 {
35671 }
35678 }
35680 /* OpenMP 2.5:
35681 # pragma omp parallel parallel-clause[optseq] new-line
35682 structured-block
35683 # pragma omp parallel for parallel-for-clause[optseq] new-line
35684 structured-block
35685 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35686 structured-block
35688 OpenMP 4.0:
35689 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35690 structured-block */
35692 #define OMP_PARALLEL_CLAUSE_MASK \
35693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35703 static tree
35707 {
35714 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35720 {
35728 if_p);
35732 if_p);
35735 block);
35740 }
35741 /* When combined with distribute, parallel has to be followed by for.
35742 #pragma omp target parallel is allowed though. */
35746 {
35750 }
35752 {
35755 }
35757 {
35761 {
35771 block);
35774 }
35775 }
35780 {
35783 }
35791 }
35793 /* OpenMP 2.5:
35794 # pragma omp single single-clause[optseq] new-line
35795 structured-block */
35797 #define OMP_SINGLE_CLAUSE_MASK \
35798 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35803 static tree
35805 {
35815 }
35817 /* OpenMP 3.0:
35818 # pragma omp task task-clause[optseq] new-line
35819 structured-block */
35821 #define OMP_TASK_CLAUSE_MASK \
35822 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35833 static tree
35835 {
35846 }
35848 /* OpenMP 3.0:
35849 # pragma omp taskwait new-line */
35851 static void
35853 {
35856 }
35858 /* OpenMP 3.1:
35859 # pragma omp taskyield new-line */
35861 static void
35863 {
35866 }
35868 /* OpenMP 4.0:
35869 # pragma omp taskgroup new-line
35870 structured-block */
35872 static tree
35874 {
35878 if_p));
35879 }
35882 /* OpenMP 2.5:
35883 # pragma omp threadprivate (variable-list) */
35885 static void
35887 {
35888 tree vars;
35894 }
35896 /* OpenMP 4.0:
35897 # pragma omp cancel cancel-clause[optseq] new-line */
35899 #define OMP_CANCEL_CLAUSE_MASK \
35900 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35906 static void
35908 {
35912 }
35914 /* OpenMP 4.0:
35915 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35917 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35918 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35923 static void
35926 {
35927 tree clauses;
35931 {
35936 {
35939 }
35940 }
35942 {
35946 }
35949 {
35954 else
35958 }
35961 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35963 pragma_tok);
35965 }
35967 /* OpenMP 4.0:
35968 #pragma omp distribute distribute-clause[optseq] new-line
35969 for-loop */
35971 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35972 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35978 static tree
35982 {
35991 {
35999 else
36002 {
36008 {
36012 else
36015 }
36021 else
36035 }
36036 }
36038 {
36041 }
36046 {
36049 }
36060 }
36062 /* OpenMP 4.0:
36063 # pragma omp teams teams-clause[optseq] new-line
36064 structured-block */
36066 #define OMP_TEAMS_CLAUSE_MASK \
36067 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36075 static tree
36079 {
36088 {
36092 {
36117 }
36118 }
36120 {
36123 }
36128 {
36131 }
36140 }
36142 /* OpenMP 4.0:
36143 # pragma omp target data target-data-clause[optseq] new-line
36144 structured-block */
36146 #define OMP_TARGET_DATA_CLAUSE_MASK \
36147 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36152 static tree
36154 {
36155 tree clauses
36160 {
36163 {
36180 "%<#pragma omp target data%> with map-type other "
36181 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36185 }
36187 }
36190 {
36193 "%<#pragma omp target data%> must contain at least "
36196 }
36207 }
36209 /* OpenMP 4.5:
36210 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36211 structured-block */
36213 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36214 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36220 static tree
36223 {
36226 {
36231 {
36234 }
36235 }
36237 {
36241 }
36244 {
36250 }
36252 tree clauses
36257 {
36260 {
36273 "%<#pragma omp target enter data%> with map-type other "
36277 }
36279 }
36282 {
36285 "%<#pragma omp target enter data%> must contain at least "
36288 }
36295 }
36297 /* OpenMP 4.5:
36298 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36299 structured-block */
36301 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36302 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36308 static tree
36311 {
36314 {
36319 {
36322 }
36323 }
36325 {
36329 }
36332 {
36338 }
36340 tree clauses
36345 {
36348 {
36362 "%<#pragma omp target exit data%> with map-type other "
36363 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36367 }
36369 }
36372 {
36375 "%<#pragma omp target exit data%> must contain at least "
36378 }
36385 }
36387 /* OpenMP 4.0:
36388 # pragma omp target update target-update-clause[optseq] new-line */
36390 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36398 static bool
36401 {
36403 {
36409 }
36411 tree clauses
36416 {
36418 "%<#pragma omp target update%> must contain at least one "
36421 }
36429 }
36431 /* OpenMP 4.0:
36432 # pragma omp target target-clause[optseq] new-line
36433 structured-block */
36435 #define OMP_TARGET_CLAUSE_MASK \
36436 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36446 static bool
36449 {
36453 {
36465 {
36473 {
36474 tree stmt;
36476 {
36479 OMP_TARGET_CLAUSE_MASK,
36484 OMP_TARGET_CLAUSE_MASK,
36489 OMP_TARGET_CLAUSE_MASK,
36494 }
36496 }
36501 {
36505 if_p);
36510 if_p);
36515 if_p);
36519 }
36525 {
36526 /* For combined target teams, ensure the num_teams and
36527 thread_limit clause expressions are evaluated on the host,
36528 before entering the target construct. */
36529 tree c;
36535 {
36544 OMP_CLAUSE_FIRSTPRIVATE);
36549 }
36550 }
36560 }
36562 {
36565 }
36567 {
36571 }
36573 {
36577 }
36579 {
36583 }
36585 {
36588 }
36589 }
36591 {
36594 }
36609 check_clauses:
36611 {
36614 {
36628 "%<#pragma omp target%> with map-type other "
36629 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36633 }
36635 }
36637 }
36639 /* OpenACC 2.0:
36640 # pragma acc cache (variable-list) new-line
36641 */
36643 static tree
36645 {
36660 }
36662 /* OpenACC 2.0:
36663 # pragma acc data oacc-data-clause[optseq] new-line
36664 structured-block */
36666 #define OACC_DATA_CLAUSE_MASK \
36667 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36679 static tree
36681 {
36694 }
36696 /* OpenACC 2.0:
36697 # pragma acc host_data <clauses> new-line
36698 structured-block */
36700 #define OACC_HOST_DATA_CLAUSE_MASK \
36701 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36703 static tree
36705 {
36718 }
36720 /* OpenACC 2.0:
36721 # pragma acc declare oacc-data-clause[optseq] new-line
36722 */
36724 #define OACC_DECLARE_CLAUSE_MASK \
36725 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36738 static tree
36740 {
36749 {
36753 }
36756 {
36760 {
36764 }
36767 {
36779 {
36781 "%qD must be a global variable in "
36783 decl);
36786 }
36791 {
36795 }
36797 {
36799 "invalid use of %<extern%> variable %qD "
36803 }
36805 {
36807 "invalid use of %<global%> variable %qD "
36811 }
36813 }
36818 {
36823 }
36826 {
36827 tree id;
36831 else
36837 {
36840 {
36843 {
36847 }
36848 }
36849 }
36850 }
36851 }
36864 }
36866 /* OpenACC 2.0:
36867 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36869 or
36871 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36873 LOC is the location of the #pragma token.
36874 */
36876 #define OACC_ENTER_DATA_CLAUSE_MASK \
36877 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36885 #define OACC_EXIT_DATA_CLAUSE_MASK \
36886 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36892 static tree
36895 {
36904 {
36909 }
36916 else
36921 {
36925 }
36933 }
36935 /* OpenACC 2.0:
36936 # pragma acc loop oacc-loop-clause[optseq] new-line
36937 structured-block */
36939 #define OACC_LOOP_CLAUSE_MASK \
36940 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36951 static tree
36954 {
36963 {
36969 }
36978 }
36980 /* OpenACC 2.0:
36981 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36982 structured-block
36984 or
36986 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36987 structured-block
36988 */
36990 #define OACC_KERNELS_CLAUSE_MASK \
36991 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37009 #define OACC_PARALLEL_CLAUSE_MASK \
37010 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37031 static tree
37034 {
37035 omp_clause_mask mask;
37038 {
37051 }
37054 {
37058 {
37061 tree clauses;
37063 if_p);
37065 }
37066 }
37075 }
37077 /* OpenACC 2.0:
37078 # pragma acc update oacc-update-clause[optseq] new-line
37079 */
37081 #define OACC_UPDATE_CLAUSE_MASK \
37082 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37089 static tree
37091 {
37098 {
37100 "%<#pragma acc update%> must contain at least one "
37103 }
37111 }
37113 /* OpenACC 2.0:
37114 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37116 LOC is the location of the #pragma token.
37117 */
37119 #define OACC_WAIT_CLAUSE_MASK \
37120 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37122 static tree
37124 {
37138 }
37140 /* OpenMP 4.0:
37141 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37143 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37144 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37151 static void
37154 {
37156 cp_omp_declare_simd_data data;
37158 {
37163 /* It is safe to take the address of a local variable; it will only be
37164 used while this scope is live. */
37166 }
37168 /* Store away all pragma tokens. */
37180 {
37184 {
37197 }
37202 "%<#pragma omp declare simd%> not immediately followed by "
37206 }
37207 }
37209 /* Finalize #pragma omp declare simd clauses after direct declarator has
37210 been parsed, and put that into "omp declare simd" attribute. */
37212 static tree
37214 {
37220 {
37224 }
37229 {
37247 }
37251 }
37254 /* OpenMP 4.0:
37255 # pragma omp declare target new-line
37256 declarations and definitions
37257 # pragma omp end declare target new-line
37259 OpenMP 4.5:
37260 # pragma omp declare target ( extended-list ) new-line
37262 # pragma omp declare target declare-target-clauses[seq] new-line */
37264 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37265 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37268 static void
37270 {
37273 clauses
37277 {
37279 clauses);
37282 }
37283 else
37284 {
37288 }
37291 "%<#pragma omp declare target%> with clauses in between "
37292 "%<#pragma omp declare target%> without clauses and "
37295 {
37301 {
37304 }
37305 else
37308 {
37310 "%qD specified both in declare target %<link%> and %<to%>"
37313 }
37315 {
37322 {
37325 {
37329 }
37330 }
37331 }
37332 }
37333 }
37335 static void
37337 {
37340 {
37343 }
37345 {
37349 {
37352 }
37355 else
37356 {
37360 }
37361 }
37362 else
37363 {
37367 }
37371 "%<#pragma omp end declare target%> without corresponding "
37373 else
37375 }
37377 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37378 expression and optional initializer clause of
37379 #pragma omp declare reduction. We store the expression(s) as
37380 either 3, 6 or 7 special statements inside of the artificial function's
37381 body. The first two statements are DECL_EXPRs for the artificial
37382 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37383 expression that uses those variables.
37384 If there was any INITIALIZER clause, this is followed by further statements,
37385 the fourth and fifth statements are DECL_EXPRs for the artificial
37386 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37387 constructor variant (first token after open paren is not omp_priv),
37388 then the sixth statement is a statement with the function call expression
37389 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37390 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37391 to initialize the OMP_PRIV artificial variable and there is seventh
37392 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37394 static bool
37396 {
37408 tree combiner;
37423 {
37426 }
37429 {
37431 matching_parens parens;
37437 {
37440 }
37456 {
37460 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37464 == CPP_CLOSE_PAREN
37467 {
37471 }
37476 }
37477 else
37478 {
37494 {
37499 }
37501 tree arg;
37514 }
37525 }
37529 UNKNOWN_LOCATION);
37532 }
37534 /* OpenMP 4.0
37535 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37536 initializer-clause[opt] new-line
37538 initializer-clause:
37539 initializer (omp_priv initializer)
37540 initializer (function-name (argument-list)) */
37542 static void
37545 {
37555 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37562 {
37594 }
37606 /* Types may not be defined in declare reduction type list. */
37609 parser->type_definition_forbidden_message
37615 saved_colon_doesnt_start_class_def_p
37620 {
37624 ;
37643 else
37648 else
37650 }
37652 /* Restore the saved message. */
37655 parser->colon_doesnt_start_class_def_p
37660 {
37661 fail:
37664 }
37670 {
37671 tree fntype
37674 NULL_TREE);
37694 {
37699 }
37701 {
37703 {
37712 }
37719 }
37720 else
37721 {
37724 }
37727 else
37730 {
37733 }
37735 {
37738 else
37743 }
37748 else
37749 {
37758 }
37765 }
37769 done:
37770 /* Free any declarators allocated. */
37772 }
37774 /* OpenMP 4.0
37775 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37776 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37777 initializer-clause[opt] new-line
37778 #pragma omp declare target new-line */
37780 static bool
37783 {
37785 {
37790 {
37793 context);
37795 }
37798 {
37801 context);
37803 }
37805 {
37808 }
37810 {
37814 }
37815 }
37820 }
37822 /* OpenMP 4.5:
37823 #pragma omp taskloop taskloop-clause[optseq] new-line
37824 for-loop
37826 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37827 for-loop */
37829 #define OMP_TASKLOOP_CLAUSE_MASK \
37830 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37845 static tree
37849 {
37858 {
37863 {
37887 }
37888 }
37890 {
37893 }
37898 {
37901 }
37907 if_p);
37913 }
37916 /* OpenACC 2.0:
37917 # pragma acc routine oacc-routine-clause[optseq] new-line
37918 function-definition
37920 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37921 */
37923 #define OACC_ROUTINE_CLAUSE_MASK \
37924 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37930 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37931 component, which must resolve to a declared namespace-scope
37932 function. The clauses are either processed directly (for a named
37933 function), or defered until the immediatley following declaration
37934 is parsed. */
37936 static void
37939 {
37941 /* The checking for "another pragma following this one" in the "no optional
37942 '( name )'" case makes sure that we dont re-enter. */
37945 cp_oacc_routine_data data;
37951 /* It is safe to take the address of a local variable; it will only be
37952 used while this scope is live. */
37955 /* Look for optional '( name )'. */
37957 {
37958 matching_parens parens;
37961 /* We parse the name as an id-expression. If it resolves to
37962 anything other than a non-overloaded function at namespace
37963 scope, it's an error. */
37979 {
37983 }
37985 data.clauses
37993 {
37998 }
38000 /* Perhaps we should use the same rule as declarations in different
38001 namespaces? */
38003 {
38008 }
38011 {
38015 }
38019 }
38021 {
38022 /* Store away all pragma tokens. */
38033 /* Emit a helpful diagnostic if there's another pragma following this
38034 one. */
38036 {
38039 /* ..., and then just keep going. */
38041 }
38043 /* We only have to consider the pragma_external case here. */
38048 else
38051 }
38052 }
38054 /* Finalize #pragma acc routine clauses after direct declarator has
38055 been parsed. */
38057 static tree
38059 {
38064 {
38066 "%<#pragma acc routine%> not immediately followed by "
38069 }
38086 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38087 fndecl_seen. */
38090 }
38092 /* Apply any saved OpenACC routine clauses to a just-parsed
38093 declaration. */
38095 static void
38097 {
38099 {
38100 /* Keep going if we're in error reporting mode. */
38106 {
38108 "%<#pragma acc routine%> not immediately followed by"
38112 }
38114 {
38117 }
38120 {
38125 }
38128 {
38136 }
38138 /* Process the routine's dimension clauses. */
38142 /* Add an "omp declare target" attribute. */
38147 /* Don't unset parser->oacc_routine here: we may still need it to
38148 diagnose wrong usage. But, remember that we've used this "#pragma acc
38149 routine". */
38151 }
38152 }
38154 /* Main entry point to OpenMP statement pragmas. */
38156 static void
38158 {
38159 tree stmt;
38164 {
38187 if_p);
38192 if_p);
38209 if_p);
38214 if_p);
38222 if_p);
38231 if_p);
38245 if_p);
38250 if_p);
38254 }
38257 }
38258 \f
38259 /* Transactional Memory parsing routines. */
38261 /* Parse a transaction attribute.
38263 txn-attribute:
38264 attribute
38265 [ [ identifier ] ]
38267 We use this instead of cp_parser_attributes_opt for transactions to avoid
38268 the pedwarn in C++98 mode. */
38270 static tree
38272 {
38287 {
38291 /* For keywords, use the canonical spelling,
38292 not the parsed identifier. */
38296 }
38297 else
38301 error1:
38304 }
38306 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38308 transaction-statement:
38309 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38310 compound-statement
38311 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38312 */
38314 static tree
38316 {
38327 else
38328 {
38332 }
38334 /* Parse a noexcept specification. */
38338 {
38339 /* cancel-and-throw is unimplemented. */
38342 }
38343 else
38346 /* Keep track if we're in the lexical scope of an outer transaction. */
38358 }
38360 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38362 transaction-expression:
38363 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38364 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38365 */
38367 static tree
38369 {
38382 keyword == RID_TRANSACTION_RELAXED
38396 /* Set this early. This might mean that we allow transaction_cancel in
38397 an expression that we find out later actually has to be a constexpr.
38398 However, we expect that cxx_constant_value will be able to deal with
38399 this; also, if the noexcept has no constexpr, then what we parse next
38400 really is a transaction's body. */
38403 /* Parse a noexcept specification. */
38409 {
38410 matching_parens parens;
38417 }
38418 else
38419 {
38420 /* The only expression that is available got parsed for the noexcept
38421 already. noexcept is true then. */
38424 }
38433 }
38435 /* Parse a function-transaction-block.
38437 function-transaction-block:
38438 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38439 function-body
38440 __transaction_atomic txn-attribute[opt] function-try-block
38441 __transaction_relaxed ctor-initializer[opt] function-body
38442 __transaction_relaxed function-try-block
38443 */
38445 static void
38447 {
38462 else
38463 {
38467 }
38475 else
38476 cp_parser_ctor_initializer_opt_and_function_body
38482 }
38484 /* Parse a __transaction_cancel statement.
38486 cancel-statement:
38487 __transaction_cancel txn-attribute[opt] ;
38488 __transaction_cancel txn-attribute[opt] throw-expression ;
38490 ??? Cancel and throw is not yet implemented. */
38492 static tree
38494 {
38500 RT_TRANSACTION_CANCEL);
38507 /* ??? Parse cancel-and-throw here. */
38512 {
38516 }
38518 {
38522 }
38524 {
38527 {
38533 }
38534 }
38536 {
38540 }
38546 }
38547 \f
38548 /* The parser. */
38552 \f
38553 /* Special handling for the first token or line in the file. The first
38554 thing in the file might be #pragma GCC pch_preprocess, which loads a
38555 PCH file, which is a GC collection point. So we need to handle this
38556 first pragma without benefit of an existing lexer structure.
38558 Always returns one token to the caller in *FIRST_TOKEN. This is
38559 either the true first token of the file, or the first token after
38560 the initial pragma. */
38562 static void
38564 {
38573 {
38580 }
38581 else
38584 /* Skip to the end of the pragma. */
38588 /* Now actually load the PCH file. */
38592 /* Read one more token to return to our caller. We have to do this
38593 after reading the PCH file in, since its pointers have to be
38594 live. */
38596 }
38598 /* Parse a pragma GCC ivdep. */
38600 static bool
38602 {
38605 }
38607 /* Parse a pragma GCC unroll. */
38609 static unsigned short
38611 {
38621 {
38623 " assignment-expression that evaluates to a non-negative"
38626 }
38627 else
38628 {
38632 }
38635 }
38637 /* Normal parsing of a pragma token. Here we can (and must) use the
38638 regular lexer. */
38640 static bool
38642 {
38645 tree stmt;
38656 {
38664 {
38674 }
38679 {
38689 }
38694 {
38705 }
38710 {
38721 }
38726 {
38737 }
38757 {
38762 }
38770 {
38775 }
38783 {
38787 }
38793 {
38798 }
38806 {
38811 }
38866 "%<#pragma omp section%> may only be used in "
38871 {
38873 {
38877 }
38883 {
38887 }
38888 else
38894 {
38897 }
38900 }
38903 {
38905 {
38909 }
38910 const unsigned short unroll
38916 {
38920 }
38921 else
38927 {
38930 }
38933 }
38940 bad_stmt:
38943 }
38947 }
38949 /* The interface the pragma parsers have to the lexer. */
38951 enum cpp_ttype
38953 {
38965 else
38966 {
38970 }
38973 }
38975 \f
38976 /* External interface. */
38978 /* Parse one entire translation unit. */
38980 void
38982 {
38995 }
38997 /* Create an identifier for a generic parameter type (a synthesized
38998 template parameter implied by `auto' or a concept identifier). */
39001 static tree
39003 {
39007 }
39009 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39010 (creating a new template parameter list if necessary). Returns the newly
39011 created template type parm. */
39013 static tree
39015 {
39018 /* Before committing to modifying any scope, if we're in an
39019 implicit template scope, and we're trying to synthesize a
39020 constrained parameter, try to find a previous parameter with
39021 the same name. This is the same-type rule for abbreviated
39022 function templates.
39024 NOTE: We can generate implicit parameters when tentatively
39025 parsing a nested name specifier, only to reject that parse
39026 later. However, matching the same template-id as part of a
39027 direct-declarator should generate an identical template
39028 parameter, so this rule will merge them. */
39030 {
39033 {
39035 {
39038 /* Return the TEMPLATE_PARM_INDEX. */
39041 }
39043 }
39044 }
39046 /* We are either continuing a function template that already contains implicit
39047 template parameters, creating a new fully-implicit function template, or
39048 extending an existing explicit function template with implicit template
39049 parameters. */
39057 {
39061 }
39062 else
39063 {
39064 /* Roll back to the existing template parameter scope (in the case of
39065 extending an explicit function template) or introduce a new template
39066 parameter scope ahead of the function parameter scope (or class scope
39067 in the case of out-of-line member definitions). The function scope is
39068 added back after template parameter synthesis below. */
39073 {
39076 }
39078 {
39079 /* If not defining a class, then any class scope is a scope level in
39080 an out-of-line member definition. In this case simply wind back
39081 beyond the first such scope to inject the template parameter list.
39082 Otherwise wind back to the class being defined. The latter can
39083 occur in class member friend declarations such as:
39085 class A {
39086 void foo (auto);
39087 };
39088 class B {
39089 friend void A::foo (auto);
39090 };
39092 The template parameter list synthesized for the friend declaration
39093 must be injected in the scope of 'B'. This can also occur in
39094 erroneous cases such as:
39096 struct A {
39097 struct B {
39098 void foo (auto);
39099 };
39100 void B::foo (auto) {}
39101 };
39103 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39104 but, nevertheless, the template parameter list synthesized for the
39105 declarator should be injected into the scope of 'A' as if the
39106 ill-formed template was specified explicitly. */
39109 {
39112 }
39113 }
39119 {
39120 /* Introduce a new template parameter list for implicit template
39121 parameters. */
39125 parser->implicit_template_scope
39132 }
39133 else
39134 {
39135 /* Synthesize implicit template parameters at the end of the explicit
39136 template parameter list. */
39143 parser->implicit_template_parms
39145 }
39146 }
39148 /* Synthesize a new template parameter and track the current template
39149 parameter chain with implicit_template_parms. */
39153 tree synth_tmpl_parm;
39157 synth_tmpl_parm
39160 synth_tmpl_parm
39162 else
39163 {
39167 }
39169 // Attach the constraint to the parm before processing.
39172 tree new_parm
39174 input_location,
39175 node,
39179 // Chain the new parameter to the list of implicit parameters.
39181 parser->implicit_template_parms
39183 else
39188 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39191 /* If creating a fully implicit function template, start the new implicit
39192 template parameter list with this synthesized type, otherwise grow the
39193 current template parameter list. */
39196 {
39203 }
39204 else
39205 {
39210 }
39212 // If the new parameter was constrained, we need to add that to the
39213 // constraints in the template parameter list.
39215 {
39219 }
39224 }
39226 /* Finish the declaration of a fully implicit function template. Such a
39227 template has no explicit template parameter list so has not been through the
39228 normal template head and tail processing. synthesize_implicit_template_parm
39229 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39230 provided if the declaration is a class member such that its template
39231 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39232 form is returned. Otherwise NULL_TREE is returned. */
39234 static tree
39236 {
39241 {
39245 }
39255 }
39257 /* Helper function for diagnostics that have complained about things
39258 being used with 'extern "C"' linkage.
39260 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39262 void
39264 {
39268 }