| blob | f9181b7451e24ca8bf16cf8d4b77d1f0e6b3e3aa |
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
2051 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2053 static void cp_parser_pseudo_destructor_name
2055 static cp_expr cp_parser_unary_expression
2057 static enum tree_code cp_parser_unary_operator
2059 static tree cp_parser_new_expression
2063 static tree cp_parser_new_type_id
2071 static tree cp_parser_delete_expression
2073 static cp_expr cp_parser_cast_expression
2075 static cp_expr cp_parser_binary_expression
2077 static tree cp_parser_question_colon_clause
2079 static cp_expr cp_parser_assignment_expression
2081 static enum tree_code cp_parser_assignment_operator_opt
2083 static cp_expr cp_parser_expression
2085 static cp_expr cp_parser_constant_expression
2087 static cp_expr cp_parser_builtin_offsetof
2089 static cp_expr cp_parser_lambda_expression
2091 static void cp_parser_lambda_introducer
2093 static bool cp_parser_lambda_declarator_opt
2095 static void cp_parser_lambda_body
2098 /* Statements [gram.stmt.stmt] */
2100 static void cp_parser_statement
2102 static void cp_parser_label_for_labeled_statement
2104 static tree cp_parser_expression_statement
2106 static tree cp_parser_compound_statement
2108 static void cp_parser_statement_seq_opt
2110 static tree cp_parser_selection_statement
2112 static tree cp_parser_condition
2114 static tree cp_parser_iteration_statement
2116 static bool cp_parser_init_statement
2118 static tree cp_parser_for
2120 static tree cp_parser_c_for
2122 static tree cp_parser_range_for
2124 static void do_range_for_auto_deduction
2126 static tree cp_parser_perform_range_for_lookup
2128 static tree cp_parser_range_for_member_function
2130 static tree cp_parser_jump_statement
2132 static void cp_parser_declaration_statement
2135 static tree cp_parser_implicitly_scoped_statement
2137 static void cp_parser_already_scoped_statement
2140 /* Declarations [gram.dcl.dcl] */
2142 static void cp_parser_declaration_seq_opt
2144 static void cp_parser_declaration
2146 static void cp_parser_block_declaration
2148 static void cp_parser_simple_declaration
2150 static void cp_parser_decl_specifier_seq
2152 static tree cp_parser_storage_class_specifier_opt
2154 static tree cp_parser_function_specifier_opt
2156 static tree cp_parser_type_specifier
2159 static tree cp_parser_simple_type_specifier
2161 static tree cp_parser_type_name
2163 static tree cp_parser_type_name
2165 static tree cp_parser_nonclass_name
2167 static tree cp_parser_elaborated_type_specifier
2169 static tree cp_parser_enum_specifier
2171 static void cp_parser_enumerator_list
2173 static void cp_parser_enumerator_definition
2175 static tree cp_parser_namespace_name
2177 static void cp_parser_namespace_definition
2179 static void cp_parser_namespace_body
2181 static tree cp_parser_qualified_namespace_specifier
2183 static void cp_parser_namespace_alias_definition
2185 static bool cp_parser_using_declaration
2187 static void cp_parser_using_directive
2189 static tree cp_parser_alias_declaration
2191 static void cp_parser_asm_definition
2193 static void cp_parser_linkage_specification
2195 static void cp_parser_static_assert
2197 static tree cp_parser_decltype
2199 static tree cp_parser_decomposition_declaration
2202 /* Declarators [gram.dcl.decl] */
2204 static tree cp_parser_init_declarator
2211 static enum tree_code cp_parser_ptr_operator
2213 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2215 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2217 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2219 static tree cp_parser_tx_qualifier_opt
2221 static tree cp_parser_late_return_type_opt
2223 static tree cp_parser_declarator_id
2225 static tree cp_parser_type_id
2227 static tree cp_parser_template_type_arg
2230 static tree cp_parser_type_id_1
2232 static void cp_parser_type_specifier_seq
2234 static tree cp_parser_parameter_declaration_clause
2236 static tree cp_parser_parameter_declaration_list
2240 static tree cp_parser_default_argument
2242 static void cp_parser_function_body
2244 static tree cp_parser_initializer
2246 static cp_expr cp_parser_initializer_clause
2248 static cp_expr cp_parser_braced_list
2253 static void cp_parser_ctor_initializer_opt_and_function_body
2256 static tree cp_parser_late_parsing_omp_declare_simd
2259 static tree cp_parser_late_parsing_oacc_routine
2262 static tree synthesize_implicit_template_parm
2264 static tree finish_fully_implicit_template
2267 /* Classes [gram.class] */
2269 static tree cp_parser_class_name
2271 static tree cp_parser_class_specifier
2273 static tree cp_parser_class_head
2275 static enum tag_types cp_parser_class_key
2277 static void cp_parser_type_parameter_key
2279 static void cp_parser_member_specification_opt
2281 static void cp_parser_member_declaration
2283 static tree cp_parser_pure_specifier
2285 static tree cp_parser_constant_initializer
2288 /* Derived classes [gram.class.derived] */
2290 static tree cp_parser_base_clause
2292 static tree cp_parser_base_specifier
2295 /* Special member functions [gram.special] */
2297 static tree cp_parser_conversion_function_id
2299 static tree cp_parser_conversion_type_id
2303 static void cp_parser_ctor_initializer_opt
2305 static void cp_parser_mem_initializer_list
2307 static tree cp_parser_mem_initializer
2309 static tree cp_parser_mem_initializer_id
2312 /* Overloading [gram.over] */
2314 static cp_expr cp_parser_operator_function_id
2316 static cp_expr cp_parser_operator
2319 /* Templates [gram.temp] */
2321 static void cp_parser_template_declaration
2323 static tree cp_parser_template_parameter_list
2325 static tree cp_parser_template_parameter
2327 static tree cp_parser_type_parameter
2329 static tree cp_parser_template_id
2331 static tree cp_parser_template_name
2333 static tree cp_parser_template_argument_list
2335 static tree cp_parser_template_argument
2337 static void cp_parser_explicit_instantiation
2339 static void cp_parser_explicit_specialization
2342 /* Exception handling [gram.exception] */
2344 static tree cp_parser_try_block
2346 static void cp_parser_function_try_block
2348 static void cp_parser_handler_seq
2350 static void cp_parser_handler
2352 static tree cp_parser_exception_declaration
2354 static tree cp_parser_throw_expression
2356 static tree cp_parser_exception_specification_opt
2358 static tree cp_parser_type_id_list
2361 /* GNU Extensions */
2363 static tree cp_parser_asm_specification_opt
2365 static tree cp_parser_asm_operand_list
2367 static tree cp_parser_asm_clobber_list
2369 static tree cp_parser_asm_label_list
2371 static bool cp_next_tokens_can_be_attribute_p
2373 static bool cp_next_tokens_can_be_gnu_attribute_p
2375 static bool cp_next_tokens_can_be_std_attribute_p
2377 static bool cp_nth_tokens_can_be_std_attribute_p
2379 static bool cp_nth_tokens_can_be_gnu_attribute_p
2381 static bool cp_nth_tokens_can_be_attribute_p
2383 static tree cp_parser_attributes_opt
2385 static tree cp_parser_gnu_attributes_opt
2387 static tree cp_parser_gnu_attribute_list
2389 static tree cp_parser_std_attribute
2391 static tree cp_parser_std_attribute_spec
2393 static tree cp_parser_std_attribute_spec_seq
2395 static bool cp_parser_extension_opt
2397 static void cp_parser_label_declaration
2400 /* Concept Extensions */
2402 static tree cp_parser_requires_clause
2404 static tree cp_parser_requires_clause_opt
2406 static tree cp_parser_requires_expression
2408 static tree cp_parser_requirement_parameter_list
2410 static tree cp_parser_requirement_body
2412 static tree cp_parser_requirement_list
2414 static tree cp_parser_requirement
2416 static tree cp_parser_simple_requirement
2418 static tree cp_parser_compound_requirement
2420 static tree cp_parser_type_requirement
2422 static tree cp_parser_nested_requirement
2425 /* Transactional Memory Extensions */
2427 static tree cp_parser_transaction
2429 static tree cp_parser_transaction_expression
2431 static void cp_parser_function_transaction
2433 static tree cp_parser_transaction_cancel
2437 pragma_external,
2438 pragma_member,
2439 pragma_objc_icode,
2440 pragma_stmt,
2441 pragma_compound
2442 };
2443 static bool cp_parser_pragma
2446 /* Objective-C++ Productions */
2448 static tree cp_parser_objc_message_receiver
2450 static tree cp_parser_objc_message_args
2452 static tree cp_parser_objc_message_expression
2454 static cp_expr cp_parser_objc_encode_expression
2456 static tree cp_parser_objc_defs_expression
2458 static tree cp_parser_objc_protocol_expression
2460 static tree cp_parser_objc_selector_expression
2462 static cp_expr cp_parser_objc_expression
2464 static bool cp_parser_objc_selector_p
2466 static tree cp_parser_objc_selector
2468 static tree cp_parser_objc_protocol_refs_opt
2470 static void cp_parser_objc_declaration
2472 static tree cp_parser_objc_statement
2474 static bool cp_parser_objc_valid_prefix_attributes
2476 static void cp_parser_objc_at_property_declaration
2478 static void cp_parser_objc_at_synthesize_declaration
2480 static void cp_parser_objc_at_dynamic_declaration
2482 static tree cp_parser_objc_struct_declaration
2485 /* Utility Routines */
2487 static cp_expr cp_parser_lookup_name
2489 static tree cp_parser_lookup_name_simple
2491 static tree cp_parser_maybe_treat_template_as_class
2493 static bool cp_parser_check_declarator_template_parameters
2495 static bool cp_parser_check_template_parameters
2497 static cp_expr cp_parser_simple_cast_expression
2499 static tree cp_parser_global_scope_opt
2501 static bool cp_parser_constructor_declarator_p
2503 static tree cp_parser_function_definition_from_specifiers_and_declarator
2505 static tree cp_parser_function_definition_after_declarator
2507 static bool cp_parser_template_declaration_after_export
2509 static void cp_parser_perform_template_parameter_access_checks
2511 static tree cp_parser_single_declaration
2513 static cp_expr cp_parser_functional_cast
2515 static tree cp_parser_save_member_function_body
2517 static tree cp_parser_save_nsdmi
2519 static tree cp_parser_enclosed_template_argument_list
2521 static void cp_parser_save_default_args
2523 static void cp_parser_late_parsing_for_member
2525 static tree cp_parser_late_parse_one_default_arg
2527 static void cp_parser_late_parsing_nsdmi
2529 static void cp_parser_late_parsing_default_args
2531 static tree cp_parser_sizeof_operand
2533 static cp_expr cp_parser_trait_expr
2535 static bool cp_parser_declares_only_class_p
2537 static void cp_parser_set_storage_class
2539 static void cp_parser_set_decl_spec_type
2541 static void set_and_check_decl_spec_loc
2544 static bool cp_parser_friend_p
2546 static void cp_parser_required_error
2552 static bool cp_parser_token_starts_function_definition_p
2554 static bool cp_parser_next_token_starts_class_definition_p
2556 static bool cp_parser_next_token_ends_template_argument_p
2558 static bool cp_parser_nth_token_starts_template_argument_list_p
2560 static enum tag_types cp_parser_token_is_class_key
2562 static enum tag_types cp_parser_token_is_type_parameter_key
2564 static void cp_parser_check_class_key
2566 static void cp_parser_check_access_in_redeclaration
2568 static bool cp_parser_optional_template_keyword
2570 static void cp_parser_pre_parsed_nested_name_specifier
2572 static bool cp_parser_cache_group
2574 static tree cp_parser_cache_defarg
2576 static void cp_parser_parse_tentatively
2578 static void cp_parser_commit_to_tentative_parse
2580 static void cp_parser_commit_to_topmost_tentative_parse
2582 static void cp_parser_abort_tentative_parse
2584 static bool cp_parser_parse_definitely
2588 static bool cp_parser_uncommitted_to_tentative_parse_p
2590 static void cp_parser_error
2592 static void cp_parser_name_lookup_error
2594 static bool cp_parser_simulate_error
2596 static bool cp_parser_check_type_definition
2598 static void cp_parser_check_for_definition_in_return_type
2600 static void cp_parser_check_for_invalid_template_id
2602 static bool cp_parser_non_integral_constant_expression
2604 static void cp_parser_diagnose_invalid_type_name
2606 static bool cp_parser_parse_and_diagnose_invalid_type_name
2608 static int cp_parser_skip_to_closing_parenthesis
2610 static void cp_parser_skip_to_end_of_statement
2612 static void cp_parser_consume_semicolon_at_end_of_statement
2614 static void cp_parser_skip_to_end_of_block_or_statement
2616 static bool cp_parser_skip_to_closing_brace
2618 static void cp_parser_skip_to_end_of_template_parameter_list
2620 static void cp_parser_skip_to_pragma_eol
2622 static bool cp_parser_error_occurred
2624 static bool cp_parser_allow_gnu_extensions_p
2626 static bool cp_parser_is_pure_string_literal
2628 static bool cp_parser_is_string_literal
2630 static bool cp_parser_is_keyword
2632 static tree cp_parser_make_typename_type
2636 static bool cp_parser_compound_literal_p
2638 static bool cp_parser_array_designator_p
2640 static bool cp_parser_init_statement_p
2642 static bool cp_parser_skip_to_closing_square_bracket
2645 /* Concept-related syntactic transformations */
2650 // -------------------------------------------------------------------------- //
2651 // Unevaluated Operand Guard
2652 //
2653 // Implementation of an RAII helper for unevaluated operand parsing.
2655 {
2658 }
2661 {
2664 }
2666 // -------------------------------------------------------------------------- //
2667 // Tentative Parsing
2669 /* Returns nonzero if we are parsing tentatively. */
2673 {
2675 }
2677 /* Returns nonzero if TOKEN is a string literal. */
2679 static bool
2681 {
2687 }
2689 /* Returns nonzero if TOKEN is a string literal
2690 of a user-defined string literal. */
2692 static bool
2694 {
2701 }
2703 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2705 static bool
2707 {
2709 }
2711 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2712 PRAGMA_NONE. */
2714 static enum pragma_kind
2716 {
2719 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2721 }
2723 /* Helper function for cp_parser_error.
2724 Having peeked a token of kind TOK1_KIND that might signify
2725 a conflict marker, peek successor tokens to determine
2726 if we actually do have a conflict marker.
2727 Specifically, we consider a run of 7 '<', '=' or '>' characters
2728 at the start of a line as a conflict marker.
2729 These come through the lexer as three pairs and a single,
2730 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2731 If it returns true, *OUT_LOC is written to with the location/range
2732 of the marker. */
2734 static bool
2737 {
2748 /* It must be at the start of the line. */
2753 /* We have a conflict marker. Construct a location of the form:
2754 <<<<<<<
2755 ^~~~~~~
2756 with start == caret, finishing at the end of the marker. */
2761 }
2763 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2764 RT_CLOSE_PAREN. */
2768 {
2770 {
2778 }
2779 }
2781 /* Attempt to convert TOKEN_DESC from a required_token to an
2782 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2784 static enum cpp_ttype
2786 {
2788 {
2809 /* Use CPP_EOF as a "no completions possible" code. */
2811 }
2812 }
2815 /* Subroutine of cp_parser_error and cp_parser_required_error.
2817 Issue a diagnostic of the form
2818 FILE:LINE: MESSAGE before TOKEN
2819 where TOKEN is the next token in the input stream. MESSAGE
2820 (specified by the caller) is usually of the form "expected
2821 OTHER-TOKEN".
2823 This bypasses the check for tentative passing, and potentially
2824 adds material needed by cp_parser_required_error.
2826 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2827 suggesting insertion of the missing token.
2829 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2830 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2831 location. */
2833 static void
2835 required_token missing_token_desc,
2836 location_t matching_location)
2837 {
2839 /* This diagnostic makes more sense if it is tagged to the line
2840 of the token we just peeked at. */
2844 {
2849 }
2851 /* If this is actually a conflict marker, report it as such. */
2855 {
2856 location_t loc;
2858 {
2861 }
2862 }
2869 {
2870 /* Potentially supply a fix-it hint, suggesting to add the
2871 missing token immediately after the *previous* token.
2872 This may move the primary location within richloc. */
2874 location_t prev_token_loc
2878 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2879 Attempt to consolidate diagnostics by printing it as a
2880 secondary range within the main diagnostic. */
2882 added_matching_location
2884 }
2886 /* Actually emit the error. */
2888 /* Because c_parser_error does not understand
2889 CPP_KEYWORD, keywords are treated like
2890 identifiers. */
2895 {
2896 /* If we weren't able to consolidate matching_location, then
2897 print it as a secondary diagnostic. */
2902 }
2903 }
2905 /* If not parsing tentatively, issue a diagnostic of the form
2906 FILE:LINE: MESSAGE before TOKEN
2907 where TOKEN is the next token in the input stream. MESSAGE
2908 (specified by the caller) is usually of the form "expected
2909 OTHER-TOKEN". */
2911 static void
2913 {
2916 }
2918 /* Issue an error about name-lookup failing. NAME is the
2919 IDENTIFIER_NODE DECL is the result of
2920 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2921 the thing that we hoped to find. */
2923 static void
2925 tree name,
2926 tree decl,
2927 name_lookup_error desired,
2928 location_t location)
2929 {
2930 /* If name lookup completely failed, tell the user that NAME was not
2931 declared. */
2933 {
2946 else
2948 }
2950 {
2952 {
2969 }
2970 }
2972 {
2974 {
2984 name);
2988 }
2989 }
2990 else
2991 {
2993 {
3006 }
3007 }
3008 }
3010 /* If we are parsing tentatively, remember that an error has occurred
3011 during this tentative parse. Returns true if the error was
3012 simulated; false if a message should be issued by the caller. */
3014 static bool
3016 {
3018 {
3021 }
3023 }
3025 /* This function is called when a type is defined. If type
3026 definitions are forbidden at this point, an error message is
3027 issued. */
3029 static bool
3031 {
3032 /* If types are forbidden here, issue a message. */
3034 {
3035 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3036 in the message need to be interpreted. */
3039 }
3041 }
3043 /* This function is called when the DECLARATOR is processed. The TYPE
3044 was a type defined in the decl-specifiers. If it is invalid to
3045 define a type in the decl-specifiers for DECLARATOR, an error is
3046 issued. TYPE_LOCATION is the location of TYPE and is used
3047 for error reporting. */
3049 static void
3052 {
3053 /* [dcl.fct] forbids type definitions in return types.
3054 Unfortunately, it's not easy to know whether or not we are
3055 processing a return type until after the fact. */
3063 {
3068 type);
3069 }
3070 }
3072 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3073 "<" in any valid C++ program. If the next token is indeed "<",
3074 issue a message warning the user about what appears to be an
3075 invalid attempt to form a template-id. LOCATION is the location
3076 of the type-specifier (TYPE) */
3078 static void
3080 tree type,
3082 location_t location)
3083 {
3087 {
3093 {
3096 else
3098 }
3099 else
3101 /* Remember the location of the invalid "<". */
3104 /* Consume the "<". */
3106 /* Parse the template arguments. */
3108 /* Permanently remove the invalid template arguments so that
3109 this error message is not issued again. */
3112 }
3113 }
3115 /* If parsing an integral constant-expression, issue an error message
3116 about the fact that THING appeared and return true. Otherwise,
3117 return false. In either case, set
3118 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3120 static bool
3122 non_integral_constant thing)
3123 {
3126 {
3128 {
3131 {
3134 "ISO C++ forbids using a floating-point literal "
3139 "enumeration type cannot appear in a "
3230 }
3234 }
3235 }
3237 }
3239 /* Emit a diagnostic for an invalid type name. This function commits
3240 to the current active tentative parse, if any. (Otherwise, the
3241 problematic construct might be encountered again later, resulting
3242 in duplicate error messages.) LOCATION is the location of ID. */
3244 static void
3246 location_t location)
3247 {
3250 /* Try to lookup the identifier. */
3257 /* If the lookup was ambiguous, an error will already have
3258 been issued. */
3260 /* If the lookup found a template-name, it means that the user forgot
3261 to specify an argument list. Emit a useful error message. */
3263 {
3266 decl);
3271 }
3275 /* Something like 'unsigned A a;' */
3278 {
3279 /* Issue an error message. */
3280 name_hint hint;
3284 {
3290 }
3291 else
3293 /* If we're in a template class, it's possible that the user was
3294 referring to a type from a base class. For example:
3296 template <typename T> struct A { typedef T X; };
3297 template <typename T> struct B : public A<T> { X x; };
3299 The user should have said "typename A<T>::X". */
3315 {
3316 tree b;
3319 b;
3321 {
3325 {
3326 tree field;
3327 /* Go from a particular instantiation of the
3328 template (which will have an empty TYPE_FIELDs),
3329 to the main version. */
3332 field;
3336 {
3341 }
3344 }
3345 }
3346 }
3347 }
3348 /* Here we diagnose qualified-ids where the scope is actually correct,
3349 but the identifier does not resolve to a valid type name. */
3351 {
3353 {
3362 else
3371 }
3374 {
3375 /* A<T>::A<T>() */
3381 }
3384 {
3387 "need %<typename%> before %<%T::%D::%E%> because "
3391 id,
3394 else
3398 }
3400 {
3412 else
3418 }
3419 else
3421 }
3422 }
3424 /* Check for a common situation where a type-name should be present,
3425 but is not, and issue a sensible error message. Returns true if an
3426 invalid type-name was detected.
3428 The situation handled by this function are variable declarations of the
3429 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3430 Usually, `ID' should name a type, but if we got here it means that it
3431 does not. We try to emit the best possible error message depending on
3432 how exactly the id-expression looks like. */
3434 static bool
3436 {
3437 tree id;
3440 /* Avoid duplicate error about ambiguous lookup. */
3442 {
3446 }
3455 /* If the next token is a (, this is a function with no explicit return
3456 type, i.e. constructor, destructor or conversion op. */
3459 {
3462 }
3466 /* Emit a diagnostic for the invalid type. */
3468 out:
3469 /* If we aren't in the middle of a declarator (i.e. in a
3470 parameter-declaration-clause), skip to the end of the declaration;
3471 there's no point in trying to process it. */
3475 }
3477 /* Consume tokens up to, and including, the next non-nested closing `)'.
3478 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3479 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3480 found an unnested token of that type. */
3482 static int
3485 cpp_ttype or_ttype,
3487 {
3497 {
3500 /* Have we found what we're looking for before the closing paren? */
3506 {
3509 /* If we've run out of tokens, then there is no closing `)'. */
3512 /* This is good for lambda expression capture-lists. */
3522 /* This matches the processing in skip_to_end_of_statement. */
3542 {
3546 }
3551 }
3553 /* Consume the token. */
3555 }
3556 }
3558 /* Consume tokens up to, and including, the next non-nested closing `)'.
3559 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3560 are doing error recovery. Returns -1 if OR_COMMA is true and we
3561 found an unnested token of that type. */
3563 static int
3568 {
3572 }
3574 /* Consume tokens until we reach the end of the current statement.
3575 Normally, that will be just before consuming a `;'. However, if a
3576 non-nested `}' comes first, then we stop before consuming that. */
3578 static void
3580 {
3583 /* Unwind generic function template scope if necessary. */
3588 {
3592 {
3595 /* If we've run out of tokens, stop. */
3599 /* If the next token is a `;', we have reached the end of the
3600 statement. */
3606 /* If this is a non-nested '}', stop before consuming it.
3607 That way, when confronted with something like:
3609 { 3 + }
3611 we stop before consuming the closing '}', even though we
3612 have not yet reached a `;'. */
3616 /* If it is the closing '}' for a block that we have
3617 scanned, stop -- but only after consuming the token.
3618 That way given:
3620 void f g () { ... }
3621 typedef int I;
3623 we will stop after the body of the erroneously declared
3624 function, but before consuming the following `typedef'
3625 declaration. */
3627 {
3630 }
3639 }
3641 /* Consume the token. */
3643 }
3644 }
3646 /* This function is called at the end of a statement or declaration.
3647 If the next token is a semicolon, it is consumed; otherwise, error
3648 recovery is attempted. */
3650 static void
3652 {
3653 /* Look for the trailing `;'. */
3655 {
3656 /* If there is additional (erroneous) input, skip to the end of
3657 the statement. */
3659 /* If the next token is now a `;', consume it. */
3662 }
3663 }
3665 /* Skip tokens until we have consumed an entire block, or until we
3666 have consumed a non-nested `;'. */
3668 static void
3670 {
3673 /* Unwind generic function template scope if necessary. */
3678 {
3682 {
3685 /* If we've run out of tokens, stop. */
3689 /* Stop if this is an unnested ';'. */
3695 /* Stop if this is an unnested '}', or closes the outermost
3696 nesting level. */
3697 nesting_depth--;
3705 /* Nest. */
3706 nesting_depth++;
3711 }
3713 /* Consume the token. */
3715 }
3716 }
3718 /* Skip tokens until a non-nested closing curly brace is the next
3719 token, or there are no more tokens. Return true in the first case,
3720 false otherwise. */
3722 static bool
3724 {
3728 {
3732 {
3735 /* If we've run out of tokens, stop. */
3739 /* If the next token is a non-nested `}', then we have reached
3740 the end of the current block. */
3746 /* If it the next token is a `{', then we are entering a new
3747 block. Consume the entire block. */
3753 }
3755 /* Consume the token. */
3757 }
3758 }
3760 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3761 parameter is the PRAGMA token, allowing us to purge the entire pragma
3762 sequence. */
3764 static void
3766 {
3771 do
3775 /* Ensure that the pragma is not parsed again. */
3777 }
3779 /* Require pragma end of line, resyncing with it as necessary. The
3780 arguments are as for cp_parser_skip_to_pragma_eol. */
3782 static void
3784 {
3788 }
3790 /* This is a simple wrapper around make_typename_type. When the id is
3791 an unresolved identifier node, we can provide a superior diagnostic
3792 using cp_parser_diagnose_invalid_type_name. */
3794 static tree
3796 location_t id_location)
3797 {
3798 tree result;
3800 {
3806 }
3808 }
3810 /* This is a wrapper around the
3811 make_{pointer,ptrmem,reference}_declarator functions that decides
3812 which one to call based on the CODE and CLASS_TYPE arguments. The
3813 CODE argument should be one of the values returned by
3814 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3815 appertain to the pointer or reference. */
3819 cp_cv_quals cv_qualifiers,
3821 tree attributes)
3822 {
3829 else
3839 }
3841 /* Create a new C++ parser. */
3845 {
3850 /* cp_lexer_new_main is called before doing GC allocation because
3851 cp_lexer_new_main might load a PCH file. */
3854 /* Initialize the binops_by_token so that we can get the tree
3855 directly from the token. */
3863 /* For now, we always accept GNU extensions. */
3866 /* The `>' token is a greater-than operator, not the end of a
3867 template-id. */
3872 /* We are not parsing a constant-expression. */
3877 /* Local variable names are not forbidden. */
3880 /* We are not processing an `extern "C"' declaration. */
3883 /* We are not processing a declarator. */
3886 /* We are not processing a template-argument-list. */
3889 /* We are not in an iteration statement. */
3892 /* We are not in a switch statement. */
3895 /* We are not parsing a type-id inside an expression. */
3898 /* Declarations aren't implicitly extern "C". */
3901 /* String literals should be translated to the execution character set. */
3904 /* We are not parsing a function body. */
3907 /* We can correct until told otherwise. */
3910 /* The unparsed function queue is empty. */
3913 /* There are no classes being defined. */
3916 /* No template parameters apply. */
3919 /* Special parsing data structures. */
3923 /* Not declaring an implicit function template. */
3929 /* Allow constrained-type-specifiers. */
3932 /* We haven't yet seen an 'extern "C"'. */
3936 }
3938 /* Create a cp_lexer structure which will emit the tokens in CACHE
3939 and push it onto the parser's lexer stack. This is used for delayed
3940 parsing of in-class method bodies and default arguments, and should
3941 not be confused with tentative parsing. */
3942 static void
3944 {
3949 /* Move the current source position to that of the first token in the
3950 new lexer. */
3952 }
3954 /* Pop the top lexer off the parser stack. This is never used for the
3955 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3956 static void
3958 {
3963 /* Put the current source position back where it was before this
3964 lexer was pushed. */
3966 }
3968 /* Lexical conventions [gram.lex] */
3970 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3971 identifier. */
3973 static cp_expr
3975 {
3978 /* Look for the identifier. */
3980 /* Return the value. */
3983 else
3985 }
3987 /* Parse a sequence of adjacent string constants. Returns a
3988 TREE_STRING representing the combined, nul-terminated string
3989 constant. If TRANSLATE is true, translate the string to the
3990 execution character set. If WIDE_OK is true, a wide string is
3991 invalid here.
3993 C++98 [lex.string] says that if a narrow string literal token is
3994 adjacent to a wide string literal token, the behavior is undefined.
3995 However, C99 6.4.5p4 says that this results in a wide string literal.
3996 We follow C99 here, for consistency with the C front end.
3998 This code is largely lifted from lex_string() in c-lex.c.
4000 FUTURE: ObjC++ will need to handle @-strings here. */
4001 static cp_expr
4004 {
4005 tree value;
4012 tree string_tree;
4018 {
4021 }
4026 {
4030 }
4031 else
4032 {
4035 }
4038 /* Try to avoid the overhead of creating and destroying an obstack
4039 for the common case of just one string. */
4042 {
4050 {
4054 }
4055 else
4059 }
4060 else
4061 {
4066 do
4067 {
4069 count++;
4074 {
4077 {
4080 }
4083 {
4088 }
4090 }
4091 else
4095 {
4099 {
4103 "unsupported non-standard concatenation "
4105 }
4106 }
4114 {
4118 }
4119 else
4120 {
4124 }
4125 }
4128 /* A string literal built by concatenation has its caret=start at
4129 the start of the initial string, and its finish at the finish of
4130 the final string literal. */
4134 }
4137 {
4140 }
4144 {
4149 {
4164 }
4169 {
4174 else
4176 }
4177 }
4178 else
4179 /* cpp_interpret_string has issued an error. */
4186 }
4188 /* Look up a literal operator with the name and the exact arguments. */
4190 static tree
4192 {
4193 tree decl;
4199 {
4205 {
4208 {
4218 }
4221 /* May be this should be sufficient_parms_p instead,
4222 depending on how exactly should user-defined literals
4223 work in presence of default arguments on the literal
4224 operator parameters. */
4227 }
4228 }
4231 }
4233 /* Parse a user-defined char constant. Returns a call to a user-defined
4234 literal operator taking the character as an argument. */
4236 static cp_expr
4238 {
4246 /* Build up a call to the user-defined operator */
4247 /* Lookup the name we got back from the id-expression. */
4252 {
4257 }
4261 }
4263 /* A subroutine of cp_parser_userdef_numeric_literal to
4264 create a char... template parameter pack from a string node. */
4266 static tree
4268 {
4269 tree charvec;
4275 /* Fill in CHARVEC with all of the parameters. */
4280 /* Build the argument packs. */
4286 }
4288 /* A subroutine of cp_parser_userdef_numeric_literal to
4289 create a char... template parameter pack from a string node. */
4291 static tree
4293 {
4294 tree charvec;
4305 /* First template parm is character type. */
4308 /* Fill in CHARVEC with all of the parameters. */
4315 /* Build the argument packs. */
4321 }
4323 /* Parse a user-defined numeric constant. returns a call to a user-defined
4324 literal operator. */
4326 static cp_expr
4328 {
4339 /* Look for a literal operator taking the exact type of numeric argument
4340 as the literal value. */
4345 {
4347 tf_warning_or_error);
4350 {
4353 long_long_unsigned_type_node);
4354 }
4355 else
4356 {
4360 long_double_type_node);
4364 }
4368 }
4371 /* If the numeric argument didn't work, look for a raw literal
4372 operator taking a const char* argument consisting of the number
4373 in string format. */
4378 {
4380 tf_warning_or_error);
4383 }
4386 /* If the raw literal didn't work, look for a non-type template
4387 function with parameter pack char.... Call the function with
4388 template parameter characters representing the number. */
4392 {
4396 tf_warning_or_error);
4399 }
4403 /* In C++14 the standard library defines complex number suffixes that
4404 conflict with GNU extensions. Prefer them if <complex> is #included. */
4414 {
4419 {
4420 /* No <complex>, so pedwarn and use GNU semantics. */
4423 }
4424 }
4426 bool complained
4433 {
4435 "(from <complex>) to enable the C++14 user-defined literal "
4440 }
4447 else
4448 {
4449 /* Use the built-in semantics. */
4450 tree type;
4452 {
4455 else
4457 }
4466 }
4469 /* Avoid repeated diagnostics. */
4472 }
4474 /* Parse a user-defined string constant. Returns a call to a user-defined
4475 literal operator taking a character pointer and the length of the string
4476 as arguments. */
4478 static tree
4480 {
4489 /* Build up a call to the user-defined operator. */
4490 /* Lookup the name we got back from the id-expression. */
4497 {
4499 tf_warning_or_error);
4502 }
4505 /* Look for a template function with typename parameter CharT
4506 and parameter pack CharT... Call the function with
4507 template parameter characters representing the string. */
4511 {
4515 tf_warning_or_error);
4518 }
4524 }
4527 /* Basic concepts [gram.basic] */
4529 /* Parse a translation-unit.
4531 translation-unit:
4532 declaration-seq [opt]
4534 Returns TRUE if all went well. */
4536 static bool
4538 {
4539 /* The address of the first non-permanent object on the declarator
4540 obstack. */
4545 /* Create the declarator obstack, if necessary. */
4547 {
4549 /* Create the error declarator. */
4551 /* Create the empty parameter list. */
4553 UNKNOWN_LOCATION);
4554 /* Remember where the base of the declarator obstack lies. */
4556 }
4560 /* If there are no tokens left then all went well. */
4562 {
4563 /* Get rid of the token array; we don't need it any more. */
4567 /* This file might have been a context that's implicitly extern
4568 "C". If so, pop the lang context. (Only relevant for PCH.) */
4570 {
4573 }
4575 /* Finish up. */
4579 }
4580 else
4581 {
4584 }
4586 /* Make sure the declarator obstack was fully cleaned up. */
4590 /* All went well. */
4592 }
4594 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4595 decltype context. */
4599 {
4604 }
4606 /* We're about to parse a collection of statements. If we're currently
4607 parsing tentatively, set up a firewall so that any nested
4608 cp_parser_commit_to_tentative_parse won't affect the current context. */
4610 static cp_token_position
4612 {
4619 }
4621 /* We've finished parsing the collection of statements. Wrap up the
4622 firewall and replace the relevant tokens with the parsed form. */
4624 static void
4626 tree expr)
4627 {
4631 /* Finish the firewall level. */
4633 /* And remember the result of the parse for when we try again. */
4639 }
4641 /* Like the above functions, but let the user modify the tokens. Used by
4642 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4643 later parses, so it makes sense to localize the effects of
4644 cp_parser_commit_to_tentative_parse. */
4646 struct tentative_firewall
4647 {
4652 {
4653 /* If we're currently parsing tentatively, start a committed level as a
4654 firewall and then an inner tentative parse. */
4656 {
4660 }
4661 }
4664 {
4666 {
4667 /* Finish the inner tentative parse and the firewall, propagating any
4668 uncommitted error state to the outer tentative parse. */
4674 }
4675 }
4676 };
4678 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4679 This class is for tracking such a matching pair of symbols.
4680 In particular, it tracks the location of the first token,
4681 so that if the second token is missing, we can highlight the
4682 location of the first token when notifying the user about the
4683 problem. */
4686 class token_pair
4687 {
4689 /* token_pair's ctor. */
4692 /* If the next token is the opening symbol for this pair, consume it and
4693 return true.
4694 Otherwise, issue an error and return false.
4695 In either case, record the location of the opening token. */
4698 {
4702 }
4704 /* Consume the next token from PARSER, recording its location as
4705 that of the opening token within the pair. */
4708 {
4713 }
4715 /* If the next token is the closing symbol for this pair, consume it
4716 and return it.
4717 Otherwise, issue an error, highlighting the location of the
4718 corresponding opening token, and return NULL. */
4721 {
4724 m_open_loc);
4725 }
4728 location_t m_open_loc;
4729 };
4731 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4733 struct matching_paren_traits
4734 {
4739 };
4741 /* "matching_parens" is a token_pair<T> class for tracking matching
4742 pairs of parentheses. */
4746 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4748 struct matching_brace_traits
4749 {
4754 };
4756 /* "matching_braces" is a token_pair<T> class for tracking matching
4757 pairs of braces. */
4762 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4763 enclosing parentheses. */
4765 static cp_expr
4767 {
4770 /* Consume the '('. */
4772 matching_parens parens;
4774 /* Start the statement-expression. */
4776 /* Parse the compound-statement. */
4778 /* Finish up. */
4780 /* Consume the ')'. */
4788 }
4790 /* Expressions [gram.expr] */
4792 /* Parse a fold-operator.
4794 fold-operator:
4795 - * / % ^ & | = < > << >>
4796 = -= *= /= %= ^= &= |= <<= >>=
4797 == != <= >= && || , .* ->*
4799 This returns the tree code corresponding to the matched operator
4800 as an int. When the current token matches a compound assignment
4801 opertor, the resulting tree code is the negative value of the
4802 non-assignment operator. */
4804 static int
4806 {
4808 {
4848 }
4849 }
4851 /* Returns true if CODE indicates a binary expression, which is not allowed in
4852 the LHS of a fold-expression. More codes will need to be added to use this
4853 function in other contexts. */
4855 static bool
4857 {
4859 {
4892 }
4893 }
4895 /* If the next token is a suitable fold operator, consume it and return as
4896 the function above. */
4898 static int
4900 {
4906 }
4908 /* Parse a fold-expression.
4910 fold-expression:
4911 ( ... folding-operator cast-expression)
4912 ( cast-expression folding-operator ... )
4913 ( cast-expression folding operator ... folding-operator cast-expression)
4915 Note that the '(' and ')' are matched in primary expression. */
4917 static cp_expr
4919 {
4920 cp_id_kind pidk;
4922 // Left fold.
4924 {
4928 {
4931 }
4938 }
4943 {
4946 }
4949 {
4952 }
4955 /* The operands of a fold-expression are cast-expressions, so binary or
4956 conditional expressions are not allowed. We check this here to avoid
4957 tentative parsing. */
4967 // Right fold.
4972 {
4975 }
4978 // Binary left or right fold.
4983 }
4985 /* Parse a primary-expression.
4987 primary-expression:
4988 literal
4989 this
4990 ( expression )
4991 id-expression
4992 lambda-expression (C++11)
4994 GNU Extensions:
4996 primary-expression:
4997 ( compound-statement )
4998 __builtin_va_arg ( assignment-expression , type-id )
4999 __builtin_offsetof ( type-id , offsetof-expression )
5001 C++ Extensions:
5002 __has_nothrow_assign ( type-id )
5003 __has_nothrow_constructor ( type-id )
5004 __has_nothrow_copy ( type-id )
5005 __has_trivial_assign ( type-id )
5006 __has_trivial_constructor ( type-id )
5007 __has_trivial_copy ( type-id )
5008 __has_trivial_destructor ( type-id )
5009 __has_virtual_destructor ( type-id )
5010 __is_abstract ( type-id )
5011 __is_base_of ( type-id , type-id )
5012 __is_class ( type-id )
5013 __is_empty ( type-id )
5014 __is_enum ( type-id )
5015 __is_final ( type-id )
5016 __is_literal_type ( type-id )
5017 __is_pod ( type-id )
5018 __is_polymorphic ( type-id )
5019 __is_std_layout ( type-id )
5020 __is_trivial ( type-id )
5021 __is_union ( type-id )
5023 Objective-C++ Extension:
5025 primary-expression:
5026 objc-expression
5028 literal:
5029 __null
5031 ADDRESS_P is true iff this expression was immediately preceded by
5032 "&" and therefore might denote a pointer-to-member. CAST_P is true
5033 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5034 true iff this expression is a template argument.
5036 Returns a representation of the expression. Upon return, *IDK
5037 indicates what kind of id-expression (if any) was present. */
5039 static cp_expr
5046 {
5049 /* Assume the primary expression is not an id-expression. */
5052 /* Peek at the next token. */
5055 {
5056 /* literal:
5057 integer-literal
5058 character-literal
5059 floating-literal
5060 string-literal
5061 boolean-literal
5062 pointer-literal
5063 user-defined-literal */
5075 {
5079 }
5080 /* Floating-point literals are only allowed in an integral
5081 constant expression if they are cast to an integral or
5082 enumeration type. */
5086 {
5087 /* CAST_P will be set even in invalid code like "int(2.7 +
5088 ...)". Therefore, we have to check that the next token
5089 is sure to end the cast. */
5091 {
5096 enumerator-definition. */
5098 /* The curly brace at the end of an enum-specifier. */
5100 /* The end of a statement. */
5102 /* The end of the cast-expression. */
5104 /* The end of an array bound. */
5106 /* The closing ">" in a template-argument-list. */
5109 /* C++0x only: A ">>" treated like two ">" tokens,
5110 in a template-argument-list. */
5115 }
5117 /* If we are within a cast, then the constraint that the
5118 cast is to an integral or enumeration type will be
5119 checked at that point. If we are not within a cast, then
5120 this code is invalid. */
5123 }
5143 /* ??? Should wide strings be allowed when parser->translate_strings_p
5144 is false (i.e. in attributes)? If not, we can kill the third
5145 argument to cp_parser_string_literal. */
5151 /* If we see `( { ' then we are looking at the beginning of
5152 a GNU statement-expression. */
5155 {
5156 /* Statement-expressions are not allowed by the standard. */
5160 /* And they're not allowed outside of a function-body; you
5161 cannot, for example, write:
5163 int i = ({ int j = 3; j + 1; });
5165 at class or namespace scope. */
5168 {
5170 "statement-expressions are not allowed outside "
5176 }
5177 else
5179 }
5180 /* Otherwise it's a normal parenthesized expression. */
5181 {
5182 cp_expr expr;
5187 /* Consume the `('. */
5188 matching_parens parens;
5190 /* Within a parenthesized expression, a `>' token is always
5191 the greater-than operator. */
5192 saved_greater_than_is_operator_p
5197 /* Left fold expression. */
5199 else
5200 /* Parse the parenthesized expression. */
5205 {
5212 }
5213 else
5214 /* Let the front end know that this expression was
5215 enclosed in parentheses. This matters in case, for
5216 example, the expression is of the form `A::B', since
5217 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5218 not. */
5221 /* DR 705: Wrapping an unqualified name in parentheses
5222 suppresses arg-dependent lookup. We want to pass back
5223 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5224 (c++/37862), but none of the others. */
5228 /* The `>' token might be the end of a template-id or
5229 template-parameter-list now. */
5230 parser->greater_than_is_operator_p
5233 /* Consume the `)'. */
5242 }
5245 {
5247 {
5248 /* We might have an Objective-C++ message. */
5251 /* If that works out, we're done ... */
5254 /* ... else, fall though to see if it's a lambda. */
5255 }
5257 /* Don't warn about a failed tentative parse. */
5262 }
5266 /* We have an Objective-C++ string literal. */
5273 {
5274 /* These two are the boolean literals. */
5282 /* The `__null' literal. */
5287 /* The `nullptr' literal. */
5292 /* Recognize the `this' keyword. */
5296 {
5300 }
5301 /* Pointers cannot appear in constant-expressions. */
5306 /* The `operator' keyword can be the beginning of an
5307 id-expression. */
5314 {
5315 non_integral_constant name;
5317 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5318 __func__ are the names of variables -- but they are
5319 treated specially. Therefore, they are handled here,
5320 rather than relying on the generic id-expression logic
5321 below. Grammatically, these names are id-expressions.
5323 Consume the token. */
5327 {
5339 }
5344 /* Look up the name. */
5346 }
5349 {
5350 tree expression;
5351 tree type;
5352 source_location type_location;
5353 location_t start_loc
5355 /* The `__builtin_va_arg' construct is used to handle
5356 `va_arg'. Consume the `__builtin_va_arg' token. */
5358 /* Look for the opening `('. */
5359 matching_parens parens;
5361 /* Now, parse the assignment-expression. */
5363 /* Look for the `,'. */
5366 /* Parse the type-id. */
5367 {
5370 }
5371 /* Look for the closing `)'. */
5372 location_t finish_loc
5375 /* Using `va_arg' in a constant-expression is not
5376 allowed. */
5378 NIC_VA_ARG))
5380 /* Construct a location of the form:
5381 __builtin_va_arg (v, int)
5382 ~~~~~~~~~~~~~~~~~~~~~^~~~
5383 with the caret at the type, ranging from the start of the
5384 "__builtin_va_arg" token to the close paren. */
5385 location_t combined_loc
5388 }
5423 // C++ concepts
5427 /* Objective-C++ expressions. */
5437 {
5442 }
5443 /* FALLTHRU */
5447 }
5449 /* An id-expression can start with either an identifier, a
5450 `::' as the beginning of a qualified-id, or the "operator"
5451 keyword. */
5456 {
5457 id_expression:
5458 cp_expr id_expression;
5459 cp_expr decl;
5465 /* Parse the id-expression. */
5466 id_expression
5483 /* If we have a template-id, then no further lookup is
5484 required. If the template-id was for a template-class, we
5485 will sometimes have a TYPE_DECL at this point. */
5489 /* Look up the name. */
5490 else
5491 {
5492 tree ambiguous_decls;
5494 /* If we already know that this lookup is ambiguous, then
5495 we've already issued an error message; there's no reason
5496 to check again. */
5499 {
5502 }
5505 none_type,
5506 template_p,
5511 /* If the lookup was ambiguous, an error will already have
5512 been issued. */
5516 /* In Objective-C++, we may have an Objective-C 2.0
5517 dot-syntax for classes here. */
5522 {
5523 tree component;
5530 component);
5531 /* Build a location of the form:
5532 expr.component
5533 ~~~~~^~~~~~~~~
5534 with caret at the start of the component name (at
5535 input_location), ranging from the start of the id_expression
5536 to the end of the component name. */
5537 location_t combined_loc
5542 }
5544 /* In Objective-C++, an instance variable (ivar) may be preferred
5545 to whatever cp_parser_lookup_name() found.
5546 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5547 rest of c-family, we have to do a little extra work to preserve
5548 any location information in cp_expr "decl". Given that
5549 objc_lookup_ivar is implemented in "c-family" and "objc", we
5550 have a trip through the pure "tree" type, rather than cp_expr.
5551 Naively copying it back to "decl" would implicitly give the
5552 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5553 store an EXPR_LOCATION. Hence we only update "decl" (and
5554 hence its location_t) if we get back a different tree node. */
5556 id_expression);
5560 /* If name lookup gives us a SCOPE_REF, then the
5561 qualifying scope was dependent. */
5563 {
5564 /* At this point, we do not know if DECL is a valid
5565 integral constant expression. We assume that it is
5566 in fact such an expression, so that code like:
5568 template <int N> struct A {
5569 int a[B<N>::i];
5570 };
5572 is accepted. At template-instantiation time, we
5573 will check that B<N>::i is actually a constant. */
5575 }
5576 /* Check to see if DECL is a local variable in a context
5577 where that is forbidden. */
5580 {
5581 /* It might be that we only found DECL because we are
5582 trying to be generous with pre-ISO scoping rules.
5583 For example, consider:
5585 int i;
5586 void g() {
5587 for (int i = 0; i < 10; ++i) {}
5588 extern void f(int j = i);
5589 }
5591 Here, name look up will originally find the out
5592 of scope `i'. We need to issue a warning message,
5593 but then use the global `i'. */
5596 {
5601 }
5602 }
5603 }
5605 decl = (finish_id_expression
5607 idk,
5612 template_arg_p,
5619 }
5621 /* Anything else is an error. */
5625 }
5626 }
5634 {
5637 }
5639 /* Parse an id-expression.
5641 id-expression:
5642 unqualified-id
5643 qualified-id
5645 qualified-id:
5646 :: [opt] nested-name-specifier template [opt] unqualified-id
5647 :: identifier
5648 :: operator-function-id
5649 :: template-id
5651 Return a representation of the unqualified portion of the
5652 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5653 a `::' or nested-name-specifier.
5655 Often, if the id-expression was a qualified-id, the caller will
5656 want to make a SCOPE_REF to represent the qualified-id. This
5657 function does not do this in order to avoid wastefully creating
5658 SCOPE_REFs when they are not required.
5660 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5661 `template' keyword.
5663 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5664 uninstantiated templates.
5666 If *TEMPLATE_P is non-NULL, it is set to true iff the
5667 `template' keyword is used to explicitly indicate that the entity
5668 named is a template.
5670 If DECLARATOR_P is true, the id-expression is appearing as part of
5671 a declarator, rather than as part of an expression. */
5673 static cp_expr
5680 {
5684 /* Assume the `template' keyword was not used. */
5688 /* Look for the optional `::' operator. */
5689 global_scope_p
5690 = (!template_keyword_p
5695 /* Look for the optional nested-name-specifier. */
5696 nested_name_specifier_p
5699 check_dependency_p,
5701 declarator_p,
5702 template_keyword_p)
5705 /* If there is a nested-name-specifier, then we are looking at
5706 the first qualified-id production. */
5708 {
5709 tree saved_scope;
5710 tree saved_object_scope;
5711 tree saved_qualifying_scope;
5712 cp_expr unqualified_id;
5715 /* See if the next token is the `template' keyword. */
5719 /* Name lookup we do during the processing of the
5720 unqualified-id might obliterate SCOPE. */
5724 /* Process the final unqualified-id. */
5726 check_dependency_p,
5727 declarator_p,
5729 /* Restore the SAVED_SCOPE for our caller. */
5735 }
5736 /* Otherwise, if we are in global scope, then we are looking at one
5737 of the other qualified-id productions. */
5739 {
5741 tree id;
5743 /* Peek at the next token. */
5746 /* If it's an identifier, and the next token is not a "<", then
5747 we can avoid the template-id case. This is an optimization
5748 for this common case. */
5750 && !cp_parser_nth_token_starts_template_argument_list_p
5755 /* Try a template-id. */
5759 none_type,
5760 declarator_p);
5761 /* If that worked, we're done. */
5765 /* Peek at the next token. (Changes in the token buffer may
5766 have invalidated the pointer obtained above.) */
5770 {
5777 /* Fall through. */
5782 }
5783 }
5784 else
5787 declarator_p,
5788 optional_p);
5789 }
5791 /* Parse an unqualified-id.
5793 unqualified-id:
5794 identifier
5795 operator-function-id
5796 conversion-function-id
5797 ~ class-name
5798 template-id
5800 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5801 keyword, in a construct like `A::template ...'.
5803 Returns a representation of unqualified-id. For the `identifier'
5804 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5805 production a BIT_NOT_EXPR is returned; the operand of the
5806 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5807 other productions, see the documentation accompanying the
5808 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5809 names are looked up in uninstantiated templates. If DECLARATOR_P
5810 is true, the unqualified-id is appearing as part of a declarator,
5811 rather than as part of an expression. */
5813 static cp_expr
5819 {
5822 /* Peek at the next token. */
5826 {
5828 {
5829 tree id;
5831 /* We don't know yet whether or not this will be a
5832 template-id. */
5834 /* Try a template-id. */
5836 check_dependency_p,
5837 none_type,
5838 declarator_p);
5839 /* If it worked, we're done. */
5842 /* Otherwise, it's an ordinary identifier. */
5844 }
5848 check_dependency_p,
5849 none_type,
5850 declarator_p);
5853 {
5854 tree type_decl;
5855 tree qualifying_scope;
5856 tree object_scope;
5857 tree scope;
5860 /* Consume the `~' token. */
5862 /* Parse the class-name. The standard, as written, seems to
5863 say that:
5865 template <typename T> struct S { ~S (); };
5866 template <typename T> S<T>::~S() {}
5868 is invalid, since `~' must be followed by a class-name, but
5869 `S<T>' is dependent, and so not known to be a class.
5870 That's not right; we need to look in uninstantiated
5871 templates. A further complication arises from:
5873 template <typename T> void f(T t) {
5874 t.T::~T();
5875 }
5877 Here, it is not possible to look up `T' in the scope of `T'
5878 itself. We must look in both the current scope, and the
5879 scope of the containing complete expression.
5881 Yet another issue is:
5883 struct S {
5884 int S;
5885 ~S();
5886 };
5888 S::~S() {}
5890 The standard does not seem to say that the `S' in `~S'
5891 should refer to the type `S' and not the data member
5892 `S::S'. */
5894 /* DR 244 says that we look up the name after the "~" in the
5895 same scope as we looked up the qualifying name. That idea
5896 isn't fully worked out; it's more complicated than that. */
5901 /* Check for invalid scopes. */
5903 {
5907 }
5909 {
5913 scope);
5918 }
5921 /* If the name is of the form "X::~X" it's OK even if X is a
5922 typedef. */
5931 {
5934 }
5936 /* ~auto means the destructor of whatever the object is. */
5938 {
5941 "%<~auto%> only available with "
5945 }
5947 /* If there was an explicit qualification (S::~T), first look
5948 in the scope given by the qualification (i.e., S).
5950 Note: in the calls to cp_parser_class_name below we pass
5951 typename_type so that lookup finds the injected-class-name
5952 rather than the constructor. */
5956 {
5961 typename_type,
5964 declarator_p);
5967 }
5968 /* In "N::S::~S", look in "N" as well. */
5970 {
5975 type_decl
5979 typename_type,
5982 declarator_p);
5985 }
5986 /* In "p->S::~T", look in the scope given by "*p" as well. */
5988 {
5993 type_decl
5997 typename_type,
6000 declarator_p);
6003 }
6004 /* Look in the surrounding context. */
6006 {
6012 type_decl
6016 typename_type,
6019 declarator_p);
6022 {
6023 /* We couldn't find a type with this name. If we're parsing
6024 tentatively, fail and try something else. */
6026 {
6029 }
6030 /* Otherwise, accept it and check for a match at instantiation
6031 time. */
6036 }
6037 }
6038 /* If an error occurred, assume that the name of the
6039 destructor is the same as the name of the qualifying
6040 class. That allows us to keep parsing after running
6041 into ill-formed destructor names. */
6047 /* Check that destructor name and scope match. */
6049 {
6056 }
6058 /* [class.dtor]
6060 A typedef-name that names a class shall not be used as the
6061 identifier in the declarator for a destructor declaration. */
6068 type_decl);
6071 }
6075 {
6076 cp_expr id;
6078 /* This could be a template-id, so we try that first. */
6080 /* Try a template-id. */
6083 none_type,
6084 declarator_p);
6085 /* If that worked, we're done. */
6088 /* We still don't know whether we're looking at an
6089 operator-function-id or a conversion-function-id. */
6091 /* Try an operator-function-id. */
6093 /* If that didn't work, try a conversion-function-id. */
6097 {
6098 /* 17.6.3.3.5 */
6103 "literal operator suffixes not preceded by %<_%>"
6105 }
6108 }
6109 /* Fall through. */
6116 }
6117 }
6119 /* Parse an (optional) nested-name-specifier.
6121 nested-name-specifier: [C++98]
6122 class-or-namespace-name :: nested-name-specifier [opt]
6123 class-or-namespace-name :: template nested-name-specifier [opt]
6125 nested-name-specifier: [C++0x]
6126 type-name ::
6127 namespace-name ::
6128 nested-name-specifier identifier ::
6129 nested-name-specifier template [opt] simple-template-id ::
6131 PARSER->SCOPE should be set appropriately before this function is
6132 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6133 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6134 in name lookups.
6136 Sets PARSER->SCOPE to the class (TYPE) or namespace
6137 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6138 it unchanged if there is no nested-name-specifier. Returns the new
6139 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6141 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6142 part of a declaration and/or decl-specifier. */
6144 static tree
6151 {
6156 /* Remember where the nested-name-specifier starts. */
6158 {
6161 }
6164 {
6165 tree new_scope;
6166 tree old_scope;
6167 tree saved_qualifying_scope;
6169 /* Spot cases that cannot be the beginning of a
6170 nested-name-specifier. */
6173 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6174 the already parsed nested-name-specifier. */
6176 {
6177 /* Grab the nested-name-specifier and continue the loop. */
6179 /* If we originally encountered this nested-name-specifier
6180 with IS_DECLARATION set to false, we will not have
6181 resolved TYPENAME_TYPEs, so we must do so here. */
6184 {
6189 }
6192 }
6194 /* Spot cases that cannot be the beginning of a
6195 nested-name-specifier. On the second and subsequent times
6196 through the loop, we look for the `template' keyword. */
6198 ;
6199 /* A template-id can start a nested-name-specifier. */
6201 ;
6202 /* DR 743: decltype can be used in a nested-name-specifier. */
6204 ;
6205 else
6206 {
6207 /* If the next token is not an identifier, then it is
6208 definitely not a type-name or namespace-name. */
6211 /* If the following token is neither a `<' (to begin a
6212 template-id), nor a `::', then we are not looking at a
6213 nested-name-specifier. */
6219 {
6223 "found %<:%> in nested-name-specifier, "
6226 }
6229 && !cp_parser_nth_token_starts_template_argument_list_p
6232 }
6234 /* The nested-name-specifier is optional, so we parse
6235 tentatively. */
6238 /* Look for the optional `template' keyword, if this isn't the
6239 first time through the loop. */
6243 /* Save the old scope since the name lookup we are about to do
6244 might destroy it. */
6247 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6248 look up names in "X<T>::I" in order to determine that "Y" is
6249 a template. So, if we have a typename at this point, we make
6250 an effort to look through it. */
6252 && !typename_keyword_p
6257 /* Parse the qualifying entity. */
6258 new_scope
6260 typename_keyword_p,
6261 template_keyword_p,
6262 check_dependency_p,
6263 type_p,
6264 is_declaration);
6265 /* Look for the `::' token. */
6268 /* If we found what we wanted, we keep going; otherwise, we're
6269 done. */
6271 {
6274 /* Restore the OLD_SCOPE since it was valid before the
6275 failed attempt at finding the last
6276 class-or-namespace-name. */
6280 /* If the next token is a decltype, and the one after that is a
6281 `::', then the decltype has failed to resolve to a class or
6282 enumeration type. Give this error even when parsing
6283 tentatively since it can't possibly be valid--and we're going
6284 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6285 won't get another chance.*/
6289 {
6296 /* As below. */
6299 }
6303 {
6304 /* If we have a non-type template-id followed by ::, it can't
6305 possibly be valid. */
6310 {
6313 {
6319 }
6320 else
6321 {
6322 /* Variable template. */
6327 }
6334 /* As below. */
6338 }
6339 }
6343 /* If the next token is an identifier, and the one after
6344 that is a `::', then any valid interpretation would have
6345 found a class-or-namespace-name. */
6351 {
6354 {
6356 {
6357 tree decl;
6358 tree ambiguous_decls;
6361 none_type,
6370 decl);
6372 {
6373 // cp_parser_lookup_name has the same diagnostic,
6374 // thus make sure to emit it at most once.
6377 {
6382 }
6384 }
6385 else
6386 {
6388 cp_parser_name_lookup_error
6391 else
6392 cp_parser_name_lookup_error
6395 }
6396 }
6399 /* Treat this as a successful nested-name-specifier
6400 due to:
6402 [basic.lookup.qual]
6404 If the name found is not a class-name (clause
6405 _class_) or namespace-name (_namespace.def_), the
6406 program is ill-formed. */
6408 }
6410 }
6412 }
6413 /* We've found one valid nested-name-specifier. */
6415 /* Name lookup always gives us a DECL. */
6418 /* Uses of "template" must be followed by actual templates. */
6430 new_scope);
6431 /* If it is a class scope, try to complete it; we are about to
6432 be looking up names inside the class. */
6434 /* Since checking types for dependency can be expensive,
6435 avoid doing it if the type is already complete. */
6437 /* Do not try to complete dependent types. */
6439 {
6441 /* If it is a typedef to current class, use the current
6442 class instead, as the typedef won't have any names inside
6443 it yet. */
6447 }
6448 /* Make sure we look in the right scope the next time through
6449 the loop. */
6451 }
6453 /* If parsing tentatively, replace the sequence of tokens that makes
6454 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6455 token. That way, should we re-parse the token stream, we will
6456 not have to repeat the effort required to do the parse, nor will
6457 we issue duplicate error messages. */
6459 {
6463 /* Reset the contents of the START token. */
6465 /* Retrieve any deferred checks. Do not pop this access checks yet
6466 so the memory will not be reclaimed during token replacing below. */
6474 /* Purge all subsequent tokens. */
6476 }
6482 }
6484 /* Parse a nested-name-specifier. See
6485 cp_parser_nested_name_specifier_opt for details. This function
6486 behaves identically, except that it will an issue an error if no
6487 nested-name-specifier is present. */
6489 static tree
6495 {
6496 tree scope;
6498 /* Look for the nested-name-specifier. */
6500 typename_keyword_p,
6501 check_dependency_p,
6502 type_p,
6503 is_declaration);
6504 /* If it was not present, issue an error message. */
6506 {
6509 }
6512 }
6514 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6515 this is either a class-name or a namespace-name (which corresponds
6516 to the class-or-namespace-name production in the grammar). For
6517 C++0x, it can also be a type-name that refers to an enumeration
6518 type or a simple-template-id.
6520 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6521 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6522 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6523 TYPE_P is TRUE iff the next name should be taken as a class-name,
6524 even the same name is declared to be another entity in the same
6525 scope.
6527 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6528 specified by the class-or-namespace-name. If neither is found the
6529 ERROR_MARK_NODE is returned. */
6531 static tree
6538 {
6539 tree saved_scope;
6540 tree saved_qualifying_scope;
6541 tree saved_object_scope;
6542 tree scope;
6546 /* DR 743: decltype can appear in a nested-name-specifier. */
6548 {
6552 {
6555 }
6559 }
6561 /* Before we try to parse the class-name, we must save away the
6562 current PARSER->SCOPE since cp_parser_class_name will destroy
6563 it. */
6567 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6568 there is no need to look for a namespace-name. */
6569 only_class_p = template_keyword_p
6574 typename_keyword_p,
6575 template_keyword_p,
6577 check_dependency_p,
6579 is_declaration,
6582 /* If that didn't work, try for a namespace-name. */
6584 {
6585 /* Restore the saved scope. */
6589 /* If we are not looking at an identifier followed by the scope
6590 resolution operator, then this is not part of a
6591 nested-name-specifier. (Note that this function is only used
6592 to parse the components of a nested-name-specifier.) */
6597 }
6600 }
6602 /* Return true if we are looking at a compound-literal, false otherwise. */
6604 static bool
6606 {
6609 /* Skip tokens until the next token is a closing parenthesis.
6610 If we find the closing `)', and the next token is a `{', then
6611 we are looking at a compound-literal. */
6612 bool compound_literal_p
6617 /* Roll back the tokens we skipped. */
6621 }
6623 /* Parse a postfix-expression.
6625 postfix-expression:
6626 primary-expression
6627 postfix-expression [ expression ]
6628 postfix-expression ( expression-list [opt] )
6629 simple-type-specifier ( expression-list [opt] )
6630 typename :: [opt] nested-name-specifier identifier
6631 ( expression-list [opt] )
6632 typename :: [opt] nested-name-specifier template [opt] template-id
6633 ( expression-list [opt] )
6634 postfix-expression . template [opt] id-expression
6635 postfix-expression -> template [opt] id-expression
6636 postfix-expression . pseudo-destructor-name
6637 postfix-expression -> pseudo-destructor-name
6638 postfix-expression ++
6639 postfix-expression --
6640 dynamic_cast < type-id > ( expression )
6641 static_cast < type-id > ( expression )
6642 reinterpret_cast < type-id > ( expression )
6643 const_cast < type-id > ( expression )
6644 typeid ( expression )
6645 typeid ( type-id )
6647 GNU Extension:
6649 postfix-expression:
6650 ( type-id ) { initializer-list , [opt] }
6652 This extension is a GNU version of the C99 compound-literal
6653 construct. (The C99 grammar uses `type-name' instead of `type-id',
6654 but they are essentially the same concept.)
6656 If ADDRESS_P is true, the postfix expression is the operand of the
6657 `&' operator. CAST_P is true if this expression is the target of a
6658 cast.
6660 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6661 class member access expressions [expr.ref].
6663 Returns a representation of the expression. */
6665 static cp_expr
6669 {
6671 location_t loc;
6677 /* Peek at the next token. */
6682 /* Some of the productions are determined by keywords. */
6685 {
6690 {
6691 tree type;
6692 cp_expr expression;
6696 /* All of these can be handled in the same way from the point
6697 of view of parsing. Begin by consuming the token
6698 identifying the cast. */
6701 /* New types cannot be defined in the cast. */
6703 parser->type_definition_forbidden_message
6706 /* Look for the opening `<'. */
6708 /* Parse the type to which we are casting. */
6713 /* Look for the closing `>'. */
6715 /* Restore the old message. */
6718 bool saved_greater_than_is_operator_p
6722 /* And the expression which is being cast. */
6723 matching_parens parens;
6727 RT_CLOSE_PAREN);
6731 parser->greater_than_is_operator_p
6734 /* Only type conversions to integral or enumeration types
6735 can be used in constant-expressions. */
6738 {
6741 }
6744 {
6746 postfix_expression
6750 postfix_expression
6754 postfix_expression
6756 tf_warning_or_error);
6759 postfix_expression
6764 }
6766 /* Construct a location e.g. :
6767 reinterpret_cast <int *> (expr)
6768 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6769 ranging from the start of the "*_cast" token to the final closing
6770 paren, with the caret at the start. */
6773 }
6777 {
6778 tree type;
6782 /* Consume the `typeid' token. */
6784 /* Look for the `(' token. */
6785 matching_parens parens;
6787 /* Types cannot be defined in a `typeid' expression. */
6789 parser->type_definition_forbidden_message
6791 /* We can't be sure yet whether we're looking at a type-id or an
6792 expression. */
6794 /* Try a type-id first. */
6799 /* Look for the `)' token. Otherwise, we can't be sure that
6800 we're not looking at an expression: consider `typeid (int
6801 (3))', for example. */
6803 /* If all went well, simply lookup the type-id. */
6806 /* Otherwise, fall back to the expression variant. */
6807 else
6808 {
6809 tree expression;
6811 /* Look for an expression. */
6813 /* Compute its typeid. */
6815 /* Look for the `)' token. */
6817 }
6818 /* Restore the saved message. */
6820 /* `typeid' may not appear in an integral constant expression. */
6824 /* Construct a location e.g. :
6825 typeid (expr)
6826 ^~~~~~~~~~~~~
6827 ranging from the start of the "typeid" token to the final closing
6828 paren, with the caret at the start. */
6830 {
6831 location_t typeid_loc
6834 }
6835 }
6839 {
6840 tree type;
6841 /* The syntax permitted here is the same permitted for an
6842 elaborated-type-specifier. */
6849 }
6855 {
6858 tree p;
6865 {
6868 }
6874 {
6877 postfix_expression
6879 else
6880 {
6884 }
6890 tf_warning_or_error);
6891 else
6892 {
6896 }
6901 postfix_expression
6905 postfix_expression
6908 else
6909 {
6913 }
6918 }
6920 }
6923 {
6924 tree type;
6926 /* If the next thing is a simple-type-specifier, we may be
6927 looking at a functional cast. We could also be looking at
6928 an id-expression. So, we try the functional cast, and if
6929 that doesn't work we fall back to the primary-expression. */
6931 /* Look for the simple-type-specifier. */
6935 CP_PARSER_FLAGS_NONE);
6937 /* Parse the cast itself. */
6939 postfix_expression
6941 /* If that worked, we're done. */
6945 /* If the functional-cast didn't work out, try a
6946 compound-literal. */
6949 {
6954 matching_parens parens;
6957 /* Avoid calling cp_parser_type_id pointlessly, see comment
6958 in cp_parser_cast_expression about c++/29234. */
6961 else
6962 {
6963 /* Parse the type. */
6969 }
6971 /* If things aren't going well, there's no need to
6972 keep going. */
6974 {
6976 /* Parse the brace-enclosed initializer list. */
6979 }
6980 /* If that worked, we're definitely looking at a
6981 compound-literal expression. */
6983 {
6984 /* Warn the user that a compound literal is not
6985 allowed in standard C++. */
6988 /* For simplicity, we disallow compound literals in
6989 constant-expressions. We could
6990 allow compound literals of integer type, whose
6991 initializer was a constant, in constant
6992 expressions. Permitting that usage, as a further
6993 extension, would not change the meaning of any
6994 currently accepted programs. (Of course, as
6995 compound literals are not part of ISO C++, the
6996 standard has nothing to say.) */
6998 NIC_NCC))
6999 {
7002 }
7003 /* Form the representation of the compound-literal. */
7004 postfix_expression
7009 }
7010 }
7012 /* It must be a primary-expression. */
7013 postfix_expression
7016 decltype_p,
7018 }
7020 }
7022 /* Note that we don't need to worry about calling build_cplus_new on a
7023 class-valued CALL_EXPR in decltype when it isn't the end of the
7024 postfix-expression; unary_complex_lvalue will take care of that for
7025 all these cases. */
7027 /* Keep looping until the postfix-expression is complete. */
7029 {
7033 /* It is not a Koenig lookup function call. */
7034 postfix_expression
7037 /* Peek at the next token. */
7041 {
7044 {
7046 "two consecutive %<[%> shall "
7049 }
7050 postfix_expression
7052 postfix_expression,
7054 decltype_p);
7063 /* postfix-expression ( expression-list [opt] ) */
7064 {
7075 is_builtin_constant_p
7078 {
7079 /* The whole point of __builtin_constant_p is to allow
7080 non-constant expressions to appear as arguments. */
7081 saved_integral_constant_expression_p
7083 saved_non_integral_constant_expression_p
7086 }
7087 args = (cp_parser_parenthesized_expression_list
7093 {
7094 parser->integral_constant_expression_p
7096 parser->non_integral_constant_expression_p
7098 }
7101 {
7104 }
7106 /* Function calls are not permitted in
7107 constant-expressions. */
7110 NIC_FUNC_CALL))
7111 {
7115 }
7120 {
7122 {
7124 {
7127 postfix_expression
7129 complain);
7130 }
7131 else
7132 postfix_expression
7134 }
7135 /* We do not perform argument-dependent lookup if
7136 normal lookup finds a non-function, in accordance
7137 with the expected resolution of DR 218. */
7140 {
7144 /* Do not do argument dependent lookup if regular
7145 lookup finds a member function or a block-scope
7146 function declaration. [basic.lookup.argdep]/3 */
7149 {
7152 postfix_expression
7154 complain);
7155 }
7156 }
7157 }
7163 {
7172 }
7175 {
7185 {
7187 postfix_expression
7191 }
7194 {
7195 postfix_expression
7196 = (build_new_method_call
7202 complain));
7203 }
7204 else
7205 postfix_expression
7209 complain);
7210 }
7214 postfix_expression = (build_offset_ref_call_from_tree
7216 complain));
7218 /* A call to a static class member, or a namespace-scope
7219 function. */
7220 postfix_expression
7223 koenig_p,
7224 complain);
7225 else
7226 /* All other function calls. */
7227 postfix_expression
7230 koenig_p,
7231 complain);
7234 {
7236 start_loc,
7237 close_paren_loc);
7239 }
7241 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7245 }
7250 /* postfix-expression . template [opt] id-expression
7251 postfix-expression . pseudo-destructor-name
7252 postfix-expression -> template [opt] id-expression
7253 postfix-expression -> pseudo-destructor-name */
7255 /* Consume the `.' or `->' operator. */
7258 postfix_expression
7260 postfix_expression,
7267 /* postfix-expression ++ */
7268 /* Consume the `++' token. */
7270 /* Generate a representation for the complete expression. */
7271 postfix_expression
7273 POSTINCREMENT_EXPR);
7274 /* Increments may not appear in constant-expressions. */
7282 /* postfix-expression -- */
7283 /* Consume the `--' token. */
7285 /* Generate a representation for the complete expression. */
7286 postfix_expression
7288 POSTDECREMENT_EXPR);
7289 /* Decrements may not appear in constant-expressions. */
7300 return is_member_access
7301 ? postfix_expression
7303 else
7305 }
7306 }
7308 /* We should never get here. */
7311 }
7313 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7314 by cp_parser_builtin_offsetof. We're looking for
7316 postfix-expression [ expression ]
7317 postfix-expression [ braced-init-list ] (C++11)
7319 FOR_OFFSETOF is set if we're being called in that context, which
7320 changes how we deal with integer constant expressions. */
7322 static tree
7324 tree postfix_expression,
7327 {
7332 /* Consume the `[' token. */
7338 /* Parse the index expression. */
7339 /* ??? For offsetof, there is a question of what to allow here. If
7340 offsetof is not being used in an integral constant expression context,
7341 then we *could* get the right answer by computing the value at runtime.
7342 If we are in an integral constant expression context, then we might
7343 could accept any constant expression; hard to say without analysis.
7344 Rather than open the barn door too wide right away, allow only integer
7345 constant expressions here. */
7348 else
7349 {
7351 {
7356 }
7357 else
7359 }
7363 /* Look for the closing `]'. */
7366 /* Build the ARRAY_REF. */
7370 /* When not doing offsetof, array references are not permitted in
7371 constant-expressions. */
7377 }
7379 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7380 by cp_parser_builtin_offsetof. We're looking for
7382 postfix-expression . template [opt] id-expression
7383 postfix-expression . pseudo-destructor-name
7384 postfix-expression -> template [opt] id-expression
7385 postfix-expression -> pseudo-destructor-name
7387 FOR_OFFSETOF is set if we're being called in that context. That sorta
7388 limits what of the above we'll actually accept, but nevermind.
7389 TOKEN_TYPE is the "." or "->" token, which will already have been
7390 removed from the stream. */
7392 static tree
7395 cp_expr postfix_expression,
7397 location_t location)
7398 {
7399 tree name;
7405 /* If this is a `->' operator, dereference the pointer. */
7408 tf_warning_or_error);
7409 /* Check to see whether or not the expression is type-dependent and
7410 not the current instantiation. */
7412 /* The identifier following the `->' or `.' is not qualified. */
7418 /* Enter the scope corresponding to the type of the object
7419 given by the POSTFIX_EXPRESSION. */
7421 {
7423 /* According to the standard, no expression should ever have
7424 reference type. Unfortunately, we do not currently match
7425 the standard in this respect in that our internal representation
7426 of an expression may have reference type even when the standard
7427 says it does not. Therefore, we have to manually obtain the
7428 underlying type here. */
7430 /* The type of the POSTFIX_EXPRESSION must be complete. */
7431 /* Unlike the object expression in other contexts, *this is not
7432 required to be of complete type for purposes of class member
7433 access (5.2.5) outside the member function body. */
7436 && !(processing_template_decl
7437 && current_class_type
7438 && (same_type_ignoring_top_level_qualifiers_p
7440 {
7443 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7445 {
7446 /* In a template, be permissive by treating an object expression
7447 of incomplete type as dependent (after a pedwarn). */
7448 diagnostic_t kind = (processing_template_decl
7450 ? DK_PEDWARN
7452 cxx_incomplete_type_diagnostic
7458 {
7461 }
7462 }
7463 }
7466 {
7467 /* Let the name lookup machinery know that we are processing a
7468 class member access expression. */
7470 /* If something went wrong, we want to be able to discern that case,
7471 as opposed to the case where there was no SCOPE due to the type
7472 of expression being dependent. */
7475 /* If the SCOPE was erroneous, make the various semantic analysis
7476 functions exit quickly -- and without issuing additional error
7477 messages. */
7480 }
7481 }
7484 /* Tell cp_parser_lookup_name that there was an object, even though it's
7485 type-dependent. */
7488 /* Assume this expression is not a pseudo-destructor access. */
7491 /* If the SCOPE is a scalar type, then, if this is a valid program,
7492 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7493 is type dependent, it can be pseudo-destructor-name or something else.
7494 Try to parse it as pseudo-destructor-name first. */
7496 {
7497 tree s;
7498 tree type;
7501 /* Parse the pseudo-destructor-name. */
7510 {
7512 postfix_expression
7515 }
7516 }
7519 {
7520 /* If the SCOPE is not a scalar type, we are looking at an
7521 ordinary class member access expression, rather than a
7522 pseudo-destructor-name. */
7525 /* Parse the id-expression. */
7526 name = (cp_parser_id_expression
7533 /* In general, build a SCOPE_REF if the member name is qualified.
7534 However, if the name was not dependent and has already been
7535 resolved; there is no need to build the SCOPE_REF. For example;
7537 struct X { void f(); };
7538 template <typename T> void f(T* t) { t->X::f(); }
7540 Even though "t" is dependent, "X::f" is not and has been resolved
7541 to a BASELINK; there is no need to include scope information. */
7543 /* But we do need to remember that there was an explicit scope for
7544 virtual function calls. */
7548 /* If the name is a template-id that names a type, we will get a
7549 TYPE_DECL here. That is invalid code. */
7551 {
7554 }
7555 else
7556 {
7558 {
7560 {
7564 }
7565 else
7568 name,
7569 template_p);
7573 }
7575 adjust_result_of_qualified_name_lookup
7577 postfix_expression
7579 template_p,
7580 tf_warning_or_error);
7581 /* Build a location e.g.:
7582 ptr->access_expr
7583 ~~~^~~~~~~~~~~~~
7584 where the caret is at the deref token, ranging from
7585 the start of postfix_expression to the end of the access expr. */
7586 location_t end_loc
7588 location_t combined_loc
7591 }
7592 }
7594 /* We no longer need to look up names in the scope of the object on
7595 the left-hand side of the `.' or `->' operator. */
7598 /* Outside of offsetof, these operators may not appear in
7599 constant-expressions. */
7601 && (cp_parser_non_integral_constant_expression
7606 }
7608 /* Parse a parenthesized expression-list.
7610 expression-list:
7611 assignment-expression
7612 expression-list, assignment-expression
7614 attribute-list:
7615 expression-list
7616 identifier
7617 identifier, expression-list
7619 CAST_P is true if this expression is the target of a cast.
7621 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7622 argument pack.
7624 Returns a vector of trees. Each element is a representation of an
7625 assignment-expression. NULL is returned if the ( and or ) are
7626 missing. An empty, but allocated, vector is returned on no
7627 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7628 if we are parsing an attribute list for an attribute that wants a
7629 plain identifier argument, normal_attr for an attribute that wants
7630 an expression, or non_attr if we aren't parsing an attribute list. If
7631 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7632 not all of the expressions in the list were constant.
7633 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7634 will be written to with the location of the closing parenthesis. If
7635 an error occurs, it may or may not be written to. */
7644 {
7650 /* Assume all the expressions will be constant. */
7654 matching_parens parens;
7660 /* Within a parenthesized expression, a `>' token is always
7661 the greater-than operator. */
7662 saved_greater_than_is_operator_p
7666 /* Consume expressions until there are no more. */
7669 {
7670 tree expr;
7672 /* At the beginning of attribute lists, check to see if the
7673 next token is an identifier. */
7676 {
7679 /* Consume the identifier. */
7681 /* Save the identifier. */
7683 }
7684 else
7685 {
7688 /* Parse the next assignment-expression. */
7690 {
7691 /* A braced-init-list. */
7697 }
7699 {
7700 expr = (cp_parser_constant_expression
7705 }
7706 else
7708 cast_p);
7713 /* If we have an ellipsis, then this is an expression
7714 expansion. */
7717 {
7718 /* Consume the `...'. */
7721 /* Build the argument pack. */
7723 }
7725 /* Add it to the list. We add error_mark_node
7726 expressions to the list, so that we can still tell if
7727 the correct form for a parenthesized expression-list
7728 is found. That gives better errors. */
7733 }
7735 /* After the first item, attribute lists look the same as
7736 expression lists. */
7739 get_comma:;
7740 /* If the next token isn't a `,', then we are done. */
7744 /* Otherwise, consume the `,' and keep going. */
7746 }
7752 {
7755 skip_comma:;
7756 /* We try and resync to an unnested comma, as that will give the
7757 user better diagnostics. */
7765 {
7766 parser->greater_than_is_operator_p
7769 }
7770 }
7772 parser->greater_than_is_operator_p
7779 }
7781 /* Parse a pseudo-destructor-name.
7783 pseudo-destructor-name:
7784 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7785 :: [opt] nested-name-specifier template template-id :: ~ type-name
7786 :: [opt] nested-name-specifier [opt] ~ type-name
7788 If either of the first two productions is used, sets *SCOPE to the
7789 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7790 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7791 or ERROR_MARK_NODE if the parse fails. */
7793 static void
7795 tree object,
7798 {
7801 /* Handle ~auto. */
7805 {
7808 "%<~auto%> only available with "
7815 }
7817 /* Assume that things will not work out. */
7820 /* Look for the optional `::' operator. */
7822 /* Look for the optional nested-name-specifier. */
7823 nested_name_specifier_p
7830 /* Now, if we saw a nested-name-specifier, we might be doing the
7831 second production. */
7834 {
7835 /* Consume the `template' keyword. */
7837 /* Parse the template-id. */
7841 class_type,
7843 /* Look for the `::' token. */
7845 }
7846 /* If the next token is not a `~', then there might be some
7847 additional qualification. */
7849 {
7850 /* At this point, we're looking for "type-name :: ~". The type-name
7851 must not be a class-name, since this is a pseudo-destructor. So,
7852 it must be either an enum-name, or a typedef-name -- both of which
7853 are just identifiers. So, we peek ahead to check that the "::"
7854 and "~" tokens are present; if they are not, then we can avoid
7855 calling type_name. */
7859 {
7862 }
7864 /* Look for the type-name. */
7869 /* Look for the `::' token. */
7871 }
7872 else
7875 /* Look for the `~'. */
7878 /* Once we see the ~, this has to be a pseudo-destructor. */
7882 /* Look for the type-name again. We are not responsible for
7883 checking that it matches the first type-name. */
7885 }
7887 /* Parse a unary-expression.
7889 unary-expression:
7890 postfix-expression
7891 ++ cast-expression
7892 -- cast-expression
7893 unary-operator cast-expression
7894 sizeof unary-expression
7895 sizeof ( type-id )
7896 alignof ( type-id ) [C++0x]
7897 new-expression
7898 delete-expression
7900 GNU Extensions:
7902 unary-expression:
7903 __extension__ cast-expression
7904 __alignof__ unary-expression
7905 __alignof__ ( type-id )
7906 alignof unary-expression [C++0x]
7907 __real__ cast-expression
7908 __imag__ cast-expression
7909 && identifier
7910 sizeof ( type-id ) { initializer-list , [opt] }
7911 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7912 __alignof__ ( type-id ) { initializer-list , [opt] }
7914 ADDRESS_P is true iff the unary-expression is appearing as the
7915 operand of the `&' operator. CAST_P is true if this expression is
7916 the target of a cast.
7918 Returns a representation of the expression. */
7920 static cp_expr
7923 {
7927 /* Peek at the next token. */
7929 /* Some keywords give away the kind of expression. */
7931 {
7935 {
7938 {
7944 /* Consume the token. */
7946 /* Parse the operand. */
7951 else
7952 {
7953 /* ISO C++ defines alignof only with types, not with
7954 expressions. So pedwarn if alignof is used with a non-
7955 type expression. However, __alignof__ is ok. */
7958 "ISO C++ does not allow %<alignof%> "
7962 }
7963 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7964 SIZEOF_EXPR with the original operand. */
7966 {
7968 {
7970 {
7973 error_mark_node));
7975 }
7976 else
7980 }
7981 }
7983 /* Construct a location e.g. :
7984 alignof (expr)
7985 ^~~~~~~~~~~~~~
7986 with start == caret at the start of the "alignof"/"sizeof"
7987 token, with the endpoint at the final closing paren. */
7988 location_t finish_loc
7990 location_t compound_loc
7996 }
8005 {
8006 /* The saved value of the PEDANTIC flag. */
8008 tree expr;
8010 /* Save away the PEDANTIC flag. */
8012 /* Parse the cast-expression. */
8014 /* Restore the PEDANTIC flag. */
8018 }
8022 {
8023 tree expression;
8025 /* Consume the `__real__' or `__imag__' token. */
8027 /* Parse the cast-expression. */
8029 /* Create the complete representation. */
8033 expression,
8034 tf_warning_or_error);
8035 }
8043 {
8044 tree expr;
8053 matching_parens parens;
8057 parser->type_definition_forbidden_message
8060 saved_integral_constant_expression_p
8062 saved_non_integral_constant_expression_p
8066 saved_greater_than_is_operator_p
8078 parser->greater_than_is_operator_p
8081 parser->integral_constant_expression_p
8083 parser->non_integral_constant_expression_p
8088 location_t finish_loc
8092 /* Construct a location of the form:
8093 noexcept (expr)
8094 ^~~~~~~~~~~~~~~
8095 with start == caret, finishing at the close-paren. */
8096 location_t noexcept_loc
8100 noexcept_loc);
8101 }
8105 }
8106 }
8108 /* Look for the `:: new' and `:: delete', which also signal the
8109 beginning of a new-expression, or delete-expression,
8110 respectively. If the next token is `::', then it might be one of
8111 these. */
8113 {
8116 /* See if the token after the `::' is one of the keywords in
8117 which we're interested. */
8119 /* If it's `new', we have a new-expression. */
8122 /* Similarly, for `delete'. */
8125 }
8127 /* Look for a unary operator. */
8129 /* The `++' and `--' operators can be handled similarly, even though
8130 they are not technically unary-operators in the grammar. */
8132 {
8137 /* Handle the GNU address-of-label extension. */
8140 {
8141 tree identifier;
8142 tree expression;
8145 /* Consume the '&&' token. */
8147 /* Look for the identifier. */
8148 location_t finish_loc
8151 /* Construct a location of the form:
8152 &&label
8153 ^~~~~~~
8154 with caret==start at the "&&", finish at the end of the label. */
8155 location_t combined_loc
8157 /* Create an expression representing the address. */
8160 NIC_ADDR_LABEL))
8163 }
8164 }
8166 {
8167 cp_expr cast_expression;
8173 /* Consume the operator token. */
8177 /* Parse the cast-expression. */
8178 cast_expression
8183 pidk);
8185 /* Make a location:
8186 OP_TOKEN CAST_EXPRESSION
8187 ^~~~~~~~~~~~~~~~~~~~~~~~~
8188 with start==caret at the operator token, and
8189 extending to the end of the cast_expression. */
8192 /* Now, build an appropriate representation. */
8194 {
8198 RO_UNARY_STAR,
8199 complain);
8200 /* TODO: build_x_indirect_ref does not always honor the
8201 location, so ensure it is set. */
8207 /* Fall through. */
8210 cast_expression,
8211 complain);
8212 /* TODO: build_x_unary_op does not always honor the location,
8213 so ensure it is set. */
8221 /* Fall through. */
8223 /* Immediately fold negation of a constant, unless the constant is 0
8224 (since -0 == 0) or it would overflow. */
8229 {
8232 cast_expression);
8234 {
8237 }
8238 }
8239 /* Fall through. */
8248 }
8252 non_constant_p))
8256 }
8260 decltype_p,
8261 pidk);
8262 }
8264 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8265 unary-operator, the corresponding tree code is returned. */
8267 static enum tree_code
8269 {
8271 {
8292 }
8293 }
8295 /* Parse a new-expression.
8297 new-expression:
8298 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8299 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8301 Returns a representation of the expression. */
8303 static tree
8305 {
8308 tree type;
8311 tree ret;
8315 /* Look for the optional `::' operator. */
8316 global_scope_p
8320 /* Look for the `new' operator. */
8322 /* There's no easy way to tell a new-placement from the
8323 `( type-id )' construct. */
8325 /* Look for a new-placement. */
8327 /* If that didn't work out, there's no new-placement. */
8329 {
8333 }
8335 /* If the next token is a `(', then we have a parenthesized
8336 type-id. */
8338 {
8342 /* Consume the `('. */
8343 matching_parens parens;
8346 /* Parse the type-id. */
8347 parser->type_definition_forbidden_message
8349 {
8352 }
8355 /* Look for the closing `)'. */
8358 /* There should not be a direct-new-declarator in this production,
8359 but GCC used to allowed this, so we check and emit a sensible error
8360 message for this case. */
8362 {
8368 }
8369 }
8370 /* Otherwise, there must be a new-type-id. */
8371 else
8374 /* If the next token is a `(' or '{', then we have a new-initializer. */
8379 else
8382 /* A new-expression may not appear in an integral constant
8383 expression. */
8386 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8387 of a new-type-id or type-id of a new-expression, the new-expression shall
8388 contain a new-initializer of the form ( assignment-expression )".
8389 Additionally, consistently with the spirit of DR 1467, we want to accept
8390 'new auto { 2 }' too. */
8396 {
8398 "initialization of new-expression for type %<auto%> "
8401 }
8402 else
8403 {
8404 /* Construct a location e.g.:
8405 ptr = new int[100]
8406 ^~~~~~~~~~~~
8407 with caret == start at the start of the "new" token, and the end
8408 at the end of the final token we consumed. */
8413 /* Create a representation of the new-expression. */
8415 tf_warning_or_error);
8417 }
8425 }
8427 /* Parse a new-placement.
8429 new-placement:
8430 ( expression-list )
8432 Returns the same representation as for an expression-list. */
8436 {
8439 /* Parse the expression-list. */
8440 expression_list = (cp_parser_parenthesized_expression_list
8449 }
8451 /* Parse a new-type-id.
8453 new-type-id:
8454 type-specifier-seq new-declarator [opt]
8456 Returns the TYPE allocated. If the new-type-id indicates an array
8457 type, *NELTS is set to the number of elements in the last array
8458 bound; the TYPE will not include the last array bound. */
8460 static tree
8462 {
8463 cp_decl_specifier_seq type_specifier_seq;
8469 /* The type-specifier sequence must not contain type definitions.
8470 (It cannot contain declarations of new types either, but if they
8471 are not definitions we will catch that because they are not
8472 complete.) */
8474 parser->type_definition_forbidden_message
8476 /* Parse the type-specifier-seq. */
8480 /* Restore the old message. */
8486 /* Parse the new-declarator. */
8489 /* Determine the number of elements in the last array dimension, if
8490 any. */
8492 /* Skip down to the last array dimension. */
8497 {
8500 }
8505 {
8508 }
8511 {
8518 else
8520 }
8523 }
8525 /* Parse an (optional) new-declarator.
8527 new-declarator:
8528 ptr-operator new-declarator [opt]
8529 direct-new-declarator
8531 Returns the declarator. */
8535 {
8538 cp_cv_quals cv_quals;
8540 /* We don't know if there's a ptr-operator next, or not. */
8542 /* Look for a ptr-operator. */
8544 /* If that worked, look for more new-declarators. */
8546 {
8549 /* Parse another optional declarator. */
8552 declarator = cp_parser_make_indirect_declarator
8556 }
8558 /* If the next token is a `[', there is a direct-new-declarator. */
8563 }
8565 /* Parse a direct-new-declarator.
8567 direct-new-declarator:
8568 [ expression ]
8569 direct-new-declarator [constant-expression]
8571 */
8575 {
8579 {
8580 tree expression;
8583 /* Look for the opening `['. */
8588 /* The standard requires that the expression have integral
8589 type. DR 74 adds enumeration types. We believe that the
8590 real intent is that these expressions be handled like the
8591 expression in a `switch' condition, which also allows
8592 classes with a single conversion to integral or
8593 enumeration type. */
8595 {
8596 expression
8598 expression,
8601 {
8603 "expression in new-declarator must have integral "
8606 }
8607 }
8609 /* Look for the closing `]'. */
8612 /* Add this bound to the declarator. */
8615 /* If the next token is not a `[', then there are no more
8616 bounds. */
8619 }
8622 }
8624 /* Parse a new-initializer.
8626 new-initializer:
8627 ( expression-list [opt] )
8628 braced-init-list
8630 Returns a representation of the expression-list. */
8634 {
8638 {
8639 tree t;
8646 }
8647 else
8648 expression_list = (cp_parser_parenthesized_expression_list
8654 }
8656 /* Parse a delete-expression.
8658 delete-expression:
8659 :: [opt] delete cast-expression
8660 :: [opt] delete [ ] cast-expression
8662 Returns a representation of the expression. */
8664 static tree
8666 {
8669 tree expression;
8671 /* Look for the optional `::' operator. */
8672 global_scope_p
8676 /* Look for the `delete' keyword. */
8678 /* See if the array syntax is in use. */
8680 {
8681 /* Consume the `[' token. */
8683 /* Look for the `]' token. */
8685 /* Remember that this is the `[]' construct. */
8687 }
8688 else
8691 /* Parse the cast-expression. */
8694 /* A delete-expression may not appear in an integral constant
8695 expression. */
8700 tf_warning_or_error);
8701 }
8703 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8704 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8705 0 otherwise. */
8707 static int
8709 {
8712 {
8754 /* In ((type ()) () the last () isn't a valid cast-expression,
8755 so the whole must be parsed as postfix-expression. */
8760 /* '[' may start a primary-expression in obj-c++ and in C++11,
8761 as a lambda-expression, eg, '(void)[]{}'. */
8768 /* '++' and '--' may or may not start a cast-expression:
8770 struct T { void operator++(int); };
8771 void f() { (T())++; }
8773 vs
8775 int a;
8776 (int)++a; */
8781 }
8782 }
8784 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8785 in the order: const_cast, static_cast, reinterpret_cast.
8787 Don't suggest dynamic_cast.
8789 Return the first legal cast kind found, or NULL otherwise. */
8793 {
8794 tree trial;
8796 /* Reuse the parser logic by attempting to build the various kinds of
8797 cast, with "complain" disabled.
8798 Identify the first such cast that is valid. */
8800 /* Don't attempt to run such logic within template processing. */
8804 /* First try const_cast. */
8809 /* If that fails, try static_cast. */
8814 /* Finally, try reinterpret_cast. */
8819 /* No such cast possible. */
8821 }
8823 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8824 suggesting how to convert a C-style cast of the form:
8826 (DST_TYPE)ORIG_EXPR
8828 to a C++-style cast.
8830 The primary range of RICHLOC is asssumed to be that of the original
8831 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8832 of the parens in the C-style cast. */
8834 static void
8837 tree dst_type)
8838 {
8839 /* This function is non-trivial, so bail out now if the warning isn't
8840 going to be emitted. */
8844 /* Try to find a legal C++ cast, trying them in order:
8845 const_cast, static_cast, reinterpret_cast. */
8850 /* Replace the open paren with "CAST_SUGGESTION<". */
8851 pretty_printer pp;
8855 /* Replace the close paren with "> (". */
8858 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8860 }
8863 /* Parse a cast-expression.
8865 cast-expression:
8866 unary-expression
8867 ( type-id ) cast-expression
8869 ADDRESS_P is true iff the unary-expression is appearing as the
8870 operand of the `&' operator. CAST_P is true if this expression is
8871 the target of a cast.
8873 Returns a representation of the expression. */
8875 static cp_expr
8878 {
8879 /* If it's a `(', then we might be looking at a cast. */
8881 {
8887 /* There's no way to know yet whether or not this is a cast.
8888 For example, `(int (3))' is a unary-expression, while `(int)
8889 3' is a cast. So, we resort to parsing tentatively. */
8891 /* Types may not be defined in a cast. */
8893 parser->type_definition_forbidden_message
8895 /* Consume the `('. */
8896 matching_parens parens;
8901 /* A very tricky bit is that `(struct S) { 3 }' is a
8902 compound-literal (which we permit in C++ as an extension).
8903 But, that construct is not a cast-expression -- it is a
8904 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8905 is legal; if the compound-literal were a cast-expression,
8906 you'd need an extra set of parentheses.) But, if we parse
8907 the type-id, and it happens to be a class-specifier, then we
8908 will commit to the parse at that point, because we cannot
8909 undo the action that is done when creating a new class. So,
8910 then we cannot back up and do a postfix-expression.
8912 Another tricky case is the following (c++/29234):
8914 struct S { void operator () (); };
8916 void foo ()
8917 {
8918 ( S()() );
8919 }
8921 As a type-id we parse the parenthesized S()() as a function
8922 returning a function, groktypename complains and we cannot
8923 back up in this case either.
8925 Therefore, we scan ahead to the closing `)', and check to see
8926 if the tokens after the `)' can start a cast-expression. Otherwise
8927 we are dealing with an unary-expression, a postfix-expression
8928 or something else.
8930 Yet another tricky case, in C++11, is the following (c++/54891):
8932 (void)[]{};
8934 The issue is that usually, besides the case of lambda-expressions,
8935 the parenthesized type-id cannot be followed by '[', and, eg, we
8936 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8937 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8938 we don't commit, we try a cast-expression, then an unary-expression.
8940 Save tokens so that we can put them back. */
8943 /* We may be looking at a cast-expression. */
8946 cast_expression
8949 /* Roll back the tokens we skipped. */
8951 /* If we aren't looking at a cast-expression, simulate an error so
8952 that the call to cp_parser_error_occurred below returns true. */
8955 else
8956 {
8959 /* Look for the type-id. */
8961 /* Look for the closing `)'. */
8966 }
8968 /* Restore the saved message. */
8971 /* At this point this can only be either a cast or a
8972 parenthesized ctor such as `(T ())' that looks like a cast to
8973 function returning T. */
8975 {
8976 /* Only commit if the cast-expression doesn't start with
8977 '++', '--', or '[' in C++11. */
8985 pidk);
8988 {
8989 /* Warn about old-style casts, if so requested. */
8994 {
9000 }
9002 /* Only type conversions to integral or enumeration types
9003 can be used in constant-expressions. */
9006 NIC_CAST))
9009 /* Perform the cast. */
9010 /* Make a location:
9011 (TYPE) EXPR
9012 ^~~~~~~~~~~
9013 with start==caret at the open paren, extending to the
9014 end of "expr". */
9016 open_paren_loc,
9020 }
9021 }
9022 else
9024 }
9026 /* If we get here, then it's not a cast, so it must be a
9027 unary-expression. */
9030 }
9032 /* Parse a binary expression of the general form:
9034 pm-expression:
9035 cast-expression
9036 pm-expression .* cast-expression
9037 pm-expression ->* cast-expression
9039 multiplicative-expression:
9040 pm-expression
9041 multiplicative-expression * pm-expression
9042 multiplicative-expression / pm-expression
9043 multiplicative-expression % pm-expression
9045 additive-expression:
9046 multiplicative-expression
9047 additive-expression + multiplicative-expression
9048 additive-expression - multiplicative-expression
9050 shift-expression:
9051 additive-expression
9052 shift-expression << additive-expression
9053 shift-expression >> additive-expression
9055 relational-expression:
9056 shift-expression
9057 relational-expression < shift-expression
9058 relational-expression > shift-expression
9059 relational-expression <= shift-expression
9060 relational-expression >= shift-expression
9062 GNU Extension:
9064 relational-expression:
9065 relational-expression <? shift-expression
9066 relational-expression >? shift-expression
9068 equality-expression:
9069 relational-expression
9070 equality-expression == relational-expression
9071 equality-expression != relational-expression
9073 and-expression:
9074 equality-expression
9075 and-expression & equality-expression
9077 exclusive-or-expression:
9078 and-expression
9079 exclusive-or-expression ^ and-expression
9081 inclusive-or-expression:
9082 exclusive-or-expression
9083 inclusive-or-expression | exclusive-or-expression
9085 logical-and-expression:
9086 inclusive-or-expression
9087 logical-and-expression && inclusive-or-expression
9089 logical-or-expression:
9090 logical-and-expression
9091 logical-or-expression || logical-and-expression
9093 All these are implemented with a single function like:
9095 binary-expression:
9096 simple-cast-expression
9097 binary-expression <token> binary-expression
9099 CAST_P is true if this expression is the target of a cast.
9101 The binops_by_token map is used to get the tree codes for each <token> type.
9102 binary-expressions are associated according to a precedence table. */
9104 #define TOKEN_PRECEDENCE(token) \
9105 (((token->type == CPP_GREATER \
9106 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9107 && !parser->greater_than_is_operator_p) \
9108 ? PREC_NOT_OPERATOR \
9109 : binops_by_token[token->type].prec)
9111 static cp_expr
9117 {
9118 cp_parser_expression_stack stack;
9120 cp_parser_expression_stack_entry current;
9121 cp_expr rhs;
9125 tree overload;
9127 /* Parse the first expression. */
9138 {
9139 /* Get an operator token. */
9145 {
9147 "%<>>%> operator is treated"
9151 }
9156 /* This is a fold-expression; handle it later. */
9159 /* Popping an entry off the stack means we completed a subexpression:
9160 - either we found a token which is not an operator (`>' where it is not
9161 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9162 will happen repeatedly;
9163 - or, we found an operator which has lower priority. This is the case
9164 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9165 parsing `3 * 4'. */
9167 {
9170 else
9172 }
9174 get_rhs:
9178 /* We used the operator token. */
9181 /* For "false && x" or "true || x", x will never be executed;
9182 disable warnings while evaluating it. */
9184 c_inhibit_evaluation_warnings +=
9187 c_inhibit_evaluation_warnings +=
9190 /* Extract another operand. It may be the RHS of this expression
9191 or the LHS of a new, higher priority expression. */
9196 /* Get another operator token. Look up its precedence to avoid
9197 building a useless (immediately popped) stack entry for common
9198 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9205 {
9206 /* ... and prepare to parse the RHS of the new, higher priority
9207 expression. Since precedence levels on the stack are
9208 monotonically increasing, we do not have to care about
9209 stack overflows. */
9218 pop:
9220 /* If the stack is not empty, we have parsed into LHS the right side
9221 (`4' in the example above) of an expression we had suspended.
9222 We can use the information on the stack to recover the LHS (`3')
9223 from the stack together with the tree code (`MULT_EXPR'), and
9224 the precedence of the higher level subexpression
9225 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9226 which will be used to actually build the additive expression. */
9231 }
9233 /* Undo the disabling of warnings done above. */
9235 c_inhibit_evaluation_warnings -=
9238 c_inhibit_evaluation_warnings -=
9244 /* Avoid warning for !!x == y. */
9249 /* Avoid warning for !b == y where b is boolean. */
9253 /* Avoid warning for !!b == y where b is boolean. */
9266 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9267 ERROR_MARK for everything that is not a binary expression.
9268 This makes warn_about_parentheses miss some warnings that
9269 involve unary operators. For unary expressions we should
9270 pass the correct tree_code unless the unary expression was
9271 surrounded by parentheses.
9272 */
9279 == tcc_comparison
9282 else
9283 {
9288 /* TODO: build_x_binary_op doesn't always honor the location. */
9290 }
9293 /* If the binary operator required the use of an overloaded operator,
9294 then this expression cannot be an integral constant-expression.
9295 An overloaded operator can be used even if both operands are
9296 otherwise permissible in an integral constant-expression if at
9297 least one of the operands is of enumeration type. */
9301 NIC_OVERLOADED))
9303 }
9306 }
9308 static cp_expr
9313 {
9316 }
9318 /* Parse the `? expression : assignment-expression' part of a
9319 conditional-expression. The LOGICAL_OR_EXPR is the
9320 logical-or-expression that started the conditional-expression.
9321 Returns a representation of the entire conditional-expression.
9323 This routine is used by cp_parser_assignment_expression.
9325 ? expression : assignment-expression
9327 GNU Extensions:
9329 ? : assignment-expression */
9331 static tree
9333 {
9335 cp_expr assignment_expr;
9339 /* Consume the `?' token. */
9344 {
9347 /* Implicit true clause. */
9349 c_inhibit_evaluation_warnings +=
9352 }
9353 else
9354 {
9357 /* Parse the expression. */
9358 c_inhibit_evaluation_warnings +=
9361 c_inhibit_evaluation_warnings +=
9365 }
9367 /* The next token should be a `:'. */
9369 /* Parse the assignment-expression. */
9371 c_inhibit_evaluation_warnings -=
9374 /* Make a location:
9375 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9376 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9377 with the caret at the "?", ranging from the start of
9378 the logical_or_expr to the end of the assignment_expr. */
9383 /* Build the conditional-expression. */
9385 expr,
9386 assignment_expr,
9387 tf_warning_or_error);
9388 }
9390 /* Parse an assignment-expression.
9392 assignment-expression:
9393 conditional-expression
9394 logical-or-expression assignment-operator assignment_expression
9395 throw-expression
9397 CAST_P is true if this expression is the target of a cast.
9398 DECLTYPE_P is true if this expression is the operand of decltype.
9400 Returns a representation for the expression. */
9402 static cp_expr
9405 {
9406 cp_expr expr;
9408 /* If the next token is the `throw' keyword, then we're looking at
9409 a throw-expression. */
9412 /* Otherwise, it must be that we are looking at a
9413 logical-or-expression. */
9414 else
9415 {
9416 /* Parse the binary expressions (logical-or-expression). */
9418 decltype_p,
9420 /* If the next token is a `?' then we're actually looking at a
9421 conditional-expression. */
9424 else
9425 {
9428 /* If it's an assignment-operator, we're using the second
9429 production. */
9430 enum tree_code assignment_operator
9433 {
9436 /* Parse the right-hand side of the assignment. */
9443 /* An assignment may not appear in a
9444 constant-expression. */
9446 NIC_ASSIGNMENT))
9448 /* Build the assignment expression. Its default
9449 location:
9450 LHS = RHS
9451 ~~~~^~~~~
9452 is the location of the '=' token as the
9453 caret, ranging from the start of the lhs to the
9454 end of the rhs. */
9459 assignment_operator,
9460 rhs,
9462 /* TODO: build_x_modify_expr doesn't honor the location,
9463 so we must set it here. */
9465 }
9466 }
9467 }
9470 }
9472 /* Parse an (optional) assignment-operator.
9474 assignment-operator: one of
9475 = *= /= %= += -= >>= <<= &= ^= |=
9477 GNU Extension:
9479 assignment-operator: one of
9480 <?= >?=
9482 If the next token is an assignment operator, the corresponding tree
9483 code is returned, and the token is consumed. For example, for
9484 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9485 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9486 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9487 operator, ERROR_MARK is returned. */
9489 static enum tree_code
9491 {
9495 /* Peek at the next token. */
9499 {
9545 /* Nothing else is an assignment operator. */
9547 }
9549 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9554 /* If it was an assignment operator, consume it. */
9559 }
9561 /* Parse an expression.
9563 expression:
9564 assignment-expression
9565 expression , assignment-expression
9567 CAST_P is true if this expression is the target of a cast.
9568 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9569 except possibly parenthesized or on the RHS of a comma (N3276).
9571 Returns a representation of the expression. */
9573 static cp_expr
9576 {
9581 {
9582 cp_expr assignment_expression;
9584 /* Parse the next assignment-expression. */
9585 assignment_expression
9588 /* We don't create a temporary for a call that is the immediate operand
9589 of decltype or on the RHS of a comma. But when we see a comma, we
9590 need to create a temporary for a call on the LHS. */
9595 assignment_expression
9599 /* If this is the first assignment-expression, we can just
9600 save it away. */
9603 else
9604 {
9605 /* Create a location with caret at the comma, ranging
9606 from the start of the LHS to the end of the RHS. */
9611 assignment_expression,
9614 }
9615 /* If the next token is not a comma, or we're in a fold-expression, then
9616 we are done with the expression. */
9620 /* Consume the `,'. */
9623 /* A comma operator cannot appear in a constant-expression. */
9626 }
9629 }
9631 /* Parse a constant-expression.
9633 constant-expression:
9634 conditional-expression
9636 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9637 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9638 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9639 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9640 only parse a conditional-expression, otherwise parse an
9641 assignment-expression. See below for rationale. */
9643 static cp_expr
9648 {
9652 cp_expr expression;
9654 /* It might seem that we could simply parse the
9655 conditional-expression, and then check to see if it were
9656 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9657 one that the compiler can figure out is constant, possibly after
9658 doing some simplifications or optimizations. The standard has a
9659 precise definition of constant-expression, and we must honor
9660 that, even though it is somewhat more restrictive.
9662 For example:
9664 int i[(2, 3)];
9666 is not a legal declaration, because `(2, 3)' is not a
9667 constant-expression. The `,' operator is forbidden in a
9668 constant-expression. However, GCC's constant-folding machinery
9669 will fold this operation to an INTEGER_CST for `3'. */
9671 /* Save the old settings. */
9673 saved_allow_non_integral_constant_expression_p
9676 /* We are now parsing a constant-expression. */
9678 parser->allow_non_integral_constant_expression_p
9681 /* Although the grammar says "conditional-expression", when not STRICT_P,
9682 we parse an "assignment-expression", which also permits
9683 "throw-expression" and the use of assignment operators. In the case
9684 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9685 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9686 actually essential that we look for an assignment-expression.
9687 For example, cp_parser_initializer_clauses uses this function to
9688 determine whether a particular assignment-expression is in fact
9689 constant. */
9691 {
9692 /* Parse the binary expressions (logical-or-expression). */
9695 /* If the next token is a `?' then we're actually looking at
9696 a conditional-expression; otherwise we're done. */
9699 }
9700 else
9702 /* Restore the old settings. */
9703 parser->integral_constant_expression_p
9705 parser->allow_non_integral_constant_expression_p
9708 {
9709 /* Require an rvalue constant expression here; that's what our
9710 callers expect. Reference constant expressions are handled
9711 separately in e.g. cp_parser_template_argument. */
9720 }
9723 parser->non_integral_constant_expression_p
9727 }
9729 /* Parse __builtin_offsetof.
9731 offsetof-expression:
9732 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9734 offsetof-member-designator:
9735 id-expression
9736 | offsetof-member-designator "." id-expression
9737 | offsetof-member-designator "[" expression "]"
9738 | offsetof-member-designator "->" id-expression */
9740 static cp_expr
9742 {
9744 tree type;
9745 cp_expr expr;
9746 cp_id_kind dummy;
9748 location_t finish_loc;
9750 /* We're about to accept non-integral-constant things, but will
9751 definitely yield an integral constant expression. Save and
9752 restore these values around our local parsing. */
9758 /* Consume the "__builtin_offsetof" token. */
9760 /* Consume the opening `('. */
9761 matching_parens parens;
9763 /* Parse the type-id. */
9766 /* Look for the `,'. */
9770 /* Build the (type *)null that begins the traditional offsetof macro. */
9771 tree object_ptr
9773 tf_warning_or_error);
9775 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9779 {
9782 {
9784 /* offsetof-member-designator "[" expression "]" */
9790 /* offsetof-member-designator "->" identifier */
9793 /* FALLTHRU */
9796 /* offsetof-member-designator "." identifier */
9804 /* Consume the ")" token. */
9810 /* Error. We know the following require will fail, but
9811 that gives the proper error message. */
9816 }
9817 }
9819 success:
9820 /* Make a location of the form:
9821 __builtin_offsetof (struct s, f)
9822 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9823 with caret at the type-id, ranging from the start of the
9824 "_builtin_offsetof" token to the close paren. */
9826 /* The result will be an INTEGER_CST, so we need to explicitly
9827 preserve the location. */
9830 failure:
9835 }
9837 /* Parse a trait expression.
9839 Returns a representation of the expression, the underlying type
9840 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9842 static cp_expr
9844 {
9845 cp_trait_kind kind;
9851 {
9953 }
9955 /* Get location of initial token. */
9958 /* Consume the token. */
9961 matching_parens parens;
9964 {
9967 }
9973 {
9976 {
9979 }
9983 }
9985 {
9987 {
9991 {
9994 }
9998 }
9999 }
10004 /* Construct a location of the form:
10005 __is_trivially_copyable(_Tp)
10006 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10007 with start == caret, finishing at the close-paren. */
10010 /* Complete the trait expression, which may mean either processing
10011 the trait expr now or saving it for template instantiation. */
10013 {
10022 }
10023 }
10025 /* Parse a lambda expression.
10027 lambda-expression:
10028 lambda-introducer lambda-declarator [opt] compound-statement
10030 Returns a representation of the expression. */
10032 static cp_expr
10034 {
10036 tree type;
10044 {
10046 {
10050 }
10052 }
10054 {
10056 {
10059 }
10061 }
10063 /* We may be in the middle of deferred access check. Disable
10064 it now. */
10075 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10078 /* Now that we've started the type, add the capture fields for any
10079 explicit captures. */
10082 {
10083 /* Inside the class, surrounding template-parameter-lists do not apply. */
10084 unsigned int saved_num_template_parameter_lists
10088 bool fully_implicit_function_template_p
10092 bool auto_is_implicit_function_template_parm_p
10103 /* By virtue of defining a local class, a lambda expression has access to
10104 the private variables of enclosing classes. */
10112 {
10117 }
10119 {
10122 }
10124 /* The capture list was built up in reverse order; fix that now. */
10136 parser->fully_implicit_function_template_p
10140 parser->auto_is_implicit_function_template_parm_p
10142 }
10144 /* This field is only used during parsing of the lambda. */
10147 /* This lambda shouldn't have any proxies left at this point. */
10149 /* And now that we're done, push proxies for an enclosing lambda. */
10154 else
10162 }
10164 /* Parse the beginning of a lambda expression.
10166 lambda-introducer:
10167 [ lambda-capture [opt] ]
10169 LAMBDA_EXPR is the current representation of the lambda expression. */
10171 static void
10173 {
10174 /* Need commas after the first capture. */
10177 /* Eat the leading `['. */
10180 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10188 {
10191 }
10194 {
10196 tree capture_id;
10197 tree capture_init_expr;
10201 enum capture_kind_type
10202 {
10203 BY_COPY,
10204 BY_REFERENCE
10205 };
10209 {
10212 }
10216 else
10219 /* Possibly capture `this'. */
10221 {
10232 explicit_init_p);
10234 }
10236 /* Possibly capture `*this'. */
10239 {
10250 explicit_init_p);
10252 }
10254 /* Remember whether we want to capture as a reference or not. */
10256 {
10259 }
10261 /* Get the identifier. */
10266 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10267 delimiters, but I modified this to stop on unnested ']' as well. It
10268 was already changed to stop on unnested '}', so the
10269 "closing_parenthesis" name is no more misleading with my change. */
10270 {
10276 }
10278 /* Find the initializer for this capture. */
10282 {
10284 /* An explicit initializer exists. */
10287 "lambda capture initializers "
10293 {
10296 }
10297 }
10298 else
10299 {
10302 /* Turn the identifier into an id-expression. */
10303 capture_init_expr
10308 {
10311 }
10315 {
10318 capture_init_expr);
10322 }
10325 {
10328 capture_init_expr))
10332 }
10334 capture_init_expr
10335 = finish_id_expression
10337 capture_init_expr,
10351 {
10354 }
10355 else
10357 }
10361 {
10366 capture_id);
10370 "capture of %qD redundant with by-reference capture "
10372 }
10375 capture_id,
10376 capture_init_expr,
10378 explicit_init_p);
10379 }
10382 }
10384 /* Parse the (optional) middle of a lambda expression.
10386 lambda-declarator:
10387 < template-parameter-list [opt] >
10388 ( parameter-declaration-clause [opt] )
10389 attribute-specifier [opt]
10390 decl-specifier-seq [opt]
10391 exception-specification [opt]
10392 lambda-return-type-clause [opt]
10394 LAMBDA_EXPR is the current representation of the lambda expression. */
10396 static bool
10398 {
10399 /* 5.1.1.4 of the standard says:
10400 If a lambda-expression does not include a lambda-declarator, it is as if
10401 the lambda-declarator were ().
10402 This means an empty parameter list, no attributes, and no exception
10403 specification. */
10410 cp_decl_specifier_seq lambda_specs;
10413 /* The template-parameter-list is optional, but must begin with
10414 an opening angle if present. */
10416 {
10419 "lambda templates are only available with "
10423 "lambda templates are only available with "
10432 /* We just processed one more parameter list. */
10434 }
10436 /* The parameter-declaration-clause is optional (unless
10437 template-parameter-list was given), but must begin with an
10438 opening parenthesis if present. */
10440 {
10441 matching_parens parens;
10446 /* Parse parameters. */
10449 /* Default arguments shall not be specified in the
10450 parameter-declaration-clause of a lambda-declarator. */
10461 /* In the decl-specifier-seq of the lambda-declarator, each
10462 decl-specifier shall either be mutable or constexpr. */
10466 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10469 {
10474 }
10478 /* Parse optional exception specification. */
10481 /* Parse optional trailing return type. */
10483 {
10486 }
10488 /* The function parameters must be in scope all the way until after the
10489 trailing-return-type in case of decltype. */
10491 }
10495 /* Create the function call operator.
10497 Messing with declarators like this is no uglier than building up the
10498 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10499 other code. */
10500 {
10501 cp_decl_specifier_seq return_type_specs;
10503 tree fco;
10510 else
10511 /* Maybe we will deduce the return type later. */
10515 {
10519 else
10522 }
10531 VIRT_SPEC_UNSPECIFIED,
10532 REF_QUAL_NONE,
10533 tx_qual,
10534 exception_spec,
10540 declarator,
10541 attributes);
10543 {
10546 /* Give the object parameter a different name. */
10550 }
10552 {
10556 }
10565 }
10566 }
10568 /* Parse the body of a lambda expression, which is simply
10570 compound-statement
10572 but which requires special handling.
10573 LAMBDA_EXPR is the current representation of the lambda expression. */
10575 static void
10577 {
10584 else
10585 /* Still increment function_depth so that we don't GC in the
10586 middle of an expression. */
10591 /* Clear this in case we're in the middle of a default argument. */
10595 {
10599 matching_braces braces;
10602 {
10605 /* Originally C++11 required us to peek for 'return expr'; and
10606 process it specially here to deduce the return type. N3638
10607 removed the need for that. */
10615 }
10618 }
10625 else
10627 }
10629 /* Statements [gram.stmt.stmt] */
10631 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10633 static void
10635 {
10642 }
10644 /* Parse a statement.
10646 statement:
10647 labeled-statement
10648 expression-statement
10649 compound-statement
10650 selection-statement
10651 iteration-statement
10652 jump-statement
10653 declaration-statement
10654 try-block
10656 C++11:
10658 statement:
10659 labeled-statement
10660 attribute-specifier-seq (opt) expression-statement
10661 attribute-specifier-seq (opt) compound-statement
10662 attribute-specifier-seq (opt) selection-statement
10663 attribute-specifier-seq (opt) iteration-statement
10664 attribute-specifier-seq (opt) jump-statement
10665 declaration-statement
10666 attribute-specifier-seq (opt) try-block
10668 init-statement:
10669 expression-statement
10670 simple-declaration
10672 TM Extension:
10674 statement:
10675 atomic-statement
10677 IN_COMPOUND is true when the statement is nested inside a
10678 cp_parser_compound_statement; this matters for certain pragmas.
10680 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10681 is a (possibly labeled) if statement which is not enclosed in braces
10682 and has an else clause. This is used to implement -Wparentheses.
10684 CHAIN is a vector of if-else-if conditions. */
10686 static void
10690 {
10695 restart:
10698 /* There is no statement yet. */
10704 /* In obj-c++, seeing '[[' might be the either the beginning of
10705 c++11 attributes, or a nested objc-message-expression. So
10706 let's parse the c++11 attributes tentatively. */
10710 {
10713 }
10715 /* Peek at the next token. */
10717 /* Remember the location of the first token in the statement. */
10720 /* If this is a keyword, then that will often determine what kind of
10721 statement we have. */
10723 {
10727 {
10730 /* Looks like a labeled-statement with a case label.
10731 Parse the label, and then use tail recursion to parse
10732 the statement. */
10755 /* Objective-C++ exception-handling constructs. */
10769 /* This must be a namespace alias definition. */
10785 /* It might be a keyword like `int' that can start a
10786 declaration-statement. */
10788 }
10789 }
10791 {
10792 /* If the next token is a `:', then we are looking at a
10793 labeled-statement. */
10796 {
10797 /* Looks like a labeled-statement with an ordinary label.
10798 Parse the label, and then use tail recursion to parse
10799 the statement. */
10804 }
10805 }
10806 /* Anything that starts with a `{' must be a compound-statement. */
10809 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10810 a statement all its own. */
10812 {
10813 /* Only certain OpenMP pragmas are attached to statements, and thus
10814 are considered statements themselves. All others are not. In
10815 the context of a compound, accept the pragma as a "statement" and
10816 return so that we can check for a close brace. Otherwise we
10817 require a real statement and must go back and read one. */
10823 }
10825 {
10828 }
10830 /* Everything else must be a declaration-statement or an
10831 expression-statement. Try for the declaration-statement
10832 first, unless we are looking at a `;', in which case we know that
10833 we have an expression-statement. */
10835 {
10837 {
10839 {
10840 /* Attributes should be parsed as part of the the
10841 declaration, so let's un-parse them. */
10844 }
10847 /* Try to parse the declaration-statement. */
10849 /* If that worked, we're done. */
10852 }
10853 /* All preceding labels have been parsed at this point. */
10857 /* Look for an expression-statement instead. */
10860 /* Handle [[fallthrough]];. */
10862 {
10863 /* The next token after the fallthrough attribute is ';'. */
10865 {
10866 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10868 IFN_FALLTHROUGH,
10871 }
10872 else
10876 }
10877 }
10879 /* Set the line number for the statement. */
10883 /* Allow "[[fallthrough]];", but warn otherwise. */
10886 OPT_Wattributes,
10888 }
10890 /* Parse the label for a labeled-statement, i.e.
10892 identifier :
10893 case constant-expression :
10894 default :
10896 GNU Extension:
10897 case constant-expression ... constant-expression : statement
10899 When a label is parsed without errors, the label is added to the
10900 parse tree by the finish_* functions, so this function doesn't
10901 have to return the label. */
10903 static void
10905 {
10910 /* The next token should be an identifier. */
10914 {
10917 }
10919 /* Remember whether this case or a user-defined label is allowed to fall
10920 through to. */
10925 {
10927 {
10931 /* Consume the `case' token. */
10933 /* Parse the constant-expression. */
10940 {
10941 /* Consume the `...' token. */
10947 /* We don't need to emit warnings here, as the common code
10948 will do this for us. */
10949 }
10950 else
10954 {
10958 }
10959 else
10962 expr);
10963 }
10967 /* Consume the `default' token. */
10971 {
10975 }
10976 else
10981 /* Anything else must be an ordinary label. */
10986 }
10988 /* Require the `:' token. */
10991 /* An ordinary label may optionally be followed by attributes.
10992 However, this is only permitted if the attributes are then
10993 followed by a semicolon. This is because, for backward
10994 compatibility, when parsing
10995 lab: __attribute__ ((unused)) int i;
10996 we want the attribute to attach to "i", not "lab". */
10999 {
11000 tree attrs;
11007 ;
11008 else
11010 }
11016 }
11018 /* Parse an expression-statement.
11020 expression-statement:
11021 expression [opt] ;
11023 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11024 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11025 indicates whether this expression-statement is part of an
11026 expression statement. */
11028 static tree
11030 {
11035 /* There might be attribute fallthrough. */
11038 /* If the next token is a ';', then there is no expression
11039 statement. */
11041 {
11045 {
11048 }
11049 }
11051 /* Handle [[fallthrough]];. */
11053 {
11054 /* The next token after the fallthrough attribute is ';'. */
11056 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11059 else
11063 }
11065 /* Allow "[[fallthrough]];", but warn otherwise. */
11070 /* Give a helpful message for "A<T>::type t;" and the like. */
11073 {
11080 {
11081 /* A::A a; */
11086 }
11087 }
11089 /* Consume the final `;'. */
11094 /* This is the final expression statement of a statement
11095 expression. */
11101 }
11103 /* Parse a compound-statement.
11105 compound-statement:
11106 { statement-seq [opt] }
11108 GNU extension:
11110 compound-statement:
11111 { label-declaration-seq [opt] statement-seq [opt] }
11113 label-declaration-seq:
11114 label-declaration
11115 label-declaration-seq label-declaration
11117 Returns a tree representing the statement. */
11119 static tree
11122 {
11123 tree compound_stmt;
11124 matching_braces braces;
11126 /* Consume the `{'. */
11133 /* Begin the compound-statement. */
11135 /* If the next keyword is `__label__' we have a label declaration. */
11138 /* Parse an (optional) statement-seq. */
11140 /* Finish the compound-statement. */
11142 /* Consume the `}'. */
11146 }
11148 /* Parse an (optional) statement-seq.
11150 statement-seq:
11151 statement
11152 statement-seq [opt] statement */
11154 static void
11156 {
11157 /* Scan statements until there aren't any more. */
11159 {
11162 /* If we are looking at a `}', then we have run out of
11163 statements; the same is true if we have reached the end
11164 of file, or have stumbled upon a stray '@end'. */
11171 /* If we are in a compound statement and find 'else' then
11172 something went wrong. */
11174 {
11177 else
11178 {
11181 }
11182 }
11184 /* Parse the statement. */
11186 }
11187 }
11189 /* Return true if we're looking at (init; cond), false otherwise. */
11191 static bool
11193 {
11194 /* Save tokens so that we can put them back. */
11197 /* Look for ';' that is not nested in () or {}. */
11200 CPP_SEMICOLON,
11203 /* Roll back the tokens we skipped. */
11207 }
11209 /* Parse a selection-statement.
11211 selection-statement:
11212 if ( init-statement [opt] condition ) statement
11213 if ( init-statement [opt] condition ) statement else statement
11214 switch ( init-statement [opt] condition ) statement
11216 Returns the new IF_STMT or SWITCH_STMT.
11218 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11219 is a (possibly labeled) if statement which is not enclosed in
11220 braces and has an else clause. This is used to implement
11221 -Wparentheses.
11223 CHAIN is a vector of if-else-if conditions. This is used to implement
11224 -Wduplicated-cond. */
11226 static tree
11229 {
11232 token_indent_info guard_tinfo;
11237 /* Peek at the next token. */
11241 /* See what kind of keyword it is. */
11244 {
11247 {
11248 tree statement;
11249 tree condition;
11254 RID_CONSTEXPR))
11255 {
11261 }
11263 /* Look for the `('. */
11264 matching_parens parens;
11266 {
11269 }
11271 /* Begin the selection-statement. */
11273 {
11276 }
11277 else
11280 /* Parse the optional init-statement. */
11282 {
11283 tree decl;
11286 "init-statement in selection statements only available "
11289 }
11291 /* Parse the condition. */
11293 /* Look for the `)'. */
11299 {
11303 /* Add the condition. */
11310 /* Parse the then-clause. */
11314 /* Outside a template, the non-selected branch of a constexpr
11315 if is a 'discarded statement', i.e. unevaluated. */
11320 {
11323 }
11326 guard_tinfo);
11333 {
11337 }
11339 /* If the next token is `else', parse the else-clause. */
11341 RID_ELSE))
11342 {
11346 {
11349 }
11351 guard_tinfo
11353 /* Consume the `else' keyword. */
11356 {
11358 RID_IF)
11360 {
11361 /* We've got "if (COND) else if (COND2)". Start
11362 the condition chain and add COND as the first
11363 element. */
11367 {
11368 /* Wrap it in a NOP_EXPR so that we can set the
11369 location of the condition. */
11371 condition);
11374 }
11375 }
11377 RID_IF))
11378 {
11379 /* This is if-else without subsequent if. Zap the
11380 condition chain; we would have already warned at
11381 this point. */
11384 }
11385 }
11387 /* Parse the else-clause. */
11393 /* If we are currently parsing a then-clause, then
11394 IF_P will not be NULL. We set it to true to
11395 indicate that this if statement has an else clause.
11396 This may trigger the Wparentheses warning below
11397 when we get back up to the parent if statement. */
11402 {
11406 }
11407 }
11408 else
11409 {
11410 /* This if statement does not have an else clause. If
11411 NESTED_IF is true, then the then-clause has an if
11412 statement which does have an else clause. We warn
11413 about the potential ambiguity. */
11416 "suggest explicit braces to avoid ambiguous"
11419 {
11420 /* We don't need the condition chain anymore. */
11423 }
11424 }
11426 /* Now we're all done with the if-statement. */
11428 }
11429 else
11430 {
11434 /* Add the condition. */
11437 /* Parse the body of the switch-statement. */
11443 guard_tinfo);
11447 /* Now we're all done with the switch-statement. */
11449 }
11452 }
11458 }
11459 }
11461 /* Parse a condition.
11463 condition:
11464 expression
11465 type-specifier-seq declarator = initializer-clause
11466 type-specifier-seq declarator braced-init-list
11468 GNU Extension:
11470 condition:
11471 type-specifier-seq declarator asm-specification [opt]
11472 attributes [opt] = assignment-expression
11474 Returns the expression that should be tested. */
11476 static tree
11478 {
11479 cp_decl_specifier_seq type_specifiers;
11483 /* Try the declaration first. */
11485 /* New types are not allowed in the type-specifier-seq for a
11486 condition. */
11488 parser->type_definition_forbidden_message
11490 /* Parse the type-specifier-seq. */
11492 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11495 /* Restore the saved message. */
11497 /* If all is well, we might be looking at a declaration. */
11499 {
11500 tree decl;
11501 tree asm_specification;
11502 tree attributes;
11506 /* Parse the declarator. */
11512 /* Parse the attributes. */
11514 /* Parse the asm-specification. */
11516 /* If the next token is not an `=' or '{', then we might still be
11517 looking at an expression. For example:
11519 if (A(a).x)
11521 looks like a decl-specifier-seq and a declarator -- but then
11522 there is no `=', so this is an expression. */
11527 /* If we did see an `=' or '{', then we are looking at a declaration
11528 for sure. */
11530 {
11531 tree pushed_scope;
11535 /* Create the declaration. */
11541 /* Parse the initializer. */
11543 {
11547 }
11548 else
11549 {
11550 /* Consume the `='. */
11553 }
11557 /* Process the initializer. */
11560 asm_specification,
11561 flags);
11567 }
11568 }
11569 /* If we didn't even get past the declarator successfully, we are
11570 definitely not looking at a declaration. */
11571 else
11574 /* Otherwise, we are looking at an expression. */
11576 }
11578 /* Parses a for-statement or range-for-statement until the closing ')',
11579 not included. */
11581 static tree
11583 {
11587 /* Begin the for-statement. */
11590 /* Parse the initialization. */
11595 else
11597 }
11599 static tree
11602 {
11603 /* Normal for loop */
11606 tree stmt;
11609 /* The init-statement has already been parsed in
11610 cp_parser_init_statement, so no work is needed here. */
11613 /* If there's a condition, process it. */
11617 {
11621 }
11623 {
11627 }
11629 /* Look for the `;'. */
11632 /* If there's an expression, process it. */
11638 }
11640 /* Tries to parse a range-based for-statement:
11642 range-based-for:
11643 decl-specifier-seq declarator : expression
11645 The decl-specifier-seq declarator and the `:' are already parsed by
11646 cp_parser_init_statement. If processing_template_decl it returns a
11647 newly created RANGE_FOR_STMT; if not, it is converted to a
11648 regular FOR_STMT. */
11650 static tree
11653 {
11660 /* Get the range declaration momentarily out of the way so that
11661 the range expression doesn't clash with it. */
11663 {
11665 {
11667 /* For decomposition declaration get all of the corresponding
11668 declarations out of the way. */
11672 {
11678 {
11684 }
11685 }
11686 }
11688 {
11693 }
11694 }
11697 {
11700 }
11701 else
11704 /* Put the range declaration(s) back into scope. */
11706 {
11710 }
11712 /* If in template, STMT is converted to a normal for-statement
11713 at instantiation. If not, it is done just ahead. */
11715 {
11725 /* do_auto_deduction doesn't mess with template init-lists. */
11728 }
11729 else
11730 {
11734 unroll);
11735 }
11737 }
11739 /* Subroutine of cp_convert_range_for: given the initializer expression,
11740 builds up the range temporary. */
11742 static tree
11744 {
11747 /* Find out the type deduced by the declaration
11748 `auto &&__range = range_expr'. */
11753 /* Create the __range variable. */
11760 }
11762 /* Used by cp_parser_range_for in template context: we aren't going to
11763 do a full conversion yet, but we still need to resolve auto in the
11764 type of the for-range-declaration if present. This is basically
11765 a shortcut version of cp_convert_range_for. */
11767 static void
11769 {
11772 {
11775 iter_type = (cp_parser_perform_range_for_lookup
11778 {
11780 iter_type);
11782 RO_UNARY_STAR,
11783 tf_warning_or_error);
11786 }
11787 }
11788 }
11790 /* Converts a range-based for-statement into a normal
11791 for-statement, as per the definition.
11793 for (RANGE_DECL : RANGE_EXPR)
11794 BLOCK
11796 should be equivalent to:
11798 {
11799 auto &&__range = RANGE_EXPR;
11800 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11801 __begin != __end;
11802 ++__begin)
11803 {
11804 RANGE_DECL = *__begin;
11805 BLOCK
11806 }
11807 }
11809 If RANGE_EXPR is an array:
11810 BEGIN_EXPR = __range
11811 END_EXPR = __range + ARRAY_SIZE(__range)
11812 Else if RANGE_EXPR has a member 'begin' or 'end':
11813 BEGIN_EXPR = __range.begin()
11814 END_EXPR = __range.end()
11815 Else:
11816 BEGIN_EXPR = begin(__range)
11817 END_EXPR = end(__range);
11819 If __range has a member 'begin' but not 'end', or vice versa, we must
11820 still use the second alternative (it will surely fail, however).
11821 When calling begin()/end() in the third alternative we must use
11822 argument dependent lookup, but always considering 'std' as an associated
11823 namespace. */
11825 tree
11829 {
11837 /* If an error happened previously do nothing or else a lot of
11838 unhelpful errors would be issued. */
11840 else
11841 {
11842 tree range_temp;
11846 /* Can't bind a reference to an array of runtime bound. */
11848 else
11849 {
11854 LOOKUP_ONLYCONVERTING);
11856 }
11859 }
11861 /* The new for initialization statement. */
11869 LOOKUP_ONLYCONVERTING);
11880 LOOKUP_ONLYCONVERTING);
11884 /* The new for condition. */
11891 /* The new increment expression. */
11894 tf_warning_or_error);
11900 /* The declaration is initialized with *__begin inside the loop body. */
11903 tf_warning_or_error),
11905 LOOKUP_ONLYCONVERTING);
11910 }
11912 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11913 We need to solve both at the same time because the method used
11914 depends on the existence of members begin or end.
11915 Returns the type deduced for the iterator expression. */
11917 static tree
11919 {
11921 {
11924 }
11927 {
11932 }
11934 {
11935 /* If RANGE is an array, we will use pointer arithmetic. */
11938 range,
11942 }
11943 else
11944 {
11945 /* If it is not an array, we must do a bit of magic. */
11955 tf_warning_or_error);
11958 tf_warning_or_error);
11961 {
11962 /* Use the member functions. */
11965 else
11971 else
11974 }
11975 else
11976 {
11977 /* Use global functions with ADL. */
11984 tf_warning_or_error);
11986 tf_warning_or_error);
11988 tf_warning_or_error);
11990 tf_warning_or_error);
11993 }
11995 /* Last common checks. */
11997 {
11998 /* If one of the expressions is an error do no more checks. */
12001 }
12004 /* Can happen, when, eg, in a template context, Koenig lookup
12005 can't resolve begin/end (c++/58503). */
12007 else
12008 {
12010 /* The unqualified type of the __begin and __end temporaries should
12011 be the same, as required by the multiple auto declaration. */
12013 {
12020 /* P0184R0 allows __begin and __end to have different types,
12021 but make sure they are comparable so we can give a better
12023 else
12027 }
12029 }
12030 }
12031 }
12033 /* Helper function for cp_parser_perform_range_for_lookup.
12034 Builds a tree for RANGE.IDENTIFIER(). */
12036 static tree
12038 {
12051 tf_warning_or_error);
12054 }
12056 /* Parse an iteration-statement.
12058 iteration-statement:
12059 while ( condition ) statement
12060 do statement while ( expression ) ;
12061 for ( init-statement condition [opt] ; expression [opt] )
12062 statement
12064 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12066 static tree
12069 {
12072 tree statement;
12074 token_indent_info guard_tinfo;
12076 /* Peek at the next token. */
12083 /* Remember whether or not we are already within an iteration
12084 statement. */
12087 /* See what kind of keyword it is. */
12090 {
12092 {
12093 tree condition;
12095 /* Begin the while-statement. */
12097 /* Look for the `('. */
12098 matching_parens parens;
12100 /* Parse the condition. */
12103 /* Look for the `)'. */
12105 /* Parse the dependent statement. */
12111 /* We're done with the while-statement. */
12113 }
12117 {
12118 tree expression;
12120 /* Begin the do-statement. */
12122 /* Parse the body of the do-statement. */
12129 /* Look for the `while' keyword. */
12131 /* Look for the `('. */
12132 matching_parens parens;
12134 /* Parse the expression. */
12136 /* We're done with the do-statement. */
12138 /* Look for the `)'. */
12140 /* Look for the `;'. */
12142 }
12146 {
12147 /* Look for the `('. */
12148 matching_parens parens;
12153 /* Look for the `)'. */
12156 /* Parse the body of the for-statement. */
12163 /* We're done with the for-statement. */
12165 }
12172 }
12175 }
12177 /* Parse a init-statement or the declarator of a range-based-for.
12178 Returns true if a range-based-for declaration is seen.
12180 init-statement:
12181 expression-statement
12182 simple-declaration */
12184 static bool
12186 {
12187 /* If the next token is a `;', then we have an empty
12188 expression-statement. Grammatically, this is also a
12189 simple-declaration, but an invalid one, because it does not
12190 declare anything. Therefore, if we did not handle this case
12191 specially, we would issue an error message about an invalid
12192 declaration. */
12194 {
12198 /* A colon is used in range-based for. */
12201 /* We're going to speculatively look for a declaration, falling back
12202 to an expression, if necessary. */
12204 /* Parse the declaration. */
12207 decl);
12210 {
12211 /* It is a range-for, consume the ':' */
12215 {
12217 "range-based %<for%> loops only available with "
12220 }
12221 }
12222 else
12223 /* The ';' is not consumed yet because we told
12224 cp_parser_simple_declaration not to. */
12229 /* If the tentative parse failed, then we shall need to look for an
12230 expression-statement. */
12231 }
12232 /* If we are here, it is an expression-statement. */
12235 }
12237 /* Parse a jump-statement.
12239 jump-statement:
12240 break ;
12241 continue ;
12242 return expression [opt] ;
12243 return braced-init-list ;
12244 goto identifier ;
12246 GNU extension:
12248 jump-statement:
12249 goto * expression ;
12251 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12253 static tree
12255 {
12261 /* Peek at the next token. */
12266 /* See what kind of keyword it is. */
12269 {
12273 {
12290 }
12296 {
12300 /* Fall through. */
12310 }
12315 {
12316 tree expr;
12320 {
12324 }
12327 else
12328 /* If the next token is a `;', then there is no
12329 expression. */
12331 /* Build the return-statement. */
12334 else
12336 /* Look for the final `;'. */
12338 }
12344 {
12347 }
12349 /* Create the goto-statement. */
12351 {
12352 /* Issue a warning about this use of a GNU extension. */
12354 /* Consume the '*' token. */
12356 /* Parse the dependent expression. */
12358 }
12359 else
12361 /* Look for the final `;'. */
12368 }
12371 }
12373 /* Parse a declaration-statement.
12375 declaration-statement:
12376 block-declaration */
12378 static void
12380 {
12383 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12386 /* Parse the block-declaration. */
12389 /* Free any declarators allocated. */
12391 }
12393 /* Some dependent statements (like `if (cond) statement'), are
12394 implicitly in their own scope. In other words, if the statement is
12395 a single statement (as opposed to a compound-statement), it is
12396 none-the-less treated as if it were enclosed in braces. Any
12397 declarations appearing in the dependent statement are out of scope
12398 after control passes that point. This function parses a statement,
12399 but ensures that is in its own scope, even if it is not a
12400 compound-statement.
12402 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12403 is a (possibly labeled) if statement which is not enclosed in
12404 braces and has an else clause. This is used to implement
12405 -Wparentheses.
12407 CHAIN is a vector of if-else-if conditions. This is used to implement
12408 -Wduplicated-cond.
12410 Returns the new statement. */
12412 static tree
12416 {
12417 tree statement;
12420 token_indent_info body_tinfo
12426 /* Mark if () ; with a special NOP_EXPR. */
12428 {
12439 }
12440 /* if a compound is opened, we simply parse the statement directly. */
12443 /* If the token is not a `{', then we must take special action. */
12444 else
12445 {
12446 /* Create a compound-statement. */
12448 /* Parse the dependent-statement. */
12451 /* Finish the dummy compound-statement. */
12453 }
12455 token_indent_info next_tinfo
12464 /* Return the statement. */
12466 }
12468 /* For some dependent statements (like `while (cond) statement'), we
12469 have already created a scope. Therefore, even if the dependent
12470 statement is a compound-statement, we do not want to create another
12471 scope. */
12473 static void
12476 {
12477 /* If the token is a `{', then we must take special action. */
12479 {
12480 token_indent_info body_tinfo
12486 token_indent_info next_tinfo
12495 }
12496 else
12497 {
12498 /* Avoid calling cp_parser_compound_statement, so that we
12499 don't create a new scope. Do everything else by hand. */
12500 matching_braces braces;
12502 /* If the next keyword is `__label__' we have a label declaration. */
12505 /* Parse an (optional) statement-seq. */
12508 }
12509 }
12511 /* Declarations [gram.dcl.dcl] */
12513 /* Parse an optional declaration-sequence.
12515 declaration-seq:
12516 declaration
12517 declaration-seq declaration */
12519 static void
12521 {
12523 {
12534 {
12535 /* A declaration consisting of a single semicolon is
12536 invalid. Allow it unless we're being pedantic. */
12541 }
12543 /* If we're entering or exiting a region that's implicitly
12544 extern "C", modify the lang context appropriately. */
12546 {
12549 }
12551 {
12554 }
12557 {
12558 /* A top-level declaration can consist solely of a #pragma.
12559 A nested declaration cannot, so this is done here and not
12560 in cp_parser_declaration. (A #pragma at block scope is
12561 handled in cp_parser_statement.) */
12564 }
12566 /* Parse the declaration itself. */
12568 }
12569 }
12571 /* Parse a declaration.
12573 declaration:
12574 block-declaration
12575 function-definition
12576 template-declaration
12577 explicit-instantiation
12578 explicit-specialization
12579 linkage-specification
12580 namespace-definition
12582 C++17:
12583 deduction-guide
12585 GNU extension:
12587 declaration:
12588 __extension__ declaration */
12590 static void
12592 {
12593 cp_token token1;
12594 cp_token token2;
12599 /* Check for the `__extension__' keyword. */
12601 {
12602 /* Parse the qualified declaration. */
12604 /* Restore the PEDANTIC flag. */
12608 }
12610 /* Try to figure out what kind of declaration is present. */
12615 else
12616 {
12619 }
12621 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12624 /* If the next token is `extern' and the following token is a string
12625 literal, then we have a linkage specification. */
12629 /* If the next token is `template', then we have either a template
12630 declaration, an explicit instantiation, or an explicit
12631 specialization. */
12633 {
12634 /* `template <>' indicates a template specialization. */
12638 /* `template <' indicates a template declaration. */
12641 /* Anything else must be an explicit instantiation. */
12642 else
12644 }
12645 /* If the next token is `export', then we have a template
12646 declaration. */
12649 /* If the next token is `extern', 'static' or 'inline' and the one
12650 after that is `template', we have a GNU extended explicit
12651 instantiation directive. */
12658 /* If the next token is `namespace', check for a named or unnamed
12659 namespace definition. */
12668 /* An unnamed namespace definition. */
12672 /* An inline (associated) namespace definition. */
12676 /* Objective-C++ declaration/definition. */
12683 /* At this point we may have a template declared by a concept
12684 introduction. */
12689 else
12690 /* Try to parse a block-declaration, or a function-definition. */
12693 /* Free any declarators allocated. */
12695 }
12697 /* Parse a block-declaration.
12699 block-declaration:
12700 simple-declaration
12701 asm-definition
12702 namespace-alias-definition
12703 using-declaration
12704 using-directive
12706 GNU Extension:
12708 block-declaration:
12709 __extension__ block-declaration
12711 C++0x Extension:
12713 block-declaration:
12714 static_assert-declaration
12716 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12717 part of a declaration-statement. */
12719 static void
12722 {
12726 /* Check for the `__extension__' keyword. */
12728 {
12729 /* Parse the qualified declaration. */
12731 /* Restore the PEDANTIC flag. */
12735 }
12737 /* Peek at the next token to figure out which kind of declaration is
12738 present. */
12741 /* If the next keyword is `asm', we have an asm-definition. */
12743 {
12747 }
12748 /* If the next keyword is `namespace', we have a
12749 namespace-alias-definition. */
12752 /* If the next keyword is `using', we have a
12753 using-declaration, a using-directive, or an alias-declaration. */
12755 {
12760 /* If the token after `using' is `namespace', then we have a
12761 using-directive. */
12765 /* If the second token after 'using' is '=', then we have an
12766 alias-declaration. */
12772 /* Otherwise, it's a using-declaration. */
12773 else
12776 }
12777 /* If the next keyword is `__label__' we have a misplaced label
12778 declaration. */
12780 {
12784 /* If the next token is now a `;', consume it. */
12787 }
12788 /* If the next token is `static_assert' we have a static assertion. */
12791 /* Anything else must be a simple-declaration. */
12792 else
12795 }
12797 /* Parse a simple-declaration.
12799 simple-declaration:
12800 decl-specifier-seq [opt] init-declarator-list [opt] ;
12801 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12802 brace-or-equal-initializer ;
12804 init-declarator-list:
12805 init-declarator
12806 init-declarator-list , init-declarator
12808 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12809 function-definition as a simple-declaration.
12811 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12812 parsed declaration if it is an uninitialized single declarator not followed
12813 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12814 if present, will not be consumed. */
12816 static void
12820 {
12821 cp_decl_specifier_seq decl_specifiers;
12830 /* Defer access checks until we know what is being declared; the
12831 checks for names appearing in the decl-specifier-seq should be
12832 done as if we were in the scope of the thing being declared. */
12835 /* Parse the decl-specifier-seq. We have to keep track of whether
12836 or not the decl-specifier-seq declares a named class or
12837 enumeration type, since that is the only case in which the
12838 init-declarator-list is allowed to be empty.
12840 [dcl.dcl]
12842 In a simple-declaration, the optional init-declarator-list can be
12843 omitted only when declaring a class or enumeration, that is when
12844 the decl-specifier-seq contains either a class-specifier, an
12845 elaborated-type-specifier, or an enum-specifier. */
12847 CP_PARSER_FLAGS_OPTIONAL,
12850 /* We no longer need to defer access checks. */
12853 /* In a block scope, a valid declaration must always have a
12854 decl-specifier-seq. By not trying to parse declarators, we can
12855 resolve the declaration/expression ambiguity more quickly. */
12858 {
12861 }
12863 /* If the next two tokens are both identifiers, the code is
12864 erroneous. The usual cause of this situation is code like:
12866 T t;
12868 where "T" should name a type -- but does not. */
12871 {
12872 /* If parsing tentatively, we should commit; we really are
12873 looking at a declaration. */
12875 /* Give up. */
12877 }
12879 /* If we have seen at least one decl-specifier, and the next token
12880 is not a parenthesis, then we must be looking at a declaration.
12881 (After "int (" we might be looking at a functional cast.) */
12888 /* Look for C++17 decomposition declaration. */
12896 {
12897 tree decl
12899 maybe_range_for_decl,
12902 /* The next token should be either a `,' or a `;'. */
12904 /* If it's a `;', we are done. */
12907 /* Anything else is an error. */
12908 else
12909 {
12910 /* If we have already issued an error message we don't need
12911 to issue another one. */
12916 /* Skip tokens until we reach the end of the statement. */
12918 /* If the next token is now a `;', consume it. */
12922 }
12923 }
12924 else
12927 tree last_type;
12929 /* NULL_TREE if both variable and function declaration are allowed,
12930 error_mark_node if function declaration are not allowed and
12931 a FUNCTION_DECL that should be diagnosed if it is followed by
12932 variable declarations. */
12933 tree auto_function_declaration;
12936 auto_specifier_p
12940 /* Keep going until we hit the `;' at the end of the simple
12941 declaration. */
12944 CPP_SEMICOLON))
12945 {
12948 tree decl;
12952 {
12953 /* If we are processing next declarator, comma is expected */
12958 {
12962 }
12963 }
12964 else
12967 /* Parse the init-declarator. */
12970 function_definition_allowed_p,
12972 declares_class_or_enum,
12974 maybe_range_for_decl,
12977 /* If an error occurred while parsing tentatively, exit quickly.
12978 (That usually happens when in the body of a function; each
12979 statement is treated as a declaration-statement until proven
12980 otherwise.) */
12985 {
12986 /* If the init-declarator-list contains more than one
12987 init-declarator, they shall all form declarations of
12988 variables. */
12990 auto_function_declaration
12994 {
12996 "non-variable %qD in declaration with more than one "
13001 }
13002 }
13006 {
13010 {
13011 /* If the list of declarators contains more than one declarator,
13012 the type of each declared variable is determined as described
13013 above. If the type deduced for the template parameter U is not
13014 the same in each deduction, the program is ill-formed. */
13019 }
13020 else
13022 }
13024 /* Handle function definitions specially. */
13026 {
13027 /* If the next token is a `,', then we are probably
13028 processing something like:
13030 void f() {}, *p;
13032 which is erroneous. */
13034 {
13037 "mixing"
13039 }
13040 /* Otherwise, we're done with the list of declarators. */
13041 else
13042 {
13045 }
13046 }
13049 /* The next token should be either a `,' or a `;'. */
13051 /* If it's a `,', there are more declarators to come. */
13054 /* If it's a `;', we are done. */
13058 {
13063 }
13064 /* Anything else is an error. */
13065 else
13066 {
13067 /* If we have already issued an error message we don't need
13068 to issue another one. */
13073 /* Skip tokens until we reach the end of the statement. */
13075 /* If the next token is now a `;', consume it. */
13079 }
13080 /* After the first time around, a function-definition is not
13081 allowed -- even if it was OK at first. For example:
13083 int i, f() {}
13085 is not valid. */
13087 }
13089 /* Issue an error message if no declarators are present, and the
13090 decl-specifier-seq does not itself declare a class or
13091 enumeration: [dcl.dcl]/3. */
13093 {
13095 {
13099 /* Ensure an error is issued anyway when finish_decltype_type,
13100 called via cp_parser_decl_specifier_seq, returns a class or
13101 an enumeration (c++/51786). */
13104 }
13105 /* Perform any deferred access checks. */
13107 }
13109 /* Consume the `;'. */
13110 finish:
13114 {
13120 }
13122 done:
13124 }
13126 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13127 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13128 initializer ; */
13130 static tree
13135 {
13140 /* Parse the identifier-list. */
13144 {
13152 }
13156 {
13162 else
13163 {
13166 }
13167 }
13173 tree pushed_scope;
13180 NULL_TREE);
13187 cp_expr e;
13188 cp_decl_specifier_seq decl_specs;
13193 {
13196 else
13199 tree elt_pushed_scope;
13205 {
13206 /* Ensure we've diagnosed redeclaration if we aren't creating
13207 a new VAR_DECL. */
13210 }
13211 else
13215 }
13218 {
13221 }
13225 {
13233 || (is_direct_init
13236 {
13240 }
13243 {
13248 }
13249 }
13251 {
13253 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13254 the underlying DECL. */
13256 }
13262 {
13265 }
13268 }
13270 /* Parse a decl-specifier-seq.
13272 decl-specifier-seq:
13273 decl-specifier-seq [opt] decl-specifier
13274 decl-specifier attribute-specifier-seq [opt] (C++11)
13276 decl-specifier:
13277 storage-class-specifier
13278 type-specifier
13279 function-specifier
13280 friend
13281 typedef
13283 GNU Extension:
13285 decl-specifier:
13286 attributes
13288 Concepts Extension:
13290 decl-specifier:
13291 concept
13293 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13295 The parser flags FLAGS is used to control type-specifier parsing.
13297 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13298 flags:
13300 1: one of the decl-specifiers is an elaborated-type-specifier
13301 (i.e., a type declaration)
13302 2: one of the decl-specifiers is an enum-specifier or a
13303 class-specifier (i.e., a type definition)
13305 */
13307 static void
13309 cp_parser_flags flags,
13312 {
13316 cp_decl_spec ds;
13318 /* Clear DECL_SPECS. */
13321 /* Assume no class or enumeration type is declared. */
13324 /* Keep reading specifiers until there are no more to read. */
13326 {
13331 /* Peek at the next token. */
13334 /* Save the first token of the decl spec list for error
13335 reporting. */
13338 /* Handle attributes. */
13340 {
13341 /* Parse the attributes. */
13344 /* In a sequence of declaration specifiers, c++11 attributes
13345 appertain to the type that precede them. In that case
13346 [dcl.spec]/1 says:
13348 The attribute-specifier-seq affects the type only for
13349 the declaration it appears in, not other declarations
13350 involving the same type.
13352 But for now let's force the user to position the
13353 attribute either at the beginning of the declaration or
13354 after the declarator-id, which would clearly mean that it
13355 applies to the declarator. */
13357 {
13359 /* The c++11 attribute is at the beginning of the
13360 declaration. It appertains to the entity being
13362 else
13363 {
13365 {
13366 /* This is an attribute following a
13367 class-specifier. */
13372 }
13373 else
13374 {
13375 decl_specs->std_attributes
13377 attrs);
13380 }
13382 }
13383 }
13385 decl_specs->attributes
13387 attrs);
13391 }
13392 /* Assume we will find a decl-specifier keyword. */
13394 /* If the next token is an appropriate keyword, we can simply
13395 add it to the list. */
13397 {
13398 /* decl-specifier:
13399 friend
13400 constexpr */
13403 {
13408 }
13409 else
13410 {
13412 /* Consume the token. */
13414 }
13427 /* function-specifier:
13428 inline
13429 virtual
13430 explicit */
13437 /* decl-specifier:
13438 typedef */
13441 /* Consume the token. */
13443 /* A constructor declarator cannot appear in a typedef. */
13445 /* The "typedef" keyword can only occur in a declaration; we
13446 may as well commit at this point. */
13453 /* storage-class-specifier:
13454 auto
13455 register
13456 static
13457 extern
13458 mutable
13460 GNU Extension:
13461 thread */
13464 {
13465 /* Consume the token. */
13468 /* Complain about `auto' as a storage specifier, if
13469 we're complaining about C++0x compatibility. */
13473 "%<auto%> changes meaning in C++11; "
13476 /* Set the storage class anyway. */
13478 token);
13479 }
13480 else
13481 /* C++0x auto type-specifier. */
13489 /* Consume the token. */
13492 token);
13495 /* Consume the token. */
13501 /* We did not yet find a decl-specifier yet. */
13504 }
13521 /* Constructors are a special case. The `S' in `S()' is not a
13522 decl-specifier; it is the beginning of the declarator. */
13523 constructor_p
13524 = (!found_decl_spec
13525 && constructor_possible_p
13526 && (cp_parser_constructor_declarator_p
13529 /* If we don't have a DECL_SPEC yet, then we must be looking at
13530 a type-specifier. */
13532 {
13535 tree type_spec;
13537 type_spec
13539 decl_specs,
13545 /* If this type-specifier referenced a user-defined type
13546 (a typedef, class-name, etc.), then we can't allow any
13547 more such type-specifiers henceforth.
13549 [dcl.spec]
13551 The longest sequence of decl-specifiers that could
13552 possibly be a type name is taken as the
13553 decl-specifier-seq of a declaration. The sequence shall
13554 be self-consistent as described below.
13556 [dcl.type]
13558 As a general rule, at most one type-specifier is allowed
13559 in the complete decl-specifier-seq of a declaration. The
13560 only exceptions are the following:
13562 -- const or volatile can be combined with any other
13563 type-specifier.
13565 -- signed or unsigned can be combined with char, long,
13566 short, or int.
13568 -- ..
13570 Example:
13572 typedef char* Pc;
13573 void g (const int Pc);
13575 Here, Pc is *not* part of the decl-specifier seq; it's
13576 the declarator. Therefore, once we see a type-specifier
13577 (other than a cv-qualifier), we forbid any additional
13578 user-defined types. We *do* still allow things like `int
13579 int' to be considered a decl-specifier-seq, and issue the
13580 error message later. */
13583 /* A constructor declarator cannot follow a type-specifier. */
13585 {
13590 }
13591 }
13593 /* If we still do not have a DECL_SPEC, then there are no more
13594 decl-specifiers. */
13599 /* After we see one decl-specifier, further decl-specifiers are
13600 always optional. */
13602 }
13604 /* Don't allow a friend specifier with a class definition. */
13609 }
13611 /* Parse an (optional) storage-class-specifier.
13613 storage-class-specifier:
13614 auto
13615 register
13616 static
13617 extern
13618 mutable
13620 GNU Extension:
13622 storage-class-specifier:
13623 thread
13625 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13627 static tree
13629 {
13631 {
13635 /* Fall through for C++98. */
13643 /* Consume the token. */
13648 }
13649 }
13651 /* Parse an (optional) function-specifier.
13653 function-specifier:
13654 inline
13655 virtual
13656 explicit
13658 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13659 Updates DECL_SPECS, if it is non-NULL. */
13661 static tree
13664 {
13667 {
13673 /* 14.5.2.3 [temp.mem]
13675 A member function template shall not be virtual. */
13679 else
13689 }
13691 /* Consume the token. */
13693 }
13695 /* Parse a linkage-specification.
13697 linkage-specification:
13698 extern string-literal { declaration-seq [opt] }
13699 extern string-literal declaration */
13701 static void
13703 {
13704 tree linkage;
13706 /* Look for the `extern' keyword. */
13707 cp_token *extern_token
13710 /* Look for the string-literal. */
13714 /* Transform the literal into an identifier. If the literal is a
13715 wide-character string, or contains embedded NULs, then we can't
13716 handle it as the user wants. */
13719 {
13721 /* Assume C++ linkage. */
13723 }
13724 else
13727 /* We're now using the new linkage. */
13730 /* Preserve the location of the the innermost linkage specification,
13731 tracking the locations of nested specifications via a local. */
13732 location_t saved_location
13734 /* Construct a location ranging from the start of the "extern" to
13735 the end of the string-literal, with the caret at the start, e.g.:
13736 extern "C" {
13737 ^~~~~~~~~~
13738 */
13739 parser->innermost_linkage_specification_location
13744 /* If the next token is a `{', then we're using the first
13745 production. */
13747 {
13751 /* Consume the `{' token. */
13752 matching_braces braces;
13754 /* Parse the declarations. */
13756 /* Look for the closing `}'. */
13758 }
13759 /* Otherwise, there's just one declaration. */
13760 else
13761 {
13764 saved_in_unbraced_linkage_specification_p
13768 parser->in_unbraced_linkage_specification_p
13770 }
13772 /* We're done with the linkage-specification. */
13775 /* Restore location of parent linkage specification, if any. */
13777 }
13779 /* Parse a static_assert-declaration.
13781 static_assert-declaration:
13782 static_assert ( constant-expression , string-literal ) ;
13783 static_assert ( constant-expression ) ; (C++17)
13785 If MEMBER_P, this static_assert is a class member. */
13787 static void
13789 {
13790 cp_expr condition;
13791 location_t token_loc;
13792 tree message;
13795 /* Peek at the `static_assert' token so we can keep track of exactly
13796 where the static assertion started. */
13799 /* Look for the `static_assert' keyword. */
13801 RT_STATIC_ASSERT))
13804 /* We know we are in a static assertion; commit to any tentative
13805 parse. */
13809 /* Parse the `(' starting the static assertion condition. */
13810 matching_parens parens;
13813 /* Parse the constant-expression. Allow a non-constant expression
13814 here in order to give better diagnostics in finish_static_assert. */
13815 condition =
13821 {
13824 "static_assert without a message "
13826 /* Eat the ')' */
13831 }
13832 else
13833 {
13834 /* Parse the separating `,'. */
13837 /* Parse the string-literal message. */
13842 /* A `)' completes the static assertion. */
13848 }
13850 /* A semicolon terminates the declaration. */
13853 /* Get the location for the static assertion. Use that of the
13854 condition if available, otherwise, use that of the "static_assert"
13855 token. */
13860 /* Complete the static assertion, which may mean either processing
13861 the static assert now or saving it for template instantiation. */
13863 }
13865 /* Parse the expression in decltype ( expression ). */
13867 static tree
13870 {
13872 tree expr;
13874 /* Since we're going to preserve any side-effects from this parse, set up a
13875 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13876 in the expression. */
13879 /* First, try parsing an id-expression. */
13890 {
13893 cp_id_kind idk;
13897 /* Lookup the name we got back from the id-expression. */
13907 {
13908 /* Complete lookup of the id-expression. */
13909 expr = (finish_id_expression
13922 /* We found an id-expression, but it was something that we
13923 should not have found. This is an error, not something
13924 we can recover from, so note that we found an
13925 id-expression and we'll recover as gracefully as
13926 possible. */
13928 }
13933 /* We have an id-expression. */
13935 }
13938 {
13939 /* Abort the id-expression parse. */
13942 /* Parsing tentatively, again. */
13945 /* Parse a class member access. */
13953 /* We have an id-expression. */
13955 }
13958 /* We have parsed the complete id-expression or member access. */
13960 else
13961 {
13962 /* Abort our attempt to parse an id-expression or member access
13963 expression. */
13966 /* Parse a full expression. */
13969 }
13972 }
13974 /* Parse a `decltype' type. Returns the type.
13976 simple-type-specifier:
13977 decltype ( expression )
13978 C++14 proposal:
13979 decltype ( auto ) */
13981 static tree
13983 {
13984 tree expr;
13993 {
13994 /* Already parsed. */
13997 }
13999 /* Look for the `decltype' token. */
14003 /* Parse the opening `('. */
14004 matching_parens parens;
14008 /* decltype (auto) */
14011 {
14018 }
14020 /* Types cannot be defined in a `decltype' expression. Save away the
14021 old message. */
14024 /* And create the new one. */
14025 parser->type_definition_forbidden_message
14028 /* The restrictions on constant-expressions do not apply inside
14029 decltype expressions. */
14030 saved_integral_constant_expression_p
14032 saved_non_integral_constant_expression_p
14036 /* Within a parenthesized expression, a `>' token is always
14037 the greater-than operator. */
14038 saved_greater_than_is_operator_p
14042 /* Do not actually evaluate the expression. */
14045 /* Do not warn about problems with the expression. */
14050 /* Go back to evaluating expressions. */
14054 /* The `>' token might be the end of a template-id or
14055 template-parameter-list now. */
14056 parser->greater_than_is_operator_p
14059 /* Restore the old message and the integral constant expression
14060 flags. */
14062 parser->integral_constant_expression_p
14064 parser->non_integral_constant_expression_p
14067 /* Parse to the closing `)'. */
14069 {
14073 }
14076 tf_warning_or_error);
14078 rewrite:
14079 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14080 it again. */
14089 }
14091 /* Special member functions [gram.special] */
14093 /* Parse a conversion-function-id.
14095 conversion-function-id:
14096 operator conversion-type-id
14098 Returns an IDENTIFIER_NODE representing the operator. */
14100 static tree
14102 {
14103 tree type;
14104 tree saved_scope;
14105 tree saved_qualifying_scope;
14106 tree saved_object_scope;
14109 /* Look for the `operator' token. */
14112 /* When we parse the conversion-type-id, the current scope will be
14113 reset. However, we need that information in able to look up the
14114 conversion function later, so we save it here. */
14118 /* We must enter the scope of the class so that the names of
14119 entities declared within the class are available in the
14120 conversion-type-id. For example, consider:
14122 struct S {
14123 typedef int I;
14124 operator I();
14125 };
14127 S::operator I() { ... }
14129 In order to see that `I' is a type-name in the definition, we
14130 must be in the scope of `S'. */
14133 /* Parse the conversion-type-id. */
14135 /* Leave the scope of the class, if any. */
14138 /* Restore the saved scope. */
14142 /* If the TYPE is invalid, indicate failure. */
14146 }
14148 /* Parse a conversion-type-id:
14150 conversion-type-id:
14151 type-specifier-seq conversion-declarator [opt]
14153 Returns the TYPE specified. */
14155 static tree
14157 {
14158 tree attributes;
14159 cp_decl_specifier_seq type_specifiers;
14161 tree type_specified;
14164 /* Parse the attributes. */
14168 parser->type_definition_forbidden_message
14171 /* Parse the type-specifiers. */
14178 /* If that didn't work, stop. */
14181 /* Parse the conversion-declarator. */
14189 /* Don't give this error when parsing tentatively. This happens to
14190 work because we always parse this definitively once. */
14193 {
14195 {
14198 }
14202 }
14205 }
14207 /* Parse an (optional) conversion-declarator.
14209 conversion-declarator:
14210 ptr-operator conversion-declarator [opt]
14212 */
14216 {
14219 cp_cv_quals cv_quals;
14221 /* We don't know if there's a ptr-operator next, or not. */
14223 /* Try the ptr-operator. */
14226 /* If it worked, look for more conversion-declarators. */
14228 {
14231 /* Parse another optional declarator. */
14234 declarator = cp_parser_make_indirect_declarator
14238 }
14241 }
14243 /* Parse an (optional) ctor-initializer.
14245 ctor-initializer:
14246 : mem-initializer-list */
14248 static void
14250 {
14251 /* If the next token is not a `:', then there is no
14252 ctor-initializer. */
14254 {
14255 /* Do default initialization of any bases and members. */
14259 }
14261 /* Consume the `:' token. */
14263 /* And the mem-initializer-list. */
14265 }
14267 /* Parse a mem-initializer-list.
14269 mem-initializer-list:
14270 mem-initializer ... [opt]
14271 mem-initializer ... [opt] , mem-initializer-list */
14273 static void
14275 {
14280 /* Let the semantic analysis code know that we are starting the
14281 mem-initializer-list. */
14286 /* Loop through the list. */
14288 {
14289 tree mem_initializer;
14292 /* Parse the mem-initializer. */
14294 /* If the next token is a `...', we're expanding member initializers. */
14296 {
14297 /* Consume the `...'. */
14300 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14301 can be expanded but members cannot. */
14304 {
14309 }
14311 /* Construct the pack expansion type. */
14314 }
14317 {
14321 }
14322 /* Look for a target constructor. */
14326 {
14329 {
14333 }
14335 }
14336 /* Add it to the list, unless it was erroneous. */
14338 {
14341 }
14342 /* If the next token is not a `,', we're done. */
14345 /* Consume the `,' token. */
14347 }
14349 /* Perform semantic analysis. */
14352 }
14354 /* Parse a mem-initializer.
14356 mem-initializer:
14357 mem-initializer-id ( expression-list [opt] )
14358 mem-initializer-id braced-init-list
14360 GNU extension:
14362 mem-initializer:
14363 ( expression-list [opt] )
14365 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14366 class) or FIELD_DECL (for a non-static data member) to initialize;
14367 the TREE_VALUE is the expression-list. An empty initialization
14368 list is represented by void_list_node. */
14370 static tree
14372 {
14373 tree mem_initializer_id;
14374 tree expression_list;
14375 tree member;
14378 /* Find out what is being initialized. */
14380 {
14384 }
14385 else
14386 {
14390 }
14396 {
14403 }
14404 else
14405 {
14415 }
14425 }
14427 /* Parse a mem-initializer-id.
14429 mem-initializer-id:
14430 :: [opt] nested-name-specifier [opt] class-name
14431 decltype-specifier (C++11)
14432 identifier
14434 Returns a TYPE indicating the class to be initialized for the first
14435 production (and the second in C++11). Returns an IDENTIFIER_NODE
14436 indicating the data member to be initialized for the last production. */
14438 static tree
14440 {
14444 tree id;
14448 /* `typename' is not allowed in this context ([temp.res]). */
14450 {
14452 "keyword %<typename%> not allowed in this context (a qualified "
14455 }
14456 /* Look for the optional `::' operator. */
14457 global_scope_p
14461 /* Look for the optional nested-name-specifier. The simplest way to
14462 implement:
14464 [temp.res]
14466 The keyword `typename' is not permitted in a base-specifier or
14467 mem-initializer; in these contexts a qualified name that
14468 depends on a template-parameter is implicitly assumed to be a
14469 type name.
14471 is to assume that we have seen the `typename' keyword at this
14472 point. */
14473 nested_name_specifier_p
14482 /* If there is a `::' operator or a nested-name-specifier, then we
14483 are definitely looking for a class-name. */
14488 typename_type,
14492 /* Otherwise, we could also be looking for an ordinary identifier. */
14495 /* Try a decltype-specifier. */
14497 else
14498 /* Otherwise, try a class-name. */
14502 none_type,
14506 /* If we found one, we're done. */
14509 /* Otherwise, look for an ordinary identifier. */
14511 }
14513 /* Overloading [gram.over] */
14515 /* Parse an operator-function-id.
14517 operator-function-id:
14518 operator operator
14520 Returns an IDENTIFIER_NODE for the operator which is a
14521 human-readable spelling of the identifier, e.g., `operator +'. */
14523 static cp_expr
14525 {
14526 /* Look for the `operator' keyword. */
14529 /* And then the name of the operator itself. */
14531 }
14533 /* Return an identifier node for a user-defined literal operator.
14534 The suffix identifier is chained to the operator name identifier. */
14536 tree
14538 {
14539 tree identifier;
14546 }
14548 /* Parse an operator.
14550 operator:
14551 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14552 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14553 || ++ -- , ->* -> () []
14555 GNU Extensions:
14557 operator:
14558 <? >? <?= >?=
14560 Returns an IDENTIFIER_NODE for the operator which is a
14561 human-readable spelling of the identifier, e.g., `operator +'. */
14563 static cp_expr
14565 {
14570 /* Peek at the next token. */
14575 /* Figure out which operator we have. */
14580 {
14582 {
14583 /* The keyword should be either `new' or `delete'. */
14588 else
14591 /* Consume the `new' or `delete' token. */
14594 /* Peek at the next token. */
14596 /* If it's a `[' token then this is the array variant of the
14597 operator. */
14599 {
14600 /* Consume the `[' token. */
14602 /* Look for the `]' token. */
14607 }
14611 }
14769 {
14770 /* Consume the `('. */
14771 matching_parens parens;
14773 /* Look for the matching `)'. */
14778 }
14781 /* Consume the `['. */
14783 /* Look for the matching `]'. */
14792 /* FALLTHRU */
14801 {
14808 /* Consume the string. */
14814 {
14817 }
14818 else
14819 {
14821 /* Look for the suffix identifier. */
14826 {
14830 }
14831 else
14832 {
14835 }
14836 }
14841 {
14844 }
14847 {
14850 }
14852 {
14855 }
14857 }
14860 /* Anything else is an error. */
14862 }
14864 /* If we have selected an identifier, we need to consume the
14865 operator token. */
14867 {
14871 }
14872 /* Otherwise, no valid operator name was present. */
14873 else
14874 {
14877 }
14880 }
14882 /* Parse a template-declaration.
14884 template-declaration:
14885 export [opt] template < template-parameter-list > declaration
14887 If MEMBER_P is TRUE, this template-declaration occurs within a
14888 class-specifier.
14890 The grammar rule given by the standard isn't correct. What
14891 is really meant is:
14893 template-declaration:
14894 export [opt] template-parameter-list-seq
14895 decl-specifier-seq [opt] init-declarator [opt] ;
14896 export [opt] template-parameter-list-seq
14897 function-definition
14899 template-parameter-list-seq:
14900 template-parameter-list-seq [opt]
14901 template < template-parameter-list >
14903 Concept Extensions:
14905 template-parameter-list-seq:
14906 template < template-parameter-list > requires-clause [opt]
14908 requires-clause:
14909 requires logical-or-expression */
14911 static void
14913 {
14914 /* Check for `export'. */
14916 {
14917 /* Consume the `export' token. */
14919 /* Warn that we do not support `export'. */
14921 }
14924 }
14926 /* Parse a template-parameter-list.
14928 template-parameter-list:
14929 template-parameter
14930 template-parameter-list , template-parameter
14932 Returns a TREE_LIST. Each node represents a template parameter.
14933 The nodes are connected via their TREE_CHAINs. */
14935 static tree
14937 {
14942 /* The loop below parses the template parms. We first need to know
14943 the total number of template parms to be able to compute proper
14944 canonical types of each dependent type. So after the loop, when
14945 we know the total number of template parms,
14946 end_template_parm_list computes the proper canonical types and
14947 fixes up the dependent types accordingly. */
14949 {
14950 tree parameter;
14953 location_t parm_loc;
14955 /* Parse the template-parameter. */
14960 /* Add it to the list. */
14963 parm_loc,
14964 parameter,
14965 is_non_type,
14966 is_parameter_pack);
14967 else
14968 {
14971 }
14973 /* If the next token is not a `,', we're done. */
14976 /* Otherwise, consume the `,' token. */
14978 }
14981 }
14983 /* Parse a introduction-list.
14985 introduction-list:
14986 introduced-parameter
14987 introduction-list , introduced-parameter
14989 introduced-parameter:
14990 ...[opt] identifier
14992 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14993 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14994 WILDCARD_DECL will also have DECL_NAME set and token location in
14995 DECL_SOURCE_LOCATION. */
14997 static tree
14999 {
15003 {
15008 /* Build placeholder. */
15016 /* If the next token is not a `,', we're done. */
15019 /* Otherwise, consume the `,' token. */
15021 }
15023 /* Convert the vec into a TREE_VEC. */
15026 tree parm;
15032 }
15034 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15035 is an abstract declarator. */
15039 {
15044 }
15046 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15047 is an abstract declarator. */
15051 {
15055 else
15057 }
15059 /* Returns true if DECL represents a constrained-parameter. */
15063 {
15068 }
15070 /* Returns true if PARM declares a constrained-parameter. */
15074 {
15076 }
15078 /* Check that the type parameter is only a declarator-id, and that its
15079 type is not cv-qualified. */
15081 bool
15084 {
15089 {
15092 }
15094 /* Don't allow cv-qualified type parameters. */
15097 {
15100 }
15103 }
15105 /* Finish parsing/processing a template type parameter and checking
15106 various restrictions. */
15110 tree id,
15112 {
15115 else
15117 }
15119 static tree
15121 {
15122 /* FIXME: This should probably be copied, and we may need to adjust
15123 the template parameter depths. */
15133 }
15135 /* Finish parsing/processing a template template parameter by borrowing
15136 the template parameter list from the prototype parameter. */
15138 static tree
15140 tree proto,
15141 tree id,
15143 {
15147 }
15149 /* Create a new non-type template parameter from the given PARM
15150 declarator. */
15152 static tree
15155 {
15161 }
15163 /* Build a constrained template parameter based on the PARMDECL
15164 declarator. The type of PARMDECL is the constrained type, which
15165 refers to the prototype template parameter that ultimately
15166 specifies the type of the declared parameter. */
15168 static tree
15173 {
15179 /* A template parameter constrained by a variadic concept shall also
15180 be declared as a template parameter pack. */
15185 /* Build the parameter. Return an error if the declarator was invalid. */
15186 tree parm;
15191 parmdecl);
15192 else
15197 /* Finish the parameter decl and create a node attaching the
15198 default argument and constraint. */
15203 }
15205 /* Returns true if the parsed type actually represents the declaration
15206 of a type template-parameter. */
15210 {
15213 }
15216 /* Returns true if the parsed type actually represents the declaration of
15217 a template template-parameter. */
15219 static bool
15221 {
15224 }
15226 /* Parse a default argument for a type template-parameter.
15227 Note that diagnostics are handled in cp_parser_template_parameter. */
15229 static tree
15231 {
15234 /* Consume the `=' token. */
15239 /* Parse the default-argument. */
15245 {
15249 }
15252 }
15254 /* Parse a default argument for a template template-parameter. */
15256 static tree
15258 {
15263 /* Consume the `='. */
15265 /* Parse the id-expression. */
15267 /* save token before parsing the id-expression, for error
15268 reporting */
15270 tree default_argument
15278 /* If the id-expression was a template-id that refers to
15279 a template-class, we already have the declaration here,
15280 so no further lookup is needed. */
15281 ;
15282 else
15283 /* Look up the name. */
15284 default_argument
15286 none_type,
15292 /* See if the default argument is valid. */
15296 }
15298 /* Parse a template-parameter.
15300 template-parameter:
15301 type-parameter
15302 parameter-declaration
15304 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15305 the parameter. The TREE_PURPOSE is the default value, if any.
15306 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15307 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15308 set to true iff this parameter is a parameter pack. */
15310 static tree
15313 {
15316 tree parm;
15318 /* Assume it is a type parameter or a template parameter. */
15320 /* Assume it not a parameter pack. */
15322 /* Peek at the next token. */
15324 /* If it is `template', we have a type-parameter. */
15327 /* If it is `class' or `typename' we do not know yet whether it is a
15328 type parameter or a non-type parameter. Consider:
15330 template <typename T, typename T::X X> ...
15332 or:
15334 template <class C, class D*> ...
15336 Here, the first parameter is a type parameter, and the second is
15337 a non-type parameter. We can tell by looking at the token after
15338 the identifier -- if it is a `,', `=', or `>' then we have a type
15339 parameter. */
15341 {
15342 /* Peek at the token after `class' or `typename'. */
15344 /* If it's an ellipsis, we have a template type parameter
15345 pack. */
15348 /* If it's an identifier, skip it. */
15351 /* Now, see if the token looks like the end of a template
15352 parameter. */
15357 }
15359 /* Otherwise, it is a non-type parameter or a constrained parameter.
15361 [temp.param]
15363 When parsing a default template-argument for a non-type
15364 template-parameter, the first non-nested `>' is taken as the end
15365 of the template parameter-list rather than a greater-than
15366 operator. */
15367 parameter_declarator
15374 /* If the parameter declaration is marked as a parameter pack, set
15375 *IS_PARAMETER_PACK to notify the caller. */
15380 {
15381 /* Can happen in some cases of erroneous input (c++/34892). */
15383 /* Consume the `...' for better error recovery. */
15385 }
15387 // The parameter may have been constrained.
15390 parameter_declarator,
15391 is_non_type,
15392 is_parameter_pack);
15394 // Now we're sure that the parameter is a non-type parameter.
15405 }
15407 /* Parse a type-parameter.
15409 type-parameter:
15410 class identifier [opt]
15411 class identifier [opt] = type-id
15412 typename identifier [opt]
15413 typename identifier [opt] = type-id
15414 template < template-parameter-list > class identifier [opt]
15415 template < template-parameter-list > class identifier [opt]
15416 = id-expression
15418 GNU Extension (variadic templates):
15420 type-parameter:
15421 class ... identifier [opt]
15422 typename ... identifier [opt]
15424 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15425 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15426 the declaration of the parameter.
15428 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15430 static tree
15432 {
15434 tree parameter;
15436 /* Look for a keyword to tell us what kind of parameter this is. */
15442 {
15445 {
15446 tree identifier;
15447 tree default_argument;
15449 /* If the next token is an ellipsis, we have a template
15450 argument pack. */
15452 {
15453 /* Consume the `...' token. */
15458 }
15460 /* If the next token is an identifier, then it names the
15461 parameter. */
15464 else
15467 /* Create the parameter. */
15470 /* If the next token is an `=', we have a default argument. */
15472 {
15473 default_argument
15476 /* Template parameter packs cannot have default
15477 arguments. */
15479 {
15482 "template parameter pack %qD cannot have a "
15484 else
15486 "template parameter packs cannot have "
15489 }
15492 }
15493 else
15496 /* Create the combined representation of the parameter and the
15497 default argument. */
15499 }
15503 {
15504 tree identifier;
15505 tree default_argument;
15507 /* Look for the `<'. */
15509 /* Parse the template-parameter-list. */
15511 /* Look for the `>'. */
15514 // If template requirements are present, parse them.
15516 {
15521 }
15523 /* Look for the `class' or 'typename' keywords. */
15525 /* If the next token is an ellipsis, we have a template
15526 argument pack. */
15528 {
15529 /* Consume the `...' token. */
15534 }
15535 /* If the next token is an `=', then there is a
15536 default-argument. If the next token is a `>', we are at
15537 the end of the parameter-list. If the next token is a `,',
15538 then we are at the end of this parameter. */
15542 {
15544 /* Treat invalid names as if the parameter were nameless. */
15547 }
15548 else
15551 /* Create the template parameter. */
15553 identifier);
15555 /* If the next token is an `=', then there is a
15556 default-argument. */
15558 {
15559 default_argument
15562 /* Template parameter packs cannot have default
15563 arguments. */
15565 {
15568 "template parameter pack %qD cannot "
15570 identifier);
15571 else
15575 }
15576 }
15577 else
15580 /* Create the combined representation of the parameter and the
15581 default argument. */
15583 }
15589 }
15592 }
15594 /* Parse a template-id.
15596 template-id:
15597 template-name < template-argument-list [opt] >
15599 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15600 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15601 returned. Otherwise, if the template-name names a function, or set
15602 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15603 names a class, returns a TYPE_DECL for the specialization.
15605 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15606 uninstantiated templates. */
15608 static tree
15614 {
15615 tree templ;
15616 tree arguments;
15617 tree template_id;
15622 /* If the next token corresponds to a template-id, there is no need
15623 to reparse it. */
15626 {
15629 }
15631 /* Avoid performing name lookup if there is no possibility of
15632 finding a template-id. */
15635 && !cp_parser_nth_token_starts_template_argument_list_p
15637 {
15640 }
15642 /* Remember where the template-id starts. */
15648 /* Parse the template-name. */
15651 check_dependency_p,
15652 is_declaration,
15653 tag_type,
15656 {
15659 }
15661 /* Since we're going to preserve any side-effects from this parse, set up a
15662 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15663 in the template arguments. */
15666 /* If we find the sequence `[:' after a template-name, it's probably
15667 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15668 parse correctly the argument list. */
15675 {
15677 /* Change `:' into `::'. */
15679 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15680 CPP_LESS. */
15683 /* Parse the arguments. */
15686 {
15687 /* If we couldn't parse an argument list, then we revert our changes
15688 and return simply an error. Maybe this is not a template-id
15689 after all. */
15694 }
15695 /* Otherwise, emit an error about the invalid digraph, but continue
15696 parsing because we got our argument list. */
15699 {
15702 "%<<:%> is an alternate spelling for %<[%>."
15705 {
15707 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15710 }
15711 }
15712 }
15713 else
15714 {
15715 /* Look for the `<' that starts the template-argument-list. */
15717 {
15720 }
15721 /* Parse the arguments. */
15723 }
15725 /* Set the location to be of the form:
15726 template-name < template-argument-list [opt] >
15727 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15728 with caret == start at the start of the template-name,
15729 ranging until the closing '>'. */
15730 location_t finish_loc
15732 location_t combined_loc
15735 /* Build a representation of the specialization. */
15738 TEMPLATE_ID_EXPR,
15742 {
15744 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15745 template (rather than some instantiation thereof) only if
15746 is not nested within some other construct. For example, in
15747 "template <typename T> void f(T) { A<T>::", A<T> is just an
15748 instantiation of A. */
15751 CPP_SCOPE));
15752 template_id
15754 }
15755 /* A template-like identifier may be a partial concept id. */
15761 {
15765 }
15766 else
15767 {
15768 /* If it's not a class-template or a template-template, it should be
15769 a function-template. */
15777 }
15779 /* If parsing tentatively, replace the sequence of tokens that makes
15780 up the template-id with a CPP_TEMPLATE_ID token. That way,
15781 should we re-parse the token stream, we will not have to repeat
15782 the effort required to do the parse, nor will we issue duplicate
15783 error messages about problems during instantiation of the
15784 template. */
15786 /* Don't do this if we had a parse error in a declarator; re-parsing
15787 might succeed if a name changes meaning (60361). */
15791 {
15792 /* Reset the contents of the START_OF_ID token. */
15796 /* We must mark the lookup as kept, so we don't throw it away on
15797 the first parse. */
15801 /* Retrieve any deferred checks. Do not pop this access checks yet
15802 so the memory will not be reclaimed during token replacing below. */
15808 /* Purge all subsequent tokens. */
15811 /* ??? Can we actually assume that, if template_id ==
15812 error_mark_node, we will have issued a diagnostic to the
15813 user, as opposed to simply marking the tentative parse as
15814 failed? */
15817 }
15821 }
15823 /* Parse a template-name.
15825 template-name:
15826 identifier
15828 The standard should actually say:
15830 template-name:
15831 identifier
15832 operator-function-id
15834 A defect report has been filed about this issue.
15836 A conversion-function-id cannot be a template name because they cannot
15837 be part of a template-id. In fact, looking at this code:
15839 a.operator K<int>()
15841 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15842 It is impossible to call a templated conversion-function-id with an
15843 explicit argument list, since the only allowed template parameter is
15844 the type to which it is converting.
15846 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15847 `template' keyword, in a construction like:
15849 T::template f<3>()
15851 In that case `f' is taken to be a template-name, even though there
15852 is no way of knowing for sure.
15854 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15855 name refers to a set of overloaded functions, at least one of which
15856 is a template, or an IDENTIFIER_NODE with the name of the template,
15857 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15858 names are looked up inside uninstantiated templates. */
15860 static tree
15867 {
15868 tree identifier;
15869 tree decl;
15872 /* If the next token is `operator', then we have either an
15873 operator-function-id or a conversion-function-id. */
15875 {
15876 /* We don't know whether we're looking at an
15877 operator-function-id or a conversion-function-id. */
15879 /* Try an operator-function-id. */
15881 /* If that didn't work, try a conversion-function-id. */
15883 {
15886 }
15887 }
15888 /* Look for the identifier. */
15889 else
15892 /* If we didn't find an identifier, we don't have a template-id. */
15896 /* If the name immediately followed the `template' keyword, then it
15897 is a template-name. However, if the next token is not `<', then
15898 we do not treat it as a template-name, since it is not being used
15899 as part of a template-id. This enables us to handle constructs
15900 like:
15902 template <typename T> struct S { S(); };
15903 template <typename T> S<T>::S();
15905 correctly. We would treat `S' as a template -- if it were `S<T>'
15906 -- but we do not if there is no `<'. */
15910 {
15911 /* In a declaration, in a dependent context, we pretend that the
15912 "template" keyword was present in order to improve error
15913 recovery. For example, given:
15915 template <typename T> void f(T::X<int>);
15917 we want to treat "X<int>" as a template-id. */
15919 && !template_keyword_p
15921 && check_dependency_p
15923 /* Do not do this for dtors (or ctors), since they never
15924 need the template keyword before their name. */
15926 {
15929 /* Explain what went wrong. */
15931 identifier);
15934 /* If parsing tentatively, find the location of the "<" token. */
15937 /* Parse the template arguments so that we can issue error
15938 messages about them. */
15941 /* Skip tokens until we find a good place from which to
15942 continue parsing. */
15947 /* If parsing tentatively, permanently remove the
15948 template argument list. That will prevent duplicate
15949 error messages from being issued about the missing
15950 "template" keyword. */
15957 }
15959 /* If the "template" keyword is present, then there is generally
15960 no point in doing name-lookup, so we just return IDENTIFIER.
15961 But, if the qualifying scope is non-dependent then we can
15962 (and must) do name-lookup normally. */
15964 {
15970 {
15971 /* We're optimizing away the call to cp_parser_lookup_name, but
15972 we still need to do this. */
15975 }
15976 }
15977 }
15979 /* Look up the name. */
15981 tag_type,
15984 check_dependency_p,
15990 /* If DECL is a template, then the name was a template-name. */
15992 {
15996 }
15997 else
15998 {
15999 /* The standard does not explicitly indicate whether a name that
16000 names a set of overloaded declarations, some of which are
16001 templates, is a template-name. However, such a name should
16002 be a template-name; otherwise, there is no way to form a
16003 template-id for the overloaded templates. */
16012 {
16013 /* The name does not name a template. */
16016 }
16017 }
16019 /* If DECL is dependent, and refers to a function, then just return
16020 its name; we will look it up again during template instantiation. */
16022 {
16026 }
16029 }
16031 /* Parse a template-argument-list.
16033 template-argument-list:
16034 template-argument ... [opt]
16035 template-argument-list , template-argument ... [opt]
16037 Returns a TREE_VEC containing the arguments. */
16039 static tree
16041 {
16046 tree vec;
16053 /* Even if the template-id appears in an integral
16054 constant-expression, the contents of the argument list do
16055 not. */
16061 /* Parse the arguments. */
16062 do
16063 {
16064 tree argument;
16067 /* Consume the comma. */
16070 /* Parse the template-argument. */
16073 /* If the next token is an ellipsis, we're expanding a template
16074 argument pack. */
16076 {
16078 {
16082 }
16083 /* Consume the `...' token. */
16086 /* Make the argument into a TYPE_PACK_EXPANSION or
16087 EXPR_PACK_EXPANSION. */
16089 }
16092 {
16096 {
16099 }
16100 else
16102 }
16104 }
16120 }
16122 /* Parse a template-argument.
16124 template-argument:
16125 assignment-expression
16126 type-id
16127 id-expression
16129 The representation is that of an assignment-expression, type-id, or
16130 id-expression -- except that the qualified id-expression is
16131 evaluated, so that the value returned is either a DECL or an
16132 OVERLOAD.
16134 Although the standard says "assignment-expression", it forbids
16135 throw-expressions or assignments in the template argument.
16136 Therefore, we use "conditional-expression" instead. */
16138 static tree
16140 {
16141 tree argument;
16147 cp_id_kind idk;
16149 /* There's really no way to know what we're looking at, so we just
16150 try each alternative in order.
16152 [temp.arg]
16154 In a template-argument, an ambiguity between a type-id and an
16155 expression is resolved to a type-id, regardless of the form of
16156 the corresponding template-parameter.
16158 Therefore, we try a type-id first. */
16161 /* If there was no error parsing the type-id but the next token is a
16162 '>>', our behavior depends on which dialect of C++ we're
16163 parsing. In C++98, we probably found a typo for '> >'. But there
16164 are type-id which are also valid expressions. For instance:
16166 struct X { int operator >> (int); };
16167 template <int V> struct Foo {};
16168 Foo<X () >> 5> r;
16170 Here 'X()' is a valid type-id of a function type, but the user just
16171 wanted to write the expression "X() >> 5". Thus, we remember that we
16172 found a valid type-id, but we still try to parse the argument as an
16173 expression to see what happens.
16175 In C++0x, the '>>' will be considered two separate '>'
16176 tokens. */
16180 {
16183 }
16184 else
16185 {
16186 /* If the next token isn't a `,' or a `>', then this argument wasn't
16187 really finished. This means that the argument is not a valid
16188 type-id. */
16191 /* If that worked, we're done. */
16194 }
16195 /* We're still not sure what the argument will be. */
16197 /* Try a template. */
16205 /* If the next token isn't a `,' or a `>', then this argument wasn't
16206 really finished. */
16210 {
16211 /* Figure out what is being referred to. If the id-expression
16212 was for a class template specialization, then we will have a
16213 TYPE_DECL at this point. There is no need to do name lookup
16214 at this point in that case. */
16217 none_type,
16223 /* Handle a constrained-type-specifier for a non-type template
16224 parameter. */
16230 }
16232 {
16236 }
16237 /* It must be a non-type argument. In C++17 any constant-expression is
16238 allowed. */
16242 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16244 -- an integral constant-expression of integral or enumeration
16245 type; or
16247 -- the name of a non-type template-parameter; or
16249 -- the name of an object or function with external linkage...
16251 -- the address of an object or function with external linkage...
16253 -- a pointer to member... */
16254 /* Look for a non-type template parameter. */
16256 {
16268 }
16270 /* If the next token is "&", the argument must be the address of an
16271 object or function with external linkage. */
16274 {
16277 }
16278 /* See if we might have an id-expression. */
16285 {
16288 address_p,
16295 else
16296 {
16297 tree probe;
16300 {
16301 /* Strip the dereference temporarily. */
16304 }
16306 /* If we're in a template, we represent a qualified-id referring
16307 to a static data member as a SCOPE_REF even if the scope isn't
16308 dependent so that we can check access control later. */
16313 {
16314 /* A variable without external linkage might still be a
16315 valid constant-expression, so no error is issued here
16316 if the external-linkage check fails. */
16319 }
16321 /* All overloaded functions are allowed; if the external
16322 linkage test does not pass, an error will be issued
16323 later. */
16324 ;
16328 /* A pointer-to-member. */
16329 ;
16331 ;
16332 else
16336 {
16339 tf_warning_or_error);
16340 else
16343 }
16344 }
16345 }
16346 /* If the argument started with "&", there are no other valid
16347 alternatives at this point. */
16349 {
16352 }
16354 general_expr:
16355 /* If the argument wasn't successfully parsed as a type-id followed
16356 by '>>', the argument can only be a constant expression now.
16357 Otherwise, we try parsing the constant-expression tentatively,
16358 because the argument could really be a type-id. */
16364 else
16365 {
16366 /* With C++17 generalized non-type template arguments we need to handle
16367 lvalue constant expressions, too. */
16370 }
16378 /* We did our best to parse the argument as a non type-id, but that
16379 was the only alternative that matched (albeit with a '>' after
16380 it). We can assume it's just a typo from the user, and a
16381 diagnostic will then be issued. */
16383 }
16385 /* Parse an explicit-instantiation.
16387 explicit-instantiation:
16388 template declaration
16390 Although the standard says `declaration', what it really means is:
16392 explicit-instantiation:
16393 template decl-specifier-seq [opt] declarator [opt] ;
16395 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16396 supposed to be allowed. A defect report has been filed about this
16397 issue.
16399 GNU Extension:
16401 explicit-instantiation:
16402 storage-class-specifier template
16403 decl-specifier-seq [opt] declarator [opt] ;
16404 function-specifier template
16405 decl-specifier-seq [opt] declarator [opt] ; */
16407 static void
16409 {
16411 cp_decl_specifier_seq decl_specifiers;
16416 /* Look for an (optional) storage-class-specifier or
16417 function-specifier. */
16419 {
16420 extension_specifier
16423 extension_specifier
16426 }
16428 /* Look for the `template' keyword. */
16430 /* Let the front end know that we are processing an explicit
16431 instantiation. */
16433 /* [temp.explicit] says that we are supposed to ignore access
16434 control while processing explicit instantiation directives. */
16436 /* Parse a decl-specifier-seq. */
16438 CP_PARSER_FLAGS_OPTIONAL,
16441 /* If there was exactly one decl-specifier, and it declared a class,
16442 and there's no declarator, then we have an explicit type
16443 instantiation. */
16445 {
16446 tree type;
16450 /* Turn access control back on for names used during
16451 template instantiation. */
16456 }
16457 else
16458 {
16460 tree decl;
16462 /* Parse the declarator. */
16463 declarator
16474 {
16477 "explicit instantiation shall not use"
16481 "explicit instantiation shall not use"
16486 /* Turn access control back on for names used during
16487 template instantiation. */
16489 /* Do the explicit instantiation. */
16491 }
16492 else
16493 {
16495 /* Skip the body of the explicit instantiation. */
16497 }
16498 }
16499 /* We're done with the instantiation. */
16505 }
16507 /* Parse an explicit-specialization.
16509 explicit-specialization:
16510 template < > declaration
16512 Although the standard says `declaration', what it really means is:
16514 explicit-specialization:
16515 template <> decl-specifier [opt] init-declarator [opt] ;
16516 template <> function-definition
16517 template <> explicit-specialization
16518 template <> template-declaration */
16520 static void
16522 {
16526 /* Look for the `template' keyword. */
16528 /* Look for the `<'. */
16530 /* Look for the `>'. */
16532 /* We have processed another parameter list. */
16534 /* [temp]
16536 A template ... explicit specialization ... shall not have C
16537 linkage. */
16539 {
16542 /* Give it C++ linkage to avoid confusing other parts of the
16543 front end. */
16546 }
16547 else
16549 /* Let the front end know that we are beginning a specialization. */
16551 {
16554 }
16556 /* If the next keyword is `template', we need to figure out whether
16557 or not we're looking a template-declaration. */
16559 {
16564 else
16566 }
16567 else
16568 /* Parse the dependent declaration. */
16574 /* We're done with the specialization. */
16576 /* For the erroneous case of a template with C linkage, we pushed an
16577 implicit C++ linkage scope; exit that scope now. */
16580 /* We're done with this parameter list. */
16582 }
16584 /* Parse a type-specifier.
16586 type-specifier:
16587 simple-type-specifier
16588 class-specifier
16589 enum-specifier
16590 elaborated-type-specifier
16591 cv-qualifier
16593 GNU Extension:
16595 type-specifier:
16596 __complex__
16598 Returns a representation of the type-specifier. For a
16599 class-specifier, enum-specifier, or elaborated-type-specifier, a
16600 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16602 The parser flags FLAGS is used to control type-specifier parsing.
16604 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16605 in a decl-specifier-seq.
16607 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16608 class-specifier, enum-specifier, or elaborated-type-specifier, then
16609 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16610 if a type is declared; 2 if it is defined. Otherwise, it is set to
16611 zero.
16613 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16614 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16615 is set to FALSE. */
16617 static tree
16619 cp_parser_flags flags,
16624 {
16630 /* Assume this type-specifier does not declare a new type. */
16633 /* And that it does not specify a cv-qualifier. */
16636 /* Peek at the next token. */
16639 /* If we're looking at a keyword, we can use that to guide the
16640 production we choose. */
16643 {
16648 /* Look for the enum-specifier. */
16650 /* If that worked, we're done. */
16652 {
16657 type_spec,
16658 token,
16661 }
16662 else
16665 /* Any of these indicate either a class-specifier, or an
16666 elaborated-type-specifier. */
16673 /* Parse tentatively so that we can back up if we don't find a
16674 class-specifier. */
16676 /* Look for the class-specifier. */
16679 /* If that worked, we're done. */
16681 {
16686 type_spec,
16687 token,
16690 }
16692 /* Fall through. */
16693 elaborated_type_specifier:
16694 /* We're declaring (not defining) a class or enum. */
16698 /* Fall through. */
16700 /* Look for an elaborated-type-specifier. */
16701 type_spec
16702 = (cp_parser_elaborated_type_specifier
16705 is_declaration));
16708 type_spec,
16709 token,
16732 /* The `__complex__' keyword is a GNU extension. */
16738 }
16740 /* Handle simple keywords. */
16742 {
16744 {
16747 }
16749 }
16751 /* If we do not already have a type-specifier, assume we are looking
16752 at a simple-type-specifier. */
16754 decl_specs,
16755 flags);
16757 /* If we didn't find a type-specifier, and a type-specifier was not
16758 optional in this context, issue an error message. */
16760 {
16763 }
16766 }
16768 /* Parse a simple-type-specifier.
16770 simple-type-specifier:
16771 :: [opt] nested-name-specifier [opt] type-name
16772 :: [opt] nested-name-specifier template template-id
16773 char
16774 wchar_t
16775 bool
16776 short
16777 int
16778 long
16779 signed
16780 unsigned
16781 float
16782 double
16783 void
16785 C++11 Extension:
16787 simple-type-specifier:
16788 auto
16789 decltype ( expression )
16790 char16_t
16791 char32_t
16792 __underlying_type ( type-id )
16794 C++17 extension:
16796 nested-name-specifier(opt) template-name
16798 GNU Extension:
16800 simple-type-specifier:
16801 __int128
16802 __typeof__ unary-expression
16803 __typeof__ ( type-id )
16804 __typeof__ ( type-id ) { initializer-list , [opt] }
16806 Concepts Extension:
16808 simple-type-specifier:
16809 constrained-type-specifier
16811 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16812 appropriately updated. */
16814 static tree
16817 cp_parser_flags flags)
16818 {
16823 /* Peek at the next token. */
16826 /* If we're looking at a keyword, things are easy. */
16828 {
16863 {
16866 }
16895 {
16896 /* The 'auto' might be the placeholder return type for a function decl
16897 with trailing return type. */
16906 {
16908 {
16915 }
16918 {
16921 }
16924 }
16928 {
16931 }
16934 {
16937 }
16938 else
16942 {
16945 "use of %<auto%> in lambda parameter declaration "
16946 "only available with "
16948 }
16951 "use of %<auto%> in parameter declaration "
16952 "only available with "
16956 "ISO C++ forbids use of %<auto%> in parameter "
16958 }
16959 else
16964 /* Since DR 743, decltype can either be a simple-type-specifier by
16965 itself or begin a nested-name-specifier. Parsing it will replace
16966 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16967 handling below decide what to do. */
16973 /* Consume the `typeof' token. */
16975 /* Parse the operand to `typeof'. */
16977 /* If it is not already a TYPE, take its type. */
16983 token,
16992 token,
17002 token,
17007 }
17009 /* If token is an already-parsed decltype not followed by ::,
17010 it's a simple-type-specifier. */
17013 {
17016 {
17018 token,
17020 /* Remember that we are handling a decltype in order to
17021 implement the resolution of DR 1510 when the argument
17022 isn't instantiation dependent. */
17024 }
17027 }
17029 /* If the type-specifier was for a built-in type, we're done. */
17031 {
17032 /* Record the type. */
17039 type,
17040 token,
17045 /* Consume the token. */
17051 /* There is no valid C++ program where a non-template type is
17052 followed by a "<". That usually indicates that the user thought
17053 that the type was a template. */
17058 }
17060 /* The type-specifier must be a user-defined type. */
17062 {
17066 /* Don't gobble tokens or issue error messages if this is an
17067 optional type-specifier. */
17073 /* Look for the optional `::' operator. */
17074 global_p
17078 /* Look for the nested-name specifier. */
17079 qualified_p
17086 /* If we have seen a nested-name-specifier, and the next token
17087 is `template', then we are using the template-id production. */
17090 {
17091 /* Look for the template-id. */
17095 none_type,
17097 /* If the template-id did not name a type, we are out of
17098 luck. */
17100 {
17103 }
17104 }
17105 /* Otherwise, look for a type-name. */
17106 else
17108 /* Keep track of all name-lookups performed in class scopes. */
17110 && !global_p
17111 && !qualified_p
17115 /* If it didn't work out, we don't have a TYPE. */
17120 {
17134 {
17136 none_type,
17146 else
17147 {
17152 }
17153 }
17154 else
17160 }
17163 token,
17165 }
17167 /* If we didn't get a type-name, issue an error message. */
17169 {
17172 }
17175 {
17176 /* See if TYPE is an Objective-C type, and if so, parse and
17177 accept any protocol references following it. Do this before
17178 the cp_parser_check_for_invalid_template_id() call, because
17179 Objective-C types can be followed by '<...>' which would
17180 enclose protocol names rather than template arguments, and so
17181 everything is fine. */
17184 {
17188 /* Clobber the "unqualified" type previously entered into
17189 DECL_SPECS with the new, improved protocol-qualified version. */
17194 }
17196 /* There is no valid C++ program where a non-template type is
17197 followed by a "<". That usually indicates that the user
17198 thought that the type was a template. */
17200 none_type,
17202 }
17205 }
17207 /* Parse a type-name.
17209 type-name:
17210 class-name
17211 enum-name
17212 typedef-name
17213 simple-template-id [in c++0x]
17215 enum-name:
17216 identifier
17218 typedef-name:
17219 identifier
17221 Concepts:
17223 type-name:
17224 concept-name
17225 partial-concept-id
17227 concept-name:
17228 identifier
17230 Returns a TYPE_DECL for the type. */
17232 static tree
17234 {
17236 }
17238 /* See above. */
17239 static tree
17241 {
17242 tree type_decl;
17244 /* We can't know yet whether it is a class-name or not. */
17246 /* Try a class-name. */
17248 typename_keyword_p,
17250 none_type,
17254 /* If it's not a class-name, keep looking. */
17256 {
17258 /* It must be a typedef-name or an enum-name. */
17262 /* It is either a simple-template-id representing an
17263 instantiation of an alias template... */
17267 none_type,
17269 /* Note that this must be an instantiation of an alias template
17270 because [temp.names]/6 says:
17272 A template-id that names an alias template specialization
17273 is a type-name.
17275 Whereas [temp.names]/7 says:
17277 A simple-template-id that names a class template
17278 specialization is a class-name.
17280 With concepts, this could also be a partial-concept-id that
17281 declares a non-type template parameter. */
17288 else
17292 /* ... Or a typedef-name or an enum-name. */
17294 }
17297 }
17299 /* Check if DECL and ARGS can form a constrained-type-specifier.
17300 If ARGS is non-null, we try to form a concept check of the
17301 form DECL<?, ARGS> where ? is a wildcard that matches any
17302 kind of template argument. If ARGS is NULL, then we try to
17303 form a concept check of the form DECL<?>. */
17305 static tree
17308 {
17311 /* If we a constrained-type-specifier cannot be deduced. */
17315 /* A constrained type specifier can only be found in an
17316 overload set or as a reference to a template declaration.
17318 FIXME: This might be masking a bug. It's possible that
17319 that the deduction below is causing template specializations
17320 to be formed with the wildcard as an argument. */
17324 /* Try to build a call expression that evaluates the
17325 concept. This can fail if the overload set refers
17326 only to non-templates. */
17332 /* Deduce the checked constraint and the prototype parameter.
17334 FIXME: In certain cases, failure to deduce should be a
17335 diagnosable error. */
17336 tree conc;
17337 tree proto;
17341 /* In template parameter scope, this results in a constrained
17342 parameter. Return a descriptor of that parm. */
17346 /* In a parameter-declaration-clause, constrained-type
17347 specifiers result in invented template parameters. */
17349 {
17352 }
17353 else
17354 {
17355 /* Otherwise, we're in a context where the constrained
17356 type name is deduced and the constraint applies
17357 after deduction. */
17359 }
17362 }
17364 /* If DECL refers to a concept, return a TYPE_DECL representing
17365 the result of using the constrained type specifier in the
17366 current context. DECL refers to a concept if
17368 - it is an overload set containing a function concept taking a single
17369 type argument, or
17371 - it is a variable concept taking a single type argument. */
17373 static tree
17375 {
17381 else
17383 }
17385 /* Check if DECL and ARGS form a partial-concept-id. If so,
17386 assign ID to the resulting constrained placeholder.
17388 Returns true if the partial-concept-id designates a placeholder
17389 and false otherwise. Note that *id is set to NULL_TREE in
17390 this case. */
17392 static tree
17394 {
17396 }
17398 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17399 or a concept-name.
17401 enum-name:
17402 identifier
17404 typedef-name:
17405 identifier
17407 concept-name:
17408 identifier
17410 Returns a TYPE_DECL for the type. */
17412 static tree
17414 {
17415 tree type_decl;
17416 tree identifier;
17423 /* Look up the type-name. */
17428 /* If we found an overload set, then it may refer to a concept-name. */
17434 {
17435 /* See if this is an Objective-C type. */
17440 }
17442 /* Issue an error if we did not find a type-name. */
17444 /* In Objective-C, we have the complication that class names are
17445 normally type names and start declarations (eg, the
17446 "NSObject" in "NSObject *object;"), but can be used in an
17447 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17448 is an expression. So, a classname followed by a dot is not a
17449 valid type-name. */
17452 {
17457 }
17458 /* Remember that the name was used in the definition of the
17459 current class so that we can check later to see if the
17460 meaning would have been different after the class was
17461 entirely defined. */
17467 }
17469 /* Parse an elaborated-type-specifier. Note that the grammar given
17470 here incorporates the resolution to DR68.
17472 elaborated-type-specifier:
17473 class-key :: [opt] nested-name-specifier [opt] identifier
17474 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17475 enum-key :: [opt] nested-name-specifier [opt] identifier
17476 typename :: [opt] nested-name-specifier identifier
17477 typename :: [opt] nested-name-specifier template [opt]
17478 template-id
17480 GNU extension:
17482 elaborated-type-specifier:
17483 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17484 class-key attributes :: [opt] nested-name-specifier [opt]
17485 template [opt] template-id
17486 enum attributes :: [opt] nested-name-specifier [opt] identifier
17488 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17489 declared `friend'. If IS_DECLARATION is TRUE, then this
17490 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17491 something is being declared.
17493 Returns the TYPE specified. */
17495 static tree
17499 {
17501 tree identifier;
17504 tree globalscope;
17507 /* See if we're looking at the `enum' keyword. */
17509 {
17510 /* Consume the `enum' token. */
17512 /* Remember that it's an enumeration type. */
17514 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17515 enums) is used here. */
17519 {
17526 /* Consume the `struct' or `class' and parse it anyway. */
17528 }
17529 /* Parse the attributes. */
17531 }
17532 /* Or, it might be `typename'. */
17534 RID_TYPENAME))
17535 {
17536 /* Consume the `typename' token. */
17538 /* Remember that it's a `typename' type. */
17540 }
17541 /* Otherwise it must be a class-key. */
17542 else
17543 {
17547 /* Parse the attributes. */
17549 }
17551 /* Look for the `::' operator. */
17554 /* Look for the nested-name-specifier. */
17555 tree nested_name_specifier;
17557 {
17558 nested_name_specifier
17563 is_declaration);
17566 }
17567 else
17568 /* Even though `typename' is not present, the proposed resolution
17569 to Core Issue 180 says that in `class A<T>::B', `B' should be
17570 considered a type-name, even if `A<T>' is dependent. */
17571 nested_name_specifier
17576 is_declaration);
17577 /* For everything but enumeration types, consider a template-id.
17578 For an enumeration type, consider only a plain identifier. */
17580 {
17582 tree decl;
17584 /* Allow the `template' keyword. */
17586 /* If we didn't see `template', we don't know if there's a
17587 template-id or not. */
17590 /* Parse the template-id. */
17594 tag_type,
17595 is_declaration);
17596 /* If we didn't find a template-id, look for an ordinary
17597 identifier. */
17599 ;
17600 /* We can get here when cp_parser_template_id, called by
17601 cp_parser_class_name with tag_type == none_type, succeeds
17602 and caches a BASELINK. Then, when called again here,
17603 instead of failing and returning an error_mark_node
17604 returns it (see template/typename17.C in C++11).
17605 ??? Could we diagnose this earlier? */
17607 {
17610 }
17611 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17612 in effect, then we must assume that, upon instantiation, the
17613 template will correspond to a class. */
17617 typename_type,
17619 /* If the `typename' keyword is in effect and DECL is not a type
17620 decl, then type is non existent. */
17622 ;
17624 {
17628 /* If the next token is a semicolon, this must be a specialization,
17629 instantiation, or friend declaration. Check the scope while we
17630 still know whether or not we had a nested-name-specifier. */
17635 }
17638 }
17641 {
17646 {
17649 }
17651 /* For a `typename', we needn't call xref_tag. */
17657 /* Template parameter lists apply only if we are not within a
17658 function parameter list. */
17659 bool template_parm_lists_apply
17668 /* Look up a qualified name in the usual way. */
17670 {
17671 tree decl;
17672 tree ambiguous_decls;
17675 tag_type,
17682 /* If the lookup was ambiguous, an error will already have been
17683 issued. */
17687 /* If we are parsing friend declaration, DECL may be a
17688 TEMPLATE_DECL tree node here. However, we need to check
17689 whether this TEMPLATE_DECL results in valid code. Consider
17690 the following example:
17692 namespace N {
17693 template <class T> class C {};
17694 }
17695 class X {
17696 template <class T> friend class N::C; // #1, valid code
17697 };
17698 template <class T> class Y {
17699 friend class N::C; // #2, invalid code
17700 };
17702 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17703 name lookup of `N::C'. We see that friend declaration must
17704 be template for the code to be valid. Note that
17705 processing_template_decl does not work here since it is
17706 always 1 for the above two cases. */
17708 decl = (cp_parser_maybe_treat_template_as_class
17713 {
17715 identifier,
17718 }
17721 {
17725 allow_template);
17729 }
17731 /* Forward declarations of nested types, such as
17733 class C1::C2;
17734 class C1::C2::C3;
17736 are invalid unless all components preceding the final '::'
17737 are complete. If all enclosing types are complete, these
17738 declarations become merely pointless.
17740 Invalid forward declarations of nested types are errors
17741 caught elsewhere in parsing. Those that are pointless arrive
17742 here. */
17749 }
17750 else
17751 {
17752 /* An elaborated-type-specifier sometimes introduces a new type and
17753 sometimes names an existing type. Normally, the rule is that it
17754 introduces a new type only if there is not an existing type of
17755 the same name already in scope. For example, given:
17757 struct S {};
17758 void f() { struct S s; }
17760 the `struct S' in the body of `f' is the same `struct S' as in
17761 the global scope; the existing definition is used. However, if
17762 there were no global declaration, this would introduce a new
17763 local class named `S'.
17765 An exception to this rule applies to the following code:
17767 namespace N { struct S; }
17769 Here, the elaborated-type-specifier names a new type
17770 unconditionally; even if there is already an `S' in the
17771 containing scope this declaration names a new type.
17772 This exception only applies if the elaborated-type-specifier
17773 forms the complete declaration:
17775 [class.name]
17777 A declaration consisting solely of `class-key identifier ;' is
17778 either a redeclaration of the name in the current scope or a
17779 forward declaration of the identifier as a class name. It
17780 introduces the name into the current scope.
17782 We are in this situation precisely when the next token is a `;'.
17784 An exception to the exception is that a `friend' declaration does
17785 *not* name a new type; i.e., given:
17787 struct S { friend struct T; };
17789 `T' is not a new type in the scope of `S'.
17791 Also, `new struct S' or `sizeof (struct S)' never results in the
17792 definition of a new type; a new type can only be declared in a
17793 declaration context. */
17795 tag_scope ts;
17799 /* Friends have special name lookup rules. */
17803 CPP_SEMICOLON))
17804 /* This is a `class-key identifier ;' */
17806 else
17809 template_p =
17810 (template_parm_lists_apply
17813 /* An unqualified name was used to reference this type, so
17814 there were no qualifying templates. */
17822 }
17823 }
17828 /* Allow attributes on forward declarations of classes. */
17830 {
17840 else
17843 }
17846 {
17847 /* Indicate whether this class was declared as a `class' or as a
17848 `struct'. */
17852 }
17854 /* A "<" cannot follow an elaborated type specifier. If that
17855 happens, the user was probably trying to form a template-id. */
17860 }
17862 /* Parse an enum-specifier.
17864 enum-specifier:
17865 enum-head { enumerator-list [opt] }
17866 enum-head { enumerator-list , } [C++0x]
17868 enum-head:
17869 enum-key identifier [opt] enum-base [opt]
17870 enum-key nested-name-specifier identifier enum-base [opt]
17872 enum-key:
17873 enum
17874 enum class [C++0x]
17875 enum struct [C++0x]
17877 enum-base: [C++0x]
17878 : type-specifier-seq
17880 opaque-enum-specifier:
17881 enum-key identifier enum-base [opt] ;
17883 GNU Extensions:
17884 enum-key attributes[opt] identifier [opt] enum-base [opt]
17885 { enumerator-list [opt] }attributes[opt]
17886 enum-key attributes[opt] identifier [opt] enum-base [opt]
17887 { enumerator-list, }attributes[opt] [C++0x]
17889 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17890 if the token stream isn't an enum-specifier after all. */
17892 static tree
17894 {
17895 tree identifier;
17897 tree prev_scope;
17899 tree attributes;
17912 /* Parse tentatively so that we can back up if we don't find a
17913 enum-specifier. */
17916 /* Caller guarantees that the current token is 'enum', an identifier
17917 possibly follows, and the token after that is an opening brace.
17918 If we don't have an identifier, fabricate an anonymous name for
17919 the enumeration being defined. */
17922 /* Parse the "class" or "struct", which indicates a scoped
17923 enumeration type in C++0x. */
17926 {
17930 /* Consume the `struct' or `class' token. */
17934 }
17938 /* Clear the qualification. */
17943 /* Figure out in what scope the declaration is being placed. */
17949 nested_name_specifier
17957 {
17958 tree name;
17962 enum_type,
17967 input_location);
17969 {
17972 {
17973 /* Are template enums allowed in ISO? */
17977 /* ignore a typename reference, for it will be solved by name
17978 in start_enum. */
17980 }
17981 }
17984 else
17985 {
17990 }
17991 }
17992 else
17993 {
17996 else
17997 {
18003 }
18004 }
18007 /* Check for the `:' that denotes a specified underlying type in C++0x.
18008 Note that a ':' could also indicate a bitfield width, however. */
18010 {
18011 cp_decl_specifier_seq type_specifiers;
18013 /* Consume the `:'. */
18016 /* Parse the type-specifier-seq. */
18021 /* At this point this is surely not elaborated type specifier. */
18030 /* If that didn't work, stop. */
18032 {
18038 }
18039 }
18041 /* Look for the `{' but don't consume it yet. */
18043 {
18045 {
18048 {
18051 }
18052 }
18053 /* An opaque-enum-specifier must have a ';' here. */
18056 {
18059 {
18062 }
18063 }
18064 }
18070 {
18072 {
18076 }
18078 {
18080 }
18081 }
18083 /* Issue an error message if type-definitions are forbidden here. */
18086 else
18087 /* Create the new type. We do this before consuming the opening
18088 brace so the enum will be recorded as being on the line of its
18089 tag (or the 'enum' keyword, if there is no tag). */
18093 /* If the next token is not '{' it is an opaque-enum-specifier or an
18094 elaborated-type-specifier. */
18096 {
18100 {
18101 /* The following catches invalid code such as:
18102 enum class S<int>::E { A, B, C }; */
18110 {
18114 nested_name_specifier);
18116 }
18119 {
18121 "%qT for enum declaration does not name a class "
18124 }
18125 /* If that scope does not contain the scope in which the
18126 class was originally declared, the program is invalid. */
18128 nested_name_specifier))
18129 {
18132 "declaration of %qD in namespace %qD which does not "
18135 else
18137 "declaration of %qD in %qD which does not "
18141 }
18142 /* If that scope is the scope where the declaration is being placed
18143 the program is invalid. */
18147 {
18151 }
18152 }
18157 /* Consume the opening brace. */
18158 matching_braces braces;
18165 {
18169 }
18170 else
18171 {
18177 }
18181 /* If the next token is not '}', then there are some enumerators. */
18183 {
18187 }
18188 else
18191 /* Consume the final '}'. */
18197 }
18198 else
18199 {
18200 /* If a ';' follows, then it is an opaque-enum-specifier
18201 and additional restrictions apply. */
18203 {
18210 }
18211 }
18213 /* Look for trailing attributes to apply to this enumeration, and
18214 apply them if appropriate. */
18216 {
18219 trailing_attr,
18221 }
18223 /* Finish up the enumeration. */
18225 {
18230 }
18233 {
18235 {
18238 }
18240 {
18242 }
18243 }
18244 out:
18247 }
18249 /* Parse an enumerator-list. The enumerators all have the indicated
18250 TYPE.
18252 enumerator-list:
18253 enumerator-definition
18254 enumerator-list , enumerator-definition */
18256 static void
18258 {
18260 {
18261 /* Parse an enumerator-definition. */
18264 /* If the next token is not a ',', we've reached the end of
18265 the list. */
18268 /* Otherwise, consume the `,' and keep going. */
18270 /* If the next token is a `}', there is a trailing comma. */
18272 {
18277 }
18278 }
18279 }
18281 /* Parse an enumerator-definition. The enumerator has the indicated
18282 TYPE.
18284 enumerator-definition:
18285 enumerator
18286 enumerator = constant-expression
18288 enumerator:
18289 identifier
18291 GNU Extensions:
18293 enumerator-definition:
18294 enumerator attributes [opt]
18295 enumerator attributes [opt] = constant-expression */
18297 static void
18299 {
18300 tree identifier;
18301 tree value;
18302 location_t loc;
18304 /* Save the input location because we are interested in the location
18305 of the identifier and not the location of the explicit value. */
18308 /* Look for the identifier. */
18313 /* Parse any specified attributes. */
18316 /* If the next token is an '=', then there is an explicit value. */
18318 {
18319 /* Consume the `=' token. */
18321 /* Parse the value. */
18323 }
18324 else
18327 /* If we are processing a template, make sure the initializer of the
18328 enumerator doesn't contain any bare template parameter pack. */
18332 /* Create the enumerator. */
18334 }
18336 /* Parse a namespace-name.
18338 namespace-name:
18339 original-namespace-name
18340 namespace-alias
18342 Returns the NAMESPACE_DECL for the namespace. */
18344 static tree
18346 {
18347 tree identifier;
18348 tree namespace_decl;
18352 /* Get the name of the namespace. */
18357 /* Look up the identifier in the currently active scope. Look only
18358 for namespaces, due to:
18360 [basic.lookup.udir]
18362 When looking up a namespace-name in a using-directive or alias
18363 definition, only namespace names are considered.
18365 And:
18367 [basic.lookup.qual]
18369 During the lookup of a name preceding the :: scope resolution
18370 operator, object, function, and enumerator names are ignored.
18372 (Note that cp_parser_qualifying_entity only calls this
18373 function if the token after the name is the scope resolution
18374 operator.) */
18376 none_type,
18382 /* If it's not a namespace, issue an error. */
18385 {
18387 {
18393 }
18396 }
18399 }
18401 /* Parse a namespace-definition.
18403 namespace-definition:
18404 named-namespace-definition
18405 unnamed-namespace-definition
18407 named-namespace-definition:
18408 original-namespace-definition
18409 extension-namespace-definition
18411 original-namespace-definition:
18412 namespace identifier { namespace-body }
18414 extension-namespace-definition:
18415 namespace original-namespace-name { namespace-body }
18417 unnamed-namespace-definition:
18418 namespace { namespace-body } */
18420 static void
18422 {
18423 tree identifier;
18432 {
18435 }
18437 /* Look for the `namespace' keyword. */
18438 cp_token* token
18441 /* Parse any specified attributes before the identifier. */
18445 {
18449 {
18452 /* Parse any attributes specified after the identifier. */
18454 }
18461 "nested namespace definitions only available with "
18464 /* Nested namespace names can create new namespaces (unlike
18465 other qualified-ids). */
18468 else
18471 }
18483 /* Start the namespace. */
18490 /* Look for the `{' to validate starting the namespace. */
18491 matching_braces braces;
18493 {
18494 /* Parse the body of the namespace. */
18497 /* Look for the final `}'. */
18499 }
18504 /* Pop the nested namespace definitions. */
18507 }
18509 /* Parse a namespace-body.
18511 namespace-body:
18512 declaration-seq [opt] */
18514 static void
18516 {
18518 }
18520 /* Parse a namespace-alias-definition.
18522 namespace-alias-definition:
18523 namespace identifier = qualified-namespace-specifier ; */
18525 static void
18527 {
18528 tree identifier;
18529 tree namespace_specifier;
18533 /* Look for the `namespace' keyword. */
18535 /* Look for the identifier. */
18539 /* Look for the `=' token. */
18542 {
18544 /* Skip the definition. */
18549 }
18551 /* Look for the qualified-namespace-specifier. */
18552 namespace_specifier
18554 /* Look for the `;' token. */
18557 /* Register the alias in the symbol table. */
18559 }
18561 /* Parse a qualified-namespace-specifier.
18563 qualified-namespace-specifier:
18564 :: [opt] nested-name-specifier [opt] namespace-name
18566 Returns a NAMESPACE_DECL corresponding to the specified
18567 namespace. */
18569 static tree
18571 {
18572 /* Look for the optional `::'. */
18576 /* Look for the optional nested-name-specifier. */
18584 }
18586 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18587 access declaration.
18589 using-declaration:
18590 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18591 using :: unqualified-id ;
18593 access-declaration:
18594 qualified-id ;
18596 */
18598 static bool
18601 {
18605 tree decl;
18606 tree identifier;
18607 tree qscope;
18612 {
18615 }
18616 else
18617 {
18618 /* Look for the `using' keyword. */
18621 again:
18622 /* Peek at the next token. */
18624 /* See if it's `typename'. */
18626 {
18627 /* Remember that we've seen it. */
18629 /* Consume the `typename' token. */
18631 }
18632 }
18634 /* Look for the optional global scope qualification. */
18635 global_scope_p
18640 /* If we saw `typename', or didn't see `::', then there must be a
18641 nested-name-specifier present. */
18643 {
18649 {
18652 }
18653 }
18654 /* Otherwise, we could be in either of the two productions. In that
18655 case, treat the nested-name-specifier as optional. */
18656 else
18668 /* Something has already gone wrong; there's no need to parse
18669 further. Since an error has occurred, the return value of
18670 cp_parser_parse_definitely will be false, as required. */
18674 /* Parse the unqualified-id. */
18682 {
18687 }
18689 {
18694 "pack expansion in using-declaration only available "
18697 }
18699 /* The function we call to handle a using-declaration is different
18700 depending on what scope we are in. */
18702 ;
18705 /* [namespace.udecl]
18707 A using declaration shall not name a template-id. */
18710 else
18711 {
18713 {
18714 /* Create the USING_DECL. */
18721 {
18724 }
18725 else
18726 /* Add it to the list of members in this class. */
18728 }
18729 else
18730 {
18732 identifier,
18739 {
18742 }
18745 else
18747 }
18748 }
18752 {
18756 "comma-separated list in using-declaration only available "
18759 }
18761 /* Look for the final `;'. */
18766 "access declarations are deprecated "
18767 "in favour of using-declarations; "
18771 }
18773 /* Parse an alias-declaration.
18775 alias-declaration:
18776 using identifier attribute-specifier-seq [opt] = type-id */
18778 static tree
18780 {
18782 location_t id_location;
18784 cp_decl_specifier_seq decl_specs;
18788 /* Look for the `using' keyword. */
18789 cp_token *using_token
18811 /* Now we are going to parse the type-id of the declaration. */
18813 /*
18814 [dcl.type]/3 says:
18816 "A type-specifier-seq shall not define a class or enumeration
18817 unless it appears in the type-id of an alias-declaration (7.1.3) that
18818 is not the declaration of a template-declaration."
18820 In other words, if we currently are in an alias template, the
18821 type-id should not define a type.
18823 So let's set parser->type_definition_forbidden_message in that
18824 case; cp_parser_check_type_definition (called by
18825 cp_parser_class_specifier) will then emit an error if a type is
18826 defined in the type-id. */
18828 {
18832 }
18836 /* Restore the error message if need be. */
18842 {
18845 }
18847 /* A typedef-name can also be introduced by an alias-declaration. The
18848 identifier following the using keyword becomes a typedef-name. It has
18849 the same semantics as if it were introduced by the typedef
18850 specifier. In particular, it does not define a new type and it shall
18851 not appear in the type-id. */
18856 {
18859 ds_attribute,
18860 attrs_token);
18861 }
18863 ds_typedef,
18864 using_token);
18866 ds_alias,
18867 using_token);
18876 else
18882 // Attach constraints to the alias declaration.
18884 {
18888 }
18895 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18896 added into the symbol table; otherwise, return the TYPE_DECL. */
18900 {
18904 }
18907 }
18909 /* Parse a using-directive.
18911 using-directive:
18912 using namespace :: [opt] nested-name-specifier [opt]
18913 namespace-name ; */
18915 static void
18917 {
18918 tree namespace_decl;
18919 tree attribs;
18921 /* Look for the `using' keyword. */
18923 /* And the `namespace' keyword. */
18925 /* Look for the optional `::' operator. */
18927 /* And the optional nested-name-specifier. */
18933 /* Get the namespace being used. */
18935 /* And any specified attributes. */
18938 /* Update the symbol table. */
18941 else
18944 /* Look for the final `;'. */
18946 }
18948 /* Parse an asm-definition.
18950 asm-definition:
18951 asm ( string-literal ) ;
18953 GNU Extension:
18955 asm-definition:
18956 asm volatile [opt] ( string-literal ) ;
18957 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18958 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18959 : asm-operand-list [opt] ) ;
18960 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18961 : asm-operand-list [opt]
18962 : asm-clobber-list [opt] ) ;
18963 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18964 : asm-clobber-list [opt]
18965 : asm-goto-list ) ; */
18967 static void
18969 {
18970 tree string;
18975 tree asm_stmt;
18983 /* Look for the `asm' keyword. */
18988 {
18991 }
18993 /* See if the next token is `volatile'. */
18996 {
18997 /* Remember that we saw the `volatile' keyword. */
18999 /* Consume the token. */
19001 }
19005 {
19006 /* Remember that we saw the `goto' keyword. */
19008 /* Consume the token. */
19010 }
19011 /* Look for the opening `('. */
19014 /* Look for the string. */
19017 {
19021 }
19023 /* If we're allowing GNU extensions, check for the extended assembly
19024 syntax. Unfortunately, the `:' tokens need not be separated by
19025 a space in C, and so, for compatibility, we tolerate that here
19026 too. Doing that means that we have to treat the `::' operator as
19027 two `:' tokens. */
19032 {
19037 /* The extended syntax was used. */
19040 /* Look for outputs. */
19042 {
19043 /* Consume the `:'. */
19045 /* Parse the output-operands. */
19047 CPP_COLON)
19049 CPP_SCOPE)
19051 CPP_CLOSE_PAREN)
19053 {
19057 }
19058 }
19059 /* If the next token is `::', there are no outputs, and the
19060 next token is the beginning of the inputs. */
19062 /* The inputs are coming next. */
19065 /* Look for inputs. */
19068 {
19069 /* Consume the `:' or `::'. */
19071 /* Parse the output-operands. */
19073 CPP_COLON)
19075 CPP_SCOPE)
19077 CPP_CLOSE_PAREN))
19078 {
19082 }
19083 }
19085 /* The clobbers are coming next. */
19088 /* Look for clobbers. */
19091 {
19093 /* Consume the `:' or `::'. */
19095 /* Parse the clobbers. */
19097 CPP_COLON)
19099 CPP_CLOSE_PAREN))
19101 }
19104 /* The labels are coming next. */
19107 /* Look for labels. */
19110 {
19112 /* Consume the `:' or `::'. */
19114 /* Parse the labels. */
19116 }
19120 }
19124 /* Look for the closing `)'. */
19132 {
19133 /* Create the ASM_EXPR. */
19135 {
19138 /* If the extended syntax was not used, mark the ASM_EXPR. */
19140 {
19146 }
19147 }
19148 else
19150 }
19151 }
19153 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19154 type that comes from the decl-specifier-seq. */
19156 static tree
19158 {
19161 {
19174 }
19177 }
19179 /* Declarators [gram.dcl.decl] */
19181 /* Parse an init-declarator.
19183 init-declarator:
19184 declarator initializer [opt]
19186 GNU Extension:
19188 init-declarator:
19189 declarator asm-specification [opt] attributes [opt] initializer [opt]
19191 function-definition:
19192 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19193 function-body
19194 decl-specifier-seq [opt] declarator function-try-block
19196 GNU Extension:
19198 function-definition:
19199 __extension__ function-definition
19201 TM Extension:
19203 function-definition:
19204 decl-specifier-seq [opt] declarator function-transaction-block
19206 The DECL_SPECIFIERS apply to this declarator. Returns a
19207 representation of the entity declared. If MEMBER_P is TRUE, then
19208 this declarator appears in a class scope. The new DECL created by
19209 this declarator is returned.
19211 The CHECKS are access checks that should be performed once we know
19212 what entity is being declared (and, therefore, what classes have
19213 befriended it).
19215 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19216 for a function-definition here as well. If the declarator is a
19217 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19218 be TRUE upon return. By that point, the function-definition will
19219 have been completely parsed.
19221 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19222 is FALSE.
19224 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19225 parsed declaration if it is an uninitialized single declarator not followed
19226 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19227 if present, will not be consumed. If returned, this declarator will be
19228 created with SD_INITIALIZED but will not call cp_finish_decl.
19230 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19231 and there is an initializer, the pointed location_t is set to the
19232 location of the '=' or `(', or '{' in C++11 token introducing the
19233 initializer. */
19235 static tree
19246 {
19250 tree prefix_attributes;
19252 tree asm_specification;
19253 tree initializer;
19255 tree scope;
19257 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19258 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19259 "(...)". */
19270 /* Gather the attributes that were provided with the
19271 decl-specifiers. */
19274 /* Assume that this is not the declarator for a function
19275 definition. */
19279 /* Default arguments are only permitted for function parameters. */
19283 /* Defer access checks while parsing the declarator; we cannot know
19284 what names are accessible until we know what is being
19285 declared. */
19290 /* Parse the declarator. */
19291 declarator
19296 /* Gather up the deferred checks. */
19301 /* If the DECLARATOR was erroneous, there's no need to go
19302 further. */
19306 /* Check that the number of template-parameter-lists is OK. */
19316 /* Figure out what scope the entity declared by the DECLARATOR is
19317 located in. `grokdeclarator' sometimes changes the scope, so
19318 we compute it now. */
19321 /* Perform any lookups in the declared type which were thought to be
19322 dependent, but are not in the scope of the declarator. */
19323 decl_specifiers->type
19326 /* If we're allowing GNU extensions, look for an
19327 asm-specification. */
19329 {
19330 /* Look for an asm-specification. */
19333 }
19334 else
19337 /* Look for attributes. */
19341 /* Peek at the next token. */
19347 {
19348 /* Handle C++17 deduction guides. */
19352 {
19360 {
19364 }
19365 }
19367 /* Check to see if the token indicates the start of a
19368 function-definition. */
19370 {
19372 {
19373 /* If a function-definition should not appear here, issue an
19374 error message. */
19378 }
19380 location_t func_brace_location
19383 /* Neither attributes nor an asm-specification are allowed
19384 on a function-definition. */
19387 "an asm-specification is not allowed "
19391 "attributes are not allowed "
19393 /* This is a function-definition. */
19396 /* Parse the function definition. */
19399 decl_specifiers,
19400 declarator,
19401 prefix_attributes);
19402 else
19403 decl =
19404 (cp_parser_function_definition_from_specifiers_and_declarator
19408 {
19409 /* This is where the prologue starts... */
19412 }
19415 }
19416 }
19418 {
19419 /* A non-template declaration involving a function parameter list
19420 containing an implicit template parameter will be made into a
19421 template. If the resulting declaration is not going to be an
19422 actual function then finish the template scope here to prevent it.
19423 An error message will be issued once we have a decl to talk about.
19425 FIXME probably we should do type deduction rather than create an
19426 implicit template, but the standard currently doesn't allow it. */
19429 }
19431 /* [dcl.dcl]
19433 Only in function declarations for constructors, destructors, type
19434 conversions, and deduction guides can the decl-specifier-seq be omitted.
19436 We explicitly postpone this check past the point where we handle
19437 function-definitions because we tolerate function-definitions
19438 that are missing their return types in some modes. */
19440 {
19444 }
19446 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19450 {
19461 {
19467 }
19468 }
19469 else
19470 {
19471 /* If the init-declarator isn't initialized and isn't followed by a
19472 `,' or `;', it's not a valid init-declarator. */
19475 {
19478 else
19479 {
19483 }
19484 }
19487 }
19489 /* Because start_decl has side-effects, we should only call it if we
19490 know we're going ahead. By this point, we know that we cannot
19491 possibly be looking at any other construct. */
19494 /* Enter the newly declared entry in the symbol table. If we're
19495 processing a declaration in a class-specifier, we wait until
19496 after processing the initializer. */
19498 {
19506 /* Adjust location of decl if declarator->id_loc is more appropriate:
19507 set, and decl wasn't merged with another decl, in which case its
19508 location would be different from input_location, and more accurate. */
19513 }
19515 /* Enter the SCOPE. That way unqualified names appearing in the
19516 initializer will be looked up in SCOPE. */
19519 /* Perform deferred access control checks, now that we know in which
19520 SCOPE the declared entity resides. */
19522 {
19525 /* If the entity being declared is a function, pretend that we
19526 are in its scope. If it is a `friend', it may have access to
19527 things that would not otherwise be accessible. */
19529 {
19532 }
19534 /* Perform access checks for template parameters. */
19537 /* Perform the access control checks for the declarator and the
19538 decl-specifiers. */
19541 /* Restore the saved value. */
19544 }
19546 /* Parse the initializer. */
19551 {
19553 {
19556 else
19557 {
19558 /* If the declaration was erroneous, we don't really
19559 know what the user intended, so just silently
19560 consume the initializer. */
19567 }
19568 }
19569 else
19570 {
19571 /* We want to record the extra mangling scope for in-class
19572 initializers of class members and initializers of static data
19573 member templates. The former involves deferring
19574 parsing of the initializer until end of class as with default
19575 arguments. So right here we only handle the latter. */
19585 }
19586 }
19588 /* The old parser allows attributes to appear after a parenthesized
19589 initializer. Mark Mitchell proposed removing this functionality
19590 on the GCC mailing lists on 2002-08-13. This parser accepts the
19591 attributes -- but ignores them. */
19598 /* And now complain about a non-function implicit template. */
19603 /* For an in-class declaration, use `grokfield' to create the
19604 declaration. */
19606 {
19608 {
19611 }
19620 }
19622 /* Finish processing the declaration. But, skip member
19623 declarations. */
19625 {
19628 asm_specification,
19629 /* If the initializer is in parentheses, then this is
19630 a direct-initialization, which means that an
19631 `explicit' constructor is OK. Otherwise, an
19632 `explicit' constructor cannot be used. */
19635 }
19638 /* Core issue #226 (C++0x only): A default template-argument
19639 shall not be specified in a friend class template
19640 declaration. */
19649 {
19652 else
19654 }
19661 }
19663 /* Parse a declarator.
19665 declarator:
19666 direct-declarator
19667 ptr-operator declarator
19669 abstract-declarator:
19670 ptr-operator abstract-declarator [opt]
19671 direct-abstract-declarator
19673 GNU Extensions:
19675 declarator:
19676 attributes [opt] direct-declarator
19677 attributes [opt] ptr-operator declarator
19679 abstract-declarator:
19680 attributes [opt] ptr-operator abstract-declarator [opt]
19681 attributes [opt] direct-abstract-declarator
19683 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19684 detect constructors, destructors, deduction guides, or conversion operators.
19685 It is set to -1 if the declarator is a name, and +1 if it is a
19686 function. Otherwise it is set to zero. Usually you just want to
19687 test for >0, but internally the negative value is used.
19689 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19690 a decl-specifier-seq unless it declares a constructor, destructor,
19691 or conversion. It might seem that we could check this condition in
19692 semantic analysis, rather than parsing, but that makes it difficult
19693 to handle something like `f()'. We want to notice that there are
19694 no decl-specifiers, and therefore realize that this is an
19695 expression, not a declaration.)
19697 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19698 the declarator is a direct-declarator of the form "(...)".
19700 MEMBER_P is true iff this declarator is a member-declarator.
19702 FRIEND_P is true iff this declarator is a friend. */
19706 cp_parser_declarator_kind dcl_kind,
19710 {
19713 cp_cv_quals cv_quals;
19714 tree class_type;
19717 /* Assume this is not a constructor, destructor, or type-conversion
19718 operator. */
19725 /* Check for the ptr-operator production. */
19727 /* Parse the ptr-operator. */
19733 /* If that worked, then we have a ptr-operator. */
19735 {
19736 /* If a ptr-operator was found, then this declarator was not
19737 parenthesized. */
19740 /* The dependent declarator is optional if we are parsing an
19741 abstract-declarator. */
19745 /* Parse the dependent declarator. */
19750 friend_p);
19752 /* If we are parsing an abstract-declarator, we must handle the
19753 case where the dependent declarator is absent. */
19758 declarator = cp_parser_make_indirect_declarator
19760 }
19761 /* Everything else is a direct-declarator. */
19762 else
19763 {
19766 CPP_OPEN_PAREN);
19768 ctor_dtor_or_conv_p,
19770 }
19775 }
19777 /* Parse a direct-declarator or direct-abstract-declarator.
19779 direct-declarator:
19780 declarator-id
19781 direct-declarator ( parameter-declaration-clause )
19782 cv-qualifier-seq [opt]
19783 ref-qualifier [opt]
19784 exception-specification [opt]
19785 direct-declarator [ constant-expression [opt] ]
19786 ( declarator )
19788 direct-abstract-declarator:
19789 direct-abstract-declarator [opt]
19790 ( parameter-declaration-clause )
19791 cv-qualifier-seq [opt]
19792 ref-qualifier [opt]
19793 exception-specification [opt]
19794 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19795 ( abstract-declarator )
19797 Returns a representation of the declarator. DCL_KIND is
19798 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19799 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19800 we are parsing a direct-declarator. It is
19801 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19802 of ambiguity we prefer an abstract declarator, as per
19803 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19804 as for cp_parser_declarator. */
19808 cp_parser_declarator_kind dcl_kind,
19811 {
19822 {
19823 /* Peek at the next token. */
19826 {
19827 /* This is either a parameter-declaration-clause, or a
19828 parenthesized declarator. When we know we are parsing a
19829 named declarator, it must be a parenthesized declarator
19830 if FIRST is true. For instance, `(int)' is a
19831 parameter-declaration-clause, with an omitted
19832 direct-abstract-declarator. But `((*))', is a
19833 parenthesized abstract declarator. Finally, when T is a
19834 template parameter `(T)' is a
19835 parameter-declaration-clause, and not a parenthesized
19836 named declarator.
19838 We first try and parse a parameter-declaration-clause,
19839 and then try a nested declarator (if FIRST is true).
19841 It is not an error for it not to be a
19842 parameter-declaration-clause, even when FIRST is
19843 false. Consider,
19845 int i (int);
19846 int i (3);
19848 The first is the declaration of a function while the
19849 second is the definition of a variable, including its
19850 initializer.
19852 Having seen only the parenthesis, we cannot know which of
19853 these two alternatives should be selected. Even more
19854 complex are examples like:
19856 int i (int (a));
19857 int i (int (3));
19859 The former is a function-declaration; the latter is a
19860 variable initialization.
19862 Thus again, we try a parameter-declaration-clause, and if
19863 that fails, we back out and return. */
19866 {
19867 tree params;
19872 /* In a member-declarator, the only valid interpretation
19873 of a parenthesis is the start of a
19874 parameter-declaration-clause. (It is invalid to
19875 initialize a static data member with a parenthesized
19876 initializer; only the "=" form of initialization is
19877 permitted.) */
19881 /* Consume the `('. */
19882 matching_parens parens;
19885 {
19886 /* If this is going to be an abstract declarator, we're
19887 in a declarator and we can't have default args. */
19890 }
19894 /* Parse the parameter-declaration-clause. */
19897 /* Consume the `)'. */
19900 /* If all went well, parse the cv-qualifier-seq,
19901 ref-qualifier and the exception-specification. */
19903 {
19904 cp_cv_quals cv_quals;
19905 cp_virt_specifiers virt_specifiers;
19906 cp_ref_qualifier ref_qual;
19907 tree exception_specification;
19908 tree late_return;
19909 tree attrs;
19919 /* Parse the cv-qualifier-seq. */
19921 /* Parse the ref-qualifier. */
19923 /* Parse the tx-qualifier. */
19925 /* And the exception-specification. */
19926 exception_specification
19931 /* In here, we handle cases where attribute is used after
19932 the function declaration. For example:
19933 void func (int x) __attribute__((vector(..))); */
19936 late_return = (cp_parser_late_return_type_opt
19940 /* Parse the virt-specifier-seq. */
19943 /* Create the function-declarator. */
19945 params,
19946 cv_quals,
19947 virt_specifiers,
19948 ref_qual,
19949 tx_qual,
19950 exception_specification,
19951 late_return,
19952 requires_clause);
19955 /* Any subsequent parameter lists are to do with
19956 return type, so are not those of the declared
19957 function. */
19959 }
19961 /* Remove the function parms from scope. */
19965 /* Repeat the main loop. */
19967 }
19969 /* If this is the first, we can try a parenthesized
19970 declarator. */
19972 {
19979 /* Consume the `('. */
19980 matching_parens parens;
19982 /* Parse the nested declarator. */
19985 declarator
19991 /* Expect a `)'. */
19999 }
20000 /* Otherwise, we must be done. */
20001 else
20003 }
20007 {
20008 /* Parse an array-declarator. */
20018 /* Consume the `['. */
20020 /* Peek at the next token. */
20022 /* If the next token is `]', then there is no
20023 constant-expression. */
20025 {
20027 bounds
20037 {
20038 /* Normally, the array bound must be an integral constant
20039 expression. However, as an extension, we allow VLAs
20040 in function scopes as long as they aren't part of a
20041 parameter declaration. */
20045 }
20048 {
20049 /* Remember this wasn't a constant-expression. */
20052 }
20053 }
20054 else
20056 /* Look for the closing `]'. */
20058 {
20061 }
20066 }
20068 {
20069 {
20070 tree qualifying_scope;
20071 tree unqualified_name;
20072 tree attrs;
20073 special_function_kind sfk;
20078 /* Parse a declarator-id */
20081 {
20084 /* If we see an ellipsis, we should be looking at a
20085 parameter pack. */
20087 {
20088 /* Consume the `...' */
20092 }
20093 }
20096 unqualified_name
20100 {
20104 {
20105 /* Check whether an error occurred. */
20108 /* We already consumed the ellipsis to mark a
20109 parameter pack, but we have no way to report it,
20110 so abort the tentative parse. We will be exiting
20111 immediately anyway. */
20113 }
20114 else
20120 && (qualifying_scope
20122 {
20125 }
20126 }
20131 {
20136 }
20142 {
20143 /* In the declaration of a member of a template class
20144 outside of the class itself, the SCOPE will sometimes
20145 be a TYPENAME_TYPE. For example, given:
20147 template <typename T>
20148 int S<T>::R::i = 3;
20150 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20151 this context, we must resolve S<T>::R to an ordinary
20152 type, rather than a typename type.
20154 The reason we normally avoid resolving TYPENAME_TYPEs
20155 is that a specialization of `S' might render
20156 `S<T>::R' not a type. However, if `S' is
20157 specialized, then this `i' will not be used, so there
20158 is no harm in resolving the types here. */
20159 tree type;
20161 /* Resolve the TYPENAME_TYPE. */
20164 /* If that failed, the declarator is invalid. */
20166 {
20169 "cannot define member of dependent typedef "
20171 else
20176 }
20178 }
20183 {
20184 tree class_type;
20189 else
20193 {
20197 {
20198 /* We do not attempt to print the declarator
20199 here because we do not have enough
20200 information about its original syntactic
20201 form. */
20205 }
20208 {
20212 "use %<%T::%D%> instead of %<%T::%D%> to "
20214 class_type,
20219 }
20221 }
20224 {
20231 for an unnamed type, even if the type
20232 got a name for linkage purposes. */
20234 /* Handle correctly (c++/19200):
20236 struct S {
20237 struct T{};
20238 friend void S(T);
20239 };
20241 and also:
20243 namespace N {
20244 void S();
20245 }
20247 struct S {
20248 friend void N::S();
20249 }; */
20252 class_type))
20261 }
20262 }
20264 unqualified_name,
20265 sfk);
20272 }
20274 handle_declarator:;
20277 {
20278 /* Any names that appear after the declarator-id for a
20279 member are looked up in the containing scope. */
20281 {
20282 /* But declarations with qualified-ids can't appear in a
20283 function. */
20287 }
20289 }
20293 /* Default args are only allowed on function
20294 declarations. */
20296 else
20300 }
20301 /* We're done. */
20302 else
20304 }
20306 /* For an abstract declarator, we might wind up with nothing at this
20307 point. That's an error; the declarator is not optional. */
20311 {
20312 /* Record overly parenthesized declarator so we can give a
20313 diagnostic about confusing decl/expr disambiguation. */
20315 {
20316 /* If the open and close parens are on different lines, this
20317 is probably a formatting thing, so ignore. */
20322 }
20325 }
20327 /* If we entered a scope, we must exit it now. */
20335 }
20337 /* Parse a ptr-operator.
20339 ptr-operator:
20340 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20341 * cv-qualifier-seq [opt]
20342 &
20343 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20344 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20346 GNU Extension:
20348 ptr-operator:
20349 & cv-qualifier-seq [opt]
20351 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20352 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20353 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20354 filled in with the TYPE containing the member. *CV_QUALS is
20355 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20356 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20357 Note that the tree codes returned by this function have nothing
20358 to do with the types of trees that will be eventually be created
20359 to represent the pointer or reference type being parsed. They are
20360 just constants with suggestive names. */
20361 static enum tree_code
20366 {
20371 /* Assume that it's not a pointer-to-member. */
20373 /* And that there are no cv-qualifiers. */
20376 /* Peek at the next token. */
20379 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20389 {
20390 /* Consume the `*', `&' or `&&'. */
20393 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20394 `&', if we are allowing GNU extensions. (The only qualifier
20395 that can legally appear after `&' is `restrict', but that is
20396 enforced during semantic analysis. */
20404 }
20405 else
20406 {
20407 /* Try the pointer-to-member case. */
20409 /* Look for the optional `::' operator. */
20412 /* Look for the nested-name specifier. */
20419 /* If we found it, and the next token is a `*', then we are
20420 indeed looking at a pointer-to-member operator. */
20423 {
20424 /* Indicate that the `*' operator was used. */
20432 else
20433 {
20434 /* The type of which the member is a member is given by the
20435 current SCOPE. */
20437 /* The next name will not be qualified. */
20441 /* Look for optional c++11 attributes. */
20445 /* Look for the optional cv-qualifier-seq. */
20447 }
20448 }
20449 /* If that didn't work we don't have a ptr-operator. */
20452 }
20455 }
20457 /* Parse an (optional) cv-qualifier-seq.
20459 cv-qualifier-seq:
20460 cv-qualifier cv-qualifier-seq [opt]
20462 cv-qualifier:
20463 const
20464 volatile
20466 GNU Extension:
20468 cv-qualifier:
20469 __restrict__
20471 Returns a bitmask representing the cv-qualifiers. */
20473 static cp_cv_quals
20475 {
20479 {
20481 cp_cv_quals cv_qualifier;
20483 /* Peek at the next token. */
20485 /* See if it's a cv-qualifier. */
20487 {
20503 }
20509 {
20514 }
20515 else
20516 {
20519 }
20520 }
20523 }
20525 /* Parse an (optional) ref-qualifier
20527 ref-qualifier:
20528 &
20529 &&
20531 Returns cp_ref_qualifier representing ref-qualifier. */
20533 static cp_ref_qualifier
20535 {
20538 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20543 {
20548 {
20560 }
20565 {
20568 }
20569 else
20570 {
20573 }
20574 }
20577 }
20579 /* Parse an optional tx-qualifier.
20581 tx-qualifier:
20582 transaction_safe
20583 transaction_safe_dynamic */
20585 static tree
20587 {
20590 {
20595 {
20599 {
20602 {
20605 }
20606 else
20608 }
20609 }
20610 }
20612 }
20614 /* Parse an (optional) virt-specifier-seq.
20616 virt-specifier-seq:
20617 virt-specifier virt-specifier-seq [opt]
20619 virt-specifier:
20620 override
20621 final
20623 Returns a bitmask representing the virt-specifiers. */
20625 static cp_virt_specifiers
20627 {
20631 {
20633 cp_virt_specifiers virt_specifier;
20635 /* Peek at the next token. */
20637 /* See if it's a virt-specifier-qualifier. */
20641 {
20644 }
20646 {
20649 }
20651 {
20653 }
20654 else
20658 {
20663 }
20664 else
20665 {
20668 }
20669 }
20671 }
20673 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20674 is in scope even though it isn't real. */
20676 void
20678 {
20679 tree this_parm;
20682 {
20683 /* We don't clear this between NSDMIs. Is it already what we want? */
20690 }
20693 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20695 current_class_ref
20698 }
20700 /* Return true iff our current scope is a non-static data member
20701 initializer. */
20703 bool
20705 {
20706 /* We recognize NSDMI context by the context-less 'this' pointer set up
20707 by the function above. */
20713 }
20715 /* Parse a late-specified return type, if any. This is not a separate
20716 non-terminal, but part of a function declarator, which looks like
20718 -> trailing-type-specifier-seq abstract-declarator(opt)
20720 Returns the type indicated by the type-id.
20722 In addition to this, parse any queued up #pragma omp declare simd
20723 clauses, and #pragma acc routine clauses.
20725 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20726 function. */
20728 static tree
20731 {
20735 && declarator
20739 && declarator
20742 /* Peek at the next token. */
20744 /* A late-specified return type is indicated by an initial '->'. */
20755 {
20756 /* DR 1207: 'this' is in scope in the trailing return type. */
20758 }
20761 {
20762 /* Consume the ->. */
20766 }
20768 /* Function declarations may be followed by a trailing
20769 requires-clause. */
20773 declarator->attributes
20777 declarator->attributes
20782 {
20785 }
20788 }
20790 /* Parse a declarator-id.
20792 declarator-id:
20793 id-expression
20794 :: [opt] nested-name-specifier [opt] type-name
20796 In the `id-expression' case, the value returned is as for
20797 cp_parser_id_expression if the id-expression was an unqualified-id.
20798 If the id-expression was a qualified-id, then a SCOPE_REF is
20799 returned. The first operand is the scope (either a NAMESPACE_DECL
20800 or TREE_TYPE), but the second is still just a representation of an
20801 unqualified-id. */
20803 static tree
20805 {
20806 tree id;
20807 /* The expression must be an id-expression. Assume that qualified
20808 names are the names of types so that:
20810 template <class T>
20811 int S<T>::R::i = 3;
20813 will work; we must treat `S<T>::R' as the name of a type.
20814 Similarly, assume that qualified names are templates, where
20815 required, so that:
20817 template <class T>
20818 int S<T>::R<T>::i = 3;
20820 will work, too. */
20826 optional_p);
20830 }
20832 /* Parse a type-id.
20834 type-id:
20835 type-specifier-seq abstract-declarator [opt]
20837 Returns the TYPE specified. */
20839 static tree
20842 {
20843 cp_decl_specifier_seq type_specifier_seq;
20846 /* Parse the type-specifier-seq. */
20848 is_trailing_return,
20853 /* A bare template name as a template argument is a template template
20854 argument, not a placeholder, so fail parsing it as a type argument. */
20855 {
20859 }
20863 /* There might or might not be an abstract declarator. */
20865 /* Look for the declarator. */
20866 abstract_declarator
20871 /* Check to see if there really was a declarator. */
20876 /* The concepts TS allows 'auto' as a type-id. */
20878 /* None of the valid uses of 'auto' in C++14 involve the type-id
20879 nonterminal, but it is valid in a trailing-return-type. */
20882 {
20883 /* A type-id with type 'auto' is only ok if the abstract declarator
20884 is a function declarator with a late-specified return type.
20886 A type-id with 'auto' is also valid in a trailing-return-type
20887 in a compound-requirement. */
20894 else
20895 {
20898 {
20900 auto_node);
20902 tmpl);
20903 }
20904 else
20907 }
20908 }
20911 is_template_arg);
20912 }
20914 static tree
20916 {
20918 }
20920 static tree
20922 {
20923 tree r;
20925 parser->type_definition_forbidden_message
20930 {
20933 }
20935 }
20937 static tree
20939 {
20941 }
20943 /* Parse a type-specifier-seq.
20945 type-specifier-seq:
20946 type-specifier type-specifier-seq [opt]
20948 GNU extension:
20950 type-specifier-seq:
20951 attributes type-specifier-seq [opt]
20953 If IS_DECLARATION is true, we are at the start of a "condition" or
20954 exception-declaration, so we might be followed by a declarator-id.
20956 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20957 i.e. we've just seen "->".
20959 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20961 static void
20966 {
20971 /* Clear the TYPE_SPECIFIER_SEQ. */
20974 /* In the context of a trailing return type, enum E { } is an
20975 elaborated-type-specifier followed by a function-body, not an
20976 enum-specifier. */
20980 /* Parse the type-specifiers and attributes. */
20982 {
20983 tree type_specifier;
20986 /* Check for attributes first. */
20988 {
20993 }
20995 /* record the token of the beginning of the type specifier seq,
20996 for error reporting purposes*/
21000 /* Look for the type-specifier. */
21002 flags,
21003 type_specifier_seq,
21005 NULL,
21008 {
21009 /* If the first type-specifier could not be found, this is not a
21010 type-specifier-seq at all. */
21012 {
21013 /* Set in_declarator_p to avoid skipping to the semicolon. */
21025 }
21026 /* If subsequent type-specifiers could not be found, the
21027 type-specifier-seq is complete. */
21029 }
21032 /* The standard says that a condition can be:
21034 type-specifier-seq declarator = assignment-expression
21036 However, given:
21038 struct S {};
21039 if (int S = ...)
21041 we should treat the "S" as a declarator, not as a
21042 type-specifier. The standard doesn't say that explicitly for
21043 type-specifier-seq, but it does say that for
21044 decl-specifier-seq in an ordinary declaration. Perhaps it
21045 would be clearer just to allow a decl-specifier-seq here, and
21046 then add a semantic restriction that if any decl-specifiers
21047 that are not type-specifiers appear, the program is invalid. */
21050 }
21051 }
21053 /* Return whether the function currently being declared has an associated
21054 template parameter list. */
21056 static bool
21058 {
21071 }
21073 /* Parse a parameter-declaration-clause.
21075 parameter-declaration-clause:
21076 parameter-declaration-list [opt] ... [opt]
21077 parameter-declaration-list , ...
21079 Returns a representation for the parameter declarations. A return
21080 value of NULL indicates a parameter-declaration-clause consisting
21081 only of an ellipsis. */
21083 static tree
21085 {
21086 tree parameters;
21095 parser->auto_is_implicit_function_template_parm_p
21097 }
21103 && !processing_template_parmlist
21109 /* Peek at the next token. */
21111 /* Check for trivial parameter-declaration-clauses. */
21113 {
21114 /* Consume the `...' token. */
21117 }
21119 /* There are no parameters. */
21120 {
21121 #ifndef NO_IMPLICIT_EXTERN_C
21126 else
21127 #endif
21129 }
21130 /* Check for `(void)', too, which is a special case. */
21134 {
21135 /* Consume the `void' token. */
21137 /* There are no parameters. */
21139 }
21141 /* Parse the parameter-declaration-list. */
21143 /* If a parse error occurred while parsing the
21144 parameter-declaration-list, then the entire
21145 parameter-declaration-clause is erroneous. */
21149 /* Peek at the next token. */
21151 /* If it's a `,', the clause should terminate with an ellipsis. */
21153 {
21154 /* Consume the `,'. */
21156 /* Expect an ellipsis. */
21157 ellipsis_p
21159 }
21160 /* It might also be `...' if the optional trailing `,' was
21161 omitted. */
21163 {
21164 /* Consume the `...' token. */
21166 /* And remember that we saw it. */
21168 }
21169 else
21172 /* Finish the parameter list. */
21177 }
21179 /* Parse a parameter-declaration-list.
21181 parameter-declaration-list:
21182 parameter-declaration
21183 parameter-declaration-list , parameter-declaration
21185 Returns a representation of the parameter-declaration-list, as for
21186 cp_parser_parameter_declaration_clause. However, the
21187 `void_list_node' is never appended to the list. Upon return,
21188 *IS_ERROR will be true iff an error occurred. */
21190 static tree
21192 {
21198 /* Assume all will go well. */
21200 /* The special considerations that apply to a function within an
21201 unbraced linkage specifications do not apply to the parameters
21202 to the function. */
21203 saved_in_unbraced_linkage_specification_p
21207 /* Look for more parameters. */
21209 {
21217 /* Parse the parameter. */
21218 parameter
21223 /* We don't know yet if the enclosing context is deprecated, so wait
21224 and warn in grokparms if appropriate. */
21228 {
21229 /* If a function parameter pack was specified and an implicit template
21230 parameter was introduced during cp_parser_parameter_declaration,
21231 change any implicit parameters introduced into packs. */
21235 {
21243 }
21247 PARM,
21252 }
21256 /* If a parse error occurred parsing the parameter declaration,
21257 then the entire parameter-declaration-list is erroneous. */
21259 {
21263 }
21273 {
21277 }
21279 /* Add the new parameter to the list. */
21283 /* Peek at the next token. */
21286 /* These are for Objective-C++ */
21289 /* The parameter-declaration-list is complete. */
21292 {
21295 /* Peek at the next token. */
21297 /* If it's an ellipsis, then the list is complete. */
21300 /* Otherwise, there must be more parameters. Consume the
21301 `,'. */
21303 /* When parsing something like:
21305 int i(float f, double d)
21307 we can tell after seeing the declaration for "f" that we
21308 are not looking at an initialization of a variable "i",
21309 but rather at the declaration of a function "i".
21311 Due to the fact that the parsing of template arguments
21312 (as specified to a template-id) requires backtracking we
21313 cannot use this technique when inside a template argument
21314 list. */
21318 /* However, a parameter-declaration of the form
21319 "float(f)" (which is a valid declaration of a
21320 parameter "f") can also be interpreted as an
21321 expression (the conversion of "f" to "float"). */
21324 }
21325 else
21326 {
21334 }
21335 }
21337 parser->in_unbraced_linkage_specification_p
21340 /* Reset implicit_template_scope if we are about to leave the function
21341 parameter list that introduced it. Note that for out-of-line member
21342 definitions, there will be one or more class scopes before we get to
21343 the template parameter scope. */
21347 {
21351 {
21354 }
21355 }
21358 }
21360 /* Parse a parameter declaration.
21362 parameter-declaration:
21363 decl-specifier-seq ... [opt] declarator
21364 decl-specifier-seq declarator = assignment-expression
21365 decl-specifier-seq ... [opt] abstract-declarator [opt]
21366 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21368 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21369 declares a template parameter. (In that case, a non-nested `>'
21370 token encountered during the parsing of the assignment-expression
21371 is not interpreted as a greater-than operator.)
21373 Returns a representation of the parameter, or NULL if an error
21374 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21375 true iff the declarator is of the form "(p)". */
21381 {
21383 cp_decl_specifier_seq decl_specifiers;
21385 tree default_argument;
21390 /* In a template parameter, `>' is not an operator.
21392 [temp.param]
21394 When parsing a default template-argument for a non-type
21395 template-parameter, the first non-nested `>' is taken as the end
21396 of the template parameter-list rather than a greater-than
21397 operator. */
21399 /* Type definitions may not appear in parameter types. */
21401 parser->type_definition_forbidden_message
21404 /* Parse the declaration-specifiers. */
21407 CP_PARSER_FLAGS_NONE,
21411 /* Complain about missing 'typename' or other invalid type names. */
21416 /* If an error occurred, there's no reason to attempt to parse the
21417 rest of the declaration. */
21419 {
21422 }
21424 /* Peek at the next token. */
21427 /* If the next token is a `)', `,', `=', `>', or `...', then there
21428 is no declarator. However, when variadic templates are enabled,
21429 there may be a declarator following `...'. */
21434 {
21438 }
21439 /* Otherwise, there should be a declarator. */
21440 else
21441 {
21445 /* After seeing a decl-specifier-seq, if the next token is not a
21446 "(", there is no possibility that the code is a valid
21447 expression. Therefore, if parsing tentatively, we commit at
21448 this point. */
21450 /* In an expression context, having seen:
21452 (int((char ...
21454 we cannot be sure whether we are looking at a
21455 function-type (taking a "char" as a parameter) or a cast
21456 of some object of type "char" to "int". */
21462 /* Parse the declarator. */
21465 CP_PARSER_DECLARATOR_EITHER,
21467 parenthesized_p,
21471 /* After the declarator, allow more attributes. */
21472 decl_specifiers.attributes
21476 /* If the declarator is a template parameter pack, remember that and
21477 clear the flag in the declarator itself so we don't get errors
21478 from grokdeclarator. */
21480 {
21483 }
21484 }
21486 /* If the next token is an ellipsis, and we have not seen a declarator
21487 name, and if either the type of the declarator contains parameter
21488 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21489 for, eg, abbreviated integral type names), then we actually have a
21490 parameter pack expansion expression. Otherwise, leave the ellipsis
21491 for a C-style variadic function. */
21494 {
21505 {
21506 /* Consume the `...'. */
21510 /* Build a pack expansion type */
21515 else
21517 }
21518 }
21520 /* The restriction on defining new types applies only to the type
21521 of the parameter, not to the default argument. */
21524 /* If the next token is `=', then process a default argument. */
21526 {
21529 /* If we are defining a class, then the tokens that make up the
21530 default argument must be saved and processed later. */
21536 // A constrained-type-specifier may declare a type template-parameter.
21538 default_argument
21541 // A constrained-type-specifier may declare a template-template-parameter.
21543 default_argument
21546 /* Outside of a class definition, we can just parse the
21547 assignment-expression. */
21548 else
21549 default_argument
21553 {
21555 "default arguments are only "
21557 }
21559 || template_parameter_pack_p
21562 {
21563 /* Find the name of the parameter pack. */
21570 template_parm_p
21576 else
21578 template_parm_p
21585 }
21586 }
21587 else
21590 /* Generate a location for the parameter, ranging from the start of the
21591 initial token to the end of the final token (using input_location for
21592 the latter, set up by cp_lexer_set_source_position_from_token when
21593 consuming tokens).
21595 If we have a identifier, then use it for the caret location, e.g.
21597 extern int callee (int one, int (*two)(int, int), float three);
21598 ~~~~~~^~~~~~~~~~~~~~
21600 otherwise, reuse the start location for the caret location e.g.:
21602 extern int callee (int one, int (*)(int, int), float three);
21603 ^~~~~~~~~~~~~~~~~
21605 */
21611 input_location);
21614 declarator,
21615 default_argument,
21616 param_loc,
21617 template_parameter_pack_p);
21618 }
21620 /* Parse a default argument and return it.
21622 TEMPLATE_PARM_P is true if this is a default argument for a
21623 non-type template parameter. */
21624 static tree
21626 {
21632 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21633 set correctly. */
21636 /* Local variable names (and the `this' keyword) may not
21637 appear in a default argument. */
21640 /* Parse the assignment-expression. */
21645 /* The "this" pointer is not valid in a default argument. */
21647 {
21652 }
21653 default_argument
21655 /* Restore the "this" pointer. */
21657 {
21660 }
21669 }
21671 /* Parse a function-body.
21673 function-body:
21674 compound_statement */
21676 static void
21678 {
21682 }
21684 /* Parse a ctor-initializer-opt followed by a function-body. Return
21685 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21686 is true we are parsing a function-try-block. */
21688 static void
21691 {
21698 /* Begin the function body. */
21700 /* Parse the optional ctor-initializer. */
21703 /* If we're parsing a constexpr constructor definition, we need
21704 to check that the constructor body is indeed empty. However,
21705 before we get to cp_parser_function_body lot of junk has been
21706 generated, so we can't just check that we have an empty block.
21707 Rather we take a snapshot of the outermost block, and check whether
21708 cp_parser_function_body changed its state. */
21710 {
21714 }
21715 /* Parse the function-body. */
21719 /* Finish the function body. */
21721 }
21723 /* Parse an initializer.
21725 initializer:
21726 = initializer-clause
21727 ( expression-list )
21729 Returns an expression representing the initializer. If no
21730 initializer is present, NULL_TREE is returned.
21732 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21733 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21734 set to TRUE if there is no initializer present. If there is an
21735 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21736 is set to true; otherwise it is set to false. */
21738 static tree
21741 {
21743 tree init;
21745 /* Peek at the next token. */
21748 /* Let our caller know whether or not this initializer was
21749 parenthesized. */
21751 /* Assume that the initializer is constant. */
21755 {
21756 /* Consume the `='. */
21758 /* Parse the initializer-clause. */
21760 }
21762 {
21767 non_constant_p);
21772 }
21774 {
21779 }
21780 else
21781 {
21782 /* Anything else is an error. */
21785 }
21791 }
21793 /* Parse an initializer-clause.
21795 initializer-clause:
21796 assignment-expression
21797 braced-init-list
21799 Returns an expression representing the initializer.
21801 If the `assignment-expression' production is used the value
21802 returned is simply a representation for the expression.
21804 Otherwise, calls cp_parser_braced_list. */
21806 static cp_expr
21808 {
21809 cp_expr initializer;
21811 /* Assume the expression is constant. */
21814 /* If it is not a `{', then we are looking at an
21815 assignment-expression. */
21817 {
21818 initializer
21821 non_constant_p);
21822 }
21823 else
21827 }
21829 /* Parse a brace-enclosed initializer list.
21831 braced-init-list:
21832 { initializer-list , [opt] }
21833 { designated-initializer-list , [opt] }
21834 { }
21836 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21837 the elements of the initializer-list (or NULL, if the last
21838 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21839 NULL_TREE. There is no way to detect whether or not the optional
21840 trailing `,' was provided. NON_CONSTANT_P is as for
21841 cp_parser_initializer. */
21843 static cp_expr
21845 {
21846 tree initializer;
21849 /* Consume the `{' token. */
21850 matching_braces braces;
21852 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21854 /* If it's not a `}', then there is a non-trivial initializer. */
21856 {
21857 /* Parse the initializer list. */
21860 /* A trailing `,' token is allowed. */
21863 }
21864 else
21866 /* Now, there should be a trailing `}'. */
21872 /* Build a location of the form:
21873 { ... }
21874 ^~~~~~~
21875 with caret==start at the open brace, finish at the close brace. */
21879 }
21881 /* Consume tokens up to, and including, the next non-nested closing `]'.
21882 Returns true iff we found a closing `]'. */
21884 static bool
21886 {
21890 {
21894 {
21897 /* If we've run out of tokens, then there is no closing `]'. */
21906 {
21909 }
21914 }
21916 /* Consume the token. */
21918 }
21919 }
21921 /* Return true if we are looking at an array-designator, false otherwise. */
21923 static bool
21925 {
21926 /* Consume the `['. */
21931 /* Skip tokens until the next token is a closing square bracket.
21932 If we find the closing `]', and the next token is a `=', then
21933 we are looking at an array designator. */
21934 bool array_designator_p
21938 /* Roll back the tokens we skipped. */
21942 }
21944 /* Parse an initializer-list.
21946 initializer-list:
21947 initializer-clause ... [opt]
21948 initializer-list , initializer-clause ... [opt]
21950 C++2A Extension:
21952 designated-initializer-list:
21953 designated-initializer-clause
21954 designated-initializer-list , designated-initializer-clause
21956 designated-initializer-clause:
21957 designator brace-or-equal-initializer
21959 designator:
21960 . identifier
21962 GNU Extension:
21964 initializer-list:
21965 designation initializer-clause ...[opt]
21966 initializer-list , designation initializer-clause ...[opt]
21968 designation:
21969 . identifier =
21970 identifier :
21971 [ constant-expression ] =
21973 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21974 for the initializer. If the INDEX of the elt is non-NULL, it is the
21975 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21976 as for cp_parser_initializer. */
21980 {
21985 /* Assume all of the expressions are constant. */
21988 /* Parse the rest of the list. */
21990 {
21992 tree designator;
21993 tree initializer;
21997 /* Handle the C++2A syntax, '. id ='. */
22005 {
22008 "C++ designated initializers only available with "
22010 /* Consume the `.'. */
22012 /* Consume the identifier. */
22015 /* Consume the `='. */
22017 }
22018 /* Also, if the next token is an identifier and the following one is a
22019 colon, we are looking at the GNU designated-initializer
22020 syntax. */
22025 {
22026 /* Warn the user that they are using an extension. */
22029 /* Consume the identifier. */
22031 /* Consume the `:'. */
22033 }
22034 /* Also handle C99 array designators, '[ const ] ='. */
22038 {
22039 /* In C++11, [ could start a lambda-introducer. */
22045 {
22048 }
22049 else
22050 {
22055 }
22060 && (!require_potential_rvalue_constant_expression
22064 /* Warn the user that they are using an extension. */
22067 }
22068 else
22072 {
22075 }
22079 {
22083 }
22087 /* Parse the initializer. */
22090 /* If any clause is non-constant, so is the entire initializer. */
22094 /* If we have an ellipsis, this is an initializer pack
22095 expansion. */
22097 {
22100 /* Consume the `...'. */
22107 /* Turn the initializer into an initializer expansion. */
22109 }
22111 /* Add it to the vector. */
22114 /* If the next token is not a comma, we have reached the end of
22115 the list. */
22119 /* Peek at the next token. */
22121 /* If the next token is a `}', then we're still done. An
22122 initializer-clause can have a trailing `,' after the
22123 initializer-list and before the closing `}'. */
22127 /* Consume the `,' token. */
22129 }
22131 /* The same identifier shall not appear in multiple designators
22132 of a designated-initializer-list. */
22134 {
22139 {
22141 {
22143 "%<.%s%> designator used multiple times in "
22147 }
22148 else
22150 }
22154 }
22157 }
22159 /* Classes [gram.class] */
22161 /* Parse a class-name.
22163 class-name:
22164 identifier
22165 template-id
22167 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22168 to indicate that names looked up in dependent types should be
22169 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22170 keyword has been used to indicate that the name that appears next
22171 is a template. TAG_TYPE indicates the explicit tag given before
22172 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22173 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22174 is the class being defined in a class-head. If ENUM_OK is TRUE,
22175 enum-names are also accepted.
22177 Returns the TYPE_DECL representing the class. */
22179 static tree
22188 {
22189 tree decl;
22190 tree scope;
22195 /* All class-names start with an identifier. */
22198 {
22201 }
22203 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22204 to a template-id, so we save it here. */
22209 /* Any name names a type if we're following the `typename' keyword
22210 in a qualified name where the enclosing scope is type-dependent. */
22213 /* Handle the common case (an identifier, but not a template-id)
22214 efficiently. */
22217 {
22221 /* Look for the identifier. */
22225 /* If the next token isn't an identifier, we are certainly not
22226 looking at a class-name. */
22229 /* If we know this is a type-name, there's no need to look it
22230 up. */
22233 else
22234 {
22235 tree ambiguous_decls;
22236 /* If we already know that this lookup is ambiguous, then
22237 we've already issued an error message; there's no reason
22238 to check again. */
22240 {
22243 }
22244 /* If the next token is a `::', then the name must be a type
22245 name.
22247 [basic.lookup.qual]
22249 During the lookup for a name preceding the :: scope
22250 resolution operator, object, function, and enumerator
22251 names are ignored. */
22254 /* Look up the name. */
22256 tag_type,
22259 check_dependency_p,
22263 {
22267 }
22268 }
22269 }
22270 else
22271 {
22272 /* Try a template-id. */
22274 check_dependency_p,
22275 tag_type,
22276 is_declaration);
22279 }
22283 /* If this is a typename, create a TYPENAME_TYPE. */
22285 {
22290 }
22294 /* Check to see that it is really the name of a class. */
22298 /* Situations like this:
22300 template <typename T> struct A {
22301 typename T::template X<int>::I i;
22302 };
22304 are problematic. Is `T::template X<int>' a class-name? The
22305 standard does not seem to be definitive, but there is no other
22306 valid interpretation of the following `::'. Therefore, those
22307 names are considered class-names. */
22308 {
22312 }
22317 /* In Objective-C 2.0, a classname followed by '.' starts a
22318 dot-syntax expression, and it's not a type-name. */
22330 }
22332 /* Parse a class-specifier.
22334 class-specifier:
22335 class-head { member-specification [opt] }
22337 Returns the TREE_TYPE representing the class. */
22339 static tree
22341 {
22342 tree type;
22356 /* Parse the class-head. */
22359 /* If the class-head was a semantic disaster, skip the entire body
22360 of the class. */
22362 {
22366 }
22368 /* Look for the `{'. */
22369 matching_braces braces;
22371 {
22374 }
22379 /* Issue an error message if type-definitions are forbidden here. */
22381 /* Remember that we are defining one more class. */
22383 /* Inside the class, surrounding template-parameter-lists do not
22384 apply. */
22385 saved_num_template_parameter_lists
22388 /* We are not in a function body. */
22391 /* Or in a loop. */
22394 /* Or in a switch. */
22397 /* We are not immediately inside an extern "lang" block. */
22398 saved_in_unbraced_linkage_specification_p
22402 // Associate constraints with the type.
22406 /* Start the class. */
22408 {
22411 }
22415 /* If the type is erroneous, skip the entire body of the class. */
22417 else
22418 /* Parse the member-specification. */
22421 /* Look for the trailing `}'. */
22423 /* Look for trailing attributes to apply to this class. */
22431 /* We've finished a type definition. Check for the common syntax
22432 error of forgetting a semicolon after the definition. We need to
22433 be careful, as we can't just check for not-a-semicolon and be done
22434 with it; the user might have typed:
22436 class X { } c = ...;
22437 class X { } *p = ...;
22439 and so forth. Instead, enumerate all the possible tokens that
22440 might follow this production; if we don't see one of them, then
22441 complain and silently insert the semicolon. */
22442 {
22447 /* Don't try to parse c++11 attributes here. As per the
22448 grammar, that should be a task for
22449 cp_parser_decl_specifier_seq. */
22453 {
22464 /* While it's legal for type qualifiers and storage class
22465 specifiers to follow type definitions in the grammar, only
22466 compiler testsuites contain code like that. Assume that if
22467 we see such code, then what we're really seeing is a case
22468 like:
22470 class X { }
22471 const <type> var = ...;
22473 or
22475 class Y { }
22476 static <type> func (...) ...
22478 i.e. the qualifier or specifier applies to the next
22479 declaration. To do so, however, we need to look ahead one
22480 more token to see if *that* token is a type specifier.
22482 This code could be improved to handle:
22484 class Z { }
22485 static const <type> var = ...; */
22488 {
22491 /* Handling user-defined types here would be nice, but very
22492 tricky. */
22493 want_semicolon
22496 }
22500 }
22502 /* If we don't have a type, then something is very wrong and we
22503 shouldn't try to do anything clever. Likewise for not seeing the
22504 closing brace. */
22506 {
22507 /* Locate the closing brace. */
22508 cp_token_position prev
22513 /* We want to suggest insertion of a ';' immediately *after* the
22514 closing brace, so, if we can, offset the location by 1 column. */
22521 /* If we successfully offset the location, suggest the fix-it. */
22534 else
22537 /* Unget one token and smash it to look as though we encountered
22538 a semicolon in the input stream. */
22543 }
22544 }
22546 /* If this class is not itself within the scope of another class,
22547 then we need to parse the bodies of all of the queued function
22548 definitions. Note that the queued functions defined in a class
22549 are not always processed immediately following the
22550 class-specifier for that class. Consider:
22552 struct A {
22553 struct B { void f() { sizeof (A); } };
22554 };
22556 If `f' were processed before the processing of `A' were
22557 completed, there would be no way to compute the size of `A'.
22558 Note that the nesting we are interested in here is lexical --
22559 not the semantic nesting given by TYPE_CONTEXT. In particular,
22560 for:
22562 struct A { struct B; };
22563 struct A::B { void f() { } };
22565 there is no need to delay the parsing of `A::B::f'. */
22567 {
22568 tree decl;
22575 /* In a first pass, parse default arguments to the functions.
22576 Then, in a second pass, parse the bodies of the functions.
22577 This two-phased approach handles cases like:
22579 struct S {
22580 void f() { g(); }
22581 void g(int i = 3);
22582 };
22584 */
22586 {
22588 /* If there are default arguments that have not yet been processed,
22589 take care of them now. */
22591 {
22596 }
22597 /* Make sure that any template parameters are in scope. */
22599 /* Parse the default argument expressions. */
22601 /* Remove any template parameters from the symbol table. */
22603 }
22605 /* Now parse any NSDMIs. */
22609 {
22611 {
22616 }
22619 }
22626 /* Now do some post-NSDMI bookkeeping. */
22632 /* Now parse the body of the functions. */
22634 {
22635 /* OpenMP UDRs need to be parsed before all other functions. */
22642 }
22643 else
22647 }
22648 else
22651 /* Put back any saved access checks. */
22654 /* Restore saved state. */
22658 parser->num_template_parameter_lists
22660 parser->in_unbraced_linkage_specification_p
22664 }
22666 static tree
22668 {
22669 tree ret;
22674 }
22676 /* Parse a class-head.
22678 class-head:
22679 class-key identifier [opt] base-clause [opt]
22680 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22681 class-key nested-name-specifier [opt] template-id
22682 base-clause [opt]
22684 class-virt-specifier:
22685 final
22687 GNU Extensions:
22688 class-key attributes identifier [opt] base-clause [opt]
22689 class-key attributes nested-name-specifier identifier base-clause [opt]
22690 class-key attributes nested-name-specifier [opt] template-id
22691 base-clause [opt]
22693 Upon return BASES is initialized to the list of base classes (or
22694 NULL, if there are none) in the same form returned by
22695 cp_parser_base_clause.
22697 Returns the TYPE of the indicated class. Sets
22698 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22699 involving a nested-name-specifier was used, and FALSE otherwise.
22701 Returns error_mark_node if this is not a class-head.
22703 Returns NULL_TREE if the class-head is syntactically valid, but
22704 semantically invalid in a way that means we should skip the entire
22705 body of the class. */
22707 static tree
22710 {
22711 tree nested_name_specifier;
22715 tree attributes;
22716 tree bases;
22726 /* Assume no nested-name-specifier will be present. */
22728 /* Assume no template parameter lists will be used in defining the
22729 type. */
22733 /* Look for the class-key. */
22740 /* Parse the attributes. */
22743 /* If the next token is `::', that is invalid -- but sometimes
22744 people do try to write:
22746 struct ::S {};
22748 Handle this gracefully by accepting the extra qualifier, and then
22749 issuing an error about it later if this really is a
22750 class-head. If it turns out just to be an elaborated type
22751 specifier, remain silent. */
22757 /* Determine the name of the class. Begin by looking for an
22758 optional nested-name-specifier. */
22760 nested_name_specifier
22766 /* If there was a nested-name-specifier, then there *must* be an
22767 identifier. */
22772 {
22774 /* Although the grammar says `identifier', it really means
22775 `class-name' or `template-name'. You are only allowed to
22776 define a class that has already been declared with this
22777 syntax.
22779 The proposed resolution for Core Issue 180 says that wherever
22780 you see `class T::X' you should treat `X' as a type-name.
22782 It is OK to define an inaccessible class; for example:
22784 class A { class B; };
22785 class A::B {};
22787 We do not know if we will see a class-name, or a
22788 template-name. We look for a class-name first, in case the
22789 class-name is a template-id; if we looked for the
22790 template-name first we would stop after the template-name. */
22797 class_type,
22801 /* If that didn't work, ignore the nested-name-specifier. */
22803 {
22809 }
22810 /* If we could not find a corresponding TYPE, treat this
22811 declaration like an unqualified declaration. */
22814 /* Otherwise, count the number of templates used in TYPE and its
22815 containing scopes. */
22816 else
22817 {
22818 tree scope;
22830 }
22831 }
22832 /* Otherwise, the identifier is optional. */
22833 else
22834 {
22835 /* We don't know whether what comes next is a template-id,
22836 an identifier, or nothing at all. */
22838 /* Check for a template-id. */
22843 class_key,
22845 /* If that didn't work, it could still be an identifier. */
22847 {
22849 {
22852 }
22853 else
22855 }
22856 else
22857 {
22860 }
22861 }
22866 {
22868 class_key,
22870 }
22873 /* If it's not a `:' or a `{' then we can't really be looking at a
22874 class-head, since a class-head only appears as part of a
22875 class-specifier. We have to detect this situation before calling
22876 xref_tag, since that has irreversible side-effects. */
22878 {
22882 }
22884 /* At this point, we're going ahead with the class-specifier, even
22885 if some other problem occurs. */
22888 {
22893 }
22894 /* Issue the error about the overly-qualified name now. */
22896 {
22901 }
22903 {
22908 }
22910 {
22911 tree scope;
22914 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22915 keyword template shall not appear at the top level. */
22919 /* Reject typedef-names in class heads. */
22921 {
22924 type);
22927 }
22929 /* Figure out in what scope the declaration is being placed. */
22931 /* If that scope does not contain the scope in which the
22932 class was originally declared, the program is invalid. */
22934 {
22937 "declaration of %qD in namespace %qD which does not "
22940 else
22946 }
22947 /* [dcl.meaning]
22949 A declarator-id shall not be qualified except for the
22950 definition of a ... nested class outside of its class
22951 ... [or] the definition or explicit instantiation of a
22952 class member of a namespace outside of its namespace. */
22954 {
22959 }
22960 }
22961 /* An explicit-specialization must be preceded by "template <>". If
22962 it is not, try to recover gracefully. */
22965 && !processing_template_parmlist
22967 {
22968 /* Build a location of this form:
22969 struct typename <ARGS>
22970 ^~~~~~~~~~~~~~~~~~~~~~
22971 with caret==start at the start token, and
22972 finishing at the end of the type. */
22973 location_t reported_loc
22975 class_head_start_location,
22981 "an explicit specialization must be preceded by"
22984 /* Take the same action that would have been taken by
22985 cp_parser_explicit_specialization. */
22988 }
22989 /* There must be no "return" statements between this point and the
22990 end of this function; set "type "to the correct return value and
22991 use "goto done;" to return. */
22992 /* Make sure that the right number of template parameters were
22993 present. */
22997 {
22998 /* If something went wrong, there is no point in even trying to
22999 process the class-definition. */
23002 }
23004 /* Look up the type. */
23006 {
23010 {
23014 }
23015 else
23016 {
23020 /* Check the scope while we still know whether or not we had a
23021 nested-name-specifier. */
23024 }
23027 }
23029 {
23030 tree class_type;
23032 /* Given:
23034 template <typename T> struct S { struct T };
23035 template <typename T> struct S<T>::T { };
23037 we will get a TYPENAME_TYPE when processing the definition of
23038 `S::T'. We need to resolve it to the actual type before we
23039 try to define it. */
23041 {
23046 else
23047 {
23050 }
23051 }
23055 {
23058 }
23061 /* Enter the scope indicated by the nested-name-specifier. */
23063 /* Get the canonical version of this type. */
23065 /* Call push_template_decl if it seems like we should be defining a
23066 template either from the template headers or the type we're
23067 defining, so that we diagnose both extra and missing headers. */
23071 {
23074 {
23077 }
23078 }
23082 }
23084 {
23085 /* If the class was unnamed, create a dummy name. */
23089 ? ts_within_enclosing_non_class
23093 }
23095 /* Indicate whether this class was declared as a `class' or as a
23096 `struct'. */
23101 /* If this type was already complete, and we see another definition,
23102 that's an error. */
23104 {
23106 type);
23108 type);
23111 }
23116 {
23117 /* Apply attributes now, before any use of the class as a template
23118 argument in its base list. */
23121 }
23123 /* We will have entered the scope containing the class; the names of
23124 base classes should be looked up in that context. For example:
23126 struct A { struct B {}; struct C; };
23127 struct A::C : B {};
23129 is valid. */
23131 /* Get the list of base-classes, if there is one. */
23133 {
23134 /* PR59482: enter the class scope so that base-specifiers are looked
23135 up correctly. */
23139 /* PR59482: get out of the previously pushed class scope so that the
23140 subsequent pops pop the right thing. */
23143 }
23144 else
23147 /* If we're really defining a class, process the base classes.
23148 If they're invalid, fail. */
23152 done:
23153 /* Leave the scope given by the nested-name-specifier. We will
23154 enter the class scope itself while processing the members. */
23159 {
23162 }
23168 out:
23171 }
23173 /* Parse a class-key.
23175 class-key:
23176 class
23177 struct
23178 union
23180 Returns the kind of class-key specified, or none_type to indicate
23181 error. */
23183 static enum tag_types
23185 {
23189 /* Look for the class-key. */
23194 /* Check to see if the TOKEN is a class-key. */
23199 }
23201 /* Parse a type-parameter-key.
23203 type-parameter-key:
23204 class
23205 typename
23206 */
23208 static void
23210 {
23211 /* Look for the type-parameter-key. */
23215 {
23218 /* typename is not allowed in a template template parameter
23219 by the standard until C++17. */
23221 "ISO C++ forbids typename key in template template parameter;"
23223 }
23224 else
23228 }
23230 /* Parse an (optional) member-specification.
23232 member-specification:
23233 member-declaration member-specification [opt]
23234 access-specifier : member-specification [opt] */
23236 static void
23238 {
23240 {
23244 /* Peek at the next token. */
23246 /* If it's a `}', or EOF then we've seen all the members. */
23252 /* See if this token is a keyword. */
23255 {
23259 /* Consume the access-specifier. */
23261 /* Remember which access-specifier is active. */
23263 /* Look for the `:'. */
23268 /* Accept #pragmas at class scope. */
23270 {
23273 }
23275 /* Otherwise, the next construction must be a
23276 member-declaration. */
23278 }
23279 }
23280 }
23282 /* Parse a member-declaration.
23284 member-declaration:
23285 decl-specifier-seq [opt] member-declarator-list [opt] ;
23286 function-definition ; [opt]
23287 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23288 using-declaration
23289 template-declaration
23290 alias-declaration
23292 member-declarator-list:
23293 member-declarator
23294 member-declarator-list , member-declarator
23296 member-declarator:
23297 declarator pure-specifier [opt]
23298 declarator constant-initializer [opt]
23299 identifier [opt] : constant-expression
23301 GNU Extensions:
23303 member-declaration:
23304 __extension__ member-declaration
23306 member-declarator:
23307 declarator attributes [opt] pure-specifier [opt]
23308 declarator attributes [opt] constant-initializer [opt]
23309 identifier [opt] attributes [opt] : constant-expression
23311 C++0x Extensions:
23313 member-declaration:
23314 static_assert-declaration */
23316 static void
23318 {
23319 cp_decl_specifier_seq decl_specifiers;
23320 tree prefix_attributes;
23321 tree decl;
23330 /* Check for the `__extension__' keyword. */
23332 {
23333 /* Recurse. */
23335 /* Restore the old value of the PEDANTIC flag. */
23339 }
23341 /* Check for a template-declaration. */
23343 {
23344 /* An explicit specialization here is an error condition, and we
23345 expect the specialization handler to detect and report this. */
23349 else
23353 }
23354 /* Check for a template introduction. */
23358 /* Check for a using-declaration. */
23360 {
23362 {
23363 /* Parse the using-declaration. */
23367 }
23368 else
23369 {
23370 tree decl;
23374 /* Note that if we actually see the '=' token after the
23375 identifier, cp_parser_alias_declaration commits the
23376 tentative parse. In that case, we really expect an
23377 alias-declaration. Otherwise, we expect a using
23378 declaration. */
23379 alias_decl_expected =
23385 else
23389 }
23390 }
23392 /* Check for @defs. */
23394 {
23399 {
23404 }
23406 }
23408 /* If the next token is `static_assert' we have a static assertion. */
23410 {
23413 }
23420 /* Parse the decl-specifier-seq. */
23423 CP_PARSER_FLAGS_OPTIONAL,
23426 /* Check for an invalid type-name. */
23430 /* If there is no declarator, then the decl-specifier-seq should
23431 specify a type. */
23433 {
23434 /* If there was no decl-specifier-seq, and the next token is a
23435 `;', then we have something like:
23437 struct S { ; };
23439 [class.mem]
23441 Each member-declaration shall declare at least one member
23442 name of the class. */
23444 {
23447 {
23451 }
23452 }
23453 else
23454 {
23455 tree type;
23457 /* See if this declaration is a friend. */
23459 /* If there were decl-specifiers, check to see if there was
23460 a class-declaration. */
23463 /* Nested classes have already been added to the class, but
23464 a `friend' needs to be explicitly registered. */
23466 {
23467 /* If the `friend' keyword was present, the friend must
23468 be introduced with a class-key. */
23471 "in C++03 a class-key must be used "
23473 /* In this case:
23475 template <typename T> struct A {
23476 friend struct A<T>::B;
23477 };
23479 A<T>::B will be represented by a TYPENAME_TYPE, and
23480 therefore not recognized by check_tag_decl. */
23482 {
23486 }
23489 "friend declaration does not name a class or "
23491 else
23494 }
23495 /* If there is no TYPE, an error message will already have
23496 been issued. */
23498 ;
23499 /* An anonymous aggregate has to be handled specially; such
23500 a declaration really declares a data member (with a
23501 particular type), as opposed to a nested class. */
23503 {
23504 /* C++11 9.5/6. */
23507 "a storage class on an anonymous aggregate "
23510 /* Remove constructors and such from TYPE, now that we
23511 know it is an anonymous aggregate. */
23513 /* And make the corresponding data member. */
23516 /* Add it to the class. */
23518 }
23519 else
23520 cp_parser_check_access_in_redeclaration
23523 }
23524 }
23525 else
23526 {
23529 /* Clear attributes from the decl_specifiers but keep them
23530 around as prefix attributes that apply them to the entity
23531 being declared. */
23535 /* See if these declarations will be friends. */
23538 /* Keep going until we hit the `;' at the end of the
23539 declaration. */
23541 {
23543 tree first_attribute;
23544 tree initializer;
23548 /* Peek at the next token. */
23551 /* The following code wants to know early if it is a bit-field
23552 or some other declaration. Attributes can appear before
23553 the `:' token, but are hopefully rare enough that the
23554 simplicity of the tentative lookup pays off. */
23559 {
23567 }
23569 /* Check for a bitfield declaration. */
23575 {
23576 tree identifier;
23577 tree width;
23582 else
23585 /* Look for attributes that apply to the bitfield. */
23588 /* Consume the `:' token. */
23591 /* Get the width of the bitfield. */
23595 /* In C++2A and as extension for C++11 and above we allow
23596 default member initializers for bit-fields. */
23601 CPP_OPEN_BRACE)))
23602 {
23603 location_t loc
23609 "default member initializers for bit-fields "
23610 "only available with -std=c++2a or "
23615 {
23619 }
23620 }
23621 else
23622 {
23623 /* Look for attributes that apply to the bitfield after
23624 the `:' token and width. This is where GCC used to
23625 parse attributes in the past, pedwarn if there is
23626 a std attribute. */
23629 "ISO C++ allows bit-field attributes only "
23633 }
23637 /* Remember which attributes are prefix attributes and
23638 which are not. */
23640 /* Combine the attributes. */
23643 /* Create the bitfield declaration. */
23646 identifier,
23647 sfk_none)
23651 attributes);
23652 }
23653 else
23654 {
23656 tree asm_specification;
23659 /* Parse the declarator. */
23660 declarator
23665 friend_p);
23667 /* If something went wrong parsing the declarator, make sure
23668 that we at least consume some tokens. */
23670 {
23671 /* Skip to the end of the statement. */
23673 /* If the next token is not a semicolon, that is
23674 probably because we just skipped over the body of
23675 a function. So, we consume a semicolon if
23676 present, but do not issue an error message if it
23677 is not present. */
23679 CPP_SEMICOLON))
23682 }
23685 cp_parser_check_for_definition_in_return_type
23689 /* Look for an asm-specification. */
23691 /* Look for attributes that apply to the declaration. */
23693 /* Remember which attributes are prefix attributes and
23694 which are not. */
23696 /* Combine the attributes. */
23699 /* If it's an `=', then we have a constant-initializer or a
23700 pure-specifier. It is not correct to parse the
23701 initializer before registering the member declaration
23702 since the member declaration should be in scope while
23703 its initializer is processed. However, the rest of the
23704 front end does not yet provide an interface that allows
23705 us to handle this correctly. */
23707 {
23708 /* In [class.mem]:
23710 A pure-specifier shall be used only in the declaration of
23711 a virtual function.
23713 A member-declarator can contain a constant-initializer
23714 only if it declares a static member of integral or
23715 enumeration type.
23717 Therefore, if the DECLARATOR is for a function, we look
23718 for a pure-specifier; otherwise, we look for a
23719 constant-initializer. When we call `grokfield', it will
23720 perform more stringent semantics checks. */
23732 {
23734 /* Don't require a constant rvalue in C++11, since we
23735 might want a reference constant. We'll enforce
23736 constancy later. */
23738 /* Parse the initializer. */
23741 }
23742 else
23743 /* Parse the initializer. */
23745 }
23748 {
23752 else
23754 }
23755 /* Otherwise, there is no initializer. */
23756 else
23759 /* See if we are probably looking at a function
23760 definition. We are certainly not looking at a
23761 member-declarator. Calling `grokfield' has
23762 side-effects, so we must not do it unless we are sure
23763 that we are looking at a member-declarator. */
23766 {
23767 /* The grammar does not allow a pure-specifier to be
23768 used when a member function is defined. (It is
23769 possible that this fact is an oversight in the
23770 standard, since a pure function may be defined
23771 outside of the class-specifier. */
23777 declarator,
23778 attributes);
23781 /* If the member was not a friend, declare it here. */
23784 /* Peek at the next token. */
23786 /* If the next token is a semicolon, consume it. */
23788 {
23789 location_t semicolon_loc
23794 "extra %<;%> after in-class "
23796 }
23798 }
23799 else
23802 /* Create the declaration. */
23807 {
23810 else
23812 }
23813 }
23818 /* Reset PREFIX_ATTRIBUTES. */
23824 /* If there is any qualification still in effect, clear it
23825 now; we will be starting fresh with the next declarator. */
23829 /* If it's a `,', then there are more declarators. */
23831 {
23834 {
23840 }
23841 }
23842 /* If the next token isn't a `;', then we have a parse error. */
23844 CPP_SEMICOLON))
23845 {
23846 /* The next token might be a ways away from where the
23847 actual semicolon is missing. Find the previous token
23848 and use that for our error position. */
23855 /* Assume that the user meant to provide a semicolon. If
23856 we were to cp_parser_skip_to_end_of_statement, we might
23857 skip to a semicolon inside a member function definition
23858 and issue nonsensical error messages. */
23860 }
23863 {
23864 /* Add DECL to the list of members. */
23866 /* Explicitly include, eg, NSDMIs, for better error
23867 recovery (c++/58650). */
23875 /* Add DECL to the queue of NSDMI to be parsed later. */
23877 }
23881 }
23882 }
23885 out:
23887 }
23889 /* Parse a pure-specifier.
23891 pure-specifier:
23892 = 0
23894 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23895 Otherwise, ERROR_MARK_NODE is returned. */
23897 static tree
23899 {
23902 /* Look for the `=' token. */
23905 /* Look for the `0' token. */
23914 /* Accept = default or = delete in c++0x mode. */
23917 {
23920 }
23922 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23924 {
23929 }
23931 {
23934 }
23937 }
23939 /* Parse a constant-initializer.
23941 constant-initializer:
23942 = constant-expression
23944 Returns a representation of the constant-expression. */
23946 static tree
23948 {
23949 /* Look for the `=' token. */
23953 /* It is invalid to write:
23955 struct S { static const int i = { 7 }; };
23957 */
23959 {
23962 /* Consume the opening brace. */
23963 matching_braces braces;
23965 /* Skip the initializer. */
23967 /* Look for the trailing `}'. */
23971 }
23974 }
23976 /* Derived classes [gram.class.derived] */
23978 /* Parse a base-clause.
23980 base-clause:
23981 : base-specifier-list
23983 base-specifier-list:
23984 base-specifier ... [opt]
23985 base-specifier-list , base-specifier ... [opt]
23987 Returns a TREE_LIST representing the base-classes, in the order in
23988 which they were declared. The representation of each node is as
23989 described by cp_parser_base_specifier.
23991 In the case that no bases are specified, this function will return
23992 NULL_TREE, not ERROR_MARK_NODE. */
23994 static tree
23996 {
23999 /* Look for the `:' that begins the list. */
24002 /* Scan the base-specifier-list. */
24004 {
24006 tree base;
24009 /* Look for the base-specifier. */
24011 /* Look for the (optional) ellipsis. */
24013 {
24014 /* Consume the `...'. */
24018 }
24020 /* Add BASE to the front of the list. */
24022 {
24024 /* Make this a pack expansion type. */
24028 {
24031 }
24032 }
24033 /* Peek at the next token. */
24035 /* If it's not a comma, then the list is complete. */
24038 /* Consume the `,'. */
24040 }
24042 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24043 base class had a qualified name. However, the next name that
24044 appears is certainly not qualified. */
24050 }
24052 /* Parse a base-specifier.
24054 base-specifier:
24055 :: [opt] nested-name-specifier [opt] class-name
24056 virtual access-specifier [opt] :: [opt] nested-name-specifier
24057 [opt] class-name
24058 access-specifier virtual [opt] :: [opt] nested-name-specifier
24059 [opt] class-name
24061 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24062 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24063 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24064 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24066 static tree
24068 {
24076 tree type;
24078 /* Process the optional `virtual' and `access-specifier'. */
24080 {
24081 /* Peek at the next token. */
24083 /* Process `virtual'. */
24085 {
24087 /* If `virtual' appears more than once, issue an error. */
24089 {
24093 }
24097 /* Consume the `virtual' token. */
24105 /* If more than one access specifier appears, issue an
24106 error. */
24109 {
24113 }
24117 /* Consume the access-specifier. */
24125 }
24126 }
24127 /* It is not uncommon to see programs mechanically, erroneously, use
24128 the 'typename' keyword to denote (dependent) qualified types
24129 as base classes. */
24131 {
24136 else
24138 "keyword %<typename%> not allowed in this context "
24141 }
24143 /* Look for the optional `::' operator. */
24145 /* Look for the nested-name-specifier. The simplest way to
24146 implement:
24148 [temp.res]
24150 The keyword `typename' is not permitted in a base-specifier or
24151 mem-initializer; in these contexts a qualified name that
24152 depends on a template-parameter is implicitly assumed to be a
24153 type name.
24155 is to pretend that we have seen the `typename' keyword at this
24156 point. */
24162 /* If the base class is given by a qualified name, assume that names
24163 we see are type names or templates, as appropriate. */
24169 /* DR 950 allows decltype as a base-specifier. */
24171 else
24172 {
24173 /* Otherwise, look for the class-name. */
24175 class_scope_p,
24176 template_p,
24177 typename_type,
24182 }
24188 }
24190 /* Exception handling [gram.exception] */
24192 /* Parse an (optional) noexcept-specification.
24194 noexcept-specification:
24195 noexcept ( constant-expression ) [opt]
24197 If no noexcept-specification is present, returns NULL_TREE.
24198 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24199 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24200 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24201 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24202 in which case a boolean condition is returned instead. */
24204 static tree
24209 {
24213 /* Peek at the next token. */
24216 /* Is it a noexcept-specification? */
24218 {
24219 tree expr;
24223 {
24224 matching_parens parens;
24228 {
24229 /* Types may not be defined in an exception-specification. */
24231 parser->type_definition_forbidden_message
24236 /* Restore the saved message. */
24238 }
24239 else
24240 {
24243 }
24246 }
24247 else
24248 {
24252 }
24254 /* We cannot build a noexcept-spec right away because this will check
24255 that expr is a constexpr. */
24258 else
24260 }
24261 else
24263 }
24265 /* Parse an (optional) exception-specification.
24267 exception-specification:
24268 throw ( type-id-list [opt] )
24270 Returns a TREE_LIST representing the exception-specification. The
24271 TREE_VALUE of each node is a type. */
24273 static tree
24275 {
24277 tree type_id_list;
24280 /* Peek at the next token. */
24283 /* Is it a noexcept-specification? */
24289 /* If it's not `throw', then there's no exception-specification. */
24295 /* Consume the `throw'. */
24298 /* Look for the `('. */
24299 matching_parens parens;
24302 /* Peek at the next token. */
24304 /* If it's not a `)', then there is a type-id-list. */
24306 {
24307 /* Types may not be defined in an exception-specification. */
24309 parser->type_definition_forbidden_message
24311 /* Parse the type-id-list. */
24313 /* Restore the saved message. */
24317 {
24321 }
24324 "dynamic exception specifications are deprecated in "
24326 }
24327 /* In C++17, throw() is equivalent to noexcept (true). throw()
24328 is deprecated in C++11 and above as well, but is still widely used,
24329 so don't warn about it yet. */
24332 else
24335 /* Look for the `)'. */
24339 }
24341 /* Parse an (optional) type-id-list.
24343 type-id-list:
24344 type-id ... [opt]
24345 type-id-list , type-id ... [opt]
24347 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24348 in the order that the types were presented. */
24350 static tree
24352 {
24356 {
24358 tree type;
24362 /* Get the next type-id. */
24364 /* Check for invalid 'auto'. */
24366 {
24370 }
24371 /* Parse the optional ellipsis. */
24373 {
24374 /* Consume the `...'. */
24377 /* Turn the type into a pack expansion expression. */
24379 }
24380 /* Add it to the list. */
24382 /* Peek at the next token. */
24384 /* If it is not a `,', we are done. */
24387 /* Consume the `,'. */
24389 }
24392 }
24394 /* Parse a try-block.
24396 try-block:
24397 try compound-statement handler-seq */
24399 static tree
24401 {
24402 tree try_block;
24416 }
24418 /* Parse a function-try-block.
24420 function-try-block:
24421 try ctor-initializer [opt] function-body handler-seq */
24423 static void
24425 {
24426 tree compound_stmt;
24427 tree try_block;
24429 /* Look for the `try' keyword. */
24432 /* Let the rest of the front end know where we are. */
24434 /* Parse the function-body. */
24435 cp_parser_ctor_initializer_opt_and_function_body
24437 /* We're done with the `try' part. */
24439 /* Parse the handlers. */
24441 /* We're done with the handlers. */
24443 }
24445 /* Parse a handler-seq.
24447 handler-seq:
24448 handler handler-seq [opt] */
24450 static void
24452 {
24454 {
24457 /* Parse the handler. */
24459 /* Peek at the next token. */
24461 /* If it's not `catch' then there are no more handlers. */
24464 }
24465 }
24467 /* Parse a handler.
24469 handler:
24470 catch ( exception-declaration ) compound-statement */
24472 static void
24474 {
24475 tree handler;
24476 tree declaration;
24480 matching_parens parens;
24487 }
24489 /* Parse an exception-declaration.
24491 exception-declaration:
24492 type-specifier-seq declarator
24493 type-specifier-seq abstract-declarator
24494 type-specifier-seq
24495 ...
24497 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24498 ellipsis variant is used. */
24500 static tree
24502 {
24503 cp_decl_specifier_seq type_specifiers;
24507 /* If it's an ellipsis, it's easy to handle. */
24509 {
24510 /* Consume the `...' token. */
24513 }
24515 /* Types may not be defined in exception-declarations. */
24517 parser->type_definition_forbidden_message
24520 /* Parse the type-specifier-seq. */
24524 /* If it's a `)', then there is no declarator. */
24527 else
24534 /* Restore the saved message. */
24541 }
24543 /* Parse a throw-expression.
24545 throw-expression:
24546 throw assignment-expression [opt]
24548 Returns a THROW_EXPR representing the throw-expression. */
24550 static tree
24552 {
24553 tree expression;
24558 /* Figure out whether or not there is an assignment-expression
24559 following the "throw" keyword. */
24567 else
24571 }
24573 /* GNU Extensions */
24575 /* Parse an (optional) asm-specification.
24577 asm-specification:
24578 asm ( string-literal )
24580 If the asm-specification is present, returns a STRING_CST
24581 corresponding to the string-literal. Otherwise, returns
24582 NULL_TREE. */
24584 static tree
24586 {
24588 tree asm_specification;
24590 /* Peek at the next token. */
24592 /* If the next token isn't the `asm' keyword, then there's no
24593 asm-specification. */
24597 /* Consume the `asm' token. */
24599 /* Look for the `('. */
24600 matching_parens parens;
24603 /* Look for the string-literal. */
24606 /* Look for the `)'. */
24610 }
24612 /* Parse an asm-operand-list.
24614 asm-operand-list:
24615 asm-operand
24616 asm-operand-list , asm-operand
24618 asm-operand:
24619 string-literal ( expression )
24620 [ string-literal ] string-literal ( expression )
24622 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24623 each node is the expression. The TREE_PURPOSE is itself a
24624 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24625 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24626 is a STRING_CST for the string literal before the parenthesis. Returns
24627 ERROR_MARK_NODE if any of the operands are invalid. */
24629 static tree
24631 {
24636 {
24637 tree string_literal;
24638 tree expression;
24639 tree name;
24642 {
24643 /* Consume the `[' token. */
24645 /* Read the operand name. */
24650 /* Look for the closing `]'. */
24652 }
24653 else
24655 /* Look for the string-literal. */
24658 /* Look for the `('. */
24659 matching_parens parens;
24661 /* Parse the expression. */
24663 /* Look for the `)'. */
24671 /* Add this operand to the list. */
24673 expression,
24674 asm_operands);
24675 /* If the next token is not a `,', there are no more
24676 operands. */
24679 /* Consume the `,'. */
24681 }
24684 }
24686 /* Parse an asm-clobber-list.
24688 asm-clobber-list:
24689 string-literal
24690 asm-clobber-list , string-literal
24692 Returns a TREE_LIST, indicating the clobbers in the order that they
24693 appeared. The TREE_VALUE of each node is a STRING_CST. */
24695 static tree
24697 {
24701 {
24702 tree string_literal;
24704 /* Look for the string literal. */
24706 /* Add it to the list. */
24708 /* If the next token is not a `,', then the list is
24709 complete. */
24712 /* Consume the `,' token. */
24714 }
24717 }
24719 /* Parse an asm-label-list.
24721 asm-label-list:
24722 identifier
24723 asm-label-list , identifier
24725 Returns a TREE_LIST, indicating the labels in the order that they
24726 appeared. The TREE_VALUE of each node is a label. */
24728 static tree
24730 {
24734 {
24737 /* Look for the identifier. */
24740 {
24743 {
24749 }
24750 }
24751 /* If the next token is not a `,', then the list is
24752 complete. */
24755 /* Consume the `,' token. */
24757 }
24760 }
24762 /* Return TRUE iff the next tokens in the stream are possibly the
24763 beginning of a GNU extension attribute. */
24765 static bool
24767 {
24769 }
24771 /* Return TRUE iff the next tokens in the stream are possibly the
24772 beginning of a standard C++-11 attribute specifier. */
24774 static bool
24776 {
24778 }
24780 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24781 beginning of a standard C++-11 attribute specifier. */
24783 static bool
24785 {
24793 }
24795 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24796 beginning of a GNU extension attribute. */
24798 static bool
24800 {
24804 }
24806 /* Return true iff the next tokens can be the beginning of either a
24807 GNU attribute list, or a standard C++11 attribute sequence. */
24809 static bool
24811 {
24814 }
24816 /* Return true iff the next Nth tokens can be the beginning of either
24817 a GNU attribute list, or a standard C++11 attribute sequence. */
24819 static bool
24821 {
24824 }
24826 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24827 of GNU attributes, or return NULL. */
24829 static tree
24831 {
24835 }
24837 /* Parse an (optional) series of attributes.
24839 attributes:
24840 attributes attribute
24842 attribute:
24843 __attribute__ (( attribute-list [opt] ))
24845 The return value is as for cp_parser_gnu_attribute_list. */
24847 static tree
24849 {
24853 {
24855 tree attribute_list;
24858 /* Peek at the next token. */
24860 /* If it's not `__attribute__', then we're done. */
24864 /* Consume the `__attribute__' keyword. */
24866 /* Look for the two `(' tokens. */
24867 matching_parens outer_parens;
24869 matching_parens inner_parens;
24872 /* Peek at the next token. */
24875 /* Parse the attribute-list. */
24877 else
24878 /* If the next token is a `)', then there is no attribute
24879 list. */
24882 /* Look for the two `)' tokens. */
24890 /* Add these new attributes to the list. */
24892 }
24895 }
24897 /* Parse a GNU attribute-list.
24899 attribute-list:
24900 attribute
24901 attribute-list , attribute
24903 attribute:
24904 identifier
24905 identifier ( identifier )
24906 identifier ( identifier , expression-list )
24907 identifier ( expression-list )
24909 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24910 to an attribute. The TREE_PURPOSE of each node is the identifier
24911 indicating which attribute is in use. The TREE_VALUE represents
24912 the arguments, if any. */
24914 static tree
24916 {
24922 {
24924 tree identifier;
24925 tree attribute;
24927 /* Look for the identifier. We also allow keywords here; for
24928 example `__attribute__ ((const))' is legal. */
24932 {
24935 /* Consume the token, but save it since we need it for the
24936 SIMD enabled function parsing. */
24939 /* Save away the identifier that indicates which attribute
24940 this is. */
24942 /* For keywords, use the canonical spelling, not the
24943 parsed identifier. */
24950 /* Peek at the next token. */
24952 /* If it's an `(', then parse the attribute arguments. */
24954 {
24958 vec = cp_parser_parenthesized_expression_list
24964 else
24965 {
24968 }
24969 /* Save the arguments away. */
24971 }
24974 {
24975 /* Add this attribute to the list. */
24978 }
24981 }
24982 /* Now, look for more attributes. If the next token isn't a
24983 `,', we're done. */
24987 /* Consume the comma and keep going. */
24989 }
24992 /* We built up the list in reverse order. */
24994 }
24996 /* Parse a standard C++11 attribute.
24998 The returned representation is a TREE_LIST which TREE_PURPOSE is
24999 the scoped name of the attribute, and the TREE_VALUE is its
25000 arguments list.
25002 Note that the scoped name of the attribute is itself a TREE_LIST
25003 which TREE_PURPOSE is the namespace of the attribute, and
25004 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25005 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25006 and which TREE_PURPOSE is directly the attribute name.
25008 Clients of the attribute code should use get_attribute_namespace
25009 and get_attribute_name to get the actual namespace and name of
25010 attributes, regardless of their being GNU or C++11 attributes.
25012 attribute:
25013 attribute-token attribute-argument-clause [opt]
25015 attribute-token:
25016 identifier
25017 attribute-scoped-token
25019 attribute-scoped-token:
25020 attribute-namespace :: identifier
25022 attribute-namespace:
25023 identifier
25025 attribute-argument-clause:
25026 ( balanced-token-seq )
25028 balanced-token-seq:
25029 balanced-token [opt]
25030 balanced-token-seq balanced-token
25032 balanced-token:
25033 ( balanced-token-seq )
25034 [ balanced-token-seq ]
25035 { balanced-token-seq }. */
25037 static tree
25039 {
25043 /* First, parse name of the attribute, a.k.a attribute-token. */
25060 {
25061 /* We are seeing a scoped attribute token. */
25076 else
25077 {
25081 }
25085 NULL_TREE);
25087 }
25090 NULL_TREE);
25091 else
25092 {
25095 NULL_TREE);
25096 /* C++11 noreturn attribute is equivalent to GNU's. */
25099 /* C++14 deprecated attribute is equivalent to GNU's. */
25102 /* C++17 fallthrough attribute is equivalent to GNU's. */
25105 /* Transactional Memory TS optimize_for_synchronized attribute is
25106 equivalent to GNU transaction_callable. */
25110 /* Transactional Memory attributes are GNU attributes. */
25113 }
25115 /* Now parse the optional argument clause of the attribute. */
25120 {
25126 /* A GNU attribute that takes an identifier in parameter. */
25129 vec = cp_parser_parenthesized_expression_list
25135 else
25136 {
25139 }
25143 else
25145 }
25148 }
25150 /* Check that the attribute ATTRIBUTE appears at most once in the
25151 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25152 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25153 isn't implemented yet in GCC. */
25155 static void
25157 {
25159 {
25169 }
25170 }
25172 /* Parse a list of standard C++-11 attributes.
25174 attribute-list:
25175 attribute [opt]
25176 attribute-list , attribute[opt]
25177 attribute ...
25178 attribute-list , attribute ...
25179 */
25181 static tree
25183 {
25188 {
25193 {
25197 }
25200 {
25205 else
25206 {
25211 }
25213 }
25217 }
25220 }
25222 /* Parse a standard C++-11 attribute specifier.
25224 attribute-specifier:
25225 [ [ attribute-using-prefix [opt] attribute-list ] ]
25226 alignment-specifier
25228 attribute-using-prefix:
25229 using attribute-namespace :
25231 alignment-specifier:
25232 alignas ( type-id ... [opt] )
25233 alignas ( alignment-expression ... [opt] ). */
25235 static tree
25237 {
25243 {
25250 {
25261 {
25265 "attribute using prefix only available "
25271 }
25272 else
25274 }
25281 else
25282 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25283 when we are sure that we have actually parsed them. */
25285 }
25286 else
25287 {
25288 tree alignas_expr;
25290 /* Look for an alignment-specifier. */
25301 matching_parens parens;
25303 {
25306 }
25312 {
25319 }
25324 /* Handle alignas (pack...). */
25326 {
25329 }
25331 /* Something went wrong, so don't build the attribute. */
25336 {
25339 }
25341 /* Build the C++-11 representation of an 'aligned'
25342 attribute. */
25343 attributes =
25346 alignas_expr);
25347 }
25350 }
25352 /* Parse a standard C++-11 attribute-specifier-seq.
25354 attribute-specifier-seq:
25355 attribute-specifier-seq [opt] attribute-specifier
25356 */
25358 static tree
25360 {
25365 {
25374 else
25377 }
25380 }
25382 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25383 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25384 current value of the PEDANTIC flag, regardless of whether or not
25385 the `__extension__' keyword is present. The caller is responsible
25386 for restoring the value of the PEDANTIC flag. */
25388 static bool
25390 {
25391 /* Save the old value of the PEDANTIC flag. */
25395 {
25396 /* Consume the `__extension__' token. */
25398 /* We're not being pedantic while the `__extension__' keyword is
25399 in effect. */
25403 }
25406 }
25408 /* Parse a label declaration.
25410 label-declaration:
25411 __label__ label-declarator-seq ;
25413 label-declarator-seq:
25414 identifier , label-declarator-seq
25415 identifier */
25417 static void
25419 {
25420 /* Look for the `__label__' keyword. */
25424 {
25425 tree identifier;
25427 /* Look for an identifier. */
25429 /* If we failed, stop. */
25432 /* Declare it as a label. */
25434 /* If the next token is a `;', stop. */
25437 /* Look for the `,' separating the label declarations. */
25439 }
25441 /* Look for the final `;'. */
25443 }
25445 // -------------------------------------------------------------------------- //
25446 // Requires Clause
25448 // Parse a requires clause.
25449 //
25450 // requires-clause:
25451 // 'requires' logical-or-expression
25452 //
25453 // The required logical-or-expression must be a constant expression. Note
25454 // that we don't check that the expression is constepxr here. We defer until
25455 // we analyze constraints and then, we only check atomic constraints.
25456 static tree
25458 {
25459 // Parse the requires clause so that it is not automatically folded.
25467 }
25469 // Optionally parse a requires clause:
25470 static tree
25472 {
25475 {
25478 {
25481 /* Parse and discard the requires-clause. */
25484 }
25486 }
25489 }
25492 /*---------------------------------------------------------------------------
25493 Requires expressions
25494 ---------------------------------------------------------------------------*/
25496 /* Parse a requires expression
25498 requirement-expression:
25499 'requires' requirement-parameter-list [opt] requirement-body */
25500 static tree
25502 {
25506 /* A requires-expression shall appear only within a concept
25507 definition or a requires-clause.
25509 TODO: Implement this diagnostic correctly. */
25511 {
25515 }
25518 {
25519 /* Local parameters are delared as variables within the scope
25520 of the expression. They are not visible past the end of
25521 the expression. Expressions within the requires-expression
25522 are unevaluated. */
25523 struct scope_sentinel
25524 {
25526 {
25529 }
25532 {
25535 }
25538 /* Parse the optional parameter list. */
25540 {
25544 }
25545 else
25548 /* Parse the requirement body. */
25552 }
25554 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25555 the parm chain. */
25558 }
25560 /* Parse a parameterized requirement.
25562 requirement-parameter-list:
25563 '(' parameter-declaration-clause ')' */
25564 static tree
25566 {
25567 matching_parens parens;
25577 }
25579 /* Parse the body of a requirement.
25581 requirement-body:
25582 '{' requirement-list '}' */
25583 static tree
25585 {
25586 matching_braces braces;
25596 }
25598 /* Parse a list of requirements.
25600 requirement-list:
25601 requirement
25602 requirement-list ';' requirement[opt] */
25603 static tree
25605 {
25608 {
25615 /* If we see a semi-colon, consume it. */
25619 /* Stop processing at the end of the list. */
25622 }
25624 /* Reverse the order of requirements so they are analyzed in
25625 declaration order. */
25627 }
25629 /* Parse a syntactic requirement or type requirement.
25631 requirement:
25632 simple-requirement
25633 compound-requirement
25634 type-requirement
25635 nested-requirement */
25636 static tree
25638 {
25645 else
25647 }
25649 /* Parse a simple requirement.
25651 simple-requirement:
25652 expression ';' */
25653 static tree
25655 {
25664 }
25666 /* Parse a type requirement
25668 type-requirement
25669 nested-name-specifier [opt] required-type-name ';'
25671 required-type-name:
25672 type-name
25673 'template' [opt] simple-template-id */
25674 static tree
25676 {
25679 // Save the scope before parsing name specifiers.
25690 tree type;
25692 {
25701 }
25702 else
25721 }
25723 /* Parse a compound requirement
25725 compound-requirement:
25726 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25727 static tree
25729 {
25730 /* Parse an expression enclosed in '{ }'s. */
25731 matching_braces braces;
25742 /* Parse the optional noexcept. */
25745 {
25748 }
25750 /* Parse the optional trailing return type. */
25753 {
25761 }
25764 }
25766 /* Parse a nested requirement. This is the same as a requires clause.
25768 nested-requirement:
25769 requires-clause */
25770 static tree
25772 {
25778 }
25780 /* Support Functions */
25782 /* Return the appropriate prefer_type argument for lookup_name_real based on
25783 tag_type and template_mem_access. */
25787 {
25788 /* DR 141: When looking in the current enclosing context for a template-name
25789 after -> or ., only consider class templates. */
25793 {
25797 }
25798 }
25800 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25801 NAME should have one of the representations used for an
25802 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25803 is returned. If PARSER->SCOPE is a dependent type, then a
25804 SCOPE_REF is returned.
25806 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25807 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25808 was formed. Abstractly, such entities should not be passed to this
25809 function, because they do not need to be looked up, but it is
25810 simpler to check for this special case here, rather than at the
25811 call-sites.
25813 In cases not explicitly covered above, this function returns a
25814 DECL, OVERLOAD, or baselink representing the result of the lookup.
25815 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25816 is returned.
25818 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25819 (e.g., "struct") that was used. In that case bindings that do not
25820 refer to types are ignored.
25822 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25823 ignored.
25825 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25826 are ignored.
25828 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25829 types.
25831 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25832 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25833 NULL_TREE otherwise. */
25835 static cp_expr
25842 location_t name_location)
25843 {
25844 tree decl;
25847 /* Assume that the lookup will be unambiguous. */
25851 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25852 no longer valid. Note that if we are parsing tentatively, and
25853 the parse fails, OBJECT_TYPE will be automatically restored. */
25859 /* A template-id has already been resolved; there is no lookup to
25860 do. */
25864 {
25868 }
25870 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25871 it should already have been checked to make sure that the name
25872 used matches the type being destroyed. */
25874 {
25875 tree type;
25877 /* Figure out to which type this destructor applies. */
25882 else
25884 /* If that's not a class type, there is no destructor. */
25895 }
25897 /* By this point, the NAME should be an ordinary identifier. If
25898 the id-expression was a qualified name, the qualifying scope is
25899 stored in PARSER->SCOPE at this point. */
25902 /* Perform the lookup. */
25904 {
25910 /* If the SCOPE is dependent, the lookup must be deferred until
25911 the template is instantiated -- unless we are explicitly
25912 looking up names in uninstantiated templates. Even then, we
25913 cannot look up the name if the scope is not a class type; it
25914 might, for example, be a template type parameter. */
25919 /* Defer lookup. */
25921 else
25922 {
25925 /* If PARSER->SCOPE is a dependent type, then it must be a
25926 class type, and we must not be checking dependencies;
25927 otherwise, we would have processed this lookup above. So
25928 that PARSER->SCOPE is not considered a dependent base by
25929 lookup_member, we must enter the scope here. */
25933 /* If the PARSER->SCOPE is a template specialization, it
25934 may be instantiated during name lookup. In that case,
25935 errors may be issued. Even if we rollback the current
25936 tentative parse, those errors are valid. */
25941 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25942 lookup result and the nested-name-specifier nominates a class C:
25943 * if the name specified after the nested-name-specifier, when
25944 looked up in C, is the injected-class-name of C (Clause 9), or
25945 * if the name specified after the nested-name-specifier is the
25946 same as the identifier or the simple-template-id's template-
25947 name in the last component of the nested-name-specifier,
25948 the name is instead considered to name the constructor of
25949 class C. [ Note: for example, the constructor is not an
25950 acceptable lookup result in an elaborated-type-specifier so
25951 the constructor would not be used in place of the
25952 injected-class-name. --end note ] Such a constructor name
25953 shall be used only in the declarator-id of a declaration that
25954 names a constructor or in a using-declaration. */
25962 /* If we have a single function from a using decl, pull it out. */
25969 }
25971 /* If the scope is a dependent type and either we deferred lookup or
25972 we did lookup but didn't find the name, rememeber the name. */
25975 {
25977 {
25978 tree type;
25980 /* The resolution to Core Issue 180 says that `struct
25981 A::B' should be considered a type-name, even if `A'
25982 is dependent. */
25987 }
25991 CPP_CLOSE_PAREN)))
25995 else
25998 is_template);
25999 }
26002 }
26004 {
26005 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26006 OBJECT_TYPE is not a class. */
26008 /* If the OBJECT_TYPE is a template specialization, it may
26009 be instantiated during name lookup. In that case, errors
26010 may be issued. Even if we rollback the current tentative
26011 parse, those errors are valid. */
26013 name,
26016 tf_warning_or_error);
26017 else
26021 /* Look it up in the enclosing context. DR 141: When looking for a
26022 template-name after -> or ., only consider class templates. */
26027 /* The object is type-dependent, so we can't look anything up; we used
26028 this to get the DR 141 behavior. */
26032 }
26033 else
26034 {
26040 }
26042 /* If the lookup failed, let our caller know. */
26046 /* Pull out the template from an injected-class-name (or multiple). */
26050 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26052 {
26055 /* The error message we have to print is too complicated for
26056 cp_parser_error, so we incorporate its actions directly. */
26058 {
26060 name);
26062 }
26064 }
26072 /* If we have resolved the name of a member declaration, check to
26073 see if the declaration is accessible. When the name resolves to
26074 set of overloaded functions, accessibility is checked when
26075 overload resolution is done.
26077 During an explicit instantiation, access is not checked at all,
26078 as per [temp.explicit]. */
26085 }
26087 /* Like cp_parser_lookup_name, but for use in the typical case where
26088 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26089 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26091 static tree
26093 {
26095 none_type,
26100 location);
26101 }
26103 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26104 the current context, return the TYPE_DECL. If TAG_NAME_P is
26105 true, the DECL indicates the class being defined in a class-head,
26106 or declared in an elaborated-type-specifier.
26108 Otherwise, return DECL. */
26110 static tree
26112 {
26113 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26114 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26116 struct A {
26117 template <typename T> struct B;
26118 };
26120 template <typename T> struct A::B {};
26122 Similarly, in an elaborated-type-specifier:
26124 namespace N { struct X{}; }
26126 struct A {
26127 template <typename T> friend struct N::X;
26128 };
26130 However, if the DECL refers to a class type, and we are in
26131 the scope of the class, then the name lookup automatically
26132 finds the TYPE_DECL created by build_self_reference rather
26133 than a TEMPLATE_DECL. For example, in:
26135 template <class T> struct S {
26136 S s;
26137 };
26139 there is no need to handle such case. */
26145 }
26147 /* If too many, or too few, template-parameter lists apply to the
26148 declarator, issue an error message. Returns TRUE if all went well,
26149 and FALSE otherwise. */
26151 static bool
26154 location_t declarator_location)
26155 {
26157 {
26159 {
26167 /* If the DECLARATOR has the form `X<y>' then it uses one
26168 additional level of template parameters. */
26171 return cp_parser_check_template_parameters
26173 }
26189 }
26191 }
26193 /* NUM_TEMPLATES were used in the current declaration. If that is
26194 invalid, return FALSE and issue an error messages. Otherwise,
26195 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26196 declarator and we can print more accurate diagnostics. */
26198 static bool
26201 location_t location,
26203 {
26204 /* If there are the same number of template classes and parameter
26205 lists, that's OK. */
26208 /* If there are more, but only one more, then we are referring to a
26209 member template. That's OK too. */
26212 /* If there are more template classes than parameter lists, we have
26213 something like:
26215 template <class T> void S<T>::R<T>::f (); */
26217 {
26227 else
26230 }
26231 /* Otherwise, there are too many template parameter lists. We have
26232 something like:
26234 template <class T> template <class U> void S::f(); */
26237 }
26239 /* Parse an optional `::' token indicating that the following name is
26240 from the global namespace. If so, PARSER->SCOPE is set to the
26241 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26242 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26243 Returns the new value of PARSER->SCOPE, if the `::' token is
26244 present, and NULL_TREE otherwise. */
26246 static tree
26248 {
26251 /* Peek at the next token. */
26253 /* If we're looking at a `::' token then we're starting from the
26254 global namespace, not our current location. */
26256 {
26257 /* Consume the `::' token. */
26259 /* Set the SCOPE so that we know where to start the lookup. */
26265 }
26267 {
26271 }
26274 }
26276 /* Returns TRUE if the upcoming token sequence is the start of a
26277 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26278 declarator is preceded by the `friend' specifier. */
26280 static bool
26282 {
26285 tree nested_name_specifier;
26288 /* The common case is that this is not a constructor declarator, so
26289 try to avoid doing lots of work if at all possible. It's not
26290 valid declare a constructor at function scope. */
26293 /* And only certain tokens can begin a constructor declarator. */
26301 /* Parse tentatively; we are going to roll back all of the tokens
26302 consumed here. */
26304 /* Assume that we are looking at a constructor declarator. */
26307 /* Look for the optional `::' operator. */
26310 /* Look for the nested-name-specifier. */
26311 nested_name_specifier
26322 /* Outside of a class-specifier, there must be a
26323 nested-name-specifier. Except in C++17 mode, where we
26324 might be declaring a guiding declaration. */
26331 /* If we have a class scope, this is easy; DR 147 says that S::S always
26332 names the constructor, and no other qualified name could. */
26335 {
26345 }
26346 /* If we still think that this might be a constructor-declarator,
26347 look for a class-name. */
26349 {
26350 /* If we have:
26352 template <typename T> struct S {
26353 S();
26354 };
26356 we must recognize that the nested `S' names a class. */
26360 tree type_decl;
26364 none_type,
26371 {
26377 none_type,
26382 else
26384 }
26386 /* If there was no class-name, then this is not a constructor.
26387 Otherwise, if we are in a class-specifier and we aren't
26388 handling a friend declaration, check that its type matches
26389 current_class_type (c++/38313). Note: error_mark_node
26390 is left alone for error recovery purposes. */
26392 && (outside_class_specifier_p
26398 /* If we're still considering a constructor, we have to see a `(',
26399 to begin the parameter-declaration-clause, followed by either a
26400 `)', an `...', or a decl-specifier. We need to check for a
26401 type-specifier to avoid being fooled into thinking that:
26403 S (f) (int);
26405 is a constructor. (It is actually a function named `f' that
26406 takes one parameter (of type `int') and returns a value of type
26407 `S'. */
26415 /* A parameter declaration begins with a decl-specifier,
26416 which is either the "attribute" keyword, a storage class
26417 specifier, or (usually) a type-specifier. */
26419 {
26420 tree type;
26424 /* Names appearing in the type-specifier should be looked up
26425 in the scope of the class. */
26429 {
26432 {
26436 {
26439 }
26440 }
26442 }
26444 /* Inside the constructor parameter list, surrounding
26445 template-parameter-lists do not apply. */
26446 saved_num_template_parameter_lists
26450 /* Look for the type-specifier. */
26452 CP_PARSER_FLAGS_NONE,
26458 parser->num_template_parameter_lists
26461 /* Leave the scope of the class. */
26466 }
26467 }
26469 /* We did not really want to consume any tokens. */
26473 }
26475 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26476 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26477 they must be performed once we are in the scope of the function.
26479 Returns the function defined. */
26481 static tree
26482 cp_parser_function_definition_from_specifiers_and_declarator
26485 tree attributes,
26487 {
26488 tree fn;
26491 /* Begin the function-definition. */
26494 /* The things we're about to see are not directly qualified by any
26495 template headers we've seen thus far. */
26498 /* If there were names looked up in the decl-specifier-seq that we
26499 did not check, check them now. We must wait until we are in the
26500 scope of the function to perform the checks, since the function
26501 might be a friend. */
26505 {
26510 }
26513 {
26514 /* Skip the entire function. */
26517 }
26519 {
26520 /* Seen already, skip it. An error message has already been output. */
26524 /* If this is a function from a class, pop the nested class. */
26527 }
26528 else
26529 {
26530 timevar_id_t tv;
26533 else
26539 }
26542 }
26544 /* Parse the part of a function-definition that follows the
26545 declarator. INLINE_P is TRUE iff this function is an inline
26546 function defined within a class-specifier.
26548 Returns the function defined. */
26550 static tree
26553 {
26554 tree fn;
26559 bool fully_implicit_function_template_p
26562 tree implicit_template_parms
26565 cp_binding_level* implicit_template_scope
26571 /* If the next token is `return', then the code may be trying to
26572 make use of the "named return value" extension that G++ used to
26573 support. */
26576 {
26577 /* Consume the `return' keyword. */
26579 /* Look for the identifier that indicates what value is to be
26580 returned. */
26582 /* Issue an error message. */
26585 /* Skip tokens until we reach the start of the function body. */
26587 {
26594 }
26595 }
26596 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26597 anything declared inside `f'. */
26598 saved_in_unbraced_linkage_specification_p
26601 /* Inside the function, surrounding template-parameter-lists do not
26602 apply. */
26603 saved_num_template_parameter_lists
26607 /* If the next token is `try', `__transaction_atomic', or
26608 `__transaction_relaxed`, then we are looking at either function-try-block
26609 or function-transaction-block. Note that all of these include the
26610 function-body. */
26614 RID_TRANSACTION_RELAXED))
26618 else
26619 cp_parser_ctor_initializer_opt_and_function_body
26622 /* Finish the function. */
26624 /* Generate code for it, if necessary. */
26626 /* Restore the saved values. */
26627 parser->in_unbraced_linkage_specification_p
26629 parser->num_template_parameter_lists
26633 parser->fully_implicit_function_template_p
26635 parser->implicit_template_parms
26637 parser->implicit_template_scope
26644 }
26646 /* Parse a template-declaration body (following argument list). */
26648 static void
26650 tree parameter_list,
26652 {
26656 /* We just processed one more parameter list. */
26659 /* Get the deferred access checks from the parameter list. These
26660 will be checked once we know what is being declared, as for a
26661 member template the checks must be performed in the scope of the
26662 class containing the member. */
26665 /* Tentatively parse for a new template parameter list, which can either be
26666 the template keyword or a template introduction. */
26672 else
26673 {
26674 /* There are no access checks when parsing a template, as we do not
26675 know if a specialization will be a friend. */
26679 checks,
26680 member_p,
26685 /* If this is a member template declaration, let the front
26686 end know. */
26688 {
26693 }
26698 }
26699 /* We are done with the current parameter list. */
26704 /* Finish up. */
26707 /* Check the template arguments for a literal operator template. */
26711 {
26715 else
26716 {
26719 {
26725 }
26727 {
26736 }
26737 else
26739 }
26741 {
26744 " Expected non-type template argument pack <char...>"
26746 decl);
26747 else
26750 decl);
26751 }
26752 }
26754 /* Register member declarations. */
26757 /* If DECL is a function template, we must return to parse it later.
26758 (Even though there is no definition, there might be default
26759 arguments that need handling.) */
26763 }
26765 /* Parse a template introduction header for a template-declaration. Returns
26766 false if tentative parse fails. */
26768 static bool
26770 {
26777 /* Look for the optional `::' operator. */
26780 /* Look for the nested-name-specifier. */
26790 /* Look up the concept for which we will be matching
26791 template parameters. */
26801 /* Look for opening brace for introduction. */
26802 matching_braces braces;
26810 /* Build vector of placeholder parameters and grab
26811 matching identifiers. */
26814 /* The introduction-list shall not be empty. */
26817 {
26820 }
26822 /* Look for closing brace for introduction. */
26827 {
26831 }
26833 /* Build and associate the constraint. */
26836 {
26838 member_p);
26840 }
26844 }
26846 /* Parse a normal template-declaration following the template keyword. */
26848 static void
26850 {
26851 tree parameter_list;
26855 /* Look for the `<' token. */
26859 {
26860 /* 14.5.2.2 [temp.mem]
26862 A local class shall not have member templates. */
26867 }
26868 /* [temp]
26870 A template ... shall not have C linkage. */
26872 {
26875 /* Give it C++ linkage to avoid confusing other parts of the
26876 front end. */
26879 }
26880 else
26883 /* We cannot perform access checks on the template parameter
26884 declarations until we know what is being declared, just as we
26885 cannot check the decl-specifier list. */
26888 /* If the next token is `>', then we have an invalid
26889 specialization. Rather than complain about an invalid template
26890 parameter, issue an error message here. */
26892 {
26896 }
26897 else
26898 {
26899 /* Parse the template parameters. */
26901 }
26903 /* Look for the `>'. */
26906 /* Manage template requirements */
26908 {
26913 }
26916 member_p);
26918 /* For the erroneous case of a template with C linkage, we pushed an
26919 implicit C++ linkage scope; exit that scope now. */
26922 }
26924 /* Parse a template-declaration, assuming that the `export' (and
26925 `extern') keywords, if present, has already been scanned. MEMBER_P
26926 is as for cp_parser_template_declaration. */
26928 static bool
26930 {
26932 {
26936 }
26941 }
26943 /* Perform the deferred access checks from a template-parameter-list.
26944 CHECKS is a TREE_LIST of access checks, as returned by
26945 get_deferred_access_checks. */
26947 static void
26948 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26949 {
26953 }
26955 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26956 `function-definition' sequence that follows a template header.
26957 If MEMBER_P is true, this declaration appears in a class scope.
26959 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26960 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26962 static tree
26968 {
26971 cp_decl_specifier_seq decl_specifiers;
26975 /* This function is only used when processing a template
26976 declaration. */
26980 /* Defer access checks until we know what is being declared. */
26983 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26984 alternative. */
26987 CP_PARSER_FLAGS_OPTIONAL,
26993 /* There are no template typedefs. */
26995 {
26999 }
27001 /* Gather up the access checks that occurred the
27002 decl-specifier-seq. */
27005 /* Check for the declaration of a template class. */
27007 {
27010 {
27011 // If this is a declaration, but not a definition, associate
27012 // any constraints with the type declaration. Constraints
27013 // are associated with definitions in cp_parser_class_specifier.
27019 /* In this case:
27021 struct C {
27022 friend template <typename T> struct A<T>::B;
27023 };
27025 A<T>::B will be represented by a TYPENAME_TYPE, and
27026 therefore not recognized by shadow_tag. */
27028 && !decl
27035 else
27038 /* Perform access checks for template parameters. */
27041 /* Give a helpful diagnostic for
27042 template <class T> struct A { } a;
27043 if we aren't already recovering from an error. */
27046 {
27048 "a class template declaration must not declare "
27052 }
27053 }
27054 }
27056 /* Complain about missing 'typename' or other invalid type names. */
27059 {
27060 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27061 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27062 the rest of this declaration. */
27065 }
27067 /* If it's not a template class, try for a template function. If
27068 the next token is a `;', then this declaration does not declare
27069 anything. But, if there were errors in the decl-specifiers, then
27070 the error might well have come from an attempted class-specifier.
27071 In that case, there's no need to warn about a missing declarator. */
27075 {
27078 checks,
27080 member_p,
27081 declares_class_or_enum,
27085 /* 7.1.1-1 [dcl.stc]
27087 A storage-class-specifier shall not be specified in an explicit
27088 specialization... */
27090 && explicit_specialization_p
27092 {
27096 }
27100 }
27102 /* Look for a trailing `;' after the declaration. */
27108 out:
27111 /* Clear any current qualification; whatever comes next is the start
27112 of something new. */
27118 }
27120 /* Parse a cast-expression that is not the operand of a unary "&". */
27122 static cp_expr
27124 {
27127 }
27129 /* Parse a functional cast to TYPE. Returns an expression
27130 representing the cast. */
27132 static cp_expr
27134 {
27136 tree expression_list;
27137 cp_expr cast;
27146 {
27156 /* Create a location of the form:
27157 type_name{i, f}
27158 ^~~~~~~~~~~~~~~
27159 with caret == start at the start of the type name,
27160 finishing at the closing brace. */
27161 location_t finish_loc
27164 finish_loc);
27167 }
27176 else
27177 {
27180 }
27183 tf_warning_or_error);
27184 /* [expr.const]/1: In an integral constant expression "only type
27185 conversions to integral or enumeration type can be used". */
27191 NIC_CONSTRUCTOR))
27194 /* Create a location of the form:
27195 float(i)
27196 ^~~~~~~~
27197 with caret == start at the start of the type name,
27198 finishing at the closing paren. */
27199 location_t finish_loc
27204 }
27206 /* Save the tokens that make up the body of a member function defined
27207 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27208 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27209 specifiers applied to the declaration. Returns the FUNCTION_DECL
27210 for the member function. */
27212 static tree
27216 tree attributes)
27217 {
27220 tree fn;
27223 /* Create the FUNCTION_DECL. */
27227 /* If something went badly wrong, bail out now. */
27229 {
27230 /* If there's a function-body, skip it. */
27235 }
27237 /* Remember it, if there default args to post process. */
27240 /* Save away the tokens that make up the body of the
27241 function. */
27247 RID_TRANSACTION_ATOMIC))
27248 {
27250 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27257 {
27263 }
27264 else
27267 {
27271 }
27272 }
27274 /* Handle function try blocks. */
27276 {
27279 }
27280 /* We can have braced-init-list mem-initializers before the fn body. */
27282 {
27285 {
27286 /* cache_group will stop after an un-nested { } pair, too. */
27290 /* variadic mem-inits have ... after the ')'. */
27293 }
27294 }
27296 /* Handle function try blocks. */
27302 /* Save away the inline definition; we will process it when the
27303 class is complete. */
27307 /* We need to know that this was defined in the class, so that
27308 friend templates are handled correctly. */
27311 /* Add FN to the queue of functions to be parsed later. */
27315 }
27317 /* Save the tokens that make up the in-class initializer for a non-static
27318 data member. Returns a DEFAULT_ARG. */
27320 static tree
27322 {
27324 }
27326 /* Parse a template-argument-list, as well as the trailing ">" (but
27327 not the opening "<"). See cp_parser_template_argument_list for the
27328 return value. */
27330 static tree
27332 {
27333 tree arguments;
27334 tree saved_scope;
27335 tree saved_qualifying_scope;
27336 tree saved_object_scope;
27341 /* [temp.names]
27343 When parsing a template-id, the first non-nested `>' is taken as
27344 the end of the template-argument-list rather than a greater-than
27345 operator. */
27346 saved_greater_than_is_operator_p
27349 /* Parsing the argument list may modify SCOPE, so we save it
27350 here. */
27354 /* We need to evaluate the template arguments, even though this
27355 template-id may be nested within a "sizeof". */
27360 /* Parse the template-argument-list itself. */
27364 else
27366 /* Look for the `>' that ends the template-argument-list. If we find
27367 a '>>' instead, it's probably just a typo. */
27369 {
27371 {
27372 /* In C++0x, a `>>' in a template argument list or cast
27373 expression is considered to be two separate `>'
27374 tokens. So, change the current token to a `>', but don't
27375 consume it: it will be consumed later when the outer
27376 template argument list (or cast expression) is parsed.
27377 Note that this replacement of `>' for `>>' is necessary
27378 even if we are parsing tentatively: in the tentative
27379 case, after calling
27380 cp_parser_enclosed_template_argument_list we will always
27381 throw away all of the template arguments and the first
27382 closing `>', either because the template argument list
27383 was erroneous or because we are replacing those tokens
27384 with a CPP_TEMPLATE_ID token. The second `>' (which will
27385 not have been thrown away) is needed either to close an
27386 outer template argument list or to complete a new-style
27387 cast. */
27390 }
27392 {
27393 /* If we're in a nested template argument list, the '>>' has
27394 to be a typo for '> >'. We emit the error message, but we
27395 continue parsing and we push a '>' as next token, so that
27396 the argument list will be parsed correctly. Note that the
27397 global source location is still on the token before the
27398 '>>', so we need to say explicitly where we want it. */
27406 }
27407 else
27408 {
27409 /* If this is not a nested template argument list, the '>>'
27410 is a typo for '>'. Emit an error message and continue.
27411 Same deal about the token location, but here we can get it
27412 right by consuming the '>>' before issuing the diagnostic. */
27415 "spurious %<>>%>, use %<>%> to terminate "
27417 }
27418 }
27419 else
27421 /* The `>' token might be a greater-than operator again now. */
27422 parser->greater_than_is_operator_p
27424 /* Restore the SAVED_SCOPE. */
27432 }
27434 /* MEMBER_FUNCTION is a member function, or a friend. If default
27435 arguments, or the body of the function have not yet been parsed,
27436 parse them now. */
27438 static void
27440 {
27442 /* If this member is a template, get the underlying
27443 FUNCTION_DECL. */
27447 /* There should not be any class definitions in progress at this
27448 point; the bodies of members are only parsed outside of all class
27449 definitions. */
27451 /* While we're parsing the member functions we might encounter more
27452 classes. We want to handle them right away, but we don't want
27453 them getting mixed up with functions that are currently in the
27454 queue. */
27457 /* Make sure that any template parameters are in scope. */
27460 /* If the body of the function has not yet been parsed, parse it
27461 now. */
27463 {
27464 tree function_scope;
27467 /* The function is no longer pending; we are processing it. */
27472 /* If this is a local class, enter the scope of the containing
27473 function. */
27478 /* Push the body of the function onto the lexer stack. */
27481 /* Let the front end know that we going to be defining this
27482 function. */
27486 /* Don't do access checking if it is a templated function. */
27490 /* #pragma omp declare reduction needs special parsing. */
27492 {
27497 }
27498 else
27499 /* Now, parse the body of the function. */
27506 /* Leave the scope of the containing function. */
27510 }
27512 /* Remove any template parameters from the symbol table. */
27515 /* Restore the queue. */
27518 }
27520 /* If DECL contains any default args, remember it on the unparsed
27521 functions queue. */
27523 static void
27525 {
27526 tree probe;
27529 probe;
27532 {
27536 }
27537 }
27539 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27540 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27541 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27542 from the parameter-type-list. */
27544 static tree
27547 {
27549 tree parsed_arg;
27555 /* Push the saved tokens for the default argument onto the parser's
27556 lexer stack. */
27562 /* Parse the default argument. */
27573 {
27574 /* In a non-template class, check conversions now. In a template,
27575 we'll wait and instantiate these as needed. */
27578 tf_warning_or_error);
27581 else
27583 }
27585 /* If the token stream has not been completely used up, then
27586 there was extra junk after the end of the default
27587 argument. */
27589 {
27592 else
27594 }
27596 /* Revert to the main lexer. */
27600 }
27602 /* FIELD is a non-static data member with an initializer which we saved for
27603 later; parse it now. */
27605 static void
27607 {
27608 tree def;
27615 NULL_TREE);
27621 }
27623 /* FN is a FUNCTION_DECL which may contains a parameter with an
27624 unparsed DEFAULT_ARG. Parse the default args now. This function
27625 assumes that the current scope is the scope in which the default
27626 argument should be processed. */
27628 static void
27630 {
27634 /* While we're parsing the default args, we might (due to the
27635 statement expression extension) encounter more classes. We want
27636 to handle them right away, but we don't want them getting mixed
27637 up with default args that are currently in the queue. */
27640 /* Local variable names (and the `this' keyword) may not appear
27641 in a default argument. */
27652 {
27654 tree parsed_arg;
27656 tree copy;
27663 /* This can happen for a friend declaration for a function
27664 already declared with default arguments. */
27667 parsed_arg
27669 default_arg,
27673 /* Update any instantiations we've already created. */
27677 }
27681 /* Make sure no default arg is missing. */
27684 /* Restore the state of local_variables_forbidden_p. */
27687 /* Restore the queue. */
27689 }
27691 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27693 sizeof ... ( identifier )
27695 where the 'sizeof' token has already been consumed. */
27697 static tree
27699 {
27700 /* Consume the `...'. */
27704 matching_parens parens;
27708 else
27716 /* The name is not qualified. */
27735 }
27737 /* Parse the operand of `sizeof' (or a similar operator). Returns
27738 either a TYPE or an expression, depending on the form of the
27739 input. The KEYWORD indicates which kind of expression we have
27740 encountered. */
27742 static tree
27744 {
27751 /* If it's a `...', then we are computing the length of a parameter
27752 pack. */
27757 /* Types cannot be defined in a `sizeof' expression. Save away the
27758 old message. */
27760 /* And create the new one. */
27766 /* The restrictions on constant-expressions do not apply inside
27767 sizeof expressions. */
27768 saved_integral_constant_expression_p
27770 saved_non_integral_constant_expression_p
27774 /* Do not actually evaluate the expression. */
27777 /* If it's a `(', then we might be looking at the type-id
27778 construction. */
27780 {
27783 /* We can't be sure yet whether we're looking at a type-id or an
27784 expression. */
27787 matching_parens parens;
27790 /* Note: as a GNU Extension, compound literals are considered
27791 postfix-expressions as they are in C99, so they are valid
27792 arguments to sizeof. See comment in cp_parser_cast_expression
27793 for details. */
27796 else
27797 {
27800 /* Look for the type-id. */
27802 /* Look for the closing `)'. */
27805 }
27807 /* If all went well, then we're done. */
27809 {
27810 cp_decl_specifier_seq decl_specs;
27812 /* Build a trivial decl-specifier-seq. */
27816 /* Call grokdeclarator to figure out what type this is. */
27819 TYPENAME,
27822 }
27823 }
27825 /* If the type-id production did not work out, then we must be
27826 looking at the unary-expression production. */
27830 /* Go back to evaluating expressions. */
27834 /* Free the message we created. */
27836 /* And restore the old one. */
27838 parser->integral_constant_expression_p
27840 parser->non_integral_constant_expression_p
27844 }
27846 /* If the current declaration has no declarator, return true. */
27848 static bool
27850 {
27851 /* If the next token is a `;' or a `,' then there is no
27852 declarator. */
27855 }
27857 /* Update the DECL_SPECS to reflect the storage class indicated by
27858 KEYWORD. */
27860 static void
27865 {
27866 cp_storage_class storage_class;
27869 {
27873 }
27875 {
27878 }
27883 {
27886 }
27889 {
27907 }
27911 /* A storage class specifier cannot be applied alongside a typedef
27912 specifier. If there is a typedef specifier present then set
27913 conflicting_specifiers_p which will trigger an error later
27914 on in grokdeclarator. */
27917 }
27919 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27920 is true, the type is a class or enum definition. */
27922 static void
27924 tree type_spec,
27927 {
27930 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27931 (with, for example, in "typedef int wchar_t;") we remember that
27932 this is what happened. In system headers, we ignore these
27933 declarations so that G++ can work with system headers that are not
27934 C++-safe. */
27936 && !type_definition_p
27946 {
27949 ds_redefined_builtin_type_spec,
27950 token);
27952 {
27956 }
27957 }
27960 else
27961 {
27966 }
27967 }
27969 /* True iff TOKEN is the GNU keyword __thread. */
27971 static bool
27973 {
27976 }
27978 /* Set the location for a declarator specifier and check if it is
27979 duplicated.
27981 DECL_SPECS is the sequence of declarator specifiers onto which to
27982 set the location.
27984 DS is the single declarator specifier to set which location is to
27985 be set onto the existing sequence of declarators.
27987 LOCATION is the location for the declarator specifier to
27988 consider. */
27990 static void
27993 {
28002 {
28006 }
28007 else
28008 {
28010 {
28014 else
28015 {
28018 OPT_Wlong_long,
28020 }
28021 }
28023 {
28028 else
28029 {
28033 }
28034 }
28035 else
28036 {
28052 "__complex"
28053 };
28057 }
28058 }
28059 }
28061 /* Return true iff the declarator specifier DS is present in the
28062 sequence of declarator specifiers DECL_SPECS. */
28064 bool
28066 cp_decl_spec ds)
28067 {
28074 }
28076 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28077 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28079 static bool
28081 {
28083 }
28085 /* Issue an error message indicating that TOKEN_DESC was expected.
28086 If KEYWORD is true, it indicated this function is called by
28087 cp_parser_require_keword and the required token can only be
28088 a indicated keyword.
28090 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28091 within any error as the location of an "opening" token matching
28092 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28093 RT_CLOSE_PAREN). */
28095 static void
28097 required_token token_desc,
28099 location_t matching_location)
28100 {
28106 {
28175 }
28178 {
28180 {
28258 }
28259 }
28263 }
28266 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28267 issue an error message indicating that TOKEN_DESC was expected.
28269 Returns the token consumed, if the token had the appropriate type.
28270 Otherwise, returns NULL.
28272 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28273 within any error as the location of an "opening" token matching
28274 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28275 RT_CLOSE_PAREN). */
28280 required_token token_desc,
28281 location_t matching_location)
28282 {
28285 else
28286 {
28287 /* Output the MESSAGE -- unless we're parsing tentatively. */
28290 matching_location);
28292 }
28293 }
28295 /* An error message is produced if the next token is not '>'.
28296 All further tokens are skipped until the desired token is
28297 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28299 static void
28301 {
28302 /* Current level of '< ... >'. */
28304 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28307 /* Are we ready, yet? If not, issue error message. */
28311 /* Skip tokens until the desired token is found. */
28313 {
28314 /* Peek at the next token. */
28316 {
28324 /* C++0x views the `>>' operator as two `>' tokens, but
28325 C++98 does not. */
28328 {
28329 /* We've hit a `>>' where the first `>' closes the
28330 template argument list, and the second `>' is
28331 spurious. Just consume the `>>' and stop; we've
28332 already produced at least one error. */
28335 }
28336 /* Fall through for C++0x, so we handle the second `>' in
28337 the `>>'. */
28342 {
28343 /* We've reached the token we want, consume it and stop. */
28346 }
28365 /* The '>' was probably forgotten, don't look further. */
28370 }
28372 /* Consume this token. */
28374 }
28375 }
28377 /* If the next token is the indicated keyword, consume it. Otherwise,
28378 issue an error message indicating that TOKEN_DESC was expected.
28380 Returns the token consumed, if the token had the appropriate type.
28381 Otherwise, returns NULL. */
28386 required_token token_desc)
28387 {
28391 {
28393 UNKNOWN_LOCATION);
28395 }
28398 }
28400 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28401 function-definition. */
28403 static bool
28405 {
28408 /* A ctor-initializer begins with a `:'. */
28410 /* A function-try-block begins with `try'. */
28412 /* A function-transaction-block begins with `__transaction_atomic'
28413 or `__transaction_relaxed'. */
28416 /* The named return value extension begins with `return'. */
28418 }
28420 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28421 definition. */
28423 static bool
28425 {
28432 }
28434 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28435 C++0x) ending a template-argument. */
28437 static bool
28439 {
28447 }
28449 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28450 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28452 static bool
28455 {
28461 /* Check for the sequence `<::' in the original code. It would be lexed as
28462 `[:', where `[' is a digraph, and there is no whitespace before
28463 `:'. */
28465 {
28470 }
28472 }
28474 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28475 or none_type otherwise. */
28477 static enum tag_types
28479 {
28481 {
28491 }
28492 }
28494 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28495 or none_type otherwise or if the token is null. */
28497 static enum tag_types
28499 {
28504 {
28512 }
28513 }
28515 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28517 static void
28519 {
28523 {
28527 type))
28530 }
28531 }
28533 /* Issue an error message if DECL is redeclared with different
28534 access than its original declaration [class.access.spec/3].
28535 This applies to nested classes, nested class templates and
28536 enumerations [class.mem/1]. */
28538 static void
28540 {
28551 }
28553 /* Look for the `template' keyword, as a syntactic disambiguator.
28554 Return TRUE iff it is present, in which case it will be
28555 consumed. */
28557 static bool
28559 {
28561 {
28562 /* In C++98 the `template' keyword can only be used within templates;
28563 outside templates the parser can always figure out what is a
28564 template and what is not. In C++11, per the resolution of DR 468,
28565 `template' is allowed in cases where it is not strictly necessary. */
28568 {
28571 "in C++98 %<template%> (as a disambiguator) is only "
28573 /* If this part of the token stream is rescanned, the same
28574 error message would be generated. So, we purge the token
28575 from the stream. */
28578 }
28579 else
28580 {
28581 /* Consume the `template' keyword. */
28584 }
28585 }
28587 }
28589 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28590 set PARSER->SCOPE, and perform other related actions. */
28592 static void
28594 {
28597 /* Get the stored value. */
28599 /* Set the scope from the stored value. */
28603 }
28605 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28606 encounter the end of a block before what we were looking for. */
28608 static bool
28612 {
28614 {
28617 /* Abort a parenthesized expression if we encounter a semicolon. */
28621 /* If we've reached the end of the file, stop. */
28627 /* We've hit the end of an enclosing block, so there's been some
28628 kind of syntax error. */
28631 /* Consume the token. */
28633 /* See if it starts a new group. */
28635 {
28637 /* In theory this should probably check end == '}', but
28638 cp_parser_save_member_function_body needs it to exit
28639 after either '}' or ')' when called with ')'. */
28642 }
28644 {
28648 }
28653 }
28654 }
28656 /* Like above, for caching a default argument or NSDMI. Both of these are
28657 terminated by a non-nested comma, but it can be unclear whether or not a
28658 comma is nested in a template argument list unless we do more parsing.
28659 In order to handle this ambiguity, when we encounter a ',' after a '<'
28660 we try to parse what follows as a parameter-declaration-list (in the
28661 case of a default argument) or a member-declarator (in the case of an
28662 NSDMI). If that succeeds, then we stop caching. */
28664 static tree
28666 {
28671 tree default_argument;
28673 /* Add tokens until we have processed the entire default
28674 argument. We add the range [first_token, token). */
28677 {
28678 /* For list-initialization, this is straightforward. */
28681 }
28683 {
28686 /* Peek at the next token. */
28688 /* What we do depends on what token we have. */
28690 {
28691 /* In valid code, a default argument must be
28692 immediately followed by a `,' `)', or `...'. */
28695 {
28696 /* If we've seen a '<', we might be in a
28697 template-argument-list. Until Core issue 325 is
28698 resolved, we don't know how this situation ought
28699 to be handled, so try to DTRT. We check whether
28700 what comes after the comma is a valid parameter
28701 declaration list. If it is, then the comma ends
28702 the default argument; otherwise the default
28703 argument continues. */
28707 /* Set ITALP so cp_parser_parameter_declaration_list
28708 doesn't decide to commit to this parse. */
28715 {
28716 /* Parse declarators until we reach a non-comma or
28717 somthing that cannot be an initializer.
28718 Just checking whether we're looking at a single
28719 declarator is insufficient. Consider:
28720 int var = tuple<T,U>::x;
28721 The template parameter 'U' looks exactly like a
28722 declarator. */
28723 do
28724 {
28735 }
28737 /* If we met an '=' or ';' then the original comma
28738 was the end of the NSDMI. Otherwise assume
28739 we're still in the NSDMI. */
28742 }
28743 else
28744 {
28749 }
28756 }
28757 /* FALLTHRU */
28760 /* If we run into a non-nested `;', `}', or `]',
28761 then the code is invalid -- but the default
28762 argument is certainly over. */
28767 /* Handle correctly int n = sizeof ... ( p ); */
28770 /* Update DEPTH, if necessary. */
28785 /* This might be the comparison operator, or it might
28786 start a template argument list. */
28793 /* Fall through for C++0x, which treats the `>>'
28794 operator like two `>' tokens in certain
28795 cases. */
28800 {
28801 /* This might be an operator, or it might close a
28802 template argument list. But if a previous '<'
28803 started a template argument list, this will have
28804 closed it, so we can't be in one anymore. */
28808 }
28811 /* If we run out of tokens, issue an error message. */
28819 /* In these cases, we should look for template-ids.
28820 For example, if the default argument is
28821 `X<int, double>()', we need to do name lookup to
28822 figure out whether or not `X' is a template; if
28823 so, the `,' does not end the default argument.
28825 That is not yet done. */
28830 }
28832 /* If we've reached the end, stop. */
28836 /* Add the token to the token block. */
28838 }
28840 /* Create a DEFAULT_ARG to represent the unparsed default
28841 argument. */
28848 }
28850 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28852 location_t
28854 {
28859 }
28861 /* Begin parsing tentatively. We always save tokens while parsing
28862 tentatively so that if the tentative parsing fails we can restore the
28863 tokens. */
28865 static void
28867 {
28868 /* Enter a new parsing context. */
28870 /* Begin saving tokens. */
28872 /* In order to avoid repetitive access control error messages,
28873 access checks are queued up until we are no longer parsing
28874 tentatively. */
28876 }
28878 /* Commit to the currently active tentative parse. */
28880 static void
28882 {
28886 /* Mark all of the levels as committed. */
28889 {
28896 }
28897 }
28899 /* Commit to the topmost currently active tentative parse.
28901 Note that this function shouldn't be called when there are
28902 irreversible side-effects while in a tentative state. For
28903 example, we shouldn't create a permanent entry in the symbol
28904 table, or issue an error message that might not apply if the
28905 tentative parse is aborted. */
28907 static void
28909 {
28914 {
28922 }
28923 }
28925 /* Abort the currently active tentative parse. All consumed tokens
28926 will be rolled back, and no diagnostics will be issued. */
28928 static void
28930 {
28934 /* Now, pretend that we want to see if the construct was
28935 successfully parsed. */
28937 }
28939 /* Stop parsing tentatively. If a parse error has occurred, restore the
28940 token stream. Otherwise, commit to the tokens we have consumed.
28941 Returns true if no error occurred; false otherwise. */
28943 static bool
28945 {
28949 /* Remember whether or not an error occurred, since we are about to
28950 destroy that information. */
28952 /* Remove the topmost context from the stack. */
28955 /* If no parse errors occurred, commit to the tentative parse. */
28957 {
28958 /* Commit to the tokens read tentatively, unless that was
28959 already done. */
28964 }
28965 /* Otherwise, if errors occurred, roll back our state so that things
28966 are just as they were before we began the tentative parse. */
28967 else
28968 {
28971 }
28972 /* Add the context to the front of the free list. */
28977 }
28979 /* Returns true if we are parsing tentatively and are not committed to
28980 this tentative parse. */
28982 static bool
28984 {
28987 }
28989 /* Returns nonzero iff an error has occurred during the most recent
28990 tentative parse. */
28992 static bool
28994 {
28997 }
28999 /* Returns nonzero if GNU extensions are allowed. */
29001 static bool
29003 {
29005 }
29006 \f
29007 /* Objective-C++ Productions */
29010 /* Parse an Objective-C expression, which feeds into a primary-expression
29011 above.
29013 objc-expression:
29014 objc-message-expression
29015 objc-string-literal
29016 objc-encode-expression
29017 objc-protocol-expression
29018 objc-selector-expression
29020 Returns a tree representation of the expression. */
29022 static cp_expr
29024 {
29025 /* Try to figure out what kind of declaration is present. */
29029 {
29039 {
29051 }
29052 /* FALLTHRU */
29058 }
29061 }
29063 /* Parse an Objective-C message expression.
29065 objc-message-expression:
29066 [ objc-message-receiver objc-message-args ]
29068 Returns a representation of an Objective-C message. */
29070 static tree
29072 {
29084 /* Construct a location e.g.
29085 [self func1:5]
29086 ^~~~~~~~~~~~~~
29087 ranging from the '[' to the ']', with the caret at the start. */
29092 }
29094 /* Parse an objc-message-receiver.
29096 objc-message-receiver:
29097 expression
29098 simple-type-specifier
29100 Returns a representation of the type or expression. */
29102 static tree
29104 {
29105 tree rcv;
29107 /* An Objective-C message receiver may be either (1) a type
29108 or (2) an expression. */
29112 /* If that worked out, fine. */
29119 CP_PARSER_FLAGS_NONE);
29126 }
29128 /* Parse the arguments and selectors comprising an Objective-C message.
29130 objc-message-args:
29131 objc-selector
29132 objc-selector-args
29133 objc-selector-args , objc-comma-args
29135 objc-selector-args:
29136 objc-selector [opt] : assignment-expression
29137 objc-selector-args objc-selector [opt] : assignment-expression
29139 objc-comma-args:
29140 assignment-expression
29141 objc-comma-args , assignment-expression
29143 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29144 selector arguments and TREE_VALUE containing a list of comma
29145 arguments. */
29147 static tree
29149 {
29155 {
29161 /* Detect if we have a unary selector. */
29170 sel_args
29175 }
29177 /* Handle non-selector arguments, if any. */
29179 {
29180 tree arg;
29185 addl_args
29190 }
29193 {
29196 }
29199 }
29201 /* Parse an Objective-C encode expression.
29203 objc-encode-expression:
29204 @encode objc-typename
29206 Returns an encoded representation of the type argument. */
29208 static cp_expr
29210 {
29211 tree type;
29216 matching_parens parens;
29223 {
29227 }
29229 /* This happens if we find @encode(T) (where T is a template
29230 typename or something dependent on a template typename) when
29231 parsing a template. In that case, we can't compile it
29232 immediately, but we rather create an AT_ENCODE_EXPR which will
29233 need to be instantiated when the template is used.
29234 */
29236 {
29240 }
29243 /* Build a location of the form:
29244 @encode(int)
29245 ^~~~~~~~~~~~
29246 with caret==start at the @ token, finishing at the close paren. */
29247 location_t combined_loc
29252 }
29254 /* Parse an Objective-C @defs expression. */
29256 static tree
29258 {
29259 tree name;
29262 matching_parens parens;
29268 }
29270 /* Parse an Objective-C protocol expression.
29272 objc-protocol-expression:
29273 @protocol ( identifier )
29275 Returns a representation of the protocol expression. */
29277 static tree
29279 {
29280 tree proto;
29284 matching_parens parens;
29289 /* Build a location of the form:
29290 @protocol(prot)
29291 ^~~~~~~~~~~~~~~
29292 with caret==start at the @ token, finishing at the close paren. */
29293 location_t combined_loc
29299 }
29301 /* Parse an Objective-C selector expression.
29303 objc-selector-expression:
29304 @selector ( objc-method-signature )
29306 objc-method-signature:
29307 objc-selector
29308 objc-selector-seq
29310 objc-selector-seq:
29311 objc-selector :
29312 objc-selector-seq objc-selector :
29314 Returns a representation of the method selector. */
29316 static tree
29318 {
29325 matching_parens parens;
29331 {
29340 {
29341 /* Detect if we have a unary selector. */
29343 {
29346 }
29347 else
29348 {
29350 }
29351 }
29356 {
29357 sel_seq
29360 sel_seq
29363 }
29364 else
29365 sel_seq
29370 }
29372 finish_selector:
29376 /* Build a location of the form:
29377 @selector(func)
29378 ^~~~~~~~~~~~~~~
29379 with caret==start at the @ token, finishing at the close paren. */
29380 location_t combined_loc
29384 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29387 }
29389 /* Parse a list of identifiers.
29391 objc-identifier-list:
29392 identifier
29393 objc-identifier-list , identifier
29395 Returns a TREE_LIST of identifier nodes. */
29397 static tree
29399 {
29400 tree identifier;
29401 tree list;
29412 {
29419 identifier));
29421 }
29424 }
29426 /* Parse an Objective-C alias declaration.
29428 objc-alias-declaration:
29429 @compatibility_alias identifier identifier ;
29431 This function registers the alias mapping with the Objective-C front end.
29432 It returns nothing. */
29434 static void
29436 {
29444 }
29446 /* Parse an Objective-C class forward-declaration.
29448 objc-class-declaration:
29449 @class objc-identifier-list ;
29451 The function registers the forward declarations with the Objective-C
29452 front end. It returns nothing. */
29454 static void
29456 {
29459 {
29460 tree id;
29470 else
29472 }
29474 }
29476 /* Parse a list of Objective-C protocol references.
29478 objc-protocol-refs-opt:
29479 objc-protocol-refs [opt]
29481 objc-protocol-refs:
29482 < objc-identifier-list >
29484 Returns a TREE_LIST of identifiers, if any. */
29486 static tree
29488 {
29492 {
29496 }
29499 }
29501 /* Parse a Objective-C visibility specification. */
29503 static void
29505 {
29509 {
29524 }
29526 /* Eat '@private'/'@protected'/'@public'. */
29528 }
29530 /* Parse an Objective-C method type. Return 'true' if it is a class
29531 (+) method, and 'false' if it is an instance (-) method. */
29535 {
29538 else
29540 }
29542 /* Parse an Objective-C protocol qualifier. */
29544 static tree
29546 {
29559 {
29564 }
29567 }
29569 /* Parse an Objective-C typename. */
29571 static tree
29573 {
29577 {
29580 matching_parens parens;
29584 /* An ObjC type name may consist of just protocol qualifiers, in which
29585 case the type shall default to 'id'. */
29587 {
29590 /* If the type could not be parsed, an error has already
29591 been produced. For error recovery, behave as if it had
29592 not been specified, which will use the default type
29593 'id'. */
29595 {
29597 /* We need to skip to the closing parenthesis as
29598 cp_parser_type_id() does not seem to do it for
29599 us. */
29604 }
29605 }
29609 }
29612 }
29614 /* Check to see if TYPE refers to an Objective-C selector name. */
29616 static bool
29618 {
29624 }
29626 /* Parse an Objective-C selector. */
29628 static tree
29630 {
29634 {
29637 }
29639 /* C++ operator names are allowed to appear in ObjC selectors. */
29641 {
29654 }
29655 }
29657 /* Parse an Objective-C params list. */
29659 static tree
29661 {
29667 {
29677 /* Detect if we have a unary selector. */
29680 {
29683 }
29687 {
29688 /* Something went quite wrong. There should be a colon
29689 here, but there is not. Stop parsing parameters. */
29691 }
29693 /* New ObjC allows attributes on parameters too. */
29698 params
29701 type_name,
29702 identifier,
29703 parm_attr));
29706 }
29709 {
29712 }
29714 /* We allow tail attributes for the method. */
29716 {
29724 }
29727 {
29730 }
29732 }
29734 /* Parse the non-keyword Objective-C params. */
29736 static tree
29739 {
29745 {
29747 tree parm;
29753 {
29758 }
29760 /* TODO: parse attributes for tail parameters. */
29769 }
29771 /* We allow tail attributes for the method. */
29773 {
29775 {
29780 }
29781 else
29782 /* We have an error, but parse the attributes, so that we can
29783 carry on. */
29789 }
29792 }
29794 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29796 static void
29798 {
29801 /* If the next token is `extern' and the following token is a string
29802 literal, then we have a linkage specification. */
29804 && cp_parser_is_pure_string_literal
29807 /* Handle #pragma, if any. */
29810 /* Allow stray semicolons. */
29813 /* Mark methods as optional or required, when building protocols. */
29815 {
29818 }
29820 {
29823 }
29826 /* Other stray characters must generate errors. */
29828 {
29832 }
29833 /* Finally, try to parse a block-declaration, or a function-definition. */
29834 else
29836 }
29838 /* Parse a method signature. */
29840 static tree
29842 {
29858 }
29860 static bool
29862 {
29863 tree tattr;
29868 /* If the attributes are followed by a method introducer, this is not allowed.
29869 Dump the attributes and flag the situation. */
29874 /* Otherwise, the attributes introduce some interstitial code, possibly so
29875 rewind to allow that check. */
29878 }
29880 /* Parse an Objective-C method prototype list. */
29882 static void
29884 {
29888 {
29890 {
29895 else
29899 {
29903 }
29906 }
29912 OPT_Wattributes,
29914 else
29915 /* Allow for interspersed non-ObjC++ code. */
29919 }
29923 else
29927 }
29929 /* Parse an Objective-C method definition list. */
29931 static void
29933 {
29937 {
29938 tree meth;
29941 {
29947 else
29952 {
29956 }
29958 NULL_TREE);
29960 /* For historical reasons, we accept an optional semicolon. */
29967 {
29974 }
29975 }
29976 /* The following case will be removed once @synthesize is
29977 completely implemented. */
29988 else
29989 /* Allow for interspersed non-ObjC++ code. */
29993 }
29997 else
30001 }
30003 /* Parse Objective-C ivars. */
30005 static void
30007 {
30018 {
30019 cp_decl_specifier_seq declspecs;
30021 tree prefix_attributes;
30029 CP_PARSER_FLAGS_OPTIONAL,
30033 /* auto, register, static, extern, mutable. */
30035 {
30038 }
30040 /* thread_local. */
30042 {
30045 }
30047 /* typedef. */
30049 {
30052 }
30057 /* Keep going until we hit the `;' at the end of the
30058 declaration. */
30060 {
30065 /* Check for a (possibly unnamed) bitfield declaration. */
30073 {
30074 /* Get the name of the bitfield. */
30077 sfk_none);
30079 eat_colon:
30081 /* Get the width of the bitfield. */
30082 width
30084 }
30085 else
30086 {
30087 /* Parse the declarator. */
30088 declarator
30094 }
30096 /* Look for attributes that apply to the ivar. */
30098 /* Remember which attributes are prefix attributes and
30099 which are not. */
30101 /* Combine the attributes. */
30105 /* Create the bitfield declaration. */
30108 else
30113 /* Add the instance variable. */
30117 /* Reset PREFIX_ATTRIBUTES. */
30126 {
30129 }
30131 }
30135 }
30140 /* Do not consume the RID_AT_END, so it will be read again as terminating
30141 the @interface of @implementation. */
30145 /* For historical reasons, we accept an optional semicolon. */
30148 }
30150 /* Parse an Objective-C protocol declaration. */
30152 static void
30154 {
30160 {
30165 }
30167 /* See if we have a forward declaration or a definition. */
30170 /* Try a forward declaration first. */
30172 {
30174 {
30175 tree id;
30185 else
30187 }
30189 }
30191 /* Ok, we got a full-fledged definition (or at least should). */
30192 else
30193 {
30198 }
30199 }
30201 /* Parse an Objective-C superclass or category. */
30203 static void
30208 {
30214 {
30217 }
30219 {
30220 matching_parens parens;
30223 /* If there is no category name, and this is an @interface, we
30224 have a class extension. */
30226 {
30229 }
30230 else
30234 }
30235 }
30237 /* Parse an Objective-C class interface. */
30239 static void
30241 {
30248 {
30249 /* It's hard to recover because even if valid @interface stuff
30250 is to follow, we can't compile it (or validate it) if we
30251 don't even know which class it refers to. Let's assume this
30252 was a stray '@interface' token in the stream and skip it.
30253 */
30255 }
30260 /* We have either a class or a category on our hands. */
30263 else
30264 {
30266 /* Handle instance variable declarations, if any. */
30269 }
30272 }
30274 /* Parse an Objective-C class implementation. */
30276 static void
30278 {
30285 {
30286 /* It's hard to recover because even if valid @implementation
30287 stuff is to follow, we can't compile it (or validate it) if
30288 we don't even know which class it refers to. Let's assume
30289 this was a stray '@implementation' token in the stream and
30290 skip it.
30291 */
30293 }
30297 /* We have either a class or a category on our hands. */
30300 else
30301 {
30303 /* Handle instance variable declarations, if any. */
30306 }
30309 }
30311 /* Consume the @end token and finish off the implementation. */
30313 static void
30315 {
30318 }
30320 /* Parse an Objective-C declaration. */
30322 static void
30324 {
30325 /* Try to figure out what kind of declaration is present. */
30330 {
30346 }
30349 {
30372 }
30373 }
30375 /* Parse an Objective-C try-catch-finally statement.
30377 objc-try-catch-finally-stmt:
30378 @try compound-statement objc-catch-clause-seq [opt]
30379 objc-finally-clause [opt]
30381 objc-catch-clause-seq:
30382 objc-catch-clause objc-catch-clause-seq [opt]
30384 objc-catch-clause:
30385 @catch ( objc-exception-declaration ) compound-statement
30387 objc-finally-clause:
30388 @finally compound-statement
30390 objc-exception-declaration:
30391 parameter-declaration
30392 '...'
30394 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30396 Returns NULL_TREE.
30398 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30399 for C. Keep them in sync. */
30401 static tree
30403 {
30404 location_t location;
30405 tree stmt;
30410 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30411 node, lest it get absorbed into the surrounding block. */
30417 {
30421 matching_parens parens;
30427 {
30428 /* We have "@catch (...)" (where the '...' are literally
30429 what is in the code). Skip the '...'.
30430 parameter_declaration is set to NULL_TREE, and
30431 objc_being_catch_clauses() knows that that means
30432 '...'. */
30435 }
30436 else
30437 {
30438 /* We have "@catch (NSException *exception)" or something
30439 like that. Parse the parameter declaration. */
30443 else
30448 }
30451 else
30452 {
30453 /* If there was no open parenthesis, we are recovering from
30454 an error, and we are trying to figure out what mistake
30455 the user has made. */
30457 /* If there is an immediate closing parenthesis, the user
30458 probably forgot the opening one (ie, they typed "@catch
30459 NSException *e)". Parse the closing parenthesis and keep
30460 going. */
30464 /* If these is no immediate closing parenthesis, the user
30465 probably doesn't know that parenthesis are required at
30466 all (ie, they typed "@catch NSException *e"). So, just
30467 forget about the closing parenthesis and keep going. */
30468 }
30472 }
30474 {
30477 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30478 node, lest it get absorbed into the surrounding block. */
30482 }
30485 }
30487 /* Parse an Objective-C synchronized statement.
30489 objc-synchronized-stmt:
30490 @synchronized ( expression ) compound-statement
30492 Returns NULL_TREE. */
30494 static tree
30496 {
30497 location_t location;
30504 matching_parens parens;
30509 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30510 node, lest it get absorbed into the surrounding block. */
30515 }
30517 /* Parse an Objective-C throw statement.
30519 objc-throw-stmt:
30520 @throw assignment-expression [opt] ;
30522 Returns a constructed '@throw' statement. */
30524 static tree
30526 {
30538 }
30540 /* Parse an Objective-C statement. */
30542 static tree
30544 {
30545 /* Try to figure out what kind of declaration is present. */
30549 {
30560 }
30563 }
30565 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30566 look ahead to see if an objc keyword follows the attributes. This
30567 is to detect the use of prefix attributes on ObjC @interface and
30568 @protocol. */
30570 static bool
30572 {
30577 {
30580 }
30583 }
30585 /* This routine is a minimal replacement for
30586 c_parser_struct_declaration () used when parsing the list of
30587 types/names or ObjC++ properties. For example, when parsing the
30588 code
30590 @property (readonly) int a, b, c;
30592 this function is responsible for parsing "int a, int b, int c" and
30593 returning the declarations as CHAIN of DECLs.
30595 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30596 similar parsing. */
30597 static tree
30599 {
30601 cp_decl_specifier_seq declspecs;
30603 tree prefix_attributes;
30606 CP_PARSER_FLAGS_NONE,
30613 /* auto, register, static, extern, mutable. */
30615 {
30618 }
30620 /* thread_local. */
30622 {
30625 }
30627 /* typedef. */
30629 {
30632 }
30637 /* Keep going until we hit the `;' at the end of the declaration. */
30639 {
30644 /* Parse the declarator. */
30648 /* Look for attributes that apply to the ivar. */
30650 /* Remember which attributes are prefix attributes and
30651 which are not. */
30653 /* Combine the attributes. */
30663 /* Reset PREFIX_ATTRIBUTES. */
30674 {
30677 }
30678 else
30680 }
30682 }
30684 /* Parse an Objective-C @property declaration. The syntax is:
30686 objc-property-declaration:
30687 '@property' objc-property-attributes[opt] struct-declaration ;
30689 objc-property-attributes:
30690 '(' objc-property-attribute-list ')'
30692 objc-property-attribute-list:
30693 objc-property-attribute
30694 objc-property-attribute-list, objc-property-attribute
30696 objc-property-attribute
30697 'getter' = identifier
30698 'setter' = identifier
30699 'readonly'
30700 'readwrite'
30701 'assign'
30702 'retain'
30703 'copy'
30704 'nonatomic'
30706 For example:
30707 @property NSString *name;
30708 @property (readonly) id object;
30709 @property (retain, nonatomic, getter=getTheName) id name;
30710 @property int a, b, c;
30712 PS: This function is identical to
30713 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30714 static void
30716 {
30717 /* The following variables hold the attributes of the properties as
30718 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30719 seen. When we see an attribute, we set them to 'true' (if they
30720 are boolean properties) or to the identifier (if they have an
30721 argument, ie, for getter and setter). Note that here we only
30722 parse the list of attributes, check the syntax and accumulate the
30723 attributes that we find. objc_add_property_declaration() will
30724 then process the information. */
30734 /* 'properties' is the list of properties that we read. Usually a
30735 single one, but maybe more (eg, in "@property int a, b, c;" there
30736 are three). */
30737 tree properties;
30738 location_t loc;
30744 /* Parse the optional attribute list... */
30746 {
30747 /* Eat the '('. */
30748 matching_parens parens;
30752 {
30758 {
30761 }
30765 {
30776 {
30780 else
30785 }
30788 {
30792 }
30794 {
30796 {
30799 }
30800 else
30804 else
30806 }
30807 else
30808 {
30810 {
30813 }
30814 else
30816 }
30822 }
30829 else
30831 }
30833 /* FIXME: "@property (setter, assign);" will generate a spurious
30834 "error: expected ‘)’ before ‘,’ token". This is because
30835 cp_parser_require, unlike the C counterpart, will produce an
30836 error even if we are in error recovery. */
30838 {
30843 }
30844 }
30846 /* ... and the property declaration(s). */
30850 {
30852 /* If the next token is now a `;', consume it. */
30856 }
30860 else
30861 {
30862 /* Comma-separated properties are chained together in
30863 reverse order; add them one by one. */
30872 }
30875 }
30877 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30879 objc-synthesize-declaration:
30880 @synthesize objc-synthesize-identifier-list ;
30882 objc-synthesize-identifier-list:
30883 objc-synthesize-identifier
30884 objc-synthesize-identifier-list, objc-synthesize-identifier
30886 objc-synthesize-identifier
30887 identifier
30888 identifier = identifier
30890 For example:
30891 @synthesize MyProperty;
30892 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30894 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30895 for C. Keep them in sync.
30896 */
30897 static void
30899 {
30901 location_t loc;
30906 {
30910 {
30913 }
30915 {
30919 {
30922 }
30923 }
30924 else
30929 else
30931 }
30934 }
30936 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30938 objc-dynamic-declaration:
30939 @dynamic identifier-list ;
30941 For example:
30942 @dynamic MyProperty;
30943 @dynamic MyProperty, AnotherProperty;
30945 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30946 for C. Keep them in sync.
30947 */
30948 static void
30950 {
30952 location_t loc;
30957 {
30958 tree property;
30961 {
30964 }
30968 else
30970 }
30973 }
30975 \f
30976 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30978 /* Returns name of the next clause.
30979 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30980 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30981 returned and the token is consumed. */
30983 static pragma_omp_clause
30985 {
31001 {
31006 {
31183 }
31184 }
31190 }
31192 /* Validate that a clause of the given type does not already exist. */
31194 static void
31197 {
31198 tree c;
31202 {
31205 }
31206 }
31208 /* OpenMP 2.5:
31209 variable-list:
31210 identifier
31211 variable-list , identifier
31213 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31214 colon). An opening parenthesis will have been consumed by the caller.
31216 If KIND is nonzero, create the appropriate node and install the decl
31217 in OMP_CLAUSE_DECL and add the node to the head of the list.
31219 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31220 return the list created.
31222 COLON can be NULL if only closing parenthesis should end the list,
31223 or pointer to bool which will receive false if the list is terminated
31224 by closing parenthesis or true if the list is terminated by colon. */
31226 static tree
31229 {
31233 {
31236 }
31238 {
31243 && current_class_ptr
31245 {
31251 }
31252 else
31253 {
31266 }
31268 ;
31270 {
31272 {
31274 /* The OpenACC cache directive explicitly only allows "array
31275 elements or subarrays". */
31277 {
31281 }
31282 /* FALLTHROUGH. */
31287 {
31288 location_t loc
31293 decl
31297 }
31298 /* FALLTHROUGH. */
31302 {
31310 parser->colon_corrects_to_scope_p
31314 else
31315 {
31316 /* Look for `:'. */
31320 CPP_CLOSE_SQUARE))
31322 }
31323 /* Look for the closing `]'. */
31325 RT_CLOSE_SQUARE))
31329 }
31333 }
31339 }
31340 else
31343 get_comma:
31347 }
31353 {
31357 }
31360 {
31363 /* Try to resync to an unnested comma. Copied from
31364 cp_parser_parenthesized_expression_list. */
31365 skip_comma:
31374 }
31377 }
31379 /* Similarly, but expect leading and trailing parenthesis. This is a very
31380 common case for omp clauses. */
31382 static tree
31384 {
31388 }
31390 /* OpenACC 2.0:
31391 copy ( variable-list )
31392 copyin ( variable-list )
31393 copyout ( variable-list )
31394 create ( variable-list )
31395 delete ( variable-list )
31396 present ( variable-list )
31397 present_or_copy ( variable-list )
31398 pcopy ( variable-list )
31399 present_or_copyin ( variable-list )
31400 pcopyin ( variable-list )
31401 present_or_copyout ( variable-list )
31402 pcopyout ( variable-list )
31403 present_or_create ( variable-list )
31404 pcreate ( variable-list ) */
31406 static tree
31408 tree list)
31409 {
31412 {
31458 }
31466 }
31468 /* OpenACC 2.0:
31469 deviceptr ( variable-list ) */
31471 static tree
31473 {
31477 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31478 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31479 variable-list must only allow for pointer variables. */
31482 {
31489 }
31492 }
31494 /* OpenACC 2.0:
31495 auto
31496 independent
31497 nohost
31498 seq */
31500 static tree
31504 {
31509 }
31511 /* OpenACC:
31512 num_gangs ( expression )
31513 num_workers ( expression )
31514 vector_length ( expression ) */
31516 static tree
31519 {
31522 matching_parens parens;
31530 {
31535 }
31543 }
31545 /* OpenACC:
31547 gang [( gang-arg-list )]
31548 worker [( [num:] int-expr )]
31549 vector [( [length:] int-expr )]
31551 where gang-arg is one of:
31553 [num:] int-expr
31554 static: size-expr
31556 and size-expr may be:
31558 *
31559 int-expr
31560 */
31562 static tree
31565 {
31575 {
31576 matching_parens parens;
31579 do
31580 {
31584 /* Gang static argument. */
31587 {
31595 {
31598 }
31600 /* Check for the '*' argument. */
31604 CPP_CLOSE_PAREN)))
31605 {
31610 {
31613 }
31615 }
31616 }
31617 /* Worker num: argument and vector length: arguments. */
31621 {
31624 }
31626 /* Now collect the actual argument. */
31628 {
31631 }
31643 {
31646 }
31648 }
31653 }
31667 cleanup_error:
31670 }
31672 /* OpenACC 2.0:
31673 tile ( size-expr-list ) */
31675 static tree
31677 {
31681 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31682 so, but the spec authors never considered such a case and have
31683 differing opinions on what it might mean, including 'not
31684 allowed'.) */
31687 clause_loc);
31692 do
31693 {
31700 {
31703 }
31704 else
31708 }
31711 /* Consume the trailing ')'. */
31719 }
31721 /* OpenACC 2.0
31722 Parse wait clause or directive parameters. */
31724 static tree
31726 {
31736 {
31741 }
31748 {
31752 {
31755 else
31756 {
31763 }
31764 }
31765 }
31768 }
31770 /* OpenACC:
31771 wait ( int-expr-list ) */
31773 static tree
31775 {
31784 }
31786 /* OpenMP 3.0:
31787 collapse ( constant-expression ) */
31789 static tree
31791 {
31793 location_t loc;
31794 HOST_WIDE_INT n;
31797 matching_parens parens;
31815 {
31818 }
31827 }
31829 /* OpenMP 2.5:
31830 default ( none | shared )
31832 OpenACC:
31833 default ( none | present ) */
31835 static tree
31838 {
31840 tree c;
31842 matching_parens parens;
31846 {
31851 {
31872 }
31875 }
31876 else
31877 {
31878 invalid_kind:
31881 else
31883 }
31900 }
31902 /* OpenMP 3.1:
31903 final ( expression ) */
31905 static tree
31907 {
31910 matching_parens parens;
31929 }
31931 /* OpenMP 2.5:
31932 if ( expression )
31934 OpenMP 4.5:
31935 if ( directive-name-modifier : expression )
31937 directive-name-modifier:
31938 parallel | task | taskloop | target data | target | target update
31939 | target enter data | target exit data */
31941 static tree
31944 {
31948 matching_parens parens;
31953 {
31965 {
31968 {
31981 else
31982 {
31983 location_t loc
31988 }
31991 {
31993 {
31998 }
32000 {
32001 location_t loc
32005 }
32006 }
32007 }
32008 }
32010 {
32012 {
32015 }
32016 else
32017 {
32019 {
32020 location_t loc
32023 }
32025 }
32026 }
32027 }
32039 {
32042 {
32045 {
32055 }
32057 p);
32059 }
32061 {
32064 else
32067 }
32070 {
32074 }
32075 }
32083 }
32085 /* OpenMP 3.1:
32086 mergeable */
32088 static tree
32091 {
32092 tree c;
32095 location);
32100 }
32102 /* OpenMP 2.5:
32103 nowait */
32105 static tree
32108 {
32109 tree c;
32116 }
32118 /* OpenMP 2.5:
32119 num_threads ( expression ) */
32121 static tree
32123 location_t location)
32124 {
32127 matching_parens parens;
32147 }
32149 /* OpenMP 4.5:
32150 num_tasks ( expression ) */
32152 static tree
32154 location_t location)
32155 {
32158 matching_parens parens;
32178 }
32180 /* OpenMP 4.5:
32181 grainsize ( expression ) */
32183 static tree
32185 location_t location)
32186 {
32189 matching_parens parens;
32209 }
32211 /* OpenMP 4.5:
32212 priority ( expression ) */
32214 static tree
32216 location_t location)
32217 {
32220 matching_parens parens;
32240 }
32242 /* OpenMP 4.5:
32243 hint ( expression ) */
32245 static tree
32247 location_t location)
32248 {
32251 matching_parens parens;
32270 }
32272 /* OpenMP 4.5:
32273 defaultmap ( tofrom : scalar ) */
32275 static tree
32277 location_t location)
32278 {
32282 matching_parens parens;
32287 {
32290 }
32294 {
32297 }
32303 {
32306 }
32310 {
32313 }
32319 location);
32325 out_err:
32330 }
32332 /* OpenMP 2.5:
32333 ordered
32335 OpenMP 4.5:
32336 ordered ( constant-expression ) */
32338 static tree
32341 {
32343 HOST_WIDE_INT n;
32349 {
32350 matching_parens parens;
32367 {
32369 "ordered argument needs positive constant integer "
32372 }
32373 }
32379 }
32381 /* OpenMP 2.5:
32382 reduction ( reduction-operator : variable-list )
32384 reduction-operator:
32385 One of: + * - & ^ | && ||
32387 OpenMP 3.1:
32389 reduction-operator:
32390 One of: + * - & ^ | && || min max
32392 OpenMP 4.0:
32394 reduction-operator:
32395 One of: + * - & ^ | && ||
32396 id-expression */
32398 static tree
32400 {
32408 {
32418 }
32422 else
32423 {
32434 {
32464 }
32465 else
32466 {
32468 resync_fail:
32473 }
32474 }
32480 NULL);
32482 {
32485 }
32488 }
32490 /* OpenMP 2.5:
32491 schedule ( schedule-kind )
32492 schedule ( schedule-kind , expression )
32494 schedule-kind:
32495 static | dynamic | guided | runtime | auto
32497 OpenMP 4.5:
32498 schedule ( schedule-modifier : schedule-kind )
32499 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32501 schedule-modifier:
32502 simd
32503 monotonic
32504 nonmonotonic */
32506 static tree
32508 {
32512 matching_parens parens;
32519 {
32528 else
32534 else
32535 {
32538 }
32539 }
32542 {
32547 {
32568 }
32569 }
32574 else
32580 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32582 {
32586 }
32589 {
32604 else
32609 }
32621 invalid_kind:
32623 resync_fail:
32628 }
32630 /* OpenMP 3.0:
32631 untied */
32633 static tree
32636 {
32637 tree c;
32644 }
32646 /* OpenMP 4.0:
32647 inbranch
32648 notinbranch */
32650 static tree
32653 {
32658 }
32660 /* OpenMP 4.0:
32661 parallel
32662 for
32663 sections
32664 taskgroup */
32666 static tree
32670 {
32674 }
32676 /* OpenMP 4.5:
32677 nogroup */
32679 static tree
32682 {
32687 }
32689 /* OpenMP 4.5:
32690 simd
32691 threads */
32693 static tree
32697 {
32702 }
32704 /* OpenMP 4.0:
32705 num_teams ( expression ) */
32707 static tree
32709 location_t location)
32710 {
32713 matching_parens parens;
32733 }
32735 /* OpenMP 4.0:
32736 thread_limit ( expression ) */
32738 static tree
32740 location_t location)
32741 {
32744 matching_parens parens;
32764 }
32766 /* OpenMP 4.0:
32767 aligned ( variable-list )
32768 aligned ( variable-list : constant-expression ) */
32770 static tree
32772 {
32776 matching_parens parens;
32784 {
32794 }
32800 }
32802 /* OpenMP 4.0:
32803 linear ( variable-list )
32804 linear ( variable-list : expression )
32806 OpenMP 4.5:
32807 linear ( modifier ( variable-list ) )
32808 linear ( modifier ( variable-list ) : expression ) */
32810 static tree
32813 {
32818 matching_parens parens;
32823 {
32835 else
32837 }
32842 else
32843 {
32852 }
32855 {
32860 {
32871 {
32874 }
32877 }
32888 }
32891 {
32894 }
32897 }
32899 /* OpenMP 4.0:
32900 safelen ( constant-expression ) */
32902 static tree
32904 location_t location)
32905 {
32908 matching_parens parens;
32927 }
32929 /* OpenMP 4.0:
32930 simdlen ( constant-expression ) */
32932 static tree
32934 location_t location)
32935 {
32938 matching_parens parens;
32957 }
32959 /* OpenMP 4.5:
32960 vec:
32961 identifier [+/- integer]
32962 vec , identifier [+/- integer]
32963 */
32965 static tree
32967 tree list)
32968 {
32972 {
32975 }
32978 {
32985 else
32986 {
32987 t = cp_parser_lookup_name_simple
32992 id_loc);
32993 }
32999 {
33002 }
33006 {
33009 }
33013 {
33016 }
33019 add_to_vector:
33021 {
33025 }
33031 }
33034 {
33040 }
33042 }
33044 /* OpenMP 4.0:
33045 depend ( depend-kind : variable-list )
33047 depend-kind:
33048 in | out | inout
33050 OpenMP 4.5:
33051 depend ( source )
33053 depend ( sink : vec ) */
33055 static tree
33057 {
33061 matching_parens parens;
33066 {
33080 else
33082 }
33083 else
33089 {
33099 }
33106 else
33107 {
33113 }
33116 invalid_kind:
33118 resync_fail:
33123 }
33125 /* OpenMP 4.0:
33126 map ( map-kind : variable-list )
33127 map ( variable-list )
33129 map-kind:
33130 alloc | to | from | tofrom
33132 OpenMP 4.5:
33133 map-kind:
33134 alloc | to | from | tofrom | release | delete
33136 map ( always [,] map-kind: variable-list ) */
33138 static tree
33140 {
33149 {
33154 {
33157 nth++;
33163 {
33168 }
33169 }
33170 }
33174 {
33188 else
33189 {
33195 }
33198 }
33201 {
33205 }
33208 NULL);
33214 }
33216 /* OpenMP 4.0:
33217 device ( expression ) */
33219 static tree
33221 location_t location)
33222 {
33225 matching_parens parens;
33245 }
33247 /* OpenMP 4.0:
33248 dist_schedule ( static )
33249 dist_schedule ( static , expression ) */
33251 static tree
33253 location_t location)
33254 {
33257 matching_parens parens;
33268 {
33279 }
33284 location);
33288 invalid_kind:
33290 resync_fail:
33295 }
33297 /* OpenMP 4.0:
33298 proc_bind ( proc-bind-kind )
33300 proc-bind-kind:
33301 master | close | spread */
33303 static tree
33305 location_t location)
33306 {
33307 tree c;
33314 {
33324 else
33326 }
33327 else
33336 location);
33341 invalid_kind:
33343 resync_fail:
33348 }
33350 /* OpenACC:
33351 async [( int-expr )] */
33353 static tree
33355 {
33362 {
33363 matching_parens parens;
33372 }
33382 }
33384 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33385 is a bitmask in MASK. Return the list of clauses found. */
33387 static tree
33391 {
33396 {
33397 location_t here;
33398 pragma_omp_clause c_kind;
33399 omp_clause_code code;
33410 {
33462 clauses);
33480 OMP_CLAUSE_INDEPENDENT,
33492 clauses);
33498 clauses);
33522 clauses);
33544 clauses);
33556 clauses);
33570 }
33575 {
33576 /* Remove the invalid clause(s) from the list to avoid
33577 confusing the rest of the compiler. */
33580 }
33581 }
33583 saw_error:
33590 }
33592 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33593 is a bitmask in MASK. Return the list of clauses found; the result
33594 of clause default goes in *pdefault. */
33596 static tree
33600 {
33606 {
33607 pragma_omp_clause c_kind;
33618 {
33630 clauses);
33644 clauses);
33664 clauses);
33669 clauses);
33679 clauses);
33713 clauses);
33727 clauses);
33742 OMP_CLAUSE_NOTINBRANCH,
33751 {
33752 clause_not_first:
33756 }
33786 clauses);
33787 else
33797 clauses);
33815 {
33820 }
33863 clauses
33869 clauses
33877 }
33882 {
33883 /* Remove the invalid clause(s) from the list to avoid
33884 confusing the rest of the compiler. */
33887 }
33888 }
33889 saw_error:
33892 {
33895 else
33897 }
33899 }
33901 /* OpenMP 2.5:
33902 structured-block:
33903 statement
33905 In practice, we're also interested in adding the statement to an
33906 outer node. So it is convenient if we work around the fact that
33907 cp_parser_statement calls add_stmt. */
33909 static unsigned
33911 {
33914 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33915 This preserves the "not within loop or switch" style error messages
33916 for nonsense cases like
33917 void foo() {
33918 #pragma omp single
33919 break;
33920 }
33921 */
33926 }
33928 static void
33930 {
33932 }
33934 static tree
33936 {
33944 }
33946 /* OpenMP 2.5:
33947 # pragma omp atomic new-line
33948 expression-stmt
33950 expression-stmt:
33951 x binop= expr | x++ | ++x | x-- | --x
33952 binop:
33953 +, *, -, /, &, ^, |, <<, >>
33955 where x is an lvalue expression with scalar type.
33957 OpenMP 3.1:
33958 # pragma omp atomic new-line
33959 update-stmt
33961 # pragma omp atomic read new-line
33962 read-stmt
33964 # pragma omp atomic write new-line
33965 write-stmt
33967 # pragma omp atomic update new-line
33968 update-stmt
33970 # pragma omp atomic capture new-line
33971 capture-stmt
33973 # pragma omp atomic capture new-line
33974 capture-block
33976 read-stmt:
33977 v = x
33978 write-stmt:
33979 x = expr
33980 update-stmt:
33981 expression-stmt | x = x binop expr
33982 capture-stmt:
33983 v = expression-stmt
33984 capture-block:
33985 { v = x; update-stmt; } | { update-stmt; v = x; }
33987 OpenMP 4.0:
33988 update-stmt:
33989 expression-stmt | x = x binop expr | x = expr binop x
33990 capture-stmt:
33991 v = update-stmt
33992 capture-block:
33993 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33995 where x and v are lvalue expressions with scalar type. */
33997 static void
33999 {
34007 {
34012 {
34018 }
34019 }
34021 {
34033 else
34037 }
34039 {
34045 {
34050 {
34053 }
34054 }
34055 }
34059 {
34069 else
34074 {
34075 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34076 opcode. */
34081 }
34085 {
34088 }
34089 else
34090 {
34096 }
34099 }
34101 restart:
34105 {
34112 /* FALLTHROUGH */
34122 /* FALLTHROUGH */
34137 /* Undo effects of boolean_increment for post {in,de}crement. */
34139 /* FALLTHRU */
34143 {
34144 /* Undo effects of boolean_increment. */
34146 {
34147 /* This is pre or post increment. */
34152 && !structured_block
34156 }
34157 }
34158 /* FALLTHRU */
34161 {
34196 {
34200 }
34203 {
34209 {
34214 }
34216 {
34228 {
34230 {
34235 }
34236 else
34238 }
34242 }
34245 {
34252 }
34256 }
34260 {
34263 {
34271 }
34273 {
34278 }
34313 }
34324 /* FALLTHROUGH */
34329 }
34336 }
34337 stmt_done:
34339 {
34350 }
34352 {
34355 }
34356 done:
34362 saw_error:
34365 {
34369 {
34373 }
34374 }
34375 }
34378 /* OpenMP 2.5:
34379 # pragma omp barrier new-line */
34381 static void
34383 {
34386 }
34388 /* OpenMP 2.5:
34389 # pragma omp critical [(name)] new-line
34390 structured-block
34392 OpenMP 4.5:
34393 # pragma omp critical [(name) [hint(expression)]] new-line
34394 structured-block */
34396 #define OMP_CRITICAL_CLAUSE_MASK \
34397 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34399 static tree
34401 {
34405 {
34406 matching_parens parens;
34420 OMP_CRITICAL_CLAUSE_MASK,
34422 }
34423 else
34428 }
34430 /* OpenMP 2.5:
34431 # pragma omp flush flush-vars[opt] new-line
34433 flush-vars:
34434 ( variable-list ) */
34436 static void
34438 {
34444 }
34446 /* Helper function, to parse omp for increment expression. */
34448 static tree
34450 {
34455 {
34458 }
34461 {
34468 /* Fall through: OpenMP disallows NE_EXPR. */
34472 }
34474 /* If decl is an iterator, preserve LHS and RHS of the relational
34475 expr until finish_omp_for. */
34486 }
34488 /* Helper function, to parse omp for increment expression. */
34490 static tree
34492 {
34496 cp_id_kind idk;
34500 {
34509 }
34518 {
34523 }
34530 {
34534 }
34547 do
34548 {
34555 {
34557 {
34560 else
34562 tf_warning_or_error);
34563 }
34564 else
34567 }
34568 }
34572 {
34578 }
34579 else
34583 }
34585 /* Parse the initialization statement of an OpenMP for loop.
34587 Return true if the resulting construct should have an
34588 OMP_CLAUSE_PRIVATE added to it. */
34590 static tree
34598 {
34604 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34606 init-expr:
34607 var = lb
34608 integer-type var = lb
34609 random-access-iterator-type var = lb
34610 pointer-type var = lb
34611 */
34612 cp_decl_specifier_seq type_specifiers;
34614 /* First, try to parse as an initialized declaration. See
34615 cp_parser_condition, from whence the bulk of this is copied. */
34622 {
34623 /* If parsing a type specifier seq succeeded, then this
34624 MUST be a initialized declaration. */
34629 CP_PARSER_DECLARATOR_NAMED,
34640 else
34641 {
34651 {
34653 CPP_OPEN_PAREN))
34656 else
34657 /* Trigger an error. */
34662 }
34666 {
34674 {
34677 auto_node);
34682 }
34685 asm_specification,
34686 LOOKUP_ONLYCONVERTING);
34689 {
34692 }
34693 else
34694 {
34697 {
34699 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34701 {
34705 {
34709 }
34711 }
34713 {
34718 }
34719 }
34720 }
34722 }
34723 else
34724 {
34725 /* Consume '='. */
34729 non_class:
34732 else
34735 asm_specification,
34736 LOOKUP_ONLYCONVERTING);
34737 }
34741 }
34742 }
34743 else
34744 {
34745 cp_id_kind idk;
34746 /* If parsing a type specifier sequence failed, then
34747 this MUST be a simple expression. */
34753 && decl
34756 {
34767 {
34772 }
34777 }
34779 && decl
34782 {
34783 tree rhs;
34791 rhs,
34792 tf_warning_or_error));
34795 }
34796 else
34797 {
34802 {
34806 }
34807 }
34808 }
34810 }
34812 /* Parse the restricted form of the for statement allowed by OpenMP. */
34814 static tree
34817 {
34821 location_t loc_first;
34832 {
34835 }
34838 {
34841 }
34844 {
34850 }
34852 {
34855 {
34857 "%<linear%> clause may not be specified together "
34860 }
34861 else
34863 }
34876 {
34879 location_t loc;
34882 {
34886 }
34889 matching_parens parens;
34896 add_private_clause
34902 {
34905 {
34911 }
34912 else
34914 }
34921 {
34926 {
34930 }
34933 {
34934 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34938 {
34941 }
34942 else
34943 {
34946 }
34948 }
34949 else
34950 {
34955 }
34956 }
34959 {
34960 tree c;
34962 {
34971 decl);
34975 decl);
34976 }
34978 {
34983 else
34988 {
34991 /* For linear, signal that we need to fill up
34992 the so far unknown linear step. */
34995 }
34996 }
34997 }
35006 {
35007 /* If decl is an iterator, preserve the operator on decl
35008 until finish_omp_for. */
35010 && ((processing_template_decl
35015 else
35019 }
35031 {
35034 }
35039 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35040 in between the collapsed for loops to be still considered perfectly
35041 nested. Hopefully the final version clarifies this.
35042 For now handle (multiple) {'s and empty statements. */
35045 {
35049 {
35051 bracecount++;
35052 }
35056 else
35057 {
35064 }
35065 }
35068 {
35071 }
35072 }
35077 /* Note that we saved the original contents of this flag when we entered
35078 the structured block, and so we don't need to re-save it here. */
35081 /* Note that the grammar doesn't call for a structured block here,
35082 though the loop as a whole is a structured block. */
35089 else
35094 {
35096 {
35098 nbraces--;
35099 }
35102 else
35103 {
35105 {
35108 }
35113 }
35114 }
35117 {
35121 else
35123 }
35127 }
35129 /* Helper function for OpenMP parsing, split clauses and call
35130 finish_omp_clauses on each of the set of clauses afterwards. */
35132 static void
35135 {
35141 }
35143 /* OpenMP 4.0:
35144 #pragma omp simd simd-clause[optseq] new-line
35145 for-loop */
35147 #define OMP_SIMD_CLAUSE_MASK \
35148 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35157 static tree
35161 {
35172 {
35176 OMP_CLAUSE_ORDERED);
35178 {
35180 "%<ordered%> clause with parameter may not be specified "
35183 }
35184 }
35195 }
35197 /* OpenMP 2.5:
35198 #pragma omp for for-clause[optseq] new-line
35199 for-loop
35201 OpenMP 4.0:
35202 #pragma omp for simd for-simd-clause[optseq] new-line
35203 for-loop */
35205 #define OMP_FOR_CLAUSE_MASK \
35206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35216 static tree
35220 {
35227 /* parallel for{, simd} disallows nowait clause, but for
35228 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35231 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35236 {
35241 {
35265 }
35266 }
35268 {
35271 }
35273 /* Composite distribute parallel for disallows linear clause. */
35280 {
35283 }
35294 }
35296 /* OpenMP 2.5:
35297 # pragma omp master new-line
35298 structured-block */
35300 static tree
35302 {
35306 }
35308 /* OpenMP 2.5:
35309 # pragma omp ordered new-line
35310 structured-block
35312 OpenMP 4.5:
35313 # pragma omp ordered ordered-clauses new-line
35314 structured-block */
35316 #define OMP_ORDERED_CLAUSE_MASK \
35317 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35320 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35321 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35323 static bool
35326 {
35330 {
35335 {
35337 {
35340 }
35342 {
35344 "%<depend%> clause may only be used in compound "
35348 }
35349 tree clauses
35351 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35355 }
35356 }
35358 tree clauses
35369 }
35371 /* OpenMP 2.5:
35373 section-scope:
35374 { section-sequence }
35376 section-sequence:
35377 section-directive[opt] structured-block
35378 section-sequence section-directive structured-block */
35380 static tree
35382 {
35387 matching_braces braces;
35395 {
35399 }
35402 {
35410 {
35414 }
35416 {
35419 }
35424 }
35435 }
35437 /* OpenMP 2.5:
35438 # pragma omp sections sections-clause[optseq] newline
35439 sections-scope */
35441 #define OMP_SECTIONS_CLAUSE_MASK \
35442 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35448 static tree
35451 {
35463 {
35466 }
35473 }
35475 /* OpenMP 2.5:
35476 # pragma omp parallel parallel-clause[optseq] new-line
35477 structured-block
35478 # pragma omp parallel for parallel-for-clause[optseq] new-line
35479 structured-block
35480 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35481 structured-block
35483 OpenMP 4.0:
35484 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35485 structured-block */
35487 #define OMP_PARALLEL_CLAUSE_MASK \
35488 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35498 static tree
35502 {
35509 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35515 {
35523 if_p);
35527 if_p);
35530 block);
35535 }
35536 /* When combined with distribute, parallel has to be followed by for.
35537 #pragma omp target parallel is allowed though. */
35541 {
35545 }
35547 {
35550 }
35552 {
35556 {
35566 block);
35569 }
35570 }
35575 {
35578 }
35586 }
35588 /* OpenMP 2.5:
35589 # pragma omp single single-clause[optseq] new-line
35590 structured-block */
35592 #define OMP_SINGLE_CLAUSE_MASK \
35593 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35598 static tree
35600 {
35610 }
35612 /* OpenMP 3.0:
35613 # pragma omp task task-clause[optseq] new-line
35614 structured-block */
35616 #define OMP_TASK_CLAUSE_MASK \
35617 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35628 static tree
35630 {
35641 }
35643 /* OpenMP 3.0:
35644 # pragma omp taskwait new-line */
35646 static void
35648 {
35651 }
35653 /* OpenMP 3.1:
35654 # pragma omp taskyield new-line */
35656 static void
35658 {
35661 }
35663 /* OpenMP 4.0:
35664 # pragma omp taskgroup new-line
35665 structured-block */
35667 static tree
35669 {
35673 if_p));
35674 }
35677 /* OpenMP 2.5:
35678 # pragma omp threadprivate (variable-list) */
35680 static void
35682 {
35683 tree vars;
35689 }
35691 /* OpenMP 4.0:
35692 # pragma omp cancel cancel-clause[optseq] new-line */
35694 #define OMP_CANCEL_CLAUSE_MASK \
35695 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35701 static void
35703 {
35707 }
35709 /* OpenMP 4.0:
35710 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35712 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35713 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35718 static void
35721 {
35722 tree clauses;
35726 {
35731 {
35734 }
35735 }
35737 {
35741 }
35744 {
35749 else
35753 }
35756 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35758 pragma_tok);
35760 }
35762 /* OpenMP 4.0:
35763 #pragma omp distribute distribute-clause[optseq] new-line
35764 for-loop */
35766 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35767 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35773 static tree
35777 {
35786 {
35794 else
35797 {
35803 {
35807 else
35810 }
35816 else
35830 }
35831 }
35833 {
35836 }
35841 {
35844 }
35855 }
35857 /* OpenMP 4.0:
35858 # pragma omp teams teams-clause[optseq] new-line
35859 structured-block */
35861 #define OMP_TEAMS_CLAUSE_MASK \
35862 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35870 static tree
35874 {
35883 {
35887 {
35912 }
35913 }
35915 {
35918 }
35923 {
35926 }
35935 }
35937 /* OpenMP 4.0:
35938 # pragma omp target data target-data-clause[optseq] new-line
35939 structured-block */
35941 #define OMP_TARGET_DATA_CLAUSE_MASK \
35942 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35947 static tree
35949 {
35950 tree clauses
35955 {
35958 {
35975 "%<#pragma omp target data%> with map-type other "
35976 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35980 }
35982 }
35985 {
35988 "%<#pragma omp target data%> must contain at least "
35991 }
36002 }
36004 /* OpenMP 4.5:
36005 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36006 structured-block */
36008 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36009 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36015 static tree
36018 {
36021 {
36026 {
36029 }
36030 }
36032 {
36036 }
36039 {
36045 }
36047 tree clauses
36052 {
36055 {
36068 "%<#pragma omp target enter data%> with map-type other "
36072 }
36074 }
36077 {
36080 "%<#pragma omp target enter data%> must contain at least "
36083 }
36090 }
36092 /* OpenMP 4.5:
36093 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36094 structured-block */
36096 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36097 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36103 static tree
36106 {
36109 {
36114 {
36117 }
36118 }
36120 {
36124 }
36127 {
36133 }
36135 tree clauses
36140 {
36143 {
36157 "%<#pragma omp target exit data%> with map-type other "
36158 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36162 }
36164 }
36167 {
36170 "%<#pragma omp target exit data%> must contain at least "
36173 }
36180 }
36182 /* OpenMP 4.0:
36183 # pragma omp target update target-update-clause[optseq] new-line */
36185 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36186 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36193 static bool
36196 {
36198 {
36204 }
36206 tree clauses
36211 {
36213 "%<#pragma omp target update%> must contain at least one "
36216 }
36224 }
36226 /* OpenMP 4.0:
36227 # pragma omp target target-clause[optseq] new-line
36228 structured-block */
36230 #define OMP_TARGET_CLAUSE_MASK \
36231 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36241 static bool
36244 {
36248 {
36260 {
36268 {
36269 tree stmt;
36271 {
36274 OMP_TARGET_CLAUSE_MASK,
36279 OMP_TARGET_CLAUSE_MASK,
36284 OMP_TARGET_CLAUSE_MASK,
36289 }
36291 }
36296 {
36300 if_p);
36305 if_p);
36310 if_p);
36314 }
36320 {
36321 /* For combined target teams, ensure the num_teams and
36322 thread_limit clause expressions are evaluated on the host,
36323 before entering the target construct. */
36324 tree c;
36330 {
36339 OMP_CLAUSE_FIRSTPRIVATE);
36344 }
36345 }
36355 }
36357 {
36360 }
36362 {
36366 }
36368 {
36372 }
36374 {
36378 }
36380 {
36383 }
36384 }
36386 {
36389 }
36404 check_clauses:
36406 {
36409 {
36423 "%<#pragma omp target%> with map-type other "
36424 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36428 }
36430 }
36432 }
36434 /* OpenACC 2.0:
36435 # pragma acc cache (variable-list) new-line
36436 */
36438 static tree
36440 {
36455 }
36457 /* OpenACC 2.0:
36458 # pragma acc data oacc-data-clause[optseq] new-line
36459 structured-block */
36461 #define OACC_DATA_CLAUSE_MASK \
36462 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36474 static tree
36476 {
36489 }
36491 /* OpenACC 2.0:
36492 # pragma acc host_data <clauses> new-line
36493 structured-block */
36495 #define OACC_HOST_DATA_CLAUSE_MASK \
36496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36498 static tree
36500 {
36513 }
36515 /* OpenACC 2.0:
36516 # pragma acc declare oacc-data-clause[optseq] new-line
36517 */
36519 #define OACC_DECLARE_CLAUSE_MASK \
36520 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36533 static tree
36535 {
36544 {
36548 }
36551 {
36555 {
36559 }
36562 {
36574 {
36576 "%qD must be a global variable in "
36578 decl);
36581 }
36586 {
36590 }
36592 {
36594 "invalid use of %<extern%> variable %qD "
36598 }
36600 {
36602 "invalid use of %<global%> variable %qD "
36606 }
36608 }
36613 {
36618 }
36621 {
36622 tree id;
36626 else
36632 {
36635 {
36638 {
36642 }
36643 }
36644 }
36645 }
36646 }
36659 }
36661 /* OpenACC 2.0:
36662 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36664 or
36666 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36668 LOC is the location of the #pragma token.
36669 */
36671 #define OACC_ENTER_DATA_CLAUSE_MASK \
36672 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36680 #define OACC_EXIT_DATA_CLAUSE_MASK \
36681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36687 static tree
36690 {
36699 {
36704 }
36711 else
36716 {
36720 }
36728 }
36730 /* OpenACC 2.0:
36731 # pragma acc loop oacc-loop-clause[optseq] new-line
36732 structured-block */
36734 #define OACC_LOOP_CLAUSE_MASK \
36735 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36746 static tree
36749 {
36758 {
36764 }
36773 }
36775 /* OpenACC 2.0:
36776 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36777 structured-block
36779 or
36781 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36782 structured-block
36783 */
36785 #define OACC_KERNELS_CLAUSE_MASK \
36786 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36804 #define OACC_PARALLEL_CLAUSE_MASK \
36805 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36826 static tree
36829 {
36830 omp_clause_mask mask;
36833 {
36846 }
36849 {
36853 {
36856 tree clauses;
36858 if_p);
36860 }
36861 }
36870 }
36872 /* OpenACC 2.0:
36873 # pragma acc update oacc-update-clause[optseq] new-line
36874 */
36876 #define OACC_UPDATE_CLAUSE_MASK \
36877 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36884 static tree
36886 {
36893 {
36895 "%<#pragma acc update%> must contain at least one "
36898 }
36906 }
36908 /* OpenACC 2.0:
36909 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36911 LOC is the location of the #pragma token.
36912 */
36914 #define OACC_WAIT_CLAUSE_MASK \
36915 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36917 static tree
36919 {
36933 }
36935 /* OpenMP 4.0:
36936 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36938 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36939 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36946 static void
36949 {
36951 cp_omp_declare_simd_data data;
36953 {
36958 /* It is safe to take the address of a local variable; it will only be
36959 used while this scope is live. */
36961 }
36963 /* Store away all pragma tokens. */
36975 {
36979 {
36992 }
36997 "%<#pragma omp declare simd%> not immediately followed by "
37001 }
37002 }
37004 /* Finalize #pragma omp declare simd clauses after direct declarator has
37005 been parsed, and put that into "omp declare simd" attribute. */
37007 static tree
37009 {
37015 {
37019 }
37024 {
37042 }
37046 }
37049 /* OpenMP 4.0:
37050 # pragma omp declare target new-line
37051 declarations and definitions
37052 # pragma omp end declare target new-line
37054 OpenMP 4.5:
37055 # pragma omp declare target ( extended-list ) new-line
37057 # pragma omp declare target declare-target-clauses[seq] new-line */
37059 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37060 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37063 static void
37065 {
37068 clauses
37072 {
37074 clauses);
37077 }
37078 else
37079 {
37083 }
37086 "%<#pragma omp declare target%> with clauses in between "
37087 "%<#pragma omp declare target%> without clauses and "
37090 {
37096 {
37099 }
37100 else
37103 {
37105 "%qD specified both in declare target %<link%> and %<to%>"
37108 }
37110 {
37117 {
37120 {
37124 }
37125 }
37126 }
37127 }
37128 }
37130 static void
37132 {
37135 {
37138 }
37140 {
37144 {
37147 }
37150 else
37151 {
37155 }
37156 }
37157 else
37158 {
37162 }
37166 "%<#pragma omp end declare target%> without corresponding "
37168 else
37170 }
37172 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37173 expression and optional initializer clause of
37174 #pragma omp declare reduction. We store the expression(s) as
37175 either 3, 6 or 7 special statements inside of the artificial function's
37176 body. The first two statements are DECL_EXPRs for the artificial
37177 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37178 expression that uses those variables.
37179 If there was any INITIALIZER clause, this is followed by further statements,
37180 the fourth and fifth statements are DECL_EXPRs for the artificial
37181 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37182 constructor variant (first token after open paren is not omp_priv),
37183 then the sixth statement is a statement with the function call expression
37184 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37185 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37186 to initialize the OMP_PRIV artificial variable and there is seventh
37187 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37189 static bool
37191 {
37203 tree combiner;
37218 {
37221 }
37224 {
37226 matching_parens parens;
37232 {
37235 }
37251 {
37255 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37259 == CPP_CLOSE_PAREN
37262 {
37266 }
37271 }
37272 else
37273 {
37289 {
37294 }
37296 tree arg;
37309 }
37320 }
37324 UNKNOWN_LOCATION);
37327 }
37329 /* OpenMP 4.0
37330 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37331 initializer-clause[opt] new-line
37333 initializer-clause:
37334 initializer (omp_priv initializer)
37335 initializer (function-name (argument-list)) */
37337 static void
37340 {
37350 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37357 {
37389 }
37401 /* Types may not be defined in declare reduction type list. */
37404 parser->type_definition_forbidden_message
37410 saved_colon_doesnt_start_class_def_p
37415 {
37419 ;
37438 else
37443 else
37445 }
37447 /* Restore the saved message. */
37450 parser->colon_doesnt_start_class_def_p
37455 {
37456 fail:
37459 }
37465 {
37466 tree fntype
37469 NULL_TREE);
37489 {
37494 }
37496 {
37498 {
37507 }
37514 }
37515 else
37516 {
37519 }
37522 else
37525 {
37528 }
37530 {
37533 else
37538 }
37543 else
37544 {
37553 }
37560 }
37564 done:
37565 /* Free any declarators allocated. */
37567 }
37569 /* OpenMP 4.0
37570 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37571 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37572 initializer-clause[opt] new-line
37573 #pragma omp declare target new-line */
37575 static bool
37578 {
37580 {
37585 {
37588 context);
37590 }
37593 {
37596 context);
37598 }
37600 {
37603 }
37605 {
37609 }
37610 }
37615 }
37617 /* OpenMP 4.5:
37618 #pragma omp taskloop taskloop-clause[optseq] new-line
37619 for-loop
37621 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37622 for-loop */
37624 #define OMP_TASKLOOP_CLAUSE_MASK \
37625 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37640 static tree
37644 {
37653 {
37658 {
37682 }
37683 }
37685 {
37688 }
37693 {
37696 }
37702 if_p);
37708 }
37711 /* OpenACC 2.0:
37712 # pragma acc routine oacc-routine-clause[optseq] new-line
37713 function-definition
37715 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37716 */
37718 #define OACC_ROUTINE_CLAUSE_MASK \
37719 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37725 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37726 component, which must resolve to a declared namespace-scope
37727 function. The clauses are either processed directly (for a named
37728 function), or defered until the immediatley following declaration
37729 is parsed. */
37731 static void
37734 {
37736 /* The checking for "another pragma following this one" in the "no optional
37737 '( name )'" case makes sure that we dont re-enter. */
37740 cp_oacc_routine_data data;
37746 /* It is safe to take the address of a local variable; it will only be
37747 used while this scope is live. */
37750 /* Look for optional '( name )'. */
37752 {
37753 matching_parens parens;
37756 /* We parse the name as an id-expression. If it resolves to
37757 anything other than a non-overloaded function at namespace
37758 scope, it's an error. */
37772 {
37776 }
37778 data.clauses
37786 {
37791 }
37793 /* Perhaps we should use the same rule as declarations in different
37794 namespaces? */
37796 {
37801 }
37804 {
37808 }
37812 }
37814 {
37815 /* Store away all pragma tokens. */
37826 /* Emit a helpful diagnostic if there's another pragma following this
37827 one. */
37829 {
37832 /* ..., and then just keep going. */
37834 }
37836 /* We only have to consider the pragma_external case here. */
37841 else
37844 }
37845 }
37847 /* Finalize #pragma acc routine clauses after direct declarator has
37848 been parsed. */
37850 static tree
37852 {
37857 {
37859 "%<#pragma acc routine%> not immediately followed by "
37862 }
37879 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37880 fndecl_seen. */
37883 }
37885 /* Apply any saved OpenACC routine clauses to a just-parsed
37886 declaration. */
37888 static void
37890 {
37892 {
37893 /* Keep going if we're in error reporting mode. */
37899 {
37901 "%<#pragma acc routine%> not immediately followed by"
37905 }
37907 {
37910 }
37913 {
37918 }
37921 {
37929 }
37931 /* Process the routine's dimension clauses. */
37935 /* Add an "omp declare target" attribute. */
37940 /* Don't unset parser->oacc_routine here: we may still need it to
37941 diagnose wrong usage. But, remember that we've used this "#pragma acc
37942 routine". */
37944 }
37945 }
37947 /* Main entry point to OpenMP statement pragmas. */
37949 static void
37951 {
37952 tree stmt;
37957 {
37980 if_p);
37985 if_p);
38002 if_p);
38007 if_p);
38015 if_p);
38024 if_p);
38038 if_p);
38043 if_p);
38047 }
38050 }
38051 \f
38052 /* Transactional Memory parsing routines. */
38054 /* Parse a transaction attribute.
38056 txn-attribute:
38057 attribute
38058 [ [ identifier ] ]
38060 We use this instead of cp_parser_attributes_opt for transactions to avoid
38061 the pedwarn in C++98 mode. */
38063 static tree
38065 {
38080 {
38084 /* For keywords, use the canonical spelling,
38085 not the parsed identifier. */
38089 }
38090 else
38094 error1:
38097 }
38099 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38101 transaction-statement:
38102 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38103 compound-statement
38104 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38105 */
38107 static tree
38109 {
38120 else
38121 {
38125 }
38127 /* Parse a noexcept specification. */
38131 {
38132 /* cancel-and-throw is unimplemented. */
38135 }
38136 else
38139 /* Keep track if we're in the lexical scope of an outer transaction. */
38151 }
38153 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38155 transaction-expression:
38156 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38157 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38158 */
38160 static tree
38162 {
38175 keyword == RID_TRANSACTION_RELAXED
38189 /* Set this early. This might mean that we allow transaction_cancel in
38190 an expression that we find out later actually has to be a constexpr.
38191 However, we expect that cxx_constant_value will be able to deal with
38192 this; also, if the noexcept has no constexpr, then what we parse next
38193 really is a transaction's body. */
38196 /* Parse a noexcept specification. */
38202 {
38203 matching_parens parens;
38210 }
38211 else
38212 {
38213 /* The only expression that is available got parsed for the noexcept
38214 already. noexcept is true then. */
38217 }
38226 }
38228 /* Parse a function-transaction-block.
38230 function-transaction-block:
38231 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38232 function-body
38233 __transaction_atomic txn-attribute[opt] function-try-block
38234 __transaction_relaxed ctor-initializer[opt] function-body
38235 __transaction_relaxed function-try-block
38236 */
38238 static void
38240 {
38255 else
38256 {
38260 }
38268 else
38269 cp_parser_ctor_initializer_opt_and_function_body
38275 }
38277 /* Parse a __transaction_cancel statement.
38279 cancel-statement:
38280 __transaction_cancel txn-attribute[opt] ;
38281 __transaction_cancel txn-attribute[opt] throw-expression ;
38283 ??? Cancel and throw is not yet implemented. */
38285 static tree
38287 {
38293 RT_TRANSACTION_CANCEL);
38300 /* ??? Parse cancel-and-throw here. */
38305 {
38309 }
38311 {
38315 }
38317 {
38320 {
38326 }
38327 }
38329 {
38333 }
38339 }
38340 \f
38341 /* The parser. */
38345 \f
38346 /* Special handling for the first token or line in the file. The first
38347 thing in the file might be #pragma GCC pch_preprocess, which loads a
38348 PCH file, which is a GC collection point. So we need to handle this
38349 first pragma without benefit of an existing lexer structure.
38351 Always returns one token to the caller in *FIRST_TOKEN. This is
38352 either the true first token of the file, or the first token after
38353 the initial pragma. */
38355 static void
38357 {
38366 {
38373 }
38374 else
38377 /* Skip to the end of the pragma. */
38381 /* Now actually load the PCH file. */
38385 /* Read one more token to return to our caller. We have to do this
38386 after reading the PCH file in, since its pointers have to be
38387 live. */
38389 }
38391 /* Parse a pragma GCC ivdep. */
38393 static bool
38395 {
38398 }
38400 /* Parse a pragma GCC unroll. */
38402 static unsigned short
38404 {
38414 {
38416 " assignment-expression that evaluates to a non-negative"
38419 }
38420 else
38421 {
38425 }
38428 }
38430 /* Normal parsing of a pragma token. Here we can (and must) use the
38431 regular lexer. */
38433 static bool
38435 {
38438 tree stmt;
38449 {
38457 {
38467 }
38472 {
38482 }
38487 {
38498 }
38503 {
38514 }
38519 {
38530 }
38550 {
38555 }
38563 {
38568 }
38576 {
38580 }
38586 {
38591 }
38599 {
38604 }
38659 "%<#pragma omp section%> may only be used in "
38664 {
38666 {
38670 }
38676 {
38680 }
38681 else
38687 {
38690 }
38693 }
38696 {
38698 {
38702 }
38703 const unsigned short unroll
38709 {
38713 }
38714 else
38720 {
38723 }
38726 }
38733 bad_stmt:
38736 }
38740 }
38742 /* The interface the pragma parsers have to the lexer. */
38744 enum cpp_ttype
38746 {
38758 else
38759 {
38763 }
38766 }
38768 \f
38769 /* External interface. */
38771 /* Parse one entire translation unit. */
38773 void
38775 {
38788 }
38790 /* Create an identifier for a generic parameter type (a synthesized
38791 template parameter implied by `auto' or a concept identifier). */
38794 static tree
38796 {
38800 }
38802 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38803 (creating a new template parameter list if necessary). Returns the newly
38804 created template type parm. */
38806 static tree
38808 {
38811 /* Before committing to modifying any scope, if we're in an
38812 implicit template scope, and we're trying to synthesize a
38813 constrained parameter, try to find a previous parameter with
38814 the same name. This is the same-type rule for abbreviated
38815 function templates.
38817 NOTE: We can generate implicit parameters when tentatively
38818 parsing a nested name specifier, only to reject that parse
38819 later. However, matching the same template-id as part of a
38820 direct-declarator should generate an identical template
38821 parameter, so this rule will merge them. */
38823 {
38826 {
38828 {
38831 /* Return the TEMPLATE_PARM_INDEX. */
38834 }
38836 }
38837 }
38839 /* We are either continuing a function template that already contains implicit
38840 template parameters, creating a new fully-implicit function template, or
38841 extending an existing explicit function template with implicit template
38842 parameters. */
38850 {
38854 }
38855 else
38856 {
38857 /* Roll back to the existing template parameter scope (in the case of
38858 extending an explicit function template) or introduce a new template
38859 parameter scope ahead of the function parameter scope (or class scope
38860 in the case of out-of-line member definitions). The function scope is
38861 added back after template parameter synthesis below. */
38866 {
38869 }
38871 {
38872 /* If not defining a class, then any class scope is a scope level in
38873 an out-of-line member definition. In this case simply wind back
38874 beyond the first such scope to inject the template parameter list.
38875 Otherwise wind back to the class being defined. The latter can
38876 occur in class member friend declarations such as:
38878 class A {
38879 void foo (auto);
38880 };
38881 class B {
38882 friend void A::foo (auto);
38883 };
38885 The template parameter list synthesized for the friend declaration
38886 must be injected in the scope of 'B'. This can also occur in
38887 erroneous cases such as:
38889 struct A {
38890 struct B {
38891 void foo (auto);
38892 };
38893 void B::foo (auto) {}
38894 };
38896 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38897 but, nevertheless, the template parameter list synthesized for the
38898 declarator should be injected into the scope of 'A' as if the
38899 ill-formed template was specified explicitly. */
38902 {
38905 }
38906 }
38912 {
38913 /* Introduce a new template parameter list for implicit template
38914 parameters. */
38918 parser->implicit_template_scope
38925 }
38926 else
38927 {
38928 /* Synthesize implicit template parameters at the end of the explicit
38929 template parameter list. */
38936 parser->implicit_template_parms
38938 }
38939 }
38941 /* Synthesize a new template parameter and track the current template
38942 parameter chain with implicit_template_parms. */
38946 tree synth_tmpl_parm;
38950 synth_tmpl_parm
38953 synth_tmpl_parm
38955 else
38956 {
38960 }
38962 // Attach the constraint to the parm before processing.
38965 tree new_parm
38967 input_location,
38968 node,
38972 // Chain the new parameter to the list of implicit parameters.
38974 parser->implicit_template_parms
38976 else
38981 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38984 /* If creating a fully implicit function template, start the new implicit
38985 template parameter list with this synthesized type, otherwise grow the
38986 current template parameter list. */
38989 {
38996 }
38997 else
38998 {
39003 }
39005 // If the new parameter was constrained, we need to add that to the
39006 // constraints in the template parameter list.
39008 {
39012 }
39017 }
39019 /* Finish the declaration of a fully implicit function template. Such a
39020 template has no explicit template parameter list so has not been through the
39021 normal template head and tail processing. synthesize_implicit_template_parm
39022 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39023 provided if the declaration is a class member such that its template
39024 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39025 form is returned. Otherwise NULL_TREE is returned. */
39027 static tree
39029 {
39034 {
39038 }
39048 }
39050 /* Helper function for diagnostics that have complained about things
39051 being used with 'extern "C"' linkage.
39053 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39055 void
39057 {
39061 }