| blob | c0058085ee924820f950d1524c247fd2eb16bb09 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2267 static void abort_fully_implicit_template
2270 /* Classes [gram.class] */
2272 static tree cp_parser_class_name
2274 static tree cp_parser_class_specifier
2276 static tree cp_parser_class_head
2278 static enum tag_types cp_parser_class_key
2280 static void cp_parser_type_parameter_key
2282 static void cp_parser_member_specification_opt
2284 static void cp_parser_member_declaration
2286 static tree cp_parser_pure_specifier
2288 static tree cp_parser_constant_initializer
2291 /* Derived classes [gram.class.derived] */
2293 static tree cp_parser_base_clause
2295 static tree cp_parser_base_specifier
2298 /* Special member functions [gram.special] */
2300 static tree cp_parser_conversion_function_id
2302 static tree cp_parser_conversion_type_id
2306 static void cp_parser_ctor_initializer_opt
2308 static void cp_parser_mem_initializer_list
2310 static tree cp_parser_mem_initializer
2312 static tree cp_parser_mem_initializer_id
2315 /* Overloading [gram.over] */
2317 static cp_expr cp_parser_operator_function_id
2319 static cp_expr cp_parser_operator
2322 /* Templates [gram.temp] */
2324 static void cp_parser_template_declaration
2326 static tree cp_parser_template_parameter_list
2328 static tree cp_parser_template_parameter
2330 static tree cp_parser_type_parameter
2332 static tree cp_parser_template_id
2334 static tree cp_parser_template_name
2336 static tree cp_parser_template_argument_list
2338 static tree cp_parser_template_argument
2340 static void cp_parser_explicit_instantiation
2342 static void cp_parser_explicit_specialization
2345 /* Exception handling [gram.exception] */
2347 static tree cp_parser_try_block
2349 static void cp_parser_function_try_block
2351 static void cp_parser_handler_seq
2353 static void cp_parser_handler
2355 static tree cp_parser_exception_declaration
2357 static tree cp_parser_throw_expression
2359 static tree cp_parser_exception_specification_opt
2361 static tree cp_parser_type_id_list
2364 /* GNU Extensions */
2366 static tree cp_parser_asm_specification_opt
2368 static tree cp_parser_asm_operand_list
2370 static tree cp_parser_asm_clobber_list
2372 static tree cp_parser_asm_label_list
2374 static bool cp_next_tokens_can_be_attribute_p
2376 static bool cp_next_tokens_can_be_gnu_attribute_p
2378 static bool cp_next_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_gnu_attribute_p
2384 static bool cp_nth_tokens_can_be_attribute_p
2386 static tree cp_parser_attributes_opt
2388 static tree cp_parser_gnu_attributes_opt
2390 static tree cp_parser_gnu_attribute_list
2392 static tree cp_parser_std_attribute
2394 static tree cp_parser_std_attribute_spec
2396 static tree cp_parser_std_attribute_spec_seq
2398 static size_t cp_parser_skip_attributes_opt
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static void cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static cp_expr cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2769 RT_CLOSE_PAREN. */
2773 {
2775 {
2783 }
2784 }
2786 /* Attempt to convert TOKEN_DESC from a required_token to an
2787 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2789 static enum cpp_ttype
2791 {
2793 {
2814 /* Use CPP_EOF as a "no completions possible" code. */
2816 }
2817 }
2820 /* Subroutine of cp_parser_error and cp_parser_required_error.
2822 Issue a diagnostic of the form
2823 FILE:LINE: MESSAGE before TOKEN
2824 where TOKEN is the next token in the input stream. MESSAGE
2825 (specified by the caller) is usually of the form "expected
2826 OTHER-TOKEN".
2828 This bypasses the check for tentative passing, and potentially
2829 adds material needed by cp_parser_required_error.
2831 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2832 suggesting insertion of the missing token.
2834 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2835 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2836 location. */
2838 static void
2840 required_token missing_token_desc,
2841 location_t matching_location)
2842 {
2844 /* This diagnostic makes more sense if it is tagged to the line
2845 of the token we just peeked at. */
2849 {
2854 }
2856 /* If this is actually a conflict marker, report it as such. */
2860 {
2861 location_t loc;
2863 {
2866 }
2867 }
2874 {
2875 /* Potentially supply a fix-it hint, suggesting to add the
2876 missing token immediately after the *previous* token.
2877 This may move the primary location within richloc. */
2879 location_t prev_token_loc
2883 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2884 Attempt to consolidate diagnostics by printing it as a
2885 secondary range within the main diagnostic. */
2887 added_matching_location
2889 }
2891 /* Actually emit the error. */
2893 /* Because c_parser_error does not understand
2894 CPP_KEYWORD, keywords are treated like
2895 identifiers. */
2900 {
2901 /* If we weren't able to consolidate matching_location, then
2902 print it as a secondary diagnostic. */
2907 }
2908 }
2910 /* If not parsing tentatively, issue a diagnostic of the form
2911 FILE:LINE: MESSAGE before TOKEN
2912 where TOKEN is the next token in the input stream. MESSAGE
2913 (specified by the caller) is usually of the form "expected
2914 OTHER-TOKEN". */
2916 static void
2918 {
2921 }
2923 /* Issue an error about name-lookup failing. NAME is the
2924 IDENTIFIER_NODE DECL is the result of
2925 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2926 the thing that we hoped to find. */
2928 static void
2930 tree name,
2931 tree decl,
2932 name_lookup_error desired,
2933 location_t location)
2934 {
2935 /* If name lookup completely failed, tell the user that NAME was not
2936 declared. */
2938 {
2951 else
2953 }
2955 {
2957 {
2974 }
2975 }
2977 {
2979 {
2989 name);
2993 }
2994 }
2995 else
2996 {
2998 {
3011 }
3012 }
3013 }
3015 /* If we are parsing tentatively, remember that an error has occurred
3016 during this tentative parse. Returns true if the error was
3017 simulated; false if a message should be issued by the caller. */
3019 static bool
3021 {
3023 {
3026 }
3028 }
3030 /* This function is called when a type is defined. If type
3031 definitions are forbidden at this point, an error message is
3032 issued. */
3034 static bool
3036 {
3037 /* If types are forbidden here, issue a message. */
3039 {
3040 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3041 in the message need to be interpreted. */
3044 }
3046 }
3048 /* This function is called when the DECLARATOR is processed. The TYPE
3049 was a type defined in the decl-specifiers. If it is invalid to
3050 define a type in the decl-specifiers for DECLARATOR, an error is
3051 issued. TYPE_LOCATION is the location of TYPE and is used
3052 for error reporting. */
3054 static void
3057 {
3058 /* [dcl.fct] forbids type definitions in return types.
3059 Unfortunately, it's not easy to know whether or not we are
3060 processing a return type until after the fact. */
3068 {
3073 type);
3074 }
3075 }
3077 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3078 "<" in any valid C++ program. If the next token is indeed "<",
3079 issue a message warning the user about what appears to be an
3080 invalid attempt to form a template-id. LOCATION is the location
3081 of the type-specifier (TYPE) */
3083 static void
3085 tree type,
3087 location_t location)
3088 {
3092 {
3098 {
3101 else
3103 }
3104 else
3106 /* Remember the location of the invalid "<". */
3109 /* Consume the "<". */
3111 /* Parse the template arguments. */
3113 /* Permanently remove the invalid template arguments so that
3114 this error message is not issued again. */
3117 }
3118 }
3120 /* If parsing an integral constant-expression, issue an error message
3121 about the fact that THING appeared and return true. Otherwise,
3122 return false. In either case, set
3123 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3125 static bool
3127 non_integral_constant thing)
3128 {
3131 {
3133 {
3136 {
3139 "ISO C++ forbids using a floating-point literal "
3144 "enumeration type cannot appear in a "
3235 }
3239 }
3240 }
3242 }
3244 /* Emit a diagnostic for an invalid type name. This function commits
3245 to the current active tentative parse, if any. (Otherwise, the
3246 problematic construct might be encountered again later, resulting
3247 in duplicate error messages.) LOCATION is the location of ID. */
3249 static void
3251 location_t location)
3252 {
3255 /* Try to lookup the identifier. */
3262 /* If the lookup was ambiguous, an error will already have
3263 been issued. */
3265 /* If the lookup found a template-name, it means that the user forgot
3266 to specify an argument list. Emit a useful error message. */
3268 {
3271 decl);
3276 }
3280 /* Something like 'unsigned A a;' */
3283 {
3284 /* Issue an error message. */
3285 name_hint hint;
3289 {
3295 }
3296 else
3298 /* If we're in a template class, it's possible that the user was
3299 referring to a type from a base class. For example:
3301 template <typename T> struct A { typedef T X; };
3302 template <typename T> struct B : public A<T> { X x; };
3304 The user should have said "typename A<T>::X". */
3320 {
3321 tree b;
3324 b;
3326 {
3330 {
3331 tree field;
3332 /* Go from a particular instantiation of the
3333 template (which will have an empty TYPE_FIELDs),
3334 to the main version. */
3337 field;
3341 {
3346 }
3349 }
3350 }
3351 }
3352 }
3353 /* Here we diagnose qualified-ids where the scope is actually correct,
3354 but the identifier does not resolve to a valid type name. */
3356 {
3358 {
3367 else
3376 }
3379 {
3380 /* A<T>::A<T>() */
3386 }
3389 {
3392 "need %<typename%> before %<%T::%D::%E%> because "
3396 id,
3399 else
3403 }
3405 {
3417 else
3423 }
3424 else
3426 }
3427 }
3429 /* Check for a common situation where a type-name should be present,
3430 but is not, and issue a sensible error message. Returns true if an
3431 invalid type-name was detected.
3433 The situation handled by this function are variable declarations of the
3434 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3435 Usually, `ID' should name a type, but if we got here it means that it
3436 does not. We try to emit the best possible error message depending on
3437 how exactly the id-expression looks like. */
3439 static bool
3441 {
3442 tree id;
3445 /* Avoid duplicate error about ambiguous lookup. */
3447 {
3451 }
3460 /* If the next token is a (, this is a function with no explicit return
3461 type, i.e. constructor, destructor or conversion op. */
3464 {
3467 }
3471 /* Emit a diagnostic for the invalid type. */
3473 out:
3474 /* If we aren't in the middle of a declarator (i.e. in a
3475 parameter-declaration-clause), skip to the end of the declaration;
3476 there's no point in trying to process it. */
3480 }
3482 /* Consume tokens up to, and including, the next non-nested closing `)'.
3483 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3484 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3485 found an unnested token of that type. */
3487 static int
3490 cpp_ttype or_ttype,
3492 {
3502 {
3505 /* Have we found what we're looking for before the closing paren? */
3511 {
3514 /* If we've run out of tokens, then there is no closing `)'. */
3517 /* This is good for lambda expression capture-lists. */
3527 /* This matches the processing in skip_to_end_of_statement. */
3547 {
3551 }
3556 }
3558 /* Consume the token. */
3560 }
3561 }
3563 /* Consume tokens up to, and including, the next non-nested closing `)'.
3564 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3565 are doing error recovery. Returns -1 if OR_COMMA is true and we
3566 found an unnested token of that type. */
3568 static int
3573 {
3577 }
3579 /* Consume tokens until we reach the end of the current statement.
3580 Normally, that will be just before consuming a `;'. However, if a
3581 non-nested `}' comes first, then we stop before consuming that. */
3583 static void
3585 {
3588 /* Unwind generic function template scope if necessary. */
3593 {
3597 {
3600 /* If we've run out of tokens, stop. */
3604 /* If the next token is a `;', we have reached the end of the
3605 statement. */
3611 /* If this is a non-nested '}', stop before consuming it.
3612 That way, when confronted with something like:
3614 { 3 + }
3616 we stop before consuming the closing '}', even though we
3617 have not yet reached a `;'. */
3621 /* If it is the closing '}' for a block that we have
3622 scanned, stop -- but only after consuming the token.
3623 That way given:
3625 void f g () { ... }
3626 typedef int I;
3628 we will stop after the body of the erroneously declared
3629 function, but before consuming the following `typedef'
3630 declaration. */
3632 {
3635 }
3644 }
3646 /* Consume the token. */
3648 }
3649 }
3651 /* This function is called at the end of a statement or declaration.
3652 If the next token is a semicolon, it is consumed; otherwise, error
3653 recovery is attempted. */
3655 static void
3657 {
3658 /* Look for the trailing `;'. */
3660 {
3661 /* If there is additional (erroneous) input, skip to the end of
3662 the statement. */
3664 /* If the next token is now a `;', consume it. */
3667 }
3668 }
3670 /* Skip tokens until we have consumed an entire block, or until we
3671 have consumed a non-nested `;'. */
3673 static void
3675 {
3678 /* Unwind generic function template scope if necessary. */
3683 {
3687 {
3690 /* If we've run out of tokens, stop. */
3694 /* Stop if this is an unnested ';'. */
3700 /* Stop if this is an unnested '}', or closes the outermost
3701 nesting level. */
3702 nesting_depth--;
3710 /* Nest. */
3711 nesting_depth++;
3716 }
3718 /* Consume the token. */
3720 }
3721 }
3723 /* Skip tokens until a non-nested closing curly brace is the next
3724 token, or there are no more tokens. Return true in the first case,
3725 false otherwise. */
3727 static bool
3729 {
3733 {
3737 {
3740 /* If we've run out of tokens, stop. */
3744 /* If the next token is a non-nested `}', then we have reached
3745 the end of the current block. */
3751 /* If it the next token is a `{', then we are entering a new
3752 block. Consume the entire block. */
3758 }
3760 /* Consume the token. */
3762 }
3763 }
3765 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3766 parameter is the PRAGMA token, allowing us to purge the entire pragma
3767 sequence. */
3769 static void
3771 {
3776 do
3780 /* Ensure that the pragma is not parsed again. */
3782 }
3784 /* Require pragma end of line, resyncing with it as necessary. The
3785 arguments are as for cp_parser_skip_to_pragma_eol. */
3787 static void
3789 {
3793 }
3795 /* This is a simple wrapper around make_typename_type. When the id is
3796 an unresolved identifier node, we can provide a superior diagnostic
3797 using cp_parser_diagnose_invalid_type_name. */
3799 static tree
3801 location_t id_location)
3802 {
3803 tree result;
3805 {
3811 }
3813 }
3815 /* This is a wrapper around the
3816 make_{pointer,ptrmem,reference}_declarator functions that decides
3817 which one to call based on the CODE and CLASS_TYPE arguments. The
3818 CODE argument should be one of the values returned by
3819 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3820 appertain to the pointer or reference. */
3824 cp_cv_quals cv_qualifiers,
3826 tree attributes)
3827 {
3834 else
3844 }
3846 /* Create a new C++ parser. */
3850 {
3855 /* cp_lexer_new_main is called before doing GC allocation because
3856 cp_lexer_new_main might load a PCH file. */
3859 /* Initialize the binops_by_token so that we can get the tree
3860 directly from the token. */
3868 /* For now, we always accept GNU extensions. */
3871 /* The `>' token is a greater-than operator, not the end of a
3872 template-id. */
3877 /* We are not parsing a constant-expression. */
3882 /* Local variable names are not forbidden. */
3885 /* We are not processing an `extern "C"' declaration. */
3888 /* We are not processing a declarator. */
3891 /* We are not processing a template-argument-list. */
3894 /* We are not in an iteration statement. */
3897 /* We are not in a switch statement. */
3900 /* We are not parsing a type-id inside an expression. */
3903 /* Declarations aren't implicitly extern "C". */
3906 /* String literals should be translated to the execution character set. */
3909 /* We are not parsing a function body. */
3912 /* We can correct until told otherwise. */
3915 /* The unparsed function queue is empty. */
3918 /* There are no classes being defined. */
3921 /* No template parameters apply. */
3924 /* Special parsing data structures. */
3928 /* Not declaring an implicit function template. */
3934 /* Allow constrained-type-specifiers. */
3937 /* We haven't yet seen an 'extern "C"'. */
3941 }
3943 /* Create a cp_lexer structure which will emit the tokens in CACHE
3944 and push it onto the parser's lexer stack. This is used for delayed
3945 parsing of in-class method bodies and default arguments, and should
3946 not be confused with tentative parsing. */
3947 static void
3949 {
3954 /* Move the current source position to that of the first token in the
3955 new lexer. */
3957 }
3959 /* Pop the top lexer off the parser stack. This is never used for the
3960 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3961 static void
3963 {
3968 /* Put the current source position back where it was before this
3969 lexer was pushed. */
3971 }
3973 /* Lexical conventions [gram.lex] */
3975 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3976 identifier. */
3978 static cp_expr
3980 {
3983 /* Look for the identifier. */
3985 /* Return the value. */
3988 else
3990 }
3992 /* Parse a sequence of adjacent string constants. Returns a
3993 TREE_STRING representing the combined, nul-terminated string
3994 constant. If TRANSLATE is true, translate the string to the
3995 execution character set. If WIDE_OK is true, a wide string is
3996 invalid here.
3998 C++98 [lex.string] says that if a narrow string literal token is
3999 adjacent to a wide string literal token, the behavior is undefined.
4000 However, C99 6.4.5p4 says that this results in a wide string literal.
4001 We follow C99 here, for consistency with the C front end.
4003 This code is largely lifted from lex_string() in c-lex.c.
4005 FUTURE: ObjC++ will need to handle @-strings here. */
4006 static cp_expr
4009 {
4010 tree value;
4017 tree string_tree;
4023 {
4026 }
4031 {
4035 }
4036 else
4037 {
4040 }
4043 /* Try to avoid the overhead of creating and destroying an obstack
4044 for the common case of just one string. */
4047 {
4055 {
4059 }
4060 else
4064 }
4065 else
4066 {
4071 do
4072 {
4074 count++;
4079 {
4082 {
4085 }
4088 {
4093 }
4095 }
4096 else
4100 {
4104 {
4108 "unsupported non-standard concatenation "
4110 }
4111 }
4119 {
4123 }
4124 else
4125 {
4129 }
4130 }
4133 /* A string literal built by concatenation has its caret=start at
4134 the start of the initial string, and its finish at the finish of
4135 the final string literal. */
4139 }
4142 {
4145 }
4149 {
4154 {
4169 }
4174 {
4179 else
4181 }
4182 }
4183 else
4184 /* cpp_interpret_string has issued an error. */
4191 }
4193 /* Look up a literal operator with the name and the exact arguments. */
4195 static tree
4197 {
4198 tree decl;
4204 {
4210 {
4213 {
4223 }
4226 /* May be this should be sufficient_parms_p instead,
4227 depending on how exactly should user-defined literals
4228 work in presence of default arguments on the literal
4229 operator parameters. */
4232 }
4233 }
4236 }
4238 /* Parse a user-defined char constant. Returns a call to a user-defined
4239 literal operator taking the character as an argument. */
4241 static cp_expr
4243 {
4251 /* Build up a call to the user-defined operator */
4252 /* Lookup the name we got back from the id-expression. */
4257 {
4262 }
4266 }
4268 /* A subroutine of cp_parser_userdef_numeric_literal to
4269 create a char... template parameter pack from a string node. */
4271 static tree
4273 {
4274 tree charvec;
4280 /* Fill in CHARVEC with all of the parameters. */
4285 /* Build the argument packs. */
4291 }
4293 /* A subroutine of cp_parser_userdef_numeric_literal to
4294 create a char... template parameter pack from a string node. */
4296 static tree
4298 {
4299 tree charvec;
4310 /* First template parm is character type. */
4313 /* Fill in CHARVEC with all of the parameters. */
4320 /* Build the argument packs. */
4326 }
4328 /* Parse a user-defined numeric constant. returns a call to a user-defined
4329 literal operator. */
4331 static cp_expr
4333 {
4344 /* Look for a literal operator taking the exact type of numeric argument
4345 as the literal value. */
4350 {
4352 tf_warning_or_error);
4355 {
4358 long_long_unsigned_type_node);
4359 }
4360 else
4361 {
4365 long_double_type_node);
4369 }
4373 }
4376 /* If the numeric argument didn't work, look for a raw literal
4377 operator taking a const char* argument consisting of the number
4378 in string format. */
4383 {
4385 tf_warning_or_error);
4388 }
4391 /* If the raw literal didn't work, look for a non-type template
4392 function with parameter pack char.... Call the function with
4393 template parameter characters representing the number. */
4397 {
4401 tf_warning_or_error);
4404 }
4408 /* In C++14 the standard library defines complex number suffixes that
4409 conflict with GNU extensions. Prefer them if <complex> is #included. */
4419 {
4424 {
4425 /* No <complex>, so pedwarn and use GNU semantics. */
4428 }
4429 }
4431 bool complained
4438 {
4440 "(from <complex>) to enable the C++14 user-defined literal "
4445 }
4452 else
4453 {
4454 /* Use the built-in semantics. */
4455 tree type;
4457 {
4460 else
4462 }
4471 }
4474 /* Avoid repeated diagnostics. */
4477 }
4479 /* Parse a user-defined string constant. Returns a call to a user-defined
4480 literal operator taking a character pointer and the length of the string
4481 as arguments. */
4483 static tree
4485 {
4494 /* Build up a call to the user-defined operator. */
4495 /* Lookup the name we got back from the id-expression. */
4502 {
4504 tf_warning_or_error);
4507 }
4510 /* Look for a template function with typename parameter CharT
4511 and parameter pack CharT... Call the function with
4512 template parameter characters representing the string. */
4516 {
4520 tf_warning_or_error);
4523 }
4529 }
4532 /* Basic concepts [gram.basic] */
4534 /* Parse a translation-unit.
4536 translation-unit:
4537 declaration-seq [opt]
4539 Returns TRUE if all went well. */
4541 static bool
4543 {
4544 /* The address of the first non-permanent object on the declarator
4545 obstack. */
4550 /* Create the declarator obstack, if necessary. */
4552 {
4554 /* Create the error declarator. */
4556 /* Create the empty parameter list. */
4558 UNKNOWN_LOCATION);
4559 /* Remember where the base of the declarator obstack lies. */
4561 }
4565 /* If there are no tokens left then all went well. */
4567 {
4568 /* Get rid of the token array; we don't need it any more. */
4572 /* This file might have been a context that's implicitly extern
4573 "C". If so, pop the lang context. (Only relevant for PCH.) */
4575 {
4578 }
4580 /* Finish up. */
4584 }
4585 else
4586 {
4589 }
4591 /* Make sure the declarator obstack was fully cleaned up. */
4595 /* All went well. */
4597 }
4599 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4600 decltype context. */
4604 {
4609 }
4611 /* We're about to parse a collection of statements. If we're currently
4612 parsing tentatively, set up a firewall so that any nested
4613 cp_parser_commit_to_tentative_parse won't affect the current context. */
4615 static cp_token_position
4617 {
4624 }
4626 /* We've finished parsing the collection of statements. Wrap up the
4627 firewall and replace the relevant tokens with the parsed form. */
4629 static void
4631 tree expr)
4632 {
4636 /* Finish the firewall level. */
4638 /* And remember the result of the parse for when we try again. */
4644 }
4646 /* Like the above functions, but let the user modify the tokens. Used by
4647 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4648 later parses, so it makes sense to localize the effects of
4649 cp_parser_commit_to_tentative_parse. */
4651 struct tentative_firewall
4652 {
4657 {
4658 /* If we're currently parsing tentatively, start a committed level as a
4659 firewall and then an inner tentative parse. */
4661 {
4665 }
4666 }
4669 {
4671 {
4672 /* Finish the inner tentative parse and the firewall, propagating any
4673 uncommitted error state to the outer tentative parse. */
4679 }
4680 }
4681 };
4683 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4684 This class is for tracking such a matching pair of symbols.
4685 In particular, it tracks the location of the first token,
4686 so that if the second token is missing, we can highlight the
4687 location of the first token when notifying the user about the
4688 problem. */
4691 class token_pair
4692 {
4694 /* token_pair's ctor. */
4697 /* If the next token is the opening symbol for this pair, consume it and
4698 return true.
4699 Otherwise, issue an error and return false.
4700 In either case, record the location of the opening token. */
4703 {
4707 }
4709 /* Consume the next token from PARSER, recording its location as
4710 that of the opening token within the pair. */
4713 {
4718 }
4720 /* If the next token is the closing symbol for this pair, consume it
4721 and return it.
4722 Otherwise, issue an error, highlighting the location of the
4723 corresponding opening token, and return NULL. */
4726 {
4729 m_open_loc);
4730 }
4733 location_t m_open_loc;
4734 };
4736 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4738 struct matching_paren_traits
4739 {
4744 };
4746 /* "matching_parens" is a token_pair<T> class for tracking matching
4747 pairs of parentheses. */
4751 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4753 struct matching_brace_traits
4754 {
4759 };
4761 /* "matching_braces" is a token_pair<T> class for tracking matching
4762 pairs of braces. */
4767 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4768 enclosing parentheses. */
4770 static cp_expr
4772 {
4775 /* Consume the '('. */
4777 matching_parens parens;
4779 /* Start the statement-expression. */
4781 /* Parse the compound-statement. */
4783 /* Finish up. */
4785 /* Consume the ')'. */
4793 }
4795 /* Expressions [gram.expr] */
4797 /* Parse a fold-operator.
4799 fold-operator:
4800 - * / % ^ & | = < > << >>
4801 = -= *= /= %= ^= &= |= <<= >>=
4802 == != <= >= && || , .* ->*
4804 This returns the tree code corresponding to the matched operator
4805 as an int. When the current token matches a compound assignment
4806 opertor, the resulting tree code is the negative value of the
4807 non-assignment operator. */
4809 static int
4811 {
4813 {
4853 }
4854 }
4856 /* Returns true if CODE indicates a binary expression, which is not allowed in
4857 the LHS of a fold-expression. More codes will need to be added to use this
4858 function in other contexts. */
4860 static bool
4862 {
4864 {
4897 }
4898 }
4900 /* If the next token is a suitable fold operator, consume it and return as
4901 the function above. */
4903 static int
4905 {
4911 }
4913 /* Parse a fold-expression.
4915 fold-expression:
4916 ( ... folding-operator cast-expression)
4917 ( cast-expression folding-operator ... )
4918 ( cast-expression folding operator ... folding-operator cast-expression)
4920 Note that the '(' and ')' are matched in primary expression. */
4922 static cp_expr
4924 {
4925 cp_id_kind pidk;
4927 // Left fold.
4929 {
4933 {
4936 }
4943 }
4948 {
4951 }
4954 {
4957 }
4960 /* The operands of a fold-expression are cast-expressions, so binary or
4961 conditional expressions are not allowed. We check this here to avoid
4962 tentative parsing. */
4974 // Right fold.
4979 {
4982 }
4985 // Binary left or right fold.
4990 }
4992 /* Parse a primary-expression.
4994 primary-expression:
4995 literal
4996 this
4997 ( expression )
4998 id-expression
4999 lambda-expression (C++11)
5001 GNU Extensions:
5003 primary-expression:
5004 ( compound-statement )
5005 __builtin_va_arg ( assignment-expression , type-id )
5006 __builtin_offsetof ( type-id , offsetof-expression )
5008 C++ Extensions:
5009 __has_nothrow_assign ( type-id )
5010 __has_nothrow_constructor ( type-id )
5011 __has_nothrow_copy ( type-id )
5012 __has_trivial_assign ( type-id )
5013 __has_trivial_constructor ( type-id )
5014 __has_trivial_copy ( type-id )
5015 __has_trivial_destructor ( type-id )
5016 __has_virtual_destructor ( type-id )
5017 __is_abstract ( type-id )
5018 __is_base_of ( type-id , type-id )
5019 __is_class ( type-id )
5020 __is_empty ( type-id )
5021 __is_enum ( type-id )
5022 __is_final ( type-id )
5023 __is_literal_type ( type-id )
5024 __is_pod ( type-id )
5025 __is_polymorphic ( type-id )
5026 __is_std_layout ( type-id )
5027 __is_trivial ( type-id )
5028 __is_union ( type-id )
5030 Objective-C++ Extension:
5032 primary-expression:
5033 objc-expression
5035 literal:
5036 __null
5038 ADDRESS_P is true iff this expression was immediately preceded by
5039 "&" and therefore might denote a pointer-to-member. CAST_P is true
5040 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5041 true iff this expression is a template argument.
5043 Returns a representation of the expression. Upon return, *IDK
5044 indicates what kind of id-expression (if any) was present. */
5046 static cp_expr
5053 {
5056 /* Assume the primary expression is not an id-expression. */
5059 /* Peek at the next token. */
5062 {
5063 /* literal:
5064 integer-literal
5065 character-literal
5066 floating-literal
5067 string-literal
5068 boolean-literal
5069 pointer-literal
5070 user-defined-literal */
5082 {
5086 }
5087 /* Floating-point literals are only allowed in an integral
5088 constant expression if they are cast to an integral or
5089 enumeration type. */
5093 {
5094 /* CAST_P will be set even in invalid code like "int(2.7 +
5095 ...)". Therefore, we have to check that the next token
5096 is sure to end the cast. */
5098 {
5103 enumerator-definition. */
5105 /* The curly brace at the end of an enum-specifier. */
5107 /* The end of a statement. */
5109 /* The end of the cast-expression. */
5111 /* The end of an array bound. */
5113 /* The closing ">" in a template-argument-list. */
5116 /* C++0x only: A ">>" treated like two ">" tokens,
5117 in a template-argument-list. */
5122 }
5124 /* If we are within a cast, then the constraint that the
5125 cast is to an integral or enumeration type will be
5126 checked at that point. If we are not within a cast, then
5127 this code is invalid. */
5130 }
5150 /* ??? Should wide strings be allowed when parser->translate_strings_p
5151 is false (i.e. in attributes)? If not, we can kill the third
5152 argument to cp_parser_string_literal. */
5158 /* If we see `( { ' then we are looking at the beginning of
5159 a GNU statement-expression. */
5162 {
5163 /* Statement-expressions are not allowed by the standard. */
5167 /* And they're not allowed outside of a function-body; you
5168 cannot, for example, write:
5170 int i = ({ int j = 3; j + 1; });
5172 at class or namespace scope. */
5175 {
5177 "statement-expressions are not allowed outside "
5183 }
5184 else
5186 }
5187 /* Otherwise it's a normal parenthesized expression. */
5188 {
5189 cp_expr expr;
5194 /* Consume the `('. */
5195 matching_parens parens;
5197 /* Within a parenthesized expression, a `>' token is always
5198 the greater-than operator. */
5199 saved_greater_than_is_operator_p
5204 /* Left fold expression. */
5206 else
5207 /* Parse the parenthesized expression. */
5212 {
5219 }
5220 else
5221 /* Let the front end know that this expression was
5222 enclosed in parentheses. This matters in case, for
5223 example, the expression is of the form `A::B', since
5224 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5225 not. */
5228 /* DR 705: Wrapping an unqualified name in parentheses
5229 suppresses arg-dependent lookup. We want to pass back
5230 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5231 (c++/37862), but none of the others. */
5235 /* The `>' token might be the end of a template-id or
5236 template-parameter-list now. */
5237 parser->greater_than_is_operator_p
5240 /* Consume the `)'. */
5249 }
5252 {
5254 {
5255 /* We might have an Objective-C++ message. */
5258 /* If that works out, we're done ... */
5261 /* ... else, fall though to see if it's a lambda. */
5262 }
5264 /* Don't warn about a failed tentative parse. */
5269 }
5273 /* We have an Objective-C++ string literal. */
5280 {
5281 /* These two are the boolean literals. */
5289 /* The `__null' literal. */
5294 /* The `nullptr' literal. */
5299 /* Recognize the `this' keyword. */
5303 {
5307 }
5308 /* Pointers cannot appear in constant-expressions. */
5313 /* The `operator' keyword can be the beginning of an
5314 id-expression. */
5321 {
5322 non_integral_constant name;
5324 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5325 __func__ are the names of variables -- but they are
5326 treated specially. Therefore, they are handled here,
5327 rather than relying on the generic id-expression logic
5328 below. Grammatically, these names are id-expressions.
5330 Consume the token. */
5334 {
5346 }
5351 /* Look up the name. */
5353 }
5356 {
5357 tree expression;
5358 tree type;
5359 source_location type_location;
5360 location_t start_loc
5362 /* The `__builtin_va_arg' construct is used to handle
5363 `va_arg'. Consume the `__builtin_va_arg' token. */
5365 /* Look for the opening `('. */
5366 matching_parens parens;
5368 /* Now, parse the assignment-expression. */
5370 /* Look for the `,'. */
5373 /* Parse the type-id. */
5374 {
5377 }
5378 /* Look for the closing `)'. */
5379 location_t finish_loc
5382 /* Using `va_arg' in a constant-expression is not
5383 allowed. */
5385 NIC_VA_ARG))
5387 /* Construct a location of the form:
5388 __builtin_va_arg (v, int)
5389 ~~~~~~~~~~~~~~~~~~~~~^~~~
5390 with the caret at the type, ranging from the start of the
5391 "__builtin_va_arg" token to the close paren. */
5392 location_t combined_loc
5395 }
5430 // C++ concepts
5434 /* Objective-C++ expressions. */
5444 {
5449 }
5450 /* FALLTHRU */
5454 }
5456 /* An id-expression can start with either an identifier, a
5457 `::' as the beginning of a qualified-id, or the "operator"
5458 keyword. */
5463 {
5464 id_expression:
5465 cp_expr id_expression;
5466 cp_expr decl;
5472 /* Parse the id-expression. */
5473 id_expression
5490 /* If we have a template-id, then no further lookup is
5491 required. If the template-id was for a template-class, we
5492 will sometimes have a TYPE_DECL at this point. */
5496 /* Look up the name. */
5497 else
5498 {
5499 tree ambiguous_decls;
5501 /* If we already know that this lookup is ambiguous, then
5502 we've already issued an error message; there's no reason
5503 to check again. */
5506 {
5509 }
5512 none_type,
5513 template_p,
5518 /* If the lookup was ambiguous, an error will already have
5519 been issued. */
5523 /* In Objective-C++, we may have an Objective-C 2.0
5524 dot-syntax for classes here. */
5529 {
5530 tree component;
5537 component);
5538 /* Build a location of the form:
5539 expr.component
5540 ~~~~~^~~~~~~~~
5541 with caret at the start of the component name (at
5542 input_location), ranging from the start of the id_expression
5543 to the end of the component name. */
5544 location_t combined_loc
5549 }
5551 /* In Objective-C++, an instance variable (ivar) may be preferred
5552 to whatever cp_parser_lookup_name() found.
5553 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5554 rest of c-family, we have to do a little extra work to preserve
5555 any location information in cp_expr "decl". Given that
5556 objc_lookup_ivar is implemented in "c-family" and "objc", we
5557 have a trip through the pure "tree" type, rather than cp_expr.
5558 Naively copying it back to "decl" would implicitly give the
5559 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5560 store an EXPR_LOCATION. Hence we only update "decl" (and
5561 hence its location_t) if we get back a different tree node. */
5563 id_expression);
5567 /* If name lookup gives us a SCOPE_REF, then the
5568 qualifying scope was dependent. */
5570 {
5571 /* At this point, we do not know if DECL is a valid
5572 integral constant expression. We assume that it is
5573 in fact such an expression, so that code like:
5575 template <int N> struct A {
5576 int a[B<N>::i];
5577 };
5579 is accepted. At template-instantiation time, we
5580 will check that B<N>::i is actually a constant. */
5582 }
5583 /* Check to see if DECL is a local variable in a context
5584 where that is forbidden. */
5587 {
5592 }
5593 }
5595 decl = (finish_id_expression
5597 idk,
5602 template_arg_p,
5609 }
5611 /* Anything else is an error. */
5615 }
5616 }
5624 {
5627 }
5629 /* Parse an id-expression.
5631 id-expression:
5632 unqualified-id
5633 qualified-id
5635 qualified-id:
5636 :: [opt] nested-name-specifier template [opt] unqualified-id
5637 :: identifier
5638 :: operator-function-id
5639 :: template-id
5641 Return a representation of the unqualified portion of the
5642 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5643 a `::' or nested-name-specifier.
5645 Often, if the id-expression was a qualified-id, the caller will
5646 want to make a SCOPE_REF to represent the qualified-id. This
5647 function does not do this in order to avoid wastefully creating
5648 SCOPE_REFs when they are not required.
5650 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5651 `template' keyword.
5653 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5654 uninstantiated templates.
5656 If *TEMPLATE_P is non-NULL, it is set to true iff the
5657 `template' keyword is used to explicitly indicate that the entity
5658 named is a template.
5660 If DECLARATOR_P is true, the id-expression is appearing as part of
5661 a declarator, rather than as part of an expression. */
5663 static cp_expr
5670 {
5674 /* Assume the `template' keyword was not used. */
5678 /* Look for the optional `::' operator. */
5679 global_scope_p
5680 = (!template_keyword_p
5685 /* Look for the optional nested-name-specifier. */
5686 nested_name_specifier_p
5689 check_dependency_p,
5691 declarator_p,
5692 template_keyword_p)
5695 /* If there is a nested-name-specifier, then we are looking at
5696 the first qualified-id production. */
5698 {
5699 tree saved_scope;
5700 tree saved_object_scope;
5701 tree saved_qualifying_scope;
5702 cp_expr unqualified_id;
5705 /* See if the next token is the `template' keyword. */
5709 /* Name lookup we do during the processing of the
5710 unqualified-id might obliterate SCOPE. */
5714 /* Process the final unqualified-id. */
5716 check_dependency_p,
5717 declarator_p,
5719 /* Restore the SAVED_SCOPE for our caller. */
5725 }
5726 /* Otherwise, if we are in global scope, then we are looking at one
5727 of the other qualified-id productions. */
5729 {
5731 tree id;
5733 /* Peek at the next token. */
5736 /* If it's an identifier, and the next token is not a "<", then
5737 we can avoid the template-id case. This is an optimization
5738 for this common case. */
5740 && !cp_parser_nth_token_starts_template_argument_list_p
5745 /* Try a template-id. */
5749 none_type,
5750 declarator_p);
5751 /* If that worked, we're done. */
5755 /* Peek at the next token. (Changes in the token buffer may
5756 have invalidated the pointer obtained above.) */
5760 {
5767 /* Fall through. */
5772 }
5773 }
5774 else
5777 declarator_p,
5778 optional_p);
5779 }
5781 /* Parse an unqualified-id.
5783 unqualified-id:
5784 identifier
5785 operator-function-id
5786 conversion-function-id
5787 ~ class-name
5788 template-id
5790 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5791 keyword, in a construct like `A::template ...'.
5793 Returns a representation of unqualified-id. For the `identifier'
5794 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5795 production a BIT_NOT_EXPR is returned; the operand of the
5796 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5797 other productions, see the documentation accompanying the
5798 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5799 names are looked up in uninstantiated templates. If DECLARATOR_P
5800 is true, the unqualified-id is appearing as part of a declarator,
5801 rather than as part of an expression. */
5803 static cp_expr
5809 {
5812 /* Peek at the next token. */
5816 {
5818 {
5819 tree id;
5821 /* We don't know yet whether or not this will be a
5822 template-id. */
5824 /* Try a template-id. */
5826 check_dependency_p,
5827 none_type,
5828 declarator_p);
5829 /* If it worked, we're done. */
5832 /* Otherwise, it's an ordinary identifier. */
5834 }
5838 check_dependency_p,
5839 none_type,
5840 declarator_p);
5843 {
5844 tree type_decl;
5845 tree qualifying_scope;
5846 tree object_scope;
5847 tree scope;
5850 /* Consume the `~' token. */
5852 /* Parse the class-name. The standard, as written, seems to
5853 say that:
5855 template <typename T> struct S { ~S (); };
5856 template <typename T> S<T>::~S() {}
5858 is invalid, since `~' must be followed by a class-name, but
5859 `S<T>' is dependent, and so not known to be a class.
5860 That's not right; we need to look in uninstantiated
5861 templates. A further complication arises from:
5863 template <typename T> void f(T t) {
5864 t.T::~T();
5865 }
5867 Here, it is not possible to look up `T' in the scope of `T'
5868 itself. We must look in both the current scope, and the
5869 scope of the containing complete expression.
5871 Yet another issue is:
5873 struct S {
5874 int S;
5875 ~S();
5876 };
5878 S::~S() {}
5880 The standard does not seem to say that the `S' in `~S'
5881 should refer to the type `S' and not the data member
5882 `S::S'. */
5884 /* DR 244 says that we look up the name after the "~" in the
5885 same scope as we looked up the qualifying name. That idea
5886 isn't fully worked out; it's more complicated than that. */
5891 /* Check for invalid scopes. */
5893 {
5897 }
5899 {
5903 scope);
5908 }
5911 /* If the name is of the form "X::~X" it's OK even if X is a
5912 typedef. */
5921 {
5924 }
5926 /* ~auto means the destructor of whatever the object is. */
5928 {
5931 "%<~auto%> only available with "
5935 }
5937 /* If there was an explicit qualification (S::~T), first look
5938 in the scope given by the qualification (i.e., S).
5940 Note: in the calls to cp_parser_class_name below we pass
5941 typename_type so that lookup finds the injected-class-name
5942 rather than the constructor. */
5946 {
5951 typename_type,
5954 declarator_p);
5957 }
5958 /* In "N::S::~S", look in "N" as well. */
5960 {
5965 type_decl
5969 typename_type,
5972 declarator_p);
5975 }
5976 /* In "p->S::~T", look in the scope given by "*p" as well. */
5978 {
5983 type_decl
5987 typename_type,
5990 declarator_p);
5993 }
5994 /* Look in the surrounding context. */
5996 {
6002 type_decl
6006 typename_type,
6009 declarator_p);
6012 {
6013 /* We couldn't find a type with this name. If we're parsing
6014 tentatively, fail and try something else. */
6016 {
6019 }
6020 /* Otherwise, accept it and check for a match at instantiation
6021 time. */
6026 }
6027 }
6028 /* If an error occurred, assume that the name of the
6029 destructor is the same as the name of the qualifying
6030 class. That allows us to keep parsing after running
6031 into ill-formed destructor names. */
6037 /* Check that destructor name and scope match. */
6039 {
6046 }
6048 /* [class.dtor]
6050 A typedef-name that names a class shall not be used as the
6051 identifier in the declarator for a destructor declaration. */
6058 type_decl);
6061 }
6065 {
6066 cp_expr id;
6068 /* This could be a template-id, so we try that first. */
6070 /* Try a template-id. */
6073 none_type,
6074 declarator_p);
6075 /* If that worked, we're done. */
6078 /* We still don't know whether we're looking at an
6079 operator-function-id or a conversion-function-id. */
6081 /* Try an operator-function-id. */
6083 /* If that didn't work, try a conversion-function-id. */
6088 }
6089 /* Fall through. */
6096 }
6097 }
6099 /* Parse an (optional) nested-name-specifier.
6101 nested-name-specifier: [C++98]
6102 class-or-namespace-name :: nested-name-specifier [opt]
6103 class-or-namespace-name :: template nested-name-specifier [opt]
6105 nested-name-specifier: [C++0x]
6106 type-name ::
6107 namespace-name ::
6108 nested-name-specifier identifier ::
6109 nested-name-specifier template [opt] simple-template-id ::
6111 PARSER->SCOPE should be set appropriately before this function is
6112 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6113 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6114 in name lookups.
6116 Sets PARSER->SCOPE to the class (TYPE) or namespace
6117 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6118 it unchanged if there is no nested-name-specifier. Returns the new
6119 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6121 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6122 part of a declaration and/or decl-specifier. */
6124 static tree
6131 {
6136 /* Remember where the nested-name-specifier starts. */
6138 {
6141 }
6144 {
6145 tree new_scope;
6146 tree old_scope;
6147 tree saved_qualifying_scope;
6149 /* Spot cases that cannot be the beginning of a
6150 nested-name-specifier. */
6153 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6154 the already parsed nested-name-specifier. */
6156 {
6157 /* Grab the nested-name-specifier and continue the loop. */
6159 /* If we originally encountered this nested-name-specifier
6160 with IS_DECLARATION set to false, we will not have
6161 resolved TYPENAME_TYPEs, so we must do so here. */
6164 {
6169 }
6172 }
6174 /* Spot cases that cannot be the beginning of a
6175 nested-name-specifier. On the second and subsequent times
6176 through the loop, we look for the `template' keyword. */
6178 ;
6179 /* A template-id can start a nested-name-specifier. */
6181 ;
6182 /* DR 743: decltype can be used in a nested-name-specifier. */
6184 ;
6185 else
6186 {
6187 /* If the next token is not an identifier, then it is
6188 definitely not a type-name or namespace-name. */
6191 /* If the following token is neither a `<' (to begin a
6192 template-id), nor a `::', then we are not looking at a
6193 nested-name-specifier. */
6199 {
6203 "found %<:%> in nested-name-specifier, "
6206 }
6209 && !cp_parser_nth_token_starts_template_argument_list_p
6212 }
6214 /* The nested-name-specifier is optional, so we parse
6215 tentatively. */
6218 /* Look for the optional `template' keyword, if this isn't the
6219 first time through the loop. */
6223 /* Save the old scope since the name lookup we are about to do
6224 might destroy it. */
6227 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6228 look up names in "X<T>::I" in order to determine that "Y" is
6229 a template. So, if we have a typename at this point, we make
6230 an effort to look through it. */
6232 && !typename_keyword_p
6237 /* Parse the qualifying entity. */
6238 new_scope
6240 typename_keyword_p,
6241 template_keyword_p,
6242 check_dependency_p,
6243 type_p,
6244 is_declaration);
6245 /* Look for the `::' token. */
6248 /* If we found what we wanted, we keep going; otherwise, we're
6249 done. */
6251 {
6254 /* Restore the OLD_SCOPE since it was valid before the
6255 failed attempt at finding the last
6256 class-or-namespace-name. */
6260 /* If the next token is a decltype, and the one after that is a
6261 `::', then the decltype has failed to resolve to a class or
6262 enumeration type. Give this error even when parsing
6263 tentatively since it can't possibly be valid--and we're going
6264 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6265 won't get another chance.*/
6269 {
6276 /* As below. */
6279 }
6283 {
6284 /* If we have a non-type template-id followed by ::, it can't
6285 possibly be valid. */
6290 {
6293 {
6299 }
6300 else
6301 {
6302 /* Variable template. */
6307 }
6314 /* As below. */
6318 }
6319 }
6323 /* If the next token is an identifier, and the one after
6324 that is a `::', then any valid interpretation would have
6325 found a class-or-namespace-name. */
6331 {
6334 {
6336 {
6337 tree decl;
6338 tree ambiguous_decls;
6341 none_type,
6350 decl);
6352 {
6353 // cp_parser_lookup_name has the same diagnostic,
6354 // thus make sure to emit it at most once.
6357 {
6362 }
6364 }
6365 else
6366 {
6368 cp_parser_name_lookup_error
6371 else
6372 cp_parser_name_lookup_error
6375 }
6376 }
6379 /* Treat this as a successful nested-name-specifier
6380 due to:
6382 [basic.lookup.qual]
6384 If the name found is not a class-name (clause
6385 _class_) or namespace-name (_namespace.def_), the
6386 program is ill-formed. */
6388 }
6390 }
6392 }
6393 /* We've found one valid nested-name-specifier. */
6395 /* Name lookup always gives us a DECL. */
6398 /* Uses of "template" must be followed by actual templates. */
6410 new_scope);
6411 /* If it is a class scope, try to complete it; we are about to
6412 be looking up names inside the class. */
6414 /* Since checking types for dependency can be expensive,
6415 avoid doing it if the type is already complete. */
6417 /* Do not try to complete dependent types. */
6419 {
6421 /* If it is a typedef to current class, use the current
6422 class instead, as the typedef won't have any names inside
6423 it yet. */
6427 }
6428 /* Make sure we look in the right scope the next time through
6429 the loop. */
6431 }
6433 /* If parsing tentatively, replace the sequence of tokens that makes
6434 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6435 token. That way, should we re-parse the token stream, we will
6436 not have to repeat the effort required to do the parse, nor will
6437 we issue duplicate error messages. */
6439 {
6443 /* Reset the contents of the START token. */
6445 /* Retrieve any deferred checks. Do not pop this access checks yet
6446 so the memory will not be reclaimed during token replacing below. */
6454 /* Purge all subsequent tokens. */
6456 }
6462 }
6464 /* Parse a nested-name-specifier. See
6465 cp_parser_nested_name_specifier_opt for details. This function
6466 behaves identically, except that it will an issue an error if no
6467 nested-name-specifier is present. */
6469 static tree
6475 {
6476 tree scope;
6478 /* Look for the nested-name-specifier. */
6480 typename_keyword_p,
6481 check_dependency_p,
6482 type_p,
6483 is_declaration);
6484 /* If it was not present, issue an error message. */
6486 {
6489 }
6492 }
6494 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6495 this is either a class-name or a namespace-name (which corresponds
6496 to the class-or-namespace-name production in the grammar). For
6497 C++0x, it can also be a type-name that refers to an enumeration
6498 type or a simple-template-id.
6500 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6501 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6502 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6503 TYPE_P is TRUE iff the next name should be taken as a class-name,
6504 even the same name is declared to be another entity in the same
6505 scope.
6507 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6508 specified by the class-or-namespace-name. If neither is found the
6509 ERROR_MARK_NODE is returned. */
6511 static tree
6518 {
6519 tree saved_scope;
6520 tree saved_qualifying_scope;
6521 tree saved_object_scope;
6522 tree scope;
6526 /* DR 743: decltype can appear in a nested-name-specifier. */
6528 {
6532 {
6535 }
6539 }
6541 /* Before we try to parse the class-name, we must save away the
6542 current PARSER->SCOPE since cp_parser_class_name will destroy
6543 it. */
6547 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6548 there is no need to look for a namespace-name. */
6549 only_class_p = template_keyword_p
6554 typename_keyword_p,
6555 template_keyword_p,
6557 check_dependency_p,
6559 is_declaration,
6562 /* If that didn't work, try for a namespace-name. */
6564 {
6565 /* Restore the saved scope. */
6569 /* If we are not looking at an identifier followed by the scope
6570 resolution operator, then this is not part of a
6571 nested-name-specifier. (Note that this function is only used
6572 to parse the components of a nested-name-specifier.) */
6577 }
6580 }
6582 /* Return true if we are looking at a compound-literal, false otherwise. */
6584 static bool
6586 {
6589 /* Skip tokens until the next token is a closing parenthesis.
6590 If we find the closing `)', and the next token is a `{', then
6591 we are looking at a compound-literal. */
6592 bool compound_literal_p
6597 /* Roll back the tokens we skipped. */
6601 }
6603 /* Return true if EXPR is the integer constant zero or a complex constant
6604 of zero, without any folding, but ignoring location wrappers. */
6606 static bool
6608 {
6611 }
6613 /* Parse a postfix-expression.
6615 postfix-expression:
6616 primary-expression
6617 postfix-expression [ expression ]
6618 postfix-expression ( expression-list [opt] )
6619 simple-type-specifier ( expression-list [opt] )
6620 typename :: [opt] nested-name-specifier identifier
6621 ( expression-list [opt] )
6622 typename :: [opt] nested-name-specifier template [opt] template-id
6623 ( expression-list [opt] )
6624 postfix-expression . template [opt] id-expression
6625 postfix-expression -> template [opt] id-expression
6626 postfix-expression . pseudo-destructor-name
6627 postfix-expression -> pseudo-destructor-name
6628 postfix-expression ++
6629 postfix-expression --
6630 dynamic_cast < type-id > ( expression )
6631 static_cast < type-id > ( expression )
6632 reinterpret_cast < type-id > ( expression )
6633 const_cast < type-id > ( expression )
6634 typeid ( expression )
6635 typeid ( type-id )
6637 GNU Extension:
6639 postfix-expression:
6640 ( type-id ) { initializer-list , [opt] }
6642 This extension is a GNU version of the C99 compound-literal
6643 construct. (The C99 grammar uses `type-name' instead of `type-id',
6644 but they are essentially the same concept.)
6646 If ADDRESS_P is true, the postfix expression is the operand of the
6647 `&' operator. CAST_P is true if this expression is the target of a
6648 cast.
6650 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6651 class member access expressions [expr.ref].
6653 Returns a representation of the expression. */
6655 static cp_expr
6659 {
6661 location_t loc;
6667 /* Peek at the next token. */
6672 /* Some of the productions are determined by keywords. */
6675 {
6680 {
6681 tree type;
6682 cp_expr expression;
6686 /* All of these can be handled in the same way from the point
6687 of view of parsing. Begin by consuming the token
6688 identifying the cast. */
6691 /* New types cannot be defined in the cast. */
6693 parser->type_definition_forbidden_message
6696 /* Look for the opening `<'. */
6698 /* Parse the type to which we are casting. */
6703 /* Look for the closing `>'. */
6705 /* Restore the old message. */
6708 bool saved_greater_than_is_operator_p
6712 /* And the expression which is being cast. */
6713 matching_parens parens;
6717 RT_CLOSE_PAREN);
6721 parser->greater_than_is_operator_p
6724 /* Only type conversions to integral or enumeration types
6725 can be used in constant-expressions. */
6728 {
6731 }
6734 {
6736 postfix_expression
6740 postfix_expression
6744 postfix_expression
6746 tf_warning_or_error);
6749 postfix_expression
6754 }
6756 /* Construct a location e.g. :
6757 reinterpret_cast <int *> (expr)
6758 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6759 ranging from the start of the "*_cast" token to the final closing
6760 paren, with the caret at the start. */
6763 }
6767 {
6768 tree type;
6772 /* Consume the `typeid' token. */
6774 /* Look for the `(' token. */
6775 matching_parens parens;
6777 /* Types cannot be defined in a `typeid' expression. */
6779 parser->type_definition_forbidden_message
6781 /* We can't be sure yet whether we're looking at a type-id or an
6782 expression. */
6784 /* Try a type-id first. */
6789 /* Look for the `)' token. Otherwise, we can't be sure that
6790 we're not looking at an expression: consider `typeid (int
6791 (3))', for example. */
6793 /* If all went well, simply lookup the type-id. */
6796 /* Otherwise, fall back to the expression variant. */
6797 else
6798 {
6799 tree expression;
6801 /* Look for an expression. */
6803 /* Compute its typeid. */
6805 /* Look for the `)' token. */
6807 }
6808 /* Restore the saved message. */
6810 /* `typeid' may not appear in an integral constant expression. */
6814 /* Construct a location e.g. :
6815 typeid (expr)
6816 ^~~~~~~~~~~~~
6817 ranging from the start of the "typeid" token to the final closing
6818 paren, with the caret at the start. */
6820 {
6821 location_t typeid_loc
6825 }
6826 }
6830 {
6831 tree type;
6832 /* The syntax permitted here is the same permitted for an
6833 elaborated-type-specifier. */
6840 }
6846 {
6849 tree p;
6856 {
6859 }
6865 {
6868 postfix_expression
6870 else
6871 {
6875 }
6881 tf_warning_or_error);
6882 else
6883 {
6887 }
6892 postfix_expression
6896 postfix_expression
6899 else
6900 {
6904 }
6909 }
6911 }
6914 {
6915 tree type;
6917 /* If the next thing is a simple-type-specifier, we may be
6918 looking at a functional cast. We could also be looking at
6919 an id-expression. So, we try the functional cast, and if
6920 that doesn't work we fall back to the primary-expression. */
6922 /* Look for the simple-type-specifier. */
6926 CP_PARSER_FLAGS_NONE);
6928 /* Parse the cast itself. */
6930 postfix_expression
6932 /* If that worked, we're done. */
6936 /* If the functional-cast didn't work out, try a
6937 compound-literal. */
6940 {
6945 matching_parens parens;
6948 /* Avoid calling cp_parser_type_id pointlessly, see comment
6949 in cp_parser_cast_expression about c++/29234. */
6952 else
6953 {
6954 /* Parse the type. */
6960 }
6962 /* If things aren't going well, there's no need to
6963 keep going. */
6965 {
6967 /* Parse the brace-enclosed initializer list. */
6970 }
6971 /* If that worked, we're definitely looking at a
6972 compound-literal expression. */
6974 {
6975 /* Warn the user that a compound literal is not
6976 allowed in standard C++. */
6979 /* For simplicity, we disallow compound literals in
6980 constant-expressions. We could
6981 allow compound literals of integer type, whose
6982 initializer was a constant, in constant
6983 expressions. Permitting that usage, as a further
6984 extension, would not change the meaning of any
6985 currently accepted programs. (Of course, as
6986 compound literals are not part of ISO C++, the
6987 standard has nothing to say.) */
6989 NIC_NCC))
6990 {
6993 }
6994 /* Form the representation of the compound-literal. */
6995 postfix_expression
7000 }
7001 }
7003 /* It must be a primary-expression. */
7004 postfix_expression
7007 decltype_p,
7009 }
7011 }
7013 /* Note that we don't need to worry about calling build_cplus_new on a
7014 class-valued CALL_EXPR in decltype when it isn't the end of the
7015 postfix-expression; unary_complex_lvalue will take care of that for
7016 all these cases. */
7018 /* Keep looping until the postfix-expression is complete. */
7020 {
7024 /* It is not a Koenig lookup function call. */
7025 postfix_expression
7028 /* Peek at the next token. */
7032 {
7035 {
7037 "two consecutive %<[%> shall "
7040 }
7041 postfix_expression
7043 postfix_expression,
7045 decltype_p);
7054 /* postfix-expression ( expression-list [opt] ) */
7055 {
7066 is_builtin_constant_p
7069 {
7070 /* The whole point of __builtin_constant_p is to allow
7071 non-constant expressions to appear as arguments. */
7072 saved_integral_constant_expression_p
7074 saved_non_integral_constant_expression_p
7077 }
7078 args = (cp_parser_parenthesized_expression_list
7085 {
7086 parser->integral_constant_expression_p
7088 parser->non_integral_constant_expression_p
7090 }
7093 {
7096 }
7098 /* Function calls are not permitted in
7099 constant-expressions. */
7102 NIC_FUNC_CALL))
7103 {
7107 }
7112 {
7114 {
7116 {
7119 postfix_expression
7121 complain);
7122 }
7123 else
7124 postfix_expression
7126 }
7127 /* We do not perform argument-dependent lookup if
7128 normal lookup finds a non-function, in accordance
7129 with the expected resolution of DR 218. */
7132 {
7136 /* Do not do argument dependent lookup if regular
7137 lookup finds a member function or a block-scope
7138 function declaration. [basic.lookup.argdep]/3 */
7141 {
7144 postfix_expression
7146 complain);
7147 }
7148 }
7149 }
7155 {
7162 }
7165 {
7175 {
7177 postfix_expression
7181 }
7184 {
7185 postfix_expression
7186 = (build_new_method_call
7192 complain));
7193 }
7194 else
7195 postfix_expression
7199 complain);
7200 }
7204 postfix_expression = (build_offset_ref_call_from_tree
7206 complain));
7208 /* A call to a static class member, or a namespace-scope
7209 function. */
7210 postfix_expression
7213 koenig_p,
7214 complain);
7215 else
7216 /* All other function calls. */
7217 postfix_expression
7220 koenig_p,
7221 complain);
7224 {
7226 start_loc,
7227 close_paren_loc);
7229 }
7231 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7235 }
7240 /* postfix-expression . template [opt] id-expression
7241 postfix-expression . pseudo-destructor-name
7242 postfix-expression -> template [opt] id-expression
7243 postfix-expression -> pseudo-destructor-name */
7245 /* Consume the `.' or `->' operator. */
7248 postfix_expression
7250 postfix_expression,
7257 /* postfix-expression ++ */
7258 /* Consume the `++' token. */
7260 /* Generate a representation for the complete expression. */
7261 postfix_expression
7263 POSTINCREMENT_EXPR);
7264 /* Increments may not appear in constant-expressions. */
7272 /* postfix-expression -- */
7273 /* Consume the `--' token. */
7275 /* Generate a representation for the complete expression. */
7276 postfix_expression
7278 POSTDECREMENT_EXPR);
7279 /* Decrements may not appear in constant-expressions. */
7290 return is_member_access
7291 ? postfix_expression
7293 else
7295 }
7296 }
7298 /* We should never get here. */
7301 }
7303 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7304 by cp_parser_builtin_offsetof. We're looking for
7306 postfix-expression [ expression ]
7307 postfix-expression [ braced-init-list ] (C++11)
7309 FOR_OFFSETOF is set if we're being called in that context, which
7310 changes how we deal with integer constant expressions. */
7312 static tree
7314 tree postfix_expression,
7317 {
7322 /* Consume the `[' token. */
7328 /* Parse the index expression. */
7329 /* ??? For offsetof, there is a question of what to allow here. If
7330 offsetof is not being used in an integral constant expression context,
7331 then we *could* get the right answer by computing the value at runtime.
7332 If we are in an integral constant expression context, then we might
7333 could accept any constant expression; hard to say without analysis.
7334 Rather than open the barn door too wide right away, allow only integer
7335 constant expressions here. */
7338 else
7339 {
7341 {
7346 }
7347 else
7349 }
7353 /* Look for the closing `]'. */
7356 /* Build the ARRAY_REF. */
7360 /* When not doing offsetof, array references are not permitted in
7361 constant-expressions. */
7367 }
7369 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7370 dereference of incomplete type, returns true if error_mark_node should
7371 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7372 and *DEPENDENT_P. */
7374 bool
7377 {
7378 /* In a template, be permissive by treating an object expression
7379 of incomplete type as dependent (after a pedwarn). */
7380 diagnostic_t kind = (processing_template_decl
7384 {
7396 /* Don't emit any diagnostic for OVERLOADs. */
7400 /* Avoid clobbering e.g. DECLs. */
7404 }
7416 {
7419 }
7421 }
7423 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7424 by cp_parser_builtin_offsetof. We're looking for
7426 postfix-expression . template [opt] id-expression
7427 postfix-expression . pseudo-destructor-name
7428 postfix-expression -> template [opt] id-expression
7429 postfix-expression -> pseudo-destructor-name
7431 FOR_OFFSETOF is set if we're being called in that context. That sorta
7432 limits what of the above we'll actually accept, but nevermind.
7433 TOKEN_TYPE is the "." or "->" token, which will already have been
7434 removed from the stream. */
7436 static tree
7439 cp_expr postfix_expression,
7441 location_t location)
7442 {
7443 tree name;
7449 /* If this is a `->' operator, dereference the pointer. */
7452 tf_warning_or_error);
7453 /* Check to see whether or not the expression is type-dependent and
7454 not the current instantiation. */
7456 /* The identifier following the `->' or `.' is not qualified. */
7462 /* Enter the scope corresponding to the type of the object
7463 given by the POSTFIX_EXPRESSION. */
7465 {
7467 /* According to the standard, no expression should ever have
7468 reference type. Unfortunately, we do not currently match
7469 the standard in this respect in that our internal representation
7470 of an expression may have reference type even when the standard
7471 says it does not. Therefore, we have to manually obtain the
7472 underlying type here. */
7474 /* The type of the POSTFIX_EXPRESSION must be complete. */
7475 /* Unlike the object expression in other contexts, *this is not
7476 required to be of complete type for purposes of class member
7477 access (5.2.5) outside the member function body. */
7480 && !(processing_template_decl
7481 && current_class_type
7482 && (same_type_ignoring_top_level_qualifiers_p
7484 {
7490 }
7493 {
7494 /* Let the name lookup machinery know that we are processing a
7495 class member access expression. */
7497 /* If something went wrong, we want to be able to discern that case,
7498 as opposed to the case where there was no SCOPE due to the type
7499 of expression being dependent. */
7502 /* If the SCOPE was erroneous, make the various semantic analysis
7503 functions exit quickly -- and without issuing additional error
7504 messages. */
7507 }
7508 }
7511 /* Tell cp_parser_lookup_name that there was an object, even though it's
7512 type-dependent. */
7515 /* Assume this expression is not a pseudo-destructor access. */
7518 /* If the SCOPE is a scalar type, then, if this is a valid program,
7519 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7520 is type dependent, it can be pseudo-destructor-name or something else.
7521 Try to parse it as pseudo-destructor-name first. */
7523 {
7524 tree s;
7525 tree type;
7528 /* Parse the pseudo-destructor-name. */
7537 {
7539 postfix_expression
7542 }
7543 }
7546 {
7547 /* If the SCOPE is not a scalar type, we are looking at an
7548 ordinary class member access expression, rather than a
7549 pseudo-destructor-name. */
7552 /* Parse the id-expression. */
7553 name = (cp_parser_id_expression
7560 /* In general, build a SCOPE_REF if the member name is qualified.
7561 However, if the name was not dependent and has already been
7562 resolved; there is no need to build the SCOPE_REF. For example;
7564 struct X { void f(); };
7565 template <typename T> void f(T* t) { t->X::f(); }
7567 Even though "t" is dependent, "X::f" is not and has been resolved
7568 to a BASELINK; there is no need to include scope information. */
7570 /* But we do need to remember that there was an explicit scope for
7571 virtual function calls. */
7575 /* If the name is a template-id that names a type, we will get a
7576 TYPE_DECL here. That is invalid code. */
7578 {
7581 }
7582 else
7583 {
7585 {
7587 {
7591 }
7592 else
7595 name,
7596 template_p);
7600 }
7602 adjust_result_of_qualified_name_lookup
7604 postfix_expression
7606 template_p,
7607 tf_warning_or_error);
7608 /* Build a location e.g.:
7609 ptr->access_expr
7610 ~~~^~~~~~~~~~~~~
7611 where the caret is at the deref token, ranging from
7612 the start of postfix_expression to the end of the access expr. */
7613 location_t end_loc
7615 location_t combined_loc
7618 }
7619 }
7621 /* We no longer need to look up names in the scope of the object on
7622 the left-hand side of the `.' or `->' operator. */
7625 /* Outside of offsetof, these operators may not appear in
7626 constant-expressions. */
7628 && (cp_parser_non_integral_constant_expression
7633 }
7635 /* Parse a parenthesized expression-list.
7637 expression-list:
7638 assignment-expression
7639 expression-list, assignment-expression
7641 attribute-list:
7642 expression-list
7643 identifier
7644 identifier, expression-list
7646 CAST_P is true if this expression is the target of a cast.
7648 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7649 argument pack.
7651 WRAP_LOCATIONS_P is true if expressions within this list for which
7652 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7653 their source locations.
7655 Returns a vector of trees. Each element is a representation of an
7656 assignment-expression. NULL is returned if the ( and or ) are
7657 missing. An empty, but allocated, vector is returned on no
7658 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7659 if we are parsing an attribute list for an attribute that wants a
7660 plain identifier argument, normal_attr for an attribute that wants
7661 an expression, or non_attr if we aren't parsing an attribute list. If
7662 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7663 not all of the expressions in the list were constant.
7664 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7665 will be written to with the location of the closing parenthesis. If
7666 an error occurs, it may or may not be written to. */
7676 {
7682 /* Assume all the expressions will be constant. */
7686 matching_parens parens;
7692 /* Within a parenthesized expression, a `>' token is always
7693 the greater-than operator. */
7694 saved_greater_than_is_operator_p
7700 /* Consume expressions until there are no more. */
7703 {
7704 /* At the beginning of attribute lists, check to see if the
7705 next token is an identifier. */
7708 {
7711 /* Consume the identifier. */
7713 /* Save the identifier. */
7715 }
7716 else
7717 {
7720 /* Parse the next assignment-expression. */
7722 {
7723 /* A braced-init-list. */
7729 }
7731 {
7732 expr = (cp_parser_constant_expression
7737 }
7738 else
7740 cast_p);
7745 /* If we have an ellipsis, then this is an expression
7746 expansion. */
7749 {
7750 /* Consume the `...'. */
7753 /* Build the argument pack. */
7755 }
7760 /* Add it to the list. We add error_mark_node
7761 expressions to the list, so that we can still tell if
7762 the correct form for a parenthesized expression-list
7763 is found. That gives better errors. */
7768 }
7770 /* After the first item, attribute lists look the same as
7771 expression lists. */
7774 get_comma:;
7775 /* If the next token isn't a `,', then we are done. */
7779 /* Otherwise, consume the `,' and keep going. */
7781 }
7787 {
7790 skip_comma:;
7791 /* We try and resync to an unnested comma, as that will give the
7792 user better diagnostics. */
7800 {
7801 parser->greater_than_is_operator_p
7804 }
7805 }
7807 parser->greater_than_is_operator_p
7814 }
7816 /* Parse a pseudo-destructor-name.
7818 pseudo-destructor-name:
7819 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7820 :: [opt] nested-name-specifier template template-id :: ~ type-name
7821 :: [opt] nested-name-specifier [opt] ~ type-name
7823 If either of the first two productions is used, sets *SCOPE to the
7824 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7825 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7826 or ERROR_MARK_NODE if the parse fails. */
7828 static void
7830 tree object,
7833 {
7836 /* Handle ~auto. */
7840 {
7843 "%<~auto%> only available with "
7850 }
7852 /* Assume that things will not work out. */
7855 /* Look for the optional `::' operator. */
7857 /* Look for the optional nested-name-specifier. */
7858 nested_name_specifier_p
7865 /* Now, if we saw a nested-name-specifier, we might be doing the
7866 second production. */
7869 {
7870 /* Consume the `template' keyword. */
7872 /* Parse the template-id. */
7876 class_type,
7878 /* Look for the `::' token. */
7880 }
7881 /* If the next token is not a `~', then there might be some
7882 additional qualification. */
7884 {
7885 /* At this point, we're looking for "type-name :: ~". The type-name
7886 must not be a class-name, since this is a pseudo-destructor. So,
7887 it must be either an enum-name, or a typedef-name -- both of which
7888 are just identifiers. So, we peek ahead to check that the "::"
7889 and "~" tokens are present; if they are not, then we can avoid
7890 calling type_name. */
7894 {
7897 }
7899 /* Look for the type-name. */
7904 /* Look for the `::' token. */
7906 }
7907 else
7910 /* Look for the `~'. */
7913 /* Once we see the ~, this has to be a pseudo-destructor. */
7917 /* Look for the type-name again. We are not responsible for
7918 checking that it matches the first type-name. */
7920 }
7922 /* Parse a unary-expression.
7924 unary-expression:
7925 postfix-expression
7926 ++ cast-expression
7927 -- cast-expression
7928 unary-operator cast-expression
7929 sizeof unary-expression
7930 sizeof ( type-id )
7931 alignof ( type-id ) [C++0x]
7932 new-expression
7933 delete-expression
7935 GNU Extensions:
7937 unary-expression:
7938 __extension__ cast-expression
7939 __alignof__ unary-expression
7940 __alignof__ ( type-id )
7941 alignof unary-expression [C++0x]
7942 __real__ cast-expression
7943 __imag__ cast-expression
7944 && identifier
7945 sizeof ( type-id ) { initializer-list , [opt] }
7946 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7947 __alignof__ ( type-id ) { initializer-list , [opt] }
7949 ADDRESS_P is true iff the unary-expression is appearing as the
7950 operand of the `&' operator. CAST_P is true if this expression is
7951 the target of a cast.
7953 Returns a representation of the expression. */
7955 static cp_expr
7958 {
7962 /* Peek at the next token. */
7964 /* Some keywords give away the kind of expression. */
7966 {
7970 {
7973 {
7981 /* Consume the token. */
7983 /* Parse the operand. */
7989 else
7990 {
7991 /* ISO C++ defines alignof only with types, not with
7992 expressions. So pedwarn if alignof is used with a non-
7993 type expression. However, __alignof__ is ok. */
7996 "ISO C++ does not allow %<alignof%> "
8000 }
8001 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8002 SIZEOF_EXPR with the original operand. */
8004 {
8006 {
8008 {
8011 error_mark_node));
8013 }
8014 else
8018 }
8019 }
8021 /* Construct a location e.g. :
8022 alignof (expr)
8023 ^~~~~~~~~~~~~~
8024 with start == caret at the start of the "alignof"/"sizeof"
8025 token, with the endpoint at the final closing paren. */
8026 location_t finish_loc
8028 location_t compound_loc
8035 }
8044 {
8045 /* The saved value of the PEDANTIC flag. */
8047 tree expr;
8049 /* Save away the PEDANTIC flag. */
8051 /* Parse the cast-expression. */
8053 /* Restore the PEDANTIC flag. */
8057 }
8061 {
8062 tree expression;
8064 /* Consume the `__real__' or `__imag__' token. */
8066 /* Parse the cast-expression. */
8068 /* Create the complete representation. */
8072 expression,
8073 tf_warning_or_error);
8074 }
8082 {
8083 tree expr;
8092 matching_parens parens;
8096 parser->type_definition_forbidden_message
8099 saved_integral_constant_expression_p
8101 saved_non_integral_constant_expression_p
8105 saved_greater_than_is_operator_p
8117 parser->greater_than_is_operator_p
8120 parser->integral_constant_expression_p
8122 parser->non_integral_constant_expression_p
8127 location_t finish_loc
8131 /* Construct a location of the form:
8132 noexcept (expr)
8133 ^~~~~~~~~~~~~~~
8134 with start == caret, finishing at the close-paren. */
8135 location_t noexcept_loc
8139 noexcept_loc);
8140 }
8144 }
8145 }
8147 /* Look for the `:: new' and `:: delete', which also signal the
8148 beginning of a new-expression, or delete-expression,
8149 respectively. If the next token is `::', then it might be one of
8150 these. */
8152 {
8155 /* See if the token after the `::' is one of the keywords in
8156 which we're interested. */
8158 /* If it's `new', we have a new-expression. */
8161 /* Similarly, for `delete'. */
8164 }
8166 /* Look for a unary operator. */
8168 /* The `++' and `--' operators can be handled similarly, even though
8169 they are not technically unary-operators in the grammar. */
8171 {
8176 /* Handle the GNU address-of-label extension. */
8179 {
8180 tree identifier;
8181 tree expression;
8184 /* Consume the '&&' token. */
8186 /* Look for the identifier. */
8187 location_t finish_loc
8190 /* Construct a location of the form:
8191 &&label
8192 ^~~~~~~
8193 with caret==start at the "&&", finish at the end of the label. */
8194 location_t combined_loc
8196 /* Create an expression representing the address. */
8199 NIC_ADDR_LABEL))
8202 }
8203 }
8205 {
8206 cp_expr cast_expression;
8212 /* Consume the operator token. */
8216 /* Parse the cast-expression. */
8217 cast_expression
8222 pidk);
8224 /* Make a location:
8225 OP_TOKEN CAST_EXPRESSION
8226 ^~~~~~~~~~~~~~~~~~~~~~~~~
8227 with start==caret at the operator token, and
8228 extending to the end of the cast_expression. */
8231 /* Now, build an appropriate representation. */
8233 {
8237 RO_UNARY_STAR,
8238 complain);
8239 /* TODO: build_x_indirect_ref does not always honor the
8240 location, so ensure it is set. */
8246 /* Fall through. */
8249 cast_expression,
8250 complain);
8251 /* TODO: build_x_unary_op does not always honor the location,
8252 so ensure it is set. */
8260 /* Fall through. */
8262 /* Immediately fold negation of a constant, unless the constant is 0
8263 (since -0 == 0) or it would overflow. */
8268 {
8271 cast_expression);
8273 {
8276 }
8277 }
8278 /* Fall through. */
8287 }
8291 non_constant_p))
8295 }
8299 decltype_p,
8300 pidk);
8301 }
8303 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8304 unary-operator, the corresponding tree code is returned. */
8306 static enum tree_code
8308 {
8310 {
8331 }
8332 }
8334 /* Parse a new-expression.
8336 new-expression:
8337 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8338 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8340 Returns a representation of the expression. */
8342 static tree
8344 {
8347 tree type;
8350 tree ret;
8354 /* Look for the optional `::' operator. */
8355 global_scope_p
8359 /* Look for the `new' operator. */
8361 /* There's no easy way to tell a new-placement from the
8362 `( type-id )' construct. */
8364 /* Look for a new-placement. */
8366 /* If that didn't work out, there's no new-placement. */
8368 {
8372 }
8374 /* If the next token is a `(', then we have a parenthesized
8375 type-id. */
8377 {
8381 /* Consume the `('. */
8382 matching_parens parens;
8385 /* Parse the type-id. */
8386 parser->type_definition_forbidden_message
8388 {
8391 }
8394 /* Look for the closing `)'. */
8397 /* There should not be a direct-new-declarator in this production,
8398 but GCC used to allowed this, so we check and emit a sensible error
8399 message for this case. */
8401 {
8407 }
8408 }
8409 /* Otherwise, there must be a new-type-id. */
8410 else
8413 /* If the next token is a `(' or '{', then we have a new-initializer. */
8418 else
8421 /* A new-expression may not appear in an integral constant
8422 expression. */
8425 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8426 of a new-type-id or type-id of a new-expression, the new-expression shall
8427 contain a new-initializer of the form ( assignment-expression )".
8428 Additionally, consistently with the spirit of DR 1467, we want to accept
8429 'new auto { 2 }' too. */
8435 {
8437 "initialization of new-expression for type %<auto%> "
8440 }
8441 else
8442 {
8443 /* Construct a location e.g.:
8444 ptr = new int[100]
8445 ^~~~~~~~~~~~
8446 with caret == start at the start of the "new" token, and the end
8447 at the end of the final token we consumed. */
8452 /* Create a representation of the new-expression. */
8454 tf_warning_or_error);
8456 }
8464 }
8466 /* Parse a new-placement.
8468 new-placement:
8469 ( expression-list )
8471 Returns the same representation as for an expression-list. */
8475 {
8478 /* Parse the expression-list. */
8479 expression_list = (cp_parser_parenthesized_expression_list
8488 }
8490 /* Parse a new-type-id.
8492 new-type-id:
8493 type-specifier-seq new-declarator [opt]
8495 Returns the TYPE allocated. If the new-type-id indicates an array
8496 type, *NELTS is set to the number of elements in the last array
8497 bound; the TYPE will not include the last array bound. */
8499 static tree
8501 {
8502 cp_decl_specifier_seq type_specifier_seq;
8508 /* The type-specifier sequence must not contain type definitions.
8509 (It cannot contain declarations of new types either, but if they
8510 are not definitions we will catch that because they are not
8511 complete.) */
8513 parser->type_definition_forbidden_message
8515 /* Parse the type-specifier-seq. */
8519 /* Restore the old message. */
8525 /* Parse the new-declarator. */
8528 /* Determine the number of elements in the last array dimension, if
8529 any. */
8531 /* Skip down to the last array dimension. */
8536 {
8539 }
8544 {
8547 }
8550 {
8557 else
8559 }
8562 }
8564 /* Parse an (optional) new-declarator.
8566 new-declarator:
8567 ptr-operator new-declarator [opt]
8568 direct-new-declarator
8570 Returns the declarator. */
8574 {
8577 cp_cv_quals cv_quals;
8579 /* We don't know if there's a ptr-operator next, or not. */
8581 /* Look for a ptr-operator. */
8583 /* If that worked, look for more new-declarators. */
8585 {
8588 /* Parse another optional declarator. */
8591 declarator = cp_parser_make_indirect_declarator
8595 }
8597 /* If the next token is a `[', there is a direct-new-declarator. */
8602 }
8604 /* Parse a direct-new-declarator.
8606 direct-new-declarator:
8607 [ expression ]
8608 direct-new-declarator [constant-expression]
8610 */
8614 {
8618 {
8619 tree expression;
8622 /* Look for the opening `['. */
8627 /* The standard requires that the expression have integral
8628 type. DR 74 adds enumeration types. We believe that the
8629 real intent is that these expressions be handled like the
8630 expression in a `switch' condition, which also allows
8631 classes with a single conversion to integral or
8632 enumeration type. */
8634 {
8635 expression
8637 expression,
8640 {
8642 "expression in new-declarator must have integral "
8645 }
8646 }
8648 /* Look for the closing `]'. */
8651 /* Add this bound to the declarator. */
8654 /* If the next token is not a `[', then there are no more
8655 bounds. */
8658 }
8661 }
8663 /* Parse a new-initializer.
8665 new-initializer:
8666 ( expression-list [opt] )
8667 braced-init-list
8669 Returns a representation of the expression-list. */
8673 {
8677 {
8678 tree t;
8685 }
8686 else
8687 expression_list = (cp_parser_parenthesized_expression_list
8693 }
8695 /* Parse a delete-expression.
8697 delete-expression:
8698 :: [opt] delete cast-expression
8699 :: [opt] delete [ ] cast-expression
8701 Returns a representation of the expression. */
8703 static tree
8705 {
8708 tree expression;
8710 /* Look for the optional `::' operator. */
8711 global_scope_p
8715 /* Look for the `delete' keyword. */
8717 /* See if the array syntax is in use. */
8719 {
8720 /* Consume the `[' token. */
8722 /* Look for the `]' token. */
8724 /* Remember that this is the `[]' construct. */
8726 }
8727 else
8730 /* Parse the cast-expression. */
8733 /* A delete-expression may not appear in an integral constant
8734 expression. */
8739 tf_warning_or_error);
8740 }
8742 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8743 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8744 0 otherwise. */
8746 static int
8748 {
8751 {
8793 /* In ((type ()) () the last () isn't a valid cast-expression,
8794 so the whole must be parsed as postfix-expression. */
8799 /* '[' may start a primary-expression in obj-c++ and in C++11,
8800 as a lambda-expression, eg, '(void)[]{}'. */
8807 /* '++' and '--' may or may not start a cast-expression:
8809 struct T { void operator++(int); };
8810 void f() { (T())++; }
8812 vs
8814 int a;
8815 (int)++a; */
8820 }
8821 }
8823 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8824 in the order: const_cast, static_cast, reinterpret_cast.
8826 Don't suggest dynamic_cast.
8828 Return the first legal cast kind found, or NULL otherwise. */
8832 {
8833 tree trial;
8835 /* Reuse the parser logic by attempting to build the various kinds of
8836 cast, with "complain" disabled.
8837 Identify the first such cast that is valid. */
8839 /* Don't attempt to run such logic within template processing. */
8843 /* First try const_cast. */
8848 /* If that fails, try static_cast. */
8853 /* Finally, try reinterpret_cast. */
8858 /* No such cast possible. */
8860 }
8862 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8863 suggesting how to convert a C-style cast of the form:
8865 (DST_TYPE)ORIG_EXPR
8867 to a C++-style cast.
8869 The primary range of RICHLOC is asssumed to be that of the original
8870 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8871 of the parens in the C-style cast. */
8873 static void
8876 tree dst_type)
8877 {
8878 /* This function is non-trivial, so bail out now if the warning isn't
8879 going to be emitted. */
8883 /* Try to find a legal C++ cast, trying them in order:
8884 const_cast, static_cast, reinterpret_cast. */
8889 /* Replace the open paren with "CAST_SUGGESTION<". */
8890 pretty_printer pp;
8894 /* Replace the close paren with "> (". */
8897 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8899 }
8902 /* Parse a cast-expression.
8904 cast-expression:
8905 unary-expression
8906 ( type-id ) cast-expression
8908 ADDRESS_P is true iff the unary-expression is appearing as the
8909 operand of the `&' operator. CAST_P is true if this expression is
8910 the target of a cast.
8912 Returns a representation of the expression. */
8914 static cp_expr
8917 {
8918 /* If it's a `(', then we might be looking at a cast. */
8920 {
8926 /* There's no way to know yet whether or not this is a cast.
8927 For example, `(int (3))' is a unary-expression, while `(int)
8928 3' is a cast. So, we resort to parsing tentatively. */
8930 /* Types may not be defined in a cast. */
8932 parser->type_definition_forbidden_message
8934 /* Consume the `('. */
8935 matching_parens parens;
8940 /* A very tricky bit is that `(struct S) { 3 }' is a
8941 compound-literal (which we permit in C++ as an extension).
8942 But, that construct is not a cast-expression -- it is a
8943 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8944 is legal; if the compound-literal were a cast-expression,
8945 you'd need an extra set of parentheses.) But, if we parse
8946 the type-id, and it happens to be a class-specifier, then we
8947 will commit to the parse at that point, because we cannot
8948 undo the action that is done when creating a new class. So,
8949 then we cannot back up and do a postfix-expression.
8951 Another tricky case is the following (c++/29234):
8953 struct S { void operator () (); };
8955 void foo ()
8956 {
8957 ( S()() );
8958 }
8960 As a type-id we parse the parenthesized S()() as a function
8961 returning a function, groktypename complains and we cannot
8962 back up in this case either.
8964 Therefore, we scan ahead to the closing `)', and check to see
8965 if the tokens after the `)' can start a cast-expression. Otherwise
8966 we are dealing with an unary-expression, a postfix-expression
8967 or something else.
8969 Yet another tricky case, in C++11, is the following (c++/54891):
8971 (void)[]{};
8973 The issue is that usually, besides the case of lambda-expressions,
8974 the parenthesized type-id cannot be followed by '[', and, eg, we
8975 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8976 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8977 we don't commit, we try a cast-expression, then an unary-expression.
8979 Save tokens so that we can put them back. */
8982 /* We may be looking at a cast-expression. */
8985 cast_expression
8988 /* Roll back the tokens we skipped. */
8990 /* If we aren't looking at a cast-expression, simulate an error so
8991 that the call to cp_parser_error_occurred below returns true. */
8994 else
8995 {
8998 /* Look for the type-id. */
9000 /* Look for the closing `)'. */
9005 }
9007 /* Restore the saved message. */
9010 /* At this point this can only be either a cast or a
9011 parenthesized ctor such as `(T ())' that looks like a cast to
9012 function returning T. */
9014 {
9015 /* Only commit if the cast-expression doesn't start with
9016 '++', '--', or '[' in C++11. */
9024 pidk);
9027 {
9028 /* Warn about old-style casts, if so requested. */
9033 {
9039 }
9041 /* Only type conversions to integral or enumeration types
9042 can be used in constant-expressions. */
9045 NIC_CAST))
9048 /* Perform the cast. */
9049 /* Make a location:
9050 (TYPE) EXPR
9051 ^~~~~~~~~~~
9052 with start==caret at the open paren, extending to the
9053 end of "expr". */
9055 open_paren_loc,
9059 }
9060 }
9061 else
9063 }
9065 /* If we get here, then it's not a cast, so it must be a
9066 unary-expression. */
9069 }
9071 /* Parse a binary expression of the general form:
9073 pm-expression:
9074 cast-expression
9075 pm-expression .* cast-expression
9076 pm-expression ->* cast-expression
9078 multiplicative-expression:
9079 pm-expression
9080 multiplicative-expression * pm-expression
9081 multiplicative-expression / pm-expression
9082 multiplicative-expression % pm-expression
9084 additive-expression:
9085 multiplicative-expression
9086 additive-expression + multiplicative-expression
9087 additive-expression - multiplicative-expression
9089 shift-expression:
9090 additive-expression
9091 shift-expression << additive-expression
9092 shift-expression >> additive-expression
9094 relational-expression:
9095 shift-expression
9096 relational-expression < shift-expression
9097 relational-expression > shift-expression
9098 relational-expression <= shift-expression
9099 relational-expression >= shift-expression
9101 GNU Extension:
9103 relational-expression:
9104 relational-expression <? shift-expression
9105 relational-expression >? shift-expression
9107 equality-expression:
9108 relational-expression
9109 equality-expression == relational-expression
9110 equality-expression != relational-expression
9112 and-expression:
9113 equality-expression
9114 and-expression & equality-expression
9116 exclusive-or-expression:
9117 and-expression
9118 exclusive-or-expression ^ and-expression
9120 inclusive-or-expression:
9121 exclusive-or-expression
9122 inclusive-or-expression | exclusive-or-expression
9124 logical-and-expression:
9125 inclusive-or-expression
9126 logical-and-expression && inclusive-or-expression
9128 logical-or-expression:
9129 logical-and-expression
9130 logical-or-expression || logical-and-expression
9132 All these are implemented with a single function like:
9134 binary-expression:
9135 simple-cast-expression
9136 binary-expression <token> binary-expression
9138 CAST_P is true if this expression is the target of a cast.
9140 The binops_by_token map is used to get the tree codes for each <token> type.
9141 binary-expressions are associated according to a precedence table. */
9143 #define TOKEN_PRECEDENCE(token) \
9144 (((token->type == CPP_GREATER \
9145 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9146 && !parser->greater_than_is_operator_p) \
9147 ? PREC_NOT_OPERATOR \
9148 : binops_by_token[token->type].prec)
9150 static cp_expr
9156 {
9157 cp_parser_expression_stack stack;
9159 cp_parser_expression_stack_entry current;
9160 cp_expr rhs;
9164 tree overload;
9166 /* Parse the first expression. */
9177 {
9178 /* Get an operator token. */
9184 {
9186 "%<>>%> operator is treated"
9190 }
9195 /* This is a fold-expression; handle it later. */
9198 /* Popping an entry off the stack means we completed a subexpression:
9199 - either we found a token which is not an operator (`>' where it is not
9200 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9201 will happen repeatedly;
9202 - or, we found an operator which has lower priority. This is the case
9203 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9204 parsing `3 * 4'. */
9206 {
9209 else
9211 }
9213 get_rhs:
9217 /* We used the operator token. */
9220 /* For "false && x" or "true || x", x will never be executed;
9221 disable warnings while evaluating it. */
9223 c_inhibit_evaluation_warnings +=
9226 c_inhibit_evaluation_warnings +=
9229 /* Extract another operand. It may be the RHS of this expression
9230 or the LHS of a new, higher priority expression. */
9235 /* Get another operator token. Look up its precedence to avoid
9236 building a useless (immediately popped) stack entry for common
9237 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9244 {
9245 /* ... and prepare to parse the RHS of the new, higher priority
9246 expression. Since precedence levels on the stack are
9247 monotonically increasing, we do not have to care about
9248 stack overflows. */
9257 pop:
9259 /* If the stack is not empty, we have parsed into LHS the right side
9260 (`4' in the example above) of an expression we had suspended.
9261 We can use the information on the stack to recover the LHS (`3')
9262 from the stack together with the tree code (`MULT_EXPR'), and
9263 the precedence of the higher level subexpression
9264 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9265 which will be used to actually build the additive expression. */
9270 }
9272 /* Undo the disabling of warnings done above. */
9274 c_inhibit_evaluation_warnings -=
9277 c_inhibit_evaluation_warnings -=
9283 /* Avoid warning for !!x == y. */
9288 /* Avoid warning for !b == y where b is boolean. */
9292 /* Avoid warning for !!b == y where b is boolean. */
9305 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9306 ERROR_MARK for everything that is not a binary expression.
9307 This makes warn_about_parentheses miss some warnings that
9308 involve unary operators. For unary expressions we should
9309 pass the correct tree_code unless the unary expression was
9310 surrounded by parentheses.
9311 */
9315 {
9318 else
9319 {
9320 current.lhs
9323 == tcc_comparison
9327 }
9328 }
9329 else
9330 {
9335 /* TODO: build_x_binary_op doesn't always honor the location. */
9337 }
9340 /* If the binary operator required the use of an overloaded operator,
9341 then this expression cannot be an integral constant-expression.
9342 An overloaded operator can be used even if both operands are
9343 otherwise permissible in an integral constant-expression if at
9344 least one of the operands is of enumeration type. */
9348 NIC_OVERLOADED))
9350 }
9353 }
9355 static cp_expr
9360 {
9363 }
9365 /* Parse the `? expression : assignment-expression' part of a
9366 conditional-expression. The LOGICAL_OR_EXPR is the
9367 logical-or-expression that started the conditional-expression.
9368 Returns a representation of the entire conditional-expression.
9370 This routine is used by cp_parser_assignment_expression.
9372 ? expression : assignment-expression
9374 GNU Extensions:
9376 ? : assignment-expression */
9378 static tree
9380 {
9382 cp_expr assignment_expr;
9386 /* Consume the `?' token. */
9391 {
9394 /* Implicit true clause. */
9396 c_inhibit_evaluation_warnings +=
9399 }
9400 else
9401 {
9404 /* Parse the expression. */
9405 c_inhibit_evaluation_warnings +=
9408 c_inhibit_evaluation_warnings +=
9412 }
9414 /* The next token should be a `:'. */
9416 /* Parse the assignment-expression. */
9418 c_inhibit_evaluation_warnings -=
9421 /* Make a location:
9422 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9423 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9424 with the caret at the "?", ranging from the start of
9425 the logical_or_expr to the end of the assignment_expr. */
9430 /* Build the conditional-expression. */
9432 expr,
9433 assignment_expr,
9434 tf_warning_or_error);
9435 }
9437 /* Parse an assignment-expression.
9439 assignment-expression:
9440 conditional-expression
9441 logical-or-expression assignment-operator assignment_expression
9442 throw-expression
9444 CAST_P is true if this expression is the target of a cast.
9445 DECLTYPE_P is true if this expression is the operand of decltype.
9447 Returns a representation for the expression. */
9449 static cp_expr
9452 {
9453 cp_expr expr;
9455 /* If the next token is the `throw' keyword, then we're looking at
9456 a throw-expression. */
9459 /* Otherwise, it must be that we are looking at a
9460 logical-or-expression. */
9461 else
9462 {
9463 /* Parse the binary expressions (logical-or-expression). */
9465 decltype_p,
9467 /* If the next token is a `?' then we're actually looking at a
9468 conditional-expression. */
9471 else
9472 {
9475 /* If it's an assignment-operator, we're using the second
9476 production. */
9477 enum tree_code assignment_operator
9480 {
9483 /* Parse the right-hand side of the assignment. */
9490 /* An assignment may not appear in a
9491 constant-expression. */
9493 NIC_ASSIGNMENT))
9495 /* Build the assignment expression. Its default
9496 location:
9497 LHS = RHS
9498 ~~~~^~~~~
9499 is the location of the '=' token as the
9500 caret, ranging from the start of the lhs to the
9501 end of the rhs. */
9506 assignment_operator,
9507 rhs,
9509 /* TODO: build_x_modify_expr doesn't honor the location,
9510 so we must set it here. */
9512 }
9513 }
9514 }
9517 }
9519 /* Parse an (optional) assignment-operator.
9521 assignment-operator: one of
9522 = *= /= %= += -= >>= <<= &= ^= |=
9524 GNU Extension:
9526 assignment-operator: one of
9527 <?= >?=
9529 If the next token is an assignment operator, the corresponding tree
9530 code is returned, and the token is consumed. For example, for
9531 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9532 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9533 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9534 operator, ERROR_MARK is returned. */
9536 static enum tree_code
9538 {
9542 /* Peek at the next token. */
9546 {
9592 /* Nothing else is an assignment operator. */
9594 }
9596 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9601 /* If it was an assignment operator, consume it. */
9606 }
9608 /* Parse an expression.
9610 expression:
9611 assignment-expression
9612 expression , assignment-expression
9614 CAST_P is true if this expression is the target of a cast.
9615 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9616 except possibly parenthesized or on the RHS of a comma (N3276).
9618 Returns a representation of the expression. */
9620 static cp_expr
9623 {
9628 {
9629 cp_expr assignment_expression;
9631 /* Parse the next assignment-expression. */
9632 assignment_expression
9635 /* We don't create a temporary for a call that is the immediate operand
9636 of decltype or on the RHS of a comma. But when we see a comma, we
9637 need to create a temporary for a call on the LHS. */
9642 assignment_expression
9646 /* If this is the first assignment-expression, we can just
9647 save it away. */
9650 else
9651 {
9652 /* Create a location with caret at the comma, ranging
9653 from the start of the LHS to the end of the RHS. */
9658 assignment_expression,
9661 }
9662 /* If the next token is not a comma, or we're in a fold-expression, then
9663 we are done with the expression. */
9667 /* Consume the `,'. */
9670 /* A comma operator cannot appear in a constant-expression. */
9673 }
9676 }
9678 /* Parse a constant-expression.
9680 constant-expression:
9681 conditional-expression
9683 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9684 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9685 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9686 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9687 only parse a conditional-expression, otherwise parse an
9688 assignment-expression. See below for rationale. */
9690 static cp_expr
9695 {
9699 cp_expr expression;
9701 /* It might seem that we could simply parse the
9702 conditional-expression, and then check to see if it were
9703 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9704 one that the compiler can figure out is constant, possibly after
9705 doing some simplifications or optimizations. The standard has a
9706 precise definition of constant-expression, and we must honor
9707 that, even though it is somewhat more restrictive.
9709 For example:
9711 int i[(2, 3)];
9713 is not a legal declaration, because `(2, 3)' is not a
9714 constant-expression. The `,' operator is forbidden in a
9715 constant-expression. However, GCC's constant-folding machinery
9716 will fold this operation to an INTEGER_CST for `3'. */
9718 /* Save the old settings. */
9720 saved_allow_non_integral_constant_expression_p
9723 /* We are now parsing a constant-expression. */
9725 parser->allow_non_integral_constant_expression_p
9728 /* Although the grammar says "conditional-expression", when not STRICT_P,
9729 we parse an "assignment-expression", which also permits
9730 "throw-expression" and the use of assignment operators. In the case
9731 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9732 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9733 actually essential that we look for an assignment-expression.
9734 For example, cp_parser_initializer_clauses uses this function to
9735 determine whether a particular assignment-expression is in fact
9736 constant. */
9738 {
9739 /* Parse the binary expressions (logical-or-expression). */
9742 /* If the next token is a `?' then we're actually looking at
9743 a conditional-expression; otherwise we're done. */
9746 }
9747 else
9749 /* Restore the old settings. */
9750 parser->integral_constant_expression_p
9752 parser->allow_non_integral_constant_expression_p
9755 {
9756 /* Require an rvalue constant expression here; that's what our
9757 callers expect. Reference constant expressions are handled
9758 separately in e.g. cp_parser_template_argument. */
9767 }
9770 parser->non_integral_constant_expression_p
9774 }
9776 /* Parse __builtin_offsetof.
9778 offsetof-expression:
9779 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9781 offsetof-member-designator:
9782 id-expression
9783 | offsetof-member-designator "." id-expression
9784 | offsetof-member-designator "[" expression "]"
9785 | offsetof-member-designator "->" id-expression */
9787 static cp_expr
9789 {
9791 tree type;
9792 cp_expr expr;
9793 cp_id_kind dummy;
9795 location_t finish_loc;
9797 /* We're about to accept non-integral-constant things, but will
9798 definitely yield an integral constant expression. Save and
9799 restore these values around our local parsing. */
9805 /* Consume the "__builtin_offsetof" token. */
9807 /* Consume the opening `('. */
9808 matching_parens parens;
9810 /* Parse the type-id. */
9812 {
9814 parser->type_definition_forbidden_message
9818 }
9819 /* Look for the `,'. */
9823 /* Build the (type *)null that begins the traditional offsetof macro. */
9824 tree object_ptr
9826 tf_warning_or_error);
9828 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9832 {
9835 {
9837 /* offsetof-member-designator "[" expression "]" */
9843 /* offsetof-member-designator "->" identifier */
9846 /* FALLTHRU */
9849 /* offsetof-member-designator "." identifier */
9857 /* Consume the ")" token. */
9863 /* Error. We know the following require will fail, but
9864 that gives the proper error message. */
9869 }
9870 }
9872 success:
9873 /* Make a location of the form:
9874 __builtin_offsetof (struct s, f)
9875 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9876 with caret at the type-id, ranging from the start of the
9877 "_builtin_offsetof" token to the close paren. */
9879 /* The result will be an INTEGER_CST, so we need to explicitly
9880 preserve the location. */
9883 failure:
9889 }
9891 /* Parse a trait expression.
9893 Returns a representation of the expression, the underlying type
9894 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9896 static cp_expr
9898 {
9899 cp_trait_kind kind;
9905 {
10007 }
10009 /* Get location of initial token. */
10012 /* Consume the token. */
10015 matching_parens parens;
10018 {
10021 }
10027 {
10030 {
10033 }
10037 }
10039 {
10041 {
10045 {
10048 }
10052 }
10053 }
10058 /* Construct a location of the form:
10059 __is_trivially_copyable(_Tp)
10060 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10061 with start == caret, finishing at the close-paren. */
10064 /* Complete the trait expression, which may mean either processing
10065 the trait expr now or saving it for template instantiation. */
10067 {
10076 }
10077 }
10079 /* Parse a lambda expression.
10081 lambda-expression:
10082 lambda-introducer lambda-declarator [opt] compound-statement
10084 Returns a representation of the expression. */
10086 static cp_expr
10088 {
10090 tree type;
10098 {
10100 {
10104 }
10106 }
10108 {
10110 {
10113 }
10115 }
10117 /* We may be in the middle of deferred access check. Disable
10118 it now. */
10129 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10132 /* Now that we've started the type, add the capture fields for any
10133 explicit captures. */
10136 {
10137 /* Inside the class, surrounding template-parameter-lists do not apply. */
10138 unsigned int saved_num_template_parameter_lists
10142 bool fully_implicit_function_template_p
10146 bool auto_is_implicit_function_template_parm_p
10157 /* By virtue of defining a local class, a lambda expression has access to
10158 the private variables of enclosing classes. */
10166 {
10171 }
10173 {
10176 }
10178 /* The capture list was built up in reverse order; fix that now. */
10190 parser->fully_implicit_function_template_p
10194 parser->auto_is_implicit_function_template_parm_p
10196 }
10198 /* This field is only used during parsing of the lambda. */
10201 /* This lambda shouldn't have any proxies left at this point. */
10203 /* And now that we're done, push proxies for an enclosing lambda. */
10208 else
10216 }
10218 /* Parse the beginning of a lambda expression.
10220 lambda-introducer:
10221 [ lambda-capture [opt] ]
10223 LAMBDA_EXPR is the current representation of the lambda expression. */
10225 static void
10227 {
10228 /* Need commas after the first capture. */
10231 /* Eat the leading `['. */
10234 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10242 {
10245 }
10248 {
10250 tree capture_id;
10251 tree capture_init_expr;
10255 enum capture_kind_type
10256 {
10257 BY_COPY,
10258 BY_REFERENCE
10259 };
10263 {
10266 }
10270 else
10273 /* Possibly capture `this'. */
10275 {
10286 explicit_init_p);
10288 }
10290 /* Possibly capture `*this'. */
10293 {
10304 explicit_init_p);
10306 }
10308 /* Remember whether we want to capture as a reference or not. */
10310 {
10313 }
10315 /* Get the identifier. */
10320 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10321 delimiters, but I modified this to stop on unnested ']' as well. It
10322 was already changed to stop on unnested '}', so the
10323 "closing_parenthesis" name is no more misleading with my change. */
10324 {
10330 }
10332 /* Find the initializer for this capture. */
10336 {
10338 /* An explicit initializer exists. */
10341 "lambda capture initializers "
10347 {
10350 }
10351 }
10352 else
10353 {
10356 /* Turn the identifier into an id-expression. */
10357 capture_init_expr
10362 {
10365 }
10368 {
10371 capture_init_expr);
10376 }
10379 {
10382 capture_init_expr))
10386 }
10388 capture_init_expr
10389 = finish_id_expression
10391 capture_init_expr,
10405 {
10408 }
10409 }
10413 {
10418 capture_id);
10422 "capture of %qD redundant with by-reference capture "
10424 }
10427 capture_id,
10428 capture_init_expr,
10430 explicit_init_p);
10432 /* If there is any qualification still in effect, clear it
10433 now; we will be starting fresh with the next capture. */
10437 }
10440 }
10442 /* Parse the (optional) middle of a lambda expression.
10444 lambda-declarator:
10445 < template-parameter-list [opt] >
10446 ( parameter-declaration-clause [opt] )
10447 attribute-specifier [opt]
10448 decl-specifier-seq [opt]
10449 exception-specification [opt]
10450 lambda-return-type-clause [opt]
10452 LAMBDA_EXPR is the current representation of the lambda expression. */
10454 static bool
10456 {
10457 /* 5.1.1.4 of the standard says:
10458 If a lambda-expression does not include a lambda-declarator, it is as if
10459 the lambda-declarator were ().
10460 This means an empty parameter list, no attributes, and no exception
10461 specification. */
10468 cp_decl_specifier_seq lambda_specs;
10471 /* The template-parameter-list is optional, but must begin with
10472 an opening angle if present. */
10474 {
10477 "lambda templates are only available with "
10481 "lambda templates are only available with "
10490 /* We just processed one more parameter list. */
10492 }
10494 /* The parameter-declaration-clause is optional (unless
10495 template-parameter-list was given), but must begin with an
10496 opening parenthesis if present. */
10498 {
10499 matching_parens parens;
10504 /* Parse parameters. */
10507 /* Default arguments shall not be specified in the
10508 parameter-declaration-clause of a lambda-declarator. */
10519 /* In the decl-specifier-seq of the lambda-declarator, each
10520 decl-specifier shall either be mutable or constexpr. */
10524 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10527 {
10532 }
10536 /* Parse optional exception specification. */
10539 /* Parse optional trailing return type. */
10541 {
10544 }
10546 /* The function parameters must be in scope all the way until after the
10547 trailing-return-type in case of decltype. */
10549 }
10553 /* Create the function call operator.
10555 Messing with declarators like this is no uglier than building up the
10556 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10557 other code. */
10558 {
10559 cp_decl_specifier_seq return_type_specs;
10561 tree fco;
10569 {
10573 else
10576 }
10585 VIRT_SPEC_UNSPECIFIED,
10586 REF_QUAL_NONE,
10587 tx_qual,
10588 exception_spec,
10596 declarator,
10597 attributes);
10599 {
10602 /* Give the object parameter a different name. */
10604 }
10606 {
10610 }
10619 }
10620 }
10622 /* Parse the body of a lambda expression, which is simply
10624 compound-statement
10626 but which requires special handling.
10627 LAMBDA_EXPR is the current representation of the lambda expression. */
10629 static void
10631 {
10638 else
10639 /* Still increment function_depth so that we don't GC in the
10640 middle of an expression. */
10645 /* Clear this in case we're in the middle of a default argument. */
10649 {
10653 matching_braces braces;
10656 {
10659 /* Originally C++11 required us to peek for 'return expr'; and
10660 process it specially here to deduce the return type. N3638
10661 removed the need for that. */
10669 }
10672 }
10679 else
10681 }
10683 /* Statements [gram.stmt.stmt] */
10685 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10687 static void
10689 {
10693 /* A concept is never expanded normally. */
10699 }
10701 /* Parse a statement.
10703 statement:
10704 labeled-statement
10705 expression-statement
10706 compound-statement
10707 selection-statement
10708 iteration-statement
10709 jump-statement
10710 declaration-statement
10711 try-block
10713 C++11:
10715 statement:
10716 labeled-statement
10717 attribute-specifier-seq (opt) expression-statement
10718 attribute-specifier-seq (opt) compound-statement
10719 attribute-specifier-seq (opt) selection-statement
10720 attribute-specifier-seq (opt) iteration-statement
10721 attribute-specifier-seq (opt) jump-statement
10722 declaration-statement
10723 attribute-specifier-seq (opt) try-block
10725 init-statement:
10726 expression-statement
10727 simple-declaration
10729 TM Extension:
10731 statement:
10732 atomic-statement
10734 IN_COMPOUND is true when the statement is nested inside a
10735 cp_parser_compound_statement; this matters for certain pragmas.
10737 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10738 is a (possibly labeled) if statement which is not enclosed in braces
10739 and has an else clause. This is used to implement -Wparentheses.
10741 CHAIN is a vector of if-else-if conditions. */
10743 static void
10747 {
10752 restart:
10755 /* There is no statement yet. */
10761 /* In obj-c++, seeing '[[' might be the either the beginning of
10762 c++11 attributes, or a nested objc-message-expression. So
10763 let's parse the c++11 attributes tentatively. */
10767 {
10770 }
10772 /* Peek at the next token. */
10774 /* Remember the location of the first token in the statement. */
10777 /* If this is a keyword, then that will often determine what kind of
10778 statement we have. */
10780 {
10784 {
10787 /* Looks like a labeled-statement with a case label.
10788 Parse the label, and then use tail recursion to parse
10789 the statement. */
10812 /* Objective-C++ exception-handling constructs. */
10826 /* This must be a namespace alias definition. */
10842 /* It might be a keyword like `int' that can start a
10843 declaration-statement. */
10845 }
10846 }
10848 {
10849 /* If the next token is a `:', then we are looking at a
10850 labeled-statement. */
10853 {
10854 /* Looks like a labeled-statement with an ordinary label.
10855 Parse the label, and then use tail recursion to parse
10856 the statement. */
10861 }
10862 }
10863 /* Anything that starts with a `{' must be a compound-statement. */
10866 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10867 a statement all its own. */
10869 {
10870 /* Only certain OpenMP pragmas are attached to statements, and thus
10871 are considered statements themselves. All others are not. In
10872 the context of a compound, accept the pragma as a "statement" and
10873 return so that we can check for a close brace. Otherwise we
10874 require a real statement and must go back and read one. */
10880 }
10882 {
10885 }
10887 /* Everything else must be a declaration-statement or an
10888 expression-statement. Try for the declaration-statement
10889 first, unless we are looking at a `;', in which case we know that
10890 we have an expression-statement. */
10892 {
10894 {
10896 {
10897 /* Attributes should be parsed as part of the the
10898 declaration, so let's un-parse them. */
10901 }
10904 /* Try to parse the declaration-statement. */
10906 /* If that worked, we're done. */
10909 }
10910 /* All preceding labels have been parsed at this point. */
10914 /* Look for an expression-statement instead. */
10917 /* Handle [[fallthrough]];. */
10919 {
10920 /* The next token after the fallthrough attribute is ';'. */
10922 {
10923 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10925 IFN_FALLTHROUGH,
10928 }
10929 else
10933 }
10934 }
10936 /* Set the line number for the statement. */
10940 /* Allow "[[fallthrough]];", but warn otherwise. */
10943 OPT_Wattributes,
10945 }
10947 /* Append ATTR to attribute list ATTRS. */
10949 static tree
10951 {
10957 }
10959 /* Parse the label for a labeled-statement, i.e.
10961 identifier :
10962 case constant-expression :
10963 default :
10965 GNU Extension:
10966 case constant-expression ... constant-expression : statement
10968 When a label is parsed without errors, the label is added to the
10969 parse tree by the finish_* functions, so this function doesn't
10970 have to return the label. */
10972 static void
10974 {
10979 /* The next token should be an identifier. */
10983 {
10986 }
10988 /* Remember whether this case or a user-defined label is allowed to fall
10989 through to. */
10994 {
10996 {
11000 /* Consume the `case' token. */
11002 /* Parse the constant-expression. */
11009 {
11010 /* Consume the `...' token. */
11016 /* We don't need to emit warnings here, as the common code
11017 will do this for us. */
11018 }
11019 else
11023 {
11027 }
11028 else
11031 expr);
11032 }
11036 /* Consume the `default' token. */
11040 {
11044 }
11045 else
11050 /* Anything else must be an ordinary label. */
11055 }
11057 /* Require the `:' token. */
11060 /* An ordinary label may optionally be followed by attributes.
11061 However, this is only permitted if the attributes are then
11062 followed by a semicolon. This is because, for backward
11063 compatibility, when parsing
11064 lab: __attribute__ ((unused)) int i;
11065 we want the attribute to attach to "i", not "lab". */
11068 {
11069 tree attrs;
11076 ;
11077 else
11079 }
11085 }
11087 /* Parse an expression-statement.
11089 expression-statement:
11090 expression [opt] ;
11092 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11093 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11094 indicates whether this expression-statement is part of an
11095 expression statement. */
11097 static tree
11099 {
11104 /* There might be attribute fallthrough. */
11107 /* If the next token is a ';', then there is no expression
11108 statement. */
11110 {
11114 {
11117 }
11118 }
11120 /* Handle [[fallthrough]];. */
11122 {
11123 /* The next token after the fallthrough attribute is ';'. */
11125 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11128 else
11132 }
11134 /* Allow "[[fallthrough]];", but warn otherwise. */
11139 /* Give a helpful message for "A<T>::type t;" and the like. */
11142 {
11149 {
11150 /* A::A a; */
11155 }
11156 }
11158 /* Consume the final `;'. */
11163 /* This is the final expression statement of a statement
11164 expression. */
11170 }
11172 /* Parse a compound-statement.
11174 compound-statement:
11175 { statement-seq [opt] }
11177 GNU extension:
11179 compound-statement:
11180 { label-declaration-seq [opt] statement-seq [opt] }
11182 label-declaration-seq:
11183 label-declaration
11184 label-declaration-seq label-declaration
11186 Returns a tree representing the statement. */
11188 static tree
11191 {
11192 tree compound_stmt;
11193 matching_braces braces;
11195 /* Consume the `{'. */
11202 /* Begin the compound-statement. */
11204 /* If the next keyword is `__label__' we have a label declaration. */
11207 /* Parse an (optional) statement-seq. */
11209 /* Finish the compound-statement. */
11211 /* Consume the `}'. */
11215 }
11217 /* Parse an (optional) statement-seq.
11219 statement-seq:
11220 statement
11221 statement-seq [opt] statement */
11223 static void
11225 {
11226 /* Scan statements until there aren't any more. */
11228 {
11231 /* If we are looking at a `}', then we have run out of
11232 statements; the same is true if we have reached the end
11233 of file, or have stumbled upon a stray '@end'. */
11240 /* If we are in a compound statement and find 'else' then
11241 something went wrong. */
11243 {
11246 else
11247 {
11250 }
11251 }
11253 /* Parse the statement. */
11255 }
11256 }
11258 /* Return true if we're looking at (init; cond), false otherwise. */
11260 static bool
11262 {
11263 /* Save tokens so that we can put them back. */
11266 /* Look for ';' that is not nested in () or {}. */
11269 CPP_SEMICOLON,
11272 /* Roll back the tokens we skipped. */
11276 }
11278 /* Parse a selection-statement.
11280 selection-statement:
11281 if ( init-statement [opt] condition ) statement
11282 if ( init-statement [opt] condition ) statement else statement
11283 switch ( init-statement [opt] condition ) statement
11285 Returns the new IF_STMT or SWITCH_STMT.
11287 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11288 is a (possibly labeled) if statement which is not enclosed in
11289 braces and has an else clause. This is used to implement
11290 -Wparentheses.
11292 CHAIN is a vector of if-else-if conditions. This is used to implement
11293 -Wduplicated-cond. */
11295 static tree
11298 {
11301 token_indent_info guard_tinfo;
11306 /* Peek at the next token. */
11310 /* See what kind of keyword it is. */
11313 {
11316 {
11317 tree statement;
11318 tree condition;
11323 RID_CONSTEXPR))
11324 {
11330 }
11332 /* Look for the `('. */
11333 matching_parens parens;
11335 {
11338 }
11340 /* Begin the selection-statement. */
11342 {
11345 }
11346 else
11349 /* Parse the optional init-statement. */
11351 {
11352 tree decl;
11355 "init-statement in selection statements only available "
11358 }
11360 /* Parse the condition. */
11362 /* Look for the `)'. */
11368 {
11372 /* Add the condition. */
11379 /* Parse the then-clause. */
11383 /* Outside a template, the non-selected branch of a constexpr
11384 if is a 'discarded statement', i.e. unevaluated. */
11389 {
11392 }
11395 guard_tinfo);
11402 {
11406 }
11408 /* If the next token is `else', parse the else-clause. */
11410 RID_ELSE))
11411 {
11415 {
11418 }
11420 guard_tinfo
11422 /* Consume the `else' keyword. */
11425 {
11427 RID_IF)
11429 {
11430 /* We've got "if (COND) else if (COND2)". Start
11431 the condition chain and add COND as the first
11432 element. */
11436 {
11437 /* Wrap it in a NOP_EXPR so that we can set the
11438 location of the condition. */
11440 condition);
11443 }
11444 }
11446 RID_IF))
11447 {
11448 /* This is if-else without subsequent if. Zap the
11449 condition chain; we would have already warned at
11450 this point. */
11453 }
11454 }
11456 /* Parse the else-clause. */
11462 /* If we are currently parsing a then-clause, then
11463 IF_P will not be NULL. We set it to true to
11464 indicate that this if statement has an else clause.
11465 This may trigger the Wparentheses warning below
11466 when we get back up to the parent if statement. */
11471 {
11475 }
11476 }
11477 else
11478 {
11479 /* This if statement does not have an else clause. If
11480 NESTED_IF is true, then the then-clause has an if
11481 statement which does have an else clause. We warn
11482 about the potential ambiguity. */
11485 "suggest explicit braces to avoid ambiguous"
11488 {
11489 /* We don't need the condition chain anymore. */
11492 }
11493 }
11495 /* Now we're all done with the if-statement. */
11497 }
11498 else
11499 {
11503 /* Add the condition. */
11506 /* Parse the body of the switch-statement. */
11512 guard_tinfo);
11516 /* Now we're all done with the switch-statement. */
11518 }
11521 }
11527 }
11528 }
11530 /* Parse a condition.
11532 condition:
11533 expression
11534 type-specifier-seq declarator = initializer-clause
11535 type-specifier-seq declarator braced-init-list
11537 GNU Extension:
11539 condition:
11540 type-specifier-seq declarator asm-specification [opt]
11541 attributes [opt] = assignment-expression
11543 Returns the expression that should be tested. */
11545 static tree
11547 {
11548 cp_decl_specifier_seq type_specifiers;
11552 /* Try the declaration first. */
11554 /* New types are not allowed in the type-specifier-seq for a
11555 condition. */
11557 parser->type_definition_forbidden_message
11559 /* Parse the type-specifier-seq. */
11561 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11564 /* Restore the saved message. */
11566 /* If all is well, we might be looking at a declaration. */
11568 {
11569 tree decl;
11570 tree asm_specification;
11571 tree attributes;
11575 /* Parse the declarator. */
11581 /* Parse the attributes. */
11583 /* Parse the asm-specification. */
11585 /* If the next token is not an `=' or '{', then we might still be
11586 looking at an expression. For example:
11588 if (A(a).x)
11590 looks like a decl-specifier-seq and a declarator -- but then
11591 there is no `=', so this is an expression. */
11596 /* If we did see an `=' or '{', then we are looking at a declaration
11597 for sure. */
11599 {
11600 tree pushed_scope;
11604 /* Create the declaration. */
11610 /* Parse the initializer. */
11612 {
11616 }
11617 else
11618 {
11619 /* Consume the `='. */
11622 }
11626 /* Process the initializer. */
11629 asm_specification,
11630 flags);
11636 }
11637 }
11638 /* If we didn't even get past the declarator successfully, we are
11639 definitely not looking at a declaration. */
11640 else
11643 /* Otherwise, we are looking at an expression. */
11645 }
11647 /* Parses a for-statement or range-for-statement until the closing ')',
11648 not included. */
11650 static tree
11652 {
11656 /* Begin the for-statement. */
11659 /* Parse the initialization. */
11664 else
11666 }
11668 static tree
11671 {
11672 /* Normal for loop */
11675 tree stmt;
11678 /* The init-statement has already been parsed in
11679 cp_parser_init_statement, so no work is needed here. */
11682 /* If there's a condition, process it. */
11686 {
11690 }
11692 {
11696 }
11698 /* Look for the `;'. */
11701 /* If there's an expression, process it. */
11707 }
11709 /* Tries to parse a range-based for-statement:
11711 range-based-for:
11712 decl-specifier-seq declarator : expression
11714 The decl-specifier-seq declarator and the `:' are already parsed by
11715 cp_parser_init_statement. If processing_template_decl it returns a
11716 newly created RANGE_FOR_STMT; if not, it is converted to a
11717 regular FOR_STMT. */
11719 static tree
11722 {
11729 /* Get the range declaration momentarily out of the way so that
11730 the range expression doesn't clash with it. */
11732 {
11734 {
11736 /* For decomposition declaration get all of the corresponding
11737 declarations out of the way. */
11741 {
11747 {
11753 }
11754 }
11755 }
11757 {
11762 }
11763 }
11766 {
11769 }
11770 else
11773 /* Put the range declaration(s) back into scope. */
11775 {
11779 }
11781 /* If in template, STMT is converted to a normal for-statement
11782 at instantiation. If not, it is done just ahead. */
11784 {
11794 /* do_auto_deduction doesn't mess with template init-lists. */
11797 }
11798 else
11799 {
11803 unroll);
11804 }
11806 }
11808 /* Subroutine of cp_convert_range_for: given the initializer expression,
11809 builds up the range temporary. */
11811 static tree
11813 {
11816 /* Find out the type deduced by the declaration
11817 `auto &&__range = range_expr'. */
11822 /* Create the __range variable. */
11829 }
11831 /* Used by cp_parser_range_for in template context: we aren't going to
11832 do a full conversion yet, but we still need to resolve auto in the
11833 type of the for-range-declaration if present. This is basically
11834 a shortcut version of cp_convert_range_for. */
11836 static void
11838 {
11841 {
11844 iter_type = (cp_parser_perform_range_for_lookup
11847 {
11849 iter_type);
11851 RO_UNARY_STAR,
11852 tf_warning_or_error);
11855 }
11856 }
11857 }
11859 /* Converts a range-based for-statement into a normal
11860 for-statement, as per the definition.
11862 for (RANGE_DECL : RANGE_EXPR)
11863 BLOCK
11865 should be equivalent to:
11867 {
11868 auto &&__range = RANGE_EXPR;
11869 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11870 __begin != __end;
11871 ++__begin)
11872 {
11873 RANGE_DECL = *__begin;
11874 BLOCK
11875 }
11876 }
11878 If RANGE_EXPR is an array:
11879 BEGIN_EXPR = __range
11880 END_EXPR = __range + ARRAY_SIZE(__range)
11881 Else if RANGE_EXPR has a member 'begin' or 'end':
11882 BEGIN_EXPR = __range.begin()
11883 END_EXPR = __range.end()
11884 Else:
11885 BEGIN_EXPR = begin(__range)
11886 END_EXPR = end(__range);
11888 If __range has a member 'begin' but not 'end', or vice versa, we must
11889 still use the second alternative (it will surely fail, however).
11890 When calling begin()/end() in the third alternative we must use
11891 argument dependent lookup, but always considering 'std' as an associated
11892 namespace. */
11894 tree
11898 {
11906 /* If an error happened previously do nothing or else a lot of
11907 unhelpful errors would be issued. */
11909 else
11910 {
11911 tree range_temp;
11915 /* Can't bind a reference to an array of runtime bound. */
11917 else
11918 {
11923 LOOKUP_ONLYCONVERTING);
11925 }
11928 }
11930 /* The new for initialization statement. */
11938 LOOKUP_ONLYCONVERTING);
11949 LOOKUP_ONLYCONVERTING);
11953 /* The new for condition. */
11960 /* The new increment expression. */
11963 tf_warning_or_error);
11969 /* The declaration is initialized with *__begin inside the loop body. */
11972 tf_warning_or_error),
11974 LOOKUP_ONLYCONVERTING);
11979 }
11981 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11982 We need to solve both at the same time because the method used
11983 depends on the existence of members begin or end.
11984 Returns the type deduced for the iterator expression. */
11986 static tree
11988 {
11990 {
11993 }
11996 {
12001 }
12003 {
12004 /* If RANGE is an array, we will use pointer arithmetic. */
12007 range,
12011 }
12012 else
12013 {
12014 /* If it is not an array, we must do a bit of magic. */
12024 tf_warning_or_error);
12027 tf_warning_or_error);
12030 {
12031 /* Use the member functions. */
12034 }
12035 else
12036 {
12037 /* Use global functions with ADL. */
12044 tf_warning_or_error);
12046 tf_warning_or_error);
12048 tf_warning_or_error);
12050 tf_warning_or_error);
12053 }
12055 /* Last common checks. */
12057 {
12058 /* If one of the expressions is an error do no more checks. */
12061 }
12064 /* Can happen, when, eg, in a template context, Koenig lookup
12065 can't resolve begin/end (c++/58503). */
12067 else
12068 {
12070 /* The unqualified type of the __begin and __end temporaries should
12071 be the same, as required by the multiple auto declaration. */
12073 {
12080 /* P0184R0 allows __begin and __end to have different types,
12081 but make sure they are comparable so we can give a better
12083 else
12087 }
12089 }
12090 }
12091 }
12093 /* Helper function for cp_parser_perform_range_for_lookup.
12094 Builds a tree for RANGE.IDENTIFIER(). */
12096 static tree
12098 {
12111 tf_warning_or_error);
12114 }
12116 /* Parse an iteration-statement.
12118 iteration-statement:
12119 while ( condition ) statement
12120 do statement while ( expression ) ;
12121 for ( init-statement condition [opt] ; expression [opt] )
12122 statement
12124 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12126 static tree
12129 {
12132 tree statement;
12134 token_indent_info guard_tinfo;
12136 /* Peek at the next token. */
12143 /* Remember whether or not we are already within an iteration
12144 statement. */
12147 /* See what kind of keyword it is. */
12150 {
12152 {
12153 tree condition;
12155 /* Begin the while-statement. */
12157 /* Look for the `('. */
12158 matching_parens parens;
12160 /* Parse the condition. */
12163 /* Look for the `)'. */
12165 /* Parse the dependent statement. */
12171 /* We're done with the while-statement. */
12173 }
12177 {
12178 tree expression;
12180 /* Begin the do-statement. */
12182 /* Parse the body of the do-statement. */
12189 /* Look for the `while' keyword. */
12191 /* Look for the `('. */
12192 matching_parens parens;
12194 /* Parse the expression. */
12196 /* We're done with the do-statement. */
12198 /* Look for the `)'. */
12200 /* Look for the `;'. */
12202 }
12206 {
12207 /* Look for the `('. */
12208 matching_parens parens;
12213 /* Look for the `)'. */
12216 /* Parse the body of the for-statement. */
12223 /* We're done with the for-statement. */
12225 }
12232 }
12235 }
12237 /* Parse a init-statement or the declarator of a range-based-for.
12238 Returns true if a range-based-for declaration is seen.
12240 init-statement:
12241 expression-statement
12242 simple-declaration */
12244 static bool
12246 {
12247 /* If the next token is a `;', then we have an empty
12248 expression-statement. Grammatically, this is also a
12249 simple-declaration, but an invalid one, because it does not
12250 declare anything. Therefore, if we did not handle this case
12251 specially, we would issue an error message about an invalid
12252 declaration. */
12254 {
12258 /* A colon is used in range-based for. */
12261 /* We're going to speculatively look for a declaration, falling back
12262 to an expression, if necessary. */
12264 /* Parse the declaration. */
12267 decl);
12270 {
12271 /* It is a range-for, consume the ':' */
12275 {
12277 "range-based %<for%> loops only available with "
12280 }
12281 }
12282 else
12283 /* The ';' is not consumed yet because we told
12284 cp_parser_simple_declaration not to. */
12289 /* If the tentative parse failed, then we shall need to look for an
12290 expression-statement. */
12291 }
12292 /* If we are here, it is an expression-statement. */
12295 }
12297 /* Parse a jump-statement.
12299 jump-statement:
12300 break ;
12301 continue ;
12302 return expression [opt] ;
12303 return braced-init-list ;
12304 goto identifier ;
12306 GNU extension:
12308 jump-statement:
12309 goto * expression ;
12311 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12313 static tree
12315 {
12321 /* Peek at the next token. */
12326 /* See what kind of keyword it is. */
12329 {
12333 {
12350 }
12356 {
12360 /* Fall through. */
12370 }
12375 {
12376 tree expr;
12380 {
12384 }
12387 else
12388 /* If the next token is a `;', then there is no
12389 expression. */
12391 /* Build the return-statement. */
12394 else
12396 /* Look for the final `;'. */
12398 }
12404 {
12407 }
12409 /* Create the goto-statement. */
12411 {
12412 /* Issue a warning about this use of a GNU extension. */
12414 /* Consume the '*' token. */
12416 /* Parse the dependent expression. */
12418 }
12419 else
12421 /* Look for the final `;'. */
12428 }
12431 }
12433 /* Parse a declaration-statement.
12435 declaration-statement:
12436 block-declaration */
12438 static void
12440 {
12443 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12446 /* Parse the block-declaration. */
12449 /* Free any declarators allocated. */
12451 }
12453 /* Some dependent statements (like `if (cond) statement'), are
12454 implicitly in their own scope. In other words, if the statement is
12455 a single statement (as opposed to a compound-statement), it is
12456 none-the-less treated as if it were enclosed in braces. Any
12457 declarations appearing in the dependent statement are out of scope
12458 after control passes that point. This function parses a statement,
12459 but ensures that is in its own scope, even if it is not a
12460 compound-statement.
12462 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12463 is a (possibly labeled) if statement which is not enclosed in
12464 braces and has an else clause. This is used to implement
12465 -Wparentheses.
12467 CHAIN is a vector of if-else-if conditions. This is used to implement
12468 -Wduplicated-cond.
12470 Returns the new statement. */
12472 static tree
12476 {
12477 tree statement;
12480 token_indent_info body_tinfo
12486 /* Mark if () ; with a special NOP_EXPR. */
12488 {
12499 }
12500 /* if a compound is opened, we simply parse the statement directly. */
12503 /* If the token is not a `{', then we must take special action. */
12504 else
12505 {
12506 /* Create a compound-statement. */
12508 /* Parse the dependent-statement. */
12511 /* Finish the dummy compound-statement. */
12513 }
12515 token_indent_info next_tinfo
12524 /* Return the statement. */
12526 }
12528 /* For some dependent statements (like `while (cond) statement'), we
12529 have already created a scope. Therefore, even if the dependent
12530 statement is a compound-statement, we do not want to create another
12531 scope. */
12533 static void
12536 {
12537 /* If the token is a `{', then we must take special action. */
12539 {
12540 token_indent_info body_tinfo
12546 token_indent_info next_tinfo
12555 }
12556 else
12557 {
12558 /* Avoid calling cp_parser_compound_statement, so that we
12559 don't create a new scope. Do everything else by hand. */
12560 matching_braces braces;
12562 /* If the next keyword is `__label__' we have a label declaration. */
12565 /* Parse an (optional) statement-seq. */
12568 }
12569 }
12571 /* Declarations [gram.dcl.dcl] */
12573 /* Parse an optional declaration-sequence.
12575 declaration-seq:
12576 declaration
12577 declaration-seq declaration */
12579 static void
12581 {
12583 {
12594 {
12595 /* A declaration consisting of a single semicolon is
12596 invalid. Allow it unless we're being pedantic. */
12601 }
12603 /* If we're entering or exiting a region that's implicitly
12604 extern "C", modify the lang context appropriately. */
12606 {
12609 }
12611 {
12614 }
12617 {
12618 /* A top-level declaration can consist solely of a #pragma.
12619 A nested declaration cannot, so this is done here and not
12620 in cp_parser_declaration. (A #pragma at block scope is
12621 handled in cp_parser_statement.) */
12624 }
12626 /* Parse the declaration itself. */
12628 }
12629 }
12631 /* Parse a declaration.
12633 declaration:
12634 block-declaration
12635 function-definition
12636 template-declaration
12637 explicit-instantiation
12638 explicit-specialization
12639 linkage-specification
12640 namespace-definition
12642 C++17:
12643 deduction-guide
12645 GNU extension:
12647 declaration:
12648 __extension__ declaration */
12650 static void
12652 {
12653 cp_token token1;
12654 cp_token token2;
12659 /* Check for the `__extension__' keyword. */
12661 {
12662 /* Parse the qualified declaration. */
12664 /* Restore the PEDANTIC flag. */
12668 }
12670 /* Try to figure out what kind of declaration is present. */
12675 else
12676 {
12679 }
12681 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12684 /* If the next token is `extern' and the following token is a string
12685 literal, then we have a linkage specification. */
12689 /* If the next token is `template', then we have either a template
12690 declaration, an explicit instantiation, or an explicit
12691 specialization. */
12693 {
12694 /* `template <>' indicates a template specialization. */
12698 /* `template <' indicates a template declaration. */
12701 /* Anything else must be an explicit instantiation. */
12702 else
12704 }
12705 /* If the next token is `export', then we have a template
12706 declaration. */
12709 /* If the next token is `extern', 'static' or 'inline' and the one
12710 after that is `template', we have a GNU extended explicit
12711 instantiation directive. */
12718 /* If the next token is `namespace', check for a named or unnamed
12719 namespace definition. */
12728 /* An unnamed namespace definition. */
12732 /* An inline (associated) namespace definition. */
12736 /* Objective-C++ declaration/definition. */
12743 /* At this point we may have a template declared by a concept
12744 introduction. */
12749 else
12750 /* Try to parse a block-declaration, or a function-definition. */
12753 /* Free any declarators allocated. */
12755 }
12757 /* Parse a block-declaration.
12759 block-declaration:
12760 simple-declaration
12761 asm-definition
12762 namespace-alias-definition
12763 using-declaration
12764 using-directive
12766 GNU Extension:
12768 block-declaration:
12769 __extension__ block-declaration
12771 C++0x Extension:
12773 block-declaration:
12774 static_assert-declaration
12776 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12777 part of a declaration-statement. */
12779 static void
12782 {
12786 /* Check for the `__extension__' keyword. */
12788 {
12789 /* Parse the qualified declaration. */
12791 /* Restore the PEDANTIC flag. */
12795 }
12797 /* Peek at the next token to figure out which kind of declaration is
12798 present. */
12801 /* If the next keyword is `asm', we have an asm-definition. */
12803 {
12807 }
12808 /* If the next keyword is `namespace', we have a
12809 namespace-alias-definition. */
12812 /* If the next keyword is `using', we have a
12813 using-declaration, a using-directive, or an alias-declaration. */
12815 {
12820 /* If the token after `using' is `namespace', then we have a
12821 using-directive. */
12825 /* If the second token after 'using' is '=', then we have an
12826 alias-declaration. */
12832 /* Otherwise, it's a using-declaration. */
12833 else
12836 }
12837 /* If the next keyword is `__label__' we have a misplaced label
12838 declaration. */
12840 {
12844 /* If the next token is now a `;', consume it. */
12847 }
12848 /* If the next token is `static_assert' we have a static assertion. */
12851 /* Anything else must be a simple-declaration. */
12852 else
12855 }
12857 /* Parse a simple-declaration.
12859 simple-declaration:
12860 decl-specifier-seq [opt] init-declarator-list [opt] ;
12861 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12862 brace-or-equal-initializer ;
12864 init-declarator-list:
12865 init-declarator
12866 init-declarator-list , init-declarator
12868 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12869 function-definition as a simple-declaration.
12871 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12872 parsed declaration if it is an uninitialized single declarator not followed
12873 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12874 if present, will not be consumed. */
12876 static void
12880 {
12881 cp_decl_specifier_seq decl_specifiers;
12890 /* Defer access checks until we know what is being declared; the
12891 checks for names appearing in the decl-specifier-seq should be
12892 done as if we were in the scope of the thing being declared. */
12895 /* Parse the decl-specifier-seq. We have to keep track of whether
12896 or not the decl-specifier-seq declares a named class or
12897 enumeration type, since that is the only case in which the
12898 init-declarator-list is allowed to be empty.
12900 [dcl.dcl]
12902 In a simple-declaration, the optional init-declarator-list can be
12903 omitted only when declaring a class or enumeration, that is when
12904 the decl-specifier-seq contains either a class-specifier, an
12905 elaborated-type-specifier, or an enum-specifier. */
12907 CP_PARSER_FLAGS_OPTIONAL,
12910 /* We no longer need to defer access checks. */
12913 /* In a block scope, a valid declaration must always have a
12914 decl-specifier-seq. By not trying to parse declarators, we can
12915 resolve the declaration/expression ambiguity more quickly. */
12918 {
12921 }
12923 /* If the next two tokens are both identifiers, the code is
12924 erroneous. The usual cause of this situation is code like:
12926 T t;
12928 where "T" should name a type -- but does not. */
12931 {
12932 /* If parsing tentatively, we should commit; we really are
12933 looking at a declaration. */
12935 /* Give up. */
12937 }
12939 /* If we have seen at least one decl-specifier, and the next token
12940 is not a parenthesis, then we must be looking at a declaration.
12941 (After "int (" we might be looking at a functional cast.) */
12948 /* Look for C++17 decomposition declaration. */
12956 {
12957 tree decl
12959 maybe_range_for_decl,
12962 /* The next token should be either a `,' or a `;'. */
12964 /* If it's a `;', we are done. */
12968 {
12972 }
12973 /* Anything else is an error. */
12974 else
12975 {
12976 /* If we have already issued an error message we don't need
12977 to issue another one. */
12982 /* Skip tokens until we reach the end of the statement. */
12984 /* If the next token is now a `;', consume it. */
12988 }
12989 }
12990 else
12993 tree last_type;
12995 /* NULL_TREE if both variable and function declaration are allowed,
12996 error_mark_node if function declaration are not allowed and
12997 a FUNCTION_DECL that should be diagnosed if it is followed by
12998 variable declarations. */
12999 tree auto_function_declaration;
13002 auto_specifier_p
13006 /* Keep going until we hit the `;' at the end of the simple
13007 declaration. */
13010 CPP_SEMICOLON))
13011 {
13014 tree decl;
13018 {
13019 /* If we are processing next declarator, comma is expected */
13024 {
13028 }
13029 }
13030 else
13033 /* Parse the init-declarator. */
13036 function_definition_allowed_p,
13038 declares_class_or_enum,
13040 maybe_range_for_decl,
13043 /* If an error occurred while parsing tentatively, exit quickly.
13044 (That usually happens when in the body of a function; each
13045 statement is treated as a declaration-statement until proven
13046 otherwise.) */
13051 {
13052 /* If the init-declarator-list contains more than one
13053 init-declarator, they shall all form declarations of
13054 variables. */
13056 auto_function_declaration
13060 {
13062 "non-variable %qD in declaration with more than one "
13067 }
13068 }
13072 {
13076 {
13077 /* If the list of declarators contains more than one declarator,
13078 the type of each declared variable is determined as described
13079 above. If the type deduced for the template parameter U is not
13080 the same in each deduction, the program is ill-formed. */
13085 }
13086 else
13088 }
13090 /* Handle function definitions specially. */
13092 {
13093 /* If the next token is a `,', then we are probably
13094 processing something like:
13096 void f() {}, *p;
13098 which is erroneous. */
13100 {
13103 "mixing"
13105 }
13106 /* Otherwise, we're done with the list of declarators. */
13107 else
13108 {
13111 }
13112 }
13115 /* The next token should be either a `,' or a `;'. */
13117 /* If it's a `,', there are more declarators to come. */
13120 /* If it's a `;', we are done. */
13124 {
13129 }
13130 /* Anything else is an error. */
13131 else
13132 {
13133 /* If we have already issued an error message we don't need
13134 to issue another one. */
13139 /* Skip tokens until we reach the end of the statement. */
13141 /* If the next token is now a `;', consume it. */
13145 }
13146 /* After the first time around, a function-definition is not
13147 allowed -- even if it was OK at first. For example:
13149 int i, f() {}
13151 is not valid. */
13153 }
13155 /* Issue an error message if no declarators are present, and the
13156 decl-specifier-seq does not itself declare a class or
13157 enumeration: [dcl.dcl]/3. */
13159 {
13161 {
13165 /* Ensure an error is issued anyway when finish_decltype_type,
13166 called via cp_parser_decl_specifier_seq, returns a class or
13167 an enumeration (c++/51786). */
13170 }
13171 /* Perform any deferred access checks. */
13173 }
13175 /* Consume the `;'. */
13176 finish:
13180 {
13186 }
13188 done:
13190 }
13192 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13193 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13194 initializer ; */
13196 static tree
13201 {
13206 /* Parse the identifier-list. */
13210 {
13218 }
13222 {
13228 else
13229 {
13232 }
13233 }
13239 tree pushed_scope;
13246 NULL_TREE);
13253 cp_expr e;
13254 cp_decl_specifier_seq decl_specs;
13259 {
13262 else
13265 tree elt_pushed_scope;
13271 {
13272 /* Ensure we've diagnosed redeclaration if we aren't creating
13273 a new VAR_DECL. */
13276 }
13277 else
13281 }
13284 {
13287 }
13291 {
13299 || (is_direct_init
13302 {
13306 }
13309 {
13314 }
13315 }
13317 {
13319 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13320 the underlying DECL. */
13322 }
13328 {
13331 }
13334 }
13336 /* Parse a decl-specifier-seq.
13338 decl-specifier-seq:
13339 decl-specifier-seq [opt] decl-specifier
13340 decl-specifier attribute-specifier-seq [opt] (C++11)
13342 decl-specifier:
13343 storage-class-specifier
13344 type-specifier
13345 function-specifier
13346 friend
13347 typedef
13349 GNU Extension:
13351 decl-specifier:
13352 attributes
13354 Concepts Extension:
13356 decl-specifier:
13357 concept
13359 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13361 The parser flags FLAGS is used to control type-specifier parsing.
13363 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13364 flags:
13366 1: one of the decl-specifiers is an elaborated-type-specifier
13367 (i.e., a type declaration)
13368 2: one of the decl-specifiers is an enum-specifier or a
13369 class-specifier (i.e., a type definition)
13371 */
13373 static void
13375 cp_parser_flags flags,
13378 {
13382 cp_decl_spec ds;
13384 /* Clear DECL_SPECS. */
13387 /* Assume no class or enumeration type is declared. */
13390 /* Keep reading specifiers until there are no more to read. */
13392 {
13397 /* Peek at the next token. */
13400 /* Save the first token of the decl spec list for error
13401 reporting. */
13404 /* Handle attributes. */
13406 {
13407 /* Parse the attributes. */
13410 /* In a sequence of declaration specifiers, c++11 attributes
13411 appertain to the type that precede them. In that case
13412 [dcl.spec]/1 says:
13414 The attribute-specifier-seq affects the type only for
13415 the declaration it appears in, not other declarations
13416 involving the same type.
13418 But for now let's force the user to position the
13419 attribute either at the beginning of the declaration or
13420 after the declarator-id, which would clearly mean that it
13421 applies to the declarator. */
13423 {
13425 /* The c++11 attribute is at the beginning of the
13426 declaration. It appertains to the entity being
13428 else
13429 {
13431 {
13432 /* This is an attribute following a
13433 class-specifier. */
13438 }
13439 else
13440 {
13441 decl_specs->std_attributes
13445 }
13447 }
13448 }
13450 decl_specs->attributes
13455 }
13456 /* Assume we will find a decl-specifier keyword. */
13458 /* If the next token is an appropriate keyword, we can simply
13459 add it to the list. */
13461 {
13462 /* decl-specifier:
13463 friend
13464 constexpr */
13467 {
13472 }
13473 else
13474 {
13476 /* Consume the token. */
13478 }
13491 /* function-specifier:
13492 inline
13493 virtual
13494 explicit */
13501 /* decl-specifier:
13502 typedef */
13505 /* Consume the token. */
13507 /* A constructor declarator cannot appear in a typedef. */
13509 /* The "typedef" keyword can only occur in a declaration; we
13510 may as well commit at this point. */
13517 /* storage-class-specifier:
13518 auto
13519 register
13520 static
13521 extern
13522 mutable
13524 GNU Extension:
13525 thread */
13528 {
13529 /* Consume the token. */
13532 /* Complain about `auto' as a storage specifier, if
13533 we're complaining about C++0x compatibility. */
13537 "%<auto%> changes meaning in C++11; "
13540 /* Set the storage class anyway. */
13542 token);
13543 }
13544 else
13545 /* C++0x auto type-specifier. */
13553 /* Consume the token. */
13556 token);
13559 /* Consume the token. */
13565 /* We did not yet find a decl-specifier yet. */
13568 }
13585 /* Constructors are a special case. The `S' in `S()' is not a
13586 decl-specifier; it is the beginning of the declarator. */
13587 constructor_p
13588 = (!found_decl_spec
13589 && constructor_possible_p
13590 && (cp_parser_constructor_declarator_p
13593 /* If we don't have a DECL_SPEC yet, then we must be looking at
13594 a type-specifier. */
13596 {
13599 tree type_spec;
13601 type_spec
13603 decl_specs,
13609 /* If this type-specifier referenced a user-defined type
13610 (a typedef, class-name, etc.), then we can't allow any
13611 more such type-specifiers henceforth.
13613 [dcl.spec]
13615 The longest sequence of decl-specifiers that could
13616 possibly be a type name is taken as the
13617 decl-specifier-seq of a declaration. The sequence shall
13618 be self-consistent as described below.
13620 [dcl.type]
13622 As a general rule, at most one type-specifier is allowed
13623 in the complete decl-specifier-seq of a declaration. The
13624 only exceptions are the following:
13626 -- const or volatile can be combined with any other
13627 type-specifier.
13629 -- signed or unsigned can be combined with char, long,
13630 short, or int.
13632 -- ..
13634 Example:
13636 typedef char* Pc;
13637 void g (const int Pc);
13639 Here, Pc is *not* part of the decl-specifier seq; it's
13640 the declarator. Therefore, once we see a type-specifier
13641 (other than a cv-qualifier), we forbid any additional
13642 user-defined types. We *do* still allow things like `int
13643 int' to be considered a decl-specifier-seq, and issue the
13644 error message later. */
13647 /* A constructor declarator cannot follow a type-specifier. */
13649 {
13654 }
13655 }
13657 /* If we still do not have a DECL_SPEC, then there are no more
13658 decl-specifiers. */
13663 /* After we see one decl-specifier, further decl-specifiers are
13664 always optional. */
13666 }
13668 /* Don't allow a friend specifier with a class definition. */
13673 }
13675 /* Parse an (optional) storage-class-specifier.
13677 storage-class-specifier:
13678 auto
13679 register
13680 static
13681 extern
13682 mutable
13684 GNU Extension:
13686 storage-class-specifier:
13687 thread
13689 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13691 static tree
13693 {
13695 {
13699 /* Fall through for C++98. */
13707 /* Consume the token. */
13712 }
13713 }
13715 /* Parse an (optional) function-specifier.
13717 function-specifier:
13718 inline
13719 virtual
13720 explicit
13722 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13723 Updates DECL_SPECS, if it is non-NULL. */
13725 static tree
13728 {
13731 {
13737 /* 14.5.2.3 [temp.mem]
13739 A member function template shall not be virtual. */
13743 else
13753 }
13755 /* Consume the token. */
13757 }
13759 /* Parse a linkage-specification.
13761 linkage-specification:
13762 extern string-literal { declaration-seq [opt] }
13763 extern string-literal declaration */
13765 static void
13767 {
13768 tree linkage;
13770 /* Look for the `extern' keyword. */
13771 cp_token *extern_token
13774 /* Look for the string-literal. */
13778 /* Transform the literal into an identifier. If the literal is a
13779 wide-character string, or contains embedded NULs, then we can't
13780 handle it as the user wants. */
13783 {
13785 /* Assume C++ linkage. */
13787 }
13788 else
13791 /* We're now using the new linkage. */
13794 /* Preserve the location of the the innermost linkage specification,
13795 tracking the locations of nested specifications via a local. */
13796 location_t saved_location
13798 /* Construct a location ranging from the start of the "extern" to
13799 the end of the string-literal, with the caret at the start, e.g.:
13800 extern "C" {
13801 ^~~~~~~~~~
13802 */
13803 parser->innermost_linkage_specification_location
13808 /* If the next token is a `{', then we're using the first
13809 production. */
13811 {
13815 /* Consume the `{' token. */
13816 matching_braces braces;
13818 /* Parse the declarations. */
13820 /* Look for the closing `}'. */
13822 }
13823 /* Otherwise, there's just one declaration. */
13824 else
13825 {
13828 saved_in_unbraced_linkage_specification_p
13832 parser->in_unbraced_linkage_specification_p
13834 }
13836 /* We're done with the linkage-specification. */
13839 /* Restore location of parent linkage specification, if any. */
13841 }
13843 /* Parse a static_assert-declaration.
13845 static_assert-declaration:
13846 static_assert ( constant-expression , string-literal ) ;
13847 static_assert ( constant-expression ) ; (C++17)
13849 If MEMBER_P, this static_assert is a class member. */
13851 static void
13853 {
13854 cp_expr condition;
13855 location_t token_loc;
13856 tree message;
13859 /* Peek at the `static_assert' token so we can keep track of exactly
13860 where the static assertion started. */
13863 /* Look for the `static_assert' keyword. */
13865 RT_STATIC_ASSERT))
13868 /* We know we are in a static assertion; commit to any tentative
13869 parse. */
13873 /* Parse the `(' starting the static assertion condition. */
13874 matching_parens parens;
13877 /* Parse the constant-expression. Allow a non-constant expression
13878 here in order to give better diagnostics in finish_static_assert. */
13879 condition =
13885 {
13888 "static_assert without a message "
13890 /* Eat the ')' */
13895 }
13896 else
13897 {
13898 /* Parse the separating `,'. */
13901 /* Parse the string-literal message. */
13906 /* A `)' completes the static assertion. */
13912 }
13914 /* A semicolon terminates the declaration. */
13917 /* Get the location for the static assertion. Use that of the
13918 condition if available, otherwise, use that of the "static_assert"
13919 token. */
13924 /* Complete the static assertion, which may mean either processing
13925 the static assert now or saving it for template instantiation. */
13927 }
13929 /* Parse the expression in decltype ( expression ). */
13931 static tree
13934 {
13936 tree expr;
13938 /* Since we're going to preserve any side-effects from this parse, set up a
13939 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13940 in the expression. */
13943 /* First, try parsing an id-expression. */
13954 {
13957 cp_id_kind idk;
13961 /* Lookup the name we got back from the id-expression. */
13966 /* A template without args is not a complete id-expression. */
13975 {
13976 /* Complete lookup of the id-expression. */
13977 expr = (finish_id_expression
13990 /* We found an id-expression, but it was something that we
13991 should not have found. This is an error, not something
13992 we can recover from, so note that we found an
13993 id-expression and we'll recover as gracefully as
13994 possible. */
13996 }
14001 /* We have an id-expression. */
14003 }
14006 {
14007 /* Abort the id-expression parse. */
14010 /* Parsing tentatively, again. */
14013 /* Parse a class member access. */
14021 /* We have an id-expression. */
14023 }
14026 /* We have parsed the complete id-expression or member access. */
14028 else
14029 {
14030 /* Abort our attempt to parse an id-expression or member access
14031 expression. */
14034 /* Commit to the tentative_firewall so we get syntax errors. */
14037 /* Parse a full expression. */
14040 }
14043 }
14045 /* Parse a `decltype' type. Returns the type.
14047 simple-type-specifier:
14048 decltype ( expression )
14049 C++14 proposal:
14050 decltype ( auto ) */
14052 static tree
14054 {
14059 {
14060 /* Already parsed. */
14063 }
14065 /* Look for the `decltype' token. */
14069 /* Parse the opening `('. */
14070 matching_parens parens;
14080 /* decltype (auto) */
14082 else
14083 {
14084 /* decltype (expression) */
14086 /* Types cannot be defined in a `decltype' expression. Save away the
14087 old message and set the new one. */
14089 parser->type_definition_forbidden_message
14092 /* The restrictions on constant-expressions do not apply inside
14093 decltype expressions. */
14094 bool saved_integral_constant_expression_p
14096 bool saved_non_integral_constant_expression_p
14100 /* Within a parenthesized expression, a `>' token is always
14101 the greater-than operator. */
14102 bool saved_greater_than_is_operator_p
14106 /* Do not actually evaluate the expression. */
14109 /* Do not warn about problems with the expression. */
14114 /* Go back to evaluating expressions. */
14118 /* The `>' token might be the end of a template-id or
14119 template-parameter-list now. */
14120 parser->greater_than_is_operator_p
14123 /* Restore the old message and the integral constant expression
14124 flags. */
14126 parser->integral_constant_expression_p
14128 parser->non_integral_constant_expression_p
14130 }
14132 /* Parse to the closing `)'. */
14134 {
14139 }
14142 {
14143 /* Build auto. */
14146 }
14147 else
14149 tf_warning_or_error);
14151 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14152 it again. */
14163 }
14165 /* Special member functions [gram.special] */
14167 /* Parse a conversion-function-id.
14169 conversion-function-id:
14170 operator conversion-type-id
14172 Returns an IDENTIFIER_NODE representing the operator. */
14174 static tree
14176 {
14177 tree type;
14178 tree saved_scope;
14179 tree saved_qualifying_scope;
14180 tree saved_object_scope;
14183 /* Look for the `operator' token. */
14186 /* When we parse the conversion-type-id, the current scope will be
14187 reset. However, we need that information in able to look up the
14188 conversion function later, so we save it here. */
14192 /* We must enter the scope of the class so that the names of
14193 entities declared within the class are available in the
14194 conversion-type-id. For example, consider:
14196 struct S {
14197 typedef int I;
14198 operator I();
14199 };
14201 S::operator I() { ... }
14203 In order to see that `I' is a type-name in the definition, we
14204 must be in the scope of `S'. */
14207 /* Parse the conversion-type-id. */
14209 /* Leave the scope of the class, if any. */
14212 /* Restore the saved scope. */
14216 /* If the TYPE is invalid, indicate failure. */
14220 }
14222 /* Parse a conversion-type-id:
14224 conversion-type-id:
14225 type-specifier-seq conversion-declarator [opt]
14227 Returns the TYPE specified. */
14229 static tree
14231 {
14232 tree attributes;
14233 cp_decl_specifier_seq type_specifiers;
14235 tree type_specified;
14238 /* Parse the attributes. */
14242 parser->type_definition_forbidden_message
14245 /* Parse the type-specifiers. */
14252 /* If that didn't work, stop. */
14255 /* Parse the conversion-declarator. */
14263 /* Don't give this error when parsing tentatively. This happens to
14264 work because we always parse this definitively once. */
14267 {
14269 {
14272 }
14276 }
14279 }
14281 /* Parse an (optional) conversion-declarator.
14283 conversion-declarator:
14284 ptr-operator conversion-declarator [opt]
14286 */
14290 {
14293 cp_cv_quals cv_quals;
14295 /* We don't know if there's a ptr-operator next, or not. */
14297 /* Try the ptr-operator. */
14300 /* If it worked, look for more conversion-declarators. */
14302 {
14305 /* Parse another optional declarator. */
14308 declarator = cp_parser_make_indirect_declarator
14312 }
14315 }
14317 /* Parse an (optional) ctor-initializer.
14319 ctor-initializer:
14320 : mem-initializer-list */
14322 static void
14324 {
14325 /* If the next token is not a `:', then there is no
14326 ctor-initializer. */
14328 {
14329 /* Do default initialization of any bases and members. */
14333 }
14335 /* Consume the `:' token. */
14337 /* And the mem-initializer-list. */
14339 }
14341 /* Parse a mem-initializer-list.
14343 mem-initializer-list:
14344 mem-initializer ... [opt]
14345 mem-initializer ... [opt] , mem-initializer-list */
14347 static void
14349 {
14354 /* Let the semantic analysis code know that we are starting the
14355 mem-initializer-list. */
14360 /* Loop through the list. */
14362 {
14363 tree mem_initializer;
14366 /* Parse the mem-initializer. */
14368 /* If the next token is a `...', we're expanding member initializers. */
14374 {
14375 /* Consume the `...'. */
14379 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14380 can be expanded but members cannot. */
14383 {
14388 }
14390 /* Construct the pack expansion type. */
14393 }
14396 {
14400 }
14401 /* Look for a target constructor. */
14405 {
14408 {
14412 }
14414 }
14415 /* Add it to the list, unless it was erroneous. */
14417 {
14420 }
14421 /* If the next token is not a `,', we're done. */
14424 /* Consume the `,' token. */
14426 }
14428 /* Perform semantic analysis. */
14431 }
14433 /* Parse a mem-initializer.
14435 mem-initializer:
14436 mem-initializer-id ( expression-list [opt] )
14437 mem-initializer-id braced-init-list
14439 GNU extension:
14441 mem-initializer:
14442 ( expression-list [opt] )
14444 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14445 class) or FIELD_DECL (for a non-static data member) to initialize;
14446 the TREE_VALUE is the expression-list. An empty initialization
14447 list is represented by void_list_node. */
14449 static tree
14451 {
14452 tree mem_initializer_id;
14453 tree expression_list;
14454 tree member;
14457 /* Find out what is being initialized. */
14459 {
14463 }
14464 else
14465 {
14469 }
14475 {
14482 }
14483 else
14484 {
14494 }
14504 }
14506 /* Parse a mem-initializer-id.
14508 mem-initializer-id:
14509 :: [opt] nested-name-specifier [opt] class-name
14510 decltype-specifier (C++11)
14511 identifier
14513 Returns a TYPE indicating the class to be initialized for the first
14514 production (and the second in C++11). Returns an IDENTIFIER_NODE
14515 indicating the data member to be initialized for the last production. */
14517 static tree
14519 {
14523 tree id;
14527 /* `typename' is not allowed in this context ([temp.res]). */
14529 {
14531 "keyword %<typename%> not allowed in this context (a qualified "
14534 }
14535 /* Look for the optional `::' operator. */
14536 global_scope_p
14540 /* Look for the optional nested-name-specifier. The simplest way to
14541 implement:
14543 [temp.res]
14545 The keyword `typename' is not permitted in a base-specifier or
14546 mem-initializer; in these contexts a qualified name that
14547 depends on a template-parameter is implicitly assumed to be a
14548 type name.
14550 is to assume that we have seen the `typename' keyword at this
14551 point. */
14552 nested_name_specifier_p
14561 /* If there is a `::' operator or a nested-name-specifier, then we
14562 are definitely looking for a class-name. */
14567 typename_type,
14571 /* Otherwise, we could also be looking for an ordinary identifier. */
14574 /* Try a decltype-specifier. */
14576 else
14577 /* Otherwise, try a class-name. */
14581 none_type,
14585 /* If we found one, we're done. */
14588 /* Otherwise, look for an ordinary identifier. */
14590 }
14592 /* Overloading [gram.over] */
14594 /* Parse an operator-function-id.
14596 operator-function-id:
14597 operator operator
14599 Returns an IDENTIFIER_NODE for the operator which is a
14600 human-readable spelling of the identifier, e.g., `operator +'. */
14602 static cp_expr
14604 {
14605 /* Look for the `operator' keyword. */
14608 /* And then the name of the operator itself. */
14610 }
14612 /* Return an identifier node for a user-defined literal operator.
14613 The suffix identifier is chained to the operator name identifier. */
14615 tree
14617 {
14618 tree identifier;
14625 }
14627 /* Parse an operator.
14629 operator:
14630 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14631 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14632 || ++ -- , ->* -> () []
14634 GNU Extensions:
14636 operator:
14637 <? >? <?= >?=
14639 Returns an IDENTIFIER_NODE for the operator which is a
14640 human-readable spelling of the identifier, e.g., `operator +'. */
14642 static cp_expr
14644 {
14649 /* Peek at the next token. */
14654 /* Figure out which operator we have. */
14659 {
14661 {
14662 /* The keyword should be either `new' or `delete'. */
14667 else
14670 /* Consume the `new' or `delete' token. */
14673 /* Peek at the next token. */
14675 /* If it's a `[' token then this is the array variant of the
14676 operator. */
14678 {
14679 /* Consume the `[' token. */
14681 /* Look for the `]' token. */
14686 }
14690 }
14848 {
14849 /* Consume the `('. */
14850 matching_parens parens;
14852 /* Look for the matching `)'. */
14857 }
14860 /* Consume the `['. */
14862 /* Look for the matching `]'. */
14871 /* FALLTHRU */
14880 {
14887 /* Consume the string. */
14893 {
14896 }
14897 else
14898 {
14900 /* Look for the suffix identifier. */
14905 {
14909 }
14910 else
14911 {
14914 }
14915 }
14920 {
14923 }
14926 {
14929 }
14931 {
14934 }
14936 }
14939 /* Anything else is an error. */
14941 }
14943 /* If we have selected an identifier, we need to consume the
14944 operator token. */
14946 {
14950 }
14951 /* Otherwise, no valid operator name was present. */
14952 else
14953 {
14956 }
14959 }
14961 /* Parse a template-declaration.
14963 template-declaration:
14964 export [opt] template < template-parameter-list > declaration
14966 If MEMBER_P is TRUE, this template-declaration occurs within a
14967 class-specifier.
14969 The grammar rule given by the standard isn't correct. What
14970 is really meant is:
14972 template-declaration:
14973 export [opt] template-parameter-list-seq
14974 decl-specifier-seq [opt] init-declarator [opt] ;
14975 export [opt] template-parameter-list-seq
14976 function-definition
14978 template-parameter-list-seq:
14979 template-parameter-list-seq [opt]
14980 template < template-parameter-list >
14982 Concept Extensions:
14984 template-parameter-list-seq:
14985 template < template-parameter-list > requires-clause [opt]
14987 requires-clause:
14988 requires logical-or-expression */
14990 static void
14992 {
14993 /* Check for `export'. */
14995 {
14996 /* Consume the `export' token. */
14998 /* Warn that we do not support `export'. */
15000 }
15003 }
15005 /* Parse a template-parameter-list.
15007 template-parameter-list:
15008 template-parameter
15009 template-parameter-list , template-parameter
15011 Returns a TREE_LIST. Each node represents a template parameter.
15012 The nodes are connected via their TREE_CHAINs. */
15014 static tree
15016 {
15021 /* The loop below parses the template parms. We first need to know
15022 the total number of template parms to be able to compute proper
15023 canonical types of each dependent type. So after the loop, when
15024 we know the total number of template parms,
15025 end_template_parm_list computes the proper canonical types and
15026 fixes up the dependent types accordingly. */
15028 {
15029 tree parameter;
15032 location_t parm_loc;
15034 /* Parse the template-parameter. */
15039 /* Add it to the list. */
15042 parm_loc,
15043 parameter,
15044 is_non_type,
15045 is_parameter_pack);
15046 else
15047 {
15050 }
15052 /* If the next token is not a `,', we're done. */
15055 /* Otherwise, consume the `,' token. */
15057 }
15060 }
15062 /* Parse a introduction-list.
15064 introduction-list:
15065 introduced-parameter
15066 introduction-list , introduced-parameter
15068 introduced-parameter:
15069 ...[opt] identifier
15071 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15072 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15073 WILDCARD_DECL will also have DECL_NAME set and token location in
15074 DECL_SOURCE_LOCATION. */
15076 static tree
15078 {
15082 {
15087 /* Build placeholder. */
15095 /* If the next token is not a `,', we're done. */
15098 /* Otherwise, consume the `,' token. */
15100 }
15102 /* Convert the vec into a TREE_VEC. */
15105 tree parm;
15111 }
15113 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15114 is an abstract declarator. */
15118 {
15123 }
15125 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15126 is an abstract declarator. */
15130 {
15134 else
15136 }
15138 /* Returns true if DECL represents a constrained-parameter. */
15142 {
15147 }
15149 /* Returns true if PARM declares a constrained-parameter. */
15153 {
15155 }
15157 /* Check that the type parameter is only a declarator-id, and that its
15158 type is not cv-qualified. */
15160 bool
15163 {
15168 {
15171 }
15173 /* Don't allow cv-qualified type parameters. */
15176 {
15179 }
15182 }
15184 /* Finish parsing/processing a template type parameter and checking
15185 various restrictions. */
15189 tree id,
15191 {
15194 else
15196 }
15198 static tree
15200 {
15201 /* FIXME: This should probably be copied, and we may need to adjust
15202 the template parameter depths. */
15212 }
15214 /* Finish parsing/processing a template template parameter by borrowing
15215 the template parameter list from the prototype parameter. */
15217 static tree
15219 tree proto,
15220 tree id,
15222 {
15226 }
15228 /* Create a new non-type template parameter from the given PARM
15229 declarator. */
15231 static tree
15234 {
15240 }
15242 /* Build a constrained template parameter based on the PARMDECL
15243 declarator. The type of PARMDECL is the constrained type, which
15244 refers to the prototype template parameter that ultimately
15245 specifies the type of the declared parameter. */
15247 static tree
15252 {
15258 /* A template parameter constrained by a variadic concept shall also
15259 be declared as a template parameter pack. */
15264 /* Build the parameter. Return an error if the declarator was invalid. */
15265 tree parm;
15270 parmdecl);
15271 else
15276 /* Finish the parameter decl and create a node attaching the
15277 default argument and constraint. */
15282 }
15284 /* Returns true if the parsed type actually represents the declaration
15285 of a type template-parameter. */
15289 {
15292 }
15295 /* Returns true if the parsed type actually represents the declaration of
15296 a template template-parameter. */
15298 static bool
15300 {
15303 }
15305 /* Parse a default argument for a type template-parameter.
15306 Note that diagnostics are handled in cp_parser_template_parameter. */
15308 static tree
15310 {
15313 /* Consume the `=' token. */
15318 /* Parse the default-argument. */
15324 {
15328 }
15331 }
15333 /* Parse a default argument for a template template-parameter. */
15335 static tree
15337 {
15342 /* Consume the `='. */
15344 /* Parse the id-expression. */
15346 /* save token before parsing the id-expression, for error
15347 reporting */
15349 tree default_argument
15357 /* If the id-expression was a template-id that refers to
15358 a template-class, we already have the declaration here,
15359 so no further lookup is needed. */
15360 ;
15361 else
15362 /* Look up the name. */
15363 default_argument
15365 none_type,
15371 /* See if the default argument is valid. */
15375 }
15377 /* Parse a template-parameter.
15379 template-parameter:
15380 type-parameter
15381 parameter-declaration
15383 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15384 the parameter. The TREE_PURPOSE is the default value, if any.
15385 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15386 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15387 set to true iff this parameter is a parameter pack. */
15389 static tree
15392 {
15395 tree parm;
15397 /* Assume it is a type parameter or a template parameter. */
15399 /* Assume it not a parameter pack. */
15401 /* Peek at the next token. */
15403 /* If it is `template', we have a type-parameter. */
15406 /* If it is `class' or `typename' we do not know yet whether it is a
15407 type parameter or a non-type parameter. Consider:
15409 template <typename T, typename T::X X> ...
15411 or:
15413 template <class C, class D*> ...
15415 Here, the first parameter is a type parameter, and the second is
15416 a non-type parameter. We can tell by looking at the token after
15417 the identifier -- if it is a `,', `=', or `>' then we have a type
15418 parameter. */
15420 {
15421 /* Peek at the token after `class' or `typename'. */
15423 /* If it's an ellipsis, we have a template type parameter
15424 pack. */
15427 /* If it's an identifier, skip it. */
15430 /* Now, see if the token looks like the end of a template
15431 parameter. */
15436 }
15438 /* Otherwise, it is a non-type parameter or a constrained parameter.
15440 [temp.param]
15442 When parsing a default template-argument for a non-type
15443 template-parameter, the first non-nested `>' is taken as the end
15444 of the template parameter-list rather than a greater-than
15445 operator. */
15446 parameter_declarator
15453 /* If the parameter declaration is marked as a parameter pack, set
15454 *IS_PARAMETER_PACK to notify the caller. */
15459 {
15460 /* Can happen in some cases of erroneous input (c++/34892). */
15462 /* Consume the `...' for better error recovery. */
15464 }
15466 // The parameter may have been constrained.
15469 parameter_declarator,
15470 is_non_type,
15471 is_parameter_pack);
15473 // Now we're sure that the parameter is a non-type parameter.
15484 }
15486 /* Parse a type-parameter.
15488 type-parameter:
15489 class identifier [opt]
15490 class identifier [opt] = type-id
15491 typename identifier [opt]
15492 typename identifier [opt] = type-id
15493 template < template-parameter-list > class identifier [opt]
15494 template < template-parameter-list > class identifier [opt]
15495 = id-expression
15497 GNU Extension (variadic templates):
15499 type-parameter:
15500 class ... identifier [opt]
15501 typename ... identifier [opt]
15503 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15504 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15505 the declaration of the parameter.
15507 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15509 static tree
15511 {
15513 tree parameter;
15515 /* Look for a keyword to tell us what kind of parameter this is. */
15521 {
15524 {
15525 tree identifier;
15526 tree default_argument;
15528 /* If the next token is an ellipsis, we have a template
15529 argument pack. */
15531 {
15532 /* Consume the `...' token. */
15537 }
15539 /* If the next token is an identifier, then it names the
15540 parameter. */
15543 else
15546 /* Create the parameter. */
15549 /* If the next token is an `=', we have a default argument. */
15551 {
15552 default_argument
15555 /* Template parameter packs cannot have default
15556 arguments. */
15558 {
15561 "template parameter pack %qD cannot have a "
15563 else
15565 "template parameter packs cannot have "
15568 }
15571 }
15572 else
15575 /* Create the combined representation of the parameter and the
15576 default argument. */
15578 }
15582 {
15583 tree identifier;
15584 tree default_argument;
15586 /* Look for the `<'. */
15588 /* Parse the template-parameter-list. */
15590 /* Look for the `>'. */
15593 // If template requirements are present, parse them.
15595 {
15600 }
15602 /* Look for the `class' or 'typename' keywords. */
15604 /* If the next token is an ellipsis, we have a template
15605 argument pack. */
15607 {
15608 /* Consume the `...' token. */
15613 }
15614 /* If the next token is an `=', then there is a
15615 default-argument. If the next token is a `>', we are at
15616 the end of the parameter-list. If the next token is a `,',
15617 then we are at the end of this parameter. */
15621 {
15623 /* Treat invalid names as if the parameter were nameless. */
15626 }
15627 else
15630 /* Create the template parameter. */
15632 identifier);
15634 /* If the next token is an `=', then there is a
15635 default-argument. */
15637 {
15638 default_argument
15641 /* Template parameter packs cannot have default
15642 arguments. */
15644 {
15647 "template parameter pack %qD cannot "
15649 identifier);
15650 else
15654 }
15655 }
15656 else
15659 /* Create the combined representation of the parameter and the
15660 default argument. */
15662 }
15668 }
15671 }
15673 /* Parse a template-id.
15675 template-id:
15676 template-name < template-argument-list [opt] >
15678 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15679 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15680 returned. Otherwise, if the template-name names a function, or set
15681 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15682 names a class, returns a TYPE_DECL for the specialization.
15684 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15685 uninstantiated templates. */
15687 static tree
15693 {
15694 tree templ;
15695 tree arguments;
15696 tree template_id;
15701 /* If the next token corresponds to a template-id, there is no need
15702 to reparse it. */
15705 {
15708 }
15710 /* Avoid performing name lookup if there is no possibility of
15711 finding a template-id. */
15714 && !cp_parser_nth_token_starts_template_argument_list_p
15716 {
15719 }
15721 /* Remember where the template-id starts. */
15727 /* Parse the template-name. */
15730 check_dependency_p,
15731 is_declaration,
15732 tag_type,
15735 {
15738 }
15740 /* Since we're going to preserve any side-effects from this parse, set up a
15741 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15742 in the template arguments. */
15745 /* If we find the sequence `[:' after a template-name, it's probably
15746 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15747 parse correctly the argument list. */
15754 {
15756 /* Change `:' into `::'. */
15758 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15759 CPP_LESS. */
15762 /* Parse the arguments. */
15765 {
15766 /* If we couldn't parse an argument list, then we revert our changes
15767 and return simply an error. Maybe this is not a template-id
15768 after all. */
15773 }
15774 /* Otherwise, emit an error about the invalid digraph, but continue
15775 parsing because we got our argument list. */
15778 {
15781 "%<<:%> is an alternate spelling for %<[%>."
15784 {
15786 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15789 }
15790 }
15791 }
15792 else
15793 {
15794 /* Look for the `<' that starts the template-argument-list. */
15796 {
15799 }
15800 /* Parse the arguments. */
15802 }
15804 /* Set the location to be of the form:
15805 template-name < template-argument-list [opt] >
15806 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15807 with caret == start at the start of the template-name,
15808 ranging until the closing '>'. */
15809 location_t finish_loc
15811 location_t combined_loc
15814 /* Check for concepts autos where they don't belong. We could
15815 identify types in some cases of idnetifier TEMPL, looking ahead
15816 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15817 types. We reject them in functions, but if what we have is an
15818 identifier, even with none_type we can't conclude it's NOT a
15819 type, we have to wait for template substitution. */
15822 /* Build a representation of the specialization. */
15825 TEMPLATE_ID_EXPR,
15829 {
15831 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15832 template (rather than some instantiation thereof) only if
15833 is not nested within some other construct. For example, in
15834 "template <typename T> void f(T) { A<T>::", A<T> is just an
15835 instantiation of A. */
15838 CPP_SCOPE));
15839 template_id
15841 }
15842 /* A template-like identifier may be a partial concept id. */
15848 {
15852 }
15853 else
15854 {
15855 /* If it's not a class-template or a template-template, it should be
15856 a function-template. */
15864 }
15866 /* If parsing tentatively, replace the sequence of tokens that makes
15867 up the template-id with a CPP_TEMPLATE_ID token. That way,
15868 should we re-parse the token stream, we will not have to repeat
15869 the effort required to do the parse, nor will we issue duplicate
15870 error messages about problems during instantiation of the
15871 template. */
15873 /* Don't do this if we had a parse error in a declarator; re-parsing
15874 might succeed if a name changes meaning (60361). */
15878 {
15879 /* Reset the contents of the START_OF_ID token. */
15883 /* We must mark the lookup as kept, so we don't throw it away on
15884 the first parse. */
15888 /* Retrieve any deferred checks. Do not pop this access checks yet
15889 so the memory will not be reclaimed during token replacing below. */
15895 /* Purge all subsequent tokens. */
15898 /* ??? Can we actually assume that, if template_id ==
15899 error_mark_node, we will have issued a diagnostic to the
15900 user, as opposed to simply marking the tentative parse as
15901 failed? */
15904 }
15908 }
15910 /* Parse a template-name.
15912 template-name:
15913 identifier
15915 The standard should actually say:
15917 template-name:
15918 identifier
15919 operator-function-id
15921 A defect report has been filed about this issue.
15923 A conversion-function-id cannot be a template name because they cannot
15924 be part of a template-id. In fact, looking at this code:
15926 a.operator K<int>()
15928 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15929 It is impossible to call a templated conversion-function-id with an
15930 explicit argument list, since the only allowed template parameter is
15931 the type to which it is converting.
15933 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15934 `template' keyword, in a construction like:
15936 T::template f<3>()
15938 In that case `f' is taken to be a template-name, even though there
15939 is no way of knowing for sure.
15941 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15942 name refers to a set of overloaded functions, at least one of which
15943 is a template, or an IDENTIFIER_NODE with the name of the template,
15944 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15945 names are looked up inside uninstantiated templates. */
15947 static tree
15954 {
15955 tree identifier;
15956 tree decl;
15959 /* If the next token is `operator', then we have either an
15960 operator-function-id or a conversion-function-id. */
15962 {
15963 /* We don't know whether we're looking at an
15964 operator-function-id or a conversion-function-id. */
15966 /* Try an operator-function-id. */
15968 /* If that didn't work, try a conversion-function-id. */
15970 {
15973 }
15974 }
15975 /* Look for the identifier. */
15976 else
15979 /* If we didn't find an identifier, we don't have a template-id. */
15983 /* If the name immediately followed the `template' keyword, then it
15984 is a template-name. However, if the next token is not `<', then
15985 we do not treat it as a template-name, since it is not being used
15986 as part of a template-id. This enables us to handle constructs
15987 like:
15989 template <typename T> struct S { S(); };
15990 template <typename T> S<T>::S();
15992 correctly. We would treat `S' as a template -- if it were `S<T>'
15993 -- but we do not if there is no `<'. */
15997 {
15998 /* In a declaration, in a dependent context, we pretend that the
15999 "template" keyword was present in order to improve error
16000 recovery. For example, given:
16002 template <typename T> void f(T::X<int>);
16004 we want to treat "X<int>" as a template-id. */
16006 && !template_keyword_p
16008 && check_dependency_p
16010 /* Do not do this for dtors (or ctors), since they never
16011 need the template keyword before their name. */
16013 {
16016 /* Explain what went wrong. */
16018 identifier);
16021 /* If parsing tentatively, find the location of the "<" token. */
16024 /* Parse the template arguments so that we can issue error
16025 messages about them. */
16028 /* Skip tokens until we find a good place from which to
16029 continue parsing. */
16034 /* If parsing tentatively, permanently remove the
16035 template argument list. That will prevent duplicate
16036 error messages from being issued about the missing
16037 "template" keyword. */
16044 }
16046 /* If the "template" keyword is present, then there is generally
16047 no point in doing name-lookup, so we just return IDENTIFIER.
16048 But, if the qualifying scope is non-dependent then we can
16049 (and must) do name-lookup normally. */
16051 {
16057 {
16058 /* We're optimizing away the call to cp_parser_lookup_name, but
16059 we still need to do this. */
16062 }
16063 }
16064 }
16066 /* Look up the name. */
16068 tag_type,
16071 check_dependency_p,
16077 /* If DECL is a template, then the name was a template-name. */
16079 {
16083 }
16084 else
16085 {
16086 /* The standard does not explicitly indicate whether a name that
16087 names a set of overloaded declarations, some of which are
16088 templates, is a template-name. However, such a name should
16089 be a template-name; otherwise, there is no way to form a
16090 template-id for the overloaded templates. */
16099 {
16100 /* The name does not name a template. */
16103 }
16104 }
16106 /* If DECL is dependent, and refers to a function, then just return
16107 its name; we will look it up again during template instantiation. */
16109 {
16113 }
16116 }
16118 /* Parse a template-argument-list.
16120 template-argument-list:
16121 template-argument ... [opt]
16122 template-argument-list , template-argument ... [opt]
16124 Returns a TREE_VEC containing the arguments. */
16126 static tree
16128 {
16133 tree vec;
16140 /* Even if the template-id appears in an integral
16141 constant-expression, the contents of the argument list do
16142 not. */
16148 /* Parse the arguments. */
16149 do
16150 {
16151 tree argument;
16154 /* Consume the comma. */
16157 /* Parse the template-argument. */
16160 /* If the next token is an ellipsis, we're expanding a template
16161 argument pack. */
16163 {
16165 {
16169 }
16170 /* Consume the `...' token. */
16173 /* Make the argument into a TYPE_PACK_EXPANSION or
16174 EXPR_PACK_EXPANSION. */
16176 }
16179 {
16183 {
16186 }
16187 else
16189 }
16191 }
16207 }
16209 /* Parse a template-argument.
16211 template-argument:
16212 assignment-expression
16213 type-id
16214 id-expression
16216 The representation is that of an assignment-expression, type-id, or
16217 id-expression -- except that the qualified id-expression is
16218 evaluated, so that the value returned is either a DECL or an
16219 OVERLOAD.
16221 Although the standard says "assignment-expression", it forbids
16222 throw-expressions or assignments in the template argument.
16223 Therefore, we use "conditional-expression" instead. */
16225 static tree
16227 {
16228 tree argument;
16234 cp_id_kind idk;
16236 /* There's really no way to know what we're looking at, so we just
16237 try each alternative in order.
16239 [temp.arg]
16241 In a template-argument, an ambiguity between a type-id and an
16242 expression is resolved to a type-id, regardless of the form of
16243 the corresponding template-parameter.
16245 Therefore, we try a type-id first. */
16248 /* If there was no error parsing the type-id but the next token is a
16249 '>>', our behavior depends on which dialect of C++ we're
16250 parsing. In C++98, we probably found a typo for '> >'. But there
16251 are type-id which are also valid expressions. For instance:
16253 struct X { int operator >> (int); };
16254 template <int V> struct Foo {};
16255 Foo<X () >> 5> r;
16257 Here 'X()' is a valid type-id of a function type, but the user just
16258 wanted to write the expression "X() >> 5". Thus, we remember that we
16259 found a valid type-id, but we still try to parse the argument as an
16260 expression to see what happens.
16262 In C++0x, the '>>' will be considered two separate '>'
16263 tokens. */
16267 {
16270 }
16271 else
16272 {
16273 /* If the next token isn't a `,' or a `>', then this argument wasn't
16274 really finished. This means that the argument is not a valid
16275 type-id. */
16278 /* If that worked, we're done. */
16281 }
16282 /* We're still not sure what the argument will be. */
16284 /* Try a template. */
16292 /* If the next token isn't a `,' or a `>', then this argument wasn't
16293 really finished. */
16297 {
16298 /* Figure out what is being referred to. If the id-expression
16299 was for a class template specialization, then we will have a
16300 TYPE_DECL at this point. There is no need to do name lookup
16301 at this point in that case. */
16304 none_type,
16310 /* Handle a constrained-type-specifier for a non-type template
16311 parameter. */
16317 }
16319 {
16323 }
16324 /* It must be a non-type argument. In C++17 any constant-expression is
16325 allowed. */
16329 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16331 -- an integral constant-expression of integral or enumeration
16332 type; or
16334 -- the name of a non-type template-parameter; or
16336 -- the name of an object or function with external linkage...
16338 -- the address of an object or function with external linkage...
16340 -- a pointer to member... */
16341 /* Look for a non-type template parameter. */
16343 {
16355 }
16357 /* If the next token is "&", the argument must be the address of an
16358 object or function with external linkage. */
16361 {
16364 }
16365 /* See if we might have an id-expression. */
16372 {
16375 address_p,
16382 else
16383 {
16384 tree probe;
16387 {
16388 /* Strip the dereference temporarily. */
16391 }
16393 /* If we're in a template, we represent a qualified-id referring
16394 to a static data member as a SCOPE_REF even if the scope isn't
16395 dependent so that we can check access control later. */
16400 {
16401 /* A variable without external linkage might still be a
16402 valid constant-expression, so no error is issued here
16403 if the external-linkage check fails. */
16406 }
16408 /* All overloaded functions are allowed; if the external
16409 linkage test does not pass, an error will be issued
16410 later. */
16411 ;
16415 /* A pointer-to-member. */
16416 ;
16418 ;
16419 else
16423 {
16426 tf_warning_or_error);
16427 else
16430 }
16431 }
16432 }
16433 /* If the argument started with "&", there are no other valid
16434 alternatives at this point. */
16436 {
16439 }
16441 general_expr:
16442 /* If the argument wasn't successfully parsed as a type-id followed
16443 by '>>', the argument can only be a constant expression now.
16444 Otherwise, we try parsing the constant-expression tentatively,
16445 because the argument could really be a type-id. */
16451 else
16452 {
16453 /* With C++17 generalized non-type template arguments we need to handle
16454 lvalue constant expressions, too. */
16457 }
16465 /* We did our best to parse the argument as a non type-id, but that
16466 was the only alternative that matched (albeit with a '>' after
16467 it). We can assume it's just a typo from the user, and a
16468 diagnostic will then be issued. */
16470 }
16472 /* Parse an explicit-instantiation.
16474 explicit-instantiation:
16475 template declaration
16477 Although the standard says `declaration', what it really means is:
16479 explicit-instantiation:
16480 template decl-specifier-seq [opt] declarator [opt] ;
16482 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16483 supposed to be allowed. A defect report has been filed about this
16484 issue.
16486 GNU Extension:
16488 explicit-instantiation:
16489 storage-class-specifier template
16490 decl-specifier-seq [opt] declarator [opt] ;
16491 function-specifier template
16492 decl-specifier-seq [opt] declarator [opt] ; */
16494 static void
16496 {
16498 cp_decl_specifier_seq decl_specifiers;
16503 /* Look for an (optional) storage-class-specifier or
16504 function-specifier. */
16506 {
16507 extension_specifier
16510 extension_specifier
16513 }
16515 /* Look for the `template' keyword. */
16517 /* Let the front end know that we are processing an explicit
16518 instantiation. */
16520 /* [temp.explicit] says that we are supposed to ignore access
16521 control while processing explicit instantiation directives. */
16523 /* Parse a decl-specifier-seq. */
16525 CP_PARSER_FLAGS_OPTIONAL,
16528 /* If there was exactly one decl-specifier, and it declared a class,
16529 and there's no declarator, then we have an explicit type
16530 instantiation. */
16532 {
16533 tree type;
16537 /* Turn access control back on for names used during
16538 template instantiation. */
16543 }
16544 else
16545 {
16547 tree decl;
16549 /* Parse the declarator. */
16550 declarator
16561 {
16564 "explicit instantiation shall not use"
16568 "explicit instantiation shall not use"
16573 /* Turn access control back on for names used during
16574 template instantiation. */
16576 /* Do the explicit instantiation. */
16578 }
16579 else
16580 {
16582 /* Skip the body of the explicit instantiation. */
16584 }
16585 }
16586 /* We're done with the instantiation. */
16592 }
16594 /* Parse an explicit-specialization.
16596 explicit-specialization:
16597 template < > declaration
16599 Although the standard says `declaration', what it really means is:
16601 explicit-specialization:
16602 template <> decl-specifier [opt] init-declarator [opt] ;
16603 template <> function-definition
16604 template <> explicit-specialization
16605 template <> template-declaration */
16607 static void
16609 {
16613 /* Look for the `template' keyword. */
16615 /* Look for the `<'. */
16617 /* Look for the `>'. */
16619 /* We have processed another parameter list. */
16621 /* [temp]
16623 A template ... explicit specialization ... shall not have C
16624 linkage. */
16626 {
16629 /* Give it C++ linkage to avoid confusing other parts of the
16630 front end. */
16633 }
16634 else
16636 /* Let the front end know that we are beginning a specialization. */
16638 {
16641 }
16643 /* If the next keyword is `template', we need to figure out whether
16644 or not we're looking a template-declaration. */
16646 {
16651 else
16653 }
16654 else
16655 /* Parse the dependent declaration. */
16661 /* We're done with the specialization. */
16663 /* For the erroneous case of a template with C linkage, we pushed an
16664 implicit C++ linkage scope; exit that scope now. */
16667 /* We're done with this parameter list. */
16669 }
16671 /* Parse a type-specifier.
16673 type-specifier:
16674 simple-type-specifier
16675 class-specifier
16676 enum-specifier
16677 elaborated-type-specifier
16678 cv-qualifier
16680 GNU Extension:
16682 type-specifier:
16683 __complex__
16685 Returns a representation of the type-specifier. For a
16686 class-specifier, enum-specifier, or elaborated-type-specifier, a
16687 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16689 The parser flags FLAGS is used to control type-specifier parsing.
16691 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16692 in a decl-specifier-seq.
16694 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16695 class-specifier, enum-specifier, or elaborated-type-specifier, then
16696 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16697 if a type is declared; 2 if it is defined. Otherwise, it is set to
16698 zero.
16700 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16701 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16702 is set to FALSE. */
16704 static tree
16706 cp_parser_flags flags,
16711 {
16717 /* Assume this type-specifier does not declare a new type. */
16720 /* And that it does not specify a cv-qualifier. */
16723 /* Peek at the next token. */
16726 /* If we're looking at a keyword, we can use that to guide the
16727 production we choose. */
16730 {
16735 /* Look for the enum-specifier. */
16737 /* If that worked, we're done. */
16739 {
16744 type_spec,
16745 token,
16748 }
16749 else
16752 /* Any of these indicate either a class-specifier, or an
16753 elaborated-type-specifier. */
16760 /* Parse tentatively so that we can back up if we don't find a
16761 class-specifier. */
16763 /* Look for the class-specifier. */
16766 /* If that worked, we're done. */
16768 {
16773 type_spec,
16774 token,
16777 }
16779 /* Fall through. */
16780 elaborated_type_specifier:
16781 /* We're declaring (not defining) a class or enum. */
16785 /* Fall through. */
16787 /* Look for an elaborated-type-specifier. */
16788 type_spec
16789 = (cp_parser_elaborated_type_specifier
16792 is_declaration));
16795 type_spec,
16796 token,
16819 /* The `__complex__' keyword is a GNU extension. */
16825 }
16827 /* Handle simple keywords. */
16829 {
16831 {
16834 }
16836 }
16838 /* If we do not already have a type-specifier, assume we are looking
16839 at a simple-type-specifier. */
16841 decl_specs,
16842 flags);
16844 /* If we didn't find a type-specifier, and a type-specifier was not
16845 optional in this context, issue an error message. */
16847 {
16850 }
16853 }
16855 /* Parse a simple-type-specifier.
16857 simple-type-specifier:
16858 :: [opt] nested-name-specifier [opt] type-name
16859 :: [opt] nested-name-specifier template template-id
16860 char
16861 wchar_t
16862 bool
16863 short
16864 int
16865 long
16866 signed
16867 unsigned
16868 float
16869 double
16870 void
16872 C++11 Extension:
16874 simple-type-specifier:
16875 auto
16876 decltype ( expression )
16877 char16_t
16878 char32_t
16879 __underlying_type ( type-id )
16881 C++17 extension:
16883 nested-name-specifier(opt) template-name
16885 GNU Extension:
16887 simple-type-specifier:
16888 __int128
16889 __typeof__ unary-expression
16890 __typeof__ ( type-id )
16891 __typeof__ ( type-id ) { initializer-list , [opt] }
16893 Concepts Extension:
16895 simple-type-specifier:
16896 constrained-type-specifier
16898 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16899 appropriately updated. */
16901 static tree
16904 cp_parser_flags flags)
16905 {
16910 /* Peek at the next token. */
16913 /* If we're looking at a keyword, things are easy. */
16915 {
16950 {
16953 }
16982 {
16983 /* The 'auto' might be the placeholder return type for a function decl
16984 with trailing return type. */
16993 {
16995 {
17002 }
17005 {
17008 }
17011 }
17015 {
17018 }
17021 {
17024 }
17025 else
17029 {
17032 "use of %<auto%> in lambda parameter declaration "
17033 "only available with "
17035 }
17038 "use of %<auto%> in parameter declaration "
17039 "only available with "
17043 "use of %<auto%> in parameter declaration "
17045 }
17046 else
17051 /* Since DR 743, decltype can either be a simple-type-specifier by
17052 itself or begin a nested-name-specifier. Parsing it will replace
17053 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17054 handling below decide what to do. */
17060 /* Consume the `typeof' token. */
17062 /* Parse the operand to `typeof'. */
17064 /* If it is not already a TYPE, take its type. */
17070 token,
17079 token,
17089 token,
17094 }
17096 /* If token is an already-parsed decltype not followed by ::,
17097 it's a simple-type-specifier. */
17100 {
17103 {
17105 token,
17107 /* Remember that we are handling a decltype in order to
17108 implement the resolution of DR 1510 when the argument
17109 isn't instantiation dependent. */
17111 }
17114 }
17116 /* If the type-specifier was for a built-in type, we're done. */
17118 {
17119 /* Record the type. */
17126 type,
17127 token,
17132 /* Consume the token. */
17138 /* There is no valid C++ program where a non-template type is
17139 followed by a "<". That usually indicates that the user thought
17140 that the type was a template. */
17145 }
17147 /* The type-specifier must be a user-defined type. */
17149 {
17153 /* Don't gobble tokens or issue error messages if this is an
17154 optional type-specifier. */
17160 /* Look for the optional `::' operator. */
17161 global_p
17165 /* Look for the nested-name specifier. */
17166 qualified_p
17173 /* If we have seen a nested-name-specifier, and the next token
17174 is `template', then we are using the template-id production. */
17177 {
17178 /* Look for the template-id. */
17182 none_type,
17184 /* If the template-id did not name a type, we are out of
17185 luck. */
17187 {
17190 }
17191 }
17192 /* Otherwise, look for a type-name. */
17193 else
17195 /* Keep track of all name-lookups performed in class scopes. */
17197 && !global_p
17198 && !qualified_p
17202 /* If it didn't work out, we don't have a TYPE. */
17207 {
17221 {
17223 none_type,
17233 else
17234 {
17239 }
17240 }
17241 else
17247 }
17250 token,
17252 }
17254 /* If we didn't get a type-name, issue an error message. */
17256 {
17259 }
17262 {
17263 /* See if TYPE is an Objective-C type, and if so, parse and
17264 accept any protocol references following it. Do this before
17265 the cp_parser_check_for_invalid_template_id() call, because
17266 Objective-C types can be followed by '<...>' which would
17267 enclose protocol names rather than template arguments, and so
17268 everything is fine. */
17271 {
17275 /* Clobber the "unqualified" type previously entered into
17276 DECL_SPECS with the new, improved protocol-qualified version. */
17281 }
17283 /* There is no valid C++ program where a non-template type is
17284 followed by a "<". That usually indicates that the user
17285 thought that the type was a template. */
17287 none_type,
17289 }
17292 }
17294 /* Parse a type-name.
17296 type-name:
17297 class-name
17298 enum-name
17299 typedef-name
17300 simple-template-id [in c++0x]
17302 enum-name:
17303 identifier
17305 typedef-name:
17306 identifier
17308 Concepts:
17310 type-name:
17311 concept-name
17312 partial-concept-id
17314 concept-name:
17315 identifier
17317 Returns a TYPE_DECL for the type. */
17319 static tree
17321 {
17323 }
17325 /* See above. */
17326 static tree
17328 {
17329 tree type_decl;
17331 /* We can't know yet whether it is a class-name or not. */
17333 /* Try a class-name. */
17335 typename_keyword_p,
17337 none_type,
17341 /* If it's not a class-name, keep looking. */
17343 {
17345 /* It must be a typedef-name or an enum-name. */
17349 /* It is either a simple-template-id representing an
17350 instantiation of an alias template... */
17354 none_type,
17356 /* Note that this must be an instantiation of an alias template
17357 because [temp.names]/6 says:
17359 A template-id that names an alias template specialization
17360 is a type-name.
17362 Whereas [temp.names]/7 says:
17364 A simple-template-id that names a class template
17365 specialization is a class-name.
17367 With concepts, this could also be a partial-concept-id that
17368 declares a non-type template parameter. */
17375 else
17379 /* ... Or a typedef-name or an enum-name. */
17381 }
17384 }
17386 /* Check if DECL and ARGS can form a constrained-type-specifier.
17387 If ARGS is non-null, we try to form a concept check of the
17388 form DECL<?, ARGS> where ? is a wildcard that matches any
17389 kind of template argument. If ARGS is NULL, then we try to
17390 form a concept check of the form DECL<?>. */
17392 static tree
17395 {
17398 /* If we a constrained-type-specifier cannot be deduced. */
17402 /* A constrained type specifier can only be found in an
17403 overload set or as a reference to a template declaration.
17405 FIXME: This might be masking a bug. It's possible that
17406 that the deduction below is causing template specializations
17407 to be formed with the wildcard as an argument. */
17411 /* Try to build a call expression that evaluates the
17412 concept. This can fail if the overload set refers
17413 only to non-templates. */
17419 /* Deduce the checked constraint and the prototype parameter.
17421 FIXME: In certain cases, failure to deduce should be a
17422 diagnosable error. */
17423 tree conc;
17424 tree proto;
17428 /* In template parameter scope, this results in a constrained
17429 parameter. Return a descriptor of that parm. */
17433 /* In a parameter-declaration-clause, constrained-type
17434 specifiers result in invented template parameters. */
17436 {
17439 }
17440 else
17441 {
17442 /* Otherwise, we're in a context where the constrained
17443 type name is deduced and the constraint applies
17444 after deduction. */
17446 }
17449 }
17451 /* If DECL refers to a concept, return a TYPE_DECL representing
17452 the result of using the constrained type specifier in the
17453 current context. DECL refers to a concept if
17455 - it is an overload set containing a function concept taking a single
17456 type argument, or
17458 - it is a variable concept taking a single type argument. */
17460 static tree
17462 {
17468 else
17470 }
17472 /* Check if DECL and ARGS form a partial-concept-id. If so,
17473 assign ID to the resulting constrained placeholder.
17475 Returns true if the partial-concept-id designates a placeholder
17476 and false otherwise. Note that *id is set to NULL_TREE in
17477 this case. */
17479 static tree
17481 {
17483 }
17485 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17486 or a concept-name.
17488 enum-name:
17489 identifier
17491 typedef-name:
17492 identifier
17494 concept-name:
17495 identifier
17497 Returns a TYPE_DECL for the type. */
17499 static tree
17501 {
17502 tree type_decl;
17503 tree identifier;
17510 /* Look up the type-name. */
17515 /* If we found an overload set, then it may refer to a concept-name. */
17521 {
17522 /* See if this is an Objective-C type. */
17527 }
17529 /* Issue an error if we did not find a type-name. */
17531 /* In Objective-C, we have the complication that class names are
17532 normally type names and start declarations (eg, the
17533 "NSObject" in "NSObject *object;"), but can be used in an
17534 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17535 is an expression. So, a classname followed by a dot is not a
17536 valid type-name. */
17539 {
17544 }
17545 /* Remember that the name was used in the definition of the
17546 current class so that we can check later to see if the
17547 meaning would have been different after the class was
17548 entirely defined. */
17554 }
17556 /* Parse an elaborated-type-specifier. Note that the grammar given
17557 here incorporates the resolution to DR68.
17559 elaborated-type-specifier:
17560 class-key :: [opt] nested-name-specifier [opt] identifier
17561 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17562 enum-key :: [opt] nested-name-specifier [opt] identifier
17563 typename :: [opt] nested-name-specifier identifier
17564 typename :: [opt] nested-name-specifier template [opt]
17565 template-id
17567 GNU extension:
17569 elaborated-type-specifier:
17570 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17571 class-key attributes :: [opt] nested-name-specifier [opt]
17572 template [opt] template-id
17573 enum attributes :: [opt] nested-name-specifier [opt] identifier
17575 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17576 declared `friend'. If IS_DECLARATION is TRUE, then this
17577 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17578 something is being declared.
17580 Returns the TYPE specified. */
17582 static tree
17586 {
17588 tree identifier;
17591 tree globalscope;
17594 /* See if we're looking at the `enum' keyword. */
17596 {
17597 /* Consume the `enum' token. */
17599 /* Remember that it's an enumeration type. */
17601 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17602 enums) is used here. */
17606 {
17613 /* Consume the `struct' or `class' and parse it anyway. */
17615 }
17616 /* Parse the attributes. */
17618 }
17619 /* Or, it might be `typename'. */
17621 RID_TYPENAME))
17622 {
17623 /* Consume the `typename' token. */
17625 /* Remember that it's a `typename' type. */
17627 }
17628 /* Otherwise it must be a class-key. */
17629 else
17630 {
17634 /* Parse the attributes. */
17636 }
17638 /* Look for the `::' operator. */
17641 /* Look for the nested-name-specifier. */
17642 tree nested_name_specifier;
17644 {
17645 nested_name_specifier
17650 is_declaration);
17653 }
17654 else
17655 /* Even though `typename' is not present, the proposed resolution
17656 to Core Issue 180 says that in `class A<T>::B', `B' should be
17657 considered a type-name, even if `A<T>' is dependent. */
17658 nested_name_specifier
17663 is_declaration);
17664 /* For everything but enumeration types, consider a template-id.
17665 For an enumeration type, consider only a plain identifier. */
17667 {
17669 tree decl;
17671 /* Allow the `template' keyword. */
17673 /* If we didn't see `template', we don't know if there's a
17674 template-id or not. */
17677 /* Parse the template-id. */
17681 tag_type,
17682 is_declaration);
17683 /* If we didn't find a template-id, look for an ordinary
17684 identifier. */
17686 ;
17687 /* We can get here when cp_parser_template_id, called by
17688 cp_parser_class_name with tag_type == none_type, succeeds
17689 and caches a BASELINK. Then, when called again here,
17690 instead of failing and returning an error_mark_node
17691 returns it (see template/typename17.C in C++11).
17692 ??? Could we diagnose this earlier? */
17694 {
17697 }
17698 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17699 in effect, then we must assume that, upon instantiation, the
17700 template will correspond to a class. */
17704 typename_type,
17706 /* If the `typename' keyword is in effect and DECL is not a type
17707 decl, then type is non existent. */
17709 ;
17711 {
17715 /* If the next token is a semicolon, this must be a specialization,
17716 instantiation, or friend declaration. Check the scope while we
17717 still know whether or not we had a nested-name-specifier. */
17722 }
17725 }
17728 {
17733 {
17736 }
17738 /* For a `typename', we needn't call xref_tag. */
17744 /* Template parameter lists apply only if we are not within a
17745 function parameter list. */
17746 bool template_parm_lists_apply
17755 /* Look up a qualified name in the usual way. */
17757 {
17758 tree decl;
17759 tree ambiguous_decls;
17762 tag_type,
17769 /* If the lookup was ambiguous, an error will already have been
17770 issued. */
17774 /* If we are parsing friend declaration, DECL may be a
17775 TEMPLATE_DECL tree node here. However, we need to check
17776 whether this TEMPLATE_DECL results in valid code. Consider
17777 the following example:
17779 namespace N {
17780 template <class T> class C {};
17781 }
17782 class X {
17783 template <class T> friend class N::C; // #1, valid code
17784 };
17785 template <class T> class Y {
17786 friend class N::C; // #2, invalid code
17787 };
17789 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17790 name lookup of `N::C'. We see that friend declaration must
17791 be template for the code to be valid. Note that
17792 processing_template_decl does not work here since it is
17793 always 1 for the above two cases. */
17795 decl = (cp_parser_maybe_treat_template_as_class
17800 {
17802 identifier,
17805 }
17808 {
17812 allow_template);
17816 }
17818 /* Forward declarations of nested types, such as
17820 class C1::C2;
17821 class C1::C2::C3;
17823 are invalid unless all components preceding the final '::'
17824 are complete. If all enclosing types are complete, these
17825 declarations become merely pointless.
17827 Invalid forward declarations of nested types are errors
17828 caught elsewhere in parsing. Those that are pointless arrive
17829 here. */
17836 }
17837 else
17838 {
17839 /* An elaborated-type-specifier sometimes introduces a new type and
17840 sometimes names an existing type. Normally, the rule is that it
17841 introduces a new type only if there is not an existing type of
17842 the same name already in scope. For example, given:
17844 struct S {};
17845 void f() { struct S s; }
17847 the `struct S' in the body of `f' is the same `struct S' as in
17848 the global scope; the existing definition is used. However, if
17849 there were no global declaration, this would introduce a new
17850 local class named `S'.
17852 An exception to this rule applies to the following code:
17854 namespace N { struct S; }
17856 Here, the elaborated-type-specifier names a new type
17857 unconditionally; even if there is already an `S' in the
17858 containing scope this declaration names a new type.
17859 This exception only applies if the elaborated-type-specifier
17860 forms the complete declaration:
17862 [class.name]
17864 A declaration consisting solely of `class-key identifier ;' is
17865 either a redeclaration of the name in the current scope or a
17866 forward declaration of the identifier as a class name. It
17867 introduces the name into the current scope.
17869 We are in this situation precisely when the next token is a `;'.
17871 An exception to the exception is that a `friend' declaration does
17872 *not* name a new type; i.e., given:
17874 struct S { friend struct T; };
17876 `T' is not a new type in the scope of `S'.
17878 Also, `new struct S' or `sizeof (struct S)' never results in the
17879 definition of a new type; a new type can only be declared in a
17880 declaration context. */
17882 tag_scope ts;
17886 /* Friends have special name lookup rules. */
17890 CPP_SEMICOLON))
17891 /* This is a `class-key identifier ;' */
17893 else
17896 template_p =
17897 (template_parm_lists_apply
17900 /* An unqualified name was used to reference this type, so
17901 there were no qualifying templates. */
17910 }
17911 }
17916 /* Allow attributes on forward declarations of classes. */
17918 {
17928 else
17931 }
17934 {
17935 /* Indicate whether this class was declared as a `class' or as a
17936 `struct'. */
17940 }
17942 /* A "<" cannot follow an elaborated type specifier. If that
17943 happens, the user was probably trying to form a template-id. */
17948 }
17950 /* Parse an enum-specifier.
17952 enum-specifier:
17953 enum-head { enumerator-list [opt] }
17954 enum-head { enumerator-list , } [C++0x]
17956 enum-head:
17957 enum-key identifier [opt] enum-base [opt]
17958 enum-key nested-name-specifier identifier enum-base [opt]
17960 enum-key:
17961 enum
17962 enum class [C++0x]
17963 enum struct [C++0x]
17965 enum-base: [C++0x]
17966 : type-specifier-seq
17968 opaque-enum-specifier:
17969 enum-key identifier enum-base [opt] ;
17971 GNU Extensions:
17972 enum-key attributes[opt] identifier [opt] enum-base [opt]
17973 { enumerator-list [opt] }attributes[opt]
17974 enum-key attributes[opt] identifier [opt] enum-base [opt]
17975 { enumerator-list, }attributes[opt] [C++0x]
17977 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17978 if the token stream isn't an enum-specifier after all. */
17980 static tree
17982 {
17983 tree identifier;
17985 tree prev_scope;
17987 tree attributes;
18000 /* Parse tentatively so that we can back up if we don't find a
18001 enum-specifier. */
18004 /* Caller guarantees that the current token is 'enum', an identifier
18005 possibly follows, and the token after that is an opening brace.
18006 If we don't have an identifier, fabricate an anonymous name for
18007 the enumeration being defined. */
18010 /* Parse the "class" or "struct", which indicates a scoped
18011 enumeration type in C++0x. */
18014 {
18018 /* Consume the `struct' or `class' token. */
18022 }
18026 /* Clear the qualification. */
18031 /* Figure out in what scope the declaration is being placed. */
18037 nested_name_specifier
18045 {
18046 tree name;
18050 enum_type,
18055 input_location);
18057 {
18060 {
18061 /* Are template enums allowed in ISO? */
18065 /* ignore a typename reference, for it will be solved by name
18066 in start_enum. */
18068 }
18069 }
18072 else
18073 {
18078 }
18079 }
18080 else
18081 {
18084 else
18085 {
18091 }
18092 }
18095 /* Check for the `:' that denotes a specified underlying type in C++0x.
18096 Note that a ':' could also indicate a bitfield width, however. */
18098 {
18099 cp_decl_specifier_seq type_specifiers;
18101 /* Consume the `:'. */
18104 /* Parse the type-specifier-seq. */
18109 /* At this point this is surely not elaborated type specifier. */
18118 /* If that didn't work, stop. */
18120 {
18126 }
18127 }
18129 /* Look for the `{' but don't consume it yet. */
18131 {
18133 {
18136 {
18139 }
18140 }
18141 /* An opaque-enum-specifier must have a ';' here. */
18144 {
18147 {
18150 }
18151 }
18152 }
18158 {
18160 {
18164 }
18166 {
18168 }
18169 }
18171 /* Issue an error message if type-definitions are forbidden here. */
18174 else
18175 /* Create the new type. We do this before consuming the opening
18176 brace so the enum will be recorded as being on the line of its
18177 tag (or the 'enum' keyword, if there is no tag). */
18181 /* If the next token is not '{' it is an opaque-enum-specifier or an
18182 elaborated-type-specifier. */
18184 {
18188 {
18189 /* The following catches invalid code such as:
18190 enum class S<int>::E { A, B, C }; */
18198 {
18202 nested_name_specifier);
18204 }
18207 {
18209 "%qT for enum declaration does not name a class "
18212 }
18213 /* If that scope does not contain the scope in which the
18214 class was originally declared, the program is invalid. */
18216 nested_name_specifier))
18217 {
18220 "declaration of %qD in namespace %qD which does not "
18223 else
18225 "declaration of %qD in %qD which does not "
18229 }
18230 /* If that scope is the scope where the declaration is being placed
18231 the program is invalid. */
18235 {
18239 }
18240 }
18245 /* Consume the opening brace. */
18246 matching_braces braces;
18253 {
18257 }
18258 else
18259 {
18265 }
18269 /* If the next token is not '}', then there are some enumerators. */
18271 {
18275 }
18276 else
18279 /* Consume the final '}'. */
18285 }
18286 else
18287 {
18288 /* If a ';' follows, then it is an opaque-enum-specifier
18289 and additional restrictions apply. */
18291 {
18298 }
18299 }
18301 /* Look for trailing attributes to apply to this enumeration, and
18302 apply them if appropriate. */
18304 {
18307 trailing_attr,
18309 }
18311 /* Finish up the enumeration. */
18313 {
18318 }
18321 {
18323 {
18326 }
18328 {
18330 }
18331 }
18332 out:
18335 }
18337 /* Parse an enumerator-list. The enumerators all have the indicated
18338 TYPE.
18340 enumerator-list:
18341 enumerator-definition
18342 enumerator-list , enumerator-definition */
18344 static void
18346 {
18348 {
18349 /* Parse an enumerator-definition. */
18352 /* If the next token is not a ',', we've reached the end of
18353 the list. */
18356 /* Otherwise, consume the `,' and keep going. */
18358 /* If the next token is a `}', there is a trailing comma. */
18360 {
18365 }
18366 }
18367 }
18369 /* Parse an enumerator-definition. The enumerator has the indicated
18370 TYPE.
18372 enumerator-definition:
18373 enumerator
18374 enumerator = constant-expression
18376 enumerator:
18377 identifier
18379 GNU Extensions:
18381 enumerator-definition:
18382 enumerator attributes [opt]
18383 enumerator attributes [opt] = constant-expression */
18385 static void
18387 {
18388 tree identifier;
18389 tree value;
18390 location_t loc;
18392 /* Save the input location because we are interested in the location
18393 of the identifier and not the location of the explicit value. */
18396 /* Look for the identifier. */
18401 /* Parse any specified attributes. */
18404 /* If the next token is an '=', then there is an explicit value. */
18406 {
18407 /* Consume the `=' token. */
18409 /* Parse the value. */
18411 }
18412 else
18415 /* If we are processing a template, make sure the initializer of the
18416 enumerator doesn't contain any bare template parameter pack. */
18420 /* Create the enumerator. */
18422 }
18424 /* Parse a namespace-name.
18426 namespace-name:
18427 original-namespace-name
18428 namespace-alias
18430 Returns the NAMESPACE_DECL for the namespace. */
18432 static tree
18434 {
18435 tree identifier;
18436 tree namespace_decl;
18440 /* Get the name of the namespace. */
18445 /* Look up the identifier in the currently active scope. Look only
18446 for namespaces, due to:
18448 [basic.lookup.udir]
18450 When looking up a namespace-name in a using-directive or alias
18451 definition, only namespace names are considered.
18453 And:
18455 [basic.lookup.qual]
18457 During the lookup of a name preceding the :: scope resolution
18458 operator, object, function, and enumerator names are ignored.
18460 (Note that cp_parser_qualifying_entity only calls this
18461 function if the token after the name is the scope resolution
18462 operator.) */
18464 none_type,
18470 /* If it's not a namespace, issue an error. */
18473 {
18475 {
18481 }
18484 }
18487 }
18489 /* Parse a namespace-definition.
18491 namespace-definition:
18492 named-namespace-definition
18493 unnamed-namespace-definition
18495 named-namespace-definition:
18496 original-namespace-definition
18497 extension-namespace-definition
18499 original-namespace-definition:
18500 namespace identifier { namespace-body }
18502 extension-namespace-definition:
18503 namespace original-namespace-name { namespace-body }
18505 unnamed-namespace-definition:
18506 namespace { namespace-body } */
18508 static void
18510 {
18511 tree identifier;
18520 {
18523 }
18525 /* Look for the `namespace' keyword. */
18526 cp_token* token
18529 /* Parse any specified attributes before the identifier. */
18533 {
18537 {
18540 /* Parse any attributes specified after the identifier. */
18542 }
18549 "nested namespace definitions only available with "
18552 /* Nested namespace names can create new namespaces (unlike
18553 other qualified-ids). */
18556 else
18559 }
18571 /* Start the namespace. */
18578 /* Look for the `{' to validate starting the namespace. */
18579 matching_braces braces;
18581 {
18582 /* Parse the body of the namespace. */
18585 /* Look for the final `}'. */
18587 }
18592 /* Pop the nested namespace definitions. */
18595 }
18597 /* Parse a namespace-body.
18599 namespace-body:
18600 declaration-seq [opt] */
18602 static void
18604 {
18606 }
18608 /* Parse a namespace-alias-definition.
18610 namespace-alias-definition:
18611 namespace identifier = qualified-namespace-specifier ; */
18613 static void
18615 {
18616 tree identifier;
18617 tree namespace_specifier;
18621 /* Look for the `namespace' keyword. */
18623 /* Look for the identifier. */
18627 /* Look for the `=' token. */
18630 {
18632 /* Skip the definition. */
18637 }
18639 /* Look for the qualified-namespace-specifier. */
18640 namespace_specifier
18642 /* Look for the `;' token. */
18645 /* Register the alias in the symbol table. */
18647 }
18649 /* Parse a qualified-namespace-specifier.
18651 qualified-namespace-specifier:
18652 :: [opt] nested-name-specifier [opt] namespace-name
18654 Returns a NAMESPACE_DECL corresponding to the specified
18655 namespace. */
18657 static tree
18659 {
18660 /* Look for the optional `::'. */
18664 /* Look for the optional nested-name-specifier. */
18672 }
18674 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18675 access declaration.
18677 using-declaration:
18678 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18679 using :: unqualified-id ;
18681 access-declaration:
18682 qualified-id ;
18684 */
18686 static bool
18689 {
18693 tree decl;
18694 tree identifier;
18695 tree qscope;
18700 {
18703 }
18704 else
18705 {
18706 /* Look for the `using' keyword. */
18709 again:
18710 /* Peek at the next token. */
18712 /* See if it's `typename'. */
18714 {
18715 /* Remember that we've seen it. */
18717 /* Consume the `typename' token. */
18719 }
18720 }
18722 /* Look for the optional global scope qualification. */
18723 global_scope_p
18728 /* If we saw `typename', or didn't see `::', then there must be a
18729 nested-name-specifier present. */
18731 {
18737 {
18740 }
18741 }
18742 /* Otherwise, we could be in either of the two productions. In that
18743 case, treat the nested-name-specifier as optional. */
18744 else
18756 /* Something has already gone wrong; there's no need to parse
18757 further. Since an error has occurred, the return value of
18758 cp_parser_parse_definitely will be false, as required. */
18762 /* Parse the unqualified-id. */
18770 {
18775 }
18777 {
18782 "pack expansion in using-declaration only available "
18785 }
18787 /* The function we call to handle a using-declaration is different
18788 depending on what scope we are in. */
18790 ;
18793 /* [namespace.udecl]
18795 A using declaration shall not name a template-id. */
18798 else
18799 {
18801 {
18802 /* Create the USING_DECL. */
18809 {
18812 }
18813 else
18814 /* Add it to the list of members in this class. */
18816 }
18817 else
18818 {
18820 identifier,
18827 {
18830 }
18833 else
18835 }
18836 }
18840 {
18844 "comma-separated list in using-declaration only available "
18847 }
18849 /* Look for the final `;'. */
18854 "access declarations are deprecated "
18855 "in favour of using-declarations; "
18859 }
18861 /* Parse an alias-declaration.
18863 alias-declaration:
18864 using identifier attribute-specifier-seq [opt] = type-id */
18866 static tree
18868 {
18870 location_t id_location;
18872 cp_decl_specifier_seq decl_specs;
18876 /* Look for the `using' keyword. */
18877 cp_token *using_token
18899 /* Now we are going to parse the type-id of the declaration. */
18901 /*
18902 [dcl.type]/3 says:
18904 "A type-specifier-seq shall not define a class or enumeration
18905 unless it appears in the type-id of an alias-declaration (7.1.3) that
18906 is not the declaration of a template-declaration."
18908 In other words, if we currently are in an alias template, the
18909 type-id should not define a type.
18911 So let's set parser->type_definition_forbidden_message in that
18912 case; cp_parser_check_type_definition (called by
18913 cp_parser_class_specifier) will then emit an error if a type is
18914 defined in the type-id. */
18916 {
18920 }
18924 /* Restore the error message if need be. */
18930 {
18933 }
18935 /* A typedef-name can also be introduced by an alias-declaration. The
18936 identifier following the using keyword becomes a typedef-name. It has
18937 the same semantics as if it were introduced by the typedef
18938 specifier. In particular, it does not define a new type and it shall
18939 not appear in the type-id. */
18944 {
18947 ds_attribute,
18948 attrs_token);
18949 }
18951 ds_typedef,
18952 using_token);
18954 ds_alias,
18955 using_token);
18961 id_location,
18972 else
18978 // Attach constraints to the alias declaration.
18980 {
18984 }
18991 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18992 added into the symbol table; otherwise, return the TYPE_DECL. */
18996 {
19000 }
19003 }
19005 /* Parse a using-directive.
19007 using-directive:
19008 using namespace :: [opt] nested-name-specifier [opt]
19009 namespace-name ; */
19011 static void
19013 {
19014 tree namespace_decl;
19015 tree attribs;
19017 /* Look for the `using' keyword. */
19019 /* And the `namespace' keyword. */
19021 /* Look for the optional `::' operator. */
19023 /* And the optional nested-name-specifier. */
19029 /* Get the namespace being used. */
19031 /* And any specified attributes. */
19034 /* Update the symbol table. */
19037 else
19040 /* Look for the final `;'. */
19042 }
19044 /* Parse an asm-definition.
19046 asm-definition:
19047 asm ( string-literal ) ;
19049 GNU Extension:
19051 asm-definition:
19052 asm volatile [opt] ( string-literal ) ;
19053 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19054 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19055 : asm-operand-list [opt] ) ;
19056 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19057 : asm-operand-list [opt]
19058 : asm-clobber-list [opt] ) ;
19059 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19060 : asm-clobber-list [opt]
19061 : asm-goto-list ) ; */
19063 static void
19065 {
19066 tree string;
19071 tree asm_stmt;
19079 /* Look for the `asm' keyword. */
19084 {
19087 }
19089 /* See if the next token is `volatile'. */
19092 {
19093 /* Remember that we saw the `volatile' keyword. */
19095 /* Consume the token. */
19097 }
19101 {
19102 /* Remember that we saw the `goto' keyword. */
19104 /* Consume the token. */
19106 }
19107 /* Look for the opening `('. */
19110 /* Look for the string. */
19113 {
19117 }
19119 /* If we're allowing GNU extensions, check for the extended assembly
19120 syntax. Unfortunately, the `:' tokens need not be separated by
19121 a space in C, and so, for compatibility, we tolerate that here
19122 too. Doing that means that we have to treat the `::' operator as
19123 two `:' tokens. */
19128 {
19133 /* The extended syntax was used. */
19136 /* Look for outputs. */
19138 {
19139 /* Consume the `:'. */
19141 /* Parse the output-operands. */
19143 CPP_COLON)
19145 CPP_SCOPE)
19147 CPP_CLOSE_PAREN)
19149 {
19153 }
19154 }
19155 /* If the next token is `::', there are no outputs, and the
19156 next token is the beginning of the inputs. */
19158 /* The inputs are coming next. */
19161 /* Look for inputs. */
19164 {
19165 /* Consume the `:' or `::'. */
19167 /* Parse the output-operands. */
19169 CPP_COLON)
19171 CPP_SCOPE)
19173 CPP_CLOSE_PAREN))
19174 {
19178 }
19179 }
19181 /* The clobbers are coming next. */
19184 /* Look for clobbers. */
19187 {
19189 /* Consume the `:' or `::'. */
19191 /* Parse the clobbers. */
19193 CPP_COLON)
19195 CPP_CLOSE_PAREN))
19197 }
19200 /* The labels are coming next. */
19203 /* Look for labels. */
19206 {
19208 /* Consume the `:' or `::'. */
19210 /* Parse the labels. */
19212 }
19216 }
19220 /* Look for the closing `)'. */
19228 {
19229 /* Create the ASM_EXPR. */
19231 {
19234 /* If the extended syntax was not used, mark the ASM_EXPR. */
19236 {
19242 }
19243 }
19244 else
19246 }
19247 }
19249 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19250 type that comes from the decl-specifier-seq. */
19252 static tree
19254 {
19257 {
19270 }
19273 }
19275 /* Declarators [gram.dcl.decl] */
19277 /* Parse an init-declarator.
19279 init-declarator:
19280 declarator initializer [opt]
19282 GNU Extension:
19284 init-declarator:
19285 declarator asm-specification [opt] attributes [opt] initializer [opt]
19287 function-definition:
19288 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19289 function-body
19290 decl-specifier-seq [opt] declarator function-try-block
19292 GNU Extension:
19294 function-definition:
19295 __extension__ function-definition
19297 TM Extension:
19299 function-definition:
19300 decl-specifier-seq [opt] declarator function-transaction-block
19302 The DECL_SPECIFIERS apply to this declarator. Returns a
19303 representation of the entity declared. If MEMBER_P is TRUE, then
19304 this declarator appears in a class scope. The new DECL created by
19305 this declarator is returned.
19307 The CHECKS are access checks that should be performed once we know
19308 what entity is being declared (and, therefore, what classes have
19309 befriended it).
19311 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19312 for a function-definition here as well. If the declarator is a
19313 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19314 be TRUE upon return. By that point, the function-definition will
19315 have been completely parsed.
19317 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19318 is FALSE.
19320 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19321 parsed declaration if it is an uninitialized single declarator not followed
19322 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19323 if present, will not be consumed. If returned, this declarator will be
19324 created with SD_INITIALIZED but will not call cp_finish_decl.
19326 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19327 and there is an initializer, the pointed location_t is set to the
19328 location of the '=' or `(', or '{' in C++11 token introducing the
19329 initializer. */
19331 static tree
19342 {
19346 tree prefix_attributes;
19348 tree asm_specification;
19349 tree initializer;
19351 tree scope;
19353 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19354 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19355 "(...)". */
19366 /* Gather the attributes that were provided with the
19367 decl-specifiers. */
19370 /* Assume that this is not the declarator for a function
19371 definition. */
19375 /* Default arguments are only permitted for function parameters. */
19379 /* Defer access checks while parsing the declarator; we cannot know
19380 what names are accessible until we know what is being
19381 declared. */
19386 /* Parse the declarator. */
19387 declarator
19392 /* Gather up the deferred checks. */
19397 /* If the DECLARATOR was erroneous, there's no need to go
19398 further. */
19402 /* Check that the number of template-parameter-lists is OK. */
19412 /* Figure out what scope the entity declared by the DECLARATOR is
19413 located in. `grokdeclarator' sometimes changes the scope, so
19414 we compute it now. */
19417 /* Perform any lookups in the declared type which were thought to be
19418 dependent, but are not in the scope of the declarator. */
19419 decl_specifiers->type
19422 /* If we're allowing GNU extensions, look for an
19423 asm-specification. */
19425 {
19426 /* Look for an asm-specification. */
19429 }
19430 else
19433 /* Look for attributes. */
19437 /* Peek at the next token. */
19443 {
19444 /* Handle C++17 deduction guides. */
19448 {
19456 {
19460 }
19461 }
19463 /* Check to see if the token indicates the start of a
19464 function-definition. */
19466 {
19468 {
19469 /* If a function-definition should not appear here, issue an
19470 error message. */
19474 }
19476 location_t func_brace_location
19479 /* Neither attributes nor an asm-specification are allowed
19480 on a function-definition. */
19483 "an asm-specification is not allowed "
19487 "attributes are not allowed "
19489 /* This is a function-definition. */
19492 /* Parse the function definition. */
19495 decl_specifiers,
19496 declarator,
19497 prefix_attributes);
19498 else
19499 decl =
19500 (cp_parser_function_definition_from_specifiers_and_declarator
19504 {
19505 /* This is where the prologue starts... */
19508 }
19511 }
19512 }
19514 {
19515 /* A non-template declaration involving a function parameter list
19516 containing an implicit template parameter will be made into a
19517 template. If the resulting declaration is not going to be an
19518 actual function then finish the template scope here to prevent it.
19519 An error message will be issued once we have a decl to talk about.
19521 FIXME probably we should do type deduction rather than create an
19522 implicit template, but the standard currently doesn't allow it. */
19525 }
19527 /* [dcl.dcl]
19529 Only in function declarations for constructors, destructors, type
19530 conversions, and deduction guides can the decl-specifier-seq be omitted.
19532 We explicitly postpone this check past the point where we handle
19533 function-definitions because we tolerate function-definitions
19534 that are missing their return types in some modes. */
19536 {
19540 }
19542 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19546 {
19557 {
19563 }
19564 }
19565 else
19566 {
19567 /* If the init-declarator isn't initialized and isn't followed by a
19568 `,' or `;', it's not a valid init-declarator. */
19571 {
19574 else
19575 {
19579 }
19580 }
19583 }
19585 /* Because start_decl has side-effects, we should only call it if we
19586 know we're going ahead. By this point, we know that we cannot
19587 possibly be looking at any other construct. */
19590 /* Enter the newly declared entry in the symbol table. If we're
19591 processing a declaration in a class-specifier, we wait until
19592 after processing the initializer. */
19594 {
19602 /* Adjust location of decl if declarator->id_loc is more appropriate:
19603 set, and decl wasn't merged with another decl, in which case its
19604 location would be different from input_location, and more accurate. */
19609 }
19611 /* Enter the SCOPE. That way unqualified names appearing in the
19612 initializer will be looked up in SCOPE. */
19615 /* Perform deferred access control checks, now that we know in which
19616 SCOPE the declared entity resides. */
19618 {
19621 /* If the entity being declared is a function, pretend that we
19622 are in its scope. If it is a `friend', it may have access to
19623 things that would not otherwise be accessible. */
19625 {
19628 }
19630 /* Perform access checks for template parameters. */
19633 /* Perform the access control checks for the declarator and the
19634 decl-specifiers. */
19637 /* Restore the saved value. */
19640 }
19642 /* Parse the initializer. */
19647 {
19649 {
19652 else
19653 {
19654 /* If the declaration was erroneous, we don't really
19655 know what the user intended, so just silently
19656 consume the initializer. */
19663 }
19664 }
19665 else
19666 {
19667 /* We want to record the extra mangling scope for in-class
19668 initializers of class members and initializers of static data
19669 member templates. The former involves deferring
19670 parsing of the initializer until end of class as with default
19671 arguments. So right here we only handle the latter. */
19681 }
19682 }
19684 /* The old parser allows attributes to appear after a parenthesized
19685 initializer. Mark Mitchell proposed removing this functionality
19686 on the GCC mailing lists on 2002-08-13. This parser accepts the
19687 attributes -- but ignores them. Made a permerror in GCC 8. */
19693 {
19696 {
19700 }
19701 }
19703 /* And now complain about a non-function implicit template. */
19708 /* For an in-class declaration, use `grokfield' to create the
19709 declaration. */
19711 {
19713 {
19716 }
19725 }
19727 /* Finish processing the declaration. But, skip member
19728 declarations. */
19730 {
19733 asm_specification,
19734 /* If the initializer is in parentheses, then this is
19735 a direct-initialization, which means that an
19736 `explicit' constructor is OK. Otherwise, an
19737 `explicit' constructor cannot be used. */
19740 }
19743 /* Core issue #226 (C++0x only): A default template-argument
19744 shall not be specified in a friend class template
19745 declaration. */
19754 {
19757 else
19759 }
19766 }
19768 /* Parse a declarator.
19770 declarator:
19771 direct-declarator
19772 ptr-operator declarator
19774 abstract-declarator:
19775 ptr-operator abstract-declarator [opt]
19776 direct-abstract-declarator
19778 GNU Extensions:
19780 declarator:
19781 attributes [opt] direct-declarator
19782 attributes [opt] ptr-operator declarator
19784 abstract-declarator:
19785 attributes [opt] ptr-operator abstract-declarator [opt]
19786 attributes [opt] direct-abstract-declarator
19788 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19789 detect constructors, destructors, deduction guides, or conversion operators.
19790 It is set to -1 if the declarator is a name, and +1 if it is a
19791 function. Otherwise it is set to zero. Usually you just want to
19792 test for >0, but internally the negative value is used.
19794 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19795 a decl-specifier-seq unless it declares a constructor, destructor,
19796 or conversion. It might seem that we could check this condition in
19797 semantic analysis, rather than parsing, but that makes it difficult
19798 to handle something like `f()'. We want to notice that there are
19799 no decl-specifiers, and therefore realize that this is an
19800 expression, not a declaration.)
19802 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19803 the declarator is a direct-declarator of the form "(...)".
19805 MEMBER_P is true iff this declarator is a member-declarator.
19807 FRIEND_P is true iff this declarator is a friend. */
19811 cp_parser_declarator_kind dcl_kind,
19815 {
19818 cp_cv_quals cv_quals;
19819 tree class_type;
19822 /* Assume this is not a constructor, destructor, or type-conversion
19823 operator. */
19830 /* Check for the ptr-operator production. */
19832 /* Parse the ptr-operator. */
19838 /* If that worked, then we have a ptr-operator. */
19840 {
19841 /* If a ptr-operator was found, then this declarator was not
19842 parenthesized. */
19845 /* The dependent declarator is optional if we are parsing an
19846 abstract-declarator. */
19850 /* Parse the dependent declarator. */
19855 friend_p);
19857 /* If we are parsing an abstract-declarator, we must handle the
19858 case where the dependent declarator is absent. */
19863 declarator = cp_parser_make_indirect_declarator
19865 }
19866 /* Everything else is a direct-declarator. */
19867 else
19868 {
19871 CPP_OPEN_PAREN);
19873 ctor_dtor_or_conv_p,
19875 }
19880 }
19882 /* Parse a direct-declarator or direct-abstract-declarator.
19884 direct-declarator:
19885 declarator-id
19886 direct-declarator ( parameter-declaration-clause )
19887 cv-qualifier-seq [opt]
19888 ref-qualifier [opt]
19889 exception-specification [opt]
19890 direct-declarator [ constant-expression [opt] ]
19891 ( declarator )
19893 direct-abstract-declarator:
19894 direct-abstract-declarator [opt]
19895 ( parameter-declaration-clause )
19896 cv-qualifier-seq [opt]
19897 ref-qualifier [opt]
19898 exception-specification [opt]
19899 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19900 ( abstract-declarator )
19902 Returns a representation of the declarator. DCL_KIND is
19903 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19904 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19905 we are parsing a direct-declarator. It is
19906 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19907 of ambiguity we prefer an abstract declarator, as per
19908 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19909 as for cp_parser_declarator. */
19913 cp_parser_declarator_kind dcl_kind,
19916 {
19927 {
19928 /* Peek at the next token. */
19931 {
19932 /* This is either a parameter-declaration-clause, or a
19933 parenthesized declarator. When we know we are parsing a
19934 named declarator, it must be a parenthesized declarator
19935 if FIRST is true. For instance, `(int)' is a
19936 parameter-declaration-clause, with an omitted
19937 direct-abstract-declarator. But `((*))', is a
19938 parenthesized abstract declarator. Finally, when T is a
19939 template parameter `(T)' is a
19940 parameter-declaration-clause, and not a parenthesized
19941 named declarator.
19943 We first try and parse a parameter-declaration-clause,
19944 and then try a nested declarator (if FIRST is true).
19946 It is not an error for it not to be a
19947 parameter-declaration-clause, even when FIRST is
19948 false. Consider,
19950 int i (int);
19951 int i (3);
19953 The first is the declaration of a function while the
19954 second is the definition of a variable, including its
19955 initializer.
19957 Having seen only the parenthesis, we cannot know which of
19958 these two alternatives should be selected. Even more
19959 complex are examples like:
19961 int i (int (a));
19962 int i (int (3));
19964 The former is a function-declaration; the latter is a
19965 variable initialization.
19967 Thus again, we try a parameter-declaration-clause, and if
19968 that fails, we back out and return. */
19971 {
19972 tree params;
19977 /* In a member-declarator, the only valid interpretation
19978 of a parenthesis is the start of a
19979 parameter-declaration-clause. (It is invalid to
19980 initialize a static data member with a parenthesized
19981 initializer; only the "=" form of initialization is
19982 permitted.) */
19986 /* Consume the `('. */
19987 matching_parens parens;
19990 {
19991 /* If this is going to be an abstract declarator, we're
19992 in a declarator and we can't have default args. */
19995 }
19999 /* Parse the parameter-declaration-clause. */
20002 /* Consume the `)'. */
20005 /* If all went well, parse the cv-qualifier-seq,
20006 ref-qualifier and the exception-specification. */
20008 {
20009 cp_cv_quals cv_quals;
20010 cp_virt_specifiers virt_specifiers;
20011 cp_ref_qualifier ref_qual;
20012 tree exception_specification;
20013 tree late_return;
20014 tree attrs;
20024 /* Parse the cv-qualifier-seq. */
20026 /* Parse the ref-qualifier. */
20028 /* Parse the tx-qualifier. */
20030 /* And the exception-specification. */
20031 exception_specification
20036 /* In here, we handle cases where attribute is used after
20037 the function declaration. For example:
20038 void func (int x) __attribute__((vector(..))); */
20041 late_return = (cp_parser_late_return_type_opt
20045 /* Parse the virt-specifier-seq. */
20048 /* Create the function-declarator. */
20050 params,
20051 cv_quals,
20052 virt_specifiers,
20053 ref_qual,
20054 tx_qual,
20055 exception_specification,
20056 late_return,
20057 requires_clause);
20060 /* Any subsequent parameter lists are to do with
20061 return type, so are not those of the declared
20062 function. */
20064 }
20066 /* Remove the function parms from scope. */
20070 /* Repeat the main loop. */
20072 }
20074 /* If this is the first, we can try a parenthesized
20075 declarator. */
20077 {
20084 /* Consume the `('. */
20085 matching_parens parens;
20087 /* Parse the nested declarator. */
20090 declarator
20096 /* Expect a `)'. */
20104 }
20105 /* Otherwise, we must be done. */
20106 else
20108 }
20112 {
20113 /* Parse an array-declarator. */
20123 /* Consume the `['. */
20125 /* Peek at the next token. */
20127 /* If the next token is `]', then there is no
20128 constant-expression. */
20130 {
20132 bounds
20142 {
20143 /* Normally, the array bound must be an integral constant
20144 expression. However, as an extension, we allow VLAs
20145 in function scopes as long as they aren't part of a
20146 parameter declaration. */
20150 }
20153 {
20154 /* Remember this wasn't a constant-expression. */
20157 }
20158 }
20159 else
20161 /* Look for the closing `]'. */
20163 {
20166 }
20171 }
20173 {
20174 {
20175 tree qualifying_scope;
20176 tree unqualified_name;
20177 tree attrs;
20178 special_function_kind sfk;
20183 /* Parse a declarator-id */
20186 {
20189 /* If we see an ellipsis, we should be looking at a
20190 parameter pack. */
20192 {
20193 /* Consume the `...' */
20197 }
20198 }
20201 unqualified_name
20205 {
20209 {
20210 /* Check whether an error occurred. */
20213 /* We already consumed the ellipsis to mark a
20214 parameter pack, but we have no way to report it,
20215 so abort the tentative parse. We will be exiting
20216 immediately anyway. */
20218 }
20219 else
20225 && (qualifying_scope
20227 {
20230 }
20231 }
20236 {
20241 }
20247 {
20248 /* In the declaration of a member of a template class
20249 outside of the class itself, the SCOPE will sometimes
20250 be a TYPENAME_TYPE. For example, given:
20252 template <typename T>
20253 int S<T>::R::i = 3;
20255 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20256 this context, we must resolve S<T>::R to an ordinary
20257 type, rather than a typename type.
20259 The reason we normally avoid resolving TYPENAME_TYPEs
20260 is that a specialization of `S' might render
20261 `S<T>::R' not a type. However, if `S' is
20262 specialized, then this `i' will not be used, so there
20263 is no harm in resolving the types here. */
20264 tree type;
20266 /* Resolve the TYPENAME_TYPE. */
20269 /* If that failed, the declarator is invalid. */
20271 {
20274 "cannot define member of dependent typedef "
20276 else
20281 }
20283 }
20288 {
20289 tree class_type;
20294 else
20298 {
20302 {
20303 /* We do not attempt to print the declarator
20304 here because we do not have enough
20305 information about its original syntactic
20306 form. */
20310 }
20313 {
20317 "use %<%T::%D%> instead of %<%T::%D%> to "
20319 class_type,
20324 }
20326 }
20329 {
20336 for an unnamed type, even if the type
20337 got a name for linkage purposes. */
20339 /* Handle correctly (c++/19200):
20341 struct S {
20342 struct T{};
20343 friend void S(T);
20344 };
20346 and also:
20348 namespace N {
20349 void S();
20350 }
20352 struct S {
20353 friend void N::S();
20354 }; */
20357 class_type))
20366 }
20367 }
20369 unqualified_name,
20370 sfk);
20377 }
20379 handle_declarator:;
20382 {
20383 /* Any names that appear after the declarator-id for a
20384 member are looked up in the containing scope. */
20386 {
20387 /* But declarations with qualified-ids can't appear in a
20388 function. */
20392 }
20394 }
20398 /* Default args are only allowed on function
20399 declarations. */
20401 else
20405 }
20406 /* We're done. */
20407 else
20409 }
20411 /* For an abstract declarator, we might wind up with nothing at this
20412 point. That's an error; the declarator is not optional. */
20416 {
20417 /* Record overly parenthesized declarator so we can give a
20418 diagnostic about confusing decl/expr disambiguation. */
20420 {
20421 /* If the open and close parens are on different lines, this
20422 is probably a formatting thing, so ignore. */
20427 }
20430 }
20432 /* If we entered a scope, we must exit it now. */
20440 }
20442 /* Parse a ptr-operator.
20444 ptr-operator:
20445 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20446 * cv-qualifier-seq [opt]
20447 &
20448 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20449 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20451 GNU Extension:
20453 ptr-operator:
20454 & cv-qualifier-seq [opt]
20456 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20457 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20458 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20459 filled in with the TYPE containing the member. *CV_QUALS is
20460 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20461 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20462 Note that the tree codes returned by this function have nothing
20463 to do with the types of trees that will be eventually be created
20464 to represent the pointer or reference type being parsed. They are
20465 just constants with suggestive names. */
20466 static enum tree_code
20471 {
20476 /* Assume that it's not a pointer-to-member. */
20478 /* And that there are no cv-qualifiers. */
20481 /* Peek at the next token. */
20484 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20494 {
20495 /* Consume the `*', `&' or `&&'. */
20498 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20499 `&', if we are allowing GNU extensions. (The only qualifier
20500 that can legally appear after `&' is `restrict', but that is
20501 enforced during semantic analysis. */
20509 }
20510 else
20511 {
20512 /* Try the pointer-to-member case. */
20514 /* Look for the optional `::' operator. */
20517 /* Look for the nested-name specifier. */
20524 /* If we found it, and the next token is a `*', then we are
20525 indeed looking at a pointer-to-member operator. */
20528 {
20529 /* Indicate that the `*' operator was used. */
20537 else
20538 {
20539 /* The type of which the member is a member is given by the
20540 current SCOPE. */
20542 /* The next name will not be qualified. */
20546 /* Look for optional c++11 attributes. */
20550 /* Look for the optional cv-qualifier-seq. */
20552 }
20553 }
20554 /* If that didn't work we don't have a ptr-operator. */
20557 }
20560 }
20562 /* Parse an (optional) cv-qualifier-seq.
20564 cv-qualifier-seq:
20565 cv-qualifier cv-qualifier-seq [opt]
20567 cv-qualifier:
20568 const
20569 volatile
20571 GNU Extension:
20573 cv-qualifier:
20574 __restrict__
20576 Returns a bitmask representing the cv-qualifiers. */
20578 static cp_cv_quals
20580 {
20584 {
20586 cp_cv_quals cv_qualifier;
20588 /* Peek at the next token. */
20590 /* See if it's a cv-qualifier. */
20592 {
20608 }
20614 {
20619 }
20620 else
20621 {
20624 }
20625 }
20628 }
20630 /* Parse an (optional) ref-qualifier
20632 ref-qualifier:
20633 &
20634 &&
20636 Returns cp_ref_qualifier representing ref-qualifier. */
20638 static cp_ref_qualifier
20640 {
20643 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20648 {
20653 {
20665 }
20670 {
20673 }
20674 else
20675 {
20678 }
20679 }
20682 }
20684 /* Parse an optional tx-qualifier.
20686 tx-qualifier:
20687 transaction_safe
20688 transaction_safe_dynamic */
20690 static tree
20692 {
20695 {
20700 {
20704 {
20707 {
20710 }
20711 else
20713 }
20714 }
20715 }
20717 }
20719 /* Parse an (optional) virt-specifier-seq.
20721 virt-specifier-seq:
20722 virt-specifier virt-specifier-seq [opt]
20724 virt-specifier:
20725 override
20726 final
20728 Returns a bitmask representing the virt-specifiers. */
20730 static cp_virt_specifiers
20732 {
20736 {
20738 cp_virt_specifiers virt_specifier;
20740 /* Peek at the next token. */
20742 /* See if it's a virt-specifier-qualifier. */
20746 {
20749 }
20751 {
20754 }
20756 {
20758 }
20759 else
20763 {
20768 }
20769 else
20770 {
20773 }
20774 }
20776 }
20778 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20779 is in scope even though it isn't real. */
20781 void
20783 {
20784 tree this_parm;
20787 {
20788 /* We don't clear this between NSDMIs. Is it already what we want? */
20795 }
20798 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20800 current_class_ref
20803 }
20805 /* Return true iff our current scope is a non-static data member
20806 initializer. */
20808 bool
20810 {
20811 /* We recognize NSDMI context by the context-less 'this' pointer set up
20812 by the function above. */
20818 }
20820 /* Parse a late-specified return type, if any. This is not a separate
20821 non-terminal, but part of a function declarator, which looks like
20823 -> trailing-type-specifier-seq abstract-declarator(opt)
20825 Returns the type indicated by the type-id.
20827 In addition to this, parse any queued up #pragma omp declare simd
20828 clauses, and #pragma acc routine clauses.
20830 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20831 function. */
20833 static tree
20836 {
20840 && declarator
20844 && declarator
20847 /* Peek at the next token. */
20849 /* A late-specified return type is indicated by an initial '->'. */
20860 {
20861 /* DR 1207: 'this' is in scope in the trailing return type. */
20863 }
20866 {
20867 /* Consume the ->. */
20871 }
20873 /* Function declarations may be followed by a trailing
20874 requires-clause. */
20878 declarator->attributes
20882 declarator->attributes
20887 {
20890 }
20893 }
20895 /* Parse a declarator-id.
20897 declarator-id:
20898 id-expression
20899 :: [opt] nested-name-specifier [opt] type-name
20901 In the `id-expression' case, the value returned is as for
20902 cp_parser_id_expression if the id-expression was an unqualified-id.
20903 If the id-expression was a qualified-id, then a SCOPE_REF is
20904 returned. The first operand is the scope (either a NAMESPACE_DECL
20905 or TREE_TYPE), but the second is still just a representation of an
20906 unqualified-id. */
20908 static tree
20910 {
20911 tree id;
20912 /* The expression must be an id-expression. Assume that qualified
20913 names are the names of types so that:
20915 template <class T>
20916 int S<T>::R::i = 3;
20918 will work; we must treat `S<T>::R' as the name of a type.
20919 Similarly, assume that qualified names are templates, where
20920 required, so that:
20922 template <class T>
20923 int S<T>::R<T>::i = 3;
20925 will work, too. */
20931 optional_p);
20935 }
20937 /* Parse a type-id.
20939 type-id:
20940 type-specifier-seq abstract-declarator [opt]
20942 Returns the TYPE specified. */
20944 static tree
20947 {
20948 cp_decl_specifier_seq type_specifier_seq;
20951 /* Parse the type-specifier-seq. */
20953 is_trailing_return,
20958 /* A bare template name as a template argument is a template template
20959 argument, not a placeholder, so fail parsing it as a type argument. */
20960 {
20964 }
20968 /* There might or might not be an abstract declarator. */
20970 /* Look for the declarator. */
20971 abstract_declarator
20976 /* Check to see if there really was a declarator. */
20981 /* The concepts TS allows 'auto' as a type-id. */
20983 /* None of the valid uses of 'auto' in C++14 involve the type-id
20984 nonterminal, but it is valid in a trailing-return-type. */
20987 {
20988 /* A type-id with type 'auto' is only ok if the abstract declarator
20989 is a function declarator with a late-specified return type.
20991 A type-id with 'auto' is also valid in a trailing-return-type
20992 in a compound-requirement. */
20999 else
21000 {
21003 {
21005 auto_node);
21007 tmpl);
21008 }
21009 else
21012 }
21013 }
21016 is_template_arg);
21017 }
21019 static tree
21021 {
21023 }
21025 static tree
21027 {
21028 tree r;
21030 parser->type_definition_forbidden_message
21035 {
21038 }
21040 }
21042 static tree
21044 {
21046 }
21048 /* Parse a type-specifier-seq.
21050 type-specifier-seq:
21051 type-specifier type-specifier-seq [opt]
21053 GNU extension:
21055 type-specifier-seq:
21056 attributes type-specifier-seq [opt]
21058 If IS_DECLARATION is true, we are at the start of a "condition" or
21059 exception-declaration, so we might be followed by a declarator-id.
21061 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21062 i.e. we've just seen "->".
21064 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21066 static void
21071 {
21076 /* Clear the TYPE_SPECIFIER_SEQ. */
21079 /* In the context of a trailing return type, enum E { } is an
21080 elaborated-type-specifier followed by a function-body, not an
21081 enum-specifier. */
21085 /* Parse the type-specifiers and attributes. */
21087 {
21088 tree type_specifier;
21091 /* Check for attributes first. */
21093 {
21094 type_specifier_seq->attributes
21098 }
21100 /* record the token of the beginning of the type specifier seq,
21101 for error reporting purposes*/
21105 /* Look for the type-specifier. */
21107 flags,
21108 type_specifier_seq,
21110 NULL,
21113 {
21114 /* If the first type-specifier could not be found, this is not a
21115 type-specifier-seq at all. */
21117 {
21118 /* Set in_declarator_p to avoid skipping to the semicolon. */
21130 }
21131 /* If subsequent type-specifiers could not be found, the
21132 type-specifier-seq is complete. */
21134 }
21137 /* The standard says that a condition can be:
21139 type-specifier-seq declarator = assignment-expression
21141 However, given:
21143 struct S {};
21144 if (int S = ...)
21146 we should treat the "S" as a declarator, not as a
21147 type-specifier. The standard doesn't say that explicitly for
21148 type-specifier-seq, but it does say that for
21149 decl-specifier-seq in an ordinary declaration. Perhaps it
21150 would be clearer just to allow a decl-specifier-seq here, and
21151 then add a semantic restriction that if any decl-specifiers
21152 that are not type-specifiers appear, the program is invalid. */
21155 }
21156 }
21158 /* Return whether the function currently being declared has an associated
21159 template parameter list. */
21161 static bool
21163 {
21176 }
21178 /* Parse a parameter-declaration-clause.
21180 parameter-declaration-clause:
21181 parameter-declaration-list [opt] ... [opt]
21182 parameter-declaration-list , ...
21184 Returns a representation for the parameter declarations. A return
21185 value of NULL indicates a parameter-declaration-clause consisting
21186 only of an ellipsis. */
21188 static tree
21190 {
21191 tree parameters;
21200 && !processing_template_parmlist
21201 && !processing_explicit_instantiation
21202 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21203 actual function or a random abstract declarator. */
21209 /* Peek at the next token. */
21211 /* Check for trivial parameter-declaration-clauses. */
21213 {
21214 /* Consume the `...' token. */
21217 }
21219 /* There are no parameters. */
21220 {
21221 #ifndef NO_IMPLICIT_EXTERN_C
21226 else
21227 #endif
21229 }
21230 /* Check for `(void)', too, which is a special case. */
21234 {
21235 /* Consume the `void' token. */
21237 /* There are no parameters. */
21239 }
21241 /* Parse the parameter-declaration-list. */
21243 /* If a parse error occurred while parsing the
21244 parameter-declaration-list, then the entire
21245 parameter-declaration-clause is erroneous. */
21249 /* Peek at the next token. */
21251 /* If it's a `,', the clause should terminate with an ellipsis. */
21253 {
21254 /* Consume the `,'. */
21256 /* Expect an ellipsis. */
21257 ellipsis_p
21259 }
21260 /* It might also be `...' if the optional trailing `,' was
21261 omitted. */
21263 {
21264 /* Consume the `...' token. */
21266 /* And remember that we saw it. */
21268 }
21269 else
21272 /* Finish the parameter list. */
21277 }
21279 /* Parse a parameter-declaration-list.
21281 parameter-declaration-list:
21282 parameter-declaration
21283 parameter-declaration-list , parameter-declaration
21285 Returns a representation of the parameter-declaration-list, as for
21286 cp_parser_parameter_declaration_clause. However, the
21287 `void_list_node' is never appended to the list. Upon return,
21288 *IS_ERROR will be true iff an error occurred. */
21290 static tree
21292 {
21298 /* Assume all will go well. */
21300 /* The special considerations that apply to a function within an
21301 unbraced linkage specifications do not apply to the parameters
21302 to the function. */
21303 saved_in_unbraced_linkage_specification_p
21307 /* Look for more parameters. */
21309 {
21314 /* Parse the parameter. */
21315 parameter
21320 /* We don't know yet if the enclosing context is deprecated, so wait
21321 and warn in grokparms if appropriate. */
21325 {
21328 PARM,
21333 }
21337 /* If a parse error occurred parsing the parameter declaration,
21338 then the entire parameter-declaration-list is erroneous. */
21340 {
21344 }
21354 {
21358 }
21360 /* Add the new parameter to the list. */
21364 /* Peek at the next token. */
21367 /* These are for Objective-C++ */
21370 /* The parameter-declaration-list is complete. */
21373 {
21376 /* Peek at the next token. */
21378 /* If it's an ellipsis, then the list is complete. */
21381 /* Otherwise, there must be more parameters. Consume the
21382 `,'. */
21384 /* When parsing something like:
21386 int i(float f, double d)
21388 we can tell after seeing the declaration for "f" that we
21389 are not looking at an initialization of a variable "i",
21390 but rather at the declaration of a function "i".
21392 Due to the fact that the parsing of template arguments
21393 (as specified to a template-id) requires backtracking we
21394 cannot use this technique when inside a template argument
21395 list. */
21399 /* However, a parameter-declaration of the form
21400 "float(f)" (which is a valid declaration of a
21401 parameter "f") can also be interpreted as an
21402 expression (the conversion of "f" to "float"). */
21405 }
21406 else
21407 {
21415 }
21416 }
21418 parser->in_unbraced_linkage_specification_p
21421 /* Reset implicit_template_scope if we are about to leave the function
21422 parameter list that introduced it. Note that for out-of-line member
21423 definitions, there will be one or more class scopes before we get to
21424 the template parameter scope. */
21428 {
21432 {
21435 }
21436 }
21439 }
21441 /* Parse a parameter declaration.
21443 parameter-declaration:
21444 decl-specifier-seq ... [opt] declarator
21445 decl-specifier-seq declarator = assignment-expression
21446 decl-specifier-seq ... [opt] abstract-declarator [opt]
21447 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21449 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21450 declares a template parameter. (In that case, a non-nested `>'
21451 token encountered during the parsing of the assignment-expression
21452 is not interpreted as a greater-than operator.)
21454 Returns a representation of the parameter, or NULL if an error
21455 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21456 true iff the declarator is of the form "(p)". */
21462 {
21464 cp_decl_specifier_seq decl_specifiers;
21466 tree default_argument;
21471 /* In a template parameter, `>' is not an operator.
21473 [temp.param]
21475 When parsing a default template-argument for a non-type
21476 template-parameter, the first non-nested `>' is taken as the end
21477 of the template parameter-list rather than a greater-than
21478 operator. */
21480 /* Type definitions may not appear in parameter types. */
21482 parser->type_definition_forbidden_message
21489 /* Parse the declaration-specifiers. */
21492 CP_PARSER_FLAGS_NONE,
21496 /* Complain about missing 'typename' or other invalid type names. */
21501 /* If an error occurred, there's no reason to attempt to parse the
21502 rest of the declaration. */
21504 {
21507 }
21509 /* Peek at the next token. */
21512 /* If the next token is a `)', `,', `=', `>', or `...', then there
21513 is no declarator. However, when variadic templates are enabled,
21514 there may be a declarator following `...'. */
21519 {
21523 }
21524 /* Otherwise, there should be a declarator. */
21525 else
21526 {
21530 /* After seeing a decl-specifier-seq, if the next token is not a
21531 "(", there is no possibility that the code is a valid
21532 expression. Therefore, if parsing tentatively, we commit at
21533 this point. */
21535 /* In an expression context, having seen:
21537 (int((char ...
21539 we cannot be sure whether we are looking at a
21540 function-type (taking a "char" as a parameter) or a cast
21541 of some object of type "char" to "int". */
21547 /* Parse the declarator. */
21550 CP_PARSER_DECLARATOR_EITHER,
21552 parenthesized_p,
21556 /* After the declarator, allow more attributes. */
21557 decl_specifiers.attributes
21561 /* If the declarator is a template parameter pack, remember that and
21562 clear the flag in the declarator itself so we don't get errors
21563 from grokdeclarator. */
21565 {
21568 }
21569 }
21571 /* If the next token is an ellipsis, and we have not seen a declarator
21572 name, and if either the type of the declarator contains parameter
21573 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21574 for, eg, abbreviated integral type names), then we actually have a
21575 parameter pack expansion expression. Otherwise, leave the ellipsis
21576 for a C-style variadic function. */
21579 /* If a function parameter pack was specified and an implicit template
21580 parameter was introduced during cp_parser_parameter_declaration,
21581 change any implicit parameters introduced into packs. */
21585 {
21593 }
21596 {
21607 {
21608 /* Consume the `...'. */
21612 /* Build a pack expansion type */
21617 else
21619 }
21620 }
21622 /* The restriction on defining new types applies only to the type
21623 of the parameter, not to the default argument. */
21626 /* If the next token is `=', then process a default argument. */
21628 {
21631 /* If we are defining a class, then the tokens that make up the
21632 default argument must be saved and processed later. */
21638 // A constrained-type-specifier may declare a type template-parameter.
21640 default_argument
21643 // A constrained-type-specifier may declare a template-template-parameter.
21645 default_argument
21648 /* Outside of a class definition, we can just parse the
21649 assignment-expression. */
21650 else
21651 default_argument
21655 {
21657 "default arguments are only "
21659 }
21661 || template_parameter_pack_p
21664 {
21665 /* Find the name of the parameter pack. */
21672 template_parm_p
21678 else
21680 template_parm_p
21687 }
21688 }
21689 else
21692 /* Generate a location for the parameter, ranging from the start of the
21693 initial token to the end of the final token (using input_location for
21694 the latter, set up by cp_lexer_set_source_position_from_token when
21695 consuming tokens).
21697 If we have a identifier, then use it for the caret location, e.g.
21699 extern int callee (int one, int (*two)(int, int), float three);
21700 ~~~~~~^~~~~~~~~~~~~~
21702 otherwise, reuse the start location for the caret location e.g.:
21704 extern int callee (int one, int (*)(int, int), float three);
21705 ^~~~~~~~~~~~~~~~~
21707 */
21713 input_location);
21716 declarator,
21717 default_argument,
21718 param_loc,
21719 template_parameter_pack_p);
21720 }
21722 /* Parse a default argument and return it.
21724 TEMPLATE_PARM_P is true if this is a default argument for a
21725 non-type template parameter. */
21726 static tree
21728 {
21734 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21735 set correctly. */
21738 /* Local variable names (and the `this' keyword) may not
21739 appear in a default argument. */
21742 /* Parse the assignment-expression. */
21747 /* The "this" pointer is not valid in a default argument. */
21749 {
21754 }
21755 default_argument
21757 /* Restore the "this" pointer. */
21759 {
21762 }
21771 }
21773 /* Parse a function-body.
21775 function-body:
21776 compound_statement */
21778 static void
21780 {
21784 }
21786 /* Parse a ctor-initializer-opt followed by a function-body. Return
21787 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21788 is true we are parsing a function-try-block. */
21790 static void
21793 {
21800 /* Begin the function body. */
21802 /* Parse the optional ctor-initializer. */
21805 /* If we're parsing a constexpr constructor definition, we need
21806 to check that the constructor body is indeed empty. However,
21807 before we get to cp_parser_function_body lot of junk has been
21808 generated, so we can't just check that we have an empty block.
21809 Rather we take a snapshot of the outermost block, and check whether
21810 cp_parser_function_body changed its state. */
21812 {
21816 }
21817 /* Parse the function-body. */
21821 /* Finish the function body. */
21823 }
21825 /* Parse an initializer.
21827 initializer:
21828 = initializer-clause
21829 ( expression-list )
21831 Returns an expression representing the initializer. If no
21832 initializer is present, NULL_TREE is returned.
21834 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21835 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21836 set to TRUE if there is no initializer present. If there is an
21837 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21838 is set to true; otherwise it is set to false. */
21840 static tree
21843 {
21845 tree init;
21847 /* Peek at the next token. */
21850 /* Let our caller know whether or not this initializer was
21851 parenthesized. */
21853 /* Assume that the initializer is constant. */
21857 {
21858 /* Consume the `='. */
21860 /* Parse the initializer-clause. */
21862 }
21864 {
21869 non_constant_p);
21874 }
21876 {
21881 }
21882 else
21883 {
21884 /* Anything else is an error. */
21887 }
21893 }
21895 /* Parse an initializer-clause.
21897 initializer-clause:
21898 assignment-expression
21899 braced-init-list
21901 Returns an expression representing the initializer.
21903 If the `assignment-expression' production is used the value
21904 returned is simply a representation for the expression.
21906 Otherwise, calls cp_parser_braced_list. */
21908 static cp_expr
21910 {
21911 cp_expr initializer;
21913 /* Assume the expression is constant. */
21916 /* If it is not a `{', then we are looking at an
21917 assignment-expression. */
21919 {
21920 initializer
21923 non_constant_p);
21924 }
21925 else
21929 }
21931 /* Parse a brace-enclosed initializer list.
21933 braced-init-list:
21934 { initializer-list , [opt] }
21935 { designated-initializer-list , [opt] }
21936 { }
21938 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21939 the elements of the initializer-list (or NULL, if the last
21940 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21941 NULL_TREE. There is no way to detect whether or not the optional
21942 trailing `,' was provided. NON_CONSTANT_P is as for
21943 cp_parser_initializer. */
21945 static cp_expr
21947 {
21948 tree initializer;
21951 /* Consume the `{' token. */
21952 matching_braces braces;
21954 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21956 /* If it's not a `}', then there is a non-trivial initializer. */
21958 {
21959 /* Parse the initializer list. */
21962 /* A trailing `,' token is allowed. */
21965 }
21966 else
21968 /* Now, there should be a trailing `}'. */
21974 /* Build a location of the form:
21975 { ... }
21976 ^~~~~~~
21977 with caret==start at the open brace, finish at the close brace. */
21981 }
21983 /* Consume tokens up to, and including, the next non-nested closing `]'.
21984 Returns true iff we found a closing `]'. */
21986 static bool
21988 {
21992 {
21996 {
21999 /* If we've run out of tokens, then there is no closing `]'. */
22008 {
22011 }
22016 }
22018 /* Consume the token. */
22020 }
22021 }
22023 /* Return true if we are looking at an array-designator, false otherwise. */
22025 static bool
22027 {
22028 /* Consume the `['. */
22033 /* Skip tokens until the next token is a closing square bracket.
22034 If we find the closing `]', and the next token is a `=', then
22035 we are looking at an array designator. */
22036 bool array_designator_p
22040 /* Roll back the tokens we skipped. */
22044 }
22046 /* Parse an initializer-list.
22048 initializer-list:
22049 initializer-clause ... [opt]
22050 initializer-list , initializer-clause ... [opt]
22052 C++2A Extension:
22054 designated-initializer-list:
22055 designated-initializer-clause
22056 designated-initializer-list , designated-initializer-clause
22058 designated-initializer-clause:
22059 designator brace-or-equal-initializer
22061 designator:
22062 . identifier
22064 GNU Extension:
22066 initializer-list:
22067 designation initializer-clause ...[opt]
22068 initializer-list , designation initializer-clause ...[opt]
22070 designation:
22071 . identifier =
22072 identifier :
22073 [ constant-expression ] =
22075 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22076 for the initializer. If the INDEX of the elt is non-NULL, it is the
22077 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22078 as for cp_parser_initializer. */
22082 {
22087 /* Assume all of the expressions are constant. */
22090 /* Parse the rest of the list. */
22092 {
22094 tree designator;
22095 tree initializer;
22099 /* Handle the C++2A syntax, '. id ='. */
22107 {
22110 "C++ designated initializers only available with "
22112 /* Consume the `.'. */
22114 /* Consume the identifier. */
22117 /* Consume the `='. */
22119 }
22120 /* Also, if the next token is an identifier and the following one is a
22121 colon, we are looking at the GNU designated-initializer
22122 syntax. */
22127 {
22128 /* Warn the user that they are using an extension. */
22131 /* Consume the identifier. */
22133 /* Consume the `:'. */
22135 }
22136 /* Also handle C99 array designators, '[ const ] ='. */
22140 {
22141 /* In C++11, [ could start a lambda-introducer. */
22147 {
22150 }
22151 else
22152 {
22157 }
22162 && (!require_potential_rvalue_constant_expression
22166 /* Warn the user that they are using an extension. */
22169 }
22170 else
22174 {
22177 }
22181 {
22185 }
22189 /* Parse the initializer. */
22192 /* If any clause is non-constant, so is the entire initializer. */
22196 /* If we have an ellipsis, this is an initializer pack
22197 expansion. */
22199 {
22202 /* Consume the `...'. */
22209 /* Turn the initializer into an initializer expansion. */
22211 }
22213 /* Add it to the vector. */
22216 /* If the next token is not a comma, we have reached the end of
22217 the list. */
22221 /* Peek at the next token. */
22223 /* If the next token is a `}', then we're still done. An
22224 initializer-clause can have a trailing `,' after the
22225 initializer-list and before the closing `}'. */
22229 /* Consume the `,' token. */
22231 }
22233 /* The same identifier shall not appear in multiple designators
22234 of a designated-initializer-list. */
22236 {
22241 {
22243 {
22245 "%<.%s%> designator used multiple times in "
22249 }
22250 else
22252 }
22256 }
22259 }
22261 /* Classes [gram.class] */
22263 /* Parse a class-name.
22265 class-name:
22266 identifier
22267 template-id
22269 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22270 to indicate that names looked up in dependent types should be
22271 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22272 keyword has been used to indicate that the name that appears next
22273 is a template. TAG_TYPE indicates the explicit tag given before
22274 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22275 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22276 is the class being defined in a class-head. If ENUM_OK is TRUE,
22277 enum-names are also accepted.
22279 Returns the TYPE_DECL representing the class. */
22281 static tree
22290 {
22291 tree decl;
22292 tree scope;
22297 /* All class-names start with an identifier. */
22300 {
22303 }
22305 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22306 to a template-id, so we save it here. */
22311 /* Any name names a type if we're following the `typename' keyword
22312 in a qualified name where the enclosing scope is type-dependent. */
22315 /* Handle the common case (an identifier, but not a template-id)
22316 efficiently. */
22319 {
22323 /* Look for the identifier. */
22327 /* If the next token isn't an identifier, we are certainly not
22328 looking at a class-name. */
22331 /* If we know this is a type-name, there's no need to look it
22332 up. */
22335 else
22336 {
22337 tree ambiguous_decls;
22338 /* If we already know that this lookup is ambiguous, then
22339 we've already issued an error message; there's no reason
22340 to check again. */
22342 {
22345 }
22346 /* If the next token is a `::', then the name must be a type
22347 name.
22349 [basic.lookup.qual]
22351 During the lookup for a name preceding the :: scope
22352 resolution operator, object, function, and enumerator
22353 names are ignored. */
22356 /* Look up the name. */
22358 tag_type,
22361 check_dependency_p,
22365 {
22369 }
22370 }
22371 }
22372 else
22373 {
22374 /* Try a template-id. */
22376 check_dependency_p,
22377 tag_type,
22378 is_declaration);
22381 }
22385 /* If this is a typename, create a TYPENAME_TYPE. */
22387 {
22392 }
22396 /* Check to see that it is really the name of a class. */
22400 /* Situations like this:
22402 template <typename T> struct A {
22403 typename T::template X<int>::I i;
22404 };
22406 are problematic. Is `T::template X<int>' a class-name? The
22407 standard does not seem to be definitive, but there is no other
22408 valid interpretation of the following `::'. Therefore, those
22409 names are considered class-names. */
22410 {
22414 }
22419 /* In Objective-C 2.0, a classname followed by '.' starts a
22420 dot-syntax expression, and it's not a type-name. */
22432 }
22434 /* Parse a class-specifier.
22436 class-specifier:
22437 class-head { member-specification [opt] }
22439 Returns the TREE_TYPE representing the class. */
22441 static tree
22443 {
22444 tree type;
22458 /* Parse the class-head. */
22461 /* If the class-head was a semantic disaster, skip the entire body
22462 of the class. */
22464 {
22468 }
22470 /* Look for the `{'. */
22471 matching_braces braces;
22473 {
22476 }
22481 /* Issue an error message if type-definitions are forbidden here. */
22483 /* Remember that we are defining one more class. */
22485 /* Inside the class, surrounding template-parameter-lists do not
22486 apply. */
22487 saved_num_template_parameter_lists
22490 /* We are not in a function body. */
22493 /* Or in a loop. */
22496 /* Or in a switch. */
22499 /* We are not immediately inside an extern "lang" block. */
22500 saved_in_unbraced_linkage_specification_p
22504 // Associate constraints with the type.
22508 /* Start the class. */
22510 {
22513 }
22517 /* If the type is erroneous, skip the entire body of the class. */
22519 else
22520 /* Parse the member-specification. */
22523 /* Look for the trailing `}'. */
22525 /* Look for trailing attributes to apply to this class. */
22533 /* We've finished a type definition. Check for the common syntax
22534 error of forgetting a semicolon after the definition. We need to
22535 be careful, as we can't just check for not-a-semicolon and be done
22536 with it; the user might have typed:
22538 class X { } c = ...;
22539 class X { } *p = ...;
22541 and so forth. Instead, enumerate all the possible tokens that
22542 might follow this production; if we don't see one of them, then
22543 complain and silently insert the semicolon. */
22544 {
22549 /* Don't try to parse c++11 attributes here. As per the
22550 grammar, that should be a task for
22551 cp_parser_decl_specifier_seq. */
22555 {
22566 /* While it's legal for type qualifiers and storage class
22567 specifiers to follow type definitions in the grammar, only
22568 compiler testsuites contain code like that. Assume that if
22569 we see such code, then what we're really seeing is a case
22570 like:
22572 class X { }
22573 const <type> var = ...;
22575 or
22577 class Y { }
22578 static <type> func (...) ...
22580 i.e. the qualifier or specifier applies to the next
22581 declaration. To do so, however, we need to look ahead one
22582 more token to see if *that* token is a type specifier.
22584 This code could be improved to handle:
22586 class Z { }
22587 static const <type> var = ...; */
22590 {
22593 /* Handling user-defined types here would be nice, but very
22594 tricky. */
22595 want_semicolon
22598 }
22602 }
22604 /* If we don't have a type, then something is very wrong and we
22605 shouldn't try to do anything clever. Likewise for not seeing the
22606 closing brace. */
22608 {
22609 /* Locate the closing brace. */
22610 cp_token_position prev
22615 /* We want to suggest insertion of a ';' immediately *after* the
22616 closing brace, so, if we can, offset the location by 1 column. */
22623 /* If we successfully offset the location, suggest the fix-it. */
22636 else
22639 /* Unget one token and smash it to look as though we encountered
22640 a semicolon in the input stream. */
22645 }
22646 }
22648 /* If this class is not itself within the scope of another class,
22649 then we need to parse the bodies of all of the queued function
22650 definitions. Note that the queued functions defined in a class
22651 are not always processed immediately following the
22652 class-specifier for that class. Consider:
22654 struct A {
22655 struct B { void f() { sizeof (A); } };
22656 };
22658 If `f' were processed before the processing of `A' were
22659 completed, there would be no way to compute the size of `A'.
22660 Note that the nesting we are interested in here is lexical --
22661 not the semantic nesting given by TYPE_CONTEXT. In particular,
22662 for:
22664 struct A { struct B; };
22665 struct A::B { void f() { } };
22667 there is no need to delay the parsing of `A::B::f'. */
22669 {
22670 tree decl;
22678 {
22679 /* Skip default arguments, NSDMIs, etc, in order to improve
22680 error recovery (c++/71169, c++/71832). */
22685 }
22687 /* In a first pass, parse default arguments to the functions.
22688 Then, in a second pass, parse the bodies of the functions.
22689 This two-phased approach handles cases like:
22691 struct S {
22692 void f() { g(); }
22693 void g(int i = 3);
22694 };
22696 */
22698 {
22700 /* If there are default arguments that have not yet been processed,
22701 take care of them now. */
22703 {
22708 }
22709 /* Make sure that any template parameters are in scope. */
22711 /* Parse the default argument expressions. */
22713 /* Remove any template parameters from the symbol table. */
22715 }
22717 /* Now parse any NSDMIs. */
22721 {
22723 {
22728 }
22731 }
22738 /* Now do some post-NSDMI bookkeeping. */
22744 /* Now parse the body of the functions. */
22746 {
22747 /* OpenMP UDRs need to be parsed before all other functions. */
22754 }
22755 else
22759 }
22760 else
22763 /* Put back any saved access checks. */
22766 /* Restore saved state. */
22770 parser->num_template_parameter_lists
22772 parser->in_unbraced_linkage_specification_p
22776 }
22778 static tree
22780 {
22781 tree ret;
22786 }
22788 /* Parse a class-head.
22790 class-head:
22791 class-key identifier [opt] base-clause [opt]
22792 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22793 class-key nested-name-specifier [opt] template-id
22794 base-clause [opt]
22796 class-virt-specifier:
22797 final
22799 GNU Extensions:
22800 class-key attributes identifier [opt] base-clause [opt]
22801 class-key attributes nested-name-specifier identifier base-clause [opt]
22802 class-key attributes nested-name-specifier [opt] template-id
22803 base-clause [opt]
22805 Upon return BASES is initialized to the list of base classes (or
22806 NULL, if there are none) in the same form returned by
22807 cp_parser_base_clause.
22809 Returns the TYPE of the indicated class. Sets
22810 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22811 involving a nested-name-specifier was used, and FALSE otherwise.
22813 Returns error_mark_node if this is not a class-head.
22815 Returns NULL_TREE if the class-head is syntactically valid, but
22816 semantically invalid in a way that means we should skip the entire
22817 body of the class. */
22819 static tree
22822 {
22823 tree nested_name_specifier;
22827 tree attributes;
22828 tree bases;
22838 /* Assume no nested-name-specifier will be present. */
22840 /* Assume no template parameter lists will be used in defining the
22841 type. */
22845 /* Look for the class-key. */
22852 /* Parse the attributes. */
22855 /* If the next token is `::', that is invalid -- but sometimes
22856 people do try to write:
22858 struct ::S {};
22860 Handle this gracefully by accepting the extra qualifier, and then
22861 issuing an error about it later if this really is a
22862 class-head. If it turns out just to be an elaborated type
22863 specifier, remain silent. */
22869 /* Determine the name of the class. Begin by looking for an
22870 optional nested-name-specifier. */
22872 nested_name_specifier
22878 /* If there was a nested-name-specifier, then there *must* be an
22879 identifier. */
22884 {
22886 /* Although the grammar says `identifier', it really means
22887 `class-name' or `template-name'. You are only allowed to
22888 define a class that has already been declared with this
22889 syntax.
22891 The proposed resolution for Core Issue 180 says that wherever
22892 you see `class T::X' you should treat `X' as a type-name.
22894 It is OK to define an inaccessible class; for example:
22896 class A { class B; };
22897 class A::B {};
22899 We do not know if we will see a class-name, or a
22900 template-name. We look for a class-name first, in case the
22901 class-name is a template-id; if we looked for the
22902 template-name first we would stop after the template-name. */
22909 class_type,
22913 /* If that didn't work, ignore the nested-name-specifier. */
22915 {
22921 }
22922 /* If we could not find a corresponding TYPE, treat this
22923 declaration like an unqualified declaration. */
22926 /* Otherwise, count the number of templates used in TYPE and its
22927 containing scopes. */
22928 else
22930 }
22931 /* Otherwise, the identifier is optional. */
22932 else
22933 {
22934 /* We don't know whether what comes next is a template-id,
22935 an identifier, or nothing at all. */
22937 /* Check for a template-id. */
22942 class_key,
22944 /* If that didn't work, it could still be an identifier. */
22946 {
22948 {
22951 }
22952 else
22954 }
22955 else
22956 {
22959 }
22960 }
22965 {
22967 class_key,
22969 }
22972 /* If it's not a `:' or a `{' then we can't really be looking at a
22973 class-head, since a class-head only appears as part of a
22974 class-specifier. We have to detect this situation before calling
22975 xref_tag, since that has irreversible side-effects. */
22977 {
22981 }
22983 /* At this point, we're going ahead with the class-specifier, even
22984 if some other problem occurs. */
22987 {
22992 }
22993 /* Issue the error about the overly-qualified name now. */
22995 {
23000 }
23002 {
23007 }
23009 {
23010 tree scope;
23013 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23014 keyword template shall not appear at the top level. */
23018 /* Reject typedef-names in class heads. */
23020 {
23023 type);
23026 }
23028 /* Figure out in what scope the declaration is being placed. */
23030 /* If that scope does not contain the scope in which the
23031 class was originally declared, the program is invalid. */
23033 {
23036 "declaration of %qD in namespace %qD which does not "
23039 else
23045 }
23046 /* [dcl.meaning]
23048 A declarator-id shall not be qualified except for the
23049 definition of a ... nested class outside of its class
23050 ... [or] the definition or explicit instantiation of a
23051 class member of a namespace outside of its namespace. */
23053 {
23058 }
23059 }
23060 /* An explicit-specialization must be preceded by "template <>". If
23061 it is not, try to recover gracefully. */
23064 && !processing_template_parmlist
23066 {
23067 /* Build a location of this form:
23068 struct typename <ARGS>
23069 ^~~~~~~~~~~~~~~~~~~~~~
23070 with caret==start at the start token, and
23071 finishing at the end of the type. */
23072 location_t reported_loc
23074 class_head_start_location,
23080 "an explicit specialization must be preceded by"
23083 /* Take the same action that would have been taken by
23084 cp_parser_explicit_specialization. */
23087 }
23088 /* There must be no "return" statements between this point and the
23089 end of this function; set "type "to the correct return value and
23090 use "goto done;" to return. */
23091 /* Make sure that the right number of template parameters were
23092 present. */
23094 template_id_p,
23097 {
23098 /* If something went wrong, there is no point in even trying to
23099 process the class-definition. */
23102 }
23104 /* Look up the type. */
23106 {
23110 {
23114 }
23115 else
23116 {
23120 /* Check the scope while we still know whether or not we had a
23121 nested-name-specifier. */
23124 }
23127 }
23129 {
23130 tree class_type;
23132 /* Given:
23134 template <typename T> struct S { struct T };
23135 template <typename T> struct S<T>::T { };
23137 we will get a TYPENAME_TYPE when processing the definition of
23138 `S::T'. We need to resolve it to the actual type before we
23139 try to define it. */
23141 {
23146 else
23147 {
23150 }
23151 }
23155 {
23158 }
23161 /* Enter the scope indicated by the nested-name-specifier. */
23163 /* Get the canonical version of this type. */
23165 /* Call push_template_decl if it seems like we should be defining a
23166 template either from the template headers or the type we're
23167 defining, so that we diagnose both extra and missing headers. */
23171 {
23174 {
23177 }
23178 }
23182 }
23184 {
23185 /* If the class was unnamed, create a dummy name. */
23189 ? ts_within_enclosing_non_class
23193 }
23195 /* Indicate whether this class was declared as a `class' or as a
23196 `struct'. */
23201 /* If this type was already complete, and we see another definition,
23202 that's an error. */
23204 {
23206 type);
23208 type);
23211 }
23216 {
23217 /* Apply attributes now, before any use of the class as a template
23218 argument in its base list. */
23221 }
23223 /* We will have entered the scope containing the class; the names of
23224 base classes should be looked up in that context. For example:
23226 struct A { struct B {}; struct C; };
23227 struct A::C : B {};
23229 is valid. */
23231 /* Get the list of base-classes, if there is one. */
23233 {
23234 /* PR59482: enter the class scope so that base-specifiers are looked
23235 up correctly. */
23239 /* PR59482: get out of the previously pushed class scope so that the
23240 subsequent pops pop the right thing. */
23243 }
23244 else
23247 /* If we're really defining a class, process the base classes.
23248 If they're invalid, fail. */
23252 done:
23253 /* Leave the scope given by the nested-name-specifier. We will
23254 enter the class scope itself while processing the members. */
23259 {
23262 }
23268 out:
23271 }
23273 /* Parse a class-key.
23275 class-key:
23276 class
23277 struct
23278 union
23280 Returns the kind of class-key specified, or none_type to indicate
23281 error. */
23283 static enum tag_types
23285 {
23289 /* Look for the class-key. */
23294 /* Check to see if the TOKEN is a class-key. */
23299 }
23301 /* Parse a type-parameter-key.
23303 type-parameter-key:
23304 class
23305 typename
23306 */
23308 static void
23310 {
23311 /* Look for the type-parameter-key. */
23315 {
23318 /* typename is not allowed in a template template parameter
23319 by the standard until C++17. */
23321 "ISO C++ forbids typename key in template template parameter;"
23323 }
23324 else
23328 }
23330 /* Parse an (optional) member-specification.
23332 member-specification:
23333 member-declaration member-specification [opt]
23334 access-specifier : member-specification [opt] */
23336 static void
23338 {
23340 {
23344 /* Peek at the next token. */
23346 /* If it's a `}', or EOF then we've seen all the members. */
23352 /* See if this token is a keyword. */
23355 {
23359 /* Consume the access-specifier. */
23361 /* Remember which access-specifier is active. */
23363 /* Look for the `:'. */
23368 /* Accept #pragmas at class scope. */
23370 {
23373 }
23375 /* Otherwise, the next construction must be a
23376 member-declaration. */
23378 }
23379 }
23380 }
23382 /* Parse a member-declaration.
23384 member-declaration:
23385 decl-specifier-seq [opt] member-declarator-list [opt] ;
23386 function-definition ; [opt]
23387 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23388 using-declaration
23389 template-declaration
23390 alias-declaration
23392 member-declarator-list:
23393 member-declarator
23394 member-declarator-list , member-declarator
23396 member-declarator:
23397 declarator pure-specifier [opt]
23398 declarator constant-initializer [opt]
23399 identifier [opt] : constant-expression
23401 GNU Extensions:
23403 member-declaration:
23404 __extension__ member-declaration
23406 member-declarator:
23407 declarator attributes [opt] pure-specifier [opt]
23408 declarator attributes [opt] constant-initializer [opt]
23409 identifier [opt] attributes [opt] : constant-expression
23411 C++0x Extensions:
23413 member-declaration:
23414 static_assert-declaration */
23416 static void
23418 {
23419 cp_decl_specifier_seq decl_specifiers;
23420 tree prefix_attributes;
23421 tree decl;
23430 /* Check for the `__extension__' keyword. */
23432 {
23433 /* Recurse. */
23435 /* Restore the old value of the PEDANTIC flag. */
23439 }
23441 /* Check for a template-declaration. */
23443 {
23444 /* An explicit specialization here is an error condition, and we
23445 expect the specialization handler to detect and report this. */
23449 else
23453 }
23454 /* Check for a template introduction. */
23458 /* Check for a using-declaration. */
23460 {
23462 {
23463 /* Parse the using-declaration. */
23467 }
23468 else
23469 {
23470 tree decl;
23474 /* Note that if we actually see the '=' token after the
23475 identifier, cp_parser_alias_declaration commits the
23476 tentative parse. In that case, we really expect an
23477 alias-declaration. Otherwise, we expect a using
23478 declaration. */
23479 alias_decl_expected =
23485 else
23489 }
23490 }
23492 /* Check for @defs. */
23494 {
23499 {
23504 }
23506 }
23508 /* If the next token is `static_assert' we have a static assertion. */
23510 {
23513 }
23520 /* Parse the decl-specifier-seq. */
23523 CP_PARSER_FLAGS_OPTIONAL,
23526 /* Check for an invalid type-name. */
23530 /* If there is no declarator, then the decl-specifier-seq should
23531 specify a type. */
23533 {
23534 /* If there was no decl-specifier-seq, and the next token is a
23535 `;', then we have something like:
23537 struct S { ; };
23539 [class.mem]
23541 Each member-declaration shall declare at least one member
23542 name of the class. */
23544 {
23547 {
23551 }
23552 }
23553 else
23554 {
23555 tree type;
23557 /* See if this declaration is a friend. */
23559 /* If there were decl-specifiers, check to see if there was
23560 a class-declaration. */
23563 /* Nested classes have already been added to the class, but
23564 a `friend' needs to be explicitly registered. */
23566 {
23567 /* If the `friend' keyword was present, the friend must
23568 be introduced with a class-key. */
23571 "in C++03 a class-key must be used "
23573 /* In this case:
23575 template <typename T> struct A {
23576 friend struct A<T>::B;
23577 };
23579 A<T>::B will be represented by a TYPENAME_TYPE, and
23580 therefore not recognized by check_tag_decl. */
23582 {
23586 }
23589 "friend declaration does not name a class or "
23591 else
23594 }
23595 /* If there is no TYPE, an error message will already have
23596 been issued. */
23598 ;
23599 /* An anonymous aggregate has to be handled specially; such
23600 a declaration really declares a data member (with a
23601 particular type), as opposed to a nested class. */
23603 {
23604 /* C++11 9.5/6. */
23607 "a storage class on an anonymous aggregate "
23610 /* Remove constructors and such from TYPE, now that we
23611 know it is an anonymous aggregate. */
23613 /* And make the corresponding data member. */
23616 /* Add it to the class. */
23618 }
23619 else
23620 cp_parser_check_access_in_redeclaration
23623 }
23624 }
23625 else
23626 {
23629 /* Clear attributes from the decl_specifiers but keep them
23630 around as prefix attributes that apply them to the entity
23631 being declared. */
23635 /* See if these declarations will be friends. */
23638 /* Keep going until we hit the `;' at the end of the
23639 declaration. */
23641 {
23643 tree first_attribute;
23644 tree initializer;
23647 /* Peek at the next token. */
23650 /* The following code wants to know early if it is a bit-field
23651 or some other declaration. Attributes can appear before
23652 the `:' token. Skip over them without consuming any tokens
23653 to peek if they are followed by `:'. */
23658 {
23659 size_t n
23662 }
23664 /* Check for a bitfield declaration. */
23670 {
23671 tree identifier;
23672 tree width;
23677 else
23680 /* Look for attributes that apply to the bitfield. */
23683 /* Consume the `:' token. */
23686 /* Get the width of the bitfield. */
23690 /* In C++2A and as extension for C++11 and above we allow
23691 default member initializers for bit-fields. */
23696 CPP_OPEN_BRACE)))
23697 {
23698 location_t loc
23704 "default member initializers for bit-fields "
23705 "only available with -std=c++2a or "
23710 {
23714 }
23715 }
23716 else
23717 {
23718 /* Look for attributes that apply to the bitfield after
23719 the `:' token and width. This is where GCC used to
23720 parse attributes in the past, pedwarn if there is
23721 a std attribute. */
23724 "ISO C++ allows bit-field attributes only "
23728 }
23732 /* Remember which attributes are prefix attributes and
23733 which are not. */
23735 /* Combine the attributes. */
23738 /* Create the bitfield declaration. */
23741 identifier,
23742 sfk_none)
23746 attributes);
23747 }
23748 else
23749 {
23751 tree asm_specification;
23754 /* Parse the declarator. */
23755 declarator
23760 friend_p);
23762 /* If something went wrong parsing the declarator, make sure
23763 that we at least consume some tokens. */
23765 {
23766 /* Skip to the end of the statement. */
23768 /* If the next token is not a semicolon, that is
23769 probably because we just skipped over the body of
23770 a function. So, we consume a semicolon if
23771 present, but do not issue an error message if it
23772 is not present. */
23774 CPP_SEMICOLON))
23777 }
23780 cp_parser_check_for_definition_in_return_type
23784 /* Look for an asm-specification. */
23786 /* Look for attributes that apply to the declaration. */
23788 /* Remember which attributes are prefix attributes and
23789 which are not. */
23791 /* Combine the attributes. */
23794 /* If it's an `=', then we have a constant-initializer or a
23795 pure-specifier. It is not correct to parse the
23796 initializer before registering the member declaration
23797 since the member declaration should be in scope while
23798 its initializer is processed. However, the rest of the
23799 front end does not yet provide an interface that allows
23800 us to handle this correctly. */
23802 {
23803 /* In [class.mem]:
23805 A pure-specifier shall be used only in the declaration of
23806 a virtual function.
23808 A member-declarator can contain a constant-initializer
23809 only if it declares a static member of integral or
23810 enumeration type.
23812 Therefore, if the DECLARATOR is for a function, we look
23813 for a pure-specifier; otherwise, we look for a
23814 constant-initializer. When we call `grokfield', it will
23815 perform more stringent semantics checks. */
23827 {
23829 /* Don't require a constant rvalue in C++11, since we
23830 might want a reference constant. We'll enforce
23831 constancy later. */
23833 /* Parse the initializer. */
23836 }
23837 else
23838 /* Parse the initializer. */
23840 }
23843 {
23847 else
23849 }
23850 /* Otherwise, there is no initializer. */
23851 else
23854 /* See if we are probably looking at a function
23855 definition. We are certainly not looking at a
23856 member-declarator. Calling `grokfield' has
23857 side-effects, so we must not do it unless we are sure
23858 that we are looking at a member-declarator. */
23861 {
23862 /* The grammar does not allow a pure-specifier to be
23863 used when a member function is defined. (It is
23864 possible that this fact is an oversight in the
23865 standard, since a pure function may be defined
23866 outside of the class-specifier. */
23872 declarator,
23873 attributes);
23876 /* If the member was not a friend, declare it here. */
23879 /* Peek at the next token. */
23881 /* If the next token is a semicolon, consume it. */
23883 {
23884 location_t semicolon_loc
23889 "extra %<;%> after in-class "
23891 }
23893 }
23894 else
23897 /* Create the declaration. */
23902 {
23905 else
23907 }
23908 }
23913 /* Reset PREFIX_ATTRIBUTES. */
23915 {
23920 }
23922 /* If there is any qualification still in effect, clear it
23923 now; we will be starting fresh with the next declarator. */
23927 /* If it's a `,', then there are more declarators. */
23929 {
23932 {
23938 }
23939 }
23940 /* If the next token isn't a `;', then we have a parse error. */
23942 CPP_SEMICOLON))
23943 {
23944 /* The next token might be a ways away from where the
23945 actual semicolon is missing. Find the previous token
23946 and use that for our error position. */
23953 /* Assume that the user meant to provide a semicolon. If
23954 we were to cp_parser_skip_to_end_of_statement, we might
23955 skip to a semicolon inside a member function definition
23956 and issue nonsensical error messages. */
23958 }
23961 {
23962 /* Add DECL to the list of members. */
23964 /* Explicitly include, eg, NSDMIs, for better error
23965 recovery (c++/58650). */
23973 /* Add DECL to the queue of NSDMI to be parsed later. */
23975 }
23979 }
23980 }
23983 out:
23985 }
23987 /* Parse a pure-specifier.
23989 pure-specifier:
23990 = 0
23992 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23993 Otherwise, ERROR_MARK_NODE is returned. */
23995 static tree
23997 {
24000 /* Look for the `=' token. */
24003 /* Look for the `0' token. */
24012 /* Accept = default or = delete in c++0x mode. */
24015 {
24018 }
24020 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24022 {
24027 }
24029 {
24032 }
24035 }
24037 /* Parse a constant-initializer.
24039 constant-initializer:
24040 = constant-expression
24042 Returns a representation of the constant-expression. */
24044 static tree
24046 {
24047 /* Look for the `=' token. */
24051 /* It is invalid to write:
24053 struct S { static const int i = { 7 }; };
24055 */
24057 {
24060 /* Consume the opening brace. */
24061 matching_braces braces;
24063 /* Skip the initializer. */
24065 /* Look for the trailing `}'. */
24069 }
24072 }
24074 /* Derived classes [gram.class.derived] */
24076 /* Parse a base-clause.
24078 base-clause:
24079 : base-specifier-list
24081 base-specifier-list:
24082 base-specifier ... [opt]
24083 base-specifier-list , base-specifier ... [opt]
24085 Returns a TREE_LIST representing the base-classes, in the order in
24086 which they were declared. The representation of each node is as
24087 described by cp_parser_base_specifier.
24089 In the case that no bases are specified, this function will return
24090 NULL_TREE, not ERROR_MARK_NODE. */
24092 static tree
24094 {
24097 /* Look for the `:' that begins the list. */
24100 /* Scan the base-specifier-list. */
24102 {
24104 tree base;
24107 /* Look for the base-specifier. */
24109 /* Look for the (optional) ellipsis. */
24111 {
24112 /* Consume the `...'. */
24116 }
24118 /* Add BASE to the front of the list. */
24120 {
24122 /* Make this a pack expansion type. */
24126 {
24129 }
24130 }
24131 /* Peek at the next token. */
24133 /* If it's not a comma, then the list is complete. */
24136 /* Consume the `,'. */
24138 }
24140 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24141 base class had a qualified name. However, the next name that
24142 appears is certainly not qualified. */
24148 }
24150 /* Parse a base-specifier.
24152 base-specifier:
24153 :: [opt] nested-name-specifier [opt] class-name
24154 virtual access-specifier [opt] :: [opt] nested-name-specifier
24155 [opt] class-name
24156 access-specifier virtual [opt] :: [opt] nested-name-specifier
24157 [opt] class-name
24159 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24160 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24161 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24162 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24164 static tree
24166 {
24174 tree type;
24176 /* Process the optional `virtual' and `access-specifier'. */
24178 {
24179 /* Peek at the next token. */
24181 /* Process `virtual'. */
24183 {
24185 /* If `virtual' appears more than once, issue an error. */
24187 {
24191 }
24195 /* Consume the `virtual' token. */
24203 /* If more than one access specifier appears, issue an
24204 error. */
24207 {
24211 }
24215 /* Consume the access-specifier. */
24223 }
24224 }
24225 /* It is not uncommon to see programs mechanically, erroneously, use
24226 the 'typename' keyword to denote (dependent) qualified types
24227 as base classes. */
24229 {
24234 else
24236 "keyword %<typename%> not allowed in this context "
24239 }
24241 /* Look for the optional `::' operator. */
24243 /* Look for the nested-name-specifier. The simplest way to
24244 implement:
24246 [temp.res]
24248 The keyword `typename' is not permitted in a base-specifier or
24249 mem-initializer; in these contexts a qualified name that
24250 depends on a template-parameter is implicitly assumed to be a
24251 type name.
24253 is to pretend that we have seen the `typename' keyword at this
24254 point. */
24260 /* If the base class is given by a qualified name, assume that names
24261 we see are type names or templates, as appropriate. */
24267 /* DR 950 allows decltype as a base-specifier. */
24269 else
24270 {
24271 /* Otherwise, look for the class-name. */
24273 class_scope_p,
24274 template_p,
24275 typename_type,
24280 }
24286 }
24288 /* Exception handling [gram.exception] */
24290 /* Parse an (optional) noexcept-specification.
24292 noexcept-specification:
24293 noexcept ( constant-expression ) [opt]
24295 If no noexcept-specification is present, returns NULL_TREE.
24296 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24297 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24298 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24299 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24300 in which case a boolean condition is returned instead. */
24302 static tree
24307 {
24311 /* Peek at the next token. */
24314 /* Is it a noexcept-specification? */
24316 {
24317 tree expr;
24321 {
24322 matching_parens parens;
24326 {
24327 /* Types may not be defined in an exception-specification. */
24329 parser->type_definition_forbidden_message
24334 /* Restore the saved message. */
24336 }
24337 else
24338 {
24341 }
24344 }
24345 else
24346 {
24350 }
24352 /* We cannot build a noexcept-spec right away because this will check
24353 that expr is a constexpr. */
24356 else
24358 }
24359 else
24361 }
24363 /* Parse an (optional) exception-specification.
24365 exception-specification:
24366 throw ( type-id-list [opt] )
24368 Returns a TREE_LIST representing the exception-specification. The
24369 TREE_VALUE of each node is a type. */
24371 static tree
24373 {
24375 tree type_id_list;
24378 /* Peek at the next token. */
24381 /* Is it a noexcept-specification? */
24387 /* If it's not `throw', then there's no exception-specification. */
24393 /* Consume the `throw'. */
24396 /* Look for the `('. */
24397 matching_parens parens;
24400 /* Peek at the next token. */
24402 /* If it's not a `)', then there is a type-id-list. */
24404 {
24405 /* Types may not be defined in an exception-specification. */
24407 parser->type_definition_forbidden_message
24409 /* Parse the type-id-list. */
24411 /* Restore the saved message. */
24415 {
24419 }
24422 "dynamic exception specifications are deprecated in "
24424 }
24425 /* In C++17, throw() is equivalent to noexcept (true). throw()
24426 is deprecated in C++11 and above as well, but is still widely used,
24427 so don't warn about it yet. */
24430 else
24433 /* Look for the `)'. */
24437 }
24439 /* Parse an (optional) type-id-list.
24441 type-id-list:
24442 type-id ... [opt]
24443 type-id-list , type-id ... [opt]
24445 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24446 in the order that the types were presented. */
24448 static tree
24450 {
24454 {
24456 tree type;
24460 /* Get the next type-id. */
24462 /* Check for invalid 'auto'. */
24464 {
24468 }
24469 /* Parse the optional ellipsis. */
24471 {
24472 /* Consume the `...'. */
24475 /* Turn the type into a pack expansion expression. */
24477 }
24478 /* Add it to the list. */
24480 /* Peek at the next token. */
24482 /* If it is not a `,', we are done. */
24485 /* Consume the `,'. */
24487 }
24490 }
24492 /* Parse a try-block.
24494 try-block:
24495 try compound-statement handler-seq */
24497 static tree
24499 {
24500 tree try_block;
24514 }
24516 /* Parse a function-try-block.
24518 function-try-block:
24519 try ctor-initializer [opt] function-body handler-seq */
24521 static void
24523 {
24524 tree compound_stmt;
24525 tree try_block;
24527 /* Look for the `try' keyword. */
24530 /* Let the rest of the front end know where we are. */
24532 /* Parse the function-body. */
24533 cp_parser_ctor_initializer_opt_and_function_body
24535 /* We're done with the `try' part. */
24537 /* Parse the handlers. */
24539 /* We're done with the handlers. */
24541 }
24543 /* Parse a handler-seq.
24545 handler-seq:
24546 handler handler-seq [opt] */
24548 static void
24550 {
24552 {
24555 /* Parse the handler. */
24557 /* Peek at the next token. */
24559 /* If it's not `catch' then there are no more handlers. */
24562 }
24563 }
24565 /* Parse a handler.
24567 handler:
24568 catch ( exception-declaration ) compound-statement */
24570 static void
24572 {
24573 tree handler;
24574 tree declaration;
24578 matching_parens parens;
24585 }
24587 /* Parse an exception-declaration.
24589 exception-declaration:
24590 type-specifier-seq declarator
24591 type-specifier-seq abstract-declarator
24592 type-specifier-seq
24593 ...
24595 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24596 ellipsis variant is used. */
24598 static tree
24600 {
24601 cp_decl_specifier_seq type_specifiers;
24605 /* If it's an ellipsis, it's easy to handle. */
24607 {
24608 /* Consume the `...' token. */
24611 }
24613 /* Types may not be defined in exception-declarations. */
24615 parser->type_definition_forbidden_message
24618 /* Parse the type-specifier-seq. */
24622 /* If it's a `)', then there is no declarator. */
24625 else
24632 /* Restore the saved message. */
24639 }
24641 /* Parse a throw-expression.
24643 throw-expression:
24644 throw assignment-expression [opt]
24646 Returns a THROW_EXPR representing the throw-expression. */
24648 static tree
24650 {
24651 tree expression;
24656 /* Figure out whether or not there is an assignment-expression
24657 following the "throw" keyword. */
24665 else
24669 }
24671 /* GNU Extensions */
24673 /* Parse an (optional) asm-specification.
24675 asm-specification:
24676 asm ( string-literal )
24678 If the asm-specification is present, returns a STRING_CST
24679 corresponding to the string-literal. Otherwise, returns
24680 NULL_TREE. */
24682 static tree
24684 {
24686 tree asm_specification;
24688 /* Peek at the next token. */
24690 /* If the next token isn't the `asm' keyword, then there's no
24691 asm-specification. */
24695 /* Consume the `asm' token. */
24697 /* Look for the `('. */
24698 matching_parens parens;
24701 /* Look for the string-literal. */
24704 /* Look for the `)'. */
24708 }
24710 /* Parse an asm-operand-list.
24712 asm-operand-list:
24713 asm-operand
24714 asm-operand-list , asm-operand
24716 asm-operand:
24717 string-literal ( expression )
24718 [ string-literal ] string-literal ( expression )
24720 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24721 each node is the expression. The TREE_PURPOSE is itself a
24722 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24723 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24724 is a STRING_CST for the string literal before the parenthesis. Returns
24725 ERROR_MARK_NODE if any of the operands are invalid. */
24727 static tree
24729 {
24734 {
24735 tree string_literal;
24736 tree expression;
24737 tree name;
24740 {
24741 /* Consume the `[' token. */
24743 /* Read the operand name. */
24748 /* Look for the closing `]'. */
24750 }
24751 else
24753 /* Look for the string-literal. */
24756 /* Look for the `('. */
24757 matching_parens parens;
24759 /* Parse the expression. */
24761 /* Look for the `)'. */
24769 /* Add this operand to the list. */
24771 expression,
24772 asm_operands);
24773 /* If the next token is not a `,', there are no more
24774 operands. */
24777 /* Consume the `,'. */
24779 }
24782 }
24784 /* Parse an asm-clobber-list.
24786 asm-clobber-list:
24787 string-literal
24788 asm-clobber-list , string-literal
24790 Returns a TREE_LIST, indicating the clobbers in the order that they
24791 appeared. The TREE_VALUE of each node is a STRING_CST. */
24793 static tree
24795 {
24799 {
24800 tree string_literal;
24802 /* Look for the string literal. */
24804 /* Add it to the list. */
24806 /* If the next token is not a `,', then the list is
24807 complete. */
24810 /* Consume the `,' token. */
24812 }
24815 }
24817 /* Parse an asm-label-list.
24819 asm-label-list:
24820 identifier
24821 asm-label-list , identifier
24823 Returns a TREE_LIST, indicating the labels in the order that they
24824 appeared. The TREE_VALUE of each node is a label. */
24826 static tree
24828 {
24832 {
24835 /* Look for the identifier. */
24838 {
24841 {
24847 }
24848 }
24849 /* If the next token is not a `,', then the list is
24850 complete. */
24853 /* Consume the `,' token. */
24855 }
24858 }
24860 /* Return TRUE iff the next tokens in the stream are possibly the
24861 beginning of a GNU extension attribute. */
24863 static bool
24865 {
24867 }
24869 /* Return TRUE iff the next tokens in the stream are possibly the
24870 beginning of a standard C++-11 attribute specifier. */
24872 static bool
24874 {
24876 }
24878 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24879 beginning of a standard C++-11 attribute specifier. */
24881 static bool
24883 {
24891 }
24893 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24894 beginning of a GNU extension attribute. */
24896 static bool
24898 {
24902 }
24904 /* Return true iff the next tokens can be the beginning of either a
24905 GNU attribute list, or a standard C++11 attribute sequence. */
24907 static bool
24909 {
24912 }
24914 /* Return true iff the next Nth tokens can be the beginning of either
24915 a GNU attribute list, or a standard C++11 attribute sequence. */
24917 static bool
24919 {
24922 }
24924 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24925 of GNU attributes, or return NULL. */
24927 static tree
24929 {
24933 }
24935 /* Parse an (optional) series of attributes.
24937 attributes:
24938 attributes attribute
24940 attribute:
24941 __attribute__ (( attribute-list [opt] ))
24943 The return value is as for cp_parser_gnu_attribute_list. */
24945 static tree
24947 {
24954 {
24956 tree attribute_list;
24959 /* Peek at the next token. */
24961 /* If it's not `__attribute__', then we're done. */
24965 /* Consume the `__attribute__' keyword. */
24967 /* Look for the two `(' tokens. */
24968 matching_parens outer_parens;
24970 matching_parens inner_parens;
24973 /* Peek at the next token. */
24976 /* Parse the attribute-list. */
24978 else
24979 /* If the next token is a `)', then there is no attribute
24980 list. */
24983 /* Look for the two `)' tokens. */
24991 /* Add these new attributes to the list. */
24993 }
24996 }
24998 /* Parse a GNU attribute-list.
25000 attribute-list:
25001 attribute
25002 attribute-list , attribute
25004 attribute:
25005 identifier
25006 identifier ( identifier )
25007 identifier ( identifier , expression-list )
25008 identifier ( expression-list )
25010 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25011 to an attribute. The TREE_PURPOSE of each node is the identifier
25012 indicating which attribute is in use. The TREE_VALUE represents
25013 the arguments, if any. */
25015 static tree
25017 {
25023 {
25025 tree identifier;
25026 tree attribute;
25028 /* Look for the identifier. We also allow keywords here; for
25029 example `__attribute__ ((const))' is legal. */
25033 {
25036 /* Consume the token, but save it since we need it for the
25037 SIMD enabled function parsing. */
25040 /* Save away the identifier that indicates which attribute
25041 this is. */
25043 /* For keywords, use the canonical spelling, not the
25044 parsed identifier. */
25051 /* Peek at the next token. */
25053 /* If it's an `(', then parse the attribute arguments. */
25055 {
25059 vec = cp_parser_parenthesized_expression_list
25065 else
25066 {
25069 }
25070 /* Save the arguments away. */
25072 }
25075 {
25076 /* Add this attribute to the list. */
25079 }
25082 }
25083 /* Now, look for more attributes. If the next token isn't a
25084 `,', we're done. */
25088 /* Consume the comma and keep going. */
25090 }
25093 /* We built up the list in reverse order. */
25095 }
25097 /* Parse a standard C++11 attribute.
25099 The returned representation is a TREE_LIST which TREE_PURPOSE is
25100 the scoped name of the attribute, and the TREE_VALUE is its
25101 arguments list.
25103 Note that the scoped name of the attribute is itself a TREE_LIST
25104 which TREE_PURPOSE is the namespace of the attribute, and
25105 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25106 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25107 and which TREE_PURPOSE is directly the attribute name.
25109 Clients of the attribute code should use get_attribute_namespace
25110 and get_attribute_name to get the actual namespace and name of
25111 attributes, regardless of their being GNU or C++11 attributes.
25113 attribute:
25114 attribute-token attribute-argument-clause [opt]
25116 attribute-token:
25117 identifier
25118 attribute-scoped-token
25120 attribute-scoped-token:
25121 attribute-namespace :: identifier
25123 attribute-namespace:
25124 identifier
25126 attribute-argument-clause:
25127 ( balanced-token-seq )
25129 balanced-token-seq:
25130 balanced-token [opt]
25131 balanced-token-seq balanced-token
25133 balanced-token:
25134 ( balanced-token-seq )
25135 [ balanced-token-seq ]
25136 { balanced-token-seq }. */
25138 static tree
25140 {
25147 /* First, parse name of the attribute, a.k.a attribute-token. */
25164 {
25165 /* We are seeing a scoped attribute token. */
25180 else
25181 {
25185 }
25189 NULL_TREE);
25191 }
25194 NULL_TREE);
25195 else
25196 {
25199 NULL_TREE);
25200 /* C++11 noreturn attribute is equivalent to GNU's. */
25203 /* C++14 deprecated attribute is equivalent to GNU's. */
25206 /* C++17 fallthrough attribute is equivalent to GNU's. */
25209 /* Transactional Memory TS optimize_for_synchronized attribute is
25210 equivalent to GNU transaction_callable. */
25214 /* Transactional Memory attributes are GNU attributes. */
25217 }
25219 /* Now parse the optional argument clause of the attribute. */
25224 {
25230 /* A GNU attribute that takes an identifier in parameter. */
25233 vec = cp_parser_parenthesized_expression_list
25239 else
25240 {
25243 }
25247 else
25249 }
25252 }
25254 /* Check that the attribute ATTRIBUTE appears at most once in the
25255 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25256 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25257 isn't implemented yet in GCC. */
25259 static void
25261 {
25263 {
25273 }
25274 }
25276 /* Parse a list of standard C++-11 attributes.
25278 attribute-list:
25279 attribute [opt]
25280 attribute-list , attribute[opt]
25281 attribute ...
25282 attribute-list , attribute ...
25283 */
25285 static tree
25287 {
25292 {
25297 {
25301 }
25304 {
25309 else
25310 {
25315 }
25317 }
25321 }
25324 }
25326 /* Parse a standard C++-11 attribute specifier.
25328 attribute-specifier:
25329 [ [ attribute-using-prefix [opt] attribute-list ] ]
25330 alignment-specifier
25332 attribute-using-prefix:
25333 using attribute-namespace :
25335 alignment-specifier:
25336 alignas ( type-id ... [opt] )
25337 alignas ( alignment-expression ... [opt] ). */
25339 static tree
25341 {
25347 {
25354 {
25365 {
25369 "attribute using prefix only available "
25375 }
25376 else
25378 }
25385 else
25386 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25387 when we are sure that we have actually parsed them. */
25389 }
25390 else
25391 {
25392 tree alignas_expr;
25394 /* Look for an alignment-specifier. */
25405 matching_parens parens;
25413 {
25420 }
25425 /* Handle alignas (pack...). */
25427 {
25430 }
25432 /* Something went wrong, so don't build the attribute. */
25439 /* Build the C++-11 representation of an 'aligned'
25440 attribute. */
25441 attributes =
25444 alignas_expr);
25445 }
25448 }
25450 /* Parse a standard C++-11 attribute-specifier-seq.
25452 attribute-specifier-seq:
25453 attribute-specifier-seq [opt] attribute-specifier
25454 */
25456 static tree
25458 {
25463 {
25472 else
25475 }
25478 }
25480 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25481 return index of the first token after balanced-token, or N on failure. */
25483 static size_t
25485 {
25488 do
25490 {
25493 /* Ran out of tokens. */
25515 }
25518 }
25520 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25521 return index of the first token after the GNU attribute tokens, or N on
25522 failure. */
25524 static size_t
25526 {
25528 {
25540 }
25542 }
25544 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25545 next token), return index of the first token after the standard C++11
25546 attribute tokens, or N on failure. */
25548 static size_t
25550 {
25552 {
25555 {
25562 }
25565 {
25570 }
25571 else
25573 }
25575 }
25577 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25578 as the next token), return index of the first token after the attribute
25579 tokens, or N on failure. */
25581 static size_t
25583 {
25587 }
25589 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25590 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25591 current value of the PEDANTIC flag, regardless of whether or not
25592 the `__extension__' keyword is present. The caller is responsible
25593 for restoring the value of the PEDANTIC flag. */
25595 static bool
25597 {
25598 /* Save the old value of the PEDANTIC flag. */
25602 {
25603 /* Consume the `__extension__' token. */
25605 /* We're not being pedantic while the `__extension__' keyword is
25606 in effect. */
25610 }
25613 }
25615 /* Parse a label declaration.
25617 label-declaration:
25618 __label__ label-declarator-seq ;
25620 label-declarator-seq:
25621 identifier , label-declarator-seq
25622 identifier */
25624 static void
25626 {
25627 /* Look for the `__label__' keyword. */
25631 {
25632 tree identifier;
25634 /* Look for an identifier. */
25636 /* If we failed, stop. */
25639 /* Declare it as a label. */
25641 /* If the next token is a `;', stop. */
25644 /* Look for the `,' separating the label declarations. */
25646 }
25648 /* Look for the final `;'. */
25650 }
25652 // -------------------------------------------------------------------------- //
25653 // Requires Clause
25655 // Parse a requires clause.
25656 //
25657 // requires-clause:
25658 // 'requires' logical-or-expression
25659 //
25660 // The required logical-or-expression must be a constant expression. Note
25661 // that we don't check that the expression is constepxr here. We defer until
25662 // we analyze constraints and then, we only check atomic constraints.
25663 static tree
25665 {
25666 // Parse the requires clause so that it is not automatically folded.
25674 }
25676 // Optionally parse a requires clause:
25677 static tree
25679 {
25682 {
25685 {
25688 /* Parse and discard the requires-clause. */
25691 }
25693 }
25696 }
25699 /*---------------------------------------------------------------------------
25700 Requires expressions
25701 ---------------------------------------------------------------------------*/
25703 /* Parse a requires expression
25705 requirement-expression:
25706 'requires' requirement-parameter-list [opt] requirement-body */
25707 static tree
25709 {
25713 /* A requires-expression shall appear only within a concept
25714 definition or a requires-clause.
25716 TODO: Implement this diagnostic correctly. */
25718 {
25722 }
25725 {
25726 /* Local parameters are delared as variables within the scope
25727 of the expression. They are not visible past the end of
25728 the expression. Expressions within the requires-expression
25729 are unevaluated. */
25730 struct scope_sentinel
25731 {
25733 {
25736 }
25739 {
25742 }
25745 /* Parse the optional parameter list. */
25747 {
25751 }
25752 else
25755 /* Parse the requirement body. */
25759 }
25761 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25762 the parm chain. */
25765 }
25767 /* Parse a parameterized requirement.
25769 requirement-parameter-list:
25770 '(' parameter-declaration-clause ')' */
25771 static tree
25773 {
25774 matching_parens parens;
25784 }
25786 /* Parse the body of a requirement.
25788 requirement-body:
25789 '{' requirement-list '}' */
25790 static tree
25792 {
25793 matching_braces braces;
25803 }
25805 /* Parse a list of requirements.
25807 requirement-list:
25808 requirement
25809 requirement-list ';' requirement[opt] */
25810 static tree
25812 {
25815 {
25822 /* If we see a semi-colon, consume it. */
25826 /* Stop processing at the end of the list. */
25829 }
25831 /* Reverse the order of requirements so they are analyzed in
25832 declaration order. */
25834 }
25836 /* Parse a syntactic requirement or type requirement.
25838 requirement:
25839 simple-requirement
25840 compound-requirement
25841 type-requirement
25842 nested-requirement */
25843 static tree
25845 {
25852 else
25854 }
25856 /* Parse a simple requirement.
25858 simple-requirement:
25859 expression ';' */
25860 static tree
25862 {
25871 }
25873 /* Parse a type requirement
25875 type-requirement
25876 nested-name-specifier [opt] required-type-name ';'
25878 required-type-name:
25879 type-name
25880 'template' [opt] simple-template-id */
25881 static tree
25883 {
25886 // Save the scope before parsing name specifiers.
25897 tree type;
25899 {
25908 }
25909 else
25928 }
25930 /* Parse a compound requirement
25932 compound-requirement:
25933 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25934 static tree
25936 {
25937 /* Parse an expression enclosed in '{ }'s. */
25938 matching_braces braces;
25949 /* Parse the optional noexcept. */
25952 {
25955 }
25957 /* Parse the optional trailing return type. */
25960 {
25968 }
25971 }
25973 /* Parse a nested requirement. This is the same as a requires clause.
25975 nested-requirement:
25976 requires-clause */
25977 static tree
25979 {
25985 }
25987 /* Support Functions */
25989 /* Return the appropriate prefer_type argument for lookup_name_real based on
25990 tag_type and template_mem_access. */
25994 {
25995 /* DR 141: When looking in the current enclosing context for a template-name
25996 after -> or ., only consider class templates. */
26000 {
26004 }
26005 }
26007 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26008 NAME should have one of the representations used for an
26009 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26010 is returned. If PARSER->SCOPE is a dependent type, then a
26011 SCOPE_REF is returned.
26013 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26014 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26015 was formed. Abstractly, such entities should not be passed to this
26016 function, because they do not need to be looked up, but it is
26017 simpler to check for this special case here, rather than at the
26018 call-sites.
26020 In cases not explicitly covered above, this function returns a
26021 DECL, OVERLOAD, or baselink representing the result of the lookup.
26022 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26023 is returned.
26025 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26026 (e.g., "struct") that was used. In that case bindings that do not
26027 refer to types are ignored.
26029 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26030 ignored.
26032 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26033 are ignored.
26035 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26036 types.
26038 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26039 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26040 NULL_TREE otherwise. */
26042 static cp_expr
26049 location_t name_location)
26050 {
26051 tree decl;
26054 /* Assume that the lookup will be unambiguous. */
26058 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26059 no longer valid. Note that if we are parsing tentatively, and
26060 the parse fails, OBJECT_TYPE will be automatically restored. */
26066 /* A template-id has already been resolved; there is no lookup to
26067 do. */
26071 {
26075 }
26077 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26078 it should already have been checked to make sure that the name
26079 used matches the type being destroyed. */
26081 {
26082 tree type;
26084 /* Figure out to which type this destructor applies. */
26089 else
26091 /* If that's not a class type, there is no destructor. */
26102 }
26104 /* By this point, the NAME should be an ordinary identifier. If
26105 the id-expression was a qualified name, the qualifying scope is
26106 stored in PARSER->SCOPE at this point. */
26109 /* Perform the lookup. */
26111 {
26117 /* If the SCOPE is dependent, the lookup must be deferred until
26118 the template is instantiated -- unless we are explicitly
26119 looking up names in uninstantiated templates. Even then, we
26120 cannot look up the name if the scope is not a class type; it
26121 might, for example, be a template type parameter. */
26126 /* Defer lookup. */
26128 else
26129 {
26132 /* If PARSER->SCOPE is a dependent type, then it must be a
26133 class type, and we must not be checking dependencies;
26134 otherwise, we would have processed this lookup above. So
26135 that PARSER->SCOPE is not considered a dependent base by
26136 lookup_member, we must enter the scope here. */
26140 /* If the PARSER->SCOPE is a template specialization, it
26141 may be instantiated during name lookup. In that case,
26142 errors may be issued. Even if we rollback the current
26143 tentative parse, those errors are valid. */
26148 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26149 lookup result and the nested-name-specifier nominates a class C:
26150 * if the name specified after the nested-name-specifier, when
26151 looked up in C, is the injected-class-name of C (Clause 9), or
26152 * if the name specified after the nested-name-specifier is the
26153 same as the identifier or the simple-template-id's template-
26154 name in the last component of the nested-name-specifier,
26155 the name is instead considered to name the constructor of
26156 class C. [ Note: for example, the constructor is not an
26157 acceptable lookup result in an elaborated-type-specifier so
26158 the constructor would not be used in place of the
26159 injected-class-name. --end note ] Such a constructor name
26160 shall be used only in the declarator-id of a declaration that
26161 names a constructor or in a using-declaration. */
26169 /* If we have a single function from a using decl, pull it out. */
26176 }
26178 /* If the scope is a dependent type and either we deferred lookup or
26179 we did lookup but didn't find the name, rememeber the name. */
26182 {
26184 {
26185 tree type;
26187 /* The resolution to Core Issue 180 says that `struct
26188 A::B' should be considered a type-name, even if `A'
26189 is dependent. */
26194 }
26198 CPP_CLOSE_PAREN)))
26202 else
26205 is_template);
26206 }
26209 }
26211 {
26212 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26213 OBJECT_TYPE is not a class. */
26215 /* If the OBJECT_TYPE is a template specialization, it may
26216 be instantiated during name lookup. In that case, errors
26217 may be issued. Even if we rollback the current tentative
26218 parse, those errors are valid. */
26220 name,
26223 tf_warning_or_error);
26224 else
26228 /* Look it up in the enclosing context. DR 141: When looking for a
26229 template-name after -> or ., only consider class templates. */
26234 /* The object is type-dependent, so we can't look anything up; we used
26235 this to get the DR 141 behavior. */
26239 }
26240 else
26241 {
26247 }
26249 /* If the lookup failed, let our caller know. */
26253 /* Pull out the template from an injected-class-name (or multiple). */
26257 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26259 {
26262 /* The error message we have to print is too complicated for
26263 cp_parser_error, so we incorporate its actions directly. */
26265 {
26267 name);
26269 }
26271 }
26279 /* If we have resolved the name of a member declaration, check to
26280 see if the declaration is accessible. When the name resolves to
26281 set of overloaded functions, accessibility is checked when
26282 overload resolution is done.
26284 During an explicit instantiation, access is not checked at all,
26285 as per [temp.explicit]. */
26292 }
26294 /* Like cp_parser_lookup_name, but for use in the typical case where
26295 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26296 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26298 static tree
26300 {
26302 none_type,
26307 location);
26308 }
26310 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26311 the current context, return the TYPE_DECL. If TAG_NAME_P is
26312 true, the DECL indicates the class being defined in a class-head,
26313 or declared in an elaborated-type-specifier.
26315 Otherwise, return DECL. */
26317 static tree
26319 {
26320 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26321 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26323 struct A {
26324 template <typename T> struct B;
26325 };
26327 template <typename T> struct A::B {};
26329 Similarly, in an elaborated-type-specifier:
26331 namespace N { struct X{}; }
26333 struct A {
26334 template <typename T> friend struct N::X;
26335 };
26337 However, if the DECL refers to a class type, and we are in
26338 the scope of the class, then the name lookup automatically
26339 finds the TYPE_DECL created by build_self_reference rather
26340 than a TEMPLATE_DECL. For example, in:
26342 template <class T> struct S {
26343 S s;
26344 };
26346 there is no need to handle such case. */
26352 }
26354 /* If too many, or too few, template-parameter lists apply to the
26355 declarator, issue an error message. Returns TRUE if all went well,
26356 and FALSE otherwise. */
26358 static bool
26361 location_t declarator_location)
26362 {
26364 {
26366 {
26375 {
26376 /* If the DECLARATOR has the form `X<y>' then it uses one
26377 additional level of template parameters. */
26380 }
26382 return cp_parser_check_template_parameters
26384 declarator);
26385 }
26401 }
26403 }
26405 /* NUM_TEMPLATES were used in the current declaration. If that is
26406 invalid, return FALSE and issue an error messages. Otherwise,
26407 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26408 declarator and we can print more accurate diagnostics. */
26410 static bool
26414 location_t location,
26416 {
26417 /* If there are the same number of template classes and parameter
26418 lists, that's OK. */
26421 /* If there are more, but only one more, and the name ends in an identifier,
26422 then we are declaring a primary template. That's OK too. */
26426 /* If there are more template classes than parameter lists, we have
26427 something like:
26429 template <class T> void S<T>::R<T>::f (); */
26431 {
26441 else
26444 }
26445 /* Otherwise, there are too many template parameter lists. We have
26446 something like:
26448 template <class T> template <class U> void S::f(); */
26451 }
26453 /* Parse an optional `::' token indicating that the following name is
26454 from the global namespace. If so, PARSER->SCOPE is set to the
26455 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26456 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26457 Returns the new value of PARSER->SCOPE, if the `::' token is
26458 present, and NULL_TREE otherwise. */
26460 static tree
26462 {
26465 /* Peek at the next token. */
26467 /* If we're looking at a `::' token then we're starting from the
26468 global namespace, not our current location. */
26470 {
26471 /* Consume the `::' token. */
26473 /* Set the SCOPE so that we know where to start the lookup. */
26479 }
26481 {
26485 }
26488 }
26490 /* Returns TRUE if the upcoming token sequence is the start of a
26491 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26492 declarator is preceded by the `friend' specifier. */
26494 static bool
26496 {
26499 tree nested_name_specifier;
26502 /* The common case is that this is not a constructor declarator, so
26503 try to avoid doing lots of work if at all possible. It's not
26504 valid declare a constructor at function scope. */
26507 /* And only certain tokens can begin a constructor declarator. */
26515 /* Parse tentatively; we are going to roll back all of the tokens
26516 consumed here. */
26518 /* Assume that we are looking at a constructor declarator. */
26521 /* Look for the optional `::' operator. */
26524 /* Look for the nested-name-specifier. */
26525 nested_name_specifier
26536 /* Outside of a class-specifier, there must be a
26537 nested-name-specifier. Except in C++17 mode, where we
26538 might be declaring a guiding declaration. */
26545 /* If we have a class scope, this is easy; DR 147 says that S::S always
26546 names the constructor, and no other qualified name could. */
26549 {
26559 }
26560 /* If we still think that this might be a constructor-declarator,
26561 look for a class-name. */
26563 {
26564 /* If we have:
26566 template <typename T> struct S {
26567 S();
26568 };
26570 we must recognize that the nested `S' names a class. */
26574 tree type_decl;
26578 none_type,
26585 {
26591 none_type,
26596 else
26598 }
26600 /* If there was no class-name, then this is not a constructor.
26601 Otherwise, if we are in a class-specifier and we aren't
26602 handling a friend declaration, check that its type matches
26603 current_class_type (c++/38313). Note: error_mark_node
26604 is left alone for error recovery purposes. */
26606 && (outside_class_specifier_p
26612 /* If we're still considering a constructor, we have to see a `(',
26613 to begin the parameter-declaration-clause, followed by either a
26614 `)', an `...', or a decl-specifier. We need to check for a
26615 type-specifier to avoid being fooled into thinking that:
26617 S (f) (int);
26619 is a constructor. (It is actually a function named `f' that
26620 takes one parameter (of type `int') and returns a value of type
26621 `S'. */
26629 /* A parameter declaration begins with a decl-specifier,
26630 which is either the "attribute" keyword, a storage class
26631 specifier, or (usually) a type-specifier. */
26633 {
26634 tree type;
26638 /* Names appearing in the type-specifier should be looked up
26639 in the scope of the class. */
26643 {
26646 {
26650 {
26653 }
26654 }
26656 }
26658 /* Inside the constructor parameter list, surrounding
26659 template-parameter-lists do not apply. */
26660 saved_num_template_parameter_lists
26664 /* Look for the type-specifier. */
26666 CP_PARSER_FLAGS_NONE,
26672 parser->num_template_parameter_lists
26675 /* Leave the scope of the class. */
26680 }
26681 }
26683 /* We did not really want to consume any tokens. */
26687 }
26689 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26690 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26691 they must be performed once we are in the scope of the function.
26693 Returns the function defined. */
26695 static tree
26696 cp_parser_function_definition_from_specifiers_and_declarator
26699 tree attributes,
26701 {
26702 tree fn;
26705 /* Begin the function-definition. */
26708 /* The things we're about to see are not directly qualified by any
26709 template headers we've seen thus far. */
26712 /* If there were names looked up in the decl-specifier-seq that we
26713 did not check, check them now. We must wait until we are in the
26714 scope of the function to perform the checks, since the function
26715 might be a friend. */
26719 {
26724 }
26727 {
26728 /* Skip the entire function. */
26731 }
26733 {
26734 /* Seen already, skip it. An error message has already been output. */
26738 /* If this is a function from a class, pop the nested class. */
26741 }
26742 else
26743 {
26744 timevar_id_t tv;
26747 else
26753 }
26756 }
26758 /* Parse the part of a function-definition that follows the
26759 declarator. INLINE_P is TRUE iff this function is an inline
26760 function defined within a class-specifier.
26762 Returns the function defined. */
26764 static tree
26767 {
26768 tree fn;
26773 bool fully_implicit_function_template_p
26776 tree implicit_template_parms
26779 cp_binding_level* implicit_template_scope
26785 /* If the next token is `return', then the code may be trying to
26786 make use of the "named return value" extension that G++ used to
26787 support. */
26790 {
26791 /* Consume the `return' keyword. */
26793 /* Look for the identifier that indicates what value is to be
26794 returned. */
26796 /* Issue an error message. */
26799 /* Skip tokens until we reach the start of the function body. */
26801 {
26808 }
26809 }
26810 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26811 anything declared inside `f'. */
26812 saved_in_unbraced_linkage_specification_p
26815 /* Inside the function, surrounding template-parameter-lists do not
26816 apply. */
26817 saved_num_template_parameter_lists
26821 /* If the next token is `try', `__transaction_atomic', or
26822 `__transaction_relaxed`, then we are looking at either function-try-block
26823 or function-transaction-block. Note that all of these include the
26824 function-body. */
26828 RID_TRANSACTION_RELAXED))
26832 else
26833 cp_parser_ctor_initializer_opt_and_function_body
26836 /* Finish the function. */
26838 /* Generate code for it, if necessary. */
26840 /* Restore the saved values. */
26841 parser->in_unbraced_linkage_specification_p
26843 parser->num_template_parameter_lists
26847 parser->fully_implicit_function_template_p
26849 parser->implicit_template_parms
26851 parser->implicit_template_scope
26858 }
26860 /* Parse a template-declaration body (following argument list). */
26862 static void
26864 tree parameter_list,
26866 {
26870 /* We just processed one more parameter list. */
26873 /* Get the deferred access checks from the parameter list. These
26874 will be checked once we know what is being declared, as for a
26875 member template the checks must be performed in the scope of the
26876 class containing the member. */
26879 /* Tentatively parse for a new template parameter list, which can either be
26880 the template keyword or a template introduction. */
26886 else
26887 {
26888 /* There are no access checks when parsing a template, as we do not
26889 know if a specialization will be a friend. */
26893 checks,
26894 member_p,
26899 /* If this is a member template declaration, let the front
26900 end know. */
26902 {
26907 }
26912 }
26913 /* We are done with the current parameter list. */
26918 /* Finish up. */
26921 /* Check the template arguments for a literal operator template. */
26925 {
26929 else
26930 {
26933 {
26939 }
26941 {
26950 }
26951 else
26953 }
26955 {
26958 " Expected non-type template argument pack <char...>"
26960 decl);
26961 else
26964 decl);
26965 }
26966 }
26968 /* Register member declarations. */
26971 /* If DECL is a function template, we must return to parse it later.
26972 (Even though there is no definition, there might be default
26973 arguments that need handling.) */
26977 }
26979 /* Parse a template introduction header for a template-declaration. Returns
26980 false if tentative parse fails. */
26982 static bool
26984 {
26991 /* Look for the optional `::' operator. */
26994 /* Look for the nested-name-specifier. */
27004 /* Look up the concept for which we will be matching
27005 template parameters. */
27015 /* Look for opening brace for introduction. */
27016 matching_braces braces;
27024 /* Build vector of placeholder parameters and grab
27025 matching identifiers. */
27028 /* The introduction-list shall not be empty. */
27031 {
27034 }
27036 /* Look for closing brace for introduction. */
27041 {
27045 }
27047 /* Build and associate the constraint. */
27050 {
27052 member_p);
27054 }
27058 }
27060 /* Parse a normal template-declaration following the template keyword. */
27062 static void
27064 {
27065 tree parameter_list;
27069 /* Look for the `<' token. */
27073 {
27074 /* 14.5.2.2 [temp.mem]
27076 A local class shall not have member templates. */
27081 }
27082 /* [temp]
27084 A template ... shall not have C linkage. */
27086 {
27089 /* Give it C++ linkage to avoid confusing other parts of the
27090 front end. */
27093 }
27094 else
27097 /* We cannot perform access checks on the template parameter
27098 declarations until we know what is being declared, just as we
27099 cannot check the decl-specifier list. */
27102 /* If the next token is `>', then we have an invalid
27103 specialization. Rather than complain about an invalid template
27104 parameter, issue an error message here. */
27106 {
27110 }
27111 else
27112 {
27113 /* Parse the template parameters. */
27115 }
27117 /* Look for the `>'. */
27120 /* Manage template requirements */
27122 {
27127 }
27130 member_p);
27132 /* For the erroneous case of a template with C linkage, we pushed an
27133 implicit C++ linkage scope; exit that scope now. */
27136 }
27138 /* Parse a template-declaration, assuming that the `export' (and
27139 `extern') keywords, if present, has already been scanned. MEMBER_P
27140 is as for cp_parser_template_declaration. */
27142 static bool
27144 {
27146 {
27150 }
27155 }
27157 /* Perform the deferred access checks from a template-parameter-list.
27158 CHECKS is a TREE_LIST of access checks, as returned by
27159 get_deferred_access_checks. */
27161 static void
27162 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27163 {
27167 }
27169 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27170 `function-definition' sequence that follows a template header.
27171 If MEMBER_P is true, this declaration appears in a class scope.
27173 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27174 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27176 static tree
27182 {
27185 cp_decl_specifier_seq decl_specifiers;
27189 /* This function is only used when processing a template
27190 declaration. */
27194 /* Defer access checks until we know what is being declared. */
27197 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27198 alternative. */
27201 CP_PARSER_FLAGS_OPTIONAL,
27207 /* There are no template typedefs. */
27209 {
27213 }
27215 /* Gather up the access checks that occurred the
27216 decl-specifier-seq. */
27219 /* Check for the declaration of a template class. */
27221 {
27224 {
27225 // If this is a declaration, but not a definition, associate
27226 // any constraints with the type declaration. Constraints
27227 // are associated with definitions in cp_parser_class_specifier.
27233 /* In this case:
27235 struct C {
27236 friend template <typename T> struct A<T>::B;
27237 };
27239 A<T>::B will be represented by a TYPENAME_TYPE, and
27240 therefore not recognized by shadow_tag. */
27242 && !decl
27249 else
27252 /* Perform access checks for template parameters. */
27255 /* Give a helpful diagnostic for
27256 template <class T> struct A { } a;
27257 if we aren't already recovering from an error. */
27260 {
27262 "a class template declaration must not declare "
27266 }
27267 }
27268 }
27270 /* Complain about missing 'typename' or other invalid type names. */
27273 {
27274 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27275 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27276 the rest of this declaration. */
27279 }
27281 /* If it's not a template class, try for a template function. If
27282 the next token is a `;', then this declaration does not declare
27283 anything. But, if there were errors in the decl-specifiers, then
27284 the error might well have come from an attempted class-specifier.
27285 In that case, there's no need to warn about a missing declarator. */
27289 {
27292 checks,
27294 member_p,
27295 declares_class_or_enum,
27299 /* 7.1.1-1 [dcl.stc]
27301 A storage-class-specifier shall not be specified in an explicit
27302 specialization... */
27304 && explicit_specialization_p
27306 {
27310 }
27314 }
27316 /* Look for a trailing `;' after the declaration. */
27322 out:
27325 /* Clear any current qualification; whatever comes next is the start
27326 of something new. */
27332 }
27334 /* Parse a cast-expression that is not the operand of a unary "&". */
27336 static cp_expr
27338 {
27341 }
27343 /* Parse a functional cast to TYPE. Returns an expression
27344 representing the cast. */
27346 static cp_expr
27348 {
27350 tree expression_list;
27351 cp_expr cast;
27360 {
27370 /* Create a location of the form:
27371 type_name{i, f}
27372 ^~~~~~~~~~~~~~~
27373 with caret == start at the start of the type name,
27374 finishing at the closing brace. */
27375 location_t finish_loc
27378 finish_loc);
27381 }
27390 else
27391 {
27394 }
27397 tf_warning_or_error);
27398 /* [expr.const]/1: In an integral constant expression "only type
27399 conversions to integral or enumeration type can be used". */
27405 NIC_CONSTRUCTOR))
27408 /* Create a location of the form:
27409 float(i)
27410 ^~~~~~~~
27411 with caret == start at the start of the type name,
27412 finishing at the closing paren. */
27413 location_t finish_loc
27418 }
27420 /* Save the tokens that make up the body of a member function defined
27421 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27422 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27423 specifiers applied to the declaration. Returns the FUNCTION_DECL
27424 for the member function. */
27426 static tree
27430 tree attributes)
27431 {
27434 tree fn;
27437 /* Create the FUNCTION_DECL. */
27441 /* If something went badly wrong, bail out now. */
27443 {
27444 /* If there's a function-body, skip it. */
27449 }
27451 /* Remember it, if there default args to post process. */
27454 /* Save away the tokens that make up the body of the
27455 function. */
27461 RID_TRANSACTION_ATOMIC))
27462 {
27464 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27471 {
27477 }
27478 else
27481 {
27485 }
27486 }
27488 /* Handle function try blocks. */
27490 {
27493 }
27494 /* We can have braced-init-list mem-initializers before the fn body. */
27496 {
27499 {
27500 /* cache_group will stop after an un-nested { } pair, too. */
27504 /* variadic mem-inits have ... after the ')'. */
27507 }
27508 }
27510 /* Handle function try blocks. */
27516 /* Save away the inline definition; we will process it when the
27517 class is complete. */
27521 /* We need to know that this was defined in the class, so that
27522 friend templates are handled correctly. */
27525 /* Add FN to the queue of functions to be parsed later. */
27529 }
27531 /* Save the tokens that make up the in-class initializer for a non-static
27532 data member. Returns a DEFAULT_ARG. */
27534 static tree
27536 {
27538 }
27540 /* Parse a template-argument-list, as well as the trailing ">" (but
27541 not the opening "<"). See cp_parser_template_argument_list for the
27542 return value. */
27544 static tree
27546 {
27547 tree arguments;
27548 tree saved_scope;
27549 tree saved_qualifying_scope;
27550 tree saved_object_scope;
27555 /* [temp.names]
27557 When parsing a template-id, the first non-nested `>' is taken as
27558 the end of the template-argument-list rather than a greater-than
27559 operator. */
27560 saved_greater_than_is_operator_p
27563 /* Parsing the argument list may modify SCOPE, so we save it
27564 here. */
27568 /* We need to evaluate the template arguments, even though this
27569 template-id may be nested within a "sizeof". */
27574 /* Parse the template-argument-list itself. */
27578 else
27580 /* Look for the `>' that ends the template-argument-list. If we find
27581 a '>>' instead, it's probably just a typo. */
27583 {
27585 {
27586 /* In C++0x, a `>>' in a template argument list or cast
27587 expression is considered to be two separate `>'
27588 tokens. So, change the current token to a `>', but don't
27589 consume it: it will be consumed later when the outer
27590 template argument list (or cast expression) is parsed.
27591 Note that this replacement of `>' for `>>' is necessary
27592 even if we are parsing tentatively: in the tentative
27593 case, after calling
27594 cp_parser_enclosed_template_argument_list we will always
27595 throw away all of the template arguments and the first
27596 closing `>', either because the template argument list
27597 was erroneous or because we are replacing those tokens
27598 with a CPP_TEMPLATE_ID token. The second `>' (which will
27599 not have been thrown away) is needed either to close an
27600 outer template argument list or to complete a new-style
27601 cast. */
27604 }
27606 {
27607 /* If we're in a nested template argument list, the '>>' has
27608 to be a typo for '> >'. We emit the error message, but we
27609 continue parsing and we push a '>' as next token, so that
27610 the argument list will be parsed correctly. Note that the
27611 global source location is still on the token before the
27612 '>>', so we need to say explicitly where we want it. */
27620 }
27621 else
27622 {
27623 /* If this is not a nested template argument list, the '>>'
27624 is a typo for '>'. Emit an error message and continue.
27625 Same deal about the token location, but here we can get it
27626 right by consuming the '>>' before issuing the diagnostic. */
27629 "spurious %<>>%>, use %<>%> to terminate "
27631 }
27632 }
27633 else
27635 /* The `>' token might be a greater-than operator again now. */
27636 parser->greater_than_is_operator_p
27638 /* Restore the SAVED_SCOPE. */
27646 }
27648 /* MEMBER_FUNCTION is a member function, or a friend. If default
27649 arguments, or the body of the function have not yet been parsed,
27650 parse them now. */
27652 static void
27654 {
27656 /* If this member is a template, get the underlying
27657 FUNCTION_DECL. */
27661 /* There should not be any class definitions in progress at this
27662 point; the bodies of members are only parsed outside of all class
27663 definitions. */
27665 /* While we're parsing the member functions we might encounter more
27666 classes. We want to handle them right away, but we don't want
27667 them getting mixed up with functions that are currently in the
27668 queue. */
27671 /* Make sure that any template parameters are in scope. */
27674 /* If the body of the function has not yet been parsed, parse it
27675 now. */
27677 {
27678 tree function_scope;
27681 /* The function is no longer pending; we are processing it. */
27686 /* If this is a local class, enter the scope of the containing
27687 function. */
27692 /* Push the body of the function onto the lexer stack. */
27695 /* Let the front end know that we going to be defining this
27696 function. */
27700 /* Don't do access checking if it is a templated function. */
27704 /* #pragma omp declare reduction needs special parsing. */
27706 {
27711 }
27712 else
27713 /* Now, parse the body of the function. */
27720 /* Leave the scope of the containing function. */
27724 }
27726 /* Remove any template parameters from the symbol table. */
27729 /* Restore the queue. */
27732 }
27734 /* If DECL contains any default args, remember it on the unparsed
27735 functions queue. */
27737 static void
27739 {
27740 tree probe;
27743 probe;
27746 {
27750 }
27751 }
27753 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27754 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27755 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27756 from the parameter-type-list. */
27758 static tree
27761 {
27763 tree parsed_arg;
27769 /* Push the saved tokens for the default argument onto the parser's
27770 lexer stack. */
27776 /* Parse the default argument. */
27787 {
27788 /* In a non-template class, check conversions now. In a template,
27789 we'll wait and instantiate these as needed. */
27792 tf_warning_or_error);
27795 else
27797 }
27799 /* If the token stream has not been completely used up, then
27800 there was extra junk after the end of the default
27801 argument. */
27803 {
27806 else
27808 }
27810 /* Revert to the main lexer. */
27814 }
27816 /* FIELD is a non-static data member with an initializer which we saved for
27817 later; parse it now. */
27819 static void
27821 {
27822 tree def;
27829 NULL_TREE);
27835 }
27837 /* FN is a FUNCTION_DECL which may contains a parameter with an
27838 unparsed DEFAULT_ARG. Parse the default args now. This function
27839 assumes that the current scope is the scope in which the default
27840 argument should be processed. */
27842 static void
27844 {
27848 /* While we're parsing the default args, we might (due to the
27849 statement expression extension) encounter more classes. We want
27850 to handle them right away, but we don't want them getting mixed
27851 up with default args that are currently in the queue. */
27854 /* Local variable names (and the `this' keyword) may not appear
27855 in a default argument. */
27866 {
27868 tree parsed_arg;
27870 tree copy;
27877 /* This can happen for a friend declaration for a function
27878 already declared with default arguments. */
27881 parsed_arg
27883 default_arg,
27887 /* Update any instantiations we've already created. */
27891 }
27895 /* Make sure no default arg is missing. */
27898 /* Restore the state of local_variables_forbidden_p. */
27901 /* Restore the queue. */
27903 }
27905 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27907 sizeof ... ( identifier )
27909 where the 'sizeof' token has already been consumed. */
27911 static tree
27913 {
27914 /* Consume the `...'. */
27918 matching_parens parens;
27922 else
27930 /* The name is not qualified. */
27949 }
27951 /* Parse the operand of `sizeof' (or a similar operator). Returns
27952 either a TYPE or an expression, depending on the form of the
27953 input. The KEYWORD indicates which kind of expression we have
27954 encountered. */
27956 static tree
27958 {
27965 /* If it's a `...', then we are computing the length of a parameter
27966 pack. */
27971 /* Types cannot be defined in a `sizeof' expression. Save away the
27972 old message. */
27974 /* And create the new one. */
27980 /* The restrictions on constant-expressions do not apply inside
27981 sizeof expressions. */
27982 saved_integral_constant_expression_p
27984 saved_non_integral_constant_expression_p
27988 /* Do not actually evaluate the expression. */
27991 /* If it's a `(', then we might be looking at the type-id
27992 construction. */
27994 {
27997 /* We can't be sure yet whether we're looking at a type-id or an
27998 expression. */
28001 matching_parens parens;
28004 /* Note: as a GNU Extension, compound literals are considered
28005 postfix-expressions as they are in C99, so they are valid
28006 arguments to sizeof. See comment in cp_parser_cast_expression
28007 for details. */
28010 else
28011 {
28014 /* Look for the type-id. */
28016 /* Look for the closing `)'. */
28019 }
28021 /* If all went well, then we're done. */
28023 {
28024 cp_decl_specifier_seq decl_specs;
28026 /* Build a trivial decl-specifier-seq. */
28030 /* Call grokdeclarator to figure out what type this is. */
28033 TYPENAME,
28036 }
28037 }
28039 /* If the type-id production did not work out, then we must be
28040 looking at the unary-expression production. */
28044 /* Go back to evaluating expressions. */
28048 /* Free the message we created. */
28050 /* And restore the old one. */
28052 parser->integral_constant_expression_p
28054 parser->non_integral_constant_expression_p
28058 }
28060 /* If the current declaration has no declarator, return true. */
28062 static bool
28064 {
28065 /* If the next token is a `;' or a `,' then there is no
28066 declarator. */
28069 }
28071 /* Update the DECL_SPECS to reflect the storage class indicated by
28072 KEYWORD. */
28074 static void
28079 {
28080 cp_storage_class storage_class;
28083 {
28087 }
28089 {
28092 }
28097 {
28100 }
28103 {
28121 }
28125 /* A storage class specifier cannot be applied alongside a typedef
28126 specifier. If there is a typedef specifier present then set
28127 conflicting_specifiers_p which will trigger an error later
28128 on in grokdeclarator. */
28131 }
28133 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28134 is true, the type is a class or enum definition. */
28136 static void
28138 tree type_spec,
28141 {
28144 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28145 (with, for example, in "typedef int wchar_t;") we remember that
28146 this is what happened. In system headers, we ignore these
28147 declarations so that G++ can work with system headers that are not
28148 C++-safe. */
28150 && !type_definition_p
28160 {
28163 ds_redefined_builtin_type_spec,
28164 token);
28166 {
28170 }
28171 }
28174 else
28175 {
28180 }
28181 }
28183 /* True iff TOKEN is the GNU keyword __thread. */
28185 static bool
28187 {
28190 }
28192 /* Set the location for a declarator specifier and check if it is
28193 duplicated.
28195 DECL_SPECS is the sequence of declarator specifiers onto which to
28196 set the location.
28198 DS is the single declarator specifier to set which location is to
28199 be set onto the existing sequence of declarators.
28201 LOCATION is the location for the declarator specifier to
28202 consider. */
28204 static void
28207 {
28216 {
28220 }
28221 else
28222 {
28224 {
28228 else
28229 {
28232 OPT_Wlong_long,
28234 }
28235 }
28237 {
28242 else
28243 {
28247 }
28248 }
28249 else
28250 {
28266 "__complex"
28267 };
28271 }
28272 }
28273 }
28275 /* Return true iff the declarator specifier DS is present in the
28276 sequence of declarator specifiers DECL_SPECS. */
28278 bool
28280 cp_decl_spec ds)
28281 {
28288 }
28290 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28291 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28293 static bool
28295 {
28297 }
28299 /* Issue an error message indicating that TOKEN_DESC was expected.
28300 If KEYWORD is true, it indicated this function is called by
28301 cp_parser_require_keword and the required token can only be
28302 a indicated keyword.
28304 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28305 within any error as the location of an "opening" token matching
28306 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28307 RT_CLOSE_PAREN). */
28309 static void
28311 required_token token_desc,
28313 location_t matching_location)
28314 {
28320 {
28389 }
28392 {
28394 {
28472 }
28473 }
28477 }
28480 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28481 issue an error message indicating that TOKEN_DESC was expected.
28483 Returns the token consumed, if the token had the appropriate type.
28484 Otherwise, returns NULL.
28486 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28487 within any error as the location of an "opening" token matching
28488 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28489 RT_CLOSE_PAREN). */
28494 required_token token_desc,
28495 location_t matching_location)
28496 {
28499 else
28500 {
28501 /* Output the MESSAGE -- unless we're parsing tentatively. */
28504 matching_location);
28506 }
28507 }
28509 /* An error message is produced if the next token is not '>'.
28510 All further tokens are skipped until the desired token is
28511 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28513 static void
28515 {
28516 /* Current level of '< ... >'. */
28518 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28521 /* Are we ready, yet? If not, issue error message. */
28525 /* Skip tokens until the desired token is found. */
28527 {
28528 /* Peek at the next token. */
28530 {
28538 /* C++0x views the `>>' operator as two `>' tokens, but
28539 C++98 does not. */
28542 {
28543 /* We've hit a `>>' where the first `>' closes the
28544 template argument list, and the second `>' is
28545 spurious. Just consume the `>>' and stop; we've
28546 already produced at least one error. */
28549 }
28550 /* Fall through for C++0x, so we handle the second `>' in
28551 the `>>'. */
28556 {
28557 /* We've reached the token we want, consume it and stop. */
28560 }
28579 /* The '>' was probably forgotten, don't look further. */
28584 }
28586 /* Consume this token. */
28588 }
28589 }
28591 /* If the next token is the indicated keyword, consume it. Otherwise,
28592 issue an error message indicating that TOKEN_DESC was expected.
28594 Returns the token consumed, if the token had the appropriate type.
28595 Otherwise, returns NULL. */
28600 required_token token_desc)
28601 {
28605 {
28607 UNKNOWN_LOCATION);
28609 }
28612 }
28614 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28615 function-definition. */
28617 static bool
28619 {
28622 /* A ctor-initializer begins with a `:'. */
28624 /* A function-try-block begins with `try'. */
28626 /* A function-transaction-block begins with `__transaction_atomic'
28627 or `__transaction_relaxed'. */
28630 /* The named return value extension begins with `return'. */
28632 }
28634 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28635 definition. */
28637 static bool
28639 {
28646 }
28648 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28649 C++0x) ending a template-argument. */
28651 static bool
28653 {
28661 }
28663 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28664 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28666 static bool
28669 {
28675 /* Check for the sequence `<::' in the original code. It would be lexed as
28676 `[:', where `[' is a digraph, and there is no whitespace before
28677 `:'. */
28679 {
28684 }
28686 }
28688 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28689 or none_type otherwise. */
28691 static enum tag_types
28693 {
28695 {
28705 }
28706 }
28708 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28709 or none_type otherwise or if the token is null. */
28711 static enum tag_types
28713 {
28718 {
28726 }
28727 }
28729 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28731 static void
28733 {
28737 {
28741 type))
28744 }
28745 }
28747 /* Issue an error message if DECL is redeclared with different
28748 access than its original declaration [class.access.spec/3].
28749 This applies to nested classes, nested class templates and
28750 enumerations [class.mem/1]. */
28752 static void
28754 {
28765 }
28767 /* Look for the `template' keyword, as a syntactic disambiguator.
28768 Return TRUE iff it is present, in which case it will be
28769 consumed. */
28771 static bool
28773 {
28775 {
28776 /* In C++98 the `template' keyword can only be used within templates;
28777 outside templates the parser can always figure out what is a
28778 template and what is not. In C++11, per the resolution of DR 468,
28779 `template' is allowed in cases where it is not strictly necessary. */
28782 {
28785 "in C++98 %<template%> (as a disambiguator) is only "
28787 /* If this part of the token stream is rescanned, the same
28788 error message would be generated. So, we purge the token
28789 from the stream. */
28792 }
28793 else
28794 {
28795 /* Consume the `template' keyword. */
28798 }
28799 }
28801 }
28803 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28804 set PARSER->SCOPE, and perform other related actions. */
28806 static void
28808 {
28811 /* Get the stored value. */
28813 /* Set the scope from the stored value. */
28817 }
28819 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28820 encounter the end of a block before what we were looking for. */
28822 static bool
28826 {
28828 {
28831 /* Abort a parenthesized expression if we encounter a semicolon. */
28835 /* If we've reached the end of the file, stop. */
28841 /* We've hit the end of an enclosing block, so there's been some
28842 kind of syntax error. */
28845 /* Consume the token. */
28847 /* See if it starts a new group. */
28849 {
28851 /* In theory this should probably check end == '}', but
28852 cp_parser_save_member_function_body needs it to exit
28853 after either '}' or ')' when called with ')'. */
28856 }
28858 {
28862 }
28867 }
28868 }
28870 /* Like above, for caching a default argument or NSDMI. Both of these are
28871 terminated by a non-nested comma, but it can be unclear whether or not a
28872 comma is nested in a template argument list unless we do more parsing.
28873 In order to handle this ambiguity, when we encounter a ',' after a '<'
28874 we try to parse what follows as a parameter-declaration-list (in the
28875 case of a default argument) or a member-declarator (in the case of an
28876 NSDMI). If that succeeds, then we stop caching. */
28878 static tree
28880 {
28885 tree default_argument;
28887 /* Add tokens until we have processed the entire default
28888 argument. We add the range [first_token, token). */
28891 {
28892 /* For list-initialization, this is straightforward. */
28895 }
28897 {
28900 /* Peek at the next token. */
28902 /* What we do depends on what token we have. */
28904 {
28905 /* In valid code, a default argument must be
28906 immediately followed by a `,' `)', or `...'. */
28909 {
28910 /* If we've seen a '<', we might be in a
28911 template-argument-list. Until Core issue 325 is
28912 resolved, we don't know how this situation ought
28913 to be handled, so try to DTRT. We check whether
28914 what comes after the comma is a valid parameter
28915 declaration list. If it is, then the comma ends
28916 the default argument; otherwise the default
28917 argument continues. */
28921 /* Set ITALP so cp_parser_parameter_declaration_list
28922 doesn't decide to commit to this parse. */
28929 {
28930 /* Parse declarators until we reach a non-comma or
28931 somthing that cannot be an initializer.
28932 Just checking whether we're looking at a single
28933 declarator is insufficient. Consider:
28934 int var = tuple<T,U>::x;
28935 The template parameter 'U' looks exactly like a
28936 declarator. */
28937 do
28938 {
28949 }
28951 /* If we met an '=' or ';' then the original comma
28952 was the end of the NSDMI. Otherwise assume
28953 we're still in the NSDMI. */
28956 }
28957 else
28958 {
28963 }
28970 }
28971 /* FALLTHRU */
28974 /* If we run into a non-nested `;', `}', or `]',
28975 then the code is invalid -- but the default
28976 argument is certainly over. */
28981 /* Handle correctly int n = sizeof ... ( p ); */
28984 /* Update DEPTH, if necessary. */
28999 /* This might be the comparison operator, or it might
29000 start a template argument list. */
29007 /* Fall through for C++0x, which treats the `>>'
29008 operator like two `>' tokens in certain
29009 cases. */
29014 {
29015 /* This might be an operator, or it might close a
29016 template argument list. But if a previous '<'
29017 started a template argument list, this will have
29018 closed it, so we can't be in one anymore. */
29022 }
29025 /* If we run out of tokens, issue an error message. */
29033 /* In these cases, we should look for template-ids.
29034 For example, if the default argument is
29035 `X<int, double>()', we need to do name lookup to
29036 figure out whether or not `X' is a template; if
29037 so, the `,' does not end the default argument.
29039 That is not yet done. */
29044 }
29046 /* If we've reached the end, stop. */
29050 /* Add the token to the token block. */
29052 }
29054 /* Create a DEFAULT_ARG to represent the unparsed default
29055 argument. */
29062 }
29064 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29066 location_t
29068 {
29073 }
29075 /* Begin parsing tentatively. We always save tokens while parsing
29076 tentatively so that if the tentative parsing fails we can restore the
29077 tokens. */
29079 static void
29081 {
29082 /* Enter a new parsing context. */
29084 /* Begin saving tokens. */
29086 /* In order to avoid repetitive access control error messages,
29087 access checks are queued up until we are no longer parsing
29088 tentatively. */
29090 }
29092 /* Commit to the currently active tentative parse. */
29094 static void
29096 {
29100 /* Mark all of the levels as committed. */
29103 {
29110 }
29111 }
29113 /* Commit to the topmost currently active tentative parse.
29115 Note that this function shouldn't be called when there are
29116 irreversible side-effects while in a tentative state. For
29117 example, we shouldn't create a permanent entry in the symbol
29118 table, or issue an error message that might not apply if the
29119 tentative parse is aborted. */
29121 static void
29123 {
29128 {
29136 }
29137 }
29139 /* Abort the currently active tentative parse. All consumed tokens
29140 will be rolled back, and no diagnostics will be issued. */
29142 static void
29144 {
29148 /* Now, pretend that we want to see if the construct was
29149 successfully parsed. */
29151 }
29153 /* Stop parsing tentatively. If a parse error has occurred, restore the
29154 token stream. Otherwise, commit to the tokens we have consumed.
29155 Returns true if no error occurred; false otherwise. */
29157 static bool
29159 {
29163 /* Remember whether or not an error occurred, since we are about to
29164 destroy that information. */
29166 /* Remove the topmost context from the stack. */
29169 /* If no parse errors occurred, commit to the tentative parse. */
29171 {
29172 /* Commit to the tokens read tentatively, unless that was
29173 already done. */
29178 }
29179 /* Otherwise, if errors occurred, roll back our state so that things
29180 are just as they were before we began the tentative parse. */
29181 else
29182 {
29185 }
29186 /* Add the context to the front of the free list. */
29191 }
29193 /* Returns true if we are parsing tentatively and are not committed to
29194 this tentative parse. */
29196 static bool
29198 {
29201 }
29203 /* Returns nonzero iff an error has occurred during the most recent
29204 tentative parse. */
29206 static bool
29208 {
29211 }
29213 /* Returns nonzero if GNU extensions are allowed. */
29215 static bool
29217 {
29219 }
29220 \f
29221 /* Objective-C++ Productions */
29224 /* Parse an Objective-C expression, which feeds into a primary-expression
29225 above.
29227 objc-expression:
29228 objc-message-expression
29229 objc-string-literal
29230 objc-encode-expression
29231 objc-protocol-expression
29232 objc-selector-expression
29234 Returns a tree representation of the expression. */
29236 static cp_expr
29238 {
29239 /* Try to figure out what kind of declaration is present. */
29243 {
29253 {
29265 }
29266 /* FALLTHRU */
29272 }
29275 }
29277 /* Parse an Objective-C message expression.
29279 objc-message-expression:
29280 [ objc-message-receiver objc-message-args ]
29282 Returns a representation of an Objective-C message. */
29284 static tree
29286 {
29298 /* Construct a location e.g.
29299 [self func1:5]
29300 ^~~~~~~~~~~~~~
29301 ranging from the '[' to the ']', with the caret at the start. */
29306 }
29308 /* Parse an objc-message-receiver.
29310 objc-message-receiver:
29311 expression
29312 simple-type-specifier
29314 Returns a representation of the type or expression. */
29316 static tree
29318 {
29319 tree rcv;
29321 /* An Objective-C message receiver may be either (1) a type
29322 or (2) an expression. */
29326 /* If that worked out, fine. */
29333 CP_PARSER_FLAGS_NONE);
29340 }
29342 /* Parse the arguments and selectors comprising an Objective-C message.
29344 objc-message-args:
29345 objc-selector
29346 objc-selector-args
29347 objc-selector-args , objc-comma-args
29349 objc-selector-args:
29350 objc-selector [opt] : assignment-expression
29351 objc-selector-args objc-selector [opt] : assignment-expression
29353 objc-comma-args:
29354 assignment-expression
29355 objc-comma-args , assignment-expression
29357 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29358 selector arguments and TREE_VALUE containing a list of comma
29359 arguments. */
29361 static tree
29363 {
29369 {
29375 /* Detect if we have a unary selector. */
29384 sel_args
29389 }
29391 /* Handle non-selector arguments, if any. */
29393 {
29394 tree arg;
29399 addl_args
29404 }
29407 {
29410 }
29413 }
29415 /* Parse an Objective-C encode expression.
29417 objc-encode-expression:
29418 @encode objc-typename
29420 Returns an encoded representation of the type argument. */
29422 static cp_expr
29424 {
29425 tree type;
29430 matching_parens parens;
29437 {
29441 }
29443 /* This happens if we find @encode(T) (where T is a template
29444 typename or something dependent on a template typename) when
29445 parsing a template. In that case, we can't compile it
29446 immediately, but we rather create an AT_ENCODE_EXPR which will
29447 need to be instantiated when the template is used.
29448 */
29450 {
29454 }
29457 /* Build a location of the form:
29458 @encode(int)
29459 ^~~~~~~~~~~~
29460 with caret==start at the @ token, finishing at the close paren. */
29461 location_t combined_loc
29466 }
29468 /* Parse an Objective-C @defs expression. */
29470 static tree
29472 {
29473 tree name;
29476 matching_parens parens;
29482 }
29484 /* Parse an Objective-C protocol expression.
29486 objc-protocol-expression:
29487 @protocol ( identifier )
29489 Returns a representation of the protocol expression. */
29491 static tree
29493 {
29494 tree proto;
29498 matching_parens parens;
29503 /* Build a location of the form:
29504 @protocol(prot)
29505 ^~~~~~~~~~~~~~~
29506 with caret==start at the @ token, finishing at the close paren. */
29507 location_t combined_loc
29513 }
29515 /* Parse an Objective-C selector expression.
29517 objc-selector-expression:
29518 @selector ( objc-method-signature )
29520 objc-method-signature:
29521 objc-selector
29522 objc-selector-seq
29524 objc-selector-seq:
29525 objc-selector :
29526 objc-selector-seq objc-selector :
29528 Returns a representation of the method selector. */
29530 static tree
29532 {
29539 matching_parens parens;
29545 {
29554 {
29555 /* Detect if we have a unary selector. */
29557 {
29560 }
29561 else
29562 {
29564 }
29565 }
29570 {
29571 sel_seq
29574 sel_seq
29577 }
29578 else
29579 sel_seq
29584 }
29586 finish_selector:
29590 /* Build a location of the form:
29591 @selector(func)
29592 ^~~~~~~~~~~~~~~
29593 with caret==start at the @ token, finishing at the close paren. */
29594 location_t combined_loc
29598 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29601 }
29603 /* Parse a list of identifiers.
29605 objc-identifier-list:
29606 identifier
29607 objc-identifier-list , identifier
29609 Returns a TREE_LIST of identifier nodes. */
29611 static tree
29613 {
29614 tree identifier;
29615 tree list;
29626 {
29633 identifier));
29635 }
29638 }
29640 /* Parse an Objective-C alias declaration.
29642 objc-alias-declaration:
29643 @compatibility_alias identifier identifier ;
29645 This function registers the alias mapping with the Objective-C front end.
29646 It returns nothing. */
29648 static void
29650 {
29658 }
29660 /* Parse an Objective-C class forward-declaration.
29662 objc-class-declaration:
29663 @class objc-identifier-list ;
29665 The function registers the forward declarations with the Objective-C
29666 front end. It returns nothing. */
29668 static void
29670 {
29673 {
29674 tree id;
29684 else
29686 }
29688 }
29690 /* Parse a list of Objective-C protocol references.
29692 objc-protocol-refs-opt:
29693 objc-protocol-refs [opt]
29695 objc-protocol-refs:
29696 < objc-identifier-list >
29698 Returns a TREE_LIST of identifiers, if any. */
29700 static tree
29702 {
29706 {
29710 }
29713 }
29715 /* Parse a Objective-C visibility specification. */
29717 static void
29719 {
29723 {
29738 }
29740 /* Eat '@private'/'@protected'/'@public'. */
29742 }
29744 /* Parse an Objective-C method type. Return 'true' if it is a class
29745 (+) method, and 'false' if it is an instance (-) method. */
29749 {
29752 else
29754 }
29756 /* Parse an Objective-C protocol qualifier. */
29758 static tree
29760 {
29773 {
29778 }
29781 }
29783 /* Parse an Objective-C typename. */
29785 static tree
29787 {
29791 {
29794 matching_parens parens;
29798 /* An ObjC type name may consist of just protocol qualifiers, in which
29799 case the type shall default to 'id'. */
29801 {
29804 /* If the type could not be parsed, an error has already
29805 been produced. For error recovery, behave as if it had
29806 not been specified, which will use the default type
29807 'id'. */
29809 {
29811 /* We need to skip to the closing parenthesis as
29812 cp_parser_type_id() does not seem to do it for
29813 us. */
29818 }
29819 }
29823 }
29826 }
29828 /* Check to see if TYPE refers to an Objective-C selector name. */
29830 static bool
29832 {
29838 }
29840 /* Parse an Objective-C selector. */
29842 static tree
29844 {
29848 {
29851 }
29853 /* C++ operator names are allowed to appear in ObjC selectors. */
29855 {
29868 }
29869 }
29871 /* Parse an Objective-C params list. */
29873 static tree
29875 {
29881 {
29891 /* Detect if we have a unary selector. */
29894 {
29897 }
29901 {
29902 /* Something went quite wrong. There should be a colon
29903 here, but there is not. Stop parsing parameters. */
29905 }
29907 /* New ObjC allows attributes on parameters too. */
29912 params
29915 type_name,
29916 identifier,
29917 parm_attr));
29920 }
29923 {
29926 }
29928 /* We allow tail attributes for the method. */
29930 {
29938 }
29941 {
29944 }
29946 }
29948 /* Parse the non-keyword Objective-C params. */
29950 static tree
29953 {
29959 {
29961 tree parm;
29967 {
29972 }
29974 /* TODO: parse attributes for tail parameters. */
29983 }
29985 /* We allow tail attributes for the method. */
29987 {
29989 {
29994 }
29995 else
29996 /* We have an error, but parse the attributes, so that we can
29997 carry on. */
30003 }
30006 }
30008 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30010 static void
30012 {
30015 /* If the next token is `extern' and the following token is a string
30016 literal, then we have a linkage specification. */
30018 && cp_parser_is_pure_string_literal
30021 /* Handle #pragma, if any. */
30024 /* Allow stray semicolons. */
30027 /* Mark methods as optional or required, when building protocols. */
30029 {
30032 }
30034 {
30037 }
30040 /* Other stray characters must generate errors. */
30042 {
30046 }
30047 /* Finally, try to parse a block-declaration, or a function-definition. */
30048 else
30050 }
30052 /* Parse a method signature. */
30054 static tree
30056 {
30072 }
30074 static bool
30076 {
30077 tree tattr;
30082 /* If the attributes are followed by a method introducer, this is not allowed.
30083 Dump the attributes and flag the situation. */
30088 /* Otherwise, the attributes introduce some interstitial code, possibly so
30089 rewind to allow that check. */
30092 }
30094 /* Parse an Objective-C method prototype list. */
30096 static void
30098 {
30102 {
30104 {
30109 else
30113 {
30117 }
30120 }
30126 OPT_Wattributes,
30128 else
30129 /* Allow for interspersed non-ObjC++ code. */
30133 }
30137 else
30141 }
30143 /* Parse an Objective-C method definition list. */
30145 static void
30147 {
30151 {
30152 tree meth;
30155 {
30161 else
30166 {
30170 }
30172 NULL_TREE);
30174 /* For historical reasons, we accept an optional semicolon. */
30181 {
30188 }
30189 }
30190 /* The following case will be removed once @synthesize is
30191 completely implemented. */
30202 else
30203 /* Allow for interspersed non-ObjC++ code. */
30207 }
30211 else
30215 }
30217 /* Parse Objective-C ivars. */
30219 static void
30221 {
30232 {
30233 cp_decl_specifier_seq declspecs;
30235 tree prefix_attributes;
30243 CP_PARSER_FLAGS_OPTIONAL,
30247 /* auto, register, static, extern, mutable. */
30249 {
30252 }
30254 /* thread_local. */
30256 {
30259 }
30261 /* typedef. */
30263 {
30266 }
30271 /* Keep going until we hit the `;' at the end of the
30272 declaration. */
30274 {
30279 /* Check for a (possibly unnamed) bitfield declaration. */
30287 {
30288 /* Get the name of the bitfield. */
30291 sfk_none);
30293 eat_colon:
30295 /* Get the width of the bitfield. */
30296 width
30298 }
30299 else
30300 {
30301 /* Parse the declarator. */
30302 declarator
30308 }
30310 /* Look for attributes that apply to the ivar. */
30312 /* Remember which attributes are prefix attributes and
30313 which are not. */
30315 /* Combine the attributes. */
30319 /* Create the bitfield declaration. */
30322 else
30327 /* Add the instance variable. */
30331 /* Reset PREFIX_ATTRIBUTES. */
30333 {
30338 }
30343 {
30346 }
30348 }
30352 }
30357 /* Do not consume the RID_AT_END, so it will be read again as terminating
30358 the @interface of @implementation. */
30362 /* For historical reasons, we accept an optional semicolon. */
30365 }
30367 /* Parse an Objective-C protocol declaration. */
30369 static void
30371 {
30377 {
30382 }
30384 /* See if we have a forward declaration or a definition. */
30387 /* Try a forward declaration first. */
30389 {
30391 {
30392 tree id;
30402 else
30404 }
30406 }
30408 /* Ok, we got a full-fledged definition (or at least should). */
30409 else
30410 {
30415 }
30416 }
30418 /* Parse an Objective-C superclass or category. */
30420 static void
30425 {
30431 {
30434 }
30436 {
30437 matching_parens parens;
30440 /* If there is no category name, and this is an @interface, we
30441 have a class extension. */
30443 {
30446 }
30447 else
30451 }
30452 }
30454 /* Parse an Objective-C class interface. */
30456 static void
30458 {
30465 {
30466 /* It's hard to recover because even if valid @interface stuff
30467 is to follow, we can't compile it (or validate it) if we
30468 don't even know which class it refers to. Let's assume this
30469 was a stray '@interface' token in the stream and skip it.
30470 */
30472 }
30477 /* We have either a class or a category on our hands. */
30480 else
30481 {
30483 /* Handle instance variable declarations, if any. */
30486 }
30489 }
30491 /* Parse an Objective-C class implementation. */
30493 static void
30495 {
30502 {
30503 /* It's hard to recover because even if valid @implementation
30504 stuff is to follow, we can't compile it (or validate it) if
30505 we don't even know which class it refers to. Let's assume
30506 this was a stray '@implementation' token in the stream and
30507 skip it.
30508 */
30510 }
30514 /* We have either a class or a category on our hands. */
30517 else
30518 {
30520 /* Handle instance variable declarations, if any. */
30523 }
30526 }
30528 /* Consume the @end token and finish off the implementation. */
30530 static void
30532 {
30535 }
30537 /* Parse an Objective-C declaration. */
30539 static void
30541 {
30542 /* Try to figure out what kind of declaration is present. */
30547 {
30563 }
30566 {
30589 }
30590 }
30592 /* Parse an Objective-C try-catch-finally statement.
30594 objc-try-catch-finally-stmt:
30595 @try compound-statement objc-catch-clause-seq [opt]
30596 objc-finally-clause [opt]
30598 objc-catch-clause-seq:
30599 objc-catch-clause objc-catch-clause-seq [opt]
30601 objc-catch-clause:
30602 @catch ( objc-exception-declaration ) compound-statement
30604 objc-finally-clause:
30605 @finally compound-statement
30607 objc-exception-declaration:
30608 parameter-declaration
30609 '...'
30611 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30613 Returns NULL_TREE.
30615 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30616 for C. Keep them in sync. */
30618 static tree
30620 {
30621 location_t location;
30622 tree stmt;
30627 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30628 node, lest it get absorbed into the surrounding block. */
30634 {
30638 matching_parens parens;
30644 {
30645 /* We have "@catch (...)" (where the '...' are literally
30646 what is in the code). Skip the '...'.
30647 parameter_declaration is set to NULL_TREE, and
30648 objc_being_catch_clauses() knows that that means
30649 '...'. */
30652 }
30653 else
30654 {
30655 /* We have "@catch (NSException *exception)" or something
30656 like that. Parse the parameter declaration. */
30660 else
30665 }
30668 else
30669 {
30670 /* If there was no open parenthesis, we are recovering from
30671 an error, and we are trying to figure out what mistake
30672 the user has made. */
30674 /* If there is an immediate closing parenthesis, the user
30675 probably forgot the opening one (ie, they typed "@catch
30676 NSException *e)". Parse the closing parenthesis and keep
30677 going. */
30681 /* If these is no immediate closing parenthesis, the user
30682 probably doesn't know that parenthesis are required at
30683 all (ie, they typed "@catch NSException *e"). So, just
30684 forget about the closing parenthesis and keep going. */
30685 }
30689 }
30691 {
30694 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30695 node, lest it get absorbed into the surrounding block. */
30699 }
30702 }
30704 /* Parse an Objective-C synchronized statement.
30706 objc-synchronized-stmt:
30707 @synchronized ( expression ) compound-statement
30709 Returns NULL_TREE. */
30711 static tree
30713 {
30714 location_t location;
30721 matching_parens parens;
30726 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30727 node, lest it get absorbed into the surrounding block. */
30732 }
30734 /* Parse an Objective-C throw statement.
30736 objc-throw-stmt:
30737 @throw assignment-expression [opt] ;
30739 Returns a constructed '@throw' statement. */
30741 static tree
30743 {
30755 }
30757 /* Parse an Objective-C statement. */
30759 static tree
30761 {
30762 /* Try to figure out what kind of declaration is present. */
30766 {
30777 }
30780 }
30782 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30783 look ahead to see if an objc keyword follows the attributes. This
30784 is to detect the use of prefix attributes on ObjC @interface and
30785 @protocol. */
30787 static bool
30789 {
30794 {
30797 }
30800 }
30802 /* This routine is a minimal replacement for
30803 c_parser_struct_declaration () used when parsing the list of
30804 types/names or ObjC++ properties. For example, when parsing the
30805 code
30807 @property (readonly) int a, b, c;
30809 this function is responsible for parsing "int a, int b, int c" and
30810 returning the declarations as CHAIN of DECLs.
30812 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30813 similar parsing. */
30814 static tree
30816 {
30818 cp_decl_specifier_seq declspecs;
30820 tree prefix_attributes;
30823 CP_PARSER_FLAGS_NONE,
30830 /* auto, register, static, extern, mutable. */
30832 {
30835 }
30837 /* thread_local. */
30839 {
30842 }
30844 /* typedef. */
30846 {
30849 }
30854 /* Keep going until we hit the `;' at the end of the declaration. */
30856 {
30861 /* Parse the declarator. */
30865 /* Look for attributes that apply to the ivar. */
30867 /* Remember which attributes are prefix attributes and
30868 which are not. */
30870 /* Combine the attributes. */
30880 /* Reset PREFIX_ATTRIBUTES. */
30882 {
30887 }
30894 {
30897 }
30898 else
30900 }
30902 }
30904 /* Parse an Objective-C @property declaration. The syntax is:
30906 objc-property-declaration:
30907 '@property' objc-property-attributes[opt] struct-declaration ;
30909 objc-property-attributes:
30910 '(' objc-property-attribute-list ')'
30912 objc-property-attribute-list:
30913 objc-property-attribute
30914 objc-property-attribute-list, objc-property-attribute
30916 objc-property-attribute
30917 'getter' = identifier
30918 'setter' = identifier
30919 'readonly'
30920 'readwrite'
30921 'assign'
30922 'retain'
30923 'copy'
30924 'nonatomic'
30926 For example:
30927 @property NSString *name;
30928 @property (readonly) id object;
30929 @property (retain, nonatomic, getter=getTheName) id name;
30930 @property int a, b, c;
30932 PS: This function is identical to
30933 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30934 static void
30936 {
30937 /* The following variables hold the attributes of the properties as
30938 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30939 seen. When we see an attribute, we set them to 'true' (if they
30940 are boolean properties) or to the identifier (if they have an
30941 argument, ie, for getter and setter). Note that here we only
30942 parse the list of attributes, check the syntax and accumulate the
30943 attributes that we find. objc_add_property_declaration() will
30944 then process the information. */
30954 /* 'properties' is the list of properties that we read. Usually a
30955 single one, but maybe more (eg, in "@property int a, b, c;" there
30956 are three). */
30957 tree properties;
30958 location_t loc;
30964 /* Parse the optional attribute list... */
30966 {
30967 /* Eat the '('. */
30968 matching_parens parens;
30972 {
30978 {
30981 }
30985 {
30996 {
31000 else
31005 }
31008 {
31012 }
31014 {
31016 {
31019 }
31020 else
31024 else
31026 }
31027 else
31028 {
31030 {
31033 }
31034 else
31036 }
31042 }
31049 else
31051 }
31053 /* FIXME: "@property (setter, assign);" will generate a spurious
31054 "error: expected ‘)’ before ‘,’ token". This is because
31055 cp_parser_require, unlike the C counterpart, will produce an
31056 error even if we are in error recovery. */
31058 {
31063 }
31064 }
31066 /* ... and the property declaration(s). */
31070 {
31072 /* If the next token is now a `;', consume it. */
31076 }
31080 else
31081 {
31082 /* Comma-separated properties are chained together in
31083 reverse order; add them one by one. */
31092 }
31095 }
31097 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31099 objc-synthesize-declaration:
31100 @synthesize objc-synthesize-identifier-list ;
31102 objc-synthesize-identifier-list:
31103 objc-synthesize-identifier
31104 objc-synthesize-identifier-list, objc-synthesize-identifier
31106 objc-synthesize-identifier
31107 identifier
31108 identifier = identifier
31110 For example:
31111 @synthesize MyProperty;
31112 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31114 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31115 for C. Keep them in sync.
31116 */
31117 static void
31119 {
31121 location_t loc;
31126 {
31130 {
31133 }
31135 {
31139 {
31142 }
31143 }
31144 else
31149 else
31151 }
31154 }
31156 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31158 objc-dynamic-declaration:
31159 @dynamic identifier-list ;
31161 For example:
31162 @dynamic MyProperty;
31163 @dynamic MyProperty, AnotherProperty;
31165 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31166 for C. Keep them in sync.
31167 */
31168 static void
31170 {
31172 location_t loc;
31177 {
31178 tree property;
31181 {
31184 }
31188 else
31190 }
31193 }
31195 \f
31196 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31198 /* Returns name of the next clause.
31199 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31200 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31201 returned and the token is consumed. */
31203 static pragma_omp_clause
31205 {
31221 {
31226 {
31403 }
31404 }
31410 }
31412 /* Validate that a clause of the given type does not already exist. */
31414 static void
31417 {
31418 tree c;
31422 {
31425 }
31426 }
31428 /* OpenMP 2.5:
31429 variable-list:
31430 identifier
31431 variable-list , identifier
31433 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31434 colon). An opening parenthesis will have been consumed by the caller.
31436 If KIND is nonzero, create the appropriate node and install the decl
31437 in OMP_CLAUSE_DECL and add the node to the head of the list.
31439 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31440 return the list created.
31442 COLON can be NULL if only closing parenthesis should end the list,
31443 or pointer to bool which will receive false if the list is terminated
31444 by closing parenthesis or true if the list is terminated by colon. */
31446 static tree
31449 {
31453 {
31456 }
31458 {
31463 && current_class_ptr
31465 {
31471 }
31472 else
31473 {
31484 else
31489 }
31491 ;
31493 {
31495 {
31497 /* The OpenACC cache directive explicitly only allows "array
31498 elements or subarrays". */
31500 {
31504 }
31505 /* FALLTHROUGH. */
31510 {
31511 location_t loc
31516 decl
31520 }
31521 /* FALLTHROUGH. */
31525 {
31533 parser->colon_corrects_to_scope_p
31537 else
31538 {
31539 /* Look for `:'. */
31543 CPP_CLOSE_SQUARE))
31545 }
31546 /* Look for the closing `]'. */
31548 RT_CLOSE_SQUARE))
31552 }
31556 }
31562 }
31563 else
31566 get_comma:
31570 }
31576 {
31580 }
31583 {
31586 /* Try to resync to an unnested comma. Copied from
31587 cp_parser_parenthesized_expression_list. */
31588 skip_comma:
31597 }
31600 }
31602 /* Similarly, but expect leading and trailing parenthesis. This is a very
31603 common case for omp clauses. */
31605 static tree
31607 {
31611 }
31613 /* OpenACC 2.0:
31614 copy ( variable-list )
31615 copyin ( variable-list )
31616 copyout ( variable-list )
31617 create ( variable-list )
31618 delete ( variable-list )
31619 present ( variable-list )
31620 present_or_copy ( variable-list )
31621 pcopy ( variable-list )
31622 present_or_copyin ( variable-list )
31623 pcopyin ( variable-list )
31624 present_or_copyout ( variable-list )
31625 pcopyout ( variable-list )
31626 present_or_create ( variable-list )
31627 pcreate ( variable-list ) */
31629 static tree
31631 tree list)
31632 {
31635 {
31681 }
31689 }
31691 /* OpenACC 2.0:
31692 deviceptr ( variable-list ) */
31694 static tree
31696 {
31700 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31701 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31702 variable-list must only allow for pointer variables. */
31705 {
31712 }
31715 }
31717 /* OpenACC 2.0:
31718 auto
31719 independent
31720 nohost
31721 seq */
31723 static tree
31727 {
31732 }
31734 /* OpenACC:
31735 num_gangs ( expression )
31736 num_workers ( expression )
31737 vector_length ( expression ) */
31739 static tree
31742 {
31745 matching_parens parens;
31753 {
31758 }
31766 }
31768 /* OpenACC:
31770 gang [( gang-arg-list )]
31771 worker [( [num:] int-expr )]
31772 vector [( [length:] int-expr )]
31774 where gang-arg is one of:
31776 [num:] int-expr
31777 static: size-expr
31779 and size-expr may be:
31781 *
31782 int-expr
31783 */
31785 static tree
31788 {
31798 {
31799 matching_parens parens;
31802 do
31803 {
31807 /* Gang static argument. */
31810 {
31818 {
31821 }
31823 /* Check for the '*' argument. */
31827 CPP_CLOSE_PAREN)))
31828 {
31833 {
31836 }
31838 }
31839 }
31840 /* Worker num: argument and vector length: arguments. */
31844 {
31847 }
31849 /* Now collect the actual argument. */
31851 {
31854 }
31866 {
31869 }
31871 }
31876 }
31890 cleanup_error:
31893 }
31895 /* OpenACC 2.0:
31896 tile ( size-expr-list ) */
31898 static tree
31900 {
31904 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31905 so, but the spec authors never considered such a case and have
31906 differing opinions on what it might mean, including 'not
31907 allowed'.) */
31910 clause_loc);
31915 do
31916 {
31923 {
31926 }
31927 else
31931 }
31934 /* Consume the trailing ')'. */
31942 }
31944 /* OpenACC 2.0
31945 Parse wait clause or directive parameters. */
31947 static tree
31949 {
31959 {
31964 }
31971 {
31975 {
31978 else
31979 {
31986 }
31987 }
31988 }
31991 }
31993 /* OpenACC:
31994 wait ( int-expr-list ) */
31996 static tree
31998 {
32007 }
32009 /* OpenMP 3.0:
32010 collapse ( constant-expression ) */
32012 static tree
32014 {
32016 location_t loc;
32017 HOST_WIDE_INT n;
32020 matching_parens parens;
32038 {
32041 }
32050 }
32052 /* OpenMP 2.5:
32053 default ( none | shared )
32055 OpenACC:
32056 default ( none | present ) */
32058 static tree
32061 {
32063 tree c;
32065 matching_parens parens;
32069 {
32074 {
32095 }
32098 }
32099 else
32100 {
32101 invalid_kind:
32104 else
32106 }
32123 }
32125 /* OpenMP 3.1:
32126 final ( expression ) */
32128 static tree
32130 {
32133 matching_parens parens;
32152 }
32154 /* OpenMP 2.5:
32155 if ( expression )
32157 OpenMP 4.5:
32158 if ( directive-name-modifier : expression )
32160 directive-name-modifier:
32161 parallel | task | taskloop | target data | target | target update
32162 | target enter data | target exit data */
32164 static tree
32167 {
32171 matching_parens parens;
32176 {
32188 {
32191 {
32204 else
32205 {
32206 location_t loc
32211 }
32214 {
32216 {
32221 }
32223 {
32224 location_t loc
32228 }
32229 }
32230 }
32231 }
32233 {
32235 {
32238 }
32239 else
32240 {
32242 {
32243 location_t loc
32246 }
32248 }
32249 }
32250 }
32262 {
32265 {
32268 {
32278 }
32280 p);
32282 }
32284 {
32287 else
32290 }
32293 {
32297 }
32298 }
32306 }
32308 /* OpenMP 3.1:
32309 mergeable */
32311 static tree
32314 {
32315 tree c;
32318 location);
32323 }
32325 /* OpenMP 2.5:
32326 nowait */
32328 static tree
32331 {
32332 tree c;
32339 }
32341 /* OpenMP 2.5:
32342 num_threads ( expression ) */
32344 static tree
32346 location_t location)
32347 {
32350 matching_parens parens;
32370 }
32372 /* OpenMP 4.5:
32373 num_tasks ( expression ) */
32375 static tree
32377 location_t location)
32378 {
32381 matching_parens parens;
32401 }
32403 /* OpenMP 4.5:
32404 grainsize ( expression ) */
32406 static tree
32408 location_t location)
32409 {
32412 matching_parens parens;
32432 }
32434 /* OpenMP 4.5:
32435 priority ( expression ) */
32437 static tree
32439 location_t location)
32440 {
32443 matching_parens parens;
32463 }
32465 /* OpenMP 4.5:
32466 hint ( expression ) */
32468 static tree
32470 location_t location)
32471 {
32474 matching_parens parens;
32493 }
32495 /* OpenMP 4.5:
32496 defaultmap ( tofrom : scalar ) */
32498 static tree
32500 location_t location)
32501 {
32505 matching_parens parens;
32510 {
32513 }
32517 {
32520 }
32526 {
32529 }
32533 {
32536 }
32542 location);
32548 out_err:
32553 }
32555 /* OpenMP 2.5:
32556 ordered
32558 OpenMP 4.5:
32559 ordered ( constant-expression ) */
32561 static tree
32564 {
32566 HOST_WIDE_INT n;
32572 {
32573 matching_parens parens;
32590 {
32592 "ordered argument needs positive constant integer "
32595 }
32596 }
32602 }
32604 /* OpenMP 2.5:
32605 reduction ( reduction-operator : variable-list )
32607 reduction-operator:
32608 One of: + * - & ^ | && ||
32610 OpenMP 3.1:
32612 reduction-operator:
32613 One of: + * - & ^ | && || min max
32615 OpenMP 4.0:
32617 reduction-operator:
32618 One of: + * - & ^ | && ||
32619 id-expression */
32621 static tree
32623 {
32631 {
32641 }
32645 else
32646 {
32657 {
32687 }
32688 else
32689 {
32691 resync_fail:
32696 }
32697 }
32703 NULL);
32705 {
32708 }
32711 }
32713 /* OpenMP 2.5:
32714 schedule ( schedule-kind )
32715 schedule ( schedule-kind , expression )
32717 schedule-kind:
32718 static | dynamic | guided | runtime | auto
32720 OpenMP 4.5:
32721 schedule ( schedule-modifier : schedule-kind )
32722 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32724 schedule-modifier:
32725 simd
32726 monotonic
32727 nonmonotonic */
32729 static tree
32731 {
32735 matching_parens parens;
32742 {
32751 else
32757 else
32758 {
32761 }
32762 }
32765 {
32770 {
32791 }
32792 }
32797 else
32803 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32805 {
32809 }
32812 {
32827 else
32832 }
32844 invalid_kind:
32846 resync_fail:
32851 }
32853 /* OpenMP 3.0:
32854 untied */
32856 static tree
32859 {
32860 tree c;
32867 }
32869 /* OpenMP 4.0:
32870 inbranch
32871 notinbranch */
32873 static tree
32876 {
32881 }
32883 /* OpenMP 4.0:
32884 parallel
32885 for
32886 sections
32887 taskgroup */
32889 static tree
32893 {
32897 }
32899 /* OpenMP 4.5:
32900 nogroup */
32902 static tree
32905 {
32910 }
32912 /* OpenMP 4.5:
32913 simd
32914 threads */
32916 static tree
32920 {
32925 }
32927 /* OpenMP 4.0:
32928 num_teams ( expression ) */
32930 static tree
32932 location_t location)
32933 {
32936 matching_parens parens;
32956 }
32958 /* OpenMP 4.0:
32959 thread_limit ( expression ) */
32961 static tree
32963 location_t location)
32964 {
32967 matching_parens parens;
32987 }
32989 /* OpenMP 4.0:
32990 aligned ( variable-list )
32991 aligned ( variable-list : constant-expression ) */
32993 static tree
32995 {
32999 matching_parens parens;
33007 {
33017 }
33023 }
33025 /* OpenMP 4.0:
33026 linear ( variable-list )
33027 linear ( variable-list : expression )
33029 OpenMP 4.5:
33030 linear ( modifier ( variable-list ) )
33031 linear ( modifier ( variable-list ) : expression ) */
33033 static tree
33036 {
33041 matching_parens parens;
33046 {
33058 else
33060 }
33065 else
33066 {
33075 }
33078 {
33083 {
33094 {
33097 }
33100 }
33111 }
33114 {
33117 }
33120 }
33122 /* OpenMP 4.0:
33123 safelen ( constant-expression ) */
33125 static tree
33127 location_t location)
33128 {
33131 matching_parens parens;
33150 }
33152 /* OpenMP 4.0:
33153 simdlen ( constant-expression ) */
33155 static tree
33157 location_t location)
33158 {
33161 matching_parens parens;
33180 }
33182 /* OpenMP 4.5:
33183 vec:
33184 identifier [+/- integer]
33185 vec , identifier [+/- integer]
33186 */
33188 static tree
33190 tree list)
33191 {
33195 {
33198 }
33201 {
33208 else
33209 {
33210 t = cp_parser_lookup_name_simple
33215 id_loc);
33216 }
33222 {
33225 }
33229 {
33232 }
33236 {
33239 }
33242 add_to_vector:
33244 {
33248 }
33254 }
33257 {
33263 }
33265 }
33267 /* OpenMP 4.0:
33268 depend ( depend-kind : variable-list )
33270 depend-kind:
33271 in | out | inout
33273 OpenMP 4.5:
33274 depend ( source )
33276 depend ( sink : vec ) */
33278 static tree
33280 {
33284 matching_parens parens;
33289 {
33303 else
33305 }
33306 else
33312 {
33322 }
33329 else
33330 {
33336 }
33339 invalid_kind:
33341 resync_fail:
33346 }
33348 /* OpenMP 4.0:
33349 map ( map-kind : variable-list )
33350 map ( variable-list )
33352 map-kind:
33353 alloc | to | from | tofrom
33355 OpenMP 4.5:
33356 map-kind:
33357 alloc | to | from | tofrom | release | delete
33359 map ( always [,] map-kind: variable-list ) */
33361 static tree
33363 {
33372 {
33377 {
33380 nth++;
33386 {
33391 }
33392 }
33393 }
33397 {
33411 else
33412 {
33418 }
33421 }
33424 {
33428 }
33431 NULL);
33437 }
33439 /* OpenMP 4.0:
33440 device ( expression ) */
33442 static tree
33444 location_t location)
33445 {
33448 matching_parens parens;
33468 }
33470 /* OpenMP 4.0:
33471 dist_schedule ( static )
33472 dist_schedule ( static , expression ) */
33474 static tree
33476 location_t location)
33477 {
33480 matching_parens parens;
33491 {
33502 }
33507 location);
33511 invalid_kind:
33513 resync_fail:
33518 }
33520 /* OpenMP 4.0:
33521 proc_bind ( proc-bind-kind )
33523 proc-bind-kind:
33524 master | close | spread */
33526 static tree
33528 location_t location)
33529 {
33530 tree c;
33537 {
33547 else
33549 }
33550 else
33559 location);
33564 invalid_kind:
33566 resync_fail:
33571 }
33573 /* OpenACC:
33574 async [( int-expr )] */
33576 static tree
33578 {
33585 {
33586 matching_parens parens;
33595 }
33605 }
33607 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33608 is a bitmask in MASK. Return the list of clauses found. */
33610 static tree
33614 {
33619 {
33620 location_t here;
33621 pragma_omp_clause c_kind;
33622 omp_clause_code code;
33633 {
33685 clauses);
33703 OMP_CLAUSE_INDEPENDENT,
33715 clauses);
33721 clauses);
33745 clauses);
33767 clauses);
33779 clauses);
33793 }
33798 {
33799 /* Remove the invalid clause(s) from the list to avoid
33800 confusing the rest of the compiler. */
33803 }
33804 }
33806 saw_error:
33813 }
33815 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33816 is a bitmask in MASK. Return the list of clauses found; the result
33817 of clause default goes in *pdefault. */
33819 static tree
33823 {
33829 {
33830 pragma_omp_clause c_kind;
33841 {
33853 clauses);
33867 clauses);
33887 clauses);
33892 clauses);
33902 clauses);
33936 clauses);
33950 clauses);
33965 OMP_CLAUSE_NOTINBRANCH,
33974 {
33975 clause_not_first:
33979 }
34009 clauses);
34010 else
34020 clauses);
34038 {
34043 }
34086 clauses
34092 clauses
34100 }
34105 {
34106 /* Remove the invalid clause(s) from the list to avoid
34107 confusing the rest of the compiler. */
34110 }
34111 }
34112 saw_error:
34115 {
34118 else
34120 }
34122 }
34124 /* OpenMP 2.5:
34125 structured-block:
34126 statement
34128 In practice, we're also interested in adding the statement to an
34129 outer node. So it is convenient if we work around the fact that
34130 cp_parser_statement calls add_stmt. */
34132 static unsigned
34134 {
34137 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34138 This preserves the "not within loop or switch" style error messages
34139 for nonsense cases like
34140 void foo() {
34141 #pragma omp single
34142 break;
34143 }
34144 */
34149 }
34151 static void
34153 {
34155 }
34157 static tree
34159 {
34167 }
34169 /* OpenMP 2.5:
34170 # pragma omp atomic new-line
34171 expression-stmt
34173 expression-stmt:
34174 x binop= expr | x++ | ++x | x-- | --x
34175 binop:
34176 +, *, -, /, &, ^, |, <<, >>
34178 where x is an lvalue expression with scalar type.
34180 OpenMP 3.1:
34181 # pragma omp atomic new-line
34182 update-stmt
34184 # pragma omp atomic read new-line
34185 read-stmt
34187 # pragma omp atomic write new-line
34188 write-stmt
34190 # pragma omp atomic update new-line
34191 update-stmt
34193 # pragma omp atomic capture new-line
34194 capture-stmt
34196 # pragma omp atomic capture new-line
34197 capture-block
34199 read-stmt:
34200 v = x
34201 write-stmt:
34202 x = expr
34203 update-stmt:
34204 expression-stmt | x = x binop expr
34205 capture-stmt:
34206 v = expression-stmt
34207 capture-block:
34208 { v = x; update-stmt; } | { update-stmt; v = x; }
34210 OpenMP 4.0:
34211 update-stmt:
34212 expression-stmt | x = x binop expr | x = expr binop x
34213 capture-stmt:
34214 v = update-stmt
34215 capture-block:
34216 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34218 where x and v are lvalue expressions with scalar type. */
34220 static void
34222 {
34230 {
34235 {
34241 }
34242 }
34244 {
34256 else
34260 }
34262 {
34268 {
34273 {
34276 }
34277 }
34278 }
34282 {
34292 else
34297 {
34298 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34299 opcode. */
34304 }
34308 {
34311 }
34312 else
34313 {
34319 }
34322 }
34324 restart:
34328 {
34335 /* FALLTHROUGH */
34345 /* FALLTHROUGH */
34360 /* Undo effects of boolean_increment for post {in,de}crement. */
34362 /* FALLTHRU */
34366 {
34367 /* Undo effects of boolean_increment. */
34369 {
34370 /* This is pre or post increment. */
34375 && !structured_block
34379 }
34380 }
34381 /* FALLTHRU */
34384 {
34419 {
34423 }
34426 {
34432 {
34437 }
34439 {
34451 {
34453 {
34458 }
34459 else
34461 }
34465 }
34468 {
34475 }
34479 }
34483 {
34486 {
34494 }
34496 {
34501 }
34536 }
34547 /* FALLTHROUGH */
34552 }
34559 }
34560 stmt_done:
34562 {
34573 }
34575 {
34578 }
34579 done:
34585 saw_error:
34588 {
34592 {
34596 }
34597 }
34598 }
34601 /* OpenMP 2.5:
34602 # pragma omp barrier new-line */
34604 static void
34606 {
34609 }
34611 /* OpenMP 2.5:
34612 # pragma omp critical [(name)] new-line
34613 structured-block
34615 OpenMP 4.5:
34616 # pragma omp critical [(name) [hint(expression)]] new-line
34617 structured-block */
34619 #define OMP_CRITICAL_CLAUSE_MASK \
34620 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34622 static tree
34624 {
34628 {
34629 matching_parens parens;
34643 OMP_CRITICAL_CLAUSE_MASK,
34645 }
34646 else
34651 }
34653 /* OpenMP 2.5:
34654 # pragma omp flush flush-vars[opt] new-line
34656 flush-vars:
34657 ( variable-list ) */
34659 static void
34661 {
34667 }
34669 /* Helper function, to parse omp for increment expression. */
34671 static tree
34673 {
34678 {
34681 }
34684 {
34691 /* Fall through: OpenMP disallows NE_EXPR. */
34695 }
34697 /* If decl is an iterator, preserve LHS and RHS of the relational
34698 expr until finish_omp_for. */
34709 }
34711 /* Helper function, to parse omp for increment expression. */
34713 static tree
34715 {
34719 cp_id_kind idk;
34723 {
34732 }
34741 {
34746 }
34753 {
34757 }
34770 do
34771 {
34778 {
34780 {
34783 else
34785 tf_warning_or_error);
34786 }
34787 else
34790 }
34791 }
34795 {
34801 }
34802 else
34806 }
34808 /* Parse the initialization statement of an OpenMP for loop.
34810 Return true if the resulting construct should have an
34811 OMP_CLAUSE_PRIVATE added to it. */
34813 static tree
34821 {
34827 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34829 init-expr:
34830 var = lb
34831 integer-type var = lb
34832 random-access-iterator-type var = lb
34833 pointer-type var = lb
34834 */
34835 cp_decl_specifier_seq type_specifiers;
34837 /* First, try to parse as an initialized declaration. See
34838 cp_parser_condition, from whence the bulk of this is copied. */
34845 {
34846 /* If parsing a type specifier seq succeeded, then this
34847 MUST be a initialized declaration. */
34852 CP_PARSER_DECLARATOR_NAMED,
34863 else
34864 {
34874 {
34876 CPP_OPEN_PAREN))
34879 else
34880 /* Trigger an error. */
34885 }
34889 {
34897 {
34900 auto_node);
34905 }
34908 asm_specification,
34909 LOOKUP_ONLYCONVERTING);
34912 {
34915 }
34916 else
34917 {
34920 {
34922 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34924 {
34928 {
34932 }
34934 }
34936 {
34941 }
34942 }
34943 }
34945 }
34946 else
34947 {
34948 /* Consume '='. */
34952 non_class:
34955 else
34958 asm_specification,
34959 LOOKUP_ONLYCONVERTING);
34960 }
34964 }
34965 }
34966 else
34967 {
34968 cp_id_kind idk;
34969 /* If parsing a type specifier sequence failed, then
34970 this MUST be a simple expression. */
34976 && decl
34979 {
34990 {
34995 }
35000 }
35002 && decl
35005 {
35006 tree rhs;
35014 rhs,
35015 tf_warning_or_error));
35018 }
35019 else
35020 {
35025 {
35029 }
35030 }
35031 }
35033 }
35035 /* Parse the restricted form of the for statement allowed by OpenMP. */
35037 static tree
35040 {
35044 location_t loc_first;
35055 {
35058 }
35061 {
35064 }
35067 {
35073 }
35075 {
35078 {
35080 "%<linear%> clause may not be specified together "
35083 }
35084 else
35086 }
35099 {
35102 location_t loc;
35105 {
35109 }
35112 matching_parens parens;
35119 add_private_clause
35125 {
35128 {
35134 }
35135 else
35137 }
35144 {
35149 {
35153 }
35156 {
35157 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35161 {
35164 }
35165 else
35166 {
35169 }
35171 }
35172 else
35173 {
35178 }
35179 }
35182 {
35183 tree c;
35185 {
35194 decl);
35198 decl);
35199 }
35201 {
35206 else
35211 {
35214 /* For linear, signal that we need to fill up
35215 the so far unknown linear step. */
35218 }
35219 }
35220 }
35229 {
35230 /* If decl is an iterator, preserve the operator on decl
35231 until finish_omp_for. */
35233 && ((processing_template_decl
35238 else
35242 }
35254 {
35257 }
35262 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35263 in between the collapsed for loops to be still considered perfectly
35264 nested. Hopefully the final version clarifies this.
35265 For now handle (multiple) {'s and empty statements. */
35268 {
35272 {
35274 bracecount++;
35275 }
35279 else
35280 {
35287 }
35288 }
35291 {
35294 }
35295 }
35300 /* Note that we saved the original contents of this flag when we entered
35301 the structured block, and so we don't need to re-save it here. */
35304 /* Note that the grammar doesn't call for a structured block here,
35305 though the loop as a whole is a structured block. */
35312 else
35317 {
35319 {
35321 nbraces--;
35322 }
35325 else
35326 {
35328 {
35331 }
35336 }
35337 }
35340 {
35344 else
35346 }
35350 }
35352 /* Helper function for OpenMP parsing, split clauses and call
35353 finish_omp_clauses on each of the set of clauses afterwards. */
35355 static void
35358 {
35364 }
35366 /* OpenMP 4.0:
35367 #pragma omp simd simd-clause[optseq] new-line
35368 for-loop */
35370 #define OMP_SIMD_CLAUSE_MASK \
35371 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35380 static tree
35384 {
35395 {
35399 OMP_CLAUSE_ORDERED);
35401 {
35403 "%<ordered%> clause with parameter may not be specified "
35406 }
35407 }
35418 }
35420 /* OpenMP 2.5:
35421 #pragma omp for for-clause[optseq] new-line
35422 for-loop
35424 OpenMP 4.0:
35425 #pragma omp for simd for-simd-clause[optseq] new-line
35426 for-loop */
35428 #define OMP_FOR_CLAUSE_MASK \
35429 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35439 static tree
35443 {
35450 /* parallel for{, simd} disallows nowait clause, but for
35451 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35454 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35459 {
35464 {
35488 }
35489 }
35491 {
35494 }
35496 /* Composite distribute parallel for disallows linear clause. */
35503 {
35506 }
35517 }
35519 /* OpenMP 2.5:
35520 # pragma omp master new-line
35521 structured-block */
35523 static tree
35525 {
35529 }
35531 /* OpenMP 2.5:
35532 # pragma omp ordered new-line
35533 structured-block
35535 OpenMP 4.5:
35536 # pragma omp ordered ordered-clauses new-line
35537 structured-block */
35539 #define OMP_ORDERED_CLAUSE_MASK \
35540 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35543 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35544 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35546 static bool
35549 {
35553 {
35558 {
35560 {
35563 }
35565 {
35567 "%<depend%> clause may only be used in compound "
35571 }
35572 tree clauses
35574 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35578 }
35579 }
35581 tree clauses
35592 }
35594 /* OpenMP 2.5:
35596 section-scope:
35597 { section-sequence }
35599 section-sequence:
35600 section-directive[opt] structured-block
35601 section-sequence section-directive structured-block */
35603 static tree
35605 {
35610 matching_braces braces;
35618 {
35622 }
35625 {
35633 {
35637 }
35639 {
35642 }
35647 }
35658 }
35660 /* OpenMP 2.5:
35661 # pragma omp sections sections-clause[optseq] newline
35662 sections-scope */
35664 #define OMP_SECTIONS_CLAUSE_MASK \
35665 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35671 static tree
35674 {
35686 {
35689 }
35696 }
35698 /* OpenMP 2.5:
35699 # pragma omp parallel parallel-clause[optseq] new-line
35700 structured-block
35701 # pragma omp parallel for parallel-for-clause[optseq] new-line
35702 structured-block
35703 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35704 structured-block
35706 OpenMP 4.0:
35707 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35708 structured-block */
35710 #define OMP_PARALLEL_CLAUSE_MASK \
35711 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35721 static tree
35725 {
35732 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35738 {
35746 if_p);
35750 if_p);
35753 block);
35758 }
35759 /* When combined with distribute, parallel has to be followed by for.
35760 #pragma omp target parallel is allowed though. */
35764 {
35768 }
35770 {
35773 }
35775 {
35779 {
35789 block);
35792 }
35793 }
35798 {
35801 }
35809 }
35811 /* OpenMP 2.5:
35812 # pragma omp single single-clause[optseq] new-line
35813 structured-block */
35815 #define OMP_SINGLE_CLAUSE_MASK \
35816 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35821 static tree
35823 {
35833 }
35835 /* OpenMP 3.0:
35836 # pragma omp task task-clause[optseq] new-line
35837 structured-block */
35839 #define OMP_TASK_CLAUSE_MASK \
35840 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35851 static tree
35853 {
35864 }
35866 /* OpenMP 3.0:
35867 # pragma omp taskwait new-line */
35869 static void
35871 {
35874 }
35876 /* OpenMP 3.1:
35877 # pragma omp taskyield new-line */
35879 static void
35881 {
35884 }
35886 /* OpenMP 4.0:
35887 # pragma omp taskgroup new-line
35888 structured-block */
35890 static tree
35892 {
35896 if_p));
35897 }
35900 /* OpenMP 2.5:
35901 # pragma omp threadprivate (variable-list) */
35903 static void
35905 {
35906 tree vars;
35912 }
35914 /* OpenMP 4.0:
35915 # pragma omp cancel cancel-clause[optseq] new-line */
35917 #define OMP_CANCEL_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) \
35922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35924 static void
35926 {
35930 }
35932 /* OpenMP 4.0:
35933 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35935 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35936 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35941 static void
35944 {
35945 tree clauses;
35949 {
35954 {
35957 }
35958 }
35960 {
35964 }
35967 {
35972 else
35976 }
35979 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35981 pragma_tok);
35983 }
35985 /* OpenMP 4.0:
35986 #pragma omp distribute distribute-clause[optseq] new-line
35987 for-loop */
35989 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35990 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35996 static tree
36000 {
36009 {
36017 else
36020 {
36026 {
36030 else
36033 }
36039 else
36053 }
36054 }
36056 {
36059 }
36064 {
36067 }
36078 }
36080 /* OpenMP 4.0:
36081 # pragma omp teams teams-clause[optseq] new-line
36082 structured-block */
36084 #define OMP_TEAMS_CLAUSE_MASK \
36085 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36093 static tree
36097 {
36106 {
36110 {
36135 }
36136 }
36138 {
36141 }
36146 {
36149 }
36158 }
36160 /* OpenMP 4.0:
36161 # pragma omp target data target-data-clause[optseq] new-line
36162 structured-block */
36164 #define OMP_TARGET_DATA_CLAUSE_MASK \
36165 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36170 static tree
36172 {
36173 tree clauses
36178 {
36181 {
36198 "%<#pragma omp target data%> with map-type other "
36199 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36203 }
36205 }
36208 {
36211 "%<#pragma omp target data%> must contain at least "
36214 }
36225 }
36227 /* OpenMP 4.5:
36228 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36229 structured-block */
36231 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36232 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36238 static tree
36241 {
36244 {
36249 {
36252 }
36253 }
36255 {
36259 }
36262 {
36268 }
36270 tree clauses
36275 {
36278 {
36291 "%<#pragma omp target enter data%> with map-type other "
36295 }
36297 }
36300 {
36303 "%<#pragma omp target enter data%> must contain at least "
36306 }
36313 }
36315 /* OpenMP 4.5:
36316 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36317 structured-block */
36319 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36320 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36326 static tree
36329 {
36332 {
36337 {
36340 }
36341 }
36343 {
36347 }
36350 {
36356 }
36358 tree clauses
36363 {
36366 {
36380 "%<#pragma omp target exit data%> with map-type other "
36381 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36385 }
36387 }
36390 {
36393 "%<#pragma omp target exit data%> must contain at least "
36396 }
36403 }
36405 /* OpenMP 4.0:
36406 # pragma omp target update target-update-clause[optseq] new-line */
36408 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36409 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36416 static bool
36419 {
36421 {
36427 }
36429 tree clauses
36434 {
36436 "%<#pragma omp target update%> must contain at least one "
36439 }
36447 }
36449 /* OpenMP 4.0:
36450 # pragma omp target target-clause[optseq] new-line
36451 structured-block */
36453 #define OMP_TARGET_CLAUSE_MASK \
36454 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36464 static bool
36467 {
36471 {
36483 {
36491 {
36492 tree stmt;
36494 {
36497 OMP_TARGET_CLAUSE_MASK,
36502 OMP_TARGET_CLAUSE_MASK,
36507 OMP_TARGET_CLAUSE_MASK,
36512 }
36514 }
36519 {
36523 if_p);
36528 if_p);
36533 if_p);
36537 }
36543 {
36544 /* For combined target teams, ensure the num_teams and
36545 thread_limit clause expressions are evaluated on the host,
36546 before entering the target construct. */
36547 tree c;
36553 {
36562 OMP_CLAUSE_FIRSTPRIVATE);
36567 }
36568 }
36578 }
36580 {
36583 }
36585 {
36589 }
36591 {
36595 }
36597 {
36601 }
36603 {
36606 }
36607 }
36609 {
36612 }
36627 check_clauses:
36629 {
36632 {
36646 "%<#pragma omp target%> with map-type other "
36647 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36651 }
36653 }
36655 }
36657 /* OpenACC 2.0:
36658 # pragma acc cache (variable-list) new-line
36659 */
36661 static tree
36663 {
36678 }
36680 /* OpenACC 2.0:
36681 # pragma acc data oacc-data-clause[optseq] new-line
36682 structured-block */
36684 #define OACC_DATA_CLAUSE_MASK \
36685 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36697 static tree
36699 {
36712 }
36714 /* OpenACC 2.0:
36715 # pragma acc host_data <clauses> new-line
36716 structured-block */
36718 #define OACC_HOST_DATA_CLAUSE_MASK \
36719 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36721 static tree
36723 {
36736 }
36738 /* OpenACC 2.0:
36739 # pragma acc declare oacc-data-clause[optseq] new-line
36740 */
36742 #define OACC_DECLARE_CLAUSE_MASK \
36743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36756 static tree
36758 {
36767 {
36771 }
36774 {
36778 {
36782 }
36785 {
36797 {
36799 "%qD must be a global variable in "
36801 decl);
36804 }
36809 {
36813 }
36815 {
36817 "invalid use of %<extern%> variable %qD "
36821 }
36823 {
36825 "invalid use of %<global%> variable %qD "
36829 }
36831 }
36836 {
36841 }
36844 {
36845 tree id;
36849 else
36855 {
36858 {
36861 {
36865 }
36866 }
36867 }
36868 }
36869 }
36882 }
36884 /* OpenACC 2.0:
36885 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36887 or
36889 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36891 LOC is the location of the #pragma token.
36892 */
36894 #define OACC_ENTER_DATA_CLAUSE_MASK \
36895 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36903 #define OACC_EXIT_DATA_CLAUSE_MASK \
36904 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36910 static tree
36913 {
36922 {
36927 }
36934 else
36939 {
36943 }
36951 }
36953 /* OpenACC 2.0:
36954 # pragma acc loop oacc-loop-clause[optseq] new-line
36955 structured-block */
36957 #define OACC_LOOP_CLAUSE_MASK \
36958 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36969 static tree
36972 {
36981 {
36987 }
36996 }
36998 /* OpenACC 2.0:
36999 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37000 structured-block
37002 or
37004 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37005 structured-block
37006 */
37008 #define OACC_KERNELS_CLAUSE_MASK \
37009 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37027 #define OACC_PARALLEL_CLAUSE_MASK \
37028 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37049 static tree
37052 {
37053 omp_clause_mask mask;
37056 {
37069 }
37072 {
37076 {
37079 tree clauses;
37081 if_p);
37083 }
37084 }
37093 }
37095 /* OpenACC 2.0:
37096 # pragma acc update oacc-update-clause[optseq] new-line
37097 */
37099 #define OACC_UPDATE_CLAUSE_MASK \
37100 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37107 static tree
37109 {
37116 {
37118 "%<#pragma acc update%> must contain at least one "
37121 }
37129 }
37131 /* OpenACC 2.0:
37132 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37134 LOC is the location of the #pragma token.
37135 */
37137 #define OACC_WAIT_CLAUSE_MASK \
37138 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37140 static tree
37142 {
37156 }
37158 /* OpenMP 4.0:
37159 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37161 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37162 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37169 static void
37172 {
37174 cp_omp_declare_simd_data data;
37176 {
37181 /* It is safe to take the address of a local variable; it will only be
37182 used while this scope is live. */
37184 }
37186 /* Store away all pragma tokens. */
37198 {
37202 {
37215 }
37220 "%<#pragma omp declare simd%> not immediately followed by "
37224 }
37225 }
37227 /* Finalize #pragma omp declare simd clauses after direct declarator has
37228 been parsed, and put that into "omp declare simd" attribute. */
37230 static tree
37232 {
37238 {
37242 }
37247 {
37265 }
37269 }
37272 /* OpenMP 4.0:
37273 # pragma omp declare target new-line
37274 declarations and definitions
37275 # pragma omp end declare target new-line
37277 OpenMP 4.5:
37278 # pragma omp declare target ( extended-list ) new-line
37280 # pragma omp declare target declare-target-clauses[seq] new-line */
37282 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37283 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37286 static void
37288 {
37291 clauses
37295 {
37297 clauses);
37300 }
37301 else
37302 {
37306 }
37309 "%<#pragma omp declare target%> with clauses in between "
37310 "%<#pragma omp declare target%> without clauses and "
37313 {
37319 {
37322 }
37323 else
37326 {
37328 "%qD specified both in declare target %<link%> and %<to%>"
37331 }
37333 {
37340 {
37343 {
37347 }
37348 }
37349 }
37350 }
37351 }
37353 static void
37355 {
37358 {
37361 }
37363 {
37367 {
37370 }
37373 else
37374 {
37378 }
37379 }
37380 else
37381 {
37385 }
37389 "%<#pragma omp end declare target%> without corresponding "
37391 else
37393 }
37395 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37396 expression and optional initializer clause of
37397 #pragma omp declare reduction. We store the expression(s) as
37398 either 3, 6 or 7 special statements inside of the artificial function's
37399 body. The first two statements are DECL_EXPRs for the artificial
37400 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37401 expression that uses those variables.
37402 If there was any INITIALIZER clause, this is followed by further statements,
37403 the fourth and fifth statements are DECL_EXPRs for the artificial
37404 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37405 constructor variant (first token after open paren is not omp_priv),
37406 then the sixth statement is a statement with the function call expression
37407 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37408 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37409 to initialize the OMP_PRIV artificial variable and there is seventh
37410 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37412 static bool
37414 {
37426 tree combiner;
37441 {
37444 }
37447 {
37449 matching_parens parens;
37455 {
37458 }
37474 {
37478 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37482 == CPP_CLOSE_PAREN
37485 {
37489 }
37494 }
37495 else
37496 {
37512 {
37517 }
37519 tree arg;
37532 }
37543 }
37547 UNKNOWN_LOCATION);
37550 }
37552 /* OpenMP 4.0
37553 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37554 initializer-clause[opt] new-line
37556 initializer-clause:
37557 initializer (omp_priv initializer)
37558 initializer (function-name (argument-list)) */
37560 static void
37563 {
37573 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37580 {
37612 }
37624 /* Types may not be defined in declare reduction type list. */
37627 parser->type_definition_forbidden_message
37633 saved_colon_doesnt_start_class_def_p
37638 {
37642 ;
37661 else
37666 else
37668 }
37670 /* Restore the saved message. */
37673 parser->colon_doesnt_start_class_def_p
37678 {
37679 fail:
37682 }
37688 {
37689 tree fntype
37692 NULL_TREE);
37712 {
37717 }
37719 {
37721 {
37730 }
37737 }
37738 else
37739 {
37742 }
37745 else
37748 {
37751 }
37753 {
37756 else
37761 }
37766 else
37767 {
37776 }
37783 }
37787 done:
37788 /* Free any declarators allocated. */
37790 }
37792 /* OpenMP 4.0
37793 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37794 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37795 initializer-clause[opt] new-line
37796 #pragma omp declare target new-line */
37798 static bool
37801 {
37803 {
37808 {
37811 context);
37813 }
37816 {
37819 context);
37821 }
37823 {
37826 }
37828 {
37832 }
37833 }
37838 }
37840 /* OpenMP 4.5:
37841 #pragma omp taskloop taskloop-clause[optseq] new-line
37842 for-loop
37844 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37845 for-loop */
37847 #define OMP_TASKLOOP_CLAUSE_MASK \
37848 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37863 static tree
37867 {
37876 {
37881 {
37905 }
37906 }
37908 {
37911 }
37916 {
37919 }
37925 if_p);
37931 }
37934 /* OpenACC 2.0:
37935 # pragma acc routine oacc-routine-clause[optseq] new-line
37936 function-definition
37938 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37939 */
37941 #define OACC_ROUTINE_CLAUSE_MASK \
37942 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37948 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37949 component, which must resolve to a declared namespace-scope
37950 function. The clauses are either processed directly (for a named
37951 function), or defered until the immediatley following declaration
37952 is parsed. */
37954 static void
37957 {
37959 /* The checking for "another pragma following this one" in the "no optional
37960 '( name )'" case makes sure that we dont re-enter. */
37963 cp_oacc_routine_data data;
37969 /* It is safe to take the address of a local variable; it will only be
37970 used while this scope is live. */
37973 /* Look for optional '( name )'. */
37975 {
37976 matching_parens parens;
37979 /* We parse the name as an id-expression. If it resolves to
37980 anything other than a non-overloaded function at namespace
37981 scope, it's an error. */
37997 {
38001 }
38003 data.clauses
38011 {
38016 }
38018 /* Perhaps we should use the same rule as declarations in different
38019 namespaces? */
38021 {
38026 }
38029 {
38033 }
38037 }
38039 {
38040 /* Store away all pragma tokens. */
38051 /* Emit a helpful diagnostic if there's another pragma following this
38052 one. */
38054 {
38057 /* ..., and then just keep going. */
38059 }
38061 /* We only have to consider the pragma_external case here. */
38066 else
38069 }
38070 }
38072 /* Finalize #pragma acc routine clauses after direct declarator has
38073 been parsed. */
38075 static tree
38077 {
38082 {
38084 "%<#pragma acc routine%> not immediately followed by "
38087 }
38104 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38105 fndecl_seen. */
38108 }
38110 /* Apply any saved OpenACC routine clauses to a just-parsed
38111 declaration. */
38113 static void
38115 {
38117 {
38118 /* Keep going if we're in error reporting mode. */
38124 {
38126 "%<#pragma acc routine%> not immediately followed by"
38130 }
38132 {
38135 }
38138 {
38143 }
38146 {
38154 }
38156 /* Process the routine's dimension clauses. */
38160 /* Add an "omp declare target" attribute. */
38165 /* Don't unset parser->oacc_routine here: we may still need it to
38166 diagnose wrong usage. But, remember that we've used this "#pragma acc
38167 routine". */
38169 }
38170 }
38172 /* Main entry point to OpenMP statement pragmas. */
38174 static void
38176 {
38177 tree stmt;
38182 {
38205 if_p);
38210 if_p);
38227 if_p);
38232 if_p);
38240 if_p);
38249 if_p);
38263 if_p);
38268 if_p);
38272 }
38275 }
38276 \f
38277 /* Transactional Memory parsing routines. */
38279 /* Parse a transaction attribute.
38281 txn-attribute:
38282 attribute
38283 [ [ identifier ] ]
38285 We use this instead of cp_parser_attributes_opt for transactions to avoid
38286 the pedwarn in C++98 mode. */
38288 static tree
38290 {
38305 {
38309 /* For keywords, use the canonical spelling,
38310 not the parsed identifier. */
38314 }
38315 else
38319 error1:
38322 }
38324 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38326 transaction-statement:
38327 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38328 compound-statement
38329 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38330 */
38332 static tree
38334 {
38345 else
38346 {
38350 }
38352 /* Parse a noexcept specification. */
38356 {
38357 /* cancel-and-throw is unimplemented. */
38360 }
38361 else
38364 /* Keep track if we're in the lexical scope of an outer transaction. */
38376 }
38378 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38380 transaction-expression:
38381 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38382 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38383 */
38385 static tree
38387 {
38400 keyword == RID_TRANSACTION_RELAXED
38414 /* Set this early. This might mean that we allow transaction_cancel in
38415 an expression that we find out later actually has to be a constexpr.
38416 However, we expect that cxx_constant_value will be able to deal with
38417 this; also, if the noexcept has no constexpr, then what we parse next
38418 really is a transaction's body. */
38421 /* Parse a noexcept specification. */
38427 {
38428 matching_parens parens;
38435 }
38436 else
38437 {
38438 /* The only expression that is available got parsed for the noexcept
38439 already. noexcept is true then. */
38442 }
38451 }
38453 /* Parse a function-transaction-block.
38455 function-transaction-block:
38456 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38457 function-body
38458 __transaction_atomic txn-attribute[opt] function-try-block
38459 __transaction_relaxed ctor-initializer[opt] function-body
38460 __transaction_relaxed function-try-block
38461 */
38463 static void
38465 {
38480 else
38481 {
38485 }
38493 else
38494 cp_parser_ctor_initializer_opt_and_function_body
38500 }
38502 /* Parse a __transaction_cancel statement.
38504 cancel-statement:
38505 __transaction_cancel txn-attribute[opt] ;
38506 __transaction_cancel txn-attribute[opt] throw-expression ;
38508 ??? Cancel and throw is not yet implemented. */
38510 static tree
38512 {
38518 RT_TRANSACTION_CANCEL);
38525 /* ??? Parse cancel-and-throw here. */
38530 {
38534 }
38536 {
38540 }
38542 {
38545 {
38551 }
38552 }
38554 {
38558 }
38564 }
38565 \f
38566 /* The parser. */
38570 \f
38571 /* Special handling for the first token or line in the file. The first
38572 thing in the file might be #pragma GCC pch_preprocess, which loads a
38573 PCH file, which is a GC collection point. So we need to handle this
38574 first pragma without benefit of an existing lexer structure.
38576 Always returns one token to the caller in *FIRST_TOKEN. This is
38577 either the true first token of the file, or the first token after
38578 the initial pragma. */
38580 static void
38582 {
38591 {
38598 }
38599 else
38602 /* Skip to the end of the pragma. */
38606 /* Now actually load the PCH file. */
38610 /* Read one more token to return to our caller. We have to do this
38611 after reading the PCH file in, since its pointers have to be
38612 live. */
38614 }
38616 /* Parse a pragma GCC ivdep. */
38618 static bool
38620 {
38623 }
38625 /* Parse a pragma GCC unroll. */
38627 static unsigned short
38629 {
38639 {
38641 " assignment-expression that evaluates to a non-negative"
38644 }
38645 else
38646 {
38650 }
38653 }
38655 /* Normal parsing of a pragma token. Here we can (and must) use the
38656 regular lexer. */
38658 static bool
38660 {
38663 tree stmt;
38674 {
38682 {
38692 }
38697 {
38707 }
38712 {
38723 }
38728 {
38739 }
38744 {
38755 }
38775 {
38780 }
38788 {
38793 }
38801 {
38805 }
38811 {
38816 }
38824 {
38829 }
38884 "%<#pragma omp section%> may only be used in "
38889 {
38891 {
38895 }
38901 {
38905 }
38906 else
38912 {
38915 }
38918 }
38921 {
38923 {
38927 }
38928 const unsigned short unroll
38934 {
38938 }
38939 else
38945 {
38948 }
38951 }
38958 bad_stmt:
38961 }
38965 }
38967 /* The interface the pragma parsers have to the lexer. */
38969 enum cpp_ttype
38971 {
38983 else
38984 {
38988 }
38991 }
38993 \f
38994 /* External interface. */
38996 /* Parse one entire translation unit. */
38998 void
39000 {
39013 }
39015 /* Create an identifier for a generic parameter type (a synthesized
39016 template parameter implied by `auto' or a concept identifier). */
39019 static tree
39021 {
39025 }
39027 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39028 (creating a new template parameter list if necessary). Returns the newly
39029 created template type parm. */
39031 static tree
39033 {
39036 /* Before committing to modifying any scope, if we're in an
39037 implicit template scope, and we're trying to synthesize a
39038 constrained parameter, try to find a previous parameter with
39039 the same name. This is the same-type rule for abbreviated
39040 function templates.
39042 NOTE: We can generate implicit parameters when tentatively
39043 parsing a nested name specifier, only to reject that parse
39044 later. However, matching the same template-id as part of a
39045 direct-declarator should generate an identical template
39046 parameter, so this rule will merge them. */
39048 {
39051 {
39053 {
39056 /* Return the TEMPLATE_PARM_INDEX. */
39059 }
39061 }
39062 }
39064 /* We are either continuing a function template that already contains implicit
39065 template parameters, creating a new fully-implicit function template, or
39066 extending an existing explicit function template with implicit template
39067 parameters. */
39075 {
39079 }
39080 else
39081 {
39082 /* Roll back to the existing template parameter scope (in the case of
39083 extending an explicit function template) or introduce a new template
39084 parameter scope ahead of the function parameter scope (or class scope
39085 in the case of out-of-line member definitions). The function scope is
39086 added back after template parameter synthesis below. */
39091 {
39094 }
39096 {
39097 /* If not defining a class, then any class scope is a scope level in
39098 an out-of-line member definition. In this case simply wind back
39099 beyond the first such scope to inject the template parameter list.
39100 Otherwise wind back to the class being defined. The latter can
39101 occur in class member friend declarations such as:
39103 class A {
39104 void foo (auto);
39105 };
39106 class B {
39107 friend void A::foo (auto);
39108 };
39110 The template parameter list synthesized for the friend declaration
39111 must be injected in the scope of 'B'. This can also occur in
39112 erroneous cases such as:
39114 struct A {
39115 struct B {
39116 void foo (auto);
39117 };
39118 void B::foo (auto) {}
39119 };
39121 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39122 but, nevertheless, the template parameter list synthesized for the
39123 declarator should be injected into the scope of 'A' as if the
39124 ill-formed template was specified explicitly. */
39127 {
39130 }
39131 }
39137 {
39138 /* Introduce a new template parameter list for implicit template
39139 parameters. */
39143 parser->implicit_template_scope
39150 }
39151 else
39152 {
39153 /* Synthesize implicit template parameters at the end of the explicit
39154 template parameter list. */
39161 parser->implicit_template_parms
39163 }
39164 }
39166 /* Synthesize a new template parameter and track the current template
39167 parameter chain with implicit_template_parms. */
39171 tree synth_tmpl_parm;
39175 synth_tmpl_parm
39178 synth_tmpl_parm
39180 else
39181 {
39185 }
39187 // Attach the constraint to the parm before processing.
39190 tree new_parm
39192 input_location,
39193 node,
39197 // Chain the new parameter to the list of implicit parameters.
39199 parser->implicit_template_parms
39201 else
39206 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39209 /* If creating a fully implicit function template, start the new implicit
39210 template parameter list with this synthesized type, otherwise grow the
39211 current template parameter list. */
39214 {
39221 }
39222 else
39223 {
39228 }
39230 // If the new parameter was constrained, we need to add that to the
39231 // constraints in the template parameter list.
39233 {
39237 }
39242 }
39244 /* Finish the declaration of a fully implicit function template. Such a
39245 template has no explicit template parameter list so has not been through the
39246 normal template head and tail processing. synthesize_implicit_template_parm
39247 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39248 provided if the declaration is a class member such that its template
39249 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39250 form is returned. Otherwise NULL_TREE is returned. */
39252 static tree
39254 {
39259 {
39263 }
39275 }
39277 /* Like finish_fully_implicit_template, but to be used in error
39278 recovery, rearranging scopes so that we restore the state we had
39279 before synthesize_implicit_template_parm inserted the implement
39280 template parms scope. */
39282 static void
39284 {
39289 {
39298 }
39299 else
39305 }
39307 /* Helper function for diagnostics that have complained about things
39308 being used with 'extern "C"' linkage.
39310 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39312 void
39314 {
39318 }