| blob | b469d1c176062202855d91d2225fe9540dde180c |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 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
3368 }
3371 {
3372 /* A<T>::A<T>() */
3378 }
3381 {
3384 "need %<typename%> before %<%T::%D::%E%> because "
3388 id,
3391 else
3395 }
3397 {
3409 else
3415 }
3416 else
3418 }
3419 }
3421 /* Check for a common situation where a type-name should be present,
3422 but is not, and issue a sensible error message. Returns true if an
3423 invalid type-name was detected.
3425 The situation handled by this function are variable declarations of the
3426 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3427 Usually, `ID' should name a type, but if we got here it means that it
3428 does not. We try to emit the best possible error message depending on
3429 how exactly the id-expression looks like. */
3431 static bool
3433 {
3434 tree id;
3437 /* Avoid duplicate error about ambiguous lookup. */
3439 {
3443 }
3452 /* If the next token is a (, this is a function with no explicit return
3453 type, i.e. constructor, destructor or conversion op. */
3456 {
3459 }
3463 /* Emit a diagnostic for the invalid type. */
3465 out:
3466 /* If we aren't in the middle of a declarator (i.e. in a
3467 parameter-declaration-clause), skip to the end of the declaration;
3468 there's no point in trying to process it. */
3472 }
3474 /* Consume tokens up to, and including, the next non-nested closing `)'.
3475 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3476 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3477 found an unnested token of that type. */
3479 static int
3482 cpp_ttype or_ttype,
3484 {
3494 {
3497 /* Have we found what we're looking for before the closing paren? */
3503 {
3506 /* If we've run out of tokens, then there is no closing `)'. */
3509 /* This is good for lambda expression capture-lists. */
3519 /* This matches the processing in skip_to_end_of_statement. */
3539 {
3543 }
3548 }
3550 /* Consume the token. */
3552 }
3553 }
3555 /* Consume tokens up to, and including, the next non-nested closing `)'.
3556 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3557 are doing error recovery. Returns -1 if OR_COMMA is true and we
3558 found an unnested token of that type. */
3560 static int
3565 {
3569 }
3571 /* Consume tokens until we reach the end of the current statement.
3572 Normally, that will be just before consuming a `;'. However, if a
3573 non-nested `}' comes first, then we stop before consuming that. */
3575 static void
3577 {
3580 /* Unwind generic function template scope if necessary. */
3585 {
3589 {
3592 /* If we've run out of tokens, stop. */
3596 /* If the next token is a `;', we have reached the end of the
3597 statement. */
3603 /* If this is a non-nested '}', stop before consuming it.
3604 That way, when confronted with something like:
3606 { 3 + }
3608 we stop before consuming the closing '}', even though we
3609 have not yet reached a `;'. */
3613 /* If it is the closing '}' for a block that we have
3614 scanned, stop -- but only after consuming the token.
3615 That way given:
3617 void f g () { ... }
3618 typedef int I;
3620 we will stop after the body of the erroneously declared
3621 function, but before consuming the following `typedef'
3622 declaration. */
3624 {
3627 }
3636 }
3638 /* Consume the token. */
3640 }
3641 }
3643 /* This function is called at the end of a statement or declaration.
3644 If the next token is a semicolon, it is consumed; otherwise, error
3645 recovery is attempted. */
3647 static void
3649 {
3650 /* Look for the trailing `;'. */
3652 {
3653 /* If there is additional (erroneous) input, skip to the end of
3654 the statement. */
3656 /* If the next token is now a `;', consume it. */
3659 }
3660 }
3662 /* Skip tokens until we have consumed an entire block, or until we
3663 have consumed a non-nested `;'. */
3665 static void
3667 {
3670 /* Unwind generic function template scope if necessary. */
3675 {
3679 {
3682 /* If we've run out of tokens, stop. */
3686 /* Stop if this is an unnested ';'. */
3692 /* Stop if this is an unnested '}', or closes the outermost
3693 nesting level. */
3694 nesting_depth--;
3702 /* Nest. */
3703 nesting_depth++;
3708 }
3710 /* Consume the token. */
3712 }
3713 }
3715 /* Skip tokens until a non-nested closing curly brace is the next
3716 token, or there are no more tokens. Return true in the first case,
3717 false otherwise. */
3719 static bool
3721 {
3725 {
3729 {
3732 /* If we've run out of tokens, stop. */
3736 /* If the next token is a non-nested `}', then we have reached
3737 the end of the current block. */
3743 /* If it the next token is a `{', then we are entering a new
3744 block. Consume the entire block. */
3750 }
3752 /* Consume the token. */
3754 }
3755 }
3757 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3758 parameter is the PRAGMA token, allowing us to purge the entire pragma
3759 sequence. */
3761 static void
3763 {
3768 do
3772 /* Ensure that the pragma is not parsed again. */
3774 }
3776 /* Require pragma end of line, resyncing with it as necessary. The
3777 arguments are as for cp_parser_skip_to_pragma_eol. */
3779 static void
3781 {
3785 }
3787 /* This is a simple wrapper around make_typename_type. When the id is
3788 an unresolved identifier node, we can provide a superior diagnostic
3789 using cp_parser_diagnose_invalid_type_name. */
3791 static tree
3793 location_t id_location)
3794 {
3795 tree result;
3797 {
3803 }
3805 }
3807 /* This is a wrapper around the
3808 make_{pointer,ptrmem,reference}_declarator functions that decides
3809 which one to call based on the CODE and CLASS_TYPE arguments. The
3810 CODE argument should be one of the values returned by
3811 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3812 appertain to the pointer or reference. */
3816 cp_cv_quals cv_qualifiers,
3818 tree attributes)
3819 {
3826 else
3836 }
3838 /* Create a new C++ parser. */
3842 {
3847 /* cp_lexer_new_main is called before doing GC allocation because
3848 cp_lexer_new_main might load a PCH file. */
3851 /* Initialize the binops_by_token so that we can get the tree
3852 directly from the token. */
3860 /* For now, we always accept GNU extensions. */
3863 /* The `>' token is a greater-than operator, not the end of a
3864 template-id. */
3869 /* We are not parsing a constant-expression. */
3874 /* Local variable names are not forbidden. */
3877 /* We are not processing an `extern "C"' declaration. */
3880 /* We are not processing a declarator. */
3883 /* We are not processing a template-argument-list. */
3886 /* We are not in an iteration statement. */
3889 /* We are not in a switch statement. */
3892 /* We are not parsing a type-id inside an expression. */
3895 /* Declarations aren't implicitly extern "C". */
3898 /* String literals should be translated to the execution character set. */
3901 /* We are not parsing a function body. */
3904 /* We can correct until told otherwise. */
3907 /* The unparsed function queue is empty. */
3910 /* There are no classes being defined. */
3913 /* No template parameters apply. */
3916 /* Special parsing data structures. */
3920 /* Not declaring an implicit function template. */
3926 /* Allow constrained-type-specifiers. */
3929 /* We haven't yet seen an 'extern "C"'. */
3933 }
3935 /* Create a cp_lexer structure which will emit the tokens in CACHE
3936 and push it onto the parser's lexer stack. This is used for delayed
3937 parsing of in-class method bodies and default arguments, and should
3938 not be confused with tentative parsing. */
3939 static void
3941 {
3946 /* Move the current source position to that of the first token in the
3947 new lexer. */
3949 }
3951 /* Pop the top lexer off the parser stack. This is never used for the
3952 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3953 static void
3955 {
3960 /* Put the current source position back where it was before this
3961 lexer was pushed. */
3963 }
3965 /* Lexical conventions [gram.lex] */
3967 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3968 identifier. */
3970 static cp_expr
3972 {
3975 /* Look for the identifier. */
3977 /* Return the value. */
3980 else
3982 }
3984 /* Parse a sequence of adjacent string constants. Returns a
3985 TREE_STRING representing the combined, nul-terminated string
3986 constant. If TRANSLATE is true, translate the string to the
3987 execution character set. If WIDE_OK is true, a wide string is
3988 invalid here.
3990 C++98 [lex.string] says that if a narrow string literal token is
3991 adjacent to a wide string literal token, the behavior is undefined.
3992 However, C99 6.4.5p4 says that this results in a wide string literal.
3993 We follow C99 here, for consistency with the C front end.
3995 This code is largely lifted from lex_string() in c-lex.c.
3997 FUTURE: ObjC++ will need to handle @-strings here. */
3998 static cp_expr
4001 {
4002 tree value;
4009 tree string_tree;
4015 {
4018 }
4023 {
4027 }
4028 else
4029 {
4032 }
4035 /* Try to avoid the overhead of creating and destroying an obstack
4036 for the common case of just one string. */
4039 {
4047 {
4051 }
4052 else
4056 }
4057 else
4058 {
4063 do
4064 {
4066 count++;
4071 {
4074 {
4077 }
4080 {
4085 }
4087 }
4088 else
4092 {
4096 {
4100 "unsupported non-standard concatenation "
4102 }
4103 }
4111 {
4115 }
4116 else
4117 {
4121 }
4122 }
4125 /* A string literal built by concatenation has its caret=start at
4126 the start of the initial string, and its finish at the finish of
4127 the final string literal. */
4131 }
4134 {
4137 }
4141 {
4146 {
4161 }
4166 {
4171 else
4173 }
4174 }
4175 else
4176 /* cpp_interpret_string has issued an error. */
4183 }
4185 /* Look up a literal operator with the name and the exact arguments. */
4187 static tree
4189 {
4190 tree decl;
4196 {
4202 {
4205 {
4215 }
4218 /* May be this should be sufficient_parms_p instead,
4219 depending on how exactly should user-defined literals
4220 work in presence of default arguments on the literal
4221 operator parameters. */
4224 }
4225 }
4228 }
4230 /* Parse a user-defined char constant. Returns a call to a user-defined
4231 literal operator taking the character as an argument. */
4233 static cp_expr
4235 {
4243 /* Build up a call to the user-defined operator */
4244 /* Lookup the name we got back from the id-expression. */
4249 {
4254 }
4258 }
4260 /* A subroutine of cp_parser_userdef_numeric_literal to
4261 create a char... template parameter pack from a string node. */
4263 static tree
4265 {
4266 tree charvec;
4272 /* Fill in CHARVEC with all of the parameters. */
4277 /* Build the argument packs. */
4283 }
4285 /* A subroutine of cp_parser_userdef_numeric_literal to
4286 create a char... template parameter pack from a string node. */
4288 static tree
4290 {
4291 tree charvec;
4302 /* First template parm is character type. */
4305 /* Fill in CHARVEC with all of the parameters. */
4312 /* Build the argument packs. */
4318 }
4320 /* Parse a user-defined numeric constant. returns a call to a user-defined
4321 literal operator. */
4323 static cp_expr
4325 {
4336 /* Look for a literal operator taking the exact type of numeric argument
4337 as the literal value. */
4342 {
4344 tf_warning_or_error);
4347 {
4350 long_long_unsigned_type_node);
4351 }
4352 else
4353 {
4357 long_double_type_node);
4361 }
4365 }
4368 /* If the numeric argument didn't work, look for a raw literal
4369 operator taking a const char* argument consisting of the number
4370 in string format. */
4375 {
4377 tf_warning_or_error);
4380 }
4383 /* If the raw literal didn't work, look for a non-type template
4384 function with parameter pack char.... Call the function with
4385 template parameter characters representing the number. */
4389 {
4393 tf_warning_or_error);
4396 }
4405 }
4407 /* Parse a user-defined string constant. Returns a call to a user-defined
4408 literal operator taking a character pointer and the length of the string
4409 as arguments. */
4411 static tree
4413 {
4422 /* Build up a call to the user-defined operator. */
4423 /* Lookup the name we got back from the id-expression. */
4430 {
4432 tf_warning_or_error);
4435 }
4438 /* Look for a template function with typename parameter CharT
4439 and parameter pack CharT... Call the function with
4440 template parameter characters representing the string. */
4444 {
4448 tf_warning_or_error);
4451 }
4457 }
4460 /* Basic concepts [gram.basic] */
4462 /* Parse a translation-unit.
4464 translation-unit:
4465 declaration-seq [opt]
4467 Returns TRUE if all went well. */
4469 static bool
4471 {
4472 /* The address of the first non-permanent object on the declarator
4473 obstack. */
4478 /* Create the declarator obstack, if necessary. */
4480 {
4482 /* Create the error declarator. */
4484 /* Create the empty parameter list. */
4486 UNKNOWN_LOCATION);
4487 /* Remember where the base of the declarator obstack lies. */
4489 }
4493 /* If there are no tokens left then all went well. */
4495 {
4496 /* Get rid of the token array; we don't need it any more. */
4500 /* This file might have been a context that's implicitly extern
4501 "C". If so, pop the lang context. (Only relevant for PCH.) */
4503 {
4506 }
4508 /* Finish up. */
4512 }
4513 else
4514 {
4517 }
4519 /* Make sure the declarator obstack was fully cleaned up. */
4523 /* All went well. */
4525 }
4527 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4528 decltype context. */
4532 {
4537 }
4539 /* We're about to parse a collection of statements. If we're currently
4540 parsing tentatively, set up a firewall so that any nested
4541 cp_parser_commit_to_tentative_parse won't affect the current context. */
4543 static cp_token_position
4545 {
4552 }
4554 /* We've finished parsing the collection of statements. Wrap up the
4555 firewall and replace the relevant tokens with the parsed form. */
4557 static void
4559 tree expr)
4560 {
4564 /* Finish the firewall level. */
4566 /* And remember the result of the parse for when we try again. */
4572 }
4574 /* Like the above functions, but let the user modify the tokens. Used by
4575 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4576 later parses, so it makes sense to localize the effects of
4577 cp_parser_commit_to_tentative_parse. */
4579 struct tentative_firewall
4580 {
4585 {
4586 /* If we're currently parsing tentatively, start a committed level as a
4587 firewall and then an inner tentative parse. */
4589 {
4593 }
4594 }
4597 {
4599 {
4600 /* Finish the inner tentative parse and the firewall, propagating any
4601 uncommitted error state to the outer tentative parse. */
4607 }
4608 }
4609 };
4611 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4612 This class is for tracking such a matching pair of symbols.
4613 In particular, it tracks the location of the first token,
4614 so that if the second token is missing, we can highlight the
4615 location of the first token when notifying the user about the
4616 problem. */
4619 class token_pair
4620 {
4622 /* token_pair's ctor. */
4625 /* If the next token is the opening symbol for this pair, consume it and
4626 return true.
4627 Otherwise, issue an error and return false.
4628 In either case, record the location of the opening token. */
4631 {
4635 }
4637 /* Consume the next token from PARSER, recording its location as
4638 that of the opening token within the pair. */
4641 {
4646 }
4648 /* If the next token is the closing symbol for this pair, consume it
4649 and return it.
4650 Otherwise, issue an error, highlighting the location of the
4651 corresponding opening token, and return NULL. */
4654 {
4657 m_open_loc);
4658 }
4661 location_t m_open_loc;
4662 };
4664 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4666 struct matching_paren_traits
4667 {
4672 };
4674 /* "matching_parens" is a token_pair<T> class for tracking matching
4675 pairs of parentheses. */
4679 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4681 struct matching_brace_traits
4682 {
4687 };
4689 /* "matching_braces" is a token_pair<T> class for tracking matching
4690 pairs of braces. */
4695 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4696 enclosing parentheses. */
4698 static cp_expr
4700 {
4703 /* Consume the '('. */
4705 matching_parens parens;
4707 /* Start the statement-expression. */
4709 /* Parse the compound-statement. */
4711 /* Finish up. */
4713 /* Consume the ')'. */
4721 }
4723 /* Expressions [gram.expr] */
4725 /* Parse a fold-operator.
4727 fold-operator:
4728 - * / % ^ & | = < > << >>
4729 = -= *= /= %= ^= &= |= <<= >>=
4730 == != <= >= && || , .* ->*
4732 This returns the tree code corresponding to the matched operator
4733 as an int. When the current token matches a compound assignment
4734 opertor, the resulting tree code is the negative value of the
4735 non-assignment operator. */
4737 static int
4739 {
4741 {
4781 }
4782 }
4784 /* Returns true if CODE indicates a binary expression, which is not allowed in
4785 the LHS of a fold-expression. More codes will need to be added to use this
4786 function in other contexts. */
4788 static bool
4790 {
4792 {
4825 }
4826 }
4828 /* If the next token is a suitable fold operator, consume it and return as
4829 the function above. */
4831 static int
4833 {
4839 }
4841 /* Parse a fold-expression.
4843 fold-expression:
4844 ( ... folding-operator cast-expression)
4845 ( cast-expression folding-operator ... )
4846 ( cast-expression folding operator ... folding-operator cast-expression)
4848 Note that the '(' and ')' are matched in primary expression. */
4850 static cp_expr
4852 {
4853 cp_id_kind pidk;
4855 // Left fold.
4857 {
4861 {
4864 }
4871 }
4876 {
4879 }
4882 {
4885 }
4888 /* The operands of a fold-expression are cast-expressions, so binary or
4889 conditional expressions are not allowed. We check this here to avoid
4890 tentative parsing. */
4900 // Right fold.
4905 {
4908 }
4911 // Binary left or right fold.
4916 }
4918 /* Parse a primary-expression.
4920 primary-expression:
4921 literal
4922 this
4923 ( expression )
4924 id-expression
4925 lambda-expression (C++11)
4927 GNU Extensions:
4929 primary-expression:
4930 ( compound-statement )
4931 __builtin_va_arg ( assignment-expression , type-id )
4932 __builtin_offsetof ( type-id , offsetof-expression )
4934 C++ Extensions:
4935 __has_nothrow_assign ( type-id )
4936 __has_nothrow_constructor ( type-id )
4937 __has_nothrow_copy ( type-id )
4938 __has_trivial_assign ( type-id )
4939 __has_trivial_constructor ( type-id )
4940 __has_trivial_copy ( type-id )
4941 __has_trivial_destructor ( type-id )
4942 __has_virtual_destructor ( type-id )
4943 __is_abstract ( type-id )
4944 __is_base_of ( type-id , type-id )
4945 __is_class ( type-id )
4946 __is_empty ( type-id )
4947 __is_enum ( type-id )
4948 __is_final ( type-id )
4949 __is_literal_type ( type-id )
4950 __is_pod ( type-id )
4951 __is_polymorphic ( type-id )
4952 __is_std_layout ( type-id )
4953 __is_trivial ( type-id )
4954 __is_union ( type-id )
4956 Objective-C++ Extension:
4958 primary-expression:
4959 objc-expression
4961 literal:
4962 __null
4964 ADDRESS_P is true iff this expression was immediately preceded by
4965 "&" and therefore might denote a pointer-to-member. CAST_P is true
4966 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4967 true iff this expression is a template argument.
4969 Returns a representation of the expression. Upon return, *IDK
4970 indicates what kind of id-expression (if any) was present. */
4972 static cp_expr
4979 {
4982 /* Assume the primary expression is not an id-expression. */
4985 /* Peek at the next token. */
4988 {
4989 /* literal:
4990 integer-literal
4991 character-literal
4992 floating-literal
4993 string-literal
4994 boolean-literal
4995 pointer-literal
4996 user-defined-literal */
5008 {
5012 }
5013 /* Floating-point literals are only allowed in an integral
5014 constant expression if they are cast to an integral or
5015 enumeration type. */
5019 {
5020 /* CAST_P will be set even in invalid code like "int(2.7 +
5021 ...)". Therefore, we have to check that the next token
5022 is sure to end the cast. */
5024 {
5029 enumerator-definition. */
5031 /* The curly brace at the end of an enum-specifier. */
5033 /* The end of a statement. */
5035 /* The end of the cast-expression. */
5037 /* The end of an array bound. */
5039 /* The closing ">" in a template-argument-list. */
5042 /* C++0x only: A ">>" treated like two ">" tokens,
5043 in a template-argument-list. */
5048 }
5050 /* If we are within a cast, then the constraint that the
5051 cast is to an integral or enumeration type will be
5052 checked at that point. If we are not within a cast, then
5053 this code is invalid. */
5056 }
5076 /* ??? Should wide strings be allowed when parser->translate_strings_p
5077 is false (i.e. in attributes)? If not, we can kill the third
5078 argument to cp_parser_string_literal. */
5084 /* If we see `( { ' then we are looking at the beginning of
5085 a GNU statement-expression. */
5088 {
5089 /* Statement-expressions are not allowed by the standard. */
5093 /* And they're not allowed outside of a function-body; you
5094 cannot, for example, write:
5096 int i = ({ int j = 3; j + 1; });
5098 at class or namespace scope. */
5101 {
5103 "statement-expressions are not allowed outside "
5109 }
5110 else
5112 }
5113 /* Otherwise it's a normal parenthesized expression. */
5114 {
5115 cp_expr expr;
5120 /* Consume the `('. */
5121 matching_parens parens;
5123 /* Within a parenthesized expression, a `>' token is always
5124 the greater-than operator. */
5125 saved_greater_than_is_operator_p
5130 /* Left fold expression. */
5132 else
5133 /* Parse the parenthesized expression. */
5138 {
5145 }
5146 else
5147 /* Let the front end know that this expression was
5148 enclosed in parentheses. This matters in case, for
5149 example, the expression is of the form `A::B', since
5150 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5151 not. */
5154 /* DR 705: Wrapping an unqualified name in parentheses
5155 suppresses arg-dependent lookup. We want to pass back
5156 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5157 (c++/37862), but none of the others. */
5161 /* The `>' token might be the end of a template-id or
5162 template-parameter-list now. */
5163 parser->greater_than_is_operator_p
5166 /* Consume the `)'. */
5175 }
5178 {
5180 {
5181 /* We might have an Objective-C++ message. */
5184 /* If that works out, we're done ... */
5187 /* ... else, fall though to see if it's a lambda. */
5188 }
5190 /* Don't warn about a failed tentative parse. */
5195 }
5199 /* We have an Objective-C++ string literal. */
5206 {
5207 /* These two are the boolean literals. */
5215 /* The `__null' literal. */
5220 /* The `nullptr' literal. */
5225 /* Recognize the `this' keyword. */
5229 {
5233 }
5234 /* Pointers cannot appear in constant-expressions. */
5239 /* The `operator' keyword can be the beginning of an
5240 id-expression. */
5247 {
5248 non_integral_constant name;
5250 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5251 __func__ are the names of variables -- but they are
5252 treated specially. Therefore, they are handled here,
5253 rather than relying on the generic id-expression logic
5254 below. Grammatically, these names are id-expressions.
5256 Consume the token. */
5260 {
5272 }
5277 /* Look up the name. */
5279 }
5282 {
5283 tree expression;
5284 tree type;
5285 source_location type_location;
5286 location_t start_loc
5288 /* The `__builtin_va_arg' construct is used to handle
5289 `va_arg'. Consume the `__builtin_va_arg' token. */
5291 /* Look for the opening `('. */
5292 matching_parens parens;
5294 /* Now, parse the assignment-expression. */
5296 /* Look for the `,'. */
5299 /* Parse the type-id. */
5300 {
5303 }
5304 /* Look for the closing `)'. */
5305 location_t finish_loc
5308 /* Using `va_arg' in a constant-expression is not
5309 allowed. */
5311 NIC_VA_ARG))
5313 /* Construct a location of the form:
5314 __builtin_va_arg (v, int)
5315 ~~~~~~~~~~~~~~~~~~~~~^~~~
5316 with the caret at the type, ranging from the start of the
5317 "__builtin_va_arg" token to the close paren. */
5318 location_t combined_loc
5321 }
5356 // C++ concepts
5360 /* Objective-C++ expressions. */
5370 {
5375 }
5376 /* FALLTHRU */
5380 }
5382 /* An id-expression can start with either an identifier, a
5383 `::' as the beginning of a qualified-id, or the "operator"
5384 keyword. */
5389 {
5390 id_expression:
5391 cp_expr id_expression;
5392 cp_expr decl;
5398 /* Parse the id-expression. */
5399 id_expression
5416 /* If we have a template-id, then no further lookup is
5417 required. If the template-id was for a template-class, we
5418 will sometimes have a TYPE_DECL at this point. */
5422 /* Look up the name. */
5423 else
5424 {
5425 tree ambiguous_decls;
5427 /* If we already know that this lookup is ambiguous, then
5428 we've already issued an error message; there's no reason
5429 to check again. */
5432 {
5435 }
5438 none_type,
5439 template_p,
5444 /* If the lookup was ambiguous, an error will already have
5445 been issued. */
5449 /* In Objective-C++, we may have an Objective-C 2.0
5450 dot-syntax for classes here. */
5455 {
5456 tree component;
5463 component);
5464 /* Build a location of the form:
5465 expr.component
5466 ~~~~~^~~~~~~~~
5467 with caret at the start of the component name (at
5468 input_location), ranging from the start of the id_expression
5469 to the end of the component name. */
5470 location_t combined_loc
5475 }
5477 /* In Objective-C++, an instance variable (ivar) may be preferred
5478 to whatever cp_parser_lookup_name() found.
5479 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5480 rest of c-family, we have to do a little extra work to preserve
5481 any location information in cp_expr "decl". Given that
5482 objc_lookup_ivar is implemented in "c-family" and "objc", we
5483 have a trip through the pure "tree" type, rather than cp_expr.
5484 Naively copying it back to "decl" would implicitly give the
5485 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5486 store an EXPR_LOCATION. Hence we only update "decl" (and
5487 hence its location_t) if we get back a different tree node. */
5489 id_expression);
5493 /* If name lookup gives us a SCOPE_REF, then the
5494 qualifying scope was dependent. */
5496 {
5497 /* At this point, we do not know if DECL is a valid
5498 integral constant expression. We assume that it is
5499 in fact such an expression, so that code like:
5501 template <int N> struct A {
5502 int a[B<N>::i];
5503 };
5505 is accepted. At template-instantiation time, we
5506 will check that B<N>::i is actually a constant. */
5508 }
5509 /* Check to see if DECL is a local variable in a context
5510 where that is forbidden. */
5513 {
5514 /* It might be that we only found DECL because we are
5515 trying to be generous with pre-ISO scoping rules.
5516 For example, consider:
5518 int i;
5519 void g() {
5520 for (int i = 0; i < 10; ++i) {}
5521 extern void f(int j = i);
5522 }
5524 Here, name look up will originally find the out
5525 of scope `i'. We need to issue a warning message,
5526 but then use the global `i'. */
5529 {
5534 }
5535 }
5536 }
5538 decl = (finish_id_expression
5540 idk,
5545 template_arg_p,
5552 }
5554 /* Anything else is an error. */
5558 }
5559 }
5567 {
5570 }
5572 /* Parse an id-expression.
5574 id-expression:
5575 unqualified-id
5576 qualified-id
5578 qualified-id:
5579 :: [opt] nested-name-specifier template [opt] unqualified-id
5580 :: identifier
5581 :: operator-function-id
5582 :: template-id
5584 Return a representation of the unqualified portion of the
5585 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5586 a `::' or nested-name-specifier.
5588 Often, if the id-expression was a qualified-id, the caller will
5589 want to make a SCOPE_REF to represent the qualified-id. This
5590 function does not do this in order to avoid wastefully creating
5591 SCOPE_REFs when they are not required.
5593 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5594 `template' keyword.
5596 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5597 uninstantiated templates.
5599 If *TEMPLATE_P is non-NULL, it is set to true iff the
5600 `template' keyword is used to explicitly indicate that the entity
5601 named is a template.
5603 If DECLARATOR_P is true, the id-expression is appearing as part of
5604 a declarator, rather than as part of an expression. */
5606 static cp_expr
5613 {
5617 /* Assume the `template' keyword was not used. */
5621 /* Look for the optional `::' operator. */
5622 global_scope_p
5623 = (!template_keyword_p
5628 /* Look for the optional nested-name-specifier. */
5629 nested_name_specifier_p
5632 check_dependency_p,
5634 declarator_p,
5635 template_keyword_p)
5638 /* If there is a nested-name-specifier, then we are looking at
5639 the first qualified-id production. */
5641 {
5642 tree saved_scope;
5643 tree saved_object_scope;
5644 tree saved_qualifying_scope;
5645 cp_expr unqualified_id;
5648 /* See if the next token is the `template' keyword. */
5652 /* Name lookup we do during the processing of the
5653 unqualified-id might obliterate SCOPE. */
5657 /* Process the final unqualified-id. */
5659 check_dependency_p,
5660 declarator_p,
5662 /* Restore the SAVED_SCOPE for our caller. */
5668 }
5669 /* Otherwise, if we are in global scope, then we are looking at one
5670 of the other qualified-id productions. */
5672 {
5674 tree id;
5676 /* Peek at the next token. */
5679 /* If it's an identifier, and the next token is not a "<", then
5680 we can avoid the template-id case. This is an optimization
5681 for this common case. */
5683 && !cp_parser_nth_token_starts_template_argument_list_p
5688 /* Try a template-id. */
5692 none_type,
5693 declarator_p);
5694 /* If that worked, we're done. */
5698 /* Peek at the next token. (Changes in the token buffer may
5699 have invalidated the pointer obtained above.) */
5703 {
5710 /* Fall through. */
5715 }
5716 }
5717 else
5720 declarator_p,
5721 optional_p);
5722 }
5724 /* Parse an unqualified-id.
5726 unqualified-id:
5727 identifier
5728 operator-function-id
5729 conversion-function-id
5730 ~ class-name
5731 template-id
5733 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5734 keyword, in a construct like `A::template ...'.
5736 Returns a representation of unqualified-id. For the `identifier'
5737 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5738 production a BIT_NOT_EXPR is returned; the operand of the
5739 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5740 other productions, see the documentation accompanying the
5741 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5742 names are looked up in uninstantiated templates. If DECLARATOR_P
5743 is true, the unqualified-id is appearing as part of a declarator,
5744 rather than as part of an expression. */
5746 static cp_expr
5752 {
5755 /* Peek at the next token. */
5759 {
5761 {
5762 tree id;
5764 /* We don't know yet whether or not this will be a
5765 template-id. */
5767 /* Try a template-id. */
5769 check_dependency_p,
5770 none_type,
5771 declarator_p);
5772 /* If it worked, we're done. */
5775 /* Otherwise, it's an ordinary identifier. */
5777 }
5781 check_dependency_p,
5782 none_type,
5783 declarator_p);
5786 {
5787 tree type_decl;
5788 tree qualifying_scope;
5789 tree object_scope;
5790 tree scope;
5793 /* Consume the `~' token. */
5795 /* Parse the class-name. The standard, as written, seems to
5796 say that:
5798 template <typename T> struct S { ~S (); };
5799 template <typename T> S<T>::~S() {}
5801 is invalid, since `~' must be followed by a class-name, but
5802 `S<T>' is dependent, and so not known to be a class.
5803 That's not right; we need to look in uninstantiated
5804 templates. A further complication arises from:
5806 template <typename T> void f(T t) {
5807 t.T::~T();
5808 }
5810 Here, it is not possible to look up `T' in the scope of `T'
5811 itself. We must look in both the current scope, and the
5812 scope of the containing complete expression.
5814 Yet another issue is:
5816 struct S {
5817 int S;
5818 ~S();
5819 };
5821 S::~S() {}
5823 The standard does not seem to say that the `S' in `~S'
5824 should refer to the type `S' and not the data member
5825 `S::S'. */
5827 /* DR 244 says that we look up the name after the "~" in the
5828 same scope as we looked up the qualifying name. That idea
5829 isn't fully worked out; it's more complicated than that. */
5834 /* Check for invalid scopes. */
5836 {
5840 }
5842 {
5846 scope);
5851 }
5854 /* If the name is of the form "X::~X" it's OK even if X is a
5855 typedef. */
5864 {
5867 }
5869 /* ~auto means the destructor of whatever the object is. */
5871 {
5874 "%<~auto%> only available with "
5878 }
5880 /* If there was an explicit qualification (S::~T), first look
5881 in the scope given by the qualification (i.e., S).
5883 Note: in the calls to cp_parser_class_name below we pass
5884 typename_type so that lookup finds the injected-class-name
5885 rather than the constructor. */
5889 {
5894 typename_type,
5897 declarator_p);
5900 }
5901 /* In "N::S::~S", look in "N" as well. */
5903 {
5908 type_decl
5912 typename_type,
5915 declarator_p);
5918 }
5919 /* In "p->S::~T", look in the scope given by "*p" as well. */
5921 {
5926 type_decl
5930 typename_type,
5933 declarator_p);
5936 }
5937 /* Look in the surrounding context. */
5939 {
5945 type_decl
5949 typename_type,
5952 declarator_p);
5955 {
5956 /* We couldn't find a type with this name. If we're parsing
5957 tentatively, fail and try something else. */
5959 {
5962 }
5963 /* Otherwise, accept it and check for a match at instantiation
5964 time. */
5969 }
5970 }
5971 /* If an error occurred, assume that the name of the
5972 destructor is the same as the name of the qualifying
5973 class. That allows us to keep parsing after running
5974 into ill-formed destructor names. */
5980 /* Check that destructor name and scope match. */
5982 {
5989 }
5991 /* [class.dtor]
5993 A typedef-name that names a class shall not be used as the
5994 identifier in the declarator for a destructor declaration. */
6001 type_decl);
6004 }
6008 {
6009 cp_expr id;
6011 /* This could be a template-id, so we try that first. */
6013 /* Try a template-id. */
6016 none_type,
6017 declarator_p);
6018 /* If that worked, we're done. */
6021 /* We still don't know whether we're looking at an
6022 operator-function-id or a conversion-function-id. */
6024 /* Try an operator-function-id. */
6026 /* If that didn't work, try a conversion-function-id. */
6030 {
6031 /* 17.6.3.3.5 */
6036 "literal operator suffixes not preceded by %<_%>"
6038 }
6041 }
6042 /* Fall through. */
6049 }
6050 }
6052 /* Parse an (optional) nested-name-specifier.
6054 nested-name-specifier: [C++98]
6055 class-or-namespace-name :: nested-name-specifier [opt]
6056 class-or-namespace-name :: template nested-name-specifier [opt]
6058 nested-name-specifier: [C++0x]
6059 type-name ::
6060 namespace-name ::
6061 nested-name-specifier identifier ::
6062 nested-name-specifier template [opt] simple-template-id ::
6064 PARSER->SCOPE should be set appropriately before this function is
6065 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6066 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6067 in name lookups.
6069 Sets PARSER->SCOPE to the class (TYPE) or namespace
6070 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6071 it unchanged if there is no nested-name-specifier. Returns the new
6072 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6074 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6075 part of a declaration and/or decl-specifier. */
6077 static tree
6084 {
6089 /* Remember where the nested-name-specifier starts. */
6091 {
6094 }
6097 {
6098 tree new_scope;
6099 tree old_scope;
6100 tree saved_qualifying_scope;
6102 /* Spot cases that cannot be the beginning of a
6103 nested-name-specifier. */
6106 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6107 the already parsed nested-name-specifier. */
6109 {
6110 /* Grab the nested-name-specifier and continue the loop. */
6112 /* If we originally encountered this nested-name-specifier
6113 with IS_DECLARATION set to false, we will not have
6114 resolved TYPENAME_TYPEs, so we must do so here. */
6117 {
6122 }
6125 }
6127 /* Spot cases that cannot be the beginning of a
6128 nested-name-specifier. On the second and subsequent times
6129 through the loop, we look for the `template' keyword. */
6131 ;
6132 /* A template-id can start a nested-name-specifier. */
6134 ;
6135 /* DR 743: decltype can be used in a nested-name-specifier. */
6137 ;
6138 else
6139 {
6140 /* If the next token is not an identifier, then it is
6141 definitely not a type-name or namespace-name. */
6144 /* If the following token is neither a `<' (to begin a
6145 template-id), nor a `::', then we are not looking at a
6146 nested-name-specifier. */
6152 {
6156 "found %<:%> in nested-name-specifier, "
6159 }
6162 && !cp_parser_nth_token_starts_template_argument_list_p
6165 }
6167 /* The nested-name-specifier is optional, so we parse
6168 tentatively. */
6171 /* Look for the optional `template' keyword, if this isn't the
6172 first time through the loop. */
6176 /* Save the old scope since the name lookup we are about to do
6177 might destroy it. */
6180 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6181 look up names in "X<T>::I" in order to determine that "Y" is
6182 a template. So, if we have a typename at this point, we make
6183 an effort to look through it. */
6185 && !typename_keyword_p
6190 /* Parse the qualifying entity. */
6191 new_scope
6193 typename_keyword_p,
6194 template_keyword_p,
6195 check_dependency_p,
6196 type_p,
6197 is_declaration);
6198 /* Look for the `::' token. */
6201 /* If we found what we wanted, we keep going; otherwise, we're
6202 done. */
6204 {
6207 /* Restore the OLD_SCOPE since it was valid before the
6208 failed attempt at finding the last
6209 class-or-namespace-name. */
6213 /* If the next token is a decltype, and the one after that is a
6214 `::', then the decltype has failed to resolve to a class or
6215 enumeration type. Give this error even when parsing
6216 tentatively since it can't possibly be valid--and we're going
6217 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6218 won't get another chance.*/
6222 {
6229 /* As below. */
6232 }
6236 {
6237 /* If we have a non-type template-id followed by ::, it can't
6238 possibly be valid. */
6243 {
6246 {
6252 }
6253 else
6254 {
6255 /* Variable template. */
6260 }
6267 /* As below. */
6271 }
6272 }
6276 /* If the next token is an identifier, and the one after
6277 that is a `::', then any valid interpretation would have
6278 found a class-or-namespace-name. */
6284 {
6287 {
6289 {
6290 tree decl;
6291 tree ambiguous_decls;
6294 none_type,
6303 decl);
6305 {
6306 // cp_parser_lookup_name has the same diagnostic,
6307 // thus make sure to emit it at most once.
6310 {
6315 }
6317 }
6318 else
6319 {
6321 cp_parser_name_lookup_error
6324 else
6325 cp_parser_name_lookup_error
6328 }
6329 }
6332 /* Treat this as a successful nested-name-specifier
6333 due to:
6335 [basic.lookup.qual]
6337 If the name found is not a class-name (clause
6338 _class_) or namespace-name (_namespace.def_), the
6339 program is ill-formed. */
6341 }
6343 }
6345 }
6346 /* We've found one valid nested-name-specifier. */
6348 /* Name lookup always gives us a DECL. */
6351 /* Uses of "template" must be followed by actual templates. */
6363 new_scope);
6364 /* If it is a class scope, try to complete it; we are about to
6365 be looking up names inside the class. */
6367 /* Since checking types for dependency can be expensive,
6368 avoid doing it if the type is already complete. */
6370 /* Do not try to complete dependent types. */
6372 {
6374 /* If it is a typedef to current class, use the current
6375 class instead, as the typedef won't have any names inside
6376 it yet. */
6380 }
6381 /* Make sure we look in the right scope the next time through
6382 the loop. */
6384 }
6386 /* If parsing tentatively, replace the sequence of tokens that makes
6387 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6388 token. That way, should we re-parse the token stream, we will
6389 not have to repeat the effort required to do the parse, nor will
6390 we issue duplicate error messages. */
6392 {
6396 /* Reset the contents of the START token. */
6398 /* Retrieve any deferred checks. Do not pop this access checks yet
6399 so the memory will not be reclaimed during token replacing below. */
6407 /* Purge all subsequent tokens. */
6409 }
6415 }
6417 /* Parse a nested-name-specifier. See
6418 cp_parser_nested_name_specifier_opt for details. This function
6419 behaves identically, except that it will an issue an error if no
6420 nested-name-specifier is present. */
6422 static tree
6428 {
6429 tree scope;
6431 /* Look for the nested-name-specifier. */
6433 typename_keyword_p,
6434 check_dependency_p,
6435 type_p,
6436 is_declaration);
6437 /* If it was not present, issue an error message. */
6439 {
6442 }
6445 }
6447 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6448 this is either a class-name or a namespace-name (which corresponds
6449 to the class-or-namespace-name production in the grammar). For
6450 C++0x, it can also be a type-name that refers to an enumeration
6451 type or a simple-template-id.
6453 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6454 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6455 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6456 TYPE_P is TRUE iff the next name should be taken as a class-name,
6457 even the same name is declared to be another entity in the same
6458 scope.
6460 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6461 specified by the class-or-namespace-name. If neither is found the
6462 ERROR_MARK_NODE is returned. */
6464 static tree
6471 {
6472 tree saved_scope;
6473 tree saved_qualifying_scope;
6474 tree saved_object_scope;
6475 tree scope;
6479 /* DR 743: decltype can appear in a nested-name-specifier. */
6481 {
6485 {
6488 }
6492 }
6494 /* Before we try to parse the class-name, we must save away the
6495 current PARSER->SCOPE since cp_parser_class_name will destroy
6496 it. */
6500 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6501 there is no need to look for a namespace-name. */
6502 only_class_p = template_keyword_p
6507 typename_keyword_p,
6508 template_keyword_p,
6510 check_dependency_p,
6512 is_declaration,
6515 /* If that didn't work, try for a namespace-name. */
6517 {
6518 /* Restore the saved scope. */
6522 /* If we are not looking at an identifier followed by the scope
6523 resolution operator, then this is not part of a
6524 nested-name-specifier. (Note that this function is only used
6525 to parse the components of a nested-name-specifier.) */
6530 }
6533 }
6535 /* Return true if we are looking at a compound-literal, false otherwise. */
6537 static bool
6539 {
6542 /* Skip tokens until the next token is a closing parenthesis.
6543 If we find the closing `)', and the next token is a `{', then
6544 we are looking at a compound-literal. */
6545 bool compound_literal_p
6550 /* Roll back the tokens we skipped. */
6554 }
6556 /* Parse a postfix-expression.
6558 postfix-expression:
6559 primary-expression
6560 postfix-expression [ expression ]
6561 postfix-expression ( expression-list [opt] )
6562 simple-type-specifier ( expression-list [opt] )
6563 typename :: [opt] nested-name-specifier identifier
6564 ( expression-list [opt] )
6565 typename :: [opt] nested-name-specifier template [opt] template-id
6566 ( expression-list [opt] )
6567 postfix-expression . template [opt] id-expression
6568 postfix-expression -> template [opt] id-expression
6569 postfix-expression . pseudo-destructor-name
6570 postfix-expression -> pseudo-destructor-name
6571 postfix-expression ++
6572 postfix-expression --
6573 dynamic_cast < type-id > ( expression )
6574 static_cast < type-id > ( expression )
6575 reinterpret_cast < type-id > ( expression )
6576 const_cast < type-id > ( expression )
6577 typeid ( expression )
6578 typeid ( type-id )
6580 GNU Extension:
6582 postfix-expression:
6583 ( type-id ) { initializer-list , [opt] }
6585 This extension is a GNU version of the C99 compound-literal
6586 construct. (The C99 grammar uses `type-name' instead of `type-id',
6587 but they are essentially the same concept.)
6589 If ADDRESS_P is true, the postfix expression is the operand of the
6590 `&' operator. CAST_P is true if this expression is the target of a
6591 cast.
6593 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6594 class member access expressions [expr.ref].
6596 Returns a representation of the expression. */
6598 static cp_expr
6602 {
6604 location_t loc;
6610 /* Peek at the next token. */
6615 /* Some of the productions are determined by keywords. */
6618 {
6623 {
6624 tree type;
6625 cp_expr expression;
6629 /* All of these can be handled in the same way from the point
6630 of view of parsing. Begin by consuming the token
6631 identifying the cast. */
6634 /* New types cannot be defined in the cast. */
6636 parser->type_definition_forbidden_message
6639 /* Look for the opening `<'. */
6641 /* Parse the type to which we are casting. */
6646 /* Look for the closing `>'. */
6648 /* Restore the old message. */
6651 bool saved_greater_than_is_operator_p
6655 /* And the expression which is being cast. */
6656 matching_parens parens;
6660 RT_CLOSE_PAREN);
6664 parser->greater_than_is_operator_p
6667 /* Only type conversions to integral or enumeration types
6668 can be used in constant-expressions. */
6671 {
6674 }
6677 {
6679 postfix_expression
6683 postfix_expression
6687 postfix_expression
6689 tf_warning_or_error);
6692 postfix_expression
6697 }
6699 /* Construct a location e.g. :
6700 reinterpret_cast <int *> (expr)
6701 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6702 ranging from the start of the "*_cast" token to the final closing
6703 paren, with the caret at the start. */
6706 }
6710 {
6711 tree type;
6715 /* Consume the `typeid' token. */
6717 /* Look for the `(' token. */
6718 matching_parens parens;
6720 /* Types cannot be defined in a `typeid' expression. */
6722 parser->type_definition_forbidden_message
6724 /* We can't be sure yet whether we're looking at a type-id or an
6725 expression. */
6727 /* Try a type-id first. */
6732 /* Look for the `)' token. Otherwise, we can't be sure that
6733 we're not looking at an expression: consider `typeid (int
6734 (3))', for example. */
6736 /* If all went well, simply lookup the type-id. */
6739 /* Otherwise, fall back to the expression variant. */
6740 else
6741 {
6742 tree expression;
6744 /* Look for an expression. */
6746 /* Compute its typeid. */
6748 /* Look for the `)' token. */
6750 }
6751 /* Restore the saved message. */
6753 /* `typeid' may not appear in an integral constant expression. */
6757 /* Construct a location e.g. :
6758 typeid (expr)
6759 ^~~~~~~~~~~~~
6760 ranging from the start of the "typeid" token to the final closing
6761 paren, with the caret at the start. */
6763 {
6764 location_t typeid_loc
6767 }
6768 }
6772 {
6773 tree type;
6774 /* The syntax permitted here is the same permitted for an
6775 elaborated-type-specifier. */
6782 }
6788 {
6791 tree p;
6798 {
6801 }
6807 {
6810 postfix_expression
6812 else
6813 {
6817 }
6823 tf_warning_or_error);
6824 else
6825 {
6829 }
6834 postfix_expression
6838 postfix_expression
6841 else
6842 {
6846 }
6851 }
6853 }
6856 {
6857 tree type;
6859 /* If the next thing is a simple-type-specifier, we may be
6860 looking at a functional cast. We could also be looking at
6861 an id-expression. So, we try the functional cast, and if
6862 that doesn't work we fall back to the primary-expression. */
6864 /* Look for the simple-type-specifier. */
6868 CP_PARSER_FLAGS_NONE);
6870 /* Parse the cast itself. */
6872 postfix_expression
6874 /* If that worked, we're done. */
6878 /* If the functional-cast didn't work out, try a
6879 compound-literal. */
6882 {
6887 matching_parens parens;
6890 /* Avoid calling cp_parser_type_id pointlessly, see comment
6891 in cp_parser_cast_expression about c++/29234. */
6894 else
6895 {
6896 /* Parse the type. */
6902 }
6904 /* If things aren't going well, there's no need to
6905 keep going. */
6907 {
6909 /* Parse the brace-enclosed initializer list. */
6912 }
6913 /* If that worked, we're definitely looking at a
6914 compound-literal expression. */
6916 {
6917 /* Warn the user that a compound literal is not
6918 allowed in standard C++. */
6921 /* For simplicity, we disallow compound literals in
6922 constant-expressions. We could
6923 allow compound literals of integer type, whose
6924 initializer was a constant, in constant
6925 expressions. Permitting that usage, as a further
6926 extension, would not change the meaning of any
6927 currently accepted programs. (Of course, as
6928 compound literals are not part of ISO C++, the
6929 standard has nothing to say.) */
6931 NIC_NCC))
6932 {
6935 }
6936 /* Form the representation of the compound-literal. */
6937 postfix_expression
6942 }
6943 }
6945 /* It must be a primary-expression. */
6946 postfix_expression
6949 decltype_p,
6951 }
6953 }
6955 /* Note that we don't need to worry about calling build_cplus_new on a
6956 class-valued CALL_EXPR in decltype when it isn't the end of the
6957 postfix-expression; unary_complex_lvalue will take care of that for
6958 all these cases. */
6960 /* Keep looping until the postfix-expression is complete. */
6962 {
6966 /* It is not a Koenig lookup function call. */
6967 postfix_expression
6970 /* Peek at the next token. */
6974 {
6977 {
6979 "two consecutive %<[%> shall "
6982 }
6983 postfix_expression
6985 postfix_expression,
6987 decltype_p);
6996 /* postfix-expression ( expression-list [opt] ) */
6997 {
7008 is_builtin_constant_p
7011 {
7012 /* The whole point of __builtin_constant_p is to allow
7013 non-constant expressions to appear as arguments. */
7014 saved_integral_constant_expression_p
7016 saved_non_integral_constant_expression_p
7019 }
7020 args = (cp_parser_parenthesized_expression_list
7026 {
7027 parser->integral_constant_expression_p
7029 parser->non_integral_constant_expression_p
7031 }
7034 {
7037 }
7039 /* Function calls are not permitted in
7040 constant-expressions. */
7043 NIC_FUNC_CALL))
7044 {
7048 }
7053 {
7055 {
7057 {
7060 postfix_expression
7062 complain);
7063 }
7064 else
7065 postfix_expression
7067 }
7068 /* We do not perform argument-dependent lookup if
7069 normal lookup finds a non-function, in accordance
7070 with the expected resolution of DR 218. */
7073 {
7077 /* Do not do argument dependent lookup if regular
7078 lookup finds a member function or a block-scope
7079 function declaration. [basic.lookup.argdep]/3 */
7082 {
7085 postfix_expression
7087 complain);
7088 }
7089 }
7090 }
7096 {
7105 }
7108 {
7118 {
7120 postfix_expression
7124 }
7127 {
7128 postfix_expression
7129 = (build_new_method_call
7135 complain));
7136 }
7137 else
7138 postfix_expression
7142 complain);
7143 }
7147 postfix_expression = (build_offset_ref_call_from_tree
7149 complain));
7151 /* A call to a static class member, or a namespace-scope
7152 function. */
7153 postfix_expression
7156 koenig_p,
7157 complain);
7158 else
7159 /* All other function calls. */
7160 postfix_expression
7163 koenig_p,
7164 complain);
7167 {
7169 start_loc,
7170 close_paren_loc);
7172 }
7174 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7178 }
7183 /* postfix-expression . template [opt] id-expression
7184 postfix-expression . pseudo-destructor-name
7185 postfix-expression -> template [opt] id-expression
7186 postfix-expression -> pseudo-destructor-name */
7188 /* Consume the `.' or `->' operator. */
7191 postfix_expression
7193 postfix_expression,
7200 /* postfix-expression ++ */
7201 /* Consume the `++' token. */
7203 /* Generate a representation for the complete expression. */
7204 postfix_expression
7206 POSTINCREMENT_EXPR);
7207 /* Increments may not appear in constant-expressions. */
7215 /* postfix-expression -- */
7216 /* Consume the `--' token. */
7218 /* Generate a representation for the complete expression. */
7219 postfix_expression
7221 POSTDECREMENT_EXPR);
7222 /* Decrements may not appear in constant-expressions. */
7233 return is_member_access
7234 ? postfix_expression
7236 else
7238 }
7239 }
7241 /* We should never get here. */
7244 }
7246 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7247 by cp_parser_builtin_offsetof. We're looking for
7249 postfix-expression [ expression ]
7250 postfix-expression [ braced-init-list ] (C++11)
7252 FOR_OFFSETOF is set if we're being called in that context, which
7253 changes how we deal with integer constant expressions. */
7255 static tree
7257 tree postfix_expression,
7260 {
7265 /* Consume the `[' token. */
7271 /* Parse the index expression. */
7272 /* ??? For offsetof, there is a question of what to allow here. If
7273 offsetof is not being used in an integral constant expression context,
7274 then we *could* get the right answer by computing the value at runtime.
7275 If we are in an integral constant expression context, then we might
7276 could accept any constant expression; hard to say without analysis.
7277 Rather than open the barn door too wide right away, allow only integer
7278 constant expressions here. */
7281 else
7282 {
7284 {
7289 }
7290 else
7292 }
7296 /* Look for the closing `]'. */
7299 /* Build the ARRAY_REF. */
7303 /* When not doing offsetof, array references are not permitted in
7304 constant-expressions. */
7310 }
7312 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7313 by cp_parser_builtin_offsetof. We're looking for
7315 postfix-expression . template [opt] id-expression
7316 postfix-expression . pseudo-destructor-name
7317 postfix-expression -> template [opt] id-expression
7318 postfix-expression -> pseudo-destructor-name
7320 FOR_OFFSETOF is set if we're being called in that context. That sorta
7321 limits what of the above we'll actually accept, but nevermind.
7322 TOKEN_TYPE is the "." or "->" token, which will already have been
7323 removed from the stream. */
7325 static tree
7328 cp_expr postfix_expression,
7330 location_t location)
7331 {
7332 tree name;
7338 /* If this is a `->' operator, dereference the pointer. */
7341 tf_warning_or_error);
7342 /* Check to see whether or not the expression is type-dependent and
7343 not the current instantiation. */
7345 /* The identifier following the `->' or `.' is not qualified. */
7351 /* Enter the scope corresponding to the type of the object
7352 given by the POSTFIX_EXPRESSION. */
7354 {
7356 /* According to the standard, no expression should ever have
7357 reference type. Unfortunately, we do not currently match
7358 the standard in this respect in that our internal representation
7359 of an expression may have reference type even when the standard
7360 says it does not. Therefore, we have to manually obtain the
7361 underlying type here. */
7363 /* The type of the POSTFIX_EXPRESSION must be complete. */
7364 /* Unlike the object expression in other contexts, *this is not
7365 required to be of complete type for purposes of class member
7366 access (5.2.5) outside the member function body. */
7369 && !(processing_template_decl
7370 && current_class_type
7371 && (same_type_ignoring_top_level_qualifiers_p
7373 {
7376 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7378 {
7379 /* In a template, be permissive by treating an object expression
7380 of incomplete type as dependent (after a pedwarn). */
7381 diagnostic_t kind = (processing_template_decl
7383 ? DK_PEDWARN
7385 cxx_incomplete_type_diagnostic
7391 {
7394 }
7395 }
7396 }
7399 {
7400 /* Let the name lookup machinery know that we are processing a
7401 class member access expression. */
7403 /* If something went wrong, we want to be able to discern that case,
7404 as opposed to the case where there was no SCOPE due to the type
7405 of expression being dependent. */
7408 /* If the SCOPE was erroneous, make the various semantic analysis
7409 functions exit quickly -- and without issuing additional error
7410 messages. */
7413 }
7414 }
7417 /* Tell cp_parser_lookup_name that there was an object, even though it's
7418 type-dependent. */
7421 /* Assume this expression is not a pseudo-destructor access. */
7424 /* If the SCOPE is a scalar type, then, if this is a valid program,
7425 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7426 is type dependent, it can be pseudo-destructor-name or something else.
7427 Try to parse it as pseudo-destructor-name first. */
7429 {
7430 tree s;
7431 tree type;
7434 /* Parse the pseudo-destructor-name. */
7443 {
7445 postfix_expression
7448 }
7449 }
7452 {
7453 /* If the SCOPE is not a scalar type, we are looking at an
7454 ordinary class member access expression, rather than a
7455 pseudo-destructor-name. */
7458 /* Parse the id-expression. */
7459 name = (cp_parser_id_expression
7466 /* In general, build a SCOPE_REF if the member name is qualified.
7467 However, if the name was not dependent and has already been
7468 resolved; there is no need to build the SCOPE_REF. For example;
7470 struct X { void f(); };
7471 template <typename T> void f(T* t) { t->X::f(); }
7473 Even though "t" is dependent, "X::f" is not and has been resolved
7474 to a BASELINK; there is no need to include scope information. */
7476 /* But we do need to remember that there was an explicit scope for
7477 virtual function calls. */
7481 /* If the name is a template-id that names a type, we will get a
7482 TYPE_DECL here. That is invalid code. */
7484 {
7487 }
7488 else
7489 {
7491 {
7493 {
7497 }
7498 else
7501 name,
7502 template_p);
7506 }
7508 adjust_result_of_qualified_name_lookup
7510 postfix_expression
7512 template_p,
7513 tf_warning_or_error);
7514 /* Build a location e.g.:
7515 ptr->access_expr
7516 ~~~^~~~~~~~~~~~~
7517 where the caret is at the deref token, ranging from
7518 the start of postfix_expression to the end of the access expr. */
7519 location_t end_loc
7521 location_t combined_loc
7524 }
7525 }
7527 /* We no longer need to look up names in the scope of the object on
7528 the left-hand side of the `.' or `->' operator. */
7531 /* Outside of offsetof, these operators may not appear in
7532 constant-expressions. */
7534 && (cp_parser_non_integral_constant_expression
7539 }
7541 /* Parse a parenthesized expression-list.
7543 expression-list:
7544 assignment-expression
7545 expression-list, assignment-expression
7547 attribute-list:
7548 expression-list
7549 identifier
7550 identifier, expression-list
7552 CAST_P is true if this expression is the target of a cast.
7554 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7555 argument pack.
7557 Returns a vector of trees. Each element is a representation of an
7558 assignment-expression. NULL is returned if the ( and or ) are
7559 missing. An empty, but allocated, vector is returned on no
7560 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7561 if we are parsing an attribute list for an attribute that wants a
7562 plain identifier argument, normal_attr for an attribute that wants
7563 an expression, or non_attr if we aren't parsing an attribute list. If
7564 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7565 not all of the expressions in the list were constant.
7566 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7567 will be written to with the location of the closing parenthesis. If
7568 an error occurs, it may or may not be written to. */
7577 {
7583 /* Assume all the expressions will be constant. */
7587 matching_parens parens;
7593 /* Within a parenthesized expression, a `>' token is always
7594 the greater-than operator. */
7595 saved_greater_than_is_operator_p
7599 /* Consume expressions until there are no more. */
7602 {
7603 tree expr;
7605 /* At the beginning of attribute lists, check to see if the
7606 next token is an identifier. */
7609 {
7612 /* Consume the identifier. */
7614 /* Save the identifier. */
7616 }
7617 else
7618 {
7621 /* Parse the next assignment-expression. */
7623 {
7624 /* A braced-init-list. */
7630 }
7632 {
7633 expr = (cp_parser_constant_expression
7638 }
7639 else
7641 cast_p);
7646 /* If we have an ellipsis, then this is an expression
7647 expansion. */
7650 {
7651 /* Consume the `...'. */
7654 /* Build the argument pack. */
7656 }
7658 /* Add it to the list. We add error_mark_node
7659 expressions to the list, so that we can still tell if
7660 the correct form for a parenthesized expression-list
7661 is found. That gives better errors. */
7666 }
7668 /* After the first item, attribute lists look the same as
7669 expression lists. */
7672 get_comma:;
7673 /* If the next token isn't a `,', then we are done. */
7677 /* Otherwise, consume the `,' and keep going. */
7679 }
7685 {
7688 skip_comma:;
7689 /* We try and resync to an unnested comma, as that will give the
7690 user better diagnostics. */
7698 {
7699 parser->greater_than_is_operator_p
7702 }
7703 }
7705 parser->greater_than_is_operator_p
7712 }
7714 /* Parse a pseudo-destructor-name.
7716 pseudo-destructor-name:
7717 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7718 :: [opt] nested-name-specifier template template-id :: ~ type-name
7719 :: [opt] nested-name-specifier [opt] ~ type-name
7721 If either of the first two productions is used, sets *SCOPE to the
7722 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7723 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7724 or ERROR_MARK_NODE if the parse fails. */
7726 static void
7728 tree object,
7731 {
7734 /* Handle ~auto. */
7738 {
7741 "%<~auto%> only available with "
7748 }
7750 /* Assume that things will not work out. */
7753 /* Look for the optional `::' operator. */
7755 /* Look for the optional nested-name-specifier. */
7756 nested_name_specifier_p
7763 /* Now, if we saw a nested-name-specifier, we might be doing the
7764 second production. */
7767 {
7768 /* Consume the `template' keyword. */
7770 /* Parse the template-id. */
7774 class_type,
7776 /* Look for the `::' token. */
7778 }
7779 /* If the next token is not a `~', then there might be some
7780 additional qualification. */
7782 {
7783 /* At this point, we're looking for "type-name :: ~". The type-name
7784 must not be a class-name, since this is a pseudo-destructor. So,
7785 it must be either an enum-name, or a typedef-name -- both of which
7786 are just identifiers. So, we peek ahead to check that the "::"
7787 and "~" tokens are present; if they are not, then we can avoid
7788 calling type_name. */
7792 {
7795 }
7797 /* Look for the type-name. */
7802 /* Look for the `::' token. */
7804 }
7805 else
7808 /* Look for the `~'. */
7811 /* Once we see the ~, this has to be a pseudo-destructor. */
7815 /* Look for the type-name again. We are not responsible for
7816 checking that it matches the first type-name. */
7818 }
7820 /* Parse a unary-expression.
7822 unary-expression:
7823 postfix-expression
7824 ++ cast-expression
7825 -- cast-expression
7826 unary-operator cast-expression
7827 sizeof unary-expression
7828 sizeof ( type-id )
7829 alignof ( type-id ) [C++0x]
7830 new-expression
7831 delete-expression
7833 GNU Extensions:
7835 unary-expression:
7836 __extension__ cast-expression
7837 __alignof__ unary-expression
7838 __alignof__ ( type-id )
7839 alignof unary-expression [C++0x]
7840 __real__ cast-expression
7841 __imag__ cast-expression
7842 && identifier
7843 sizeof ( type-id ) { initializer-list , [opt] }
7844 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7845 __alignof__ ( type-id ) { initializer-list , [opt] }
7847 ADDRESS_P is true iff the unary-expression is appearing as the
7848 operand of the `&' operator. CAST_P is true if this expression is
7849 the target of a cast.
7851 Returns a representation of the expression. */
7853 static cp_expr
7856 {
7860 /* Peek at the next token. */
7862 /* Some keywords give away the kind of expression. */
7864 {
7868 {
7871 {
7877 /* Consume the token. */
7879 /* Parse the operand. */
7884 else
7885 {
7886 /* ISO C++ defines alignof only with types, not with
7887 expressions. So pedwarn if alignof is used with a non-
7888 type expression. However, __alignof__ is ok. */
7891 "ISO C++ does not allow %<alignof%> "
7895 }
7896 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7897 SIZEOF_EXPR with the original operand. */
7899 {
7901 {
7903 {
7906 error_mark_node));
7908 }
7909 else
7913 }
7914 }
7916 /* Construct a location e.g. :
7917 alignof (expr)
7918 ^~~~~~~~~~~~~~
7919 with start == caret at the start of the "alignof"/"sizeof"
7920 token, with the endpoint at the final closing paren. */
7921 location_t finish_loc
7923 location_t compound_loc
7929 }
7938 {
7939 /* The saved value of the PEDANTIC flag. */
7941 tree expr;
7943 /* Save away the PEDANTIC flag. */
7945 /* Parse the cast-expression. */
7947 /* Restore the PEDANTIC flag. */
7951 }
7955 {
7956 tree expression;
7958 /* Consume the `__real__' or `__imag__' token. */
7960 /* Parse the cast-expression. */
7962 /* Create the complete representation. */
7966 expression,
7967 tf_warning_or_error);
7968 }
7976 {
7977 tree expr;
7986 matching_parens parens;
7990 parser->type_definition_forbidden_message
7993 saved_integral_constant_expression_p
7995 saved_non_integral_constant_expression_p
7999 saved_greater_than_is_operator_p
8011 parser->greater_than_is_operator_p
8014 parser->integral_constant_expression_p
8016 parser->non_integral_constant_expression_p
8021 location_t finish_loc
8025 /* Construct a location of the form:
8026 noexcept (expr)
8027 ^~~~~~~~~~~~~~~
8028 with start == caret, finishing at the close-paren. */
8029 location_t noexcept_loc
8033 noexcept_loc);
8034 }
8038 }
8039 }
8041 /* Look for the `:: new' and `:: delete', which also signal the
8042 beginning of a new-expression, or delete-expression,
8043 respectively. If the next token is `::', then it might be one of
8044 these. */
8046 {
8049 /* See if the token after the `::' is one of the keywords in
8050 which we're interested. */
8052 /* If it's `new', we have a new-expression. */
8055 /* Similarly, for `delete'. */
8058 }
8060 /* Look for a unary operator. */
8062 /* The `++' and `--' operators can be handled similarly, even though
8063 they are not technically unary-operators in the grammar. */
8065 {
8070 /* Handle the GNU address-of-label extension. */
8073 {
8074 tree identifier;
8075 tree expression;
8078 /* Consume the '&&' token. */
8080 /* Look for the identifier. */
8081 location_t finish_loc
8084 /* Construct a location of the form:
8085 &&label
8086 ^~~~~~~
8087 with caret==start at the "&&", finish at the end of the label. */
8088 location_t combined_loc
8090 /* Create an expression representing the address. */
8093 NIC_ADDR_LABEL))
8096 }
8097 }
8099 {
8100 cp_expr cast_expression;
8106 /* Consume the operator token. */
8110 /* Parse the cast-expression. */
8111 cast_expression
8116 pidk);
8118 /* Make a location:
8119 OP_TOKEN CAST_EXPRESSION
8120 ^~~~~~~~~~~~~~~~~~~~~~~~~
8121 with start==caret at the operator token, and
8122 extending to the end of the cast_expression. */
8125 /* Now, build an appropriate representation. */
8127 {
8131 RO_UNARY_STAR,
8132 complain);
8133 /* TODO: build_x_indirect_ref does not always honor the
8134 location, so ensure it is set. */
8140 /* Fall through. */
8143 cast_expression,
8144 complain);
8145 /* TODO: build_x_unary_op does not always honor the location,
8146 so ensure it is set. */
8154 /* Fall through. */
8156 /* Immediately fold negation of a constant, unless the constant is 0
8157 (since -0 == 0) or it would overflow. */
8162 {
8165 cast_expression);
8167 {
8170 }
8171 }
8172 /* Fall through. */
8181 }
8185 non_constant_p))
8189 }
8193 decltype_p,
8194 pidk);
8195 }
8197 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8198 unary-operator, the corresponding tree code is returned. */
8200 static enum tree_code
8202 {
8204 {
8225 }
8226 }
8228 /* Parse a new-expression.
8230 new-expression:
8231 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8232 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8234 Returns a representation of the expression. */
8236 static tree
8238 {
8241 tree type;
8244 tree ret;
8248 /* Look for the optional `::' operator. */
8249 global_scope_p
8253 /* Look for the `new' operator. */
8255 /* There's no easy way to tell a new-placement from the
8256 `( type-id )' construct. */
8258 /* Look for a new-placement. */
8260 /* If that didn't work out, there's no new-placement. */
8262 {
8266 }
8268 /* If the next token is a `(', then we have a parenthesized
8269 type-id. */
8271 {
8275 /* Consume the `('. */
8276 matching_parens parens;
8279 /* Parse the type-id. */
8280 parser->type_definition_forbidden_message
8282 {
8285 }
8288 /* Look for the closing `)'. */
8291 /* There should not be a direct-new-declarator in this production,
8292 but GCC used to allowed this, so we check and emit a sensible error
8293 message for this case. */
8295 {
8301 }
8302 }
8303 /* Otherwise, there must be a new-type-id. */
8304 else
8307 /* If the next token is a `(' or '{', then we have a new-initializer. */
8312 else
8315 /* A new-expression may not appear in an integral constant
8316 expression. */
8319 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8320 of a new-type-id or type-id of a new-expression, the new-expression shall
8321 contain a new-initializer of the form ( assignment-expression )".
8322 Additionally, consistently with the spirit of DR 1467, we want to accept
8323 'new auto { 2 }' too. */
8329 {
8331 "initialization of new-expression for type %<auto%> "
8334 }
8335 else
8336 {
8337 /* Construct a location e.g.:
8338 ptr = new int[100]
8339 ^~~~~~~~~~~~
8340 with caret == start at the start of the "new" token, and the end
8341 at the end of the final token we consumed. */
8346 /* Create a representation of the new-expression. */
8348 tf_warning_or_error);
8350 }
8358 }
8360 /* Parse a new-placement.
8362 new-placement:
8363 ( expression-list )
8365 Returns the same representation as for an expression-list. */
8369 {
8372 /* Parse the expression-list. */
8373 expression_list = (cp_parser_parenthesized_expression_list
8382 }
8384 /* Parse a new-type-id.
8386 new-type-id:
8387 type-specifier-seq new-declarator [opt]
8389 Returns the TYPE allocated. If the new-type-id indicates an array
8390 type, *NELTS is set to the number of elements in the last array
8391 bound; the TYPE will not include the last array bound. */
8393 static tree
8395 {
8396 cp_decl_specifier_seq type_specifier_seq;
8402 /* The type-specifier sequence must not contain type definitions.
8403 (It cannot contain declarations of new types either, but if they
8404 are not definitions we will catch that because they are not
8405 complete.) */
8407 parser->type_definition_forbidden_message
8409 /* Parse the type-specifier-seq. */
8413 /* Restore the old message. */
8419 /* Parse the new-declarator. */
8422 /* Determine the number of elements in the last array dimension, if
8423 any. */
8425 /* Skip down to the last array dimension. */
8430 {
8433 }
8438 {
8441 }
8444 {
8451 else
8453 }
8456 }
8458 /* Parse an (optional) new-declarator.
8460 new-declarator:
8461 ptr-operator new-declarator [opt]
8462 direct-new-declarator
8464 Returns the declarator. */
8468 {
8471 cp_cv_quals cv_quals;
8473 /* We don't know if there's a ptr-operator next, or not. */
8475 /* Look for a ptr-operator. */
8477 /* If that worked, look for more new-declarators. */
8479 {
8482 /* Parse another optional declarator. */
8485 declarator = cp_parser_make_indirect_declarator
8489 }
8491 /* If the next token is a `[', there is a direct-new-declarator. */
8496 }
8498 /* Parse a direct-new-declarator.
8500 direct-new-declarator:
8501 [ expression ]
8502 direct-new-declarator [constant-expression]
8504 */
8508 {
8512 {
8513 tree expression;
8516 /* Look for the opening `['. */
8521 /* The standard requires that the expression have integral
8522 type. DR 74 adds enumeration types. We believe that the
8523 real intent is that these expressions be handled like the
8524 expression in a `switch' condition, which also allows
8525 classes with a single conversion to integral or
8526 enumeration type. */
8528 {
8529 expression
8531 expression,
8534 {
8536 "expression in new-declarator must have integral "
8539 }
8540 }
8542 /* Look for the closing `]'. */
8545 /* Add this bound to the declarator. */
8548 /* If the next token is not a `[', then there are no more
8549 bounds. */
8552 }
8555 }
8557 /* Parse a new-initializer.
8559 new-initializer:
8560 ( expression-list [opt] )
8561 braced-init-list
8563 Returns a representation of the expression-list. */
8567 {
8571 {
8572 tree t;
8579 }
8580 else
8581 expression_list = (cp_parser_parenthesized_expression_list
8587 }
8589 /* Parse a delete-expression.
8591 delete-expression:
8592 :: [opt] delete cast-expression
8593 :: [opt] delete [ ] cast-expression
8595 Returns a representation of the expression. */
8597 static tree
8599 {
8602 tree expression;
8604 /* Look for the optional `::' operator. */
8605 global_scope_p
8609 /* Look for the `delete' keyword. */
8611 /* See if the array syntax is in use. */
8613 {
8614 /* Consume the `[' token. */
8616 /* Look for the `]' token. */
8618 /* Remember that this is the `[]' construct. */
8620 }
8621 else
8624 /* Parse the cast-expression. */
8627 /* A delete-expression may not appear in an integral constant
8628 expression. */
8633 tf_warning_or_error);
8634 }
8636 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8637 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8638 0 otherwise. */
8640 static int
8642 {
8645 {
8687 /* In ((type ()) () the last () isn't a valid cast-expression,
8688 so the whole must be parsed as postfix-expression. */
8693 /* '[' may start a primary-expression in obj-c++ and in C++11,
8694 as a lambda-expression, eg, '(void)[]{}'. */
8701 /* '++' and '--' may or may not start a cast-expression:
8703 struct T { void operator++(int); };
8704 void f() { (T())++; }
8706 vs
8708 int a;
8709 (int)++a; */
8714 }
8715 }
8717 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8718 in the order: const_cast, static_cast, reinterpret_cast.
8720 Don't suggest dynamic_cast.
8722 Return the first legal cast kind found, or NULL otherwise. */
8726 {
8727 tree trial;
8729 /* Reuse the parser logic by attempting to build the various kinds of
8730 cast, with "complain" disabled.
8731 Identify the first such cast that is valid. */
8733 /* Don't attempt to run such logic within template processing. */
8737 /* First try const_cast. */
8742 /* If that fails, try static_cast. */
8747 /* Finally, try reinterpret_cast. */
8752 /* No such cast possible. */
8754 }
8756 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8757 suggesting how to convert a C-style cast of the form:
8759 (DST_TYPE)ORIG_EXPR
8761 to a C++-style cast.
8763 The primary range of RICHLOC is asssumed to be that of the original
8764 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8765 of the parens in the C-style cast. */
8767 static void
8770 tree dst_type)
8771 {
8772 /* This function is non-trivial, so bail out now if the warning isn't
8773 going to be emitted. */
8777 /* Try to find a legal C++ cast, trying them in order:
8778 const_cast, static_cast, reinterpret_cast. */
8783 /* Replace the open paren with "CAST_SUGGESTION<". */
8784 pretty_printer pp;
8788 /* Replace the close paren with "> (". */
8791 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8793 }
8796 /* Parse a cast-expression.
8798 cast-expression:
8799 unary-expression
8800 ( type-id ) cast-expression
8802 ADDRESS_P is true iff the unary-expression is appearing as the
8803 operand of the `&' operator. CAST_P is true if this expression is
8804 the target of a cast.
8806 Returns a representation of the expression. */
8808 static cp_expr
8811 {
8812 /* If it's a `(', then we might be looking at a cast. */
8814 {
8820 /* There's no way to know yet whether or not this is a cast.
8821 For example, `(int (3))' is a unary-expression, while `(int)
8822 3' is a cast. So, we resort to parsing tentatively. */
8824 /* Types may not be defined in a cast. */
8826 parser->type_definition_forbidden_message
8828 /* Consume the `('. */
8829 matching_parens parens;
8834 /* A very tricky bit is that `(struct S) { 3 }' is a
8835 compound-literal (which we permit in C++ as an extension).
8836 But, that construct is not a cast-expression -- it is a
8837 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8838 is legal; if the compound-literal were a cast-expression,
8839 you'd need an extra set of parentheses.) But, if we parse
8840 the type-id, and it happens to be a class-specifier, then we
8841 will commit to the parse at that point, because we cannot
8842 undo the action that is done when creating a new class. So,
8843 then we cannot back up and do a postfix-expression.
8845 Another tricky case is the following (c++/29234):
8847 struct S { void operator () (); };
8849 void foo ()
8850 {
8851 ( S()() );
8852 }
8854 As a type-id we parse the parenthesized S()() as a function
8855 returning a function, groktypename complains and we cannot
8856 back up in this case either.
8858 Therefore, we scan ahead to the closing `)', and check to see
8859 if the tokens after the `)' can start a cast-expression. Otherwise
8860 we are dealing with an unary-expression, a postfix-expression
8861 or something else.
8863 Yet another tricky case, in C++11, is the following (c++/54891):
8865 (void)[]{};
8867 The issue is that usually, besides the case of lambda-expressions,
8868 the parenthesized type-id cannot be followed by '[', and, eg, we
8869 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8870 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8871 we don't commit, we try a cast-expression, then an unary-expression.
8873 Save tokens so that we can put them back. */
8876 /* We may be looking at a cast-expression. */
8879 cast_expression
8882 /* Roll back the tokens we skipped. */
8884 /* If we aren't looking at a cast-expression, simulate an error so
8885 that the call to cp_parser_error_occurred below returns true. */
8888 else
8889 {
8892 /* Look for the type-id. */
8894 /* Look for the closing `)'. */
8899 }
8901 /* Restore the saved message. */
8904 /* At this point this can only be either a cast or a
8905 parenthesized ctor such as `(T ())' that looks like a cast to
8906 function returning T. */
8908 {
8909 /* Only commit if the cast-expression doesn't start with
8910 '++', '--', or '[' in C++11. */
8918 pidk);
8921 {
8922 /* Warn about old-style casts, if so requested. */
8927 {
8933 }
8935 /* Only type conversions to integral or enumeration types
8936 can be used in constant-expressions. */
8939 NIC_CAST))
8942 /* Perform the cast. */
8943 /* Make a location:
8944 (TYPE) EXPR
8945 ^~~~~~~~~~~
8946 with start==caret at the open paren, extending to the
8947 end of "expr". */
8949 open_paren_loc,
8953 }
8954 }
8955 else
8957 }
8959 /* If we get here, then it's not a cast, so it must be a
8960 unary-expression. */
8963 }
8965 /* Parse a binary expression of the general form:
8967 pm-expression:
8968 cast-expression
8969 pm-expression .* cast-expression
8970 pm-expression ->* cast-expression
8972 multiplicative-expression:
8973 pm-expression
8974 multiplicative-expression * pm-expression
8975 multiplicative-expression / pm-expression
8976 multiplicative-expression % pm-expression
8978 additive-expression:
8979 multiplicative-expression
8980 additive-expression + multiplicative-expression
8981 additive-expression - multiplicative-expression
8983 shift-expression:
8984 additive-expression
8985 shift-expression << additive-expression
8986 shift-expression >> additive-expression
8988 relational-expression:
8989 shift-expression
8990 relational-expression < shift-expression
8991 relational-expression > shift-expression
8992 relational-expression <= shift-expression
8993 relational-expression >= shift-expression
8995 GNU Extension:
8997 relational-expression:
8998 relational-expression <? shift-expression
8999 relational-expression >? shift-expression
9001 equality-expression:
9002 relational-expression
9003 equality-expression == relational-expression
9004 equality-expression != relational-expression
9006 and-expression:
9007 equality-expression
9008 and-expression & equality-expression
9010 exclusive-or-expression:
9011 and-expression
9012 exclusive-or-expression ^ and-expression
9014 inclusive-or-expression:
9015 exclusive-or-expression
9016 inclusive-or-expression | exclusive-or-expression
9018 logical-and-expression:
9019 inclusive-or-expression
9020 logical-and-expression && inclusive-or-expression
9022 logical-or-expression:
9023 logical-and-expression
9024 logical-or-expression || logical-and-expression
9026 All these are implemented with a single function like:
9028 binary-expression:
9029 simple-cast-expression
9030 binary-expression <token> binary-expression
9032 CAST_P is true if this expression is the target of a cast.
9034 The binops_by_token map is used to get the tree codes for each <token> type.
9035 binary-expressions are associated according to a precedence table. */
9037 #define TOKEN_PRECEDENCE(token) \
9038 (((token->type == CPP_GREATER \
9039 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9040 && !parser->greater_than_is_operator_p) \
9041 ? PREC_NOT_OPERATOR \
9042 : binops_by_token[token->type].prec)
9044 static cp_expr
9050 {
9051 cp_parser_expression_stack stack;
9053 cp_parser_expression_stack_entry current;
9054 cp_expr rhs;
9058 tree overload;
9060 /* Parse the first expression. */
9071 {
9072 /* Get an operator token. */
9078 {
9080 "%<>>%> operator is treated"
9084 }
9089 /* This is a fold-expression; handle it later. */
9092 /* Popping an entry off the stack means we completed a subexpression:
9093 - either we found a token which is not an operator (`>' where it is not
9094 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9095 will happen repeatedly;
9096 - or, we found an operator which has lower priority. This is the case
9097 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9098 parsing `3 * 4'. */
9100 {
9103 else
9105 }
9107 get_rhs:
9111 /* We used the operator token. */
9114 /* For "false && x" or "true || x", x will never be executed;
9115 disable warnings while evaluating it. */
9117 c_inhibit_evaluation_warnings +=
9120 c_inhibit_evaluation_warnings +=
9123 /* Extract another operand. It may be the RHS of this expression
9124 or the LHS of a new, higher priority expression. */
9129 /* Get another operator token. Look up its precedence to avoid
9130 building a useless (immediately popped) stack entry for common
9131 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9138 {
9139 /* ... and prepare to parse the RHS of the new, higher priority
9140 expression. Since precedence levels on the stack are
9141 monotonically increasing, we do not have to care about
9142 stack overflows. */
9151 pop:
9153 /* If the stack is not empty, we have parsed into LHS the right side
9154 (`4' in the example above) of an expression we had suspended.
9155 We can use the information on the stack to recover the LHS (`3')
9156 from the stack together with the tree code (`MULT_EXPR'), and
9157 the precedence of the higher level subexpression
9158 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9159 which will be used to actually build the additive expression. */
9164 }
9166 /* Undo the disabling of warnings done above. */
9168 c_inhibit_evaluation_warnings -=
9171 c_inhibit_evaluation_warnings -=
9177 /* Avoid warning for !!x == y. */
9182 /* Avoid warning for !b == y where b is boolean. */
9186 /* Avoid warning for !!b == y where b is boolean. */
9199 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9200 ERROR_MARK for everything that is not a binary expression.
9201 This makes warn_about_parentheses miss some warnings that
9202 involve unary operators. For unary expressions we should
9203 pass the correct tree_code unless the unary expression was
9204 surrounded by parentheses.
9205 */
9212 == tcc_comparison
9215 else
9216 {
9221 /* TODO: build_x_binary_op doesn't always honor the location. */
9223 }
9226 /* If the binary operator required the use of an overloaded operator,
9227 then this expression cannot be an integral constant-expression.
9228 An overloaded operator can be used even if both operands are
9229 otherwise permissible in an integral constant-expression if at
9230 least one of the operands is of enumeration type. */
9234 NIC_OVERLOADED))
9236 }
9239 }
9241 static cp_expr
9246 {
9249 }
9251 /* Parse the `? expression : assignment-expression' part of a
9252 conditional-expression. The LOGICAL_OR_EXPR is the
9253 logical-or-expression that started the conditional-expression.
9254 Returns a representation of the entire conditional-expression.
9256 This routine is used by cp_parser_assignment_expression.
9258 ? expression : assignment-expression
9260 GNU Extensions:
9262 ? : assignment-expression */
9264 static tree
9266 {
9268 cp_expr assignment_expr;
9272 /* Consume the `?' token. */
9277 {
9280 /* Implicit true clause. */
9282 c_inhibit_evaluation_warnings +=
9285 }
9286 else
9287 {
9290 /* Parse the expression. */
9291 c_inhibit_evaluation_warnings +=
9294 c_inhibit_evaluation_warnings +=
9298 }
9300 /* The next token should be a `:'. */
9302 /* Parse the assignment-expression. */
9304 c_inhibit_evaluation_warnings -=
9307 /* Make a location:
9308 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9309 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9310 with the caret at the "?", ranging from the start of
9311 the logical_or_expr to the end of the assignment_expr. */
9316 /* Build the conditional-expression. */
9318 expr,
9319 assignment_expr,
9320 tf_warning_or_error);
9321 }
9323 /* Parse an assignment-expression.
9325 assignment-expression:
9326 conditional-expression
9327 logical-or-expression assignment-operator assignment_expression
9328 throw-expression
9330 CAST_P is true if this expression is the target of a cast.
9331 DECLTYPE_P is true if this expression is the operand of decltype.
9333 Returns a representation for the expression. */
9335 static cp_expr
9338 {
9339 cp_expr expr;
9341 /* If the next token is the `throw' keyword, then we're looking at
9342 a throw-expression. */
9345 /* Otherwise, it must be that we are looking at a
9346 logical-or-expression. */
9347 else
9348 {
9349 /* Parse the binary expressions (logical-or-expression). */
9351 decltype_p,
9353 /* If the next token is a `?' then we're actually looking at a
9354 conditional-expression. */
9357 else
9358 {
9361 /* If it's an assignment-operator, we're using the second
9362 production. */
9363 enum tree_code assignment_operator
9366 {
9369 /* Parse the right-hand side of the assignment. */
9376 /* An assignment may not appear in a
9377 constant-expression. */
9379 NIC_ASSIGNMENT))
9381 /* Build the assignment expression. Its default
9382 location:
9383 LHS = RHS
9384 ~~~~^~~~~
9385 is the location of the '=' token as the
9386 caret, ranging from the start of the lhs to the
9387 end of the rhs. */
9392 assignment_operator,
9393 rhs,
9395 /* TODO: build_x_modify_expr doesn't honor the location,
9396 so we must set it here. */
9398 }
9399 }
9400 }
9403 }
9405 /* Parse an (optional) assignment-operator.
9407 assignment-operator: one of
9408 = *= /= %= += -= >>= <<= &= ^= |=
9410 GNU Extension:
9412 assignment-operator: one of
9413 <?= >?=
9415 If the next token is an assignment operator, the corresponding tree
9416 code is returned, and the token is consumed. For example, for
9417 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9418 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9419 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9420 operator, ERROR_MARK is returned. */
9422 static enum tree_code
9424 {
9428 /* Peek at the next token. */
9432 {
9478 /* Nothing else is an assignment operator. */
9480 }
9482 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9487 /* If it was an assignment operator, consume it. */
9492 }
9494 /* Parse an expression.
9496 expression:
9497 assignment-expression
9498 expression , assignment-expression
9500 CAST_P is true if this expression is the target of a cast.
9501 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9502 except possibly parenthesized or on the RHS of a comma (N3276).
9504 Returns a representation of the expression. */
9506 static cp_expr
9509 {
9514 {
9515 cp_expr assignment_expression;
9517 /* Parse the next assignment-expression. */
9518 assignment_expression
9521 /* We don't create a temporary for a call that is the immediate operand
9522 of decltype or on the RHS of a comma. But when we see a comma, we
9523 need to create a temporary for a call on the LHS. */
9528 assignment_expression
9532 /* If this is the first assignment-expression, we can just
9533 save it away. */
9536 else
9537 {
9538 /* Create a location with caret at the comma, ranging
9539 from the start of the LHS to the end of the RHS. */
9544 assignment_expression,
9547 }
9548 /* If the next token is not a comma, or we're in a fold-expression, then
9549 we are done with the expression. */
9553 /* Consume the `,'. */
9556 /* A comma operator cannot appear in a constant-expression. */
9559 }
9562 }
9564 /* Parse a constant-expression.
9566 constant-expression:
9567 conditional-expression
9569 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9570 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9571 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9572 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9573 only parse a conditional-expression, otherwise parse an
9574 assignment-expression. See below for rationale. */
9576 static cp_expr
9581 {
9585 cp_expr expression;
9587 /* It might seem that we could simply parse the
9588 conditional-expression, and then check to see if it were
9589 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9590 one that the compiler can figure out is constant, possibly after
9591 doing some simplifications or optimizations. The standard has a
9592 precise definition of constant-expression, and we must honor
9593 that, even though it is somewhat more restrictive.
9595 For example:
9597 int i[(2, 3)];
9599 is not a legal declaration, because `(2, 3)' is not a
9600 constant-expression. The `,' operator is forbidden in a
9601 constant-expression. However, GCC's constant-folding machinery
9602 will fold this operation to an INTEGER_CST for `3'. */
9604 /* Save the old settings. */
9606 saved_allow_non_integral_constant_expression_p
9609 /* We are now parsing a constant-expression. */
9611 parser->allow_non_integral_constant_expression_p
9614 /* Although the grammar says "conditional-expression", when not STRICT_P,
9615 we parse an "assignment-expression", which also permits
9616 "throw-expression" and the use of assignment operators. In the case
9617 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9618 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9619 actually essential that we look for an assignment-expression.
9620 For example, cp_parser_initializer_clauses uses this function to
9621 determine whether a particular assignment-expression is in fact
9622 constant. */
9624 {
9625 /* Parse the binary expressions (logical-or-expression). */
9628 /* If the next token is a `?' then we're actually looking at
9629 a conditional-expression; otherwise we're done. */
9632 }
9633 else
9635 /* Restore the old settings. */
9636 parser->integral_constant_expression_p
9638 parser->allow_non_integral_constant_expression_p
9641 {
9642 /* Require an rvalue constant expression here; that's what our
9643 callers expect. Reference constant expressions are handled
9644 separately in e.g. cp_parser_template_argument. */
9653 }
9656 parser->non_integral_constant_expression_p
9660 }
9662 /* Parse __builtin_offsetof.
9664 offsetof-expression:
9665 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9667 offsetof-member-designator:
9668 id-expression
9669 | offsetof-member-designator "." id-expression
9670 | offsetof-member-designator "[" expression "]"
9671 | offsetof-member-designator "->" id-expression */
9673 static cp_expr
9675 {
9677 tree type;
9678 cp_expr expr;
9679 cp_id_kind dummy;
9681 location_t finish_loc;
9683 /* We're about to accept non-integral-constant things, but will
9684 definitely yield an integral constant expression. Save and
9685 restore these values around our local parsing. */
9691 /* Consume the "__builtin_offsetof" token. */
9693 /* Consume the opening `('. */
9694 matching_parens parens;
9696 /* Parse the type-id. */
9699 /* Look for the `,'. */
9703 /* Build the (type *)null that begins the traditional offsetof macro. */
9704 tree object_ptr
9706 tf_warning_or_error);
9708 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9712 {
9715 {
9717 /* offsetof-member-designator "[" expression "]" */
9723 /* offsetof-member-designator "->" identifier */
9726 /* FALLTHRU */
9729 /* offsetof-member-designator "." identifier */
9737 /* Consume the ")" token. */
9743 /* Error. We know the following require will fail, but
9744 that gives the proper error message. */
9749 }
9750 }
9752 success:
9753 /* Make a location of the form:
9754 __builtin_offsetof (struct s, f)
9755 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9756 with caret at the type-id, ranging from the start of the
9757 "_builtin_offsetof" token to the close paren. */
9759 /* The result will be an INTEGER_CST, so we need to explicitly
9760 preserve the location. */
9763 failure:
9768 }
9770 /* Parse a trait expression.
9772 Returns a representation of the expression, the underlying type
9773 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9775 static cp_expr
9777 {
9778 cp_trait_kind kind;
9784 {
9886 }
9888 /* Get location of initial token. */
9891 /* Consume the token. */
9894 matching_parens parens;
9897 {
9900 }
9906 {
9909 {
9912 }
9916 }
9918 {
9920 {
9924 {
9927 }
9931 }
9932 }
9937 /* Construct a location of the form:
9938 __is_trivially_copyable(_Tp)
9939 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
9940 with start == caret, finishing at the close-paren. */
9943 /* Complete the trait expression, which may mean either processing
9944 the trait expr now or saving it for template instantiation. */
9946 {
9955 }
9956 }
9958 /* Parse a lambda expression.
9960 lambda-expression:
9961 lambda-introducer lambda-declarator [opt] compound-statement
9963 Returns a representation of the expression. */
9965 static cp_expr
9967 {
9969 tree type;
9977 {
9979 {
9983 }
9985 }
9987 {
9989 {
9992 }
9994 }
9996 /* We may be in the middle of deferred access check. Disable
9997 it now. */
10008 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10011 /* Now that we've started the type, add the capture fields for any
10012 explicit captures. */
10015 {
10016 /* Inside the class, surrounding template-parameter-lists do not apply. */
10017 unsigned int saved_num_template_parameter_lists
10021 bool fully_implicit_function_template_p
10025 bool auto_is_implicit_function_template_parm_p
10036 /* By virtue of defining a local class, a lambda expression has access to
10037 the private variables of enclosing classes. */
10045 {
10050 }
10052 {
10055 }
10057 /* The capture list was built up in reverse order; fix that now. */
10069 parser->fully_implicit_function_template_p
10073 parser->auto_is_implicit_function_template_parm_p
10075 }
10077 /* This field is only used during parsing of the lambda. */
10080 /* This lambda shouldn't have any proxies left at this point. */
10082 /* And now that we're done, push proxies for an enclosing lambda. */
10087 else
10095 }
10097 /* Parse the beginning of a lambda expression.
10099 lambda-introducer:
10100 [ lambda-capture [opt] ]
10102 LAMBDA_EXPR is the current representation of the lambda expression. */
10104 static void
10106 {
10107 /* Need commas after the first capture. */
10110 /* Eat the leading `['. */
10113 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10121 {
10124 }
10127 {
10129 tree capture_id;
10130 tree capture_init_expr;
10134 enum capture_kind_type
10135 {
10136 BY_COPY,
10137 BY_REFERENCE
10138 };
10142 {
10145 }
10149 else
10152 /* Possibly capture `this'. */
10154 {
10165 explicit_init_p);
10167 }
10169 /* Possibly capture `*this'. */
10172 {
10183 explicit_init_p);
10185 }
10187 /* Remember whether we want to capture as a reference or not. */
10189 {
10192 }
10194 /* Get the identifier. */
10199 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10200 delimiters, but I modified this to stop on unnested ']' as well. It
10201 was already changed to stop on unnested '}', so the
10202 "closing_parenthesis" name is no more misleading with my change. */
10203 {
10209 }
10211 /* Find the initializer for this capture. */
10215 {
10217 /* An explicit initializer exists. */
10220 "lambda capture initializers "
10226 {
10229 }
10230 }
10231 else
10232 {
10235 /* Turn the identifier into an id-expression. */
10236 capture_init_expr
10241 {
10244 }
10248 {
10251 capture_init_expr);
10255 }
10258 {
10261 capture_init_expr))
10265 }
10267 capture_init_expr
10268 = finish_id_expression
10270 capture_init_expr,
10284 {
10287 }
10288 else
10290 }
10294 {
10299 capture_id);
10303 "capture of %qD redundant with by-reference capture "
10305 }
10308 capture_id,
10309 capture_init_expr,
10311 explicit_init_p);
10312 }
10315 }
10317 /* Parse the (optional) middle of a lambda expression.
10319 lambda-declarator:
10320 < template-parameter-list [opt] >
10321 ( parameter-declaration-clause [opt] )
10322 attribute-specifier [opt]
10323 decl-specifier-seq [opt]
10324 exception-specification [opt]
10325 lambda-return-type-clause [opt]
10327 LAMBDA_EXPR is the current representation of the lambda expression. */
10329 static bool
10331 {
10332 /* 5.1.1.4 of the standard says:
10333 If a lambda-expression does not include a lambda-declarator, it is as if
10334 the lambda-declarator were ().
10335 This means an empty parameter list, no attributes, and no exception
10336 specification. */
10343 cp_decl_specifier_seq lambda_specs;
10346 /* The template-parameter-list is optional, but must begin with
10347 an opening angle if present. */
10349 {
10352 "lambda templates are only available with "
10356 "lambda templates are only available with "
10365 /* We just processed one more parameter list. */
10367 }
10369 /* The parameter-declaration-clause is optional (unless
10370 template-parameter-list was given), but must begin with an
10371 opening parenthesis if present. */
10373 {
10374 matching_parens parens;
10379 /* Parse parameters. */
10382 /* Default arguments shall not be specified in the
10383 parameter-declaration-clause of a lambda-declarator. */
10394 /* In the decl-specifier-seq of the lambda-declarator, each
10395 decl-specifier shall either be mutable or constexpr. */
10399 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10402 {
10407 }
10411 /* Parse optional exception specification. */
10414 /* Parse optional trailing return type. */
10416 {
10419 }
10421 /* The function parameters must be in scope all the way until after the
10422 trailing-return-type in case of decltype. */
10424 }
10428 /* Create the function call operator.
10430 Messing with declarators like this is no uglier than building up the
10431 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10432 other code. */
10433 {
10434 cp_decl_specifier_seq return_type_specs;
10436 tree fco;
10443 else
10444 /* Maybe we will deduce the return type later. */
10448 {
10452 else
10455 }
10464 VIRT_SPEC_UNSPECIFIED,
10465 REF_QUAL_NONE,
10466 tx_qual,
10467 exception_spec,
10473 declarator,
10474 attributes);
10476 {
10479 /* Give the object parameter a different name. */
10483 }
10485 {
10489 }
10498 }
10499 }
10501 /* Parse the body of a lambda expression, which is simply
10503 compound-statement
10505 but which requires special handling.
10506 LAMBDA_EXPR is the current representation of the lambda expression. */
10508 static void
10510 {
10516 else
10517 /* Still increment function_depth so that we don't GC in the
10518 middle of an expression. */
10522 /* Clear this in case we're in the middle of a default argument. */
10526 /* Finish the function call operator
10527 - class_specifier
10528 + late_parsing_for_member
10529 + function_definition_after_declarator
10530 + ctor_initializer_opt_and_function_body */
10531 {
10537 tree compound_stmt;
10539 matching_braces braces;
10545 /* 5.1.1.4 of the standard says:
10546 If a lambda-expression does not include a trailing-return-type, it
10547 is as if the trailing-return-type denotes the following type:
10548 * if the compound-statement is of the form
10549 { return attribute-specifier [opt] expression ; }
10550 the type of the returned expression after lvalue-to-rvalue
10551 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10552 (_conv.array_ 4.2), and function-to-pointer conversion
10553 (_conv.func_ 4.3);
10554 * otherwise, void. */
10556 /* In a lambda that has neither a lambda-return-type-clause
10557 nor a deducible form, errors should be reported for return statements
10558 in the body. Since we used void as the placeholder return type, parsing
10559 the body as usual will give such desired behavior. */
10563 {
10567 /* Parse tentatively in case there's more after the initial return
10568 statement. */
10579 {
10581 {
10586 }
10588 /* Will get error here if type not deduced yet. */
10592 }
10593 }
10596 {
10601 }
10605 out:
10607 }
10614 else
10616 }
10618 /* Statements [gram.stmt.stmt] */
10620 /* Parse a statement.
10622 statement:
10623 labeled-statement
10624 expression-statement
10625 compound-statement
10626 selection-statement
10627 iteration-statement
10628 jump-statement
10629 declaration-statement
10630 try-block
10632 C++11:
10634 statement:
10635 labeled-statement
10636 attribute-specifier-seq (opt) expression-statement
10637 attribute-specifier-seq (opt) compound-statement
10638 attribute-specifier-seq (opt) selection-statement
10639 attribute-specifier-seq (opt) iteration-statement
10640 attribute-specifier-seq (opt) jump-statement
10641 declaration-statement
10642 attribute-specifier-seq (opt) try-block
10644 init-statement:
10645 expression-statement
10646 simple-declaration
10648 TM Extension:
10650 statement:
10651 atomic-statement
10653 IN_COMPOUND is true when the statement is nested inside a
10654 cp_parser_compound_statement; this matters for certain pragmas.
10656 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10657 is a (possibly labeled) if statement which is not enclosed in braces
10658 and has an else clause. This is used to implement -Wparentheses.
10660 CHAIN is a vector of if-else-if conditions. */
10662 static void
10666 {
10671 restart:
10674 /* There is no statement yet. */
10680 /* In obj-c++, seeing '[[' might be the either the beginning of
10681 c++11 attributes, or a nested objc-message-expression. So
10682 let's parse the c++11 attributes tentatively. */
10686 {
10689 }
10691 /* Peek at the next token. */
10693 /* Remember the location of the first token in the statement. */
10695 /* If this is a keyword, then that will often determine what kind of
10696 statement we have. */
10698 {
10702 {
10705 /* Looks like a labeled-statement with a case label.
10706 Parse the label, and then use tail recursion to parse
10707 the statement. */
10730 /* Objective-C++ exception-handling constructs. */
10744 /* This must be a namespace alias definition. */
10760 /* It might be a keyword like `int' that can start a
10761 declaration-statement. */
10763 }
10764 }
10766 {
10767 /* If the next token is a `:', then we are looking at a
10768 labeled-statement. */
10771 {
10772 /* Looks like a labeled-statement with an ordinary label.
10773 Parse the label, and then use tail recursion to parse
10774 the statement. */
10779 }
10780 }
10781 /* Anything that starts with a `{' must be a compound-statement. */
10784 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10785 a statement all its own. */
10787 {
10788 /* Only certain OpenMP pragmas are attached to statements, and thus
10789 are considered statements themselves. All others are not. In
10790 the context of a compound, accept the pragma as a "statement" and
10791 return so that we can check for a close brace. Otherwise we
10792 require a real statement and must go back and read one. */
10798 }
10800 {
10803 }
10805 /* Everything else must be a declaration-statement or an
10806 expression-statement. Try for the declaration-statement
10807 first, unless we are looking at a `;', in which case we know that
10808 we have an expression-statement. */
10810 {
10812 {
10814 {
10815 /* Attributes should be parsed as part of the the
10816 declaration, so let's un-parse them. */
10819 }
10822 /* Try to parse the declaration-statement. */
10824 /* If that worked, we're done. */
10827 }
10828 /* All preceding labels have been parsed at this point. */
10832 /* Look for an expression-statement instead. */
10835 /* Handle [[fallthrough]];. */
10837 {
10838 /* The next token after the fallthrough attribute is ';'. */
10840 {
10841 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10843 IFN_FALLTHROUGH,
10846 }
10847 else
10851 }
10852 }
10854 /* Set the line number for the statement. */
10858 /* Allow "[[fallthrough]];", but warn otherwise. */
10861 OPT_Wattributes,
10863 }
10865 /* Parse the label for a labeled-statement, i.e.
10867 identifier :
10868 case constant-expression :
10869 default :
10871 GNU Extension:
10872 case constant-expression ... constant-expression : statement
10874 When a label is parsed without errors, the label is added to the
10875 parse tree by the finish_* functions, so this function doesn't
10876 have to return the label. */
10878 static void
10880 {
10885 /* The next token should be an identifier. */
10889 {
10892 }
10894 /* Remember whether this case or a user-defined label is allowed to fall
10895 through to. */
10900 {
10902 {
10906 /* Consume the `case' token. */
10908 /* Parse the constant-expression. */
10915 {
10916 /* Consume the `...' token. */
10922 /* We don't need to emit warnings here, as the common code
10923 will do this for us. */
10924 }
10925 else
10929 {
10933 }
10934 else
10937 expr);
10938 }
10942 /* Consume the `default' token. */
10946 {
10950 }
10951 else
10956 /* Anything else must be an ordinary label. */
10961 }
10963 /* Require the `:' token. */
10966 /* An ordinary label may optionally be followed by attributes.
10967 However, this is only permitted if the attributes are then
10968 followed by a semicolon. This is because, for backward
10969 compatibility, when parsing
10970 lab: __attribute__ ((unused)) int i;
10971 we want the attribute to attach to "i", not "lab". */
10974 {
10975 tree attrs;
10982 ;
10983 else
10985 }
10991 }
10993 /* Parse an expression-statement.
10995 expression-statement:
10996 expression [opt] ;
10998 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10999 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11000 indicates whether this expression-statement is part of an
11001 expression statement. */
11003 static tree
11005 {
11010 /* There might be attribute fallthrough. */
11013 /* If the next token is a ';', then there is no expression
11014 statement. */
11016 {
11020 {
11023 }
11024 }
11026 /* Handle [[fallthrough]];. */
11028 {
11029 /* The next token after the fallthrough attribute is ';'. */
11031 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11034 else
11038 }
11040 /* Allow "[[fallthrough]];", but warn otherwise. */
11045 /* Give a helpful message for "A<T>::type t;" and the like. */
11048 {
11055 {
11056 /* A::A a; */
11061 }
11062 }
11064 /* Consume the final `;'. */
11069 /* This is the final expression statement of a statement
11070 expression. */
11076 }
11078 /* Parse a compound-statement.
11080 compound-statement:
11081 { statement-seq [opt] }
11083 GNU extension:
11085 compound-statement:
11086 { label-declaration-seq [opt] statement-seq [opt] }
11088 label-declaration-seq:
11089 label-declaration
11090 label-declaration-seq label-declaration
11092 Returns a tree representing the statement. */
11094 static tree
11097 {
11098 tree compound_stmt;
11099 matching_braces braces;
11101 /* Consume the `{'. */
11108 /* Begin the compound-statement. */
11110 /* If the next keyword is `__label__' we have a label declaration. */
11113 /* Parse an (optional) statement-seq. */
11115 /* Finish the compound-statement. */
11117 /* Consume the `}'. */
11121 }
11123 /* Parse an (optional) statement-seq.
11125 statement-seq:
11126 statement
11127 statement-seq [opt] statement */
11129 static void
11131 {
11132 /* Scan statements until there aren't any more. */
11134 {
11137 /* If we are looking at a `}', then we have run out of
11138 statements; the same is true if we have reached the end
11139 of file, or have stumbled upon a stray '@end'. */
11146 /* If we are in a compound statement and find 'else' then
11147 something went wrong. */
11149 {
11152 else
11153 {
11156 }
11157 }
11159 /* Parse the statement. */
11161 }
11162 }
11164 /* Return true if we're looking at (init; cond), false otherwise. */
11166 static bool
11168 {
11169 /* Save tokens so that we can put them back. */
11172 /* Look for ';' that is not nested in () or {}. */
11175 CPP_SEMICOLON,
11178 /* Roll back the tokens we skipped. */
11182 }
11184 /* Parse a selection-statement.
11186 selection-statement:
11187 if ( init-statement [opt] condition ) statement
11188 if ( init-statement [opt] condition ) statement else statement
11189 switch ( init-statement [opt] condition ) statement
11191 Returns the new IF_STMT or SWITCH_STMT.
11193 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11194 is a (possibly labeled) if statement which is not enclosed in
11195 braces and has an else clause. This is used to implement
11196 -Wparentheses.
11198 CHAIN is a vector of if-else-if conditions. This is used to implement
11199 -Wduplicated-cond. */
11201 static tree
11204 {
11207 token_indent_info guard_tinfo;
11212 /* Peek at the next token. */
11216 /* See what kind of keyword it is. */
11219 {
11222 {
11223 tree statement;
11224 tree condition;
11229 RID_CONSTEXPR))
11230 {
11236 }
11238 /* Look for the `('. */
11239 matching_parens parens;
11241 {
11244 }
11246 /* Begin the selection-statement. */
11248 {
11251 }
11252 else
11255 /* Parse the optional init-statement. */
11257 {
11258 tree decl;
11261 "init-statement in selection statements only available "
11264 }
11266 /* Parse the condition. */
11268 /* Look for the `)'. */
11274 {
11278 /* Add the condition. */
11285 /* Parse the then-clause. */
11289 /* Outside a template, the non-selected branch of a constexpr
11290 if is a 'discarded statement', i.e. unevaluated. */
11295 {
11298 }
11301 guard_tinfo);
11308 {
11312 }
11314 /* If the next token is `else', parse the else-clause. */
11316 RID_ELSE))
11317 {
11321 {
11324 }
11326 guard_tinfo
11328 /* Consume the `else' keyword. */
11331 {
11333 RID_IF)
11335 {
11336 /* We've got "if (COND) else if (COND2)". Start
11337 the condition chain and add COND as the first
11338 element. */
11342 {
11343 /* Wrap it in a NOP_EXPR so that we can set the
11344 location of the condition. */
11346 condition);
11349 }
11350 }
11352 RID_IF))
11353 {
11354 /* This is if-else without subsequent if. Zap the
11355 condition chain; we would have already warned at
11356 this point. */
11359 }
11360 }
11362 /* Parse the else-clause. */
11368 /* If we are currently parsing a then-clause, then
11369 IF_P will not be NULL. We set it to true to
11370 indicate that this if statement has an else clause.
11371 This may trigger the Wparentheses warning below
11372 when we get back up to the parent if statement. */
11377 {
11381 }
11382 }
11383 else
11384 {
11385 /* This if statement does not have an else clause. If
11386 NESTED_IF is true, then the then-clause has an if
11387 statement which does have an else clause. We warn
11388 about the potential ambiguity. */
11391 "suggest explicit braces to avoid ambiguous"
11394 {
11395 /* We don't need the condition chain anymore. */
11398 }
11399 }
11401 /* Now we're all done with the if-statement. */
11403 }
11404 else
11405 {
11409 /* Add the condition. */
11412 /* Parse the body of the switch-statement. */
11418 guard_tinfo);
11422 /* Now we're all done with the switch-statement. */
11424 }
11427 }
11433 }
11434 }
11436 /* Parse a condition.
11438 condition:
11439 expression
11440 type-specifier-seq declarator = initializer-clause
11441 type-specifier-seq declarator braced-init-list
11443 GNU Extension:
11445 condition:
11446 type-specifier-seq declarator asm-specification [opt]
11447 attributes [opt] = assignment-expression
11449 Returns the expression that should be tested. */
11451 static tree
11453 {
11454 cp_decl_specifier_seq type_specifiers;
11458 /* Try the declaration first. */
11460 /* New types are not allowed in the type-specifier-seq for a
11461 condition. */
11463 parser->type_definition_forbidden_message
11465 /* Parse the type-specifier-seq. */
11467 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11470 /* Restore the saved message. */
11472 /* If all is well, we might be looking at a declaration. */
11474 {
11475 tree decl;
11476 tree asm_specification;
11477 tree attributes;
11481 /* Parse the declarator. */
11487 /* Parse the attributes. */
11489 /* Parse the asm-specification. */
11491 /* If the next token is not an `=' or '{', then we might still be
11492 looking at an expression. For example:
11494 if (A(a).x)
11496 looks like a decl-specifier-seq and a declarator -- but then
11497 there is no `=', so this is an expression. */
11502 /* If we did see an `=' or '{', then we are looking at a declaration
11503 for sure. */
11505 {
11506 tree pushed_scope;
11510 /* Create the declaration. */
11516 /* Parse the initializer. */
11518 {
11522 }
11523 else
11524 {
11525 /* Consume the `='. */
11528 }
11532 /* Process the initializer. */
11535 asm_specification,
11536 flags);
11542 }
11543 }
11544 /* If we didn't even get past the declarator successfully, we are
11545 definitely not looking at a declaration. */
11546 else
11549 /* Otherwise, we are looking at an expression. */
11551 }
11553 /* Parses a for-statement or range-for-statement until the closing ')',
11554 not included. */
11556 static tree
11558 {
11562 /* Begin the for-statement. */
11565 /* Parse the initialization. */
11570 else
11572 }
11574 static tree
11576 {
11577 /* Normal for loop */
11580 tree stmt;
11583 /* The init-statement has already been parsed in
11584 cp_parser_init_statement, so no work is needed here. */
11587 /* If there's a condition, process it. */
11591 {
11595 }
11597 /* Look for the `;'. */
11600 /* If there's an expression, process it. */
11606 }
11608 /* Tries to parse a range-based for-statement:
11610 range-based-for:
11611 decl-specifier-seq declarator : expression
11613 The decl-specifier-seq declarator and the `:' are already parsed by
11614 cp_parser_init_statement. If processing_template_decl it returns a
11615 newly created RANGE_FOR_STMT; if not, it is converted to a
11616 regular FOR_STMT. */
11618 static tree
11621 {
11628 /* Get the range declaration momentarily out of the way so that
11629 the range expression doesn't clash with it. */
11631 {
11633 {
11635 /* For decomposition declaration get all of the corresponding
11636 declarations out of the way. */
11640 {
11646 {
11652 }
11653 }
11654 }
11656 {
11661 }
11662 }
11665 {
11668 }
11669 else
11672 /* Put the range declaration(s) back into scope. */
11674 {
11678 }
11680 /* If in template, STMT is converted to a normal for-statement
11681 at instantiation. If not, it is done just ahead. */
11683 {
11691 /* do_auto_deduction doesn't mess with template init-lists. */
11694 }
11695 else
11696 {
11700 }
11702 }
11704 /* Subroutine of cp_convert_range_for: given the initializer expression,
11705 builds up the range temporary. */
11707 static tree
11709 {
11712 /* Find out the type deduced by the declaration
11713 `auto &&__range = range_expr'. */
11718 /* Create the __range variable. */
11725 }
11727 /* Used by cp_parser_range_for in template context: we aren't going to
11728 do a full conversion yet, but we still need to resolve auto in the
11729 type of the for-range-declaration if present. This is basically
11730 a shortcut version of cp_convert_range_for. */
11732 static void
11734 {
11737 {
11740 iter_type = (cp_parser_perform_range_for_lookup
11743 {
11745 iter_type);
11747 RO_UNARY_STAR,
11748 tf_warning_or_error);
11751 }
11752 }
11753 }
11755 /* Converts a range-based for-statement into a normal
11756 for-statement, as per the definition.
11758 for (RANGE_DECL : RANGE_EXPR)
11759 BLOCK
11761 should be equivalent to:
11763 {
11764 auto &&__range = RANGE_EXPR;
11765 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11766 __begin != __end;
11767 ++__begin)
11768 {
11769 RANGE_DECL = *__begin;
11770 BLOCK
11771 }
11772 }
11774 If RANGE_EXPR is an array:
11775 BEGIN_EXPR = __range
11776 END_EXPR = __range + ARRAY_SIZE(__range)
11777 Else if RANGE_EXPR has a member 'begin' or 'end':
11778 BEGIN_EXPR = __range.begin()
11779 END_EXPR = __range.end()
11780 Else:
11781 BEGIN_EXPR = begin(__range)
11782 END_EXPR = end(__range);
11784 If __range has a member 'begin' but not 'end', or vice versa, we must
11785 still use the second alternative (it will surely fail, however).
11786 When calling begin()/end() in the third alternative we must use
11787 argument dependent lookup, but always considering 'std' as an associated
11788 namespace. */
11790 tree
11794 {
11802 /* If an error happened previously do nothing or else a lot of
11803 unhelpful errors would be issued. */
11805 else
11806 {
11807 tree range_temp;
11811 /* Can't bind a reference to an array of runtime bound. */
11813 else
11814 {
11819 LOOKUP_ONLYCONVERTING);
11821 }
11824 }
11826 /* The new for initialization statement. */
11834 LOOKUP_ONLYCONVERTING);
11845 LOOKUP_ONLYCONVERTING);
11849 /* The new for condition. */
11856 /* The new increment expression. */
11859 tf_warning_or_error);
11862 /* The declaration is initialized with *__begin inside the loop body. */
11865 tf_warning_or_error),
11867 LOOKUP_ONLYCONVERTING);
11872 }
11874 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11875 We need to solve both at the same time because the method used
11876 depends on the existence of members begin or end.
11877 Returns the type deduced for the iterator expression. */
11879 static tree
11881 {
11883 {
11886 }
11889 {
11894 }
11896 {
11897 /* If RANGE is an array, we will use pointer arithmetic. */
11900 range,
11904 }
11905 else
11906 {
11907 /* If it is not an array, we must do a bit of magic. */
11917 tf_warning_or_error);
11920 tf_warning_or_error);
11923 {
11924 /* Use the member functions. */
11927 else
11933 else
11936 }
11937 else
11938 {
11939 /* Use global functions with ADL. */
11946 tf_warning_or_error);
11948 tf_warning_or_error);
11950 tf_warning_or_error);
11952 tf_warning_or_error);
11955 }
11957 /* Last common checks. */
11959 {
11960 /* If one of the expressions is an error do no more checks. */
11963 }
11966 /* Can happen, when, eg, in a template context, Koenig lookup
11967 can't resolve begin/end (c++/58503). */
11969 else
11970 {
11972 /* The unqualified type of the __begin and __end temporaries should
11973 be the same, as required by the multiple auto declaration. */
11975 {
11982 /* P0184R0 allows __begin and __end to have different types,
11983 but make sure they are comparable so we can give a better
11985 else
11989 }
11991 }
11992 }
11993 }
11995 /* Helper function for cp_parser_perform_range_for_lookup.
11996 Builds a tree for RANGE.IDENTIFIER(). */
11998 static tree
12000 {
12013 tf_warning_or_error);
12016 }
12018 /* Parse an iteration-statement.
12020 iteration-statement:
12021 while ( condition ) statement
12022 do statement while ( expression ) ;
12023 for ( init-statement condition [opt] ; expression [opt] )
12024 statement
12026 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12028 static tree
12030 {
12033 tree statement;
12035 token_indent_info guard_tinfo;
12037 /* Peek at the next token. */
12044 /* Remember whether or not we are already within an iteration
12045 statement. */
12048 /* See what kind of keyword it is. */
12051 {
12053 {
12054 tree condition;
12056 /* Begin the while-statement. */
12058 /* Look for the `('. */
12059 matching_parens parens;
12061 /* Parse the condition. */
12064 /* Look for the `)'. */
12066 /* Parse the dependent statement. */
12072 /* We're done with the while-statement. */
12074 }
12078 {
12079 tree expression;
12081 /* Begin the do-statement. */
12083 /* Parse the body of the do-statement. */
12090 /* Look for the `while' keyword. */
12092 /* Look for the `('. */
12093 matching_parens parens;
12095 /* Parse the expression. */
12097 /* We're done with the do-statement. */
12099 /* Look for the `)'. */
12101 /* Look for the `;'. */
12103 }
12107 {
12108 /* Look for the `('. */
12109 matching_parens parens;
12114 /* Look for the `)'. */
12117 /* Parse the body of the for-statement. */
12124 /* We're done with the for-statement. */
12126 }
12133 }
12136 }
12138 /* Parse a init-statement or the declarator of a range-based-for.
12139 Returns true if a range-based-for declaration is seen.
12141 init-statement:
12142 expression-statement
12143 simple-declaration */
12145 static bool
12147 {
12148 /* If the next token is a `;', then we have an empty
12149 expression-statement. Grammatically, this is also a
12150 simple-declaration, but an invalid one, because it does not
12151 declare anything. Therefore, if we did not handle this case
12152 specially, we would issue an error message about an invalid
12153 declaration. */
12155 {
12159 /* A colon is used in range-based for. */
12162 /* We're going to speculatively look for a declaration, falling back
12163 to an expression, if necessary. */
12165 /* Parse the declaration. */
12168 decl);
12171 {
12172 /* It is a range-for, consume the ':' */
12176 {
12178 "range-based %<for%> loops only available with "
12181 }
12182 }
12183 else
12184 /* The ';' is not consumed yet because we told
12185 cp_parser_simple_declaration not to. */
12190 /* If the tentative parse failed, then we shall need to look for an
12191 expression-statement. */
12192 }
12193 /* If we are here, it is an expression-statement. */
12196 }
12198 /* Parse a jump-statement.
12200 jump-statement:
12201 break ;
12202 continue ;
12203 return expression [opt] ;
12204 return braced-init-list ;
12205 goto identifier ;
12207 GNU extension:
12209 jump-statement:
12210 goto * expression ;
12212 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12214 static tree
12216 {
12222 /* Peek at the next token. */
12227 /* See what kind of keyword it is. */
12230 {
12234 {
12251 }
12257 {
12261 /* Fall through. */
12271 }
12276 {
12277 tree expr;
12281 {
12285 }
12288 else
12289 /* If the next token is a `;', then there is no
12290 expression. */
12292 /* Build the return-statement. */
12295 else
12297 /* Look for the final `;'. */
12299 }
12305 {
12308 }
12310 /* Create the goto-statement. */
12312 {
12313 /* Issue a warning about this use of a GNU extension. */
12315 /* Consume the '*' token. */
12317 /* Parse the dependent expression. */
12319 }
12320 else
12322 /* Look for the final `;'. */
12329 }
12332 }
12334 /* Parse a declaration-statement.
12336 declaration-statement:
12337 block-declaration */
12339 static void
12341 {
12344 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12347 /* Parse the block-declaration. */
12350 /* Free any declarators allocated. */
12352 }
12354 /* Some dependent statements (like `if (cond) statement'), are
12355 implicitly in their own scope. In other words, if the statement is
12356 a single statement (as opposed to a compound-statement), it is
12357 none-the-less treated as if it were enclosed in braces. Any
12358 declarations appearing in the dependent statement are out of scope
12359 after control passes that point. This function parses a statement,
12360 but ensures that is in its own scope, even if it is not a
12361 compound-statement.
12363 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12364 is a (possibly labeled) if statement which is not enclosed in
12365 braces and has an else clause. This is used to implement
12366 -Wparentheses.
12368 CHAIN is a vector of if-else-if conditions. This is used to implement
12369 -Wduplicated-cond.
12371 Returns the new statement. */
12373 static tree
12377 {
12378 tree statement;
12381 token_indent_info body_tinfo
12387 /* Mark if () ; with a special NOP_EXPR. */
12389 {
12400 }
12401 /* if a compound is opened, we simply parse the statement directly. */
12404 /* If the token is not a `{', then we must take special action. */
12405 else
12406 {
12407 /* Create a compound-statement. */
12409 /* Parse the dependent-statement. */
12412 /* Finish the dummy compound-statement. */
12414 }
12416 token_indent_info next_tinfo
12425 /* Return the statement. */
12427 }
12429 /* For some dependent statements (like `while (cond) statement'), we
12430 have already created a scope. Therefore, even if the dependent
12431 statement is a compound-statement, we do not want to create another
12432 scope. */
12434 static void
12437 {
12438 /* If the token is a `{', then we must take special action. */
12440 {
12441 token_indent_info body_tinfo
12447 token_indent_info next_tinfo
12456 }
12457 else
12458 {
12459 /* Avoid calling cp_parser_compound_statement, so that we
12460 don't create a new scope. Do everything else by hand. */
12461 matching_braces braces;
12463 /* If the next keyword is `__label__' we have a label declaration. */
12466 /* Parse an (optional) statement-seq. */
12469 }
12470 }
12472 /* Declarations [gram.dcl.dcl] */
12474 /* Parse an optional declaration-sequence.
12476 declaration-seq:
12477 declaration
12478 declaration-seq declaration */
12480 static void
12482 {
12484 {
12495 {
12496 /* A declaration consisting of a single semicolon is
12497 invalid. Allow it unless we're being pedantic. */
12502 }
12504 /* If we're entering or exiting a region that's implicitly
12505 extern "C", modify the lang context appropriately. */
12507 {
12510 }
12512 {
12515 }
12518 {
12519 /* A top-level declaration can consist solely of a #pragma.
12520 A nested declaration cannot, so this is done here and not
12521 in cp_parser_declaration. (A #pragma at block scope is
12522 handled in cp_parser_statement.) */
12525 }
12527 /* Parse the declaration itself. */
12529 }
12530 }
12532 /* Parse a declaration.
12534 declaration:
12535 block-declaration
12536 function-definition
12537 template-declaration
12538 explicit-instantiation
12539 explicit-specialization
12540 linkage-specification
12541 namespace-definition
12543 C++17:
12544 deduction-guide
12546 GNU extension:
12548 declaration:
12549 __extension__ declaration */
12551 static void
12553 {
12554 cp_token token1;
12555 cp_token token2;
12560 /* Check for the `__extension__' keyword. */
12562 {
12563 /* Parse the qualified declaration. */
12565 /* Restore the PEDANTIC flag. */
12569 }
12571 /* Try to figure out what kind of declaration is present. */
12576 else
12577 {
12580 }
12582 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12585 /* If the next token is `extern' and the following token is a string
12586 literal, then we have a linkage specification. */
12590 /* If the next token is `template', then we have either a template
12591 declaration, an explicit instantiation, or an explicit
12592 specialization. */
12594 {
12595 /* `template <>' indicates a template specialization. */
12599 /* `template <' indicates a template declaration. */
12602 /* Anything else must be an explicit instantiation. */
12603 else
12605 }
12606 /* If the next token is `export', then we have a template
12607 declaration. */
12610 /* If the next token is `extern', 'static' or 'inline' and the one
12611 after that is `template', we have a GNU extended explicit
12612 instantiation directive. */
12619 /* If the next token is `namespace', check for a named or unnamed
12620 namespace definition. */
12629 /* An unnamed namespace definition. */
12633 /* An inline (associated) namespace definition. */
12637 /* Objective-C++ declaration/definition. */
12644 /* At this point we may have a template declared by a concept
12645 introduction. */
12650 else
12651 /* Try to parse a block-declaration, or a function-definition. */
12654 /* Free any declarators allocated. */
12656 }
12658 /* Parse a block-declaration.
12660 block-declaration:
12661 simple-declaration
12662 asm-definition
12663 namespace-alias-definition
12664 using-declaration
12665 using-directive
12667 GNU Extension:
12669 block-declaration:
12670 __extension__ block-declaration
12672 C++0x Extension:
12674 block-declaration:
12675 static_assert-declaration
12677 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12678 part of a declaration-statement. */
12680 static void
12683 {
12687 /* Check for the `__extension__' keyword. */
12689 {
12690 /* Parse the qualified declaration. */
12692 /* Restore the PEDANTIC flag. */
12696 }
12698 /* Peek at the next token to figure out which kind of declaration is
12699 present. */
12702 /* If the next keyword is `asm', we have an asm-definition. */
12704 {
12708 }
12709 /* If the next keyword is `namespace', we have a
12710 namespace-alias-definition. */
12713 /* If the next keyword is `using', we have a
12714 using-declaration, a using-directive, or an alias-declaration. */
12716 {
12721 /* If the token after `using' is `namespace', then we have a
12722 using-directive. */
12726 /* If the second token after 'using' is '=', then we have an
12727 alias-declaration. */
12733 /* Otherwise, it's a using-declaration. */
12734 else
12737 }
12738 /* If the next keyword is `__label__' we have a misplaced label
12739 declaration. */
12741 {
12745 /* If the next token is now a `;', consume it. */
12748 }
12749 /* If the next token is `static_assert' we have a static assertion. */
12752 /* Anything else must be a simple-declaration. */
12753 else
12756 }
12758 /* Parse a simple-declaration.
12760 simple-declaration:
12761 decl-specifier-seq [opt] init-declarator-list [opt] ;
12762 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12763 brace-or-equal-initializer ;
12765 init-declarator-list:
12766 init-declarator
12767 init-declarator-list , init-declarator
12769 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12770 function-definition as a simple-declaration.
12772 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12773 parsed declaration if it is an uninitialized single declarator not followed
12774 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12775 if present, will not be consumed. */
12777 static void
12781 {
12782 cp_decl_specifier_seq decl_specifiers;
12791 /* Defer access checks until we know what is being declared; the
12792 checks for names appearing in the decl-specifier-seq should be
12793 done as if we were in the scope of the thing being declared. */
12796 /* Parse the decl-specifier-seq. We have to keep track of whether
12797 or not the decl-specifier-seq declares a named class or
12798 enumeration type, since that is the only case in which the
12799 init-declarator-list is allowed to be empty.
12801 [dcl.dcl]
12803 In a simple-declaration, the optional init-declarator-list can be
12804 omitted only when declaring a class or enumeration, that is when
12805 the decl-specifier-seq contains either a class-specifier, an
12806 elaborated-type-specifier, or an enum-specifier. */
12808 CP_PARSER_FLAGS_OPTIONAL,
12811 /* We no longer need to defer access checks. */
12814 /* In a block scope, a valid declaration must always have a
12815 decl-specifier-seq. By not trying to parse declarators, we can
12816 resolve the declaration/expression ambiguity more quickly. */
12819 {
12822 }
12824 /* If the next two tokens are both identifiers, the code is
12825 erroneous. The usual cause of this situation is code like:
12827 T t;
12829 where "T" should name a type -- but does not. */
12832 {
12833 /* If parsing tentatively, we should commit; we really are
12834 looking at a declaration. */
12836 /* Give up. */
12838 }
12840 /* If we have seen at least one decl-specifier, and the next token
12841 is not a parenthesis, then we must be looking at a declaration.
12842 (After "int (" we might be looking at a functional cast.) */
12849 /* Look for C++17 decomposition declaration. */
12857 {
12858 tree decl
12860 maybe_range_for_decl,
12863 /* The next token should be either a `,' or a `;'. */
12865 /* If it's a `;', we are done. */
12868 /* Anything else is an error. */
12869 else
12870 {
12871 /* If we have already issued an error message we don't need
12872 to issue another one. */
12877 /* Skip tokens until we reach the end of the statement. */
12879 /* If the next token is now a `;', consume it. */
12883 }
12884 }
12885 else
12888 tree last_type;
12890 /* NULL_TREE if both variable and function declaration are allowed,
12891 error_mark_node if function declaration are not allowed and
12892 a FUNCTION_DECL that should be diagnosed if it is followed by
12893 variable declarations. */
12894 tree auto_function_declaration;
12897 auto_specifier_p
12901 /* Keep going until we hit the `;' at the end of the simple
12902 declaration. */
12905 CPP_SEMICOLON))
12906 {
12909 tree decl;
12913 {
12914 /* If we are processing next declarator, comma is expected */
12919 {
12923 }
12924 }
12925 else
12928 /* Parse the init-declarator. */
12931 function_definition_allowed_p,
12933 declares_class_or_enum,
12935 maybe_range_for_decl,
12938 /* If an error occurred while parsing tentatively, exit quickly.
12939 (That usually happens when in the body of a function; each
12940 statement is treated as a declaration-statement until proven
12941 otherwise.) */
12946 {
12947 /* If the init-declarator-list contains more than one
12948 init-declarator, they shall all form declarations of
12949 variables. */
12951 auto_function_declaration
12955 {
12957 "non-variable %qD in declaration with more than one "
12962 }
12963 }
12967 {
12971 {
12972 /* If the list of declarators contains more than one declarator,
12973 the type of each declared variable is determined as described
12974 above. If the type deduced for the template parameter U is not
12975 the same in each deduction, the program is ill-formed. */
12980 }
12981 else
12983 }
12985 /* Handle function definitions specially. */
12987 {
12988 /* If the next token is a `,', then we are probably
12989 processing something like:
12991 void f() {}, *p;
12993 which is erroneous. */
12995 {
12998 "mixing"
13000 }
13001 /* Otherwise, we're done with the list of declarators. */
13002 else
13003 {
13006 }
13007 }
13010 /* The next token should be either a `,' or a `;'. */
13012 /* If it's a `,', there are more declarators to come. */
13015 /* If it's a `;', we are done. */
13019 {
13024 }
13025 /* Anything else is an error. */
13026 else
13027 {
13028 /* If we have already issued an error message we don't need
13029 to issue another one. */
13034 /* Skip tokens until we reach the end of the statement. */
13036 /* If the next token is now a `;', consume it. */
13040 }
13041 /* After the first time around, a function-definition is not
13042 allowed -- even if it was OK at first. For example:
13044 int i, f() {}
13046 is not valid. */
13048 }
13050 /* Issue an error message if no declarators are present, and the
13051 decl-specifier-seq does not itself declare a class or
13052 enumeration: [dcl.dcl]/3. */
13054 {
13056 {
13060 /* Ensure an error is issued anyway when finish_decltype_type,
13061 called via cp_parser_decl_specifier_seq, returns a class or
13062 an enumeration (c++/51786). */
13065 }
13066 /* Perform any deferred access checks. */
13068 }
13070 /* Consume the `;'. */
13071 finish:
13075 {
13081 }
13083 done:
13085 }
13087 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13088 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13089 initializer ; */
13091 static tree
13096 {
13101 /* Parse the identifier-list. */
13105 {
13113 }
13117 {
13123 else
13124 {
13127 }
13128 }
13134 tree pushed_scope;
13141 NULL_TREE);
13148 cp_expr e;
13149 cp_decl_specifier_seq decl_specs;
13154 {
13157 else
13160 tree elt_pushed_scope;
13166 {
13167 /* Ensure we've diagnosed redeclaration if we aren't creating
13168 a new VAR_DECL. */
13171 }
13172 else
13176 }
13179 {
13182 }
13186 {
13194 || (is_direct_init
13197 {
13201 }
13204 {
13208 }
13209 }
13211 {
13213 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13214 the underlying DECL. */
13216 }
13222 {
13225 }
13228 }
13230 /* Parse a decl-specifier-seq.
13232 decl-specifier-seq:
13233 decl-specifier-seq [opt] decl-specifier
13234 decl-specifier attribute-specifier-seq [opt] (C++11)
13236 decl-specifier:
13237 storage-class-specifier
13238 type-specifier
13239 function-specifier
13240 friend
13241 typedef
13243 GNU Extension:
13245 decl-specifier:
13246 attributes
13248 Concepts Extension:
13250 decl-specifier:
13251 concept
13253 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13255 The parser flags FLAGS is used to control type-specifier parsing.
13257 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13258 flags:
13260 1: one of the decl-specifiers is an elaborated-type-specifier
13261 (i.e., a type declaration)
13262 2: one of the decl-specifiers is an enum-specifier or a
13263 class-specifier (i.e., a type definition)
13265 */
13267 static void
13269 cp_parser_flags flags,
13272 {
13276 cp_decl_spec ds;
13278 /* Clear DECL_SPECS. */
13281 /* Assume no class or enumeration type is declared. */
13284 /* Keep reading specifiers until there are no more to read. */
13286 {
13291 /* Peek at the next token. */
13294 /* Save the first token of the decl spec list for error
13295 reporting. */
13298 /* Handle attributes. */
13300 {
13301 /* Parse the attributes. */
13304 /* In a sequence of declaration specifiers, c++11 attributes
13305 appertain to the type that precede them. In that case
13306 [dcl.spec]/1 says:
13308 The attribute-specifier-seq affects the type only for
13309 the declaration it appears in, not other declarations
13310 involving the same type.
13312 But for now let's force the user to position the
13313 attribute either at the beginning of the declaration or
13314 after the declarator-id, which would clearly mean that it
13315 applies to the declarator. */
13317 {
13319 /* The c++11 attribute is at the beginning of the
13320 declaration. It appertains to the entity being
13322 else
13323 {
13325 {
13326 /* This is an attribute following a
13327 class-specifier. */
13332 }
13333 else
13334 {
13335 decl_specs->std_attributes
13337 attrs);
13340 }
13342 }
13343 }
13345 decl_specs->attributes
13347 attrs);
13351 }
13352 /* Assume we will find a decl-specifier keyword. */
13354 /* If the next token is an appropriate keyword, we can simply
13355 add it to the list. */
13357 {
13358 /* decl-specifier:
13359 friend
13360 constexpr */
13363 {
13368 }
13369 else
13370 {
13372 /* Consume the token. */
13374 }
13387 /* function-specifier:
13388 inline
13389 virtual
13390 explicit */
13397 /* decl-specifier:
13398 typedef */
13401 /* Consume the token. */
13403 /* A constructor declarator cannot appear in a typedef. */
13405 /* The "typedef" keyword can only occur in a declaration; we
13406 may as well commit at this point. */
13413 /* storage-class-specifier:
13414 auto
13415 register
13416 static
13417 extern
13418 mutable
13420 GNU Extension:
13421 thread */
13424 {
13425 /* Consume the token. */
13428 /* Complain about `auto' as a storage specifier, if
13429 we're complaining about C++0x compatibility. */
13433 "%<auto%> changes meaning in C++11; "
13436 /* Set the storage class anyway. */
13438 token);
13439 }
13440 else
13441 /* C++0x auto type-specifier. */
13449 /* Consume the token. */
13452 token);
13455 /* Consume the token. */
13461 /* We did not yet find a decl-specifier yet. */
13464 }
13481 /* Constructors are a special case. The `S' in `S()' is not a
13482 decl-specifier; it is the beginning of the declarator. */
13483 constructor_p
13484 = (!found_decl_spec
13485 && constructor_possible_p
13486 && (cp_parser_constructor_declarator_p
13489 /* If we don't have a DECL_SPEC yet, then we must be looking at
13490 a type-specifier. */
13492 {
13495 tree type_spec;
13497 type_spec
13499 decl_specs,
13505 /* If this type-specifier referenced a user-defined type
13506 (a typedef, class-name, etc.), then we can't allow any
13507 more such type-specifiers henceforth.
13509 [dcl.spec]
13511 The longest sequence of decl-specifiers that could
13512 possibly be a type name is taken as the
13513 decl-specifier-seq of a declaration. The sequence shall
13514 be self-consistent as described below.
13516 [dcl.type]
13518 As a general rule, at most one type-specifier is allowed
13519 in the complete decl-specifier-seq of a declaration. The
13520 only exceptions are the following:
13522 -- const or volatile can be combined with any other
13523 type-specifier.
13525 -- signed or unsigned can be combined with char, long,
13526 short, or int.
13528 -- ..
13530 Example:
13532 typedef char* Pc;
13533 void g (const int Pc);
13535 Here, Pc is *not* part of the decl-specifier seq; it's
13536 the declarator. Therefore, once we see a type-specifier
13537 (other than a cv-qualifier), we forbid any additional
13538 user-defined types. We *do* still allow things like `int
13539 int' to be considered a decl-specifier-seq, and issue the
13540 error message later. */
13543 /* A constructor declarator cannot follow a type-specifier. */
13545 {
13550 }
13551 }
13553 /* If we still do not have a DECL_SPEC, then there are no more
13554 decl-specifiers. */
13559 /* After we see one decl-specifier, further decl-specifiers are
13560 always optional. */
13562 }
13564 /* Don't allow a friend specifier with a class definition. */
13569 }
13571 /* Parse an (optional) storage-class-specifier.
13573 storage-class-specifier:
13574 auto
13575 register
13576 static
13577 extern
13578 mutable
13580 GNU Extension:
13582 storage-class-specifier:
13583 thread
13585 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13587 static tree
13589 {
13591 {
13595 /* Fall through for C++98. */
13603 /* Consume the token. */
13608 }
13609 }
13611 /* Parse an (optional) function-specifier.
13613 function-specifier:
13614 inline
13615 virtual
13616 explicit
13618 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13619 Updates DECL_SPECS, if it is non-NULL. */
13621 static tree
13624 {
13627 {
13633 /* 14.5.2.3 [temp.mem]
13635 A member function template shall not be virtual. */
13639 else
13649 }
13651 /* Consume the token. */
13653 }
13655 /* Parse a linkage-specification.
13657 linkage-specification:
13658 extern string-literal { declaration-seq [opt] }
13659 extern string-literal declaration */
13661 static void
13663 {
13664 tree linkage;
13666 /* Look for the `extern' keyword. */
13667 cp_token *extern_token
13670 /* Look for the string-literal. */
13674 /* Transform the literal into an identifier. If the literal is a
13675 wide-character string, or contains embedded NULs, then we can't
13676 handle it as the user wants. */
13679 {
13681 /* Assume C++ linkage. */
13683 }
13684 else
13687 /* We're now using the new linkage. */
13690 /* Preserve the location of the the innermost linkage specification,
13691 tracking the locations of nested specifications via a local. */
13692 location_t saved_location
13694 /* Construct a location ranging from the start of the "extern" to
13695 the end of the string-literal, with the caret at the start, e.g.:
13696 extern "C" {
13697 ^~~~~~~~~~
13698 */
13699 parser->innermost_linkage_specification_location
13704 /* If the next token is a `{', then we're using the first
13705 production. */
13707 {
13711 /* Consume the `{' token. */
13712 matching_braces braces;
13714 /* Parse the declarations. */
13716 /* Look for the closing `}'. */
13718 }
13719 /* Otherwise, there's just one declaration. */
13720 else
13721 {
13724 saved_in_unbraced_linkage_specification_p
13728 parser->in_unbraced_linkage_specification_p
13730 }
13732 /* We're done with the linkage-specification. */
13735 /* Restore location of parent linkage specification, if any. */
13737 }
13739 /* Parse a static_assert-declaration.
13741 static_assert-declaration:
13742 static_assert ( constant-expression , string-literal ) ;
13743 static_assert ( constant-expression ) ; (C++17)
13745 If MEMBER_P, this static_assert is a class member. */
13747 static void
13749 {
13750 cp_expr condition;
13751 location_t token_loc;
13752 tree message;
13755 /* Peek at the `static_assert' token so we can keep track of exactly
13756 where the static assertion started. */
13759 /* Look for the `static_assert' keyword. */
13761 RT_STATIC_ASSERT))
13764 /* We know we are in a static assertion; commit to any tentative
13765 parse. */
13769 /* Parse the `(' starting the static assertion condition. */
13770 matching_parens parens;
13773 /* Parse the constant-expression. Allow a non-constant expression
13774 here in order to give better diagnostics in finish_static_assert. */
13775 condition =
13781 {
13784 "static_assert without a message "
13786 /* Eat the ')' */
13791 }
13792 else
13793 {
13794 /* Parse the separating `,'. */
13797 /* Parse the string-literal message. */
13802 /* A `)' completes the static assertion. */
13808 }
13810 /* A semicolon terminates the declaration. */
13813 /* Get the location for the static assertion. Use that of the
13814 condition if available, otherwise, use that of the "static_assert"
13815 token. */
13820 /* Complete the static assertion, which may mean either processing
13821 the static assert now or saving it for template instantiation. */
13823 }
13825 /* Parse the expression in decltype ( expression ). */
13827 static tree
13830 {
13832 tree expr;
13834 /* Since we're going to preserve any side-effects from this parse, set up a
13835 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13836 in the expression. */
13839 /* First, try parsing an id-expression. */
13850 {
13853 cp_id_kind idk;
13857 /* Lookup the name we got back from the id-expression. */
13867 {
13868 /* Complete lookup of the id-expression. */
13869 expr = (finish_id_expression
13882 /* We found an id-expression, but it was something that we
13883 should not have found. This is an error, not something
13884 we can recover from, so note that we found an
13885 id-expression and we'll recover as gracefully as
13886 possible. */
13888 }
13893 /* We have an id-expression. */
13895 }
13898 {
13899 /* Abort the id-expression parse. */
13902 /* Parsing tentatively, again. */
13905 /* Parse a class member access. */
13913 /* We have an id-expression. */
13915 }
13918 /* We have parsed the complete id-expression or member access. */
13920 else
13921 {
13922 /* Abort our attempt to parse an id-expression or member access
13923 expression. */
13926 /* Parse a full expression. */
13929 }
13932 }
13934 /* Parse a `decltype' type. Returns the type.
13936 simple-type-specifier:
13937 decltype ( expression )
13938 C++14 proposal:
13939 decltype ( auto ) */
13941 static tree
13943 {
13944 tree expr;
13953 {
13954 /* Already parsed. */
13957 }
13959 /* Look for the `decltype' token. */
13963 /* Parse the opening `('. */
13964 matching_parens parens;
13968 /* decltype (auto) */
13971 {
13978 }
13980 /* Types cannot be defined in a `decltype' expression. Save away the
13981 old message. */
13984 /* And create the new one. */
13985 parser->type_definition_forbidden_message
13988 /* The restrictions on constant-expressions do not apply inside
13989 decltype expressions. */
13990 saved_integral_constant_expression_p
13992 saved_non_integral_constant_expression_p
13996 /* Within a parenthesized expression, a `>' token is always
13997 the greater-than operator. */
13998 saved_greater_than_is_operator_p
14002 /* Do not actually evaluate the expression. */
14005 /* Do not warn about problems with the expression. */
14010 /* Go back to evaluating expressions. */
14014 /* The `>' token might be the end of a template-id or
14015 template-parameter-list now. */
14016 parser->greater_than_is_operator_p
14019 /* Restore the old message and the integral constant expression
14020 flags. */
14022 parser->integral_constant_expression_p
14024 parser->non_integral_constant_expression_p
14027 /* Parse to the closing `)'. */
14029 {
14033 }
14036 tf_warning_or_error);
14038 rewrite:
14039 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14040 it again. */
14049 }
14051 /* Special member functions [gram.special] */
14053 /* Parse a conversion-function-id.
14055 conversion-function-id:
14056 operator conversion-type-id
14058 Returns an IDENTIFIER_NODE representing the operator. */
14060 static tree
14062 {
14063 tree type;
14064 tree saved_scope;
14065 tree saved_qualifying_scope;
14066 tree saved_object_scope;
14069 /* Look for the `operator' token. */
14072 /* When we parse the conversion-type-id, the current scope will be
14073 reset. However, we need that information in able to look up the
14074 conversion function later, so we save it here. */
14078 /* We must enter the scope of the class so that the names of
14079 entities declared within the class are available in the
14080 conversion-type-id. For example, consider:
14082 struct S {
14083 typedef int I;
14084 operator I();
14085 };
14087 S::operator I() { ... }
14089 In order to see that `I' is a type-name in the definition, we
14090 must be in the scope of `S'. */
14093 /* Parse the conversion-type-id. */
14095 /* Leave the scope of the class, if any. */
14098 /* Restore the saved scope. */
14102 /* If the TYPE is invalid, indicate failure. */
14106 }
14108 /* Parse a conversion-type-id:
14110 conversion-type-id:
14111 type-specifier-seq conversion-declarator [opt]
14113 Returns the TYPE specified. */
14115 static tree
14117 {
14118 tree attributes;
14119 cp_decl_specifier_seq type_specifiers;
14121 tree type_specified;
14124 /* Parse the attributes. */
14128 parser->type_definition_forbidden_message
14131 /* Parse the type-specifiers. */
14138 /* If that didn't work, stop. */
14141 /* Parse the conversion-declarator. */
14149 /* Don't give this error when parsing tentatively. This happens to
14150 work because we always parse this definitively once. */
14153 {
14155 {
14158 }
14162 }
14165 }
14167 /* Parse an (optional) conversion-declarator.
14169 conversion-declarator:
14170 ptr-operator conversion-declarator [opt]
14172 */
14176 {
14179 cp_cv_quals cv_quals;
14181 /* We don't know if there's a ptr-operator next, or not. */
14183 /* Try the ptr-operator. */
14186 /* If it worked, look for more conversion-declarators. */
14188 {
14191 /* Parse another optional declarator. */
14194 declarator = cp_parser_make_indirect_declarator
14198 }
14201 }
14203 /* Parse an (optional) ctor-initializer.
14205 ctor-initializer:
14206 : mem-initializer-list */
14208 static void
14210 {
14211 /* If the next token is not a `:', then there is no
14212 ctor-initializer. */
14214 {
14215 /* Do default initialization of any bases and members. */
14219 }
14221 /* Consume the `:' token. */
14223 /* And the mem-initializer-list. */
14225 }
14227 /* Parse a mem-initializer-list.
14229 mem-initializer-list:
14230 mem-initializer ... [opt]
14231 mem-initializer ... [opt] , mem-initializer-list */
14233 static void
14235 {
14240 /* Let the semantic analysis code know that we are starting the
14241 mem-initializer-list. */
14246 /* Loop through the list. */
14248 {
14249 tree mem_initializer;
14252 /* Parse the mem-initializer. */
14254 /* If the next token is a `...', we're expanding member initializers. */
14256 {
14257 /* Consume the `...'. */
14260 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14261 can be expanded but members cannot. */
14264 {
14269 }
14271 /* Construct the pack expansion type. */
14274 }
14277 {
14281 }
14282 /* Look for a target constructor. */
14286 {
14289 {
14293 }
14295 }
14296 /* Add it to the list, unless it was erroneous. */
14298 {
14301 }
14302 /* If the next token is not a `,', we're done. */
14305 /* Consume the `,' token. */
14307 }
14309 /* Perform semantic analysis. */
14312 }
14314 /* Parse a mem-initializer.
14316 mem-initializer:
14317 mem-initializer-id ( expression-list [opt] )
14318 mem-initializer-id braced-init-list
14320 GNU extension:
14322 mem-initializer:
14323 ( expression-list [opt] )
14325 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14326 class) or FIELD_DECL (for a non-static data member) to initialize;
14327 the TREE_VALUE is the expression-list. An empty initialization
14328 list is represented by void_list_node. */
14330 static tree
14332 {
14333 tree mem_initializer_id;
14334 tree expression_list;
14335 tree member;
14338 /* Find out what is being initialized. */
14340 {
14344 }
14345 else
14346 {
14350 }
14356 {
14363 }
14364 else
14365 {
14375 }
14385 }
14387 /* Parse a mem-initializer-id.
14389 mem-initializer-id:
14390 :: [opt] nested-name-specifier [opt] class-name
14391 decltype-specifier (C++11)
14392 identifier
14394 Returns a TYPE indicating the class to be initialized for the first
14395 production (and the second in C++11). Returns an IDENTIFIER_NODE
14396 indicating the data member to be initialized for the last production. */
14398 static tree
14400 {
14404 tree id;
14408 /* `typename' is not allowed in this context ([temp.res]). */
14410 {
14412 "keyword %<typename%> not allowed in this context (a qualified "
14415 }
14416 /* Look for the optional `::' operator. */
14417 global_scope_p
14421 /* Look for the optional nested-name-specifier. The simplest way to
14422 implement:
14424 [temp.res]
14426 The keyword `typename' is not permitted in a base-specifier or
14427 mem-initializer; in these contexts a qualified name that
14428 depends on a template-parameter is implicitly assumed to be a
14429 type name.
14431 is to assume that we have seen the `typename' keyword at this
14432 point. */
14433 nested_name_specifier_p
14442 /* If there is a `::' operator or a nested-name-specifier, then we
14443 are definitely looking for a class-name. */
14448 typename_type,
14452 /* Otherwise, we could also be looking for an ordinary identifier. */
14455 /* Try a decltype-specifier. */
14457 else
14458 /* Otherwise, try a class-name. */
14462 none_type,
14466 /* If we found one, we're done. */
14469 /* Otherwise, look for an ordinary identifier. */
14471 }
14473 /* Overloading [gram.over] */
14475 /* Parse an operator-function-id.
14477 operator-function-id:
14478 operator operator
14480 Returns an IDENTIFIER_NODE for the operator which is a
14481 human-readable spelling of the identifier, e.g., `operator +'. */
14483 static cp_expr
14485 {
14486 /* Look for the `operator' keyword. */
14489 /* And then the name of the operator itself. */
14491 }
14493 /* Return an identifier node for a user-defined literal operator.
14494 The suffix identifier is chained to the operator name identifier. */
14496 tree
14498 {
14499 tree identifier;
14506 }
14508 /* Parse an operator.
14510 operator:
14511 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14512 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14513 || ++ -- , ->* -> () []
14515 GNU Extensions:
14517 operator:
14518 <? >? <?= >?=
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 {
14530 /* Peek at the next token. */
14535 /* Figure out which operator we have. */
14540 {
14542 {
14543 /* The keyword should be either `new' or `delete'. */
14548 else
14551 /* Consume the `new' or `delete' token. */
14554 /* Peek at the next token. */
14556 /* If it's a `[' token then this is the array variant of the
14557 operator. */
14559 {
14560 /* Consume the `[' token. */
14562 /* Look for the `]' token. */
14567 }
14571 }
14729 {
14730 /* Consume the `('. */
14731 matching_parens parens;
14733 /* Look for the matching `)'. */
14738 }
14741 /* Consume the `['. */
14743 /* Look for the matching `]'. */
14752 /* FALLTHRU */
14761 {
14768 /* Consume the string. */
14774 {
14777 }
14778 else
14779 {
14781 /* Look for the suffix identifier. */
14786 {
14790 }
14791 else
14792 {
14795 }
14796 }
14801 {
14804 }
14807 {
14810 }
14812 {
14815 }
14817 }
14820 /* Anything else is an error. */
14822 }
14824 /* If we have selected an identifier, we need to consume the
14825 operator token. */
14827 {
14831 }
14832 /* Otherwise, no valid operator name was present. */
14833 else
14834 {
14837 }
14840 }
14842 /* Parse a template-declaration.
14844 template-declaration:
14845 export [opt] template < template-parameter-list > declaration
14847 If MEMBER_P is TRUE, this template-declaration occurs within a
14848 class-specifier.
14850 The grammar rule given by the standard isn't correct. What
14851 is really meant is:
14853 template-declaration:
14854 export [opt] template-parameter-list-seq
14855 decl-specifier-seq [opt] init-declarator [opt] ;
14856 export [opt] template-parameter-list-seq
14857 function-definition
14859 template-parameter-list-seq:
14860 template-parameter-list-seq [opt]
14861 template < template-parameter-list >
14863 Concept Extensions:
14865 template-parameter-list-seq:
14866 template < template-parameter-list > requires-clause [opt]
14868 requires-clause:
14869 requires logical-or-expression */
14871 static void
14873 {
14874 /* Check for `export'. */
14876 {
14877 /* Consume the `export' token. */
14879 /* Warn that we do not support `export'. */
14881 }
14884 }
14886 /* Parse a template-parameter-list.
14888 template-parameter-list:
14889 template-parameter
14890 template-parameter-list , template-parameter
14892 Returns a TREE_LIST. Each node represents a template parameter.
14893 The nodes are connected via their TREE_CHAINs. */
14895 static tree
14897 {
14902 /* The loop below parses the template parms. We first need to know
14903 the total number of template parms to be able to compute proper
14904 canonical types of each dependent type. So after the loop, when
14905 we know the total number of template parms,
14906 end_template_parm_list computes the proper canonical types and
14907 fixes up the dependent types accordingly. */
14909 {
14910 tree parameter;
14913 location_t parm_loc;
14915 /* Parse the template-parameter. */
14920 /* Add it to the list. */
14923 parm_loc,
14924 parameter,
14925 is_non_type,
14926 is_parameter_pack);
14927 else
14928 {
14931 }
14933 /* If the next token is not a `,', we're done. */
14936 /* Otherwise, consume the `,' token. */
14938 }
14941 }
14943 /* Parse a introduction-list.
14945 introduction-list:
14946 introduced-parameter
14947 introduction-list , introduced-parameter
14949 introduced-parameter:
14950 ...[opt] identifier
14952 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14953 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14954 WILDCARD_DECL will also have DECL_NAME set and token location in
14955 DECL_SOURCE_LOCATION. */
14957 static tree
14959 {
14963 {
14968 /* Build placeholder. */
14976 /* If the next token is not a `,', we're done. */
14979 /* Otherwise, consume the `,' token. */
14981 }
14983 /* Convert the vec into a TREE_VEC. */
14986 tree parm;
14992 }
14994 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14995 is an abstract declarator. */
14999 {
15004 }
15006 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15007 is an abstract declarator. */
15011 {
15015 else
15017 }
15019 /* Returns true if DECL represents a constrained-parameter. */
15023 {
15028 }
15030 /* Returns true if PARM declares a constrained-parameter. */
15034 {
15036 }
15038 /* Check that the type parameter is only a declarator-id, and that its
15039 type is not cv-qualified. */
15041 bool
15044 {
15049 {
15052 }
15054 /* Don't allow cv-qualified type parameters. */
15057 {
15060 }
15063 }
15065 /* Finish parsing/processing a template type parameter and checking
15066 various restrictions. */
15070 tree id,
15072 {
15075 else
15077 }
15079 static tree
15081 {
15082 /* FIXME: This should probably be copied, and we may need to adjust
15083 the template parameter depths. */
15093 }
15095 /* Finish parsing/processing a template template parameter by borrowing
15096 the template parameter list from the prototype parameter. */
15098 static tree
15100 tree proto,
15101 tree id,
15103 {
15107 }
15109 /* Create a new non-type template parameter from the given PARM
15110 declarator. */
15112 static tree
15115 {
15121 }
15123 /* Build a constrained template parameter based on the PARMDECL
15124 declarator. The type of PARMDECL is the constrained type, which
15125 refers to the prototype template parameter that ultimately
15126 specifies the type of the declared parameter. */
15128 static tree
15133 {
15139 /* A template parameter constrained by a variadic concept shall also
15140 be declared as a template parameter pack. */
15145 /* Build the parameter. Return an error if the declarator was invalid. */
15146 tree parm;
15151 parmdecl);
15152 else
15157 /* Finish the parameter decl and create a node attaching the
15158 default argument and constraint. */
15163 }
15165 /* Returns true if the parsed type actually represents the declaration
15166 of a type template-parameter. */
15170 {
15173 }
15176 /* Returns true if the parsed type actually represents the declaration of
15177 a template template-parameter. */
15179 static bool
15181 {
15184 }
15186 /* Parse a default argument for a type template-parameter.
15187 Note that diagnostics are handled in cp_parser_template_parameter. */
15189 static tree
15191 {
15194 /* Consume the `=' token. */
15199 /* Parse the default-argument. */
15205 {
15209 }
15212 }
15214 /* Parse a default argument for a template template-parameter. */
15216 static tree
15218 {
15223 /* Consume the `='. */
15225 /* Parse the id-expression. */
15227 /* save token before parsing the id-expression, for error
15228 reporting */
15230 tree default_argument
15238 /* If the id-expression was a template-id that refers to
15239 a template-class, we already have the declaration here,
15240 so no further lookup is needed. */
15241 ;
15242 else
15243 /* Look up the name. */
15244 default_argument
15246 none_type,
15252 /* See if the default argument is valid. */
15256 }
15258 /* Parse a template-parameter.
15260 template-parameter:
15261 type-parameter
15262 parameter-declaration
15264 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15265 the parameter. The TREE_PURPOSE is the default value, if any.
15266 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15267 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15268 set to true iff this parameter is a parameter pack. */
15270 static tree
15273 {
15276 tree parm;
15278 /* Assume it is a type parameter or a template parameter. */
15280 /* Assume it not a parameter pack. */
15282 /* Peek at the next token. */
15284 /* If it is `template', we have a type-parameter. */
15287 /* If it is `class' or `typename' we do not know yet whether it is a
15288 type parameter or a non-type parameter. Consider:
15290 template <typename T, typename T::X X> ...
15292 or:
15294 template <class C, class D*> ...
15296 Here, the first parameter is a type parameter, and the second is
15297 a non-type parameter. We can tell by looking at the token after
15298 the identifier -- if it is a `,', `=', or `>' then we have a type
15299 parameter. */
15301 {
15302 /* Peek at the token after `class' or `typename'. */
15304 /* If it's an ellipsis, we have a template type parameter
15305 pack. */
15308 /* If it's an identifier, skip it. */
15311 /* Now, see if the token looks like the end of a template
15312 parameter. */
15317 }
15319 /* Otherwise, it is a non-type parameter or a constrained parameter.
15321 [temp.param]
15323 When parsing a default template-argument for a non-type
15324 template-parameter, the first non-nested `>' is taken as the end
15325 of the template parameter-list rather than a greater-than
15326 operator. */
15327 parameter_declarator
15334 /* If the parameter declaration is marked as a parameter pack, set
15335 *IS_PARAMETER_PACK to notify the caller. */
15340 {
15341 /* Can happen in some cases of erroneous input (c++/34892). */
15343 /* Consume the `...' for better error recovery. */
15345 }
15347 // The parameter may have been constrained.
15350 parameter_declarator,
15351 is_non_type,
15352 is_parameter_pack);
15354 // Now we're sure that the parameter is a non-type parameter.
15365 }
15367 /* Parse a type-parameter.
15369 type-parameter:
15370 class identifier [opt]
15371 class identifier [opt] = type-id
15372 typename identifier [opt]
15373 typename identifier [opt] = type-id
15374 template < template-parameter-list > class identifier [opt]
15375 template < template-parameter-list > class identifier [opt]
15376 = id-expression
15378 GNU Extension (variadic templates):
15380 type-parameter:
15381 class ... identifier [opt]
15382 typename ... identifier [opt]
15384 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15385 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15386 the declaration of the parameter.
15388 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15390 static tree
15392 {
15394 tree parameter;
15396 /* Look for a keyword to tell us what kind of parameter this is. */
15402 {
15405 {
15406 tree identifier;
15407 tree default_argument;
15409 /* If the next token is an ellipsis, we have a template
15410 argument pack. */
15412 {
15413 /* Consume the `...' token. */
15418 }
15420 /* If the next token is an identifier, then it names the
15421 parameter. */
15424 else
15427 /* Create the parameter. */
15430 /* If the next token is an `=', we have a default argument. */
15432 {
15433 default_argument
15436 /* Template parameter packs cannot have default
15437 arguments. */
15439 {
15442 "template parameter pack %qD cannot have a "
15444 else
15446 "template parameter packs cannot have "
15449 }
15452 }
15453 else
15456 /* Create the combined representation of the parameter and the
15457 default argument. */
15459 }
15463 {
15464 tree identifier;
15465 tree default_argument;
15467 /* Look for the `<'. */
15469 /* Parse the template-parameter-list. */
15471 /* Look for the `>'. */
15474 // If template requirements are present, parse them.
15476 {
15481 }
15483 /* Look for the `class' or 'typename' keywords. */
15485 /* If the next token is an ellipsis, we have a template
15486 argument pack. */
15488 {
15489 /* Consume the `...' token. */
15494 }
15495 /* If the next token is an `=', then there is a
15496 default-argument. If the next token is a `>', we are at
15497 the end of the parameter-list. If the next token is a `,',
15498 then we are at the end of this parameter. */
15502 {
15504 /* Treat invalid names as if the parameter were nameless. */
15507 }
15508 else
15511 /* Create the template parameter. */
15513 identifier);
15515 /* If the next token is an `=', then there is a
15516 default-argument. */
15518 {
15519 default_argument
15522 /* Template parameter packs cannot have default
15523 arguments. */
15525 {
15528 "template parameter pack %qD cannot "
15530 identifier);
15531 else
15535 }
15536 }
15537 else
15540 /* Create the combined representation of the parameter and the
15541 default argument. */
15543 }
15549 }
15552 }
15554 /* Parse a template-id.
15556 template-id:
15557 template-name < template-argument-list [opt] >
15559 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15560 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15561 returned. Otherwise, if the template-name names a function, or set
15562 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15563 names a class, returns a TYPE_DECL for the specialization.
15565 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15566 uninstantiated templates. */
15568 static tree
15574 {
15575 tree templ;
15576 tree arguments;
15577 tree template_id;
15582 /* If the next token corresponds to a template-id, there is no need
15583 to reparse it. */
15586 {
15589 }
15591 /* Avoid performing name lookup if there is no possibility of
15592 finding a template-id. */
15595 && !cp_parser_nth_token_starts_template_argument_list_p
15597 {
15600 }
15602 /* Remember where the template-id starts. */
15608 /* Parse the template-name. */
15611 check_dependency_p,
15612 is_declaration,
15613 tag_type,
15616 {
15619 }
15621 /* Since we're going to preserve any side-effects from this parse, set up a
15622 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15623 in the template arguments. */
15626 /* If we find the sequence `[:' after a template-name, it's probably
15627 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15628 parse correctly the argument list. */
15635 {
15637 /* Change `:' into `::'. */
15639 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15640 CPP_LESS. */
15643 /* Parse the arguments. */
15646 {
15647 /* If we couldn't parse an argument list, then we revert our changes
15648 and return simply an error. Maybe this is not a template-id
15649 after all. */
15654 }
15655 /* Otherwise, emit an error about the invalid digraph, but continue
15656 parsing because we got our argument list. */
15659 {
15662 "%<<:%> is an alternate spelling for %<[%>."
15665 {
15667 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15670 }
15671 }
15672 }
15673 else
15674 {
15675 /* Look for the `<' that starts the template-argument-list. */
15677 {
15680 }
15681 /* Parse the arguments. */
15683 }
15685 /* Set the location to be of the form:
15686 template-name < template-argument-list [opt] >
15687 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15688 with caret == start at the start of the template-name,
15689 ranging until the closing '>'. */
15690 location_t finish_loc
15692 location_t combined_loc
15695 /* Build a representation of the specialization. */
15698 TEMPLATE_ID_EXPR,
15702 {
15704 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15705 template (rather than some instantiation thereof) only if
15706 is not nested within some other construct. For example, in
15707 "template <typename T> void f(T) { A<T>::", A<T> is just an
15708 instantiation of A. */
15711 CPP_SCOPE));
15712 template_id
15714 }
15715 /* A template-like identifier may be a partial concept id. */
15721 {
15725 }
15726 else
15727 {
15728 /* If it's not a class-template or a template-template, it should be
15729 a function-template. */
15737 }
15739 /* If parsing tentatively, replace the sequence of tokens that makes
15740 up the template-id with a CPP_TEMPLATE_ID token. That way,
15741 should we re-parse the token stream, we will not have to repeat
15742 the effort required to do the parse, nor will we issue duplicate
15743 error messages about problems during instantiation of the
15744 template. */
15746 /* Don't do this if we had a parse error in a declarator; re-parsing
15747 might succeed if a name changes meaning (60361). */
15751 {
15752 /* Reset the contents of the START_OF_ID token. */
15756 /* We must mark the lookup as kept, so we don't throw it away on
15757 the first parse. */
15761 /* Retrieve any deferred checks. Do not pop this access checks yet
15762 so the memory will not be reclaimed during token replacing below. */
15768 /* Purge all subsequent tokens. */
15771 /* ??? Can we actually assume that, if template_id ==
15772 error_mark_node, we will have issued a diagnostic to the
15773 user, as opposed to simply marking the tentative parse as
15774 failed? */
15777 }
15781 }
15783 /* Parse a template-name.
15785 template-name:
15786 identifier
15788 The standard should actually say:
15790 template-name:
15791 identifier
15792 operator-function-id
15794 A defect report has been filed about this issue.
15796 A conversion-function-id cannot be a template name because they cannot
15797 be part of a template-id. In fact, looking at this code:
15799 a.operator K<int>()
15801 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15802 It is impossible to call a templated conversion-function-id with an
15803 explicit argument list, since the only allowed template parameter is
15804 the type to which it is converting.
15806 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15807 `template' keyword, in a construction like:
15809 T::template f<3>()
15811 In that case `f' is taken to be a template-name, even though there
15812 is no way of knowing for sure.
15814 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15815 name refers to a set of overloaded functions, at least one of which
15816 is a template, or an IDENTIFIER_NODE with the name of the template,
15817 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15818 names are looked up inside uninstantiated templates. */
15820 static tree
15827 {
15828 tree identifier;
15829 tree decl;
15832 /* If the next token is `operator', then we have either an
15833 operator-function-id or a conversion-function-id. */
15835 {
15836 /* We don't know whether we're looking at an
15837 operator-function-id or a conversion-function-id. */
15839 /* Try an operator-function-id. */
15841 /* If that didn't work, try a conversion-function-id. */
15843 {
15846 }
15847 }
15848 /* Look for the identifier. */
15849 else
15852 /* If we didn't find an identifier, we don't have a template-id. */
15856 /* If the name immediately followed the `template' keyword, then it
15857 is a template-name. However, if the next token is not `<', then
15858 we do not treat it as a template-name, since it is not being used
15859 as part of a template-id. This enables us to handle constructs
15860 like:
15862 template <typename T> struct S { S(); };
15863 template <typename T> S<T>::S();
15865 correctly. We would treat `S' as a template -- if it were `S<T>'
15866 -- but we do not if there is no `<'. */
15870 {
15871 /* In a declaration, in a dependent context, we pretend that the
15872 "template" keyword was present in order to improve error
15873 recovery. For example, given:
15875 template <typename T> void f(T::X<int>);
15877 we want to treat "X<int>" as a template-id. */
15879 && !template_keyword_p
15881 && check_dependency_p
15883 /* Do not do this for dtors (or ctors), since they never
15884 need the template keyword before their name. */
15886 {
15889 /* Explain what went wrong. */
15891 identifier);
15894 /* If parsing tentatively, find the location of the "<" token. */
15897 /* Parse the template arguments so that we can issue error
15898 messages about them. */
15901 /* Skip tokens until we find a good place from which to
15902 continue parsing. */
15907 /* If parsing tentatively, permanently remove the
15908 template argument list. That will prevent duplicate
15909 error messages from being issued about the missing
15910 "template" keyword. */
15917 }
15919 /* If the "template" keyword is present, then there is generally
15920 no point in doing name-lookup, so we just return IDENTIFIER.
15921 But, if the qualifying scope is non-dependent then we can
15922 (and must) do name-lookup normally. */
15924 {
15930 {
15931 /* We're optimizing away the call to cp_parser_lookup_name, but
15932 we still need to do this. */
15935 }
15936 }
15937 }
15939 /* Look up the name. */
15941 tag_type,
15944 check_dependency_p,
15950 /* If DECL is a template, then the name was a template-name. */
15952 {
15956 }
15957 else
15958 {
15959 /* The standard does not explicitly indicate whether a name that
15960 names a set of overloaded declarations, some of which are
15961 templates, is a template-name. However, such a name should
15962 be a template-name; otherwise, there is no way to form a
15963 template-id for the overloaded templates. */
15972 {
15973 /* The name does not name a template. */
15976 }
15977 }
15979 /* If DECL is dependent, and refers to a function, then just return
15980 its name; we will look it up again during template instantiation. */
15982 {
15986 }
15989 }
15991 /* Parse a template-argument-list.
15993 template-argument-list:
15994 template-argument ... [opt]
15995 template-argument-list , template-argument ... [opt]
15997 Returns a TREE_VEC containing the arguments. */
15999 static tree
16001 {
16006 tree vec;
16013 /* Even if the template-id appears in an integral
16014 constant-expression, the contents of the argument list do
16015 not. */
16021 /* Parse the arguments. */
16022 do
16023 {
16024 tree argument;
16027 /* Consume the comma. */
16030 /* Parse the template-argument. */
16033 /* If the next token is an ellipsis, we're expanding a template
16034 argument pack. */
16036 {
16038 {
16042 }
16043 /* Consume the `...' token. */
16046 /* Make the argument into a TYPE_PACK_EXPANSION or
16047 EXPR_PACK_EXPANSION. */
16049 }
16052 {
16056 {
16059 }
16060 else
16062 }
16064 }
16080 }
16082 /* Parse a template-argument.
16084 template-argument:
16085 assignment-expression
16086 type-id
16087 id-expression
16089 The representation is that of an assignment-expression, type-id, or
16090 id-expression -- except that the qualified id-expression is
16091 evaluated, so that the value returned is either a DECL or an
16092 OVERLOAD.
16094 Although the standard says "assignment-expression", it forbids
16095 throw-expressions or assignments in the template argument.
16096 Therefore, we use "conditional-expression" instead. */
16098 static tree
16100 {
16101 tree argument;
16107 cp_id_kind idk;
16109 /* There's really no way to know what we're looking at, so we just
16110 try each alternative in order.
16112 [temp.arg]
16114 In a template-argument, an ambiguity between a type-id and an
16115 expression is resolved to a type-id, regardless of the form of
16116 the corresponding template-parameter.
16118 Therefore, we try a type-id first. */
16121 /* If there was no error parsing the type-id but the next token is a
16122 '>>', our behavior depends on which dialect of C++ we're
16123 parsing. In C++98, we probably found a typo for '> >'. But there
16124 are type-id which are also valid expressions. For instance:
16126 struct X { int operator >> (int); };
16127 template <int V> struct Foo {};
16128 Foo<X () >> 5> r;
16130 Here 'X()' is a valid type-id of a function type, but the user just
16131 wanted to write the expression "X() >> 5". Thus, we remember that we
16132 found a valid type-id, but we still try to parse the argument as an
16133 expression to see what happens.
16135 In C++0x, the '>>' will be considered two separate '>'
16136 tokens. */
16140 {
16143 }
16144 else
16145 {
16146 /* If the next token isn't a `,' or a `>', then this argument wasn't
16147 really finished. This means that the argument is not a valid
16148 type-id. */
16151 /* If that worked, we're done. */
16154 }
16155 /* We're still not sure what the argument will be. */
16157 /* Try a template. */
16165 /* If the next token isn't a `,' or a `>', then this argument wasn't
16166 really finished. */
16170 {
16171 /* Figure out what is being referred to. If the id-expression
16172 was for a class template specialization, then we will have a
16173 TYPE_DECL at this point. There is no need to do name lookup
16174 at this point in that case. */
16177 none_type,
16183 /* Handle a constrained-type-specifier for a non-type template
16184 parameter. */
16190 }
16192 {
16196 }
16197 /* It must be a non-type argument. In C++17 any constant-expression is
16198 allowed. */
16202 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16204 -- an integral constant-expression of integral or enumeration
16205 type; or
16207 -- the name of a non-type template-parameter; or
16209 -- the name of an object or function with external linkage...
16211 -- the address of an object or function with external linkage...
16213 -- a pointer to member... */
16214 /* Look for a non-type template parameter. */
16216 {
16228 }
16230 /* If the next token is "&", the argument must be the address of an
16231 object or function with external linkage. */
16234 {
16237 }
16238 /* See if we might have an id-expression. */
16245 {
16248 address_p,
16255 else
16256 {
16257 tree probe;
16260 {
16261 /* Strip the dereference temporarily. */
16264 }
16266 /* If we're in a template, we represent a qualified-id referring
16267 to a static data member as a SCOPE_REF even if the scope isn't
16268 dependent so that we can check access control later. */
16273 {
16274 /* A variable without external linkage might still be a
16275 valid constant-expression, so no error is issued here
16276 if the external-linkage check fails. */
16279 }
16281 /* All overloaded functions are allowed; if the external
16282 linkage test does not pass, an error will be issued
16283 later. */
16284 ;
16288 /* A pointer-to-member. */
16289 ;
16291 ;
16292 else
16296 {
16299 tf_warning_or_error);
16300 else
16303 }
16304 }
16305 }
16306 /* If the argument started with "&", there are no other valid
16307 alternatives at this point. */
16309 {
16312 }
16314 general_expr:
16315 /* If the argument wasn't successfully parsed as a type-id followed
16316 by '>>', the argument can only be a constant expression now.
16317 Otherwise, we try parsing the constant-expression tentatively,
16318 because the argument could really be a type-id. */
16324 else
16325 {
16326 /* With C++17 generalized non-type template arguments we need to handle
16327 lvalue constant expressions, too. */
16330 }
16338 /* We did our best to parse the argument as a non type-id, but that
16339 was the only alternative that matched (albeit with a '>' after
16340 it). We can assume it's just a typo from the user, and a
16341 diagnostic will then be issued. */
16343 }
16345 /* Parse an explicit-instantiation.
16347 explicit-instantiation:
16348 template declaration
16350 Although the standard says `declaration', what it really means is:
16352 explicit-instantiation:
16353 template decl-specifier-seq [opt] declarator [opt] ;
16355 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16356 supposed to be allowed. A defect report has been filed about this
16357 issue.
16359 GNU Extension:
16361 explicit-instantiation:
16362 storage-class-specifier template
16363 decl-specifier-seq [opt] declarator [opt] ;
16364 function-specifier template
16365 decl-specifier-seq [opt] declarator [opt] ; */
16367 static void
16369 {
16371 cp_decl_specifier_seq decl_specifiers;
16376 /* Look for an (optional) storage-class-specifier or
16377 function-specifier. */
16379 {
16380 extension_specifier
16383 extension_specifier
16386 }
16388 /* Look for the `template' keyword. */
16390 /* Let the front end know that we are processing an explicit
16391 instantiation. */
16393 /* [temp.explicit] says that we are supposed to ignore access
16394 control while processing explicit instantiation directives. */
16396 /* Parse a decl-specifier-seq. */
16398 CP_PARSER_FLAGS_OPTIONAL,
16401 /* If there was exactly one decl-specifier, and it declared a class,
16402 and there's no declarator, then we have an explicit type
16403 instantiation. */
16405 {
16406 tree type;
16410 /* Turn access control back on for names used during
16411 template instantiation. */
16416 }
16417 else
16418 {
16420 tree decl;
16422 /* Parse the declarator. */
16423 declarator
16434 {
16437 "explicit instantiation shall not use"
16441 "explicit instantiation shall not use"
16446 /* Turn access control back on for names used during
16447 template instantiation. */
16449 /* Do the explicit instantiation. */
16451 }
16452 else
16453 {
16455 /* Skip the body of the explicit instantiation. */
16457 }
16458 }
16459 /* We're done with the instantiation. */
16465 }
16467 /* Parse an explicit-specialization.
16469 explicit-specialization:
16470 template < > declaration
16472 Although the standard says `declaration', what it really means is:
16474 explicit-specialization:
16475 template <> decl-specifier [opt] init-declarator [opt] ;
16476 template <> function-definition
16477 template <> explicit-specialization
16478 template <> template-declaration */
16480 static void
16482 {
16486 /* Look for the `template' keyword. */
16488 /* Look for the `<'. */
16490 /* Look for the `>'. */
16492 /* We have processed another parameter list. */
16494 /* [temp]
16496 A template ... explicit specialization ... shall not have C
16497 linkage. */
16499 {
16502 /* Give it C++ linkage to avoid confusing other parts of the
16503 front end. */
16506 }
16507 else
16509 /* Let the front end know that we are beginning a specialization. */
16511 {
16514 }
16516 /* If the next keyword is `template', we need to figure out whether
16517 or not we're looking a template-declaration. */
16519 {
16524 else
16526 }
16527 else
16528 /* Parse the dependent declaration. */
16534 /* We're done with the specialization. */
16536 /* For the erroneous case of a template with C linkage, we pushed an
16537 implicit C++ linkage scope; exit that scope now. */
16540 /* We're done with this parameter list. */
16542 }
16544 /* Parse a type-specifier.
16546 type-specifier:
16547 simple-type-specifier
16548 class-specifier
16549 enum-specifier
16550 elaborated-type-specifier
16551 cv-qualifier
16553 GNU Extension:
16555 type-specifier:
16556 __complex__
16558 Returns a representation of the type-specifier. For a
16559 class-specifier, enum-specifier, or elaborated-type-specifier, a
16560 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16562 The parser flags FLAGS is used to control type-specifier parsing.
16564 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16565 in a decl-specifier-seq.
16567 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16568 class-specifier, enum-specifier, or elaborated-type-specifier, then
16569 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16570 if a type is declared; 2 if it is defined. Otherwise, it is set to
16571 zero.
16573 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16574 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16575 is set to FALSE. */
16577 static tree
16579 cp_parser_flags flags,
16584 {
16590 /* Assume this type-specifier does not declare a new type. */
16593 /* And that it does not specify a cv-qualifier. */
16596 /* Peek at the next token. */
16599 /* If we're looking at a keyword, we can use that to guide the
16600 production we choose. */
16603 {
16608 /* Look for the enum-specifier. */
16610 /* If that worked, we're done. */
16612 {
16617 type_spec,
16618 token,
16621 }
16622 else
16625 /* Any of these indicate either a class-specifier, or an
16626 elaborated-type-specifier. */
16633 /* Parse tentatively so that we can back up if we don't find a
16634 class-specifier. */
16636 /* Look for the class-specifier. */
16639 /* If that worked, we're done. */
16641 {
16646 type_spec,
16647 token,
16650 }
16652 /* Fall through. */
16653 elaborated_type_specifier:
16654 /* We're declaring (not defining) a class or enum. */
16658 /* Fall through. */
16660 /* Look for an elaborated-type-specifier. */
16661 type_spec
16662 = (cp_parser_elaborated_type_specifier
16665 is_declaration));
16668 type_spec,
16669 token,
16692 /* The `__complex__' keyword is a GNU extension. */
16698 }
16700 /* Handle simple keywords. */
16702 {
16704 {
16707 }
16709 }
16711 /* If we do not already have a type-specifier, assume we are looking
16712 at a simple-type-specifier. */
16714 decl_specs,
16715 flags);
16717 /* If we didn't find a type-specifier, and a type-specifier was not
16718 optional in this context, issue an error message. */
16720 {
16723 }
16726 }
16728 /* Parse a simple-type-specifier.
16730 simple-type-specifier:
16731 :: [opt] nested-name-specifier [opt] type-name
16732 :: [opt] nested-name-specifier template template-id
16733 char
16734 wchar_t
16735 bool
16736 short
16737 int
16738 long
16739 signed
16740 unsigned
16741 float
16742 double
16743 void
16745 C++11 Extension:
16747 simple-type-specifier:
16748 auto
16749 decltype ( expression )
16750 char16_t
16751 char32_t
16752 __underlying_type ( type-id )
16754 C++17 extension:
16756 nested-name-specifier(opt) template-name
16758 GNU Extension:
16760 simple-type-specifier:
16761 __int128
16762 __typeof__ unary-expression
16763 __typeof__ ( type-id )
16764 __typeof__ ( type-id ) { initializer-list , [opt] }
16766 Concepts Extension:
16768 simple-type-specifier:
16769 constrained-type-specifier
16771 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16772 appropriately updated. */
16774 static tree
16777 cp_parser_flags flags)
16778 {
16783 /* Peek at the next token. */
16786 /* If we're looking at a keyword, things are easy. */
16788 {
16823 {
16826 }
16855 {
16856 /* The 'auto' might be the placeholder return type for a function decl
16857 with trailing return type. */
16866 {
16868 {
16875 }
16878 {
16881 }
16884 }
16888 {
16891 }
16894 {
16897 }
16898 else
16902 {
16905 "use of %<auto%> in lambda parameter declaration "
16906 "only available with "
16908 }
16911 "use of %<auto%> in parameter declaration "
16912 "only available with "
16916 "ISO C++ forbids use of %<auto%> in parameter "
16918 }
16919 else
16924 /* Since DR 743, decltype can either be a simple-type-specifier by
16925 itself or begin a nested-name-specifier. Parsing it will replace
16926 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16927 handling below decide what to do. */
16933 /* Consume the `typeof' token. */
16935 /* Parse the operand to `typeof'. */
16937 /* If it is not already a TYPE, take its type. */
16943 token,
16952 token,
16962 token,
16967 }
16969 /* If token is an already-parsed decltype not followed by ::,
16970 it's a simple-type-specifier. */
16973 {
16976 {
16978 token,
16980 /* Remember that we are handling a decltype in order to
16981 implement the resolution of DR 1510 when the argument
16982 isn't instantiation dependent. */
16984 }
16987 }
16989 /* If the type-specifier was for a built-in type, we're done. */
16991 {
16992 /* Record the type. */
16999 type,
17000 token,
17005 /* Consume the token. */
17011 /* There is no valid C++ program where a non-template type is
17012 followed by a "<". That usually indicates that the user thought
17013 that the type was a template. */
17018 }
17020 /* The type-specifier must be a user-defined type. */
17022 {
17026 /* Don't gobble tokens or issue error messages if this is an
17027 optional type-specifier. */
17033 /* Look for the optional `::' operator. */
17034 global_p
17038 /* Look for the nested-name specifier. */
17039 qualified_p
17046 /* If we have seen a nested-name-specifier, and the next token
17047 is `template', then we are using the template-id production. */
17050 {
17051 /* Look for the template-id. */
17055 none_type,
17057 /* If the template-id did not name a type, we are out of
17058 luck. */
17060 {
17063 }
17064 }
17065 /* Otherwise, look for a type-name. */
17066 else
17068 /* Keep track of all name-lookups performed in class scopes. */
17070 && !global_p
17071 && !qualified_p
17075 /* If it didn't work out, we don't have a TYPE. */
17080 {
17094 {
17096 none_type,
17106 else
17107 {
17112 }
17113 }
17114 else
17120 }
17123 token,
17125 }
17127 /* If we didn't get a type-name, issue an error message. */
17129 {
17132 }
17135 {
17136 /* See if TYPE is an Objective-C type, and if so, parse and
17137 accept any protocol references following it. Do this before
17138 the cp_parser_check_for_invalid_template_id() call, because
17139 Objective-C types can be followed by '<...>' which would
17140 enclose protocol names rather than template arguments, and so
17141 everything is fine. */
17144 {
17148 /* Clobber the "unqualified" type previously entered into
17149 DECL_SPECS with the new, improved protocol-qualified version. */
17154 }
17156 /* There is no valid C++ program where a non-template type is
17157 followed by a "<". That usually indicates that the user
17158 thought that the type was a template. */
17160 none_type,
17162 }
17165 }
17167 /* Parse a type-name.
17169 type-name:
17170 class-name
17171 enum-name
17172 typedef-name
17173 simple-template-id [in c++0x]
17175 enum-name:
17176 identifier
17178 typedef-name:
17179 identifier
17181 Concepts:
17183 type-name:
17184 concept-name
17185 partial-concept-id
17187 concept-name:
17188 identifier
17190 Returns a TYPE_DECL for the type. */
17192 static tree
17194 {
17196 }
17198 /* See above. */
17199 static tree
17201 {
17202 tree type_decl;
17204 /* We can't know yet whether it is a class-name or not. */
17206 /* Try a class-name. */
17208 typename_keyword_p,
17210 none_type,
17214 /* If it's not a class-name, keep looking. */
17216 {
17218 /* It must be a typedef-name or an enum-name. */
17222 /* It is either a simple-template-id representing an
17223 instantiation of an alias template... */
17227 none_type,
17229 /* Note that this must be an instantiation of an alias template
17230 because [temp.names]/6 says:
17232 A template-id that names an alias template specialization
17233 is a type-name.
17235 Whereas [temp.names]/7 says:
17237 A simple-template-id that names a class template
17238 specialization is a class-name.
17240 With concepts, this could also be a partial-concept-id that
17241 declares a non-type template parameter. */
17248 else
17252 /* ... Or a typedef-name or an enum-name. */
17254 }
17257 }
17259 /* Check if DECL and ARGS can form a constrained-type-specifier.
17260 If ARGS is non-null, we try to form a concept check of the
17261 form DECL<?, ARGS> where ? is a wildcard that matches any
17262 kind of template argument. If ARGS is NULL, then we try to
17263 form a concept check of the form DECL<?>. */
17265 static tree
17268 {
17271 /* If we a constrained-type-specifier cannot be deduced. */
17275 /* A constrained type specifier can only be found in an
17276 overload set or as a reference to a template declaration.
17278 FIXME: This might be masking a bug. It's possible that
17279 that the deduction below is causing template specializations
17280 to be formed with the wildcard as an argument. */
17284 /* Try to build a call expression that evaluates the
17285 concept. This can fail if the overload set refers
17286 only to non-templates. */
17292 /* Deduce the checked constraint and the prototype parameter.
17294 FIXME: In certain cases, failure to deduce should be a
17295 diagnosable error. */
17296 tree conc;
17297 tree proto;
17301 /* In template parameter scope, this results in a constrained
17302 parameter. Return a descriptor of that parm. */
17306 /* In a parameter-declaration-clause, constrained-type
17307 specifiers result in invented template parameters. */
17309 {
17312 }
17313 else
17314 {
17315 /* Otherwise, we're in a context where the constrained
17316 type name is deduced and the constraint applies
17317 after deduction. */
17319 }
17322 }
17324 /* If DECL refers to a concept, return a TYPE_DECL representing
17325 the result of using the constrained type specifier in the
17326 current context. DECL refers to a concept if
17328 - it is an overload set containing a function concept taking a single
17329 type argument, or
17331 - it is a variable concept taking a single type argument. */
17333 static tree
17335 {
17341 else
17343 }
17345 /* Check if DECL and ARGS form a partial-concept-id. If so,
17346 assign ID to the resulting constrained placeholder.
17348 Returns true if the partial-concept-id designates a placeholder
17349 and false otherwise. Note that *id is set to NULL_TREE in
17350 this case. */
17352 static tree
17354 {
17356 }
17358 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17359 or a concept-name.
17361 enum-name:
17362 identifier
17364 typedef-name:
17365 identifier
17367 concept-name:
17368 identifier
17370 Returns a TYPE_DECL for the type. */
17372 static tree
17374 {
17375 tree type_decl;
17376 tree identifier;
17383 /* Look up the type-name. */
17388 /* If we found an overload set, then it may refer to a concept-name. */
17394 {
17395 /* See if this is an Objective-C type. */
17400 }
17402 /* Issue an error if we did not find a type-name. */
17404 /* In Objective-C, we have the complication that class names are
17405 normally type names and start declarations (eg, the
17406 "NSObject" in "NSObject *object;"), but can be used in an
17407 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17408 is an expression. So, a classname followed by a dot is not a
17409 valid type-name. */
17412 {
17417 }
17418 /* Remember that the name was used in the definition of the
17419 current class so that we can check later to see if the
17420 meaning would have been different after the class was
17421 entirely defined. */
17427 }
17429 /* Parse an elaborated-type-specifier. Note that the grammar given
17430 here incorporates the resolution to DR68.
17432 elaborated-type-specifier:
17433 class-key :: [opt] nested-name-specifier [opt] identifier
17434 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17435 enum-key :: [opt] nested-name-specifier [opt] identifier
17436 typename :: [opt] nested-name-specifier identifier
17437 typename :: [opt] nested-name-specifier template [opt]
17438 template-id
17440 GNU extension:
17442 elaborated-type-specifier:
17443 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17444 class-key attributes :: [opt] nested-name-specifier [opt]
17445 template [opt] template-id
17446 enum attributes :: [opt] nested-name-specifier [opt] identifier
17448 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17449 declared `friend'. If IS_DECLARATION is TRUE, then this
17450 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17451 something is being declared.
17453 Returns the TYPE specified. */
17455 static tree
17459 {
17461 tree identifier;
17464 tree globalscope;
17467 /* See if we're looking at the `enum' keyword. */
17469 {
17470 /* Consume the `enum' token. */
17472 /* Remember that it's an enumeration type. */
17474 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17475 enums) is used here. */
17479 {
17486 /* Consume the `struct' or `class' and parse it anyway. */
17488 }
17489 /* Parse the attributes. */
17491 }
17492 /* Or, it might be `typename'. */
17494 RID_TYPENAME))
17495 {
17496 /* Consume the `typename' token. */
17498 /* Remember that it's a `typename' type. */
17500 }
17501 /* Otherwise it must be a class-key. */
17502 else
17503 {
17507 /* Parse the attributes. */
17509 }
17511 /* Look for the `::' operator. */
17514 /* Look for the nested-name-specifier. */
17515 tree nested_name_specifier;
17517 {
17518 nested_name_specifier
17523 is_declaration);
17526 }
17527 else
17528 /* Even though `typename' is not present, the proposed resolution
17529 to Core Issue 180 says that in `class A<T>::B', `B' should be
17530 considered a type-name, even if `A<T>' is dependent. */
17531 nested_name_specifier
17536 is_declaration);
17537 /* For everything but enumeration types, consider a template-id.
17538 For an enumeration type, consider only a plain identifier. */
17540 {
17542 tree decl;
17544 /* Allow the `template' keyword. */
17546 /* If we didn't see `template', we don't know if there's a
17547 template-id or not. */
17550 /* Parse the template-id. */
17554 tag_type,
17555 is_declaration);
17556 /* If we didn't find a template-id, look for an ordinary
17557 identifier. */
17559 ;
17560 /* We can get here when cp_parser_template_id, called by
17561 cp_parser_class_name with tag_type == none_type, succeeds
17562 and caches a BASELINK. Then, when called again here,
17563 instead of failing and returning an error_mark_node
17564 returns it (see template/typename17.C in C++11).
17565 ??? Could we diagnose this earlier? */
17567 {
17570 }
17571 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17572 in effect, then we must assume that, upon instantiation, the
17573 template will correspond to a class. */
17577 typename_type,
17579 /* If the `typename' keyword is in effect and DECL is not a type
17580 decl, then type is non existent. */
17582 ;
17584 {
17588 /* If the next token is a semicolon, this must be a specialization,
17589 instantiation, or friend declaration. Check the scope while we
17590 still know whether or not we had a nested-name-specifier. */
17595 }
17598 }
17601 {
17606 {
17609 }
17611 /* For a `typename', we needn't call xref_tag. */
17617 /* Template parameter lists apply only if we are not within a
17618 function parameter list. */
17619 bool template_parm_lists_apply
17628 /* Look up a qualified name in the usual way. */
17630 {
17631 tree decl;
17632 tree ambiguous_decls;
17635 tag_type,
17642 /* If the lookup was ambiguous, an error will already have been
17643 issued. */
17647 /* If we are parsing friend declaration, DECL may be a
17648 TEMPLATE_DECL tree node here. However, we need to check
17649 whether this TEMPLATE_DECL results in valid code. Consider
17650 the following example:
17652 namespace N {
17653 template <class T> class C {};
17654 }
17655 class X {
17656 template <class T> friend class N::C; // #1, valid code
17657 };
17658 template <class T> class Y {
17659 friend class N::C; // #2, invalid code
17660 };
17662 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17663 name lookup of `N::C'. We see that friend declaration must
17664 be template for the code to be valid. Note that
17665 processing_template_decl does not work here since it is
17666 always 1 for the above two cases. */
17668 decl = (cp_parser_maybe_treat_template_as_class
17673 {
17675 identifier,
17678 }
17681 {
17685 allow_template);
17689 }
17691 /* Forward declarations of nested types, such as
17693 class C1::C2;
17694 class C1::C2::C3;
17696 are invalid unless all components preceding the final '::'
17697 are complete. If all enclosing types are complete, these
17698 declarations become merely pointless.
17700 Invalid forward declarations of nested types are errors
17701 caught elsewhere in parsing. Those that are pointless arrive
17702 here. */
17709 }
17710 else
17711 {
17712 /* An elaborated-type-specifier sometimes introduces a new type and
17713 sometimes names an existing type. Normally, the rule is that it
17714 introduces a new type only if there is not an existing type of
17715 the same name already in scope. For example, given:
17717 struct S {};
17718 void f() { struct S s; }
17720 the `struct S' in the body of `f' is the same `struct S' as in
17721 the global scope; the existing definition is used. However, if
17722 there were no global declaration, this would introduce a new
17723 local class named `S'.
17725 An exception to this rule applies to the following code:
17727 namespace N { struct S; }
17729 Here, the elaborated-type-specifier names a new type
17730 unconditionally; even if there is already an `S' in the
17731 containing scope this declaration names a new type.
17732 This exception only applies if the elaborated-type-specifier
17733 forms the complete declaration:
17735 [class.name]
17737 A declaration consisting solely of `class-key identifier ;' is
17738 either a redeclaration of the name in the current scope or a
17739 forward declaration of the identifier as a class name. It
17740 introduces the name into the current scope.
17742 We are in this situation precisely when the next token is a `;'.
17744 An exception to the exception is that a `friend' declaration does
17745 *not* name a new type; i.e., given:
17747 struct S { friend struct T; };
17749 `T' is not a new type in the scope of `S'.
17751 Also, `new struct S' or `sizeof (struct S)' never results in the
17752 definition of a new type; a new type can only be declared in a
17753 declaration context. */
17755 tag_scope ts;
17759 /* Friends have special name lookup rules. */
17763 CPP_SEMICOLON))
17764 /* This is a `class-key identifier ;' */
17766 else
17769 template_p =
17770 (template_parm_lists_apply
17773 /* An unqualified name was used to reference this type, so
17774 there were no qualifying templates. */
17782 }
17783 }
17788 /* Allow attributes on forward declarations of classes. */
17790 {
17800 else
17803 }
17806 {
17807 /* Indicate whether this class was declared as a `class' or as a
17808 `struct'. */
17812 }
17814 /* A "<" cannot follow an elaborated type specifier. If that
17815 happens, the user was probably trying to form a template-id. */
17820 }
17822 /* Parse an enum-specifier.
17824 enum-specifier:
17825 enum-head { enumerator-list [opt] }
17826 enum-head { enumerator-list , } [C++0x]
17828 enum-head:
17829 enum-key identifier [opt] enum-base [opt]
17830 enum-key nested-name-specifier identifier enum-base [opt]
17832 enum-key:
17833 enum
17834 enum class [C++0x]
17835 enum struct [C++0x]
17837 enum-base: [C++0x]
17838 : type-specifier-seq
17840 opaque-enum-specifier:
17841 enum-key identifier enum-base [opt] ;
17843 GNU Extensions:
17844 enum-key attributes[opt] identifier [opt] enum-base [opt]
17845 { enumerator-list [opt] }attributes[opt]
17846 enum-key attributes[opt] identifier [opt] enum-base [opt]
17847 { enumerator-list, }attributes[opt] [C++0x]
17849 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17850 if the token stream isn't an enum-specifier after all. */
17852 static tree
17854 {
17855 tree identifier;
17857 tree prev_scope;
17859 tree attributes;
17872 /* Parse tentatively so that we can back up if we don't find a
17873 enum-specifier. */
17876 /* Caller guarantees that the current token is 'enum', an identifier
17877 possibly follows, and the token after that is an opening brace.
17878 If we don't have an identifier, fabricate an anonymous name for
17879 the enumeration being defined. */
17882 /* Parse the "class" or "struct", which indicates a scoped
17883 enumeration type in C++0x. */
17886 {
17890 /* Consume the `struct' or `class' token. */
17894 }
17898 /* Clear the qualification. */
17903 /* Figure out in what scope the declaration is being placed. */
17909 nested_name_specifier
17917 {
17918 tree name;
17922 enum_type,
17927 input_location);
17929 {
17932 {
17933 /* Are template enums allowed in ISO? */
17937 /* ignore a typename reference, for it will be solved by name
17938 in start_enum. */
17940 }
17941 }
17944 else
17945 {
17950 }
17951 }
17952 else
17953 {
17956 else
17957 {
17963 }
17964 }
17967 /* Check for the `:' that denotes a specified underlying type in C++0x.
17968 Note that a ':' could also indicate a bitfield width, however. */
17970 {
17971 cp_decl_specifier_seq type_specifiers;
17973 /* Consume the `:'. */
17976 /* Parse the type-specifier-seq. */
17981 /* At this point this is surely not elaborated type specifier. */
17990 /* If that didn't work, stop. */
17992 {
17998 }
17999 }
18001 /* Look for the `{' but don't consume it yet. */
18003 {
18005 {
18008 {
18011 }
18012 }
18013 /* An opaque-enum-specifier must have a ';' here. */
18016 {
18019 {
18022 }
18023 }
18024 }
18030 {
18032 {
18036 }
18038 {
18040 }
18041 }
18043 /* Issue an error message if type-definitions are forbidden here. */
18046 else
18047 /* Create the new type. We do this before consuming the opening
18048 brace so the enum will be recorded as being on the line of its
18049 tag (or the 'enum' keyword, if there is no tag). */
18053 /* If the next token is not '{' it is an opaque-enum-specifier or an
18054 elaborated-type-specifier. */
18056 {
18060 {
18061 /* The following catches invalid code such as:
18062 enum class S<int>::E { A, B, C }; */
18070 {
18074 nested_name_specifier);
18076 }
18079 {
18081 "%qT for enum declaration does not name a class "
18084 }
18085 /* If that scope does not contain the scope in which the
18086 class was originally declared, the program is invalid. */
18088 nested_name_specifier))
18089 {
18092 "declaration of %qD in namespace %qD which does not "
18095 else
18097 "declaration of %qD in %qD which does not "
18101 }
18102 /* If that scope is the scope where the declaration is being placed
18103 the program is invalid. */
18107 {
18111 }
18112 }
18117 /* Consume the opening brace. */
18118 matching_braces braces;
18125 {
18129 }
18130 else
18131 {
18137 }
18141 /* If the next token is not '}', then there are some enumerators. */
18143 {
18147 }
18148 else
18151 /* Consume the final '}'. */
18157 }
18158 else
18159 {
18160 /* If a ';' follows, then it is an opaque-enum-specifier
18161 and additional restrictions apply. */
18163 {
18170 }
18171 }
18173 /* Look for trailing attributes to apply to this enumeration, and
18174 apply them if appropriate. */
18176 {
18179 trailing_attr,
18181 }
18183 /* Finish up the enumeration. */
18185 {
18190 }
18193 {
18195 {
18198 }
18200 {
18202 }
18203 }
18204 out:
18207 }
18209 /* Parse an enumerator-list. The enumerators all have the indicated
18210 TYPE.
18212 enumerator-list:
18213 enumerator-definition
18214 enumerator-list , enumerator-definition */
18216 static void
18218 {
18220 {
18221 /* Parse an enumerator-definition. */
18224 /* If the next token is not a ',', we've reached the end of
18225 the list. */
18228 /* Otherwise, consume the `,' and keep going. */
18230 /* If the next token is a `}', there is a trailing comma. */
18232 {
18237 }
18238 }
18239 }
18241 /* Parse an enumerator-definition. The enumerator has the indicated
18242 TYPE.
18244 enumerator-definition:
18245 enumerator
18246 enumerator = constant-expression
18248 enumerator:
18249 identifier
18251 GNU Extensions:
18253 enumerator-definition:
18254 enumerator attributes [opt]
18255 enumerator attributes [opt] = constant-expression */
18257 static void
18259 {
18260 tree identifier;
18261 tree value;
18262 location_t loc;
18264 /* Save the input location because we are interested in the location
18265 of the identifier and not the location of the explicit value. */
18268 /* Look for the identifier. */
18273 /* Parse any specified attributes. */
18276 /* If the next token is an '=', then there is an explicit value. */
18278 {
18279 /* Consume the `=' token. */
18281 /* Parse the value. */
18283 }
18284 else
18287 /* If we are processing a template, make sure the initializer of the
18288 enumerator doesn't contain any bare template parameter pack. */
18292 /* Create the enumerator. */
18294 }
18296 /* Parse a namespace-name.
18298 namespace-name:
18299 original-namespace-name
18300 namespace-alias
18302 Returns the NAMESPACE_DECL for the namespace. */
18304 static tree
18306 {
18307 tree identifier;
18308 tree namespace_decl;
18312 /* Get the name of the namespace. */
18317 /* Look up the identifier in the currently active scope. Look only
18318 for namespaces, due to:
18320 [basic.lookup.udir]
18322 When looking up a namespace-name in a using-directive or alias
18323 definition, only namespace names are considered.
18325 And:
18327 [basic.lookup.qual]
18329 During the lookup of a name preceding the :: scope resolution
18330 operator, object, function, and enumerator names are ignored.
18332 (Note that cp_parser_qualifying_entity only calls this
18333 function if the token after the name is the scope resolution
18334 operator.) */
18336 none_type,
18342 /* If it's not a namespace, issue an error. */
18345 {
18350 }
18353 }
18355 /* Parse a namespace-definition.
18357 namespace-definition:
18358 named-namespace-definition
18359 unnamed-namespace-definition
18361 named-namespace-definition:
18362 original-namespace-definition
18363 extension-namespace-definition
18365 original-namespace-definition:
18366 namespace identifier { namespace-body }
18368 extension-namespace-definition:
18369 namespace original-namespace-name { namespace-body }
18371 unnamed-namespace-definition:
18372 namespace { namespace-body } */
18374 static void
18376 {
18377 tree identifier;
18386 {
18389 }
18391 /* Look for the `namespace' keyword. */
18392 cp_token* token
18395 /* Parse any specified attributes before the identifier. */
18399 {
18403 {
18406 /* Parse any attributes specified after the identifier. */
18408 }
18415 "nested namespace definitions only available with "
18418 /* Nested namespace names can create new namespaces (unlike
18419 other qualified-ids). */
18422 else
18425 }
18437 /* Start the namespace. */
18444 /* Look for the `{' to validate starting the namespace. */
18445 matching_braces braces;
18447 {
18448 /* Parse the body of the namespace. */
18451 /* Look for the final `}'. */
18453 }
18458 /* Pop the nested namespace definitions. */
18461 }
18463 /* Parse a namespace-body.
18465 namespace-body:
18466 declaration-seq [opt] */
18468 static void
18470 {
18472 }
18474 /* Parse a namespace-alias-definition.
18476 namespace-alias-definition:
18477 namespace identifier = qualified-namespace-specifier ; */
18479 static void
18481 {
18482 tree identifier;
18483 tree namespace_specifier;
18487 /* Look for the `namespace' keyword. */
18489 /* Look for the identifier. */
18493 /* Look for the `=' token. */
18496 {
18498 /* Skip the definition. */
18503 }
18505 /* Look for the qualified-namespace-specifier. */
18506 namespace_specifier
18508 /* Look for the `;' token. */
18511 /* Register the alias in the symbol table. */
18513 }
18515 /* Parse a qualified-namespace-specifier.
18517 qualified-namespace-specifier:
18518 :: [opt] nested-name-specifier [opt] namespace-name
18520 Returns a NAMESPACE_DECL corresponding to the specified
18521 namespace. */
18523 static tree
18525 {
18526 /* Look for the optional `::'. */
18530 /* Look for the optional nested-name-specifier. */
18538 }
18540 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18541 access declaration.
18543 using-declaration:
18544 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18545 using :: unqualified-id ;
18547 access-declaration:
18548 qualified-id ;
18550 */
18552 static bool
18555 {
18559 tree decl;
18560 tree identifier;
18561 tree qscope;
18566 {
18569 }
18570 else
18571 {
18572 /* Look for the `using' keyword. */
18575 again:
18576 /* Peek at the next token. */
18578 /* See if it's `typename'. */
18580 {
18581 /* Remember that we've seen it. */
18583 /* Consume the `typename' token. */
18585 }
18586 }
18588 /* Look for the optional global scope qualification. */
18589 global_scope_p
18594 /* If we saw `typename', or didn't see `::', then there must be a
18595 nested-name-specifier present. */
18597 {
18603 {
18606 }
18607 }
18608 /* Otherwise, we could be in either of the two productions. In that
18609 case, treat the nested-name-specifier as optional. */
18610 else
18622 /* Something has already gone wrong; there's no need to parse
18623 further. Since an error has occurred, the return value of
18624 cp_parser_parse_definitely will be false, as required. */
18628 /* Parse the unqualified-id. */
18636 {
18641 }
18643 {
18648 "pack expansion in using-declaration only available "
18651 }
18653 /* The function we call to handle a using-declaration is different
18654 depending on what scope we are in. */
18656 ;
18659 /* [namespace.udecl]
18661 A using declaration shall not name a template-id. */
18664 else
18665 {
18667 {
18668 /* Create the USING_DECL. */
18675 {
18678 }
18679 else
18680 /* Add it to the list of members in this class. */
18682 }
18683 else
18684 {
18686 identifier,
18693 {
18696 }
18699 else
18701 }
18702 }
18706 {
18710 "comma-separated list in using-declaration only available "
18713 }
18715 /* Look for the final `;'. */
18720 "access declarations are deprecated "
18721 "in favour of using-declarations; "
18725 }
18727 /* Parse an alias-declaration.
18729 alias-declaration:
18730 using identifier attribute-specifier-seq [opt] = type-id */
18732 static tree
18734 {
18736 location_t id_location;
18738 cp_decl_specifier_seq decl_specs;
18742 /* Look for the `using' keyword. */
18743 cp_token *using_token
18765 /* Now we are going to parse the type-id of the declaration. */
18767 /*
18768 [dcl.type]/3 says:
18770 "A type-specifier-seq shall not define a class or enumeration
18771 unless it appears in the type-id of an alias-declaration (7.1.3) that
18772 is not the declaration of a template-declaration."
18774 In other words, if we currently are in an alias template, the
18775 type-id should not define a type.
18777 So let's set parser->type_definition_forbidden_message in that
18778 case; cp_parser_check_type_definition (called by
18779 cp_parser_class_specifier) will then emit an error if a type is
18780 defined in the type-id. */
18782 {
18786 }
18790 /* Restore the error message if need be. */
18796 {
18799 }
18801 /* A typedef-name can also be introduced by an alias-declaration. The
18802 identifier following the using keyword becomes a typedef-name. It has
18803 the same semantics as if it were introduced by the typedef
18804 specifier. In particular, it does not define a new type and it shall
18805 not appear in the type-id. */
18810 {
18813 ds_attribute,
18814 attrs_token);
18815 }
18817 ds_typedef,
18818 using_token);
18820 ds_alias,
18821 using_token);
18830 else
18836 // Attach constraints to the alias declaration.
18838 {
18842 }
18849 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18850 added into the symbol table; otherwise, return the TYPE_DECL. */
18854 {
18858 }
18861 }
18863 /* Parse a using-directive.
18865 using-directive:
18866 using namespace :: [opt] nested-name-specifier [opt]
18867 namespace-name ; */
18869 static void
18871 {
18872 tree namespace_decl;
18873 tree attribs;
18875 /* Look for the `using' keyword. */
18877 /* And the `namespace' keyword. */
18879 /* Look for the optional `::' operator. */
18881 /* And the optional nested-name-specifier. */
18887 /* Get the namespace being used. */
18889 /* And any specified attributes. */
18892 /* Update the symbol table. */
18895 else
18898 /* Look for the final `;'. */
18900 }
18902 /* Parse an asm-definition.
18904 asm-definition:
18905 asm ( string-literal ) ;
18907 GNU Extension:
18909 asm-definition:
18910 asm volatile [opt] ( string-literal ) ;
18911 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18912 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18913 : asm-operand-list [opt] ) ;
18914 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18915 : asm-operand-list [opt]
18916 : asm-clobber-list [opt] ) ;
18917 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18918 : asm-clobber-list [opt]
18919 : asm-goto-list ) ; */
18921 static void
18923 {
18924 tree string;
18929 tree asm_stmt;
18937 /* Look for the `asm' keyword. */
18942 {
18945 }
18947 /* See if the next token is `volatile'. */
18950 {
18951 /* Remember that we saw the `volatile' keyword. */
18953 /* Consume the token. */
18955 }
18959 {
18960 /* Remember that we saw the `goto' keyword. */
18962 /* Consume the token. */
18964 }
18965 /* Look for the opening `('. */
18968 /* Look for the string. */
18971 {
18975 }
18977 /* If we're allowing GNU extensions, check for the extended assembly
18978 syntax. Unfortunately, the `:' tokens need not be separated by
18979 a space in C, and so, for compatibility, we tolerate that here
18980 too. Doing that means that we have to treat the `::' operator as
18981 two `:' tokens. */
18986 {
18991 /* The extended syntax was used. */
18994 /* Look for outputs. */
18996 {
18997 /* Consume the `:'. */
18999 /* Parse the output-operands. */
19001 CPP_COLON)
19003 CPP_SCOPE)
19005 CPP_CLOSE_PAREN)
19007 {
19011 }
19012 }
19013 /* If the next token is `::', there are no outputs, and the
19014 next token is the beginning of the inputs. */
19016 /* The inputs are coming next. */
19019 /* Look for inputs. */
19022 {
19023 /* Consume the `:' or `::'. */
19025 /* Parse the output-operands. */
19027 CPP_COLON)
19029 CPP_SCOPE)
19031 CPP_CLOSE_PAREN))
19032 {
19036 }
19037 }
19039 /* The clobbers are coming next. */
19042 /* Look for clobbers. */
19045 {
19047 /* Consume the `:' or `::'. */
19049 /* Parse the clobbers. */
19051 CPP_COLON)
19053 CPP_CLOSE_PAREN))
19055 }
19058 /* The labels are coming next. */
19061 /* Look for labels. */
19064 {
19066 /* Consume the `:' or `::'. */
19068 /* Parse the labels. */
19070 }
19074 }
19078 /* Look for the closing `)'. */
19086 {
19087 /* Create the ASM_EXPR. */
19089 {
19092 /* If the extended syntax was not used, mark the ASM_EXPR. */
19094 {
19100 }
19101 }
19102 else
19104 }
19105 }
19107 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19108 type that comes from the decl-specifier-seq. */
19110 static tree
19112 {
19115 {
19128 }
19131 }
19133 /* Declarators [gram.dcl.decl] */
19135 /* Parse an init-declarator.
19137 init-declarator:
19138 declarator initializer [opt]
19140 GNU Extension:
19142 init-declarator:
19143 declarator asm-specification [opt] attributes [opt] initializer [opt]
19145 function-definition:
19146 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19147 function-body
19148 decl-specifier-seq [opt] declarator function-try-block
19150 GNU Extension:
19152 function-definition:
19153 __extension__ function-definition
19155 TM Extension:
19157 function-definition:
19158 decl-specifier-seq [opt] declarator function-transaction-block
19160 The DECL_SPECIFIERS apply to this declarator. Returns a
19161 representation of the entity declared. If MEMBER_P is TRUE, then
19162 this declarator appears in a class scope. The new DECL created by
19163 this declarator is returned.
19165 The CHECKS are access checks that should be performed once we know
19166 what entity is being declared (and, therefore, what classes have
19167 befriended it).
19169 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19170 for a function-definition here as well. If the declarator is a
19171 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19172 be TRUE upon return. By that point, the function-definition will
19173 have been completely parsed.
19175 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19176 is FALSE.
19178 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19179 parsed declaration if it is an uninitialized single declarator not followed
19180 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19181 if present, will not be consumed. If returned, this declarator will be
19182 created with SD_INITIALIZED but will not call cp_finish_decl.
19184 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19185 and there is an initializer, the pointed location_t is set to the
19186 location of the '=' or `(', or '{' in C++11 token introducing the
19187 initializer. */
19189 static tree
19200 {
19204 tree prefix_attributes;
19206 tree asm_specification;
19207 tree initializer;
19209 tree scope;
19211 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19212 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19213 "(...)". */
19224 /* Gather the attributes that were provided with the
19225 decl-specifiers. */
19228 /* Assume that this is not the declarator for a function
19229 definition. */
19233 /* Default arguments are only permitted for function parameters. */
19237 /* Defer access checks while parsing the declarator; we cannot know
19238 what names are accessible until we know what is being
19239 declared. */
19244 /* Parse the declarator. */
19245 declarator
19250 /* Gather up the deferred checks. */
19255 /* If the DECLARATOR was erroneous, there's no need to go
19256 further. */
19260 /* Check that the number of template-parameter-lists is OK. */
19270 /* Figure out what scope the entity declared by the DECLARATOR is
19271 located in. `grokdeclarator' sometimes changes the scope, so
19272 we compute it now. */
19275 /* Perform any lookups in the declared type which were thought to be
19276 dependent, but are not in the scope of the declarator. */
19277 decl_specifiers->type
19280 /* If we're allowing GNU extensions, look for an
19281 asm-specification. */
19283 {
19284 /* Look for an asm-specification. */
19287 }
19288 else
19291 /* Look for attributes. */
19295 /* Peek at the next token. */
19301 {
19302 /* Handle C++17 deduction guides. */
19306 {
19314 {
19318 }
19319 }
19321 /* Check to see if the token indicates the start of a
19322 function-definition. */
19324 {
19326 {
19327 /* If a function-definition should not appear here, issue an
19328 error message. */
19332 }
19334 location_t func_brace_location
19337 /* Neither attributes nor an asm-specification are allowed
19338 on a function-definition. */
19341 "an asm-specification is not allowed "
19345 "attributes are not allowed "
19347 /* This is a function-definition. */
19350 /* Parse the function definition. */
19353 decl_specifiers,
19354 declarator,
19355 prefix_attributes);
19356 else
19357 decl =
19358 (cp_parser_function_definition_from_specifiers_and_declarator
19362 {
19363 /* This is where the prologue starts... */
19366 }
19369 }
19370 }
19372 {
19373 /* A non-template declaration involving a function parameter list
19374 containing an implicit template parameter will be made into a
19375 template. If the resulting declaration is not going to be an
19376 actual function then finish the template scope here to prevent it.
19377 An error message will be issued once we have a decl to talk about.
19379 FIXME probably we should do type deduction rather than create an
19380 implicit template, but the standard currently doesn't allow it. */
19383 }
19385 /* [dcl.dcl]
19387 Only in function declarations for constructors, destructors, type
19388 conversions, and deduction guides can the decl-specifier-seq be omitted.
19390 We explicitly postpone this check past the point where we handle
19391 function-definitions because we tolerate function-definitions
19392 that are missing their return types in some modes. */
19394 {
19398 }
19400 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19404 {
19415 {
19421 }
19422 }
19423 else
19424 {
19425 /* If the init-declarator isn't initialized and isn't followed by a
19426 `,' or `;', it's not a valid init-declarator. */
19429 {
19432 else
19433 {
19437 }
19438 }
19441 }
19443 /* Because start_decl has side-effects, we should only call it if we
19444 know we're going ahead. By this point, we know that we cannot
19445 possibly be looking at any other construct. */
19448 /* Enter the newly declared entry in the symbol table. If we're
19449 processing a declaration in a class-specifier, we wait until
19450 after processing the initializer. */
19452 {
19460 /* Adjust location of decl if declarator->id_loc is more appropriate:
19461 set, and decl wasn't merged with another decl, in which case its
19462 location would be different from input_location, and more accurate. */
19467 }
19469 /* Enter the SCOPE. That way unqualified names appearing in the
19470 initializer will be looked up in SCOPE. */
19473 /* Perform deferred access control checks, now that we know in which
19474 SCOPE the declared entity resides. */
19476 {
19479 /* If the entity being declared is a function, pretend that we
19480 are in its scope. If it is a `friend', it may have access to
19481 things that would not otherwise be accessible. */
19483 {
19486 }
19488 /* Perform access checks for template parameters. */
19491 /* Perform the access control checks for the declarator and the
19492 decl-specifiers. */
19495 /* Restore the saved value. */
19498 }
19500 /* Parse the initializer. */
19505 {
19507 {
19510 else
19511 {
19512 /* If the declaration was erroneous, we don't really
19513 know what the user intended, so just silently
19514 consume the initializer. */
19521 }
19522 }
19523 else
19524 {
19525 /* We want to record the extra mangling scope for in-class
19526 initializers of class members and initializers of static data
19527 member templates. The former involves deferring
19528 parsing of the initializer until end of class as with default
19529 arguments. So right here we only handle the latter. */
19539 }
19540 }
19542 /* The old parser allows attributes to appear after a parenthesized
19543 initializer. Mark Mitchell proposed removing this functionality
19544 on the GCC mailing lists on 2002-08-13. This parser accepts the
19545 attributes -- but ignores them. */
19552 /* And now complain about a non-function implicit template. */
19557 /* For an in-class declaration, use `grokfield' to create the
19558 declaration. */
19560 {
19562 {
19565 }
19574 }
19576 /* Finish processing the declaration. But, skip member
19577 declarations. */
19579 {
19582 asm_specification,
19583 /* If the initializer is in parentheses, then this is
19584 a direct-initialization, which means that an
19585 `explicit' constructor is OK. Otherwise, an
19586 `explicit' constructor cannot be used. */
19589 }
19592 /* Core issue #226 (C++0x only): A default template-argument
19593 shall not be specified in a friend class template
19594 declaration. */
19603 {
19606 else
19608 }
19615 }
19617 /* Parse a declarator.
19619 declarator:
19620 direct-declarator
19621 ptr-operator declarator
19623 abstract-declarator:
19624 ptr-operator abstract-declarator [opt]
19625 direct-abstract-declarator
19627 GNU Extensions:
19629 declarator:
19630 attributes [opt] direct-declarator
19631 attributes [opt] ptr-operator declarator
19633 abstract-declarator:
19634 attributes [opt] ptr-operator abstract-declarator [opt]
19635 attributes [opt] direct-abstract-declarator
19637 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19638 detect constructors, destructors, deduction guides, or conversion operators.
19639 It is set to -1 if the declarator is a name, and +1 if it is a
19640 function. Otherwise it is set to zero. Usually you just want to
19641 test for >0, but internally the negative value is used.
19643 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19644 a decl-specifier-seq unless it declares a constructor, destructor,
19645 or conversion. It might seem that we could check this condition in
19646 semantic analysis, rather than parsing, but that makes it difficult
19647 to handle something like `f()'. We want to notice that there are
19648 no decl-specifiers, and therefore realize that this is an
19649 expression, not a declaration.)
19651 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19652 the declarator is a direct-declarator of the form "(...)".
19654 MEMBER_P is true iff this declarator is a member-declarator.
19656 FRIEND_P is true iff this declarator is a friend. */
19660 cp_parser_declarator_kind dcl_kind,
19664 {
19667 cp_cv_quals cv_quals;
19668 tree class_type;
19671 /* Assume this is not a constructor, destructor, or type-conversion
19672 operator. */
19679 /* Check for the ptr-operator production. */
19681 /* Parse the ptr-operator. */
19687 /* If that worked, then we have a ptr-operator. */
19689 {
19690 /* If a ptr-operator was found, then this declarator was not
19691 parenthesized. */
19694 /* The dependent declarator is optional if we are parsing an
19695 abstract-declarator. */
19699 /* Parse the dependent declarator. */
19704 friend_p);
19706 /* If we are parsing an abstract-declarator, we must handle the
19707 case where the dependent declarator is absent. */
19712 declarator = cp_parser_make_indirect_declarator
19714 }
19715 /* Everything else is a direct-declarator. */
19716 else
19717 {
19720 CPP_OPEN_PAREN);
19722 ctor_dtor_or_conv_p,
19724 }
19729 }
19731 /* Parse a direct-declarator or direct-abstract-declarator.
19733 direct-declarator:
19734 declarator-id
19735 direct-declarator ( parameter-declaration-clause )
19736 cv-qualifier-seq [opt]
19737 ref-qualifier [opt]
19738 exception-specification [opt]
19739 direct-declarator [ constant-expression [opt] ]
19740 ( declarator )
19742 direct-abstract-declarator:
19743 direct-abstract-declarator [opt]
19744 ( parameter-declaration-clause )
19745 cv-qualifier-seq [opt]
19746 ref-qualifier [opt]
19747 exception-specification [opt]
19748 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19749 ( abstract-declarator )
19751 Returns a representation of the declarator. DCL_KIND is
19752 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19753 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19754 we are parsing a direct-declarator. It is
19755 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19756 of ambiguity we prefer an abstract declarator, as per
19757 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19758 as for cp_parser_declarator. */
19762 cp_parser_declarator_kind dcl_kind,
19765 {
19776 {
19777 /* Peek at the next token. */
19780 {
19781 /* This is either a parameter-declaration-clause, or a
19782 parenthesized declarator. When we know we are parsing a
19783 named declarator, it must be a parenthesized declarator
19784 if FIRST is true. For instance, `(int)' is a
19785 parameter-declaration-clause, with an omitted
19786 direct-abstract-declarator. But `((*))', is a
19787 parenthesized abstract declarator. Finally, when T is a
19788 template parameter `(T)' is a
19789 parameter-declaration-clause, and not a parenthesized
19790 named declarator.
19792 We first try and parse a parameter-declaration-clause,
19793 and then try a nested declarator (if FIRST is true).
19795 It is not an error for it not to be a
19796 parameter-declaration-clause, even when FIRST is
19797 false. Consider,
19799 int i (int);
19800 int i (3);
19802 The first is the declaration of a function while the
19803 second is the definition of a variable, including its
19804 initializer.
19806 Having seen only the parenthesis, we cannot know which of
19807 these two alternatives should be selected. Even more
19808 complex are examples like:
19810 int i (int (a));
19811 int i (int (3));
19813 The former is a function-declaration; the latter is a
19814 variable initialization.
19816 Thus again, we try a parameter-declaration-clause, and if
19817 that fails, we back out and return. */
19820 {
19821 tree params;
19826 /* In a member-declarator, the only valid interpretation
19827 of a parenthesis is the start of a
19828 parameter-declaration-clause. (It is invalid to
19829 initialize a static data member with a parenthesized
19830 initializer; only the "=" form of initialization is
19831 permitted.) */
19835 /* Consume the `('. */
19836 matching_parens parens;
19839 {
19840 /* If this is going to be an abstract declarator, we're
19841 in a declarator and we can't have default args. */
19844 }
19848 /* Parse the parameter-declaration-clause. */
19851 /* Consume the `)'. */
19854 /* If all went well, parse the cv-qualifier-seq,
19855 ref-qualifier and the exception-specification. */
19857 {
19858 cp_cv_quals cv_quals;
19859 cp_virt_specifiers virt_specifiers;
19860 cp_ref_qualifier ref_qual;
19861 tree exception_specification;
19862 tree late_return;
19863 tree attrs;
19873 /* Parse the cv-qualifier-seq. */
19875 /* Parse the ref-qualifier. */
19877 /* Parse the tx-qualifier. */
19879 /* And the exception-specification. */
19880 exception_specification
19885 /* In here, we handle cases where attribute is used after
19886 the function declaration. For example:
19887 void func (int x) __attribute__((vector(..))); */
19890 late_return = (cp_parser_late_return_type_opt
19894 /* Parse the virt-specifier-seq. */
19897 /* Create the function-declarator. */
19899 params,
19900 cv_quals,
19901 virt_specifiers,
19902 ref_qual,
19903 tx_qual,
19904 exception_specification,
19905 late_return,
19906 requires_clause);
19909 /* Any subsequent parameter lists are to do with
19910 return type, so are not those of the declared
19911 function. */
19913 }
19915 /* Remove the function parms from scope. */
19919 /* Repeat the main loop. */
19921 }
19923 /* If this is the first, we can try a parenthesized
19924 declarator. */
19926 {
19933 /* Consume the `('. */
19934 matching_parens parens;
19936 /* Parse the nested declarator. */
19939 declarator
19945 /* Expect a `)'. */
19953 }
19954 /* Otherwise, we must be done. */
19955 else
19957 }
19961 {
19962 /* Parse an array-declarator. */
19972 /* Consume the `['. */
19974 /* Peek at the next token. */
19976 /* If the next token is `]', then there is no
19977 constant-expression. */
19979 {
19981 bounds
19991 {
19992 /* Normally, the array bound must be an integral constant
19993 expression. However, as an extension, we allow VLAs
19994 in function scopes as long as they aren't part of a
19995 parameter declaration. */
19999 }
20002 {
20003 /* Remember this wasn't a constant-expression. */
20006 }
20007 }
20008 else
20010 /* Look for the closing `]'. */
20012 {
20015 }
20020 }
20022 {
20023 {
20024 tree qualifying_scope;
20025 tree unqualified_name;
20026 tree attrs;
20027 special_function_kind sfk;
20032 /* Parse a declarator-id */
20035 {
20038 /* If we see an ellipsis, we should be looking at a
20039 parameter pack. */
20041 {
20042 /* Consume the `...' */
20046 }
20047 }
20050 unqualified_name
20054 {
20058 {
20059 /* Check whether an error occurred. */
20062 /* We already consumed the ellipsis to mark a
20063 parameter pack, but we have no way to report it,
20064 so abort the tentative parse. We will be exiting
20065 immediately anyway. */
20067 }
20068 else
20074 && (qualifying_scope
20076 {
20079 }
20080 }
20085 {
20090 }
20096 {
20097 /* In the declaration of a member of a template class
20098 outside of the class itself, the SCOPE will sometimes
20099 be a TYPENAME_TYPE. For example, given:
20101 template <typename T>
20102 int S<T>::R::i = 3;
20104 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20105 this context, we must resolve S<T>::R to an ordinary
20106 type, rather than a typename type.
20108 The reason we normally avoid resolving TYPENAME_TYPEs
20109 is that a specialization of `S' might render
20110 `S<T>::R' not a type. However, if `S' is
20111 specialized, then this `i' will not be used, so there
20112 is no harm in resolving the types here. */
20113 tree type;
20115 /* Resolve the TYPENAME_TYPE. */
20118 /* If that failed, the declarator is invalid. */
20120 {
20123 "cannot define member of dependent typedef "
20125 else
20130 }
20132 }
20137 {
20138 tree class_type;
20143 else
20147 {
20151 {
20152 /* We do not attempt to print the declarator
20153 here because we do not have enough
20154 information about its original syntactic
20155 form. */
20159 }
20162 {
20166 "use %<%T::%D%> instead of %<%T::%D%> to "
20168 class_type,
20173 }
20175 }
20178 {
20185 for an unnamed type, even if the type
20186 got a name for linkage purposes. */
20188 /* Handle correctly (c++/19200):
20190 struct S {
20191 struct T{};
20192 friend void S(T);
20193 };
20195 and also:
20197 namespace N {
20198 void S();
20199 }
20201 struct S {
20202 friend void N::S();
20203 }; */
20206 class_type))
20215 }
20216 }
20218 unqualified_name,
20219 sfk);
20226 }
20228 handle_declarator:;
20231 {
20232 /* Any names that appear after the declarator-id for a
20233 member are looked up in the containing scope. */
20235 {
20236 /* But declarations with qualified-ids can't appear in a
20237 function. */
20241 }
20243 }
20247 /* Default args are only allowed on function
20248 declarations. */
20250 else
20254 }
20255 /* We're done. */
20256 else
20258 }
20260 /* For an abstract declarator, we might wind up with nothing at this
20261 point. That's an error; the declarator is not optional. */
20265 {
20266 /* Record overly parenthesized declarator so we can give a
20267 diagnostic about confusing decl/expr disambiguation. */
20269 {
20270 /* If the open and close parens are on different lines, this
20271 is probably a formatting thing, so ignore. */
20276 }
20279 }
20281 /* If we entered a scope, we must exit it now. */
20289 }
20291 /* Parse a ptr-operator.
20293 ptr-operator:
20294 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20295 * cv-qualifier-seq [opt]
20296 &
20297 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20298 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20300 GNU Extension:
20302 ptr-operator:
20303 & cv-qualifier-seq [opt]
20305 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20306 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20307 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20308 filled in with the TYPE containing the member. *CV_QUALS is
20309 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20310 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20311 Note that the tree codes returned by this function have nothing
20312 to do with the types of trees that will be eventually be created
20313 to represent the pointer or reference type being parsed. They are
20314 just constants with suggestive names. */
20315 static enum tree_code
20320 {
20325 /* Assume that it's not a pointer-to-member. */
20327 /* And that there are no cv-qualifiers. */
20330 /* Peek at the next token. */
20333 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20343 {
20344 /* Consume the `*', `&' or `&&'. */
20347 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20348 `&', if we are allowing GNU extensions. (The only qualifier
20349 that can legally appear after `&' is `restrict', but that is
20350 enforced during semantic analysis. */
20358 }
20359 else
20360 {
20361 /* Try the pointer-to-member case. */
20363 /* Look for the optional `::' operator. */
20366 /* Look for the nested-name specifier. */
20373 /* If we found it, and the next token is a `*', then we are
20374 indeed looking at a pointer-to-member operator. */
20377 {
20378 /* Indicate that the `*' operator was used. */
20386 else
20387 {
20388 /* The type of which the member is a member is given by the
20389 current SCOPE. */
20391 /* The next name will not be qualified. */
20395 /* Look for optional c++11 attributes. */
20399 /* Look for the optional cv-qualifier-seq. */
20401 }
20402 }
20403 /* If that didn't work we don't have a ptr-operator. */
20406 }
20409 }
20411 /* Parse an (optional) cv-qualifier-seq.
20413 cv-qualifier-seq:
20414 cv-qualifier cv-qualifier-seq [opt]
20416 cv-qualifier:
20417 const
20418 volatile
20420 GNU Extension:
20422 cv-qualifier:
20423 __restrict__
20425 Returns a bitmask representing the cv-qualifiers. */
20427 static cp_cv_quals
20429 {
20433 {
20435 cp_cv_quals cv_qualifier;
20437 /* Peek at the next token. */
20439 /* See if it's a cv-qualifier. */
20441 {
20457 }
20463 {
20468 }
20469 else
20470 {
20473 }
20474 }
20477 }
20479 /* Parse an (optional) ref-qualifier
20481 ref-qualifier:
20482 &
20483 &&
20485 Returns cp_ref_qualifier representing ref-qualifier. */
20487 static cp_ref_qualifier
20489 {
20492 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20497 {
20502 {
20514 }
20519 {
20522 }
20523 else
20524 {
20527 }
20528 }
20531 }
20533 /* Parse an optional tx-qualifier.
20535 tx-qualifier:
20536 transaction_safe
20537 transaction_safe_dynamic */
20539 static tree
20541 {
20544 {
20549 {
20553 {
20556 {
20559 }
20560 else
20562 }
20563 }
20564 }
20566 }
20568 /* Parse an (optional) virt-specifier-seq.
20570 virt-specifier-seq:
20571 virt-specifier virt-specifier-seq [opt]
20573 virt-specifier:
20574 override
20575 final
20577 Returns a bitmask representing the virt-specifiers. */
20579 static cp_virt_specifiers
20581 {
20585 {
20587 cp_virt_specifiers virt_specifier;
20589 /* Peek at the next token. */
20591 /* See if it's a virt-specifier-qualifier. */
20595 {
20598 }
20600 {
20603 }
20605 {
20607 }
20608 else
20612 {
20617 }
20618 else
20619 {
20622 }
20623 }
20625 }
20627 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20628 is in scope even though it isn't real. */
20630 void
20632 {
20633 tree this_parm;
20636 {
20637 /* We don't clear this between NSDMIs. Is it already what we want? */
20644 }
20647 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20649 current_class_ref
20652 }
20654 /* Return true iff our current scope is a non-static data member
20655 initializer. */
20657 bool
20659 {
20660 /* We recognize NSDMI context by the context-less 'this' pointer set up
20661 by the function above. */
20667 }
20669 /* Parse a late-specified return type, if any. This is not a separate
20670 non-terminal, but part of a function declarator, which looks like
20672 -> trailing-type-specifier-seq abstract-declarator(opt)
20674 Returns the type indicated by the type-id.
20676 In addition to this, parse any queued up #pragma omp declare simd
20677 clauses, and #pragma acc routine clauses.
20679 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20680 function. */
20682 static tree
20685 {
20689 && declarator
20693 && declarator
20696 /* Peek at the next token. */
20698 /* A late-specified return type is indicated by an initial '->'. */
20709 {
20710 /* DR 1207: 'this' is in scope in the trailing return type. */
20712 }
20715 {
20716 /* Consume the ->. */
20720 }
20722 /* Function declarations may be followed by a trailing
20723 requires-clause. */
20727 declarator->attributes
20731 declarator->attributes
20736 {
20739 }
20742 }
20744 /* Parse a declarator-id.
20746 declarator-id:
20747 id-expression
20748 :: [opt] nested-name-specifier [opt] type-name
20750 In the `id-expression' case, the value returned is as for
20751 cp_parser_id_expression if the id-expression was an unqualified-id.
20752 If the id-expression was a qualified-id, then a SCOPE_REF is
20753 returned. The first operand is the scope (either a NAMESPACE_DECL
20754 or TREE_TYPE), but the second is still just a representation of an
20755 unqualified-id. */
20757 static tree
20759 {
20760 tree id;
20761 /* The expression must be an id-expression. Assume that qualified
20762 names are the names of types so that:
20764 template <class T>
20765 int S<T>::R::i = 3;
20767 will work; we must treat `S<T>::R' as the name of a type.
20768 Similarly, assume that qualified names are templates, where
20769 required, so that:
20771 template <class T>
20772 int S<T>::R<T>::i = 3;
20774 will work, too. */
20780 optional_p);
20784 }
20786 /* Parse a type-id.
20788 type-id:
20789 type-specifier-seq abstract-declarator [opt]
20791 Returns the TYPE specified. */
20793 static tree
20796 {
20797 cp_decl_specifier_seq type_specifier_seq;
20800 /* Parse the type-specifier-seq. */
20802 is_trailing_return,
20807 /* A bare template name as a template argument is a template template
20808 argument, not a placeholder, so fail parsing it as a type argument. */
20809 {
20813 }
20817 /* There might or might not be an abstract declarator. */
20819 /* Look for the declarator. */
20820 abstract_declarator
20825 /* Check to see if there really was a declarator. */
20830 /* The concepts TS allows 'auto' as a type-id. */
20832 /* None of the valid uses of 'auto' in C++14 involve the type-id
20833 nonterminal, but it is valid in a trailing-return-type. */
20836 {
20837 /* A type-id with type 'auto' is only ok if the abstract declarator
20838 is a function declarator with a late-specified return type.
20840 A type-id with 'auto' is also valid in a trailing-return-type
20841 in a compound-requirement. */
20848 else
20849 {
20852 {
20854 auto_node);
20856 tmpl);
20857 }
20858 else
20861 }
20862 }
20865 is_template_arg);
20866 }
20868 static tree
20870 {
20872 }
20874 static tree
20876 {
20877 tree r;
20879 parser->type_definition_forbidden_message
20884 {
20887 }
20889 }
20891 static tree
20893 {
20895 }
20897 /* Parse a type-specifier-seq.
20899 type-specifier-seq:
20900 type-specifier type-specifier-seq [opt]
20902 GNU extension:
20904 type-specifier-seq:
20905 attributes type-specifier-seq [opt]
20907 If IS_DECLARATION is true, we are at the start of a "condition" or
20908 exception-declaration, so we might be followed by a declarator-id.
20910 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20911 i.e. we've just seen "->".
20913 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20915 static void
20920 {
20925 /* Clear the TYPE_SPECIFIER_SEQ. */
20928 /* In the context of a trailing return type, enum E { } is an
20929 elaborated-type-specifier followed by a function-body, not an
20930 enum-specifier. */
20934 /* Parse the type-specifiers and attributes. */
20936 {
20937 tree type_specifier;
20940 /* Check for attributes first. */
20942 {
20947 }
20949 /* record the token of the beginning of the type specifier seq,
20950 for error reporting purposes*/
20954 /* Look for the type-specifier. */
20956 flags,
20957 type_specifier_seq,
20959 NULL,
20962 {
20963 /* If the first type-specifier could not be found, this is not a
20964 type-specifier-seq at all. */
20966 {
20967 /* Set in_declarator_p to avoid skipping to the semicolon. */
20979 }
20980 /* If subsequent type-specifiers could not be found, the
20981 type-specifier-seq is complete. */
20983 }
20986 /* The standard says that a condition can be:
20988 type-specifier-seq declarator = assignment-expression
20990 However, given:
20992 struct S {};
20993 if (int S = ...)
20995 we should treat the "S" as a declarator, not as a
20996 type-specifier. The standard doesn't say that explicitly for
20997 type-specifier-seq, but it does say that for
20998 decl-specifier-seq in an ordinary declaration. Perhaps it
20999 would be clearer just to allow a decl-specifier-seq here, and
21000 then add a semantic restriction that if any decl-specifiers
21001 that are not type-specifiers appear, the program is invalid. */
21004 }
21005 }
21007 /* Return whether the function currently being declared has an associated
21008 template parameter list. */
21010 static bool
21012 {
21025 }
21027 /* Parse a parameter-declaration-clause.
21029 parameter-declaration-clause:
21030 parameter-declaration-list [opt] ... [opt]
21031 parameter-declaration-list , ...
21033 Returns a representation for the parameter declarations. A return
21034 value of NULL indicates a parameter-declaration-clause consisting
21035 only of an ellipsis. */
21037 static tree
21039 {
21040 tree parameters;
21049 parser->auto_is_implicit_function_template_parm_p
21051 }
21057 && !processing_template_parmlist
21063 /* Peek at the next token. */
21065 /* Check for trivial parameter-declaration-clauses. */
21067 {
21068 /* Consume the `...' token. */
21071 }
21073 /* There are no parameters. */
21074 {
21075 #ifndef NO_IMPLICIT_EXTERN_C
21080 else
21081 #endif
21083 }
21084 /* Check for `(void)', too, which is a special case. */
21088 {
21089 /* Consume the `void' token. */
21091 /* There are no parameters. */
21093 }
21095 /* Parse the parameter-declaration-list. */
21097 /* If a parse error occurred while parsing the
21098 parameter-declaration-list, then the entire
21099 parameter-declaration-clause is erroneous. */
21103 /* Peek at the next token. */
21105 /* If it's a `,', the clause should terminate with an ellipsis. */
21107 {
21108 /* Consume the `,'. */
21110 /* Expect an ellipsis. */
21111 ellipsis_p
21113 }
21114 /* It might also be `...' if the optional trailing `,' was
21115 omitted. */
21117 {
21118 /* Consume the `...' token. */
21120 /* And remember that we saw it. */
21122 }
21123 else
21126 /* Finish the parameter list. */
21131 }
21133 /* Parse a parameter-declaration-list.
21135 parameter-declaration-list:
21136 parameter-declaration
21137 parameter-declaration-list , parameter-declaration
21139 Returns a representation of the parameter-declaration-list, as for
21140 cp_parser_parameter_declaration_clause. However, the
21141 `void_list_node' is never appended to the list. Upon return,
21142 *IS_ERROR will be true iff an error occurred. */
21144 static tree
21146 {
21152 /* Assume all will go well. */
21154 /* The special considerations that apply to a function within an
21155 unbraced linkage specifications do not apply to the parameters
21156 to the function. */
21157 saved_in_unbraced_linkage_specification_p
21161 /* Look for more parameters. */
21163 {
21171 /* Parse the parameter. */
21172 parameter
21177 /* We don't know yet if the enclosing context is deprecated, so wait
21178 and warn in grokparms if appropriate. */
21182 {
21183 /* If a function parameter pack was specified and an implicit template
21184 parameter was introduced during cp_parser_parameter_declaration,
21185 change any implicit parameters introduced into packs. */
21189 {
21197 }
21201 PARM,
21206 }
21210 /* If a parse error occurred parsing the parameter declaration,
21211 then the entire parameter-declaration-list is erroneous. */
21213 {
21217 }
21227 {
21231 }
21233 /* Add the new parameter to the list. */
21237 /* Peek at the next token. */
21240 /* These are for Objective-C++ */
21243 /* The parameter-declaration-list is complete. */
21246 {
21249 /* Peek at the next token. */
21251 /* If it's an ellipsis, then the list is complete. */
21254 /* Otherwise, there must be more parameters. Consume the
21255 `,'. */
21257 /* When parsing something like:
21259 int i(float f, double d)
21261 we can tell after seeing the declaration for "f" that we
21262 are not looking at an initialization of a variable "i",
21263 but rather at the declaration of a function "i".
21265 Due to the fact that the parsing of template arguments
21266 (as specified to a template-id) requires backtracking we
21267 cannot use this technique when inside a template argument
21268 list. */
21272 /* However, a parameter-declaration of the form
21273 "float(f)" (which is a valid declaration of a
21274 parameter "f") can also be interpreted as an
21275 expression (the conversion of "f" to "float"). */
21278 }
21279 else
21280 {
21288 }
21289 }
21291 parser->in_unbraced_linkage_specification_p
21294 /* Reset implicit_template_scope if we are about to leave the function
21295 parameter list that introduced it. Note that for out-of-line member
21296 definitions, there will be one or more class scopes before we get to
21297 the template parameter scope. */
21301 {
21305 {
21308 }
21309 }
21312 }
21314 /* Parse a parameter declaration.
21316 parameter-declaration:
21317 decl-specifier-seq ... [opt] declarator
21318 decl-specifier-seq declarator = assignment-expression
21319 decl-specifier-seq ... [opt] abstract-declarator [opt]
21320 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21322 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21323 declares a template parameter. (In that case, a non-nested `>'
21324 token encountered during the parsing of the assignment-expression
21325 is not interpreted as a greater-than operator.)
21327 Returns a representation of the parameter, or NULL if an error
21328 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21329 true iff the declarator is of the form "(p)". */
21335 {
21337 cp_decl_specifier_seq decl_specifiers;
21339 tree default_argument;
21344 /* In a template parameter, `>' is not an operator.
21346 [temp.param]
21348 When parsing a default template-argument for a non-type
21349 template-parameter, the first non-nested `>' is taken as the end
21350 of the template parameter-list rather than a greater-than
21351 operator. */
21353 /* Type definitions may not appear in parameter types. */
21355 parser->type_definition_forbidden_message
21358 /* Parse the declaration-specifiers. */
21361 CP_PARSER_FLAGS_NONE,
21365 /* Complain about missing 'typename' or other invalid type names. */
21370 /* If an error occurred, there's no reason to attempt to parse the
21371 rest of the declaration. */
21373 {
21376 }
21378 /* Peek at the next token. */
21381 /* If the next token is a `)', `,', `=', `>', or `...', then there
21382 is no declarator. However, when variadic templates are enabled,
21383 there may be a declarator following `...'. */
21388 {
21392 }
21393 /* Otherwise, there should be a declarator. */
21394 else
21395 {
21399 /* After seeing a decl-specifier-seq, if the next token is not a
21400 "(", there is no possibility that the code is a valid
21401 expression. Therefore, if parsing tentatively, we commit at
21402 this point. */
21404 /* In an expression context, having seen:
21406 (int((char ...
21408 we cannot be sure whether we are looking at a
21409 function-type (taking a "char" as a parameter) or a cast
21410 of some object of type "char" to "int". */
21416 /* Parse the declarator. */
21419 CP_PARSER_DECLARATOR_EITHER,
21421 parenthesized_p,
21425 /* After the declarator, allow more attributes. */
21426 decl_specifiers.attributes
21430 /* If the declarator is a template parameter pack, remember that and
21431 clear the flag in the declarator itself so we don't get errors
21432 from grokdeclarator. */
21434 {
21437 }
21438 }
21440 /* If the next token is an ellipsis, and we have not seen a declarator
21441 name, and if either the type of the declarator contains parameter
21442 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21443 for, eg, abbreviated integral type names), then we actually have a
21444 parameter pack expansion expression. Otherwise, leave the ellipsis
21445 for a C-style variadic function. */
21448 {
21459 {
21460 /* Consume the `...'. */
21464 /* Build a pack expansion type */
21469 else
21471 }
21472 }
21474 /* The restriction on defining new types applies only to the type
21475 of the parameter, not to the default argument. */
21478 /* If the next token is `=', then process a default argument. */
21480 {
21483 /* If we are defining a class, then the tokens that make up the
21484 default argument must be saved and processed later. */
21490 // A constrained-type-specifier may declare a type template-parameter.
21492 default_argument
21495 // A constrained-type-specifier may declare a template-template-parameter.
21497 default_argument
21500 /* Outside of a class definition, we can just parse the
21501 assignment-expression. */
21502 else
21503 default_argument
21507 {
21509 "default arguments are only "
21511 }
21513 || template_parameter_pack_p
21516 {
21517 /* Find the name of the parameter pack. */
21524 template_parm_p
21530 else
21532 template_parm_p
21539 }
21540 }
21541 else
21544 /* Generate a location for the parameter, ranging from the start of the
21545 initial token to the end of the final token (using input_location for
21546 the latter, set up by cp_lexer_set_source_position_from_token when
21547 consuming tokens).
21549 If we have a identifier, then use it for the caret location, e.g.
21551 extern int callee (int one, int (*two)(int, int), float three);
21552 ~~~~~~^~~~~~~~~~~~~~
21554 otherwise, reuse the start location for the caret location e.g.:
21556 extern int callee (int one, int (*)(int, int), float three);
21557 ^~~~~~~~~~~~~~~~~
21559 */
21565 input_location);
21568 declarator,
21569 default_argument,
21570 param_loc,
21571 template_parameter_pack_p);
21572 }
21574 /* Parse a default argument and return it.
21576 TEMPLATE_PARM_P is true if this is a default argument for a
21577 non-type template parameter. */
21578 static tree
21580 {
21586 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21587 set correctly. */
21590 /* Local variable names (and the `this' keyword) may not
21591 appear in a default argument. */
21594 /* Parse the assignment-expression. */
21599 /* The "this" pointer is not valid in a default argument. */
21601 {
21606 }
21607 default_argument
21609 /* Restore the "this" pointer. */
21611 {
21614 }
21623 }
21625 /* Parse a function-body.
21627 function-body:
21628 compound_statement */
21630 static void
21632 {
21636 }
21638 /* Parse a ctor-initializer-opt followed by a function-body. Return
21639 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21640 is true we are parsing a function-try-block. */
21642 static void
21645 {
21652 /* Begin the function body. */
21654 /* Parse the optional ctor-initializer. */
21657 /* If we're parsing a constexpr constructor definition, we need
21658 to check that the constructor body is indeed empty. However,
21659 before we get to cp_parser_function_body lot of junk has been
21660 generated, so we can't just check that we have an empty block.
21661 Rather we take a snapshot of the outermost block, and check whether
21662 cp_parser_function_body changed its state. */
21664 {
21668 }
21669 /* Parse the function-body. */
21673 /* Finish the function body. */
21675 }
21677 /* Parse an initializer.
21679 initializer:
21680 = initializer-clause
21681 ( expression-list )
21683 Returns an expression representing the initializer. If no
21684 initializer is present, NULL_TREE is returned.
21686 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21687 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21688 set to TRUE if there is no initializer present. If there is an
21689 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21690 is set to true; otherwise it is set to false. */
21692 static tree
21695 {
21697 tree init;
21699 /* Peek at the next token. */
21702 /* Let our caller know whether or not this initializer was
21703 parenthesized. */
21705 /* Assume that the initializer is constant. */
21709 {
21710 /* Consume the `='. */
21712 /* Parse the initializer-clause. */
21714 }
21716 {
21721 non_constant_p);
21726 }
21728 {
21733 }
21734 else
21735 {
21736 /* Anything else is an error. */
21739 }
21745 }
21747 /* Parse an initializer-clause.
21749 initializer-clause:
21750 assignment-expression
21751 braced-init-list
21753 Returns an expression representing the initializer.
21755 If the `assignment-expression' production is used the value
21756 returned is simply a representation for the expression.
21758 Otherwise, calls cp_parser_braced_list. */
21760 static cp_expr
21762 {
21763 cp_expr initializer;
21765 /* Assume the expression is constant. */
21768 /* If it is not a `{', then we are looking at an
21769 assignment-expression. */
21771 {
21772 initializer
21775 non_constant_p);
21776 }
21777 else
21781 }
21783 /* Parse a brace-enclosed initializer list.
21785 braced-init-list:
21786 { initializer-list , [opt] }
21787 { designated-initializer-list , [opt] }
21788 { }
21790 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21791 the elements of the initializer-list (or NULL, if the last
21792 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21793 NULL_TREE. There is no way to detect whether or not the optional
21794 trailing `,' was provided. NON_CONSTANT_P is as for
21795 cp_parser_initializer. */
21797 static cp_expr
21799 {
21800 tree initializer;
21803 /* Consume the `{' token. */
21804 matching_braces braces;
21806 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21808 /* If it's not a `}', then there is a non-trivial initializer. */
21810 {
21811 /* Parse the initializer list. */
21814 /* A trailing `,' token is allowed. */
21817 }
21818 else
21820 /* Now, there should be a trailing `}'. */
21826 /* Build a location of the form:
21827 { ... }
21828 ^~~~~~~
21829 with caret==start at the open brace, finish at the close brace. */
21833 }
21835 /* Consume tokens up to, and including, the next non-nested closing `]'.
21836 Returns true iff we found a closing `]'. */
21838 static bool
21840 {
21844 {
21848 {
21851 /* If we've run out of tokens, then there is no closing `]'. */
21860 {
21863 }
21868 }
21870 /* Consume the token. */
21872 }
21873 }
21875 /* Return true if we are looking at an array-designator, false otherwise. */
21877 static bool
21879 {
21880 /* Consume the `['. */
21885 /* Skip tokens until the next token is a closing square bracket.
21886 If we find the closing `]', and the next token is a `=', then
21887 we are looking at an array designator. */
21888 bool array_designator_p
21892 /* Roll back the tokens we skipped. */
21896 }
21898 /* Parse an initializer-list.
21900 initializer-list:
21901 initializer-clause ... [opt]
21902 initializer-list , initializer-clause ... [opt]
21904 C++2A Extension:
21906 designated-initializer-list:
21907 designated-initializer-clause
21908 designated-initializer-list , designated-initializer-clause
21910 designated-initializer-clause:
21911 designator brace-or-equal-initializer
21913 designator:
21914 . identifier
21916 GNU Extension:
21918 initializer-list:
21919 designation initializer-clause ...[opt]
21920 initializer-list , designation initializer-clause ...[opt]
21922 designation:
21923 . identifier =
21924 identifier :
21925 [ constant-expression ] =
21927 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21928 for the initializer. If the INDEX of the elt is non-NULL, it is the
21929 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21930 as for cp_parser_initializer. */
21934 {
21939 /* Assume all of the expressions are constant. */
21942 /* Parse the rest of the list. */
21944 {
21946 tree designator;
21947 tree initializer;
21951 /* Handle the C++2A syntax, '. id ='. */
21959 {
21962 "C++ designated initializers only available with "
21964 /* Consume the `.'. */
21966 /* Consume the identifier. */
21969 /* Consume the `='. */
21971 }
21972 /* Also, if the next token is an identifier and the following one is a
21973 colon, we are looking at the GNU designated-initializer
21974 syntax. */
21979 {
21980 /* Warn the user that they are using an extension. */
21983 /* Consume the identifier. */
21985 /* Consume the `:'. */
21987 }
21988 /* Also handle C99 array designators, '[ const ] ='. */
21992 {
21993 /* In C++11, [ could start a lambda-introducer. */
21999 {
22002 }
22003 else
22004 {
22009 }
22016 /* Warn the user that they are using an extension. */
22019 }
22020 else
22024 {
22027 }
22031 {
22035 }
22039 /* Parse the initializer. */
22042 /* If any clause is non-constant, so is the entire initializer. */
22046 /* If we have an ellipsis, this is an initializer pack
22047 expansion. */
22049 {
22052 /* Consume the `...'. */
22059 /* Turn the initializer into an initializer expansion. */
22061 }
22063 /* Add it to the vector. */
22066 /* If the next token is not a comma, we have reached the end of
22067 the list. */
22071 /* Peek at the next token. */
22073 /* If the next token is a `}', then we're still done. An
22074 initializer-clause can have a trailing `,' after the
22075 initializer-list and before the closing `}'. */
22079 /* Consume the `,' token. */
22081 }
22083 /* The same identifier shall not appear in multiple designators
22084 of a designated-initializer-list. */
22086 {
22091 {
22093 {
22095 "%<.%s%> designator used multiple times in "
22099 }
22100 else
22102 }
22106 }
22109 }
22111 /* Classes [gram.class] */
22113 /* Parse a class-name.
22115 class-name:
22116 identifier
22117 template-id
22119 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22120 to indicate that names looked up in dependent types should be
22121 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22122 keyword has been used to indicate that the name that appears next
22123 is a template. TAG_TYPE indicates the explicit tag given before
22124 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22125 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22126 is the class being defined in a class-head. If ENUM_OK is TRUE,
22127 enum-names are also accepted.
22129 Returns the TYPE_DECL representing the class. */
22131 static tree
22140 {
22141 tree decl;
22142 tree scope;
22147 /* All class-names start with an identifier. */
22150 {
22153 }
22155 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22156 to a template-id, so we save it here. */
22161 /* Any name names a type if we're following the `typename' keyword
22162 in a qualified name where the enclosing scope is type-dependent. */
22165 /* Handle the common case (an identifier, but not a template-id)
22166 efficiently. */
22169 {
22173 /* Look for the identifier. */
22177 /* If the next token isn't an identifier, we are certainly not
22178 looking at a class-name. */
22181 /* If we know this is a type-name, there's no need to look it
22182 up. */
22185 else
22186 {
22187 tree ambiguous_decls;
22188 /* If we already know that this lookup is ambiguous, then
22189 we've already issued an error message; there's no reason
22190 to check again. */
22192 {
22195 }
22196 /* If the next token is a `::', then the name must be a type
22197 name.
22199 [basic.lookup.qual]
22201 During the lookup for a name preceding the :: scope
22202 resolution operator, object, function, and enumerator
22203 names are ignored. */
22206 /* Look up the name. */
22208 tag_type,
22211 check_dependency_p,
22215 {
22219 }
22220 }
22221 }
22222 else
22223 {
22224 /* Try a template-id. */
22226 check_dependency_p,
22227 tag_type,
22228 is_declaration);
22231 }
22235 /* If this is a typename, create a TYPENAME_TYPE. */
22237 {
22242 }
22246 /* Check to see that it is really the name of a class. */
22250 /* Situations like this:
22252 template <typename T> struct A {
22253 typename T::template X<int>::I i;
22254 };
22256 are problematic. Is `T::template X<int>' a class-name? The
22257 standard does not seem to be definitive, but there is no other
22258 valid interpretation of the following `::'. Therefore, those
22259 names are considered class-names. */
22260 {
22264 }
22269 /* In Objective-C 2.0, a classname followed by '.' starts a
22270 dot-syntax expression, and it's not a type-name. */
22282 }
22284 /* Parse a class-specifier.
22286 class-specifier:
22287 class-head { member-specification [opt] }
22289 Returns the TREE_TYPE representing the class. */
22291 static tree
22293 {
22294 tree type;
22308 /* Parse the class-head. */
22311 /* If the class-head was a semantic disaster, skip the entire body
22312 of the class. */
22314 {
22318 }
22320 /* Look for the `{'. */
22321 matching_braces braces;
22323 {
22326 }
22331 /* Issue an error message if type-definitions are forbidden here. */
22333 /* Remember that we are defining one more class. */
22335 /* Inside the class, surrounding template-parameter-lists do not
22336 apply. */
22337 saved_num_template_parameter_lists
22340 /* We are not in a function body. */
22343 /* Or in a loop. */
22346 /* Or in a switch. */
22349 /* We are not immediately inside an extern "lang" block. */
22350 saved_in_unbraced_linkage_specification_p
22354 // Associate constraints with the type.
22358 /* Start the class. */
22360 {
22363 }
22367 /* If the type is erroneous, skip the entire body of the class. */
22369 else
22370 /* Parse the member-specification. */
22373 /* Look for the trailing `}'. */
22375 /* Look for trailing attributes to apply to this class. */
22383 /* We've finished a type definition. Check for the common syntax
22384 error of forgetting a semicolon after the definition. We need to
22385 be careful, as we can't just check for not-a-semicolon and be done
22386 with it; the user might have typed:
22388 class X { } c = ...;
22389 class X { } *p = ...;
22391 and so forth. Instead, enumerate all the possible tokens that
22392 might follow this production; if we don't see one of them, then
22393 complain and silently insert the semicolon. */
22394 {
22399 /* Don't try to parse c++11 attributes here. As per the
22400 grammar, that should be a task for
22401 cp_parser_decl_specifier_seq. */
22405 {
22416 /* While it's legal for type qualifiers and storage class
22417 specifiers to follow type definitions in the grammar, only
22418 compiler testsuites contain code like that. Assume that if
22419 we see such code, then what we're really seeing is a case
22420 like:
22422 class X { }
22423 const <type> var = ...;
22425 or
22427 class Y { }
22428 static <type> func (...) ...
22430 i.e. the qualifier or specifier applies to the next
22431 declaration. To do so, however, we need to look ahead one
22432 more token to see if *that* token is a type specifier.
22434 This code could be improved to handle:
22436 class Z { }
22437 static const <type> var = ...; */
22440 {
22443 /* Handling user-defined types here would be nice, but very
22444 tricky. */
22445 want_semicolon
22448 }
22452 }
22454 /* If we don't have a type, then something is very wrong and we
22455 shouldn't try to do anything clever. Likewise for not seeing the
22456 closing brace. */
22458 {
22459 /* Locate the closing brace. */
22460 cp_token_position prev
22465 /* We want to suggest insertion of a ';' immediately *after* the
22466 closing brace, so, if we can, offset the location by 1 column. */
22473 /* If we successfully offset the location, suggest the fix-it. */
22486 else
22489 /* Unget one token and smash it to look as though we encountered
22490 a semicolon in the input stream. */
22495 }
22496 }
22498 /* If this class is not itself within the scope of another class,
22499 then we need to parse the bodies of all of the queued function
22500 definitions. Note that the queued functions defined in a class
22501 are not always processed immediately following the
22502 class-specifier for that class. Consider:
22504 struct A {
22505 struct B { void f() { sizeof (A); } };
22506 };
22508 If `f' were processed before the processing of `A' were
22509 completed, there would be no way to compute the size of `A'.
22510 Note that the nesting we are interested in here is lexical --
22511 not the semantic nesting given by TYPE_CONTEXT. In particular,
22512 for:
22514 struct A { struct B; };
22515 struct A::B { void f() { } };
22517 there is no need to delay the parsing of `A::B::f'. */
22519 {
22520 tree decl;
22527 /* In a first pass, parse default arguments to the functions.
22528 Then, in a second pass, parse the bodies of the functions.
22529 This two-phased approach handles cases like:
22531 struct S {
22532 void f() { g(); }
22533 void g(int i = 3);
22534 };
22536 */
22538 {
22540 /* If there are default arguments that have not yet been processed,
22541 take care of them now. */
22543 {
22548 }
22549 /* Make sure that any template parameters are in scope. */
22551 /* Parse the default argument expressions. */
22553 /* Remove any template parameters from the symbol table. */
22555 }
22557 /* Now parse any NSDMIs. */
22561 {
22563 {
22568 }
22571 }
22578 /* Now do some post-NSDMI bookkeeping. */
22584 /* Now parse the body of the functions. */
22586 {
22587 /* OpenMP UDRs need to be parsed before all other functions. */
22594 }
22595 else
22599 }
22600 else
22603 /* Put back any saved access checks. */
22606 /* Restore saved state. */
22610 parser->num_template_parameter_lists
22612 parser->in_unbraced_linkage_specification_p
22616 }
22618 static tree
22620 {
22621 tree ret;
22626 }
22628 /* Parse a class-head.
22630 class-head:
22631 class-key identifier [opt] base-clause [opt]
22632 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22633 class-key nested-name-specifier [opt] template-id
22634 base-clause [opt]
22636 class-virt-specifier:
22637 final
22639 GNU Extensions:
22640 class-key attributes identifier [opt] base-clause [opt]
22641 class-key attributes nested-name-specifier identifier base-clause [opt]
22642 class-key attributes nested-name-specifier [opt] template-id
22643 base-clause [opt]
22645 Upon return BASES is initialized to the list of base classes (or
22646 NULL, if there are none) in the same form returned by
22647 cp_parser_base_clause.
22649 Returns the TYPE of the indicated class. Sets
22650 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22651 involving a nested-name-specifier was used, and FALSE otherwise.
22653 Returns error_mark_node if this is not a class-head.
22655 Returns NULL_TREE if the class-head is syntactically valid, but
22656 semantically invalid in a way that means we should skip the entire
22657 body of the class. */
22659 static tree
22662 {
22663 tree nested_name_specifier;
22667 tree attributes;
22668 tree bases;
22678 /* Assume no nested-name-specifier will be present. */
22680 /* Assume no template parameter lists will be used in defining the
22681 type. */
22685 /* Look for the class-key. */
22692 /* Parse the attributes. */
22695 /* If the next token is `::', that is invalid -- but sometimes
22696 people do try to write:
22698 struct ::S {};
22700 Handle this gracefully by accepting the extra qualifier, and then
22701 issuing an error about it later if this really is a
22702 class-head. If it turns out just to be an elaborated type
22703 specifier, remain silent. */
22709 /* Determine the name of the class. Begin by looking for an
22710 optional nested-name-specifier. */
22712 nested_name_specifier
22718 /* If there was a nested-name-specifier, then there *must* be an
22719 identifier. */
22724 {
22726 /* Although the grammar says `identifier', it really means
22727 `class-name' or `template-name'. You are only allowed to
22728 define a class that has already been declared with this
22729 syntax.
22731 The proposed resolution for Core Issue 180 says that wherever
22732 you see `class T::X' you should treat `X' as a type-name.
22734 It is OK to define an inaccessible class; for example:
22736 class A { class B; };
22737 class A::B {};
22739 We do not know if we will see a class-name, or a
22740 template-name. We look for a class-name first, in case the
22741 class-name is a template-id; if we looked for the
22742 template-name first we would stop after the template-name. */
22749 class_type,
22753 /* If that didn't work, ignore the nested-name-specifier. */
22755 {
22761 }
22762 /* If we could not find a corresponding TYPE, treat this
22763 declaration like an unqualified declaration. */
22766 /* Otherwise, count the number of templates used in TYPE and its
22767 containing scopes. */
22768 else
22769 {
22770 tree scope;
22782 }
22783 }
22784 /* Otherwise, the identifier is optional. */
22785 else
22786 {
22787 /* We don't know whether what comes next is a template-id,
22788 an identifier, or nothing at all. */
22790 /* Check for a template-id. */
22795 class_key,
22797 /* If that didn't work, it could still be an identifier. */
22799 {
22801 {
22804 }
22805 else
22807 }
22808 else
22809 {
22812 }
22813 }
22818 {
22820 class_key,
22822 }
22825 /* If it's not a `:' or a `{' then we can't really be looking at a
22826 class-head, since a class-head only appears as part of a
22827 class-specifier. We have to detect this situation before calling
22828 xref_tag, since that has irreversible side-effects. */
22830 {
22834 }
22836 /* At this point, we're going ahead with the class-specifier, even
22837 if some other problem occurs. */
22840 {
22845 }
22846 /* Issue the error about the overly-qualified name now. */
22848 {
22853 }
22855 {
22860 }
22862 {
22863 tree scope;
22866 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22867 keyword template shall not appear at the top level. */
22871 /* Reject typedef-names in class heads. */
22873 {
22876 type);
22879 }
22881 /* Figure out in what scope the declaration is being placed. */
22883 /* If that scope does not contain the scope in which the
22884 class was originally declared, the program is invalid. */
22886 {
22889 "declaration of %qD in namespace %qD which does not "
22892 else
22898 }
22899 /* [dcl.meaning]
22901 A declarator-id shall not be qualified except for the
22902 definition of a ... nested class outside of its class
22903 ... [or] the definition or explicit instantiation of a
22904 class member of a namespace outside of its namespace. */
22906 {
22911 }
22912 }
22913 /* An explicit-specialization must be preceded by "template <>". If
22914 it is not, try to recover gracefully. */
22917 && !processing_template_parmlist
22919 {
22920 /* Build a location of this form:
22921 struct typename <ARGS>
22922 ^~~~~~~~~~~~~~~~~~~~~~
22923 with caret==start at the start token, and
22924 finishing at the end of the type. */
22925 location_t reported_loc
22927 class_head_start_location,
22933 "an explicit specialization must be preceded by"
22936 /* Take the same action that would have been taken by
22937 cp_parser_explicit_specialization. */
22940 }
22941 /* There must be no "return" statements between this point and the
22942 end of this function; set "type "to the correct return value and
22943 use "goto done;" to return. */
22944 /* Make sure that the right number of template parameters were
22945 present. */
22949 {
22950 /* If something went wrong, there is no point in even trying to
22951 process the class-definition. */
22954 }
22956 /* Look up the type. */
22958 {
22962 {
22966 }
22967 else
22968 {
22972 /* Check the scope while we still know whether or not we had a
22973 nested-name-specifier. */
22976 }
22979 }
22981 {
22982 tree class_type;
22984 /* Given:
22986 template <typename T> struct S { struct T };
22987 template <typename T> struct S<T>::T { };
22989 we will get a TYPENAME_TYPE when processing the definition of
22990 `S::T'. We need to resolve it to the actual type before we
22991 try to define it. */
22993 {
22998 else
22999 {
23002 }
23003 }
23007 {
23010 }
23013 /* Enter the scope indicated by the nested-name-specifier. */
23015 /* Get the canonical version of this type. */
23017 /* Call push_template_decl if it seems like we should be defining a
23018 template either from the template headers or the type we're
23019 defining, so that we diagnose both extra and missing headers. */
23023 {
23026 {
23029 }
23030 }
23034 }
23036 {
23037 /* If the class was unnamed, create a dummy name. */
23041 ? ts_within_enclosing_non_class
23045 }
23047 /* Indicate whether this class was declared as a `class' or as a
23048 `struct'. */
23053 /* If this type was already complete, and we see another definition,
23054 that's an error. */
23056 {
23058 type);
23060 type);
23063 }
23068 {
23069 /* Apply attributes now, before any use of the class as a template
23070 argument in its base list. */
23073 }
23075 /* We will have entered the scope containing the class; the names of
23076 base classes should be looked up in that context. For example:
23078 struct A { struct B {}; struct C; };
23079 struct A::C : B {};
23081 is valid. */
23083 /* Get the list of base-classes, if there is one. */
23085 {
23086 /* PR59482: enter the class scope so that base-specifiers are looked
23087 up correctly. */
23091 /* PR59482: get out of the previously pushed class scope so that the
23092 subsequent pops pop the right thing. */
23095 }
23096 else
23099 /* If we're really defining a class, process the base classes.
23100 If they're invalid, fail. */
23104 done:
23105 /* Leave the scope given by the nested-name-specifier. We will
23106 enter the class scope itself while processing the members. */
23111 {
23114 }
23120 out:
23123 }
23125 /* Parse a class-key.
23127 class-key:
23128 class
23129 struct
23130 union
23132 Returns the kind of class-key specified, or none_type to indicate
23133 error. */
23135 static enum tag_types
23137 {
23141 /* Look for the class-key. */
23146 /* Check to see if the TOKEN is a class-key. */
23151 }
23153 /* Parse a type-parameter-key.
23155 type-parameter-key:
23156 class
23157 typename
23158 */
23160 static void
23162 {
23163 /* Look for the type-parameter-key. */
23167 {
23170 /* typename is not allowed in a template template parameter
23171 by the standard until C++17. */
23173 "ISO C++ forbids typename key in template template parameter;"
23175 }
23176 else
23180 }
23182 /* Parse an (optional) member-specification.
23184 member-specification:
23185 member-declaration member-specification [opt]
23186 access-specifier : member-specification [opt] */
23188 static void
23190 {
23192 {
23196 /* Peek at the next token. */
23198 /* If it's a `}', or EOF then we've seen all the members. */
23204 /* See if this token is a keyword. */
23207 {
23211 /* Consume the access-specifier. */
23213 /* Remember which access-specifier is active. */
23215 /* Look for the `:'. */
23220 /* Accept #pragmas at class scope. */
23222 {
23225 }
23227 /* Otherwise, the next construction must be a
23228 member-declaration. */
23230 }
23231 }
23232 }
23234 /* Parse a member-declaration.
23236 member-declaration:
23237 decl-specifier-seq [opt] member-declarator-list [opt] ;
23238 function-definition ; [opt]
23239 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23240 using-declaration
23241 template-declaration
23242 alias-declaration
23244 member-declarator-list:
23245 member-declarator
23246 member-declarator-list , member-declarator
23248 member-declarator:
23249 declarator pure-specifier [opt]
23250 declarator constant-initializer [opt]
23251 identifier [opt] : constant-expression
23253 GNU Extensions:
23255 member-declaration:
23256 __extension__ member-declaration
23258 member-declarator:
23259 declarator attributes [opt] pure-specifier [opt]
23260 declarator attributes [opt] constant-initializer [opt]
23261 identifier [opt] attributes [opt] : constant-expression
23263 C++0x Extensions:
23265 member-declaration:
23266 static_assert-declaration */
23268 static void
23270 {
23271 cp_decl_specifier_seq decl_specifiers;
23272 tree prefix_attributes;
23273 tree decl;
23282 /* Check for the `__extension__' keyword. */
23284 {
23285 /* Recurse. */
23287 /* Restore the old value of the PEDANTIC flag. */
23291 }
23293 /* Check for a template-declaration. */
23295 {
23296 /* An explicit specialization here is an error condition, and we
23297 expect the specialization handler to detect and report this. */
23301 else
23305 }
23306 /* Check for a template introduction. */
23310 /* Check for a using-declaration. */
23312 {
23314 {
23315 /* Parse the using-declaration. */
23319 }
23320 else
23321 {
23322 tree decl;
23326 /* Note that if we actually see the '=' token after the
23327 identifier, cp_parser_alias_declaration commits the
23328 tentative parse. In that case, we really expect an
23329 alias-declaration. Otherwise, we expect a using
23330 declaration. */
23331 alias_decl_expected =
23337 else
23341 }
23342 }
23344 /* Check for @defs. */
23346 {
23351 {
23356 }
23358 }
23360 /* If the next token is `static_assert' we have a static assertion. */
23362 {
23365 }
23372 /* Parse the decl-specifier-seq. */
23375 CP_PARSER_FLAGS_OPTIONAL,
23378 /* Check for an invalid type-name. */
23382 /* If there is no declarator, then the decl-specifier-seq should
23383 specify a type. */
23385 {
23386 /* If there was no decl-specifier-seq, and the next token is a
23387 `;', then we have something like:
23389 struct S { ; };
23391 [class.mem]
23393 Each member-declaration shall declare at least one member
23394 name of the class. */
23396 {
23399 {
23403 }
23404 }
23405 else
23406 {
23407 tree type;
23409 /* See if this declaration is a friend. */
23411 /* If there were decl-specifiers, check to see if there was
23412 a class-declaration. */
23415 /* Nested classes have already been added to the class, but
23416 a `friend' needs to be explicitly registered. */
23418 {
23419 /* If the `friend' keyword was present, the friend must
23420 be introduced with a class-key. */
23423 "in C++03 a class-key must be used "
23425 /* In this case:
23427 template <typename T> struct A {
23428 friend struct A<T>::B;
23429 };
23431 A<T>::B will be represented by a TYPENAME_TYPE, and
23432 therefore not recognized by check_tag_decl. */
23434 {
23438 }
23441 "friend declaration does not name a class or "
23443 else
23446 }
23447 /* If there is no TYPE, an error message will already have
23448 been issued. */
23450 ;
23451 /* An anonymous aggregate has to be handled specially; such
23452 a declaration really declares a data member (with a
23453 particular type), as opposed to a nested class. */
23455 {
23456 /* C++11 9.5/6. */
23459 "a storage class on an anonymous aggregate "
23462 /* Remove constructors and such from TYPE, now that we
23463 know it is an anonymous aggregate. */
23465 /* And make the corresponding data member. */
23468 /* Add it to the class. */
23470 }
23471 else
23472 cp_parser_check_access_in_redeclaration
23475 }
23476 }
23477 else
23478 {
23481 /* Clear attributes from the decl_specifiers but keep them
23482 around as prefix attributes that apply them to the entity
23483 being declared. */
23487 /* See if these declarations will be friends. */
23490 /* Keep going until we hit the `;' at the end of the
23491 declaration. */
23493 {
23495 tree first_attribute;
23496 tree initializer;
23500 /* Peek at the next token. */
23503 /* The following code wants to know early if it is a bit-field
23504 or some other declaration. Attributes can appear before
23505 the `:' token, but are hopefully rare enough that the
23506 simplicity of the tentative lookup pays off. */
23511 {
23519 }
23521 /* Check for a bitfield declaration. */
23527 {
23528 tree identifier;
23529 tree width;
23534 else
23537 /* Look for attributes that apply to the bitfield. */
23540 /* Consume the `:' token. */
23543 /* Get the width of the bitfield. */
23547 /* In C++2A and as extension for C++11 and above we allow
23548 default member initializers for bit-fields. */
23553 CPP_OPEN_BRACE)))
23554 {
23555 location_t loc
23561 "default member initializers for bit-fields "
23562 "only available with -std=c++2a or "
23567 {
23571 }
23572 }
23573 else
23574 {
23575 /* Look for attributes that apply to the bitfield after
23576 the `:' token and width. This is where GCC used to
23577 parse attributes in the past, pedwarn if there is
23578 a std attribute. */
23581 "ISO C++ allows bit-field attributes only "
23585 }
23589 /* Remember which attributes are prefix attributes and
23590 which are not. */
23592 /* Combine the attributes. */
23595 /* Create the bitfield declaration. */
23598 identifier,
23599 sfk_none)
23603 attributes);
23604 }
23605 else
23606 {
23608 tree asm_specification;
23611 /* Parse the declarator. */
23612 declarator
23617 friend_p);
23619 /* If something went wrong parsing the declarator, make sure
23620 that we at least consume some tokens. */
23622 {
23623 /* Skip to the end of the statement. */
23625 /* If the next token is not a semicolon, that is
23626 probably because we just skipped over the body of
23627 a function. So, we consume a semicolon if
23628 present, but do not issue an error message if it
23629 is not present. */
23631 CPP_SEMICOLON))
23634 }
23637 cp_parser_check_for_definition_in_return_type
23641 /* Look for an asm-specification. */
23643 /* Look for attributes that apply to the declaration. */
23645 /* Remember which attributes are prefix attributes and
23646 which are not. */
23648 /* Combine the attributes. */
23651 /* If it's an `=', then we have a constant-initializer or a
23652 pure-specifier. It is not correct to parse the
23653 initializer before registering the member declaration
23654 since the member declaration should be in scope while
23655 its initializer is processed. However, the rest of the
23656 front end does not yet provide an interface that allows
23657 us to handle this correctly. */
23659 {
23660 /* In [class.mem]:
23662 A pure-specifier shall be used only in the declaration of
23663 a virtual function.
23665 A member-declarator can contain a constant-initializer
23666 only if it declares a static member of integral or
23667 enumeration type.
23669 Therefore, if the DECLARATOR is for a function, we look
23670 for a pure-specifier; otherwise, we look for a
23671 constant-initializer. When we call `grokfield', it will
23672 perform more stringent semantics checks. */
23684 {
23686 /* Don't require a constant rvalue in C++11, since we
23687 might want a reference constant. We'll enforce
23688 constancy later. */
23690 /* Parse the initializer. */
23693 }
23694 else
23695 /* Parse the initializer. */
23697 }
23700 {
23704 else
23706 }
23707 /* Otherwise, there is no initializer. */
23708 else
23711 /* See if we are probably looking at a function
23712 definition. We are certainly not looking at a
23713 member-declarator. Calling `grokfield' has
23714 side-effects, so we must not do it unless we are sure
23715 that we are looking at a member-declarator. */
23718 {
23719 /* The grammar does not allow a pure-specifier to be
23720 used when a member function is defined. (It is
23721 possible that this fact is an oversight in the
23722 standard, since a pure function may be defined
23723 outside of the class-specifier. */
23729 declarator,
23730 attributes);
23733 /* If the member was not a friend, declare it here. */
23736 /* Peek at the next token. */
23738 /* If the next token is a semicolon, consume it. */
23740 {
23741 location_t semicolon_loc
23746 "extra %<;%> after in-class "
23748 }
23750 }
23751 else
23754 /* Create the declaration. */
23759 {
23762 else
23764 }
23765 }
23770 /* Reset PREFIX_ATTRIBUTES. */
23776 /* If there is any qualification still in effect, clear it
23777 now; we will be starting fresh with the next declarator. */
23781 /* If it's a `,', then there are more declarators. */
23783 {
23786 {
23792 }
23793 }
23794 /* If the next token isn't a `;', then we have a parse error. */
23796 CPP_SEMICOLON))
23797 {
23798 /* The next token might be a ways away from where the
23799 actual semicolon is missing. Find the previous token
23800 and use that for our error position. */
23807 /* Assume that the user meant to provide a semicolon. If
23808 we were to cp_parser_skip_to_end_of_statement, we might
23809 skip to a semicolon inside a member function definition
23810 and issue nonsensical error messages. */
23812 }
23815 {
23816 /* Add DECL to the list of members. */
23818 /* Explicitly include, eg, NSDMIs, for better error
23819 recovery (c++/58650). */
23827 /* Add DECL to the queue of NSDMI to be parsed later. */
23829 }
23833 }
23834 }
23837 out:
23839 }
23841 /* Parse a pure-specifier.
23843 pure-specifier:
23844 = 0
23846 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23847 Otherwise, ERROR_MARK_NODE is returned. */
23849 static tree
23851 {
23854 /* Look for the `=' token. */
23857 /* Look for the `0' token. */
23866 /* Accept = default or = delete in c++0x mode. */
23869 {
23872 }
23874 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23876 {
23881 }
23883 {
23886 }
23889 }
23891 /* Parse a constant-initializer.
23893 constant-initializer:
23894 = constant-expression
23896 Returns a representation of the constant-expression. */
23898 static tree
23900 {
23901 /* Look for the `=' token. */
23905 /* It is invalid to write:
23907 struct S { static const int i = { 7 }; };
23909 */
23911 {
23914 /* Consume the opening brace. */
23915 matching_braces braces;
23917 /* Skip the initializer. */
23919 /* Look for the trailing `}'. */
23923 }
23926 }
23928 /* Derived classes [gram.class.derived] */
23930 /* Parse a base-clause.
23932 base-clause:
23933 : base-specifier-list
23935 base-specifier-list:
23936 base-specifier ... [opt]
23937 base-specifier-list , base-specifier ... [opt]
23939 Returns a TREE_LIST representing the base-classes, in the order in
23940 which they were declared. The representation of each node is as
23941 described by cp_parser_base_specifier.
23943 In the case that no bases are specified, this function will return
23944 NULL_TREE, not ERROR_MARK_NODE. */
23946 static tree
23948 {
23951 /* Look for the `:' that begins the list. */
23954 /* Scan the base-specifier-list. */
23956 {
23958 tree base;
23961 /* Look for the base-specifier. */
23963 /* Look for the (optional) ellipsis. */
23965 {
23966 /* Consume the `...'. */
23970 }
23972 /* Add BASE to the front of the list. */
23974 {
23976 /* Make this a pack expansion type. */
23980 {
23983 }
23984 }
23985 /* Peek at the next token. */
23987 /* If it's not a comma, then the list is complete. */
23990 /* Consume the `,'. */
23992 }
23994 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23995 base class had a qualified name. However, the next name that
23996 appears is certainly not qualified. */
24002 }
24004 /* Parse a base-specifier.
24006 base-specifier:
24007 :: [opt] nested-name-specifier [opt] class-name
24008 virtual access-specifier [opt] :: [opt] nested-name-specifier
24009 [opt] class-name
24010 access-specifier virtual [opt] :: [opt] nested-name-specifier
24011 [opt] class-name
24013 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24014 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24015 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24016 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24018 static tree
24020 {
24028 tree type;
24030 /* Process the optional `virtual' and `access-specifier'. */
24032 {
24033 /* Peek at the next token. */
24035 /* Process `virtual'. */
24037 {
24039 /* If `virtual' appears more than once, issue an error. */
24041 {
24045 }
24049 /* Consume the `virtual' token. */
24057 /* If more than one access specifier appears, issue an
24058 error. */
24061 {
24065 }
24069 /* Consume the access-specifier. */
24077 }
24078 }
24079 /* It is not uncommon to see programs mechanically, erroneously, use
24080 the 'typename' keyword to denote (dependent) qualified types
24081 as base classes. */
24083 {
24088 else
24090 "keyword %<typename%> not allowed in this context "
24093 }
24095 /* Look for the optional `::' operator. */
24097 /* Look for the nested-name-specifier. The simplest way to
24098 implement:
24100 [temp.res]
24102 The keyword `typename' is not permitted in a base-specifier or
24103 mem-initializer; in these contexts a qualified name that
24104 depends on a template-parameter is implicitly assumed to be a
24105 type name.
24107 is to pretend that we have seen the `typename' keyword at this
24108 point. */
24114 /* If the base class is given by a qualified name, assume that names
24115 we see are type names or templates, as appropriate. */
24121 /* DR 950 allows decltype as a base-specifier. */
24123 else
24124 {
24125 /* Otherwise, look for the class-name. */
24127 class_scope_p,
24128 template_p,
24129 typename_type,
24134 }
24140 }
24142 /* Exception handling [gram.exception] */
24144 /* Parse an (optional) noexcept-specification.
24146 noexcept-specification:
24147 noexcept ( constant-expression ) [opt]
24149 If no noexcept-specification is present, returns NULL_TREE.
24150 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24151 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24152 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24153 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24154 in which case a boolean condition is returned instead. */
24156 static tree
24161 {
24165 /* Peek at the next token. */
24168 /* Is it a noexcept-specification? */
24170 {
24171 tree expr;
24175 {
24176 matching_parens parens;
24180 {
24181 /* Types may not be defined in an exception-specification. */
24183 parser->type_definition_forbidden_message
24188 /* Restore the saved message. */
24190 }
24191 else
24192 {
24195 }
24198 }
24199 else
24200 {
24204 }
24206 /* We cannot build a noexcept-spec right away because this will check
24207 that expr is a constexpr. */
24210 else
24212 }
24213 else
24215 }
24217 /* Parse an (optional) exception-specification.
24219 exception-specification:
24220 throw ( type-id-list [opt] )
24222 Returns a TREE_LIST representing the exception-specification. The
24223 TREE_VALUE of each node is a type. */
24225 static tree
24227 {
24229 tree type_id_list;
24232 /* Peek at the next token. */
24235 /* Is it a noexcept-specification? */
24241 /* If it's not `throw', then there's no exception-specification. */
24247 /* Consume the `throw'. */
24250 /* Look for the `('. */
24251 matching_parens parens;
24254 /* Peek at the next token. */
24256 /* If it's not a `)', then there is a type-id-list. */
24258 {
24259 /* Types may not be defined in an exception-specification. */
24261 parser->type_definition_forbidden_message
24263 /* Parse the type-id-list. */
24265 /* Restore the saved message. */
24269 {
24273 }
24276 "dynamic exception specifications are deprecated in "
24278 }
24279 /* In C++17, throw() is equivalent to noexcept (true). throw()
24280 is deprecated in C++11 and above as well, but is still widely used,
24281 so don't warn about it yet. */
24284 else
24287 /* Look for the `)'. */
24291 }
24293 /* Parse an (optional) type-id-list.
24295 type-id-list:
24296 type-id ... [opt]
24297 type-id-list , type-id ... [opt]
24299 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24300 in the order that the types were presented. */
24302 static tree
24304 {
24308 {
24310 tree type;
24314 /* Get the next type-id. */
24316 /* Check for invalid 'auto'. */
24318 {
24322 }
24323 /* Parse the optional ellipsis. */
24325 {
24326 /* Consume the `...'. */
24329 /* Turn the type into a pack expansion expression. */
24331 }
24332 /* Add it to the list. */
24334 /* Peek at the next token. */
24336 /* If it is not a `,', we are done. */
24339 /* Consume the `,'. */
24341 }
24344 }
24346 /* Parse a try-block.
24348 try-block:
24349 try compound-statement handler-seq */
24351 static tree
24353 {
24354 tree try_block;
24368 }
24370 /* Parse a function-try-block.
24372 function-try-block:
24373 try ctor-initializer [opt] function-body handler-seq */
24375 static void
24377 {
24378 tree compound_stmt;
24379 tree try_block;
24381 /* Look for the `try' keyword. */
24384 /* Let the rest of the front end know where we are. */
24386 /* Parse the function-body. */
24387 cp_parser_ctor_initializer_opt_and_function_body
24389 /* We're done with the `try' part. */
24391 /* Parse the handlers. */
24393 /* We're done with the handlers. */
24395 }
24397 /* Parse a handler-seq.
24399 handler-seq:
24400 handler handler-seq [opt] */
24402 static void
24404 {
24406 {
24409 /* Parse the handler. */
24411 /* Peek at the next token. */
24413 /* If it's not `catch' then there are no more handlers. */
24416 }
24417 }
24419 /* Parse a handler.
24421 handler:
24422 catch ( exception-declaration ) compound-statement */
24424 static void
24426 {
24427 tree handler;
24428 tree declaration;
24432 matching_parens parens;
24439 }
24441 /* Parse an exception-declaration.
24443 exception-declaration:
24444 type-specifier-seq declarator
24445 type-specifier-seq abstract-declarator
24446 type-specifier-seq
24447 ...
24449 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24450 ellipsis variant is used. */
24452 static tree
24454 {
24455 cp_decl_specifier_seq type_specifiers;
24459 /* If it's an ellipsis, it's easy to handle. */
24461 {
24462 /* Consume the `...' token. */
24465 }
24467 /* Types may not be defined in exception-declarations. */
24469 parser->type_definition_forbidden_message
24472 /* Parse the type-specifier-seq. */
24476 /* If it's a `)', then there is no declarator. */
24479 else
24486 /* Restore the saved message. */
24493 }
24495 /* Parse a throw-expression.
24497 throw-expression:
24498 throw assignment-expression [opt]
24500 Returns a THROW_EXPR representing the throw-expression. */
24502 static tree
24504 {
24505 tree expression;
24510 /* Figure out whether or not there is an assignment-expression
24511 following the "throw" keyword. */
24519 else
24523 }
24525 /* GNU Extensions */
24527 /* Parse an (optional) asm-specification.
24529 asm-specification:
24530 asm ( string-literal )
24532 If the asm-specification is present, returns a STRING_CST
24533 corresponding to the string-literal. Otherwise, returns
24534 NULL_TREE. */
24536 static tree
24538 {
24540 tree asm_specification;
24542 /* Peek at the next token. */
24544 /* If the next token isn't the `asm' keyword, then there's no
24545 asm-specification. */
24549 /* Consume the `asm' token. */
24551 /* Look for the `('. */
24552 matching_parens parens;
24555 /* Look for the string-literal. */
24558 /* Look for the `)'. */
24562 }
24564 /* Parse an asm-operand-list.
24566 asm-operand-list:
24567 asm-operand
24568 asm-operand-list , asm-operand
24570 asm-operand:
24571 string-literal ( expression )
24572 [ string-literal ] string-literal ( expression )
24574 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24575 each node is the expression. The TREE_PURPOSE is itself a
24576 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24577 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24578 is a STRING_CST for the string literal before the parenthesis. Returns
24579 ERROR_MARK_NODE if any of the operands are invalid. */
24581 static tree
24583 {
24588 {
24589 tree string_literal;
24590 tree expression;
24591 tree name;
24594 {
24595 /* Consume the `[' token. */
24597 /* Read the operand name. */
24602 /* Look for the closing `]'. */
24604 }
24605 else
24607 /* Look for the string-literal. */
24610 /* Look for the `('. */
24611 matching_parens parens;
24613 /* Parse the expression. */
24615 /* Look for the `)'. */
24623 /* Add this operand to the list. */
24625 expression,
24626 asm_operands);
24627 /* If the next token is not a `,', there are no more
24628 operands. */
24631 /* Consume the `,'. */
24633 }
24636 }
24638 /* Parse an asm-clobber-list.
24640 asm-clobber-list:
24641 string-literal
24642 asm-clobber-list , string-literal
24644 Returns a TREE_LIST, indicating the clobbers in the order that they
24645 appeared. The TREE_VALUE of each node is a STRING_CST. */
24647 static tree
24649 {
24653 {
24654 tree string_literal;
24656 /* Look for the string literal. */
24658 /* Add it to the list. */
24660 /* If the next token is not a `,', then the list is
24661 complete. */
24664 /* Consume the `,' token. */
24666 }
24669 }
24671 /* Parse an asm-label-list.
24673 asm-label-list:
24674 identifier
24675 asm-label-list , identifier
24677 Returns a TREE_LIST, indicating the labels in the order that they
24678 appeared. The TREE_VALUE of each node is a label. */
24680 static tree
24682 {
24686 {
24689 /* Look for the identifier. */
24692 {
24695 {
24701 }
24702 }
24703 /* If the next token is not a `,', then the list is
24704 complete. */
24707 /* Consume the `,' token. */
24709 }
24712 }
24714 /* Return TRUE iff the next tokens in the stream are possibly the
24715 beginning of a GNU extension attribute. */
24717 static bool
24719 {
24721 }
24723 /* Return TRUE iff the next tokens in the stream are possibly the
24724 beginning of a standard C++-11 attribute specifier. */
24726 static bool
24728 {
24730 }
24732 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24733 beginning of a standard C++-11 attribute specifier. */
24735 static bool
24737 {
24745 }
24747 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24748 beginning of a GNU extension attribute. */
24750 static bool
24752 {
24756 }
24758 /* Return true iff the next tokens can be the beginning of either a
24759 GNU attribute list, or a standard C++11 attribute sequence. */
24761 static bool
24763 {
24766 }
24768 /* Return true iff the next Nth tokens can be the beginning of either
24769 a GNU attribute list, or a standard C++11 attribute sequence. */
24771 static bool
24773 {
24776 }
24778 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24779 of GNU attributes, or return NULL. */
24781 static tree
24783 {
24787 }
24789 /* Parse an (optional) series of attributes.
24791 attributes:
24792 attributes attribute
24794 attribute:
24795 __attribute__ (( attribute-list [opt] ))
24797 The return value is as for cp_parser_gnu_attribute_list. */
24799 static tree
24801 {
24805 {
24807 tree attribute_list;
24810 /* Peek at the next token. */
24812 /* If it's not `__attribute__', then we're done. */
24816 /* Consume the `__attribute__' keyword. */
24818 /* Look for the two `(' tokens. */
24819 matching_parens outer_parens;
24821 matching_parens inner_parens;
24824 /* Peek at the next token. */
24827 /* Parse the attribute-list. */
24829 else
24830 /* If the next token is a `)', then there is no attribute
24831 list. */
24834 /* Look for the two `)' tokens. */
24842 /* Add these new attributes to the list. */
24844 }
24847 }
24849 /* Parse a GNU attribute-list.
24851 attribute-list:
24852 attribute
24853 attribute-list , attribute
24855 attribute:
24856 identifier
24857 identifier ( identifier )
24858 identifier ( identifier , expression-list )
24859 identifier ( expression-list )
24861 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24862 to an attribute. The TREE_PURPOSE of each node is the identifier
24863 indicating which attribute is in use. The TREE_VALUE represents
24864 the arguments, if any. */
24866 static tree
24868 {
24874 {
24876 tree identifier;
24877 tree attribute;
24879 /* Look for the identifier. We also allow keywords here; for
24880 example `__attribute__ ((const))' is legal. */
24884 {
24887 /* Consume the token, but save it since we need it for the
24888 SIMD enabled function parsing. */
24891 /* Save away the identifier that indicates which attribute
24892 this is. */
24894 /* For keywords, use the canonical spelling, not the
24895 parsed identifier. */
24902 /* Peek at the next token. */
24904 /* If it's an `(', then parse the attribute arguments. */
24906 {
24910 vec = cp_parser_parenthesized_expression_list
24916 else
24917 {
24920 }
24921 /* Save the arguments away. */
24923 }
24926 {
24927 /* Add this attribute to the list. */
24930 }
24933 }
24934 /* Now, look for more attributes. If the next token isn't a
24935 `,', we're done. */
24939 /* Consume the comma and keep going. */
24941 }
24944 /* We built up the list in reverse order. */
24946 }
24948 /* Parse a standard C++11 attribute.
24950 The returned representation is a TREE_LIST which TREE_PURPOSE is
24951 the scoped name of the attribute, and the TREE_VALUE is its
24952 arguments list.
24954 Note that the scoped name of the attribute is itself a TREE_LIST
24955 which TREE_PURPOSE is the namespace of the attribute, and
24956 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24957 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24958 and which TREE_PURPOSE is directly the attribute name.
24960 Clients of the attribute code should use get_attribute_namespace
24961 and get_attribute_name to get the actual namespace and name of
24962 attributes, regardless of their being GNU or C++11 attributes.
24964 attribute:
24965 attribute-token attribute-argument-clause [opt]
24967 attribute-token:
24968 identifier
24969 attribute-scoped-token
24971 attribute-scoped-token:
24972 attribute-namespace :: identifier
24974 attribute-namespace:
24975 identifier
24977 attribute-argument-clause:
24978 ( balanced-token-seq )
24980 balanced-token-seq:
24981 balanced-token [opt]
24982 balanced-token-seq balanced-token
24984 balanced-token:
24985 ( balanced-token-seq )
24986 [ balanced-token-seq ]
24987 { balanced-token-seq }. */
24989 static tree
24991 {
24995 /* First, parse name of the attribute, a.k.a attribute-token. */
25012 {
25013 /* We are seeing a scoped attribute token. */
25028 else
25029 {
25033 }
25037 NULL_TREE);
25039 }
25042 NULL_TREE);
25043 else
25044 {
25047 NULL_TREE);
25048 /* C++11 noreturn attribute is equivalent to GNU's. */
25051 /* C++14 deprecated attribute is equivalent to GNU's. */
25054 /* C++17 fallthrough attribute is equivalent to GNU's. */
25057 /* Transactional Memory TS optimize_for_synchronized attribute is
25058 equivalent to GNU transaction_callable. */
25062 /* Transactional Memory attributes are GNU attributes. */
25065 }
25067 /* Now parse the optional argument clause of the attribute. */
25072 {
25078 /* A GNU attribute that takes an identifier in parameter. */
25081 vec = cp_parser_parenthesized_expression_list
25087 else
25088 {
25091 }
25095 else
25097 }
25100 }
25102 /* Check that the attribute ATTRIBUTE appears at most once in the
25103 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25104 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25105 isn't implemented yet in GCC. */
25107 static void
25109 {
25111 {
25121 }
25122 }
25124 /* Parse a list of standard C++-11 attributes.
25126 attribute-list:
25127 attribute [opt]
25128 attribute-list , attribute[opt]
25129 attribute ...
25130 attribute-list , attribute ...
25131 */
25133 static tree
25135 {
25140 {
25145 {
25149 }
25152 {
25157 else
25158 {
25163 }
25165 }
25169 }
25172 }
25174 /* Parse a standard C++-11 attribute specifier.
25176 attribute-specifier:
25177 [ [ attribute-using-prefix [opt] attribute-list ] ]
25178 alignment-specifier
25180 attribute-using-prefix:
25181 using attribute-namespace :
25183 alignment-specifier:
25184 alignas ( type-id ... [opt] )
25185 alignas ( alignment-expression ... [opt] ). */
25187 static tree
25189 {
25195 {
25202 {
25213 {
25217 "attribute using prefix only available "
25223 }
25224 else
25226 }
25233 else
25234 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25235 when we are sure that we have actually parsed them. */
25237 }
25238 else
25239 {
25240 tree alignas_expr;
25242 /* Look for an alignment-specifier. */
25253 matching_parens parens;
25255 {
25258 }
25264 {
25271 }
25276 /* Handle alignas (pack...). */
25278 {
25281 }
25283 /* Something went wrong, so don't build the attribute. */
25288 {
25291 }
25293 /* Build the C++-11 representation of an 'aligned'
25294 attribute. */
25295 attributes =
25298 alignas_expr);
25299 }
25302 }
25304 /* Parse a standard C++-11 attribute-specifier-seq.
25306 attribute-specifier-seq:
25307 attribute-specifier-seq [opt] attribute-specifier
25308 */
25310 static tree
25312 {
25317 {
25326 else
25329 }
25332 }
25334 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25335 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25336 current value of the PEDANTIC flag, regardless of whether or not
25337 the `__extension__' keyword is present. The caller is responsible
25338 for restoring the value of the PEDANTIC flag. */
25340 static bool
25342 {
25343 /* Save the old value of the PEDANTIC flag. */
25347 {
25348 /* Consume the `__extension__' token. */
25350 /* We're not being pedantic while the `__extension__' keyword is
25351 in effect. */
25355 }
25358 }
25360 /* Parse a label declaration.
25362 label-declaration:
25363 __label__ label-declarator-seq ;
25365 label-declarator-seq:
25366 identifier , label-declarator-seq
25367 identifier */
25369 static void
25371 {
25372 /* Look for the `__label__' keyword. */
25376 {
25377 tree identifier;
25379 /* Look for an identifier. */
25381 /* If we failed, stop. */
25384 /* Declare it as a label. */
25386 /* If the next token is a `;', stop. */
25389 /* Look for the `,' separating the label declarations. */
25391 }
25393 /* Look for the final `;'. */
25395 }
25397 // -------------------------------------------------------------------------- //
25398 // Requires Clause
25400 // Parse a requires clause.
25401 //
25402 // requires-clause:
25403 // 'requires' logical-or-expression
25404 //
25405 // The required logical-or-expression must be a constant expression. Note
25406 // that we don't check that the expression is constepxr here. We defer until
25407 // we analyze constraints and then, we only check atomic constraints.
25408 static tree
25410 {
25411 // Parse the requires clause so that it is not automatically folded.
25419 }
25421 // Optionally parse a requires clause:
25422 static tree
25424 {
25427 {
25430 {
25433 /* Parse and discard the requires-clause. */
25436 }
25438 }
25441 }
25444 /*---------------------------------------------------------------------------
25445 Requires expressions
25446 ---------------------------------------------------------------------------*/
25448 /* Parse a requires expression
25450 requirement-expression:
25451 'requires' requirement-parameter-list [opt] requirement-body */
25452 static tree
25454 {
25458 /* A requires-expression shall appear only within a concept
25459 definition or a requires-clause.
25461 TODO: Implement this diagnostic correctly. */
25463 {
25467 }
25470 {
25471 /* Local parameters are delared as variables within the scope
25472 of the expression. They are not visible past the end of
25473 the expression. Expressions within the requires-expression
25474 are unevaluated. */
25475 struct scope_sentinel
25476 {
25478 {
25481 }
25484 {
25487 }
25490 /* Parse the optional parameter list. */
25492 {
25496 }
25497 else
25500 /* Parse the requirement body. */
25504 }
25506 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25507 the parm chain. */
25510 }
25512 /* Parse a parameterized requirement.
25514 requirement-parameter-list:
25515 '(' parameter-declaration-clause ')' */
25516 static tree
25518 {
25519 matching_parens parens;
25529 }
25531 /* Parse the body of a requirement.
25533 requirement-body:
25534 '{' requirement-list '}' */
25535 static tree
25537 {
25538 matching_braces braces;
25548 }
25550 /* Parse a list of requirements.
25552 requirement-list:
25553 requirement
25554 requirement-list ';' requirement[opt] */
25555 static tree
25557 {
25560 {
25567 /* If we see a semi-colon, consume it. */
25571 /* Stop processing at the end of the list. */
25574 }
25576 /* Reverse the order of requirements so they are analyzed in
25577 declaration order. */
25579 }
25581 /* Parse a syntactic requirement or type requirement.
25583 requirement:
25584 simple-requirement
25585 compound-requirement
25586 type-requirement
25587 nested-requirement */
25588 static tree
25590 {
25597 else
25599 }
25601 /* Parse a simple requirement.
25603 simple-requirement:
25604 expression ';' */
25605 static tree
25607 {
25616 }
25618 /* Parse a type requirement
25620 type-requirement
25621 nested-name-specifier [opt] required-type-name ';'
25623 required-type-name:
25624 type-name
25625 'template' [opt] simple-template-id */
25626 static tree
25628 {
25631 // Save the scope before parsing name specifiers.
25642 tree type;
25644 {
25653 }
25654 else
25673 }
25675 /* Parse a compound requirement
25677 compound-requirement:
25678 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25679 static tree
25681 {
25682 /* Parse an expression enclosed in '{ }'s. */
25683 matching_braces braces;
25694 /* Parse the optional noexcept. */
25697 {
25700 }
25702 /* Parse the optional trailing return type. */
25705 {
25713 }
25716 }
25718 /* Parse a nested requirement. This is the same as a requires clause.
25720 nested-requirement:
25721 requires-clause */
25722 static tree
25724 {
25730 }
25732 /* Support Functions */
25734 /* Return the appropriate prefer_type argument for lookup_name_real based on
25735 tag_type and template_mem_access. */
25739 {
25740 /* DR 141: When looking in the current enclosing context for a template-name
25741 after -> or ., only consider class templates. */
25745 {
25749 }
25750 }
25752 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25753 NAME should have one of the representations used for an
25754 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25755 is returned. If PARSER->SCOPE is a dependent type, then a
25756 SCOPE_REF is returned.
25758 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25759 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25760 was formed. Abstractly, such entities should not be passed to this
25761 function, because they do not need to be looked up, but it is
25762 simpler to check for this special case here, rather than at the
25763 call-sites.
25765 In cases not explicitly covered above, this function returns a
25766 DECL, OVERLOAD, or baselink representing the result of the lookup.
25767 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25768 is returned.
25770 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25771 (e.g., "struct") that was used. In that case bindings that do not
25772 refer to types are ignored.
25774 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25775 ignored.
25777 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25778 are ignored.
25780 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25781 types.
25783 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25784 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25785 NULL_TREE otherwise. */
25787 static cp_expr
25794 location_t name_location)
25795 {
25796 tree decl;
25799 /* Assume that the lookup will be unambiguous. */
25803 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25804 no longer valid. Note that if we are parsing tentatively, and
25805 the parse fails, OBJECT_TYPE will be automatically restored. */
25811 /* A template-id has already been resolved; there is no lookup to
25812 do. */
25816 {
25820 }
25822 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25823 it should already have been checked to make sure that the name
25824 used matches the type being destroyed. */
25826 {
25827 tree type;
25829 /* Figure out to which type this destructor applies. */
25834 else
25836 /* If that's not a class type, there is no destructor. */
25847 }
25849 /* By this point, the NAME should be an ordinary identifier. If
25850 the id-expression was a qualified name, the qualifying scope is
25851 stored in PARSER->SCOPE at this point. */
25854 /* Perform the lookup. */
25856 {
25862 /* If the SCOPE is dependent, the lookup must be deferred until
25863 the template is instantiated -- unless we are explicitly
25864 looking up names in uninstantiated templates. Even then, we
25865 cannot look up the name if the scope is not a class type; it
25866 might, for example, be a template type parameter. */
25871 /* Defer lookup. */
25873 else
25874 {
25877 /* If PARSER->SCOPE is a dependent type, then it must be a
25878 class type, and we must not be checking dependencies;
25879 otherwise, we would have processed this lookup above. So
25880 that PARSER->SCOPE is not considered a dependent base by
25881 lookup_member, we must enter the scope here. */
25885 /* If the PARSER->SCOPE is a template specialization, it
25886 may be instantiated during name lookup. In that case,
25887 errors may be issued. Even if we rollback the current
25888 tentative parse, those errors are valid. */
25893 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25894 lookup result and the nested-name-specifier nominates a class C:
25895 * if the name specified after the nested-name-specifier, when
25896 looked up in C, is the injected-class-name of C (Clause 9), or
25897 * if the name specified after the nested-name-specifier is the
25898 same as the identifier or the simple-template-id's template-
25899 name in the last component of the nested-name-specifier,
25900 the name is instead considered to name the constructor of
25901 class C. [ Note: for example, the constructor is not an
25902 acceptable lookup result in an elaborated-type-specifier so
25903 the constructor would not be used in place of the
25904 injected-class-name. --end note ] Such a constructor name
25905 shall be used only in the declarator-id of a declaration that
25906 names a constructor or in a using-declaration. */
25914 /* If we have a single function from a using decl, pull it out. */
25921 }
25923 /* If the scope is a dependent type and either we deferred lookup or
25924 we did lookup but didn't find the name, rememeber the name. */
25927 {
25929 {
25930 tree type;
25932 /* The resolution to Core Issue 180 says that `struct
25933 A::B' should be considered a type-name, even if `A'
25934 is dependent. */
25939 }
25943 CPP_CLOSE_PAREN)))
25947 else
25950 is_template);
25951 }
25954 }
25956 {
25957 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25958 OBJECT_TYPE is not a class. */
25960 /* If the OBJECT_TYPE is a template specialization, it may
25961 be instantiated during name lookup. In that case, errors
25962 may be issued. Even if we rollback the current tentative
25963 parse, those errors are valid. */
25965 name,
25968 tf_warning_or_error);
25969 else
25973 /* Look it up in the enclosing context. DR 141: When looking for a
25974 template-name after -> or ., only consider class templates. */
25979 /* The object is type-dependent, so we can't look anything up; we used
25980 this to get the DR 141 behavior. */
25984 }
25985 else
25986 {
25992 }
25994 /* If the lookup failed, let our caller know. */
25998 /* Pull out the template from an injected-class-name (or multiple). */
26002 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26004 {
26007 /* The error message we have to print is too complicated for
26008 cp_parser_error, so we incorporate its actions directly. */
26010 {
26012 name);
26014 }
26016 }
26024 /* If we have resolved the name of a member declaration, check to
26025 see if the declaration is accessible. When the name resolves to
26026 set of overloaded functions, accessibility is checked when
26027 overload resolution is done.
26029 During an explicit instantiation, access is not checked at all,
26030 as per [temp.explicit]. */
26037 }
26039 /* Like cp_parser_lookup_name, but for use in the typical case where
26040 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26041 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26043 static tree
26045 {
26047 none_type,
26052 location);
26053 }
26055 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26056 the current context, return the TYPE_DECL. If TAG_NAME_P is
26057 true, the DECL indicates the class being defined in a class-head,
26058 or declared in an elaborated-type-specifier.
26060 Otherwise, return DECL. */
26062 static tree
26064 {
26065 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26066 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26068 struct A {
26069 template <typename T> struct B;
26070 };
26072 template <typename T> struct A::B {};
26074 Similarly, in an elaborated-type-specifier:
26076 namespace N { struct X{}; }
26078 struct A {
26079 template <typename T> friend struct N::X;
26080 };
26082 However, if the DECL refers to a class type, and we are in
26083 the scope of the class, then the name lookup automatically
26084 finds the TYPE_DECL created by build_self_reference rather
26085 than a TEMPLATE_DECL. For example, in:
26087 template <class T> struct S {
26088 S s;
26089 };
26091 there is no need to handle such case. */
26097 }
26099 /* If too many, or too few, template-parameter lists apply to the
26100 declarator, issue an error message. Returns TRUE if all went well,
26101 and FALSE otherwise. */
26103 static bool
26106 location_t declarator_location)
26107 {
26109 {
26111 {
26119 /* If the DECLARATOR has the form `X<y>' then it uses one
26120 additional level of template parameters. */
26123 return cp_parser_check_template_parameters
26125 }
26141 }
26143 }
26145 /* NUM_TEMPLATES were used in the current declaration. If that is
26146 invalid, return FALSE and issue an error messages. Otherwise,
26147 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26148 declarator and we can print more accurate diagnostics. */
26150 static bool
26153 location_t location,
26155 {
26156 /* If there are the same number of template classes and parameter
26157 lists, that's OK. */
26160 /* If there are more, but only one more, then we are referring to a
26161 member template. That's OK too. */
26164 /* If there are more template classes than parameter lists, we have
26165 something like:
26167 template <class T> void S<T>::R<T>::f (); */
26169 {
26179 else
26182 }
26183 /* Otherwise, there are too many template parameter lists. We have
26184 something like:
26186 template <class T> template <class U> void S::f(); */
26189 }
26191 /* Parse an optional `::' token indicating that the following name is
26192 from the global namespace. If so, PARSER->SCOPE is set to the
26193 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26194 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26195 Returns the new value of PARSER->SCOPE, if the `::' token is
26196 present, and NULL_TREE otherwise. */
26198 static tree
26200 {
26203 /* Peek at the next token. */
26205 /* If we're looking at a `::' token then we're starting from the
26206 global namespace, not our current location. */
26208 {
26209 /* Consume the `::' token. */
26211 /* Set the SCOPE so that we know where to start the lookup. */
26217 }
26219 {
26223 }
26226 }
26228 /* Returns TRUE if the upcoming token sequence is the start of a
26229 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26230 declarator is preceded by the `friend' specifier. */
26232 static bool
26234 {
26237 tree nested_name_specifier;
26240 /* The common case is that this is not a constructor declarator, so
26241 try to avoid doing lots of work if at all possible. It's not
26242 valid declare a constructor at function scope. */
26245 /* And only certain tokens can begin a constructor declarator. */
26253 /* Parse tentatively; we are going to roll back all of the tokens
26254 consumed here. */
26256 /* Assume that we are looking at a constructor declarator. */
26259 /* Look for the optional `::' operator. */
26262 /* Look for the nested-name-specifier. */
26263 nested_name_specifier
26274 /* Outside of a class-specifier, there must be a
26275 nested-name-specifier. Except in C++17 mode, where we
26276 might be declaring a guiding declaration. */
26283 /* If we have a class scope, this is easy; DR 147 says that S::S always
26284 names the constructor, and no other qualified name could. */
26287 {
26297 }
26298 /* If we still think that this might be a constructor-declarator,
26299 look for a class-name. */
26301 {
26302 /* If we have:
26304 template <typename T> struct S {
26305 S();
26306 };
26308 we must recognize that the nested `S' names a class. */
26312 tree type_decl;
26316 none_type,
26323 {
26329 none_type,
26334 else
26336 }
26338 /* If there was no class-name, then this is not a constructor.
26339 Otherwise, if we are in a class-specifier and we aren't
26340 handling a friend declaration, check that its type matches
26341 current_class_type (c++/38313). Note: error_mark_node
26342 is left alone for error recovery purposes. */
26344 && (outside_class_specifier_p
26350 /* If we're still considering a constructor, we have to see a `(',
26351 to begin the parameter-declaration-clause, followed by either a
26352 `)', an `...', or a decl-specifier. We need to check for a
26353 type-specifier to avoid being fooled into thinking that:
26355 S (f) (int);
26357 is a constructor. (It is actually a function named `f' that
26358 takes one parameter (of type `int') and returns a value of type
26359 `S'. */
26367 /* A parameter declaration begins with a decl-specifier,
26368 which is either the "attribute" keyword, a storage class
26369 specifier, or (usually) a type-specifier. */
26371 {
26372 tree type;
26376 /* Names appearing in the type-specifier should be looked up
26377 in the scope of the class. */
26381 {
26384 {
26388 {
26391 }
26392 }
26394 }
26396 /* Inside the constructor parameter list, surrounding
26397 template-parameter-lists do not apply. */
26398 saved_num_template_parameter_lists
26402 /* Look for the type-specifier. */
26404 CP_PARSER_FLAGS_NONE,
26410 parser->num_template_parameter_lists
26413 /* Leave the scope of the class. */
26418 }
26419 }
26421 /* We did not really want to consume any tokens. */
26425 }
26427 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26428 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26429 they must be performed once we are in the scope of the function.
26431 Returns the function defined. */
26433 static tree
26434 cp_parser_function_definition_from_specifiers_and_declarator
26437 tree attributes,
26439 {
26440 tree fn;
26443 /* Begin the function-definition. */
26446 /* The things we're about to see are not directly qualified by any
26447 template headers we've seen thus far. */
26450 /* If there were names looked up in the decl-specifier-seq that we
26451 did not check, check them now. We must wait until we are in the
26452 scope of the function to perform the checks, since the function
26453 might be a friend. */
26457 {
26462 }
26465 {
26466 /* Skip the entire function. */
26469 }
26471 {
26472 /* Seen already, skip it. An error message has already been output. */
26476 /* If this is a function from a class, pop the nested class. */
26479 }
26480 else
26481 {
26482 timevar_id_t tv;
26485 else
26491 }
26494 }
26496 /* Parse the part of a function-definition that follows the
26497 declarator. INLINE_P is TRUE iff this function is an inline
26498 function defined within a class-specifier.
26500 Returns the function defined. */
26502 static tree
26505 {
26506 tree fn;
26511 bool fully_implicit_function_template_p
26514 tree implicit_template_parms
26517 cp_binding_level* implicit_template_scope
26523 /* If the next token is `return', then the code may be trying to
26524 make use of the "named return value" extension that G++ used to
26525 support. */
26528 {
26529 /* Consume the `return' keyword. */
26531 /* Look for the identifier that indicates what value is to be
26532 returned. */
26534 /* Issue an error message. */
26537 /* Skip tokens until we reach the start of the function body. */
26539 {
26546 }
26547 }
26548 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26549 anything declared inside `f'. */
26550 saved_in_unbraced_linkage_specification_p
26553 /* Inside the function, surrounding template-parameter-lists do not
26554 apply. */
26555 saved_num_template_parameter_lists
26559 /* If the next token is `try', `__transaction_atomic', or
26560 `__transaction_relaxed`, then we are looking at either function-try-block
26561 or function-transaction-block. Note that all of these include the
26562 function-body. */
26566 RID_TRANSACTION_RELAXED))
26570 else
26571 cp_parser_ctor_initializer_opt_and_function_body
26574 /* Finish the function. */
26576 /* Generate code for it, if necessary. */
26578 /* Restore the saved values. */
26579 parser->in_unbraced_linkage_specification_p
26581 parser->num_template_parameter_lists
26585 parser->fully_implicit_function_template_p
26587 parser->implicit_template_parms
26589 parser->implicit_template_scope
26596 }
26598 /* Parse a template-declaration body (following argument list). */
26600 static void
26602 tree parameter_list,
26604 {
26608 /* We just processed one more parameter list. */
26611 /* Get the deferred access checks from the parameter list. These
26612 will be checked once we know what is being declared, as for a
26613 member template the checks must be performed in the scope of the
26614 class containing the member. */
26617 /* Tentatively parse for a new template parameter list, which can either be
26618 the template keyword or a template introduction. */
26624 else
26625 {
26626 /* There are no access checks when parsing a template, as we do not
26627 know if a specialization will be a friend. */
26631 checks,
26632 member_p,
26637 /* If this is a member template declaration, let the front
26638 end know. */
26640 {
26645 }
26650 }
26651 /* We are done with the current parameter list. */
26656 /* Finish up. */
26659 /* Check the template arguments for a literal operator template. */
26663 {
26667 else
26668 {
26671 {
26677 }
26679 {
26688 }
26689 else
26691 }
26693 {
26696 " Expected non-type template argument pack <char...>"
26698 decl);
26699 else
26702 decl);
26703 }
26704 }
26706 /* Register member declarations. */
26709 /* If DECL is a function template, we must return to parse it later.
26710 (Even though there is no definition, there might be default
26711 arguments that need handling.) */
26715 }
26717 /* Parse a template introduction header for a template-declaration. Returns
26718 false if tentative parse fails. */
26720 static bool
26722 {
26729 /* Look for the optional `::' operator. */
26732 /* Look for the nested-name-specifier. */
26742 /* Look up the concept for which we will be matching
26743 template parameters. */
26753 /* Look for opening brace for introduction. */
26754 matching_braces braces;
26762 /* Build vector of placeholder parameters and grab
26763 matching identifiers. */
26766 /* The introduction-list shall not be empty. */
26769 {
26772 }
26774 /* Look for closing brace for introduction. */
26779 {
26783 }
26785 /* Build and associate the constraint. */
26788 {
26790 member_p);
26792 }
26796 }
26798 /* Parse a normal template-declaration following the template keyword. */
26800 static void
26802 {
26803 tree parameter_list;
26807 /* Look for the `<' token. */
26811 {
26812 /* 14.5.2.2 [temp.mem]
26814 A local class shall not have member templates. */
26819 }
26820 /* [temp]
26822 A template ... shall not have C linkage. */
26824 {
26827 /* Give it C++ linkage to avoid confusing other parts of the
26828 front end. */
26831 }
26832 else
26835 /* We cannot perform access checks on the template parameter
26836 declarations until we know what is being declared, just as we
26837 cannot check the decl-specifier list. */
26840 /* If the next token is `>', then we have an invalid
26841 specialization. Rather than complain about an invalid template
26842 parameter, issue an error message here. */
26844 {
26848 }
26849 else
26850 {
26851 /* Parse the template parameters. */
26853 }
26855 /* Look for the `>'. */
26858 /* Manage template requirements */
26860 {
26865 }
26868 member_p);
26870 /* For the erroneous case of a template with C linkage, we pushed an
26871 implicit C++ linkage scope; exit that scope now. */
26874 }
26876 /* Parse a template-declaration, assuming that the `export' (and
26877 `extern') keywords, if present, has already been scanned. MEMBER_P
26878 is as for cp_parser_template_declaration. */
26880 static bool
26882 {
26884 {
26888 }
26893 }
26895 /* Perform the deferred access checks from a template-parameter-list.
26896 CHECKS is a TREE_LIST of access checks, as returned by
26897 get_deferred_access_checks. */
26899 static void
26900 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26901 {
26905 }
26907 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26908 `function-definition' sequence that follows a template header.
26909 If MEMBER_P is true, this declaration appears in a class scope.
26911 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26912 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26914 static tree
26920 {
26923 cp_decl_specifier_seq decl_specifiers;
26927 /* This function is only used when processing a template
26928 declaration. */
26932 /* Defer access checks until we know what is being declared. */
26935 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26936 alternative. */
26939 CP_PARSER_FLAGS_OPTIONAL,
26945 /* There are no template typedefs. */
26947 {
26951 }
26953 /* Gather up the access checks that occurred the
26954 decl-specifier-seq. */
26957 /* Check for the declaration of a template class. */
26959 {
26962 {
26963 // If this is a declaration, but not a definition, associate
26964 // any constraints with the type declaration. Constraints
26965 // are associated with definitions in cp_parser_class_specifier.
26971 /* In this case:
26973 struct C {
26974 friend template <typename T> struct A<T>::B;
26975 };
26977 A<T>::B will be represented by a TYPENAME_TYPE, and
26978 therefore not recognized by shadow_tag. */
26980 && !decl
26987 else
26990 /* Perform access checks for template parameters. */
26993 /* Give a helpful diagnostic for
26994 template <class T> struct A { } a;
26995 if we aren't already recovering from an error. */
26998 {
27000 "a class template declaration must not declare "
27004 }
27005 }
27006 }
27008 /* Complain about missing 'typename' or other invalid type names. */
27011 {
27012 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27013 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27014 the rest of this declaration. */
27017 }
27019 /* If it's not a template class, try for a template function. If
27020 the next token is a `;', then this declaration does not declare
27021 anything. But, if there were errors in the decl-specifiers, then
27022 the error might well have come from an attempted class-specifier.
27023 In that case, there's no need to warn about a missing declarator. */
27027 {
27030 checks,
27032 member_p,
27033 declares_class_or_enum,
27037 /* 7.1.1-1 [dcl.stc]
27039 A storage-class-specifier shall not be specified in an explicit
27040 specialization... */
27042 && explicit_specialization_p
27044 {
27048 }
27052 }
27054 /* Look for a trailing `;' after the declaration. */
27060 out:
27063 /* Clear any current qualification; whatever comes next is the start
27064 of something new. */
27070 }
27072 /* Parse a cast-expression that is not the operand of a unary "&". */
27074 static cp_expr
27076 {
27079 }
27081 /* Parse a functional cast to TYPE. Returns an expression
27082 representing the cast. */
27084 static cp_expr
27086 {
27088 tree expression_list;
27089 cp_expr cast;
27098 {
27108 /* Create a location of the form:
27109 type_name{i, f}
27110 ^~~~~~~~~~~~~~~
27111 with caret == start at the start of the type name,
27112 finishing at the closing brace. */
27113 location_t finish_loc
27116 finish_loc);
27119 }
27128 else
27129 {
27132 }
27135 tf_warning_or_error);
27136 /* [expr.const]/1: In an integral constant expression "only type
27137 conversions to integral or enumeration type can be used". */
27143 NIC_CONSTRUCTOR))
27146 /* Create a location of the form:
27147 float(i)
27148 ^~~~~~~~
27149 with caret == start at the start of the type name,
27150 finishing at the closing paren. */
27151 location_t finish_loc
27156 }
27158 /* Save the tokens that make up the body of a member function defined
27159 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27160 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27161 specifiers applied to the declaration. Returns the FUNCTION_DECL
27162 for the member function. */
27164 static tree
27168 tree attributes)
27169 {
27172 tree fn;
27175 /* Create the FUNCTION_DECL. */
27179 /* If something went badly wrong, bail out now. */
27181 {
27182 /* If there's a function-body, skip it. */
27187 }
27189 /* Remember it, if there default args to post process. */
27192 /* Save away the tokens that make up the body of the
27193 function. */
27199 RID_TRANSACTION_ATOMIC))
27200 {
27202 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27209 {
27215 }
27216 else
27219 {
27223 }
27224 }
27226 /* Handle function try blocks. */
27228 {
27231 }
27232 /* We can have braced-init-list mem-initializers before the fn body. */
27234 {
27237 {
27238 /* cache_group will stop after an un-nested { } pair, too. */
27242 /* variadic mem-inits have ... after the ')'. */
27245 }
27246 }
27248 /* Handle function try blocks. */
27254 /* Save away the inline definition; we will process it when the
27255 class is complete. */
27259 /* We need to know that this was defined in the class, so that
27260 friend templates are handled correctly. */
27263 /* Add FN to the queue of functions to be parsed later. */
27267 }
27269 /* Save the tokens that make up the in-class initializer for a non-static
27270 data member. Returns a DEFAULT_ARG. */
27272 static tree
27274 {
27276 }
27278 /* Parse a template-argument-list, as well as the trailing ">" (but
27279 not the opening "<"). See cp_parser_template_argument_list for the
27280 return value. */
27282 static tree
27284 {
27285 tree arguments;
27286 tree saved_scope;
27287 tree saved_qualifying_scope;
27288 tree saved_object_scope;
27293 /* [temp.names]
27295 When parsing a template-id, the first non-nested `>' is taken as
27296 the end of the template-argument-list rather than a greater-than
27297 operator. */
27298 saved_greater_than_is_operator_p
27301 /* Parsing the argument list may modify SCOPE, so we save it
27302 here. */
27306 /* We need to evaluate the template arguments, even though this
27307 template-id may be nested within a "sizeof". */
27312 /* Parse the template-argument-list itself. */
27316 else
27318 /* Look for the `>' that ends the template-argument-list. If we find
27319 a '>>' instead, it's probably just a typo. */
27321 {
27323 {
27324 /* In C++0x, a `>>' in a template argument list or cast
27325 expression is considered to be two separate `>'
27326 tokens. So, change the current token to a `>', but don't
27327 consume it: it will be consumed later when the outer
27328 template argument list (or cast expression) is parsed.
27329 Note that this replacement of `>' for `>>' is necessary
27330 even if we are parsing tentatively: in the tentative
27331 case, after calling
27332 cp_parser_enclosed_template_argument_list we will always
27333 throw away all of the template arguments and the first
27334 closing `>', either because the template argument list
27335 was erroneous or because we are replacing those tokens
27336 with a CPP_TEMPLATE_ID token. The second `>' (which will
27337 not have been thrown away) is needed either to close an
27338 outer template argument list or to complete a new-style
27339 cast. */
27342 }
27344 {
27345 /* If we're in a nested template argument list, the '>>' has
27346 to be a typo for '> >'. We emit the error message, but we
27347 continue parsing and we push a '>' as next token, so that
27348 the argument list will be parsed correctly. Note that the
27349 global source location is still on the token before the
27350 '>>', so we need to say explicitly where we want it. */
27358 }
27359 else
27360 {
27361 /* If this is not a nested template argument list, the '>>'
27362 is a typo for '>'. Emit an error message and continue.
27363 Same deal about the token location, but here we can get it
27364 right by consuming the '>>' before issuing the diagnostic. */
27367 "spurious %<>>%>, use %<>%> to terminate "
27369 }
27370 }
27371 else
27373 /* The `>' token might be a greater-than operator again now. */
27374 parser->greater_than_is_operator_p
27376 /* Restore the SAVED_SCOPE. */
27384 }
27386 /* MEMBER_FUNCTION is a member function, or a friend. If default
27387 arguments, or the body of the function have not yet been parsed,
27388 parse them now. */
27390 static void
27392 {
27394 /* If this member is a template, get the underlying
27395 FUNCTION_DECL. */
27399 /* There should not be any class definitions in progress at this
27400 point; the bodies of members are only parsed outside of all class
27401 definitions. */
27403 /* While we're parsing the member functions we might encounter more
27404 classes. We want to handle them right away, but we don't want
27405 them getting mixed up with functions that are currently in the
27406 queue. */
27409 /* Make sure that any template parameters are in scope. */
27412 /* If the body of the function has not yet been parsed, parse it
27413 now. */
27415 {
27416 tree function_scope;
27419 /* The function is no longer pending; we are processing it. */
27424 /* If this is a local class, enter the scope of the containing
27425 function. */
27430 /* Push the body of the function onto the lexer stack. */
27433 /* Let the front end know that we going to be defining this
27434 function. */
27438 /* Don't do access checking if it is a templated function. */
27442 /* #pragma omp declare reduction needs special parsing. */
27444 {
27449 }
27450 else
27451 /* Now, parse the body of the function. */
27458 /* Leave the scope of the containing function. */
27462 }
27464 /* Remove any template parameters from the symbol table. */
27467 /* Restore the queue. */
27470 }
27472 /* If DECL contains any default args, remember it on the unparsed
27473 functions queue. */
27475 static void
27477 {
27478 tree probe;
27481 probe;
27484 {
27488 }
27489 }
27491 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27492 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27493 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27494 from the parameter-type-list. */
27496 static tree
27499 {
27501 tree parsed_arg;
27507 /* Push the saved tokens for the default argument onto the parser's
27508 lexer stack. */
27514 /* Parse the default argument. */
27525 {
27526 /* In a non-template class, check conversions now. In a template,
27527 we'll wait and instantiate these as needed. */
27530 tf_warning_or_error);
27533 else
27535 }
27537 /* If the token stream has not been completely used up, then
27538 there was extra junk after the end of the default
27539 argument. */
27541 {
27544 else
27546 }
27548 /* Revert to the main lexer. */
27552 }
27554 /* FIELD is a non-static data member with an initializer which we saved for
27555 later; parse it now. */
27557 static void
27559 {
27560 tree def;
27567 NULL_TREE);
27573 }
27575 /* FN is a FUNCTION_DECL which may contains a parameter with an
27576 unparsed DEFAULT_ARG. Parse the default args now. This function
27577 assumes that the current scope is the scope in which the default
27578 argument should be processed. */
27580 static void
27582 {
27586 /* While we're parsing the default args, we might (due to the
27587 statement expression extension) encounter more classes. We want
27588 to handle them right away, but we don't want them getting mixed
27589 up with default args that are currently in the queue. */
27592 /* Local variable names (and the `this' keyword) may not appear
27593 in a default argument. */
27604 {
27606 tree parsed_arg;
27608 tree copy;
27615 /* This can happen for a friend declaration for a function
27616 already declared with default arguments. */
27619 parsed_arg
27621 default_arg,
27625 /* Update any instantiations we've already created. */
27629 }
27633 /* Make sure no default arg is missing. */
27636 /* Restore the state of local_variables_forbidden_p. */
27639 /* Restore the queue. */
27641 }
27643 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27645 sizeof ... ( identifier )
27647 where the 'sizeof' token has already been consumed. */
27649 static tree
27651 {
27652 /* Consume the `...'. */
27656 matching_parens parens;
27660 else
27668 /* The name is not qualified. */
27687 }
27689 /* Parse the operand of `sizeof' (or a similar operator). Returns
27690 either a TYPE or an expression, depending on the form of the
27691 input. The KEYWORD indicates which kind of expression we have
27692 encountered. */
27694 static tree
27696 {
27703 /* If it's a `...', then we are computing the length of a parameter
27704 pack. */
27709 /* Types cannot be defined in a `sizeof' expression. Save away the
27710 old message. */
27712 /* And create the new one. */
27718 /* The restrictions on constant-expressions do not apply inside
27719 sizeof expressions. */
27720 saved_integral_constant_expression_p
27722 saved_non_integral_constant_expression_p
27726 /* Do not actually evaluate the expression. */
27729 /* If it's a `(', then we might be looking at the type-id
27730 construction. */
27732 {
27735 /* We can't be sure yet whether we're looking at a type-id or an
27736 expression. */
27739 matching_parens parens;
27742 /* Note: as a GNU Extension, compound literals are considered
27743 postfix-expressions as they are in C99, so they are valid
27744 arguments to sizeof. See comment in cp_parser_cast_expression
27745 for details. */
27748 else
27749 {
27752 /* Look for the type-id. */
27754 /* Look for the closing `)'. */
27757 }
27759 /* If all went well, then we're done. */
27761 {
27762 cp_decl_specifier_seq decl_specs;
27764 /* Build a trivial decl-specifier-seq. */
27768 /* Call grokdeclarator to figure out what type this is. */
27771 TYPENAME,
27774 }
27775 }
27777 /* If the type-id production did not work out, then we must be
27778 looking at the unary-expression production. */
27782 /* Go back to evaluating expressions. */
27786 /* Free the message we created. */
27788 /* And restore the old one. */
27790 parser->integral_constant_expression_p
27792 parser->non_integral_constant_expression_p
27796 }
27798 /* If the current declaration has no declarator, return true. */
27800 static bool
27802 {
27803 /* If the next token is a `;' or a `,' then there is no
27804 declarator. */
27807 }
27809 /* Update the DECL_SPECS to reflect the storage class indicated by
27810 KEYWORD. */
27812 static void
27817 {
27818 cp_storage_class storage_class;
27821 {
27825 }
27827 {
27830 }
27835 {
27838 }
27841 {
27859 }
27863 /* A storage class specifier cannot be applied alongside a typedef
27864 specifier. If there is a typedef specifier present then set
27865 conflicting_specifiers_p which will trigger an error later
27866 on in grokdeclarator. */
27869 }
27871 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27872 is true, the type is a class or enum definition. */
27874 static void
27876 tree type_spec,
27879 {
27882 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27883 (with, for example, in "typedef int wchar_t;") we remember that
27884 this is what happened. In system headers, we ignore these
27885 declarations so that G++ can work with system headers that are not
27886 C++-safe. */
27888 && !type_definition_p
27898 {
27901 ds_redefined_builtin_type_spec,
27902 token);
27904 {
27908 }
27909 }
27912 else
27913 {
27918 }
27919 }
27921 /* True iff TOKEN is the GNU keyword __thread. */
27923 static bool
27925 {
27928 }
27930 /* Set the location for a declarator specifier and check if it is
27931 duplicated.
27933 DECL_SPECS is the sequence of declarator specifiers onto which to
27934 set the location.
27936 DS is the single declarator specifier to set which location is to
27937 be set onto the existing sequence of declarators.
27939 LOCATION is the location for the declarator specifier to
27940 consider. */
27942 static void
27945 {
27954 {
27958 }
27959 else
27960 {
27962 {
27966 else
27967 {
27970 OPT_Wlong_long,
27972 }
27973 }
27975 {
27980 else
27981 {
27985 }
27986 }
27987 else
27988 {
28004 "__complex"
28005 };
28009 }
28010 }
28011 }
28013 /* Return true iff the declarator specifier DS is present in the
28014 sequence of declarator specifiers DECL_SPECS. */
28016 bool
28018 cp_decl_spec ds)
28019 {
28026 }
28028 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28029 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28031 static bool
28033 {
28035 }
28037 /* Issue an error message indicating that TOKEN_DESC was expected.
28038 If KEYWORD is true, it indicated this function is called by
28039 cp_parser_require_keword and the required token can only be
28040 a indicated keyword.
28042 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28043 within any error as the location of an "opening" token matching
28044 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28045 RT_CLOSE_PAREN). */
28047 static void
28049 required_token token_desc,
28051 location_t matching_location)
28052 {
28058 {
28127 }
28130 {
28132 {
28210 }
28211 }
28215 }
28218 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28219 issue an error message indicating that TOKEN_DESC was expected.
28221 Returns the token consumed, if the token had the appropriate type.
28222 Otherwise, returns NULL.
28224 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28225 within any error as the location of an "opening" token matching
28226 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28227 RT_CLOSE_PAREN). */
28232 required_token token_desc,
28233 location_t matching_location)
28234 {
28237 else
28238 {
28239 /* Output the MESSAGE -- unless we're parsing tentatively. */
28242 matching_location);
28244 }
28245 }
28247 /* An error message is produced if the next token is not '>'.
28248 All further tokens are skipped until the desired token is
28249 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28251 static void
28253 {
28254 /* Current level of '< ... >'. */
28256 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28259 /* Are we ready, yet? If not, issue error message. */
28263 /* Skip tokens until the desired token is found. */
28265 {
28266 /* Peek at the next token. */
28268 {
28276 /* C++0x views the `>>' operator as two `>' tokens, but
28277 C++98 does not. */
28280 {
28281 /* We've hit a `>>' where the first `>' closes the
28282 template argument list, and the second `>' is
28283 spurious. Just consume the `>>' and stop; we've
28284 already produced at least one error. */
28287 }
28288 /* Fall through for C++0x, so we handle the second `>' in
28289 the `>>'. */
28294 {
28295 /* We've reached the token we want, consume it and stop. */
28298 }
28317 /* The '>' was probably forgotten, don't look further. */
28322 }
28324 /* Consume this token. */
28326 }
28327 }
28329 /* If the next token is the indicated keyword, consume it. Otherwise,
28330 issue an error message indicating that TOKEN_DESC was expected.
28332 Returns the token consumed, if the token had the appropriate type.
28333 Otherwise, returns NULL. */
28338 required_token token_desc)
28339 {
28343 {
28345 UNKNOWN_LOCATION);
28347 }
28350 }
28352 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28353 function-definition. */
28355 static bool
28357 {
28360 /* A ctor-initializer begins with a `:'. */
28362 /* A function-try-block begins with `try'. */
28364 /* A function-transaction-block begins with `__transaction_atomic'
28365 or `__transaction_relaxed'. */
28368 /* The named return value extension begins with `return'. */
28370 }
28372 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28373 definition. */
28375 static bool
28377 {
28384 }
28386 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28387 C++0x) ending a template-argument. */
28389 static bool
28391 {
28399 }
28401 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28402 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28404 static bool
28407 {
28413 /* Check for the sequence `<::' in the original code. It would be lexed as
28414 `[:', where `[' is a digraph, and there is no whitespace before
28415 `:'. */
28417 {
28422 }
28424 }
28426 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28427 or none_type otherwise. */
28429 static enum tag_types
28431 {
28433 {
28443 }
28444 }
28446 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28447 or none_type otherwise or if the token is null. */
28449 static enum tag_types
28451 {
28456 {
28464 }
28465 }
28467 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28469 static void
28471 {
28475 {
28479 type))
28482 }
28483 }
28485 /* Issue an error message if DECL is redeclared with different
28486 access than its original declaration [class.access.spec/3].
28487 This applies to nested classes, nested class templates and
28488 enumerations [class.mem/1]. */
28490 static void
28492 {
28503 }
28505 /* Look for the `template' keyword, as a syntactic disambiguator.
28506 Return TRUE iff it is present, in which case it will be
28507 consumed. */
28509 static bool
28511 {
28513 {
28514 /* In C++98 the `template' keyword can only be used within templates;
28515 outside templates the parser can always figure out what is a
28516 template and what is not. In C++11, per the resolution of DR 468,
28517 `template' is allowed in cases where it is not strictly necessary. */
28520 {
28523 "in C++98 %<template%> (as a disambiguator) is only "
28525 /* If this part of the token stream is rescanned, the same
28526 error message would be generated. So, we purge the token
28527 from the stream. */
28530 }
28531 else
28532 {
28533 /* Consume the `template' keyword. */
28536 }
28537 }
28539 }
28541 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28542 set PARSER->SCOPE, and perform other related actions. */
28544 static void
28546 {
28549 /* Get the stored value. */
28551 /* Set the scope from the stored value. */
28555 }
28557 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28558 encounter the end of a block before what we were looking for. */
28560 static bool
28564 {
28566 {
28569 /* Abort a parenthesized expression if we encounter a semicolon. */
28573 /* If we've reached the end of the file, stop. */
28579 /* We've hit the end of an enclosing block, so there's been some
28580 kind of syntax error. */
28583 /* Consume the token. */
28585 /* See if it starts a new group. */
28587 {
28589 /* In theory this should probably check end == '}', but
28590 cp_parser_save_member_function_body needs it to exit
28591 after either '}' or ')' when called with ')'. */
28594 }
28596 {
28600 }
28605 }
28606 }
28608 /* Like above, for caching a default argument or NSDMI. Both of these are
28609 terminated by a non-nested comma, but it can be unclear whether or not a
28610 comma is nested in a template argument list unless we do more parsing.
28611 In order to handle this ambiguity, when we encounter a ',' after a '<'
28612 we try to parse what follows as a parameter-declaration-list (in the
28613 case of a default argument) or a member-declarator (in the case of an
28614 NSDMI). If that succeeds, then we stop caching. */
28616 static tree
28618 {
28623 tree default_argument;
28625 /* Add tokens until we have processed the entire default
28626 argument. We add the range [first_token, token). */
28629 {
28630 /* For list-initialization, this is straightforward. */
28633 }
28635 {
28638 /* Peek at the next token. */
28640 /* What we do depends on what token we have. */
28642 {
28643 /* In valid code, a default argument must be
28644 immediately followed by a `,' `)', or `...'. */
28647 {
28648 /* If we've seen a '<', we might be in a
28649 template-argument-list. Until Core issue 325 is
28650 resolved, we don't know how this situation ought
28651 to be handled, so try to DTRT. We check whether
28652 what comes after the comma is a valid parameter
28653 declaration list. If it is, then the comma ends
28654 the default argument; otherwise the default
28655 argument continues. */
28659 /* Set ITALP so cp_parser_parameter_declaration_list
28660 doesn't decide to commit to this parse. */
28667 {
28668 /* Parse declarators until we reach a non-comma or
28669 somthing that cannot be an initializer.
28670 Just checking whether we're looking at a single
28671 declarator is insufficient. Consider:
28672 int var = tuple<T,U>::x;
28673 The template parameter 'U' looks exactly like a
28674 declarator. */
28675 do
28676 {
28687 }
28689 /* If we met an '=' or ';' then the original comma
28690 was the end of the NSDMI. Otherwise assume
28691 we're still in the NSDMI. */
28694 }
28695 else
28696 {
28701 }
28708 }
28709 /* FALLTHRU */
28712 /* If we run into a non-nested `;', `}', or `]',
28713 then the code is invalid -- but the default
28714 argument is certainly over. */
28719 /* Handle correctly int n = sizeof ... ( p ); */
28722 /* Update DEPTH, if necessary. */
28737 /* This might be the comparison operator, or it might
28738 start a template argument list. */
28745 /* Fall through for C++0x, which treats the `>>'
28746 operator like two `>' tokens in certain
28747 cases. */
28752 {
28753 /* This might be an operator, or it might close a
28754 template argument list. But if a previous '<'
28755 started a template argument list, this will have
28756 closed it, so we can't be in one anymore. */
28760 }
28763 /* If we run out of tokens, issue an error message. */
28771 /* In these cases, we should look for template-ids.
28772 For example, if the default argument is
28773 `X<int, double>()', we need to do name lookup to
28774 figure out whether or not `X' is a template; if
28775 so, the `,' does not end the default argument.
28777 That is not yet done. */
28782 }
28784 /* If we've reached the end, stop. */
28788 /* Add the token to the token block. */
28790 }
28792 /* Create a DEFAULT_ARG to represent the unparsed default
28793 argument. */
28800 }
28802 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28804 location_t
28806 {
28811 }
28813 /* Begin parsing tentatively. We always save tokens while parsing
28814 tentatively so that if the tentative parsing fails we can restore the
28815 tokens. */
28817 static void
28819 {
28820 /* Enter a new parsing context. */
28822 /* Begin saving tokens. */
28824 /* In order to avoid repetitive access control error messages,
28825 access checks are queued up until we are no longer parsing
28826 tentatively. */
28828 }
28830 /* Commit to the currently active tentative parse. */
28832 static void
28834 {
28838 /* Mark all of the levels as committed. */
28841 {
28848 }
28849 }
28851 /* Commit to the topmost currently active tentative parse.
28853 Note that this function shouldn't be called when there are
28854 irreversible side-effects while in a tentative state. For
28855 example, we shouldn't create a permanent entry in the symbol
28856 table, or issue an error message that might not apply if the
28857 tentative parse is aborted. */
28859 static void
28861 {
28866 {
28874 }
28875 }
28877 /* Abort the currently active tentative parse. All consumed tokens
28878 will be rolled back, and no diagnostics will be issued. */
28880 static void
28882 {
28886 /* Now, pretend that we want to see if the construct was
28887 successfully parsed. */
28889 }
28891 /* Stop parsing tentatively. If a parse error has occurred, restore the
28892 token stream. Otherwise, commit to the tokens we have consumed.
28893 Returns true if no error occurred; false otherwise. */
28895 static bool
28897 {
28901 /* Remember whether or not an error occurred, since we are about to
28902 destroy that information. */
28904 /* Remove the topmost context from the stack. */
28907 /* If no parse errors occurred, commit to the tentative parse. */
28909 {
28910 /* Commit to the tokens read tentatively, unless that was
28911 already done. */
28916 }
28917 /* Otherwise, if errors occurred, roll back our state so that things
28918 are just as they were before we began the tentative parse. */
28919 else
28920 {
28923 }
28924 /* Add the context to the front of the free list. */
28929 }
28931 /* Returns true if we are parsing tentatively and are not committed to
28932 this tentative parse. */
28934 static bool
28936 {
28939 }
28941 /* Returns nonzero iff an error has occurred during the most recent
28942 tentative parse. */
28944 static bool
28946 {
28949 }
28951 /* Returns nonzero if GNU extensions are allowed. */
28953 static bool
28955 {
28957 }
28958 \f
28959 /* Objective-C++ Productions */
28962 /* Parse an Objective-C expression, which feeds into a primary-expression
28963 above.
28965 objc-expression:
28966 objc-message-expression
28967 objc-string-literal
28968 objc-encode-expression
28969 objc-protocol-expression
28970 objc-selector-expression
28972 Returns a tree representation of the expression. */
28974 static cp_expr
28976 {
28977 /* Try to figure out what kind of declaration is present. */
28981 {
28991 {
29003 }
29004 /* FALLTHRU */
29010 }
29013 }
29015 /* Parse an Objective-C message expression.
29017 objc-message-expression:
29018 [ objc-message-receiver objc-message-args ]
29020 Returns a representation of an Objective-C message. */
29022 static tree
29024 {
29036 /* Construct a location e.g.
29037 [self func1:5]
29038 ^~~~~~~~~~~~~~
29039 ranging from the '[' to the ']', with the caret at the start. */
29044 }
29046 /* Parse an objc-message-receiver.
29048 objc-message-receiver:
29049 expression
29050 simple-type-specifier
29052 Returns a representation of the type or expression. */
29054 static tree
29056 {
29057 tree rcv;
29059 /* An Objective-C message receiver may be either (1) a type
29060 or (2) an expression. */
29064 /* If that worked out, fine. */
29071 CP_PARSER_FLAGS_NONE);
29078 }
29080 /* Parse the arguments and selectors comprising an Objective-C message.
29082 objc-message-args:
29083 objc-selector
29084 objc-selector-args
29085 objc-selector-args , objc-comma-args
29087 objc-selector-args:
29088 objc-selector [opt] : assignment-expression
29089 objc-selector-args objc-selector [opt] : assignment-expression
29091 objc-comma-args:
29092 assignment-expression
29093 objc-comma-args , assignment-expression
29095 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29096 selector arguments and TREE_VALUE containing a list of comma
29097 arguments. */
29099 static tree
29101 {
29107 {
29113 /* Detect if we have a unary selector. */
29122 sel_args
29127 }
29129 /* Handle non-selector arguments, if any. */
29131 {
29132 tree arg;
29137 addl_args
29142 }
29145 {
29148 }
29151 }
29153 /* Parse an Objective-C encode expression.
29155 objc-encode-expression:
29156 @encode objc-typename
29158 Returns an encoded representation of the type argument. */
29160 static cp_expr
29162 {
29163 tree type;
29168 matching_parens parens;
29175 {
29179 }
29181 /* This happens if we find @encode(T) (where T is a template
29182 typename or something dependent on a template typename) when
29183 parsing a template. In that case, we can't compile it
29184 immediately, but we rather create an AT_ENCODE_EXPR which will
29185 need to be instantiated when the template is used.
29186 */
29188 {
29192 }
29195 /* Build a location of the form:
29196 @encode(int)
29197 ^~~~~~~~~~~~
29198 with caret==start at the @ token, finishing at the close paren. */
29199 location_t combined_loc
29204 }
29206 /* Parse an Objective-C @defs expression. */
29208 static tree
29210 {
29211 tree name;
29214 matching_parens parens;
29220 }
29222 /* Parse an Objective-C protocol expression.
29224 objc-protocol-expression:
29225 @protocol ( identifier )
29227 Returns a representation of the protocol expression. */
29229 static tree
29231 {
29232 tree proto;
29236 matching_parens parens;
29241 /* Build a location of the form:
29242 @protocol(prot)
29243 ^~~~~~~~~~~~~~~
29244 with caret==start at the @ token, finishing at the close paren. */
29245 location_t combined_loc
29251 }
29253 /* Parse an Objective-C selector expression.
29255 objc-selector-expression:
29256 @selector ( objc-method-signature )
29258 objc-method-signature:
29259 objc-selector
29260 objc-selector-seq
29262 objc-selector-seq:
29263 objc-selector :
29264 objc-selector-seq objc-selector :
29266 Returns a representation of the method selector. */
29268 static tree
29270 {
29277 matching_parens parens;
29283 {
29292 {
29293 /* Detect if we have a unary selector. */
29295 {
29298 }
29299 else
29300 {
29302 }
29303 }
29308 {
29309 sel_seq
29312 sel_seq
29315 }
29316 else
29317 sel_seq
29322 }
29324 finish_selector:
29328 /* Build a location of the form:
29329 @selector(func)
29330 ^~~~~~~~~~~~~~~
29331 with caret==start at the @ token, finishing at the close paren. */
29332 location_t combined_loc
29336 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29339 }
29341 /* Parse a list of identifiers.
29343 objc-identifier-list:
29344 identifier
29345 objc-identifier-list , identifier
29347 Returns a TREE_LIST of identifier nodes. */
29349 static tree
29351 {
29352 tree identifier;
29353 tree list;
29364 {
29371 identifier));
29373 }
29376 }
29378 /* Parse an Objective-C alias declaration.
29380 objc-alias-declaration:
29381 @compatibility_alias identifier identifier ;
29383 This function registers the alias mapping with the Objective-C front end.
29384 It returns nothing. */
29386 static void
29388 {
29396 }
29398 /* Parse an Objective-C class forward-declaration.
29400 objc-class-declaration:
29401 @class objc-identifier-list ;
29403 The function registers the forward declarations with the Objective-C
29404 front end. It returns nothing. */
29406 static void
29408 {
29411 {
29412 tree id;
29422 else
29424 }
29426 }
29428 /* Parse a list of Objective-C protocol references.
29430 objc-protocol-refs-opt:
29431 objc-protocol-refs [opt]
29433 objc-protocol-refs:
29434 < objc-identifier-list >
29436 Returns a TREE_LIST of identifiers, if any. */
29438 static tree
29440 {
29444 {
29448 }
29451 }
29453 /* Parse a Objective-C visibility specification. */
29455 static void
29457 {
29461 {
29476 }
29478 /* Eat '@private'/'@protected'/'@public'. */
29480 }
29482 /* Parse an Objective-C method type. Return 'true' if it is a class
29483 (+) method, and 'false' if it is an instance (-) method. */
29487 {
29490 else
29492 }
29494 /* Parse an Objective-C protocol qualifier. */
29496 static tree
29498 {
29511 {
29516 }
29519 }
29521 /* Parse an Objective-C typename. */
29523 static tree
29525 {
29529 {
29532 matching_parens parens;
29536 /* An ObjC type name may consist of just protocol qualifiers, in which
29537 case the type shall default to 'id'. */
29539 {
29542 /* If the type could not be parsed, an error has already
29543 been produced. For error recovery, behave as if it had
29544 not been specified, which will use the default type
29545 'id'. */
29547 {
29549 /* We need to skip to the closing parenthesis as
29550 cp_parser_type_id() does not seem to do it for
29551 us. */
29556 }
29557 }
29561 }
29564 }
29566 /* Check to see if TYPE refers to an Objective-C selector name. */
29568 static bool
29570 {
29576 }
29578 /* Parse an Objective-C selector. */
29580 static tree
29582 {
29586 {
29589 }
29591 /* C++ operator names are allowed to appear in ObjC selectors. */
29593 {
29606 }
29607 }
29609 /* Parse an Objective-C params list. */
29611 static tree
29613 {
29619 {
29629 /* Detect if we have a unary selector. */
29632 {
29635 }
29639 {
29640 /* Something went quite wrong. There should be a colon
29641 here, but there is not. Stop parsing parameters. */
29643 }
29645 /* New ObjC allows attributes on parameters too. */
29650 params
29653 type_name,
29654 identifier,
29655 parm_attr));
29658 }
29661 {
29664 }
29666 /* We allow tail attributes for the method. */
29668 {
29676 }
29679 {
29682 }
29684 }
29686 /* Parse the non-keyword Objective-C params. */
29688 static tree
29691 {
29697 {
29699 tree parm;
29705 {
29710 }
29712 /* TODO: parse attributes for tail parameters. */
29721 }
29723 /* We allow tail attributes for the method. */
29725 {
29727 {
29732 }
29733 else
29734 /* We have an error, but parse the attributes, so that we can
29735 carry on. */
29741 }
29744 }
29746 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29748 static void
29750 {
29753 /* If the next token is `extern' and the following token is a string
29754 literal, then we have a linkage specification. */
29756 && cp_parser_is_pure_string_literal
29759 /* Handle #pragma, if any. */
29762 /* Allow stray semicolons. */
29765 /* Mark methods as optional or required, when building protocols. */
29767 {
29770 }
29772 {
29775 }
29778 /* Other stray characters must generate errors. */
29780 {
29784 }
29785 /* Finally, try to parse a block-declaration, or a function-definition. */
29786 else
29788 }
29790 /* Parse a method signature. */
29792 static tree
29794 {
29810 }
29812 static bool
29814 {
29815 tree tattr;
29820 /* If the attributes are followed by a method introducer, this is not allowed.
29821 Dump the attributes and flag the situation. */
29826 /* Otherwise, the attributes introduce some interstitial code, possibly so
29827 rewind to allow that check. */
29830 }
29832 /* Parse an Objective-C method prototype list. */
29834 static void
29836 {
29840 {
29842 {
29847 else
29851 {
29855 }
29858 }
29864 OPT_Wattributes,
29866 else
29867 /* Allow for interspersed non-ObjC++ code. */
29871 }
29875 else
29879 }
29881 /* Parse an Objective-C method definition list. */
29883 static void
29885 {
29889 {
29890 tree meth;
29893 {
29899 else
29904 {
29908 }
29910 NULL_TREE);
29912 /* For historical reasons, we accept an optional semicolon. */
29919 {
29926 }
29927 }
29928 /* The following case will be removed once @synthesize is
29929 completely implemented. */
29940 else
29941 /* Allow for interspersed non-ObjC++ code. */
29945 }
29949 else
29953 }
29955 /* Parse Objective-C ivars. */
29957 static void
29959 {
29970 {
29971 cp_decl_specifier_seq declspecs;
29973 tree prefix_attributes;
29981 CP_PARSER_FLAGS_OPTIONAL,
29985 /* auto, register, static, extern, mutable. */
29987 {
29990 }
29992 /* thread_local. */
29994 {
29997 }
29999 /* typedef. */
30001 {
30004 }
30009 /* Keep going until we hit the `;' at the end of the
30010 declaration. */
30012 {
30017 /* Check for a (possibly unnamed) bitfield declaration. */
30025 {
30026 /* Get the name of the bitfield. */
30029 sfk_none);
30031 eat_colon:
30033 /* Get the width of the bitfield. */
30034 width
30036 }
30037 else
30038 {
30039 /* Parse the declarator. */
30040 declarator
30046 }
30048 /* Look for attributes that apply to the ivar. */
30050 /* Remember which attributes are prefix attributes and
30051 which are not. */
30053 /* Combine the attributes. */
30057 /* Create the bitfield declaration. */
30060 else
30065 /* Add the instance variable. */
30069 /* Reset PREFIX_ATTRIBUTES. */
30078 {
30081 }
30083 }
30087 }
30092 /* Do not consume the RID_AT_END, so it will be read again as terminating
30093 the @interface of @implementation. */
30097 /* For historical reasons, we accept an optional semicolon. */
30100 }
30102 /* Parse an Objective-C protocol declaration. */
30104 static void
30106 {
30112 {
30117 }
30119 /* See if we have a forward declaration or a definition. */
30122 /* Try a forward declaration first. */
30124 {
30126 {
30127 tree id;
30137 else
30139 }
30141 }
30143 /* Ok, we got a full-fledged definition (or at least should). */
30144 else
30145 {
30150 }
30151 }
30153 /* Parse an Objective-C superclass or category. */
30155 static void
30160 {
30166 {
30169 }
30171 {
30172 matching_parens parens;
30175 /* If there is no category name, and this is an @interface, we
30176 have a class extension. */
30178 {
30181 }
30182 else
30186 }
30187 }
30189 /* Parse an Objective-C class interface. */
30191 static void
30193 {
30200 {
30201 /* It's hard to recover because even if valid @interface stuff
30202 is to follow, we can't compile it (or validate it) if we
30203 don't even know which class it refers to. Let's assume this
30204 was a stray '@interface' token in the stream and skip it.
30205 */
30207 }
30212 /* We have either a class or a category on our hands. */
30215 else
30216 {
30218 /* Handle instance variable declarations, if any. */
30221 }
30224 }
30226 /* Parse an Objective-C class implementation. */
30228 static void
30230 {
30237 {
30238 /* It's hard to recover because even if valid @implementation
30239 stuff is to follow, we can't compile it (or validate it) if
30240 we don't even know which class it refers to. Let's assume
30241 this was a stray '@implementation' token in the stream and
30242 skip it.
30243 */
30245 }
30249 /* We have either a class or a category on our hands. */
30252 else
30253 {
30255 /* Handle instance variable declarations, if any. */
30258 }
30261 }
30263 /* Consume the @end token and finish off the implementation. */
30265 static void
30267 {
30270 }
30272 /* Parse an Objective-C declaration. */
30274 static void
30276 {
30277 /* Try to figure out what kind of declaration is present. */
30282 {
30298 }
30301 {
30324 }
30325 }
30327 /* Parse an Objective-C try-catch-finally statement.
30329 objc-try-catch-finally-stmt:
30330 @try compound-statement objc-catch-clause-seq [opt]
30331 objc-finally-clause [opt]
30333 objc-catch-clause-seq:
30334 objc-catch-clause objc-catch-clause-seq [opt]
30336 objc-catch-clause:
30337 @catch ( objc-exception-declaration ) compound-statement
30339 objc-finally-clause:
30340 @finally compound-statement
30342 objc-exception-declaration:
30343 parameter-declaration
30344 '...'
30346 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30348 Returns NULL_TREE.
30350 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30351 for C. Keep them in sync. */
30353 static tree
30355 {
30356 location_t location;
30357 tree stmt;
30362 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30363 node, lest it get absorbed into the surrounding block. */
30369 {
30373 matching_parens parens;
30379 {
30380 /* We have "@catch (...)" (where the '...' are literally
30381 what is in the code). Skip the '...'.
30382 parameter_declaration is set to NULL_TREE, and
30383 objc_being_catch_clauses() knows that that means
30384 '...'. */
30387 }
30388 else
30389 {
30390 /* We have "@catch (NSException *exception)" or something
30391 like that. Parse the parameter declaration. */
30395 else
30400 }
30403 else
30404 {
30405 /* If there was no open parenthesis, we are recovering from
30406 an error, and we are trying to figure out what mistake
30407 the user has made. */
30409 /* If there is an immediate closing parenthesis, the user
30410 probably forgot the opening one (ie, they typed "@catch
30411 NSException *e)". Parse the closing parenthesis and keep
30412 going. */
30416 /* If these is no immediate closing parenthesis, the user
30417 probably doesn't know that parenthesis are required at
30418 all (ie, they typed "@catch NSException *e"). So, just
30419 forget about the closing parenthesis and keep going. */
30420 }
30424 }
30426 {
30429 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30430 node, lest it get absorbed into the surrounding block. */
30434 }
30437 }
30439 /* Parse an Objective-C synchronized statement.
30441 objc-synchronized-stmt:
30442 @synchronized ( expression ) compound-statement
30444 Returns NULL_TREE. */
30446 static tree
30448 {
30449 location_t location;
30456 matching_parens parens;
30461 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30462 node, lest it get absorbed into the surrounding block. */
30467 }
30469 /* Parse an Objective-C throw statement.
30471 objc-throw-stmt:
30472 @throw assignment-expression [opt] ;
30474 Returns a constructed '@throw' statement. */
30476 static tree
30478 {
30490 }
30492 /* Parse an Objective-C statement. */
30494 static tree
30496 {
30497 /* Try to figure out what kind of declaration is present. */
30501 {
30512 }
30515 }
30517 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30518 look ahead to see if an objc keyword follows the attributes. This
30519 is to detect the use of prefix attributes on ObjC @interface and
30520 @protocol. */
30522 static bool
30524 {
30529 {
30532 }
30535 }
30537 /* This routine is a minimal replacement for
30538 c_parser_struct_declaration () used when parsing the list of
30539 types/names or ObjC++ properties. For example, when parsing the
30540 code
30542 @property (readonly) int a, b, c;
30544 this function is responsible for parsing "int a, int b, int c" and
30545 returning the declarations as CHAIN of DECLs.
30547 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30548 similar parsing. */
30549 static tree
30551 {
30553 cp_decl_specifier_seq declspecs;
30555 tree prefix_attributes;
30558 CP_PARSER_FLAGS_NONE,
30565 /* auto, register, static, extern, mutable. */
30567 {
30570 }
30572 /* thread_local. */
30574 {
30577 }
30579 /* typedef. */
30581 {
30584 }
30589 /* Keep going until we hit the `;' at the end of the declaration. */
30591 {
30596 /* Parse the declarator. */
30600 /* Look for attributes that apply to the ivar. */
30602 /* Remember which attributes are prefix attributes and
30603 which are not. */
30605 /* Combine the attributes. */
30615 /* Reset PREFIX_ATTRIBUTES. */
30626 {
30629 }
30630 else
30632 }
30634 }
30636 /* Parse an Objective-C @property declaration. The syntax is:
30638 objc-property-declaration:
30639 '@property' objc-property-attributes[opt] struct-declaration ;
30641 objc-property-attributes:
30642 '(' objc-property-attribute-list ')'
30644 objc-property-attribute-list:
30645 objc-property-attribute
30646 objc-property-attribute-list, objc-property-attribute
30648 objc-property-attribute
30649 'getter' = identifier
30650 'setter' = identifier
30651 'readonly'
30652 'readwrite'
30653 'assign'
30654 'retain'
30655 'copy'
30656 'nonatomic'
30658 For example:
30659 @property NSString *name;
30660 @property (readonly) id object;
30661 @property (retain, nonatomic, getter=getTheName) id name;
30662 @property int a, b, c;
30664 PS: This function is identical to
30665 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30666 static void
30668 {
30669 /* The following variables hold the attributes of the properties as
30670 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30671 seen. When we see an attribute, we set them to 'true' (if they
30672 are boolean properties) or to the identifier (if they have an
30673 argument, ie, for getter and setter). Note that here we only
30674 parse the list of attributes, check the syntax and accumulate the
30675 attributes that we find. objc_add_property_declaration() will
30676 then process the information. */
30686 /* 'properties' is the list of properties that we read. Usually a
30687 single one, but maybe more (eg, in "@property int a, b, c;" there
30688 are three). */
30689 tree properties;
30690 location_t loc;
30696 /* Parse the optional attribute list... */
30698 {
30699 /* Eat the '('. */
30700 matching_parens parens;
30704 {
30710 {
30713 }
30717 {
30728 {
30732 else
30737 }
30740 {
30744 }
30746 {
30748 {
30751 }
30752 else
30756 else
30758 }
30759 else
30760 {
30762 {
30765 }
30766 else
30768 }
30774 }
30781 else
30783 }
30785 /* FIXME: "@property (setter, assign);" will generate a spurious
30786 "error: expected ‘)’ before ‘,’ token". This is because
30787 cp_parser_require, unlike the C counterpart, will produce an
30788 error even if we are in error recovery. */
30790 {
30795 }
30796 }
30798 /* ... and the property declaration(s). */
30802 {
30804 /* If the next token is now a `;', consume it. */
30808 }
30812 else
30813 {
30814 /* Comma-separated properties are chained together in
30815 reverse order; add them one by one. */
30824 }
30827 }
30829 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30831 objc-synthesize-declaration:
30832 @synthesize objc-synthesize-identifier-list ;
30834 objc-synthesize-identifier-list:
30835 objc-synthesize-identifier
30836 objc-synthesize-identifier-list, objc-synthesize-identifier
30838 objc-synthesize-identifier
30839 identifier
30840 identifier = identifier
30842 For example:
30843 @synthesize MyProperty;
30844 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30846 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30847 for C. Keep them in sync.
30848 */
30849 static void
30851 {
30853 location_t loc;
30858 {
30862 {
30865 }
30867 {
30871 {
30874 }
30875 }
30876 else
30881 else
30883 }
30886 }
30888 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30890 objc-dynamic-declaration:
30891 @dynamic identifier-list ;
30893 For example:
30894 @dynamic MyProperty;
30895 @dynamic MyProperty, AnotherProperty;
30897 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30898 for C. Keep them in sync.
30899 */
30900 static void
30902 {
30904 location_t loc;
30909 {
30910 tree property;
30913 {
30916 }
30920 else
30922 }
30925 }
30927 \f
30928 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30930 /* Returns name of the next clause.
30931 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30932 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30933 returned and the token is consumed. */
30935 static pragma_omp_clause
30937 {
30953 {
30958 {
31135 }
31136 }
31142 }
31144 /* Validate that a clause of the given type does not already exist. */
31146 static void
31149 {
31150 tree c;
31154 {
31157 }
31158 }
31160 /* OpenMP 2.5:
31161 variable-list:
31162 identifier
31163 variable-list , identifier
31165 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31166 colon). An opening parenthesis will have been consumed by the caller.
31168 If KIND is nonzero, create the appropriate node and install the decl
31169 in OMP_CLAUSE_DECL and add the node to the head of the list.
31171 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31172 return the list created.
31174 COLON can be NULL if only closing parenthesis should end the list,
31175 or pointer to bool which will receive false if the list is terminated
31176 by closing parenthesis or true if the list is terminated by colon. */
31178 static tree
31181 {
31185 {
31188 }
31190 {
31195 && current_class_ptr
31197 {
31203 }
31204 else
31205 {
31218 }
31220 ;
31222 {
31224 {
31226 /* The OpenACC cache directive explicitly only allows "array
31227 elements or subarrays". */
31229 {
31233 }
31234 /* FALLTHROUGH. */
31239 {
31240 location_t loc
31245 decl
31249 }
31250 /* FALLTHROUGH. */
31254 {
31262 parser->colon_corrects_to_scope_p
31266 else
31267 {
31268 /* Look for `:'. */
31272 CPP_CLOSE_SQUARE))
31274 }
31275 /* Look for the closing `]'. */
31277 RT_CLOSE_SQUARE))
31281 }
31285 }
31291 }
31292 else
31295 get_comma:
31299 }
31305 {
31309 }
31312 {
31315 /* Try to resync to an unnested comma. Copied from
31316 cp_parser_parenthesized_expression_list. */
31317 skip_comma:
31326 }
31329 }
31331 /* Similarly, but expect leading and trailing parenthesis. This is a very
31332 common case for omp clauses. */
31334 static tree
31336 {
31340 }
31342 /* OpenACC 2.0:
31343 copy ( variable-list )
31344 copyin ( variable-list )
31345 copyout ( variable-list )
31346 create ( variable-list )
31347 delete ( variable-list )
31348 present ( variable-list )
31349 present_or_copy ( variable-list )
31350 pcopy ( variable-list )
31351 present_or_copyin ( variable-list )
31352 pcopyin ( variable-list )
31353 present_or_copyout ( variable-list )
31354 pcopyout ( variable-list )
31355 present_or_create ( variable-list )
31356 pcreate ( variable-list ) */
31358 static tree
31360 tree list)
31361 {
31364 {
31410 }
31418 }
31420 /* OpenACC 2.0:
31421 deviceptr ( variable-list ) */
31423 static tree
31425 {
31429 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31430 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31431 variable-list must only allow for pointer variables. */
31434 {
31441 }
31444 }
31446 /* OpenACC 2.0:
31447 auto
31448 independent
31449 nohost
31450 seq */
31452 static tree
31456 {
31461 }
31463 /* OpenACC:
31464 num_gangs ( expression )
31465 num_workers ( expression )
31466 vector_length ( expression ) */
31468 static tree
31471 {
31474 matching_parens parens;
31482 {
31487 }
31495 }
31497 /* OpenACC:
31499 gang [( gang-arg-list )]
31500 worker [( [num:] int-expr )]
31501 vector [( [length:] int-expr )]
31503 where gang-arg is one of:
31505 [num:] int-expr
31506 static: size-expr
31508 and size-expr may be:
31510 *
31511 int-expr
31512 */
31514 static tree
31517 {
31527 {
31528 matching_parens parens;
31531 do
31532 {
31536 /* Gang static argument. */
31539 {
31547 {
31550 }
31552 /* Check for the '*' argument. */
31556 CPP_CLOSE_PAREN)))
31557 {
31562 {
31565 }
31567 }
31568 }
31569 /* Worker num: argument and vector length: arguments. */
31573 {
31576 }
31578 /* Now collect the actual argument. */
31580 {
31583 }
31595 {
31598 }
31600 }
31605 }
31619 cleanup_error:
31622 }
31624 /* OpenACC 2.0:
31625 tile ( size-expr-list ) */
31627 static tree
31629 {
31633 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31634 so, but the spec authors never considered such a case and have
31635 differing opinions on what it might mean, including 'not
31636 allowed'.) */
31639 clause_loc);
31644 do
31645 {
31652 {
31655 }
31656 else
31660 }
31663 /* Consume the trailing ')'. */
31671 }
31673 /* OpenACC 2.0
31674 Parse wait clause or directive parameters. */
31676 static tree
31678 {
31688 {
31693 }
31700 {
31704 {
31707 else
31708 {
31715 }
31716 }
31717 }
31720 }
31722 /* OpenACC:
31723 wait ( int-expr-list ) */
31725 static tree
31727 {
31736 }
31738 /* OpenMP 3.0:
31739 collapse ( constant-expression ) */
31741 static tree
31743 {
31745 location_t loc;
31746 HOST_WIDE_INT n;
31749 matching_parens parens;
31767 {
31770 }
31779 }
31781 /* OpenMP 2.5:
31782 default ( none | shared )
31784 OpenACC:
31785 default ( none | present ) */
31787 static tree
31790 {
31792 tree c;
31794 matching_parens parens;
31798 {
31803 {
31824 }
31827 }
31828 else
31829 {
31830 invalid_kind:
31833 else
31835 }
31852 }
31854 /* OpenMP 3.1:
31855 final ( expression ) */
31857 static tree
31859 {
31862 matching_parens parens;
31881 }
31883 /* OpenMP 2.5:
31884 if ( expression )
31886 OpenMP 4.5:
31887 if ( directive-name-modifier : expression )
31889 directive-name-modifier:
31890 parallel | task | taskloop | target data | target | target update
31891 | target enter data | target exit data */
31893 static tree
31896 {
31900 matching_parens parens;
31905 {
31917 {
31920 {
31933 else
31934 {
31935 location_t loc
31940 }
31943 {
31945 {
31950 }
31952 {
31953 location_t loc
31957 }
31958 }
31959 }
31960 }
31962 {
31964 {
31967 }
31968 else
31969 {
31971 {
31972 location_t loc
31975 }
31977 }
31978 }
31979 }
31991 {
31994 {
31997 {
32007 }
32009 p);
32011 }
32013 {
32016 else
32019 }
32022 {
32026 }
32027 }
32035 }
32037 /* OpenMP 3.1:
32038 mergeable */
32040 static tree
32043 {
32044 tree c;
32047 location);
32052 }
32054 /* OpenMP 2.5:
32055 nowait */
32057 static tree
32060 {
32061 tree c;
32068 }
32070 /* OpenMP 2.5:
32071 num_threads ( expression ) */
32073 static tree
32075 location_t location)
32076 {
32079 matching_parens parens;
32099 }
32101 /* OpenMP 4.5:
32102 num_tasks ( expression ) */
32104 static tree
32106 location_t location)
32107 {
32110 matching_parens parens;
32130 }
32132 /* OpenMP 4.5:
32133 grainsize ( expression ) */
32135 static tree
32137 location_t location)
32138 {
32141 matching_parens parens;
32161 }
32163 /* OpenMP 4.5:
32164 priority ( expression ) */
32166 static tree
32168 location_t location)
32169 {
32172 matching_parens parens;
32192 }
32194 /* OpenMP 4.5:
32195 hint ( expression ) */
32197 static tree
32199 location_t location)
32200 {
32203 matching_parens parens;
32222 }
32224 /* OpenMP 4.5:
32225 defaultmap ( tofrom : scalar ) */
32227 static tree
32229 location_t location)
32230 {
32234 matching_parens parens;
32239 {
32242 }
32246 {
32249 }
32255 {
32258 }
32262 {
32265 }
32271 location);
32277 out_err:
32282 }
32284 /* OpenMP 2.5:
32285 ordered
32287 OpenMP 4.5:
32288 ordered ( constant-expression ) */
32290 static tree
32293 {
32295 HOST_WIDE_INT n;
32301 {
32302 matching_parens parens;
32319 {
32321 "ordered argument needs positive constant integer "
32324 }
32325 }
32331 }
32333 /* OpenMP 2.5:
32334 reduction ( reduction-operator : variable-list )
32336 reduction-operator:
32337 One of: + * - & ^ | && ||
32339 OpenMP 3.1:
32341 reduction-operator:
32342 One of: + * - & ^ | && || min max
32344 OpenMP 4.0:
32346 reduction-operator:
32347 One of: + * - & ^ | && ||
32348 id-expression */
32350 static tree
32352 {
32360 {
32370 }
32374 else
32375 {
32386 {
32416 }
32417 else
32418 {
32420 resync_fail:
32425 }
32426 }
32432 NULL);
32434 {
32437 }
32440 }
32442 /* OpenMP 2.5:
32443 schedule ( schedule-kind )
32444 schedule ( schedule-kind , expression )
32446 schedule-kind:
32447 static | dynamic | guided | runtime | auto
32449 OpenMP 4.5:
32450 schedule ( schedule-modifier : schedule-kind )
32451 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32453 schedule-modifier:
32454 simd
32455 monotonic
32456 nonmonotonic */
32458 static tree
32460 {
32464 matching_parens parens;
32471 {
32480 else
32486 else
32487 {
32490 }
32491 }
32494 {
32499 {
32520 }
32521 }
32526 else
32532 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32534 {
32538 }
32541 {
32556 else
32561 }
32573 invalid_kind:
32575 resync_fail:
32580 }
32582 /* OpenMP 3.0:
32583 untied */
32585 static tree
32588 {
32589 tree c;
32596 }
32598 /* OpenMP 4.0:
32599 inbranch
32600 notinbranch */
32602 static tree
32605 {
32610 }
32612 /* OpenMP 4.0:
32613 parallel
32614 for
32615 sections
32616 taskgroup */
32618 static tree
32622 {
32626 }
32628 /* OpenMP 4.5:
32629 nogroup */
32631 static tree
32634 {
32639 }
32641 /* OpenMP 4.5:
32642 simd
32643 threads */
32645 static tree
32649 {
32654 }
32656 /* OpenMP 4.0:
32657 num_teams ( expression ) */
32659 static tree
32661 location_t location)
32662 {
32665 matching_parens parens;
32685 }
32687 /* OpenMP 4.0:
32688 thread_limit ( expression ) */
32690 static tree
32692 location_t location)
32693 {
32696 matching_parens parens;
32716 }
32718 /* OpenMP 4.0:
32719 aligned ( variable-list )
32720 aligned ( variable-list : constant-expression ) */
32722 static tree
32724 {
32728 matching_parens parens;
32736 {
32746 }
32752 }
32754 /* OpenMP 4.0:
32755 linear ( variable-list )
32756 linear ( variable-list : expression )
32758 OpenMP 4.5:
32759 linear ( modifier ( variable-list ) )
32760 linear ( modifier ( variable-list ) : expression ) */
32762 static tree
32765 {
32770 matching_parens parens;
32775 {
32787 else
32789 }
32794 else
32795 {
32804 }
32807 {
32812 {
32823 {
32826 }
32829 }
32840 }
32843 {
32846 }
32849 }
32851 /* OpenMP 4.0:
32852 safelen ( constant-expression ) */
32854 static tree
32856 location_t location)
32857 {
32860 matching_parens parens;
32879 }
32881 /* OpenMP 4.0:
32882 simdlen ( constant-expression ) */
32884 static tree
32886 location_t location)
32887 {
32890 matching_parens parens;
32909 }
32911 /* OpenMP 4.5:
32912 vec:
32913 identifier [+/- integer]
32914 vec , identifier [+/- integer]
32915 */
32917 static tree
32919 tree list)
32920 {
32924 {
32927 }
32930 {
32937 else
32938 {
32939 t = cp_parser_lookup_name_simple
32944 id_loc);
32945 }
32951 {
32954 }
32958 {
32961 }
32965 {
32968 }
32971 add_to_vector:
32973 {
32977 }
32983 }
32986 {
32992 }
32994 }
32996 /* OpenMP 4.0:
32997 depend ( depend-kind : variable-list )
32999 depend-kind:
33000 in | out | inout
33002 OpenMP 4.5:
33003 depend ( source )
33005 depend ( sink : vec ) */
33007 static tree
33009 {
33013 matching_parens parens;
33018 {
33032 else
33034 }
33035 else
33041 {
33051 }
33058 else
33059 {
33065 }
33068 invalid_kind:
33070 resync_fail:
33075 }
33077 /* OpenMP 4.0:
33078 map ( map-kind : variable-list )
33079 map ( variable-list )
33081 map-kind:
33082 alloc | to | from | tofrom
33084 OpenMP 4.5:
33085 map-kind:
33086 alloc | to | from | tofrom | release | delete
33088 map ( always [,] map-kind: variable-list ) */
33090 static tree
33092 {
33101 {
33106 {
33109 nth++;
33115 {
33120 }
33121 }
33122 }
33126 {
33140 else
33141 {
33147 }
33150 }
33153 {
33157 }
33160 NULL);
33166 }
33168 /* OpenMP 4.0:
33169 device ( expression ) */
33171 static tree
33173 location_t location)
33174 {
33177 matching_parens parens;
33197 }
33199 /* OpenMP 4.0:
33200 dist_schedule ( static )
33201 dist_schedule ( static , expression ) */
33203 static tree
33205 location_t location)
33206 {
33209 matching_parens parens;
33220 {
33231 }
33236 location);
33240 invalid_kind:
33242 resync_fail:
33247 }
33249 /* OpenMP 4.0:
33250 proc_bind ( proc-bind-kind )
33252 proc-bind-kind:
33253 master | close | spread */
33255 static tree
33257 location_t location)
33258 {
33259 tree c;
33266 {
33276 else
33278 }
33279 else
33288 location);
33293 invalid_kind:
33295 resync_fail:
33300 }
33302 /* OpenACC:
33303 async [( int-expr )] */
33305 static tree
33307 {
33314 {
33315 matching_parens parens;
33324 }
33334 }
33336 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33337 is a bitmask in MASK. Return the list of clauses found. */
33339 static tree
33343 {
33348 {
33349 location_t here;
33350 pragma_omp_clause c_kind;
33351 omp_clause_code code;
33362 {
33414 clauses);
33432 OMP_CLAUSE_INDEPENDENT,
33444 clauses);
33450 clauses);
33474 clauses);
33496 clauses);
33508 clauses);
33522 }
33527 {
33528 /* Remove the invalid clause(s) from the list to avoid
33529 confusing the rest of the compiler. */
33532 }
33533 }
33535 saw_error:
33542 }
33544 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33545 is a bitmask in MASK. Return the list of clauses found; the result
33546 of clause default goes in *pdefault. */
33548 static tree
33552 {
33558 {
33559 pragma_omp_clause c_kind;
33570 {
33582 clauses);
33596 clauses);
33616 clauses);
33621 clauses);
33631 clauses);
33665 clauses);
33679 clauses);
33694 OMP_CLAUSE_NOTINBRANCH,
33703 {
33704 clause_not_first:
33708 }
33738 clauses);
33739 else
33749 clauses);
33767 {
33772 }
33815 clauses
33821 clauses
33829 }
33834 {
33835 /* Remove the invalid clause(s) from the list to avoid
33836 confusing the rest of the compiler. */
33839 }
33840 }
33841 saw_error:
33844 {
33847 else
33849 }
33851 }
33853 /* OpenMP 2.5:
33854 structured-block:
33855 statement
33857 In practice, we're also interested in adding the statement to an
33858 outer node. So it is convenient if we work around the fact that
33859 cp_parser_statement calls add_stmt. */
33861 static unsigned
33863 {
33866 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33867 This preserves the "not within loop or switch" style error messages
33868 for nonsense cases like
33869 void foo() {
33870 #pragma omp single
33871 break;
33872 }
33873 */
33878 }
33880 static void
33882 {
33884 }
33886 static tree
33888 {
33896 }
33898 /* OpenMP 2.5:
33899 # pragma omp atomic new-line
33900 expression-stmt
33902 expression-stmt:
33903 x binop= expr | x++ | ++x | x-- | --x
33904 binop:
33905 +, *, -, /, &, ^, |, <<, >>
33907 where x is an lvalue expression with scalar type.
33909 OpenMP 3.1:
33910 # pragma omp atomic new-line
33911 update-stmt
33913 # pragma omp atomic read new-line
33914 read-stmt
33916 # pragma omp atomic write new-line
33917 write-stmt
33919 # pragma omp atomic update new-line
33920 update-stmt
33922 # pragma omp atomic capture new-line
33923 capture-stmt
33925 # pragma omp atomic capture new-line
33926 capture-block
33928 read-stmt:
33929 v = x
33930 write-stmt:
33931 x = expr
33932 update-stmt:
33933 expression-stmt | x = x binop expr
33934 capture-stmt:
33935 v = expression-stmt
33936 capture-block:
33937 { v = x; update-stmt; } | { update-stmt; v = x; }
33939 OpenMP 4.0:
33940 update-stmt:
33941 expression-stmt | x = x binop expr | x = expr binop x
33942 capture-stmt:
33943 v = update-stmt
33944 capture-block:
33945 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33947 where x and v are lvalue expressions with scalar type. */
33949 static void
33951 {
33959 {
33964 {
33970 }
33971 }
33973 {
33985 else
33989 }
33991 {
33997 {
34002 {
34005 }
34006 }
34007 }
34011 {
34021 else
34026 {
34027 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34028 opcode. */
34033 }
34037 {
34040 }
34041 else
34042 {
34048 }
34051 }
34053 restart:
34057 {
34064 /* FALLTHROUGH */
34074 /* FALLTHROUGH */
34089 /* Undo effects of boolean_increment for post {in,de}crement. */
34091 /* FALLTHRU */
34095 {
34096 /* Undo effects of boolean_increment. */
34098 {
34099 /* This is pre or post increment. */
34104 && !structured_block
34108 }
34109 }
34110 /* FALLTHRU */
34113 {
34148 {
34152 }
34155 {
34161 {
34166 }
34168 {
34180 {
34182 {
34187 }
34188 else
34190 }
34194 }
34197 {
34204 }
34208 }
34212 {
34215 {
34223 }
34225 {
34230 }
34265 }
34276 /* FALLTHROUGH */
34281 }
34288 }
34289 stmt_done:
34291 {
34302 }
34304 {
34307 }
34308 done:
34314 saw_error:
34317 {
34321 {
34325 }
34326 }
34327 }
34330 /* OpenMP 2.5:
34331 # pragma omp barrier new-line */
34333 static void
34335 {
34338 }
34340 /* OpenMP 2.5:
34341 # pragma omp critical [(name)] new-line
34342 structured-block
34344 OpenMP 4.5:
34345 # pragma omp critical [(name) [hint(expression)]] new-line
34346 structured-block */
34348 #define OMP_CRITICAL_CLAUSE_MASK \
34349 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34351 static tree
34353 {
34357 {
34358 matching_parens parens;
34372 OMP_CRITICAL_CLAUSE_MASK,
34374 }
34375 else
34380 }
34382 /* OpenMP 2.5:
34383 # pragma omp flush flush-vars[opt] new-line
34385 flush-vars:
34386 ( variable-list ) */
34388 static void
34390 {
34396 }
34398 /* Helper function, to parse omp for increment expression. */
34400 static tree
34402 {
34407 {
34410 }
34413 {
34420 /* Fall through: OpenMP disallows NE_EXPR. */
34424 }
34426 /* If decl is an iterator, preserve LHS and RHS of the relational
34427 expr until finish_omp_for. */
34438 }
34440 /* Helper function, to parse omp for increment expression. */
34442 static tree
34444 {
34448 cp_id_kind idk;
34452 {
34461 }
34470 {
34475 }
34482 {
34486 }
34499 do
34500 {
34507 {
34509 {
34512 else
34514 tf_warning_or_error);
34515 }
34516 else
34519 }
34520 }
34524 {
34530 }
34531 else
34535 }
34537 /* Parse the initialization statement of an OpenMP for loop.
34539 Return true if the resulting construct should have an
34540 OMP_CLAUSE_PRIVATE added to it. */
34542 static tree
34550 {
34556 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34558 init-expr:
34559 var = lb
34560 integer-type var = lb
34561 random-access-iterator-type var = lb
34562 pointer-type var = lb
34563 */
34564 cp_decl_specifier_seq type_specifiers;
34566 /* First, try to parse as an initialized declaration. See
34567 cp_parser_condition, from whence the bulk of this is copied. */
34574 {
34575 /* If parsing a type specifier seq succeeded, then this
34576 MUST be a initialized declaration. */
34581 CP_PARSER_DECLARATOR_NAMED,
34592 else
34593 {
34603 {
34605 CPP_OPEN_PAREN))
34608 else
34609 /* Trigger an error. */
34614 }
34618 {
34626 {
34629 auto_node);
34634 }
34637 asm_specification,
34638 LOOKUP_ONLYCONVERTING);
34641 {
34644 }
34645 else
34646 {
34649 {
34651 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34653 {
34657 {
34661 }
34663 }
34665 {
34670 }
34671 }
34672 }
34674 }
34675 else
34676 {
34677 /* Consume '='. */
34681 non_class:
34684 else
34687 asm_specification,
34688 LOOKUP_ONLYCONVERTING);
34689 }
34693 }
34694 }
34695 else
34696 {
34697 cp_id_kind idk;
34698 /* If parsing a type specifier sequence failed, then
34699 this MUST be a simple expression. */
34705 && decl
34708 {
34719 {
34724 }
34729 }
34731 && decl
34734 {
34735 tree rhs;
34743 rhs,
34744 tf_warning_or_error));
34747 }
34748 else
34749 {
34754 {
34758 }
34759 }
34760 }
34762 }
34764 /* Parse the restricted form of the for statement allowed by OpenMP. */
34766 static tree
34769 {
34773 location_t loc_first;
34784 {
34787 }
34790 {
34793 }
34796 {
34802 }
34804 {
34807 {
34809 "%<linear%> clause may not be specified together "
34812 }
34813 else
34815 }
34828 {
34831 location_t loc;
34834 {
34838 }
34841 matching_parens parens;
34848 add_private_clause
34854 {
34857 {
34863 }
34864 else
34866 }
34873 {
34878 {
34882 }
34885 {
34886 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34890 {
34893 }
34894 else
34895 {
34898 }
34900 }
34901 else
34902 {
34907 }
34908 }
34911 {
34912 tree c;
34914 {
34923 decl);
34927 decl);
34928 }
34930 {
34935 else
34940 {
34943 /* For linear, signal that we need to fill up
34944 the so far unknown linear step. */
34947 }
34948 }
34949 }
34958 {
34959 /* If decl is an iterator, preserve the operator on decl
34960 until finish_omp_for. */
34962 && ((processing_template_decl
34967 else
34971 }
34983 {
34986 }
34991 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34992 in between the collapsed for loops to be still considered perfectly
34993 nested. Hopefully the final version clarifies this.
34994 For now handle (multiple) {'s and empty statements. */
34997 {
35001 {
35003 bracecount++;
35004 }
35008 else
35009 {
35016 }
35017 }
35020 {
35023 }
35024 }
35029 /* Note that we saved the original contents of this flag when we entered
35030 the structured block, and so we don't need to re-save it here. */
35033 /* Note that the grammar doesn't call for a structured block here,
35034 though the loop as a whole is a structured block. */
35041 else
35046 {
35048 {
35050 nbraces--;
35051 }
35054 else
35055 {
35057 {
35060 }
35065 }
35066 }
35069 {
35073 else
35075 }
35079 }
35081 /* Helper function for OpenMP parsing, split clauses and call
35082 finish_omp_clauses on each of the set of clauses afterwards. */
35084 static void
35087 {
35093 }
35095 /* OpenMP 4.0:
35096 #pragma omp simd simd-clause[optseq] new-line
35097 for-loop */
35099 #define OMP_SIMD_CLAUSE_MASK \
35100 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35109 static tree
35113 {
35124 {
35128 OMP_CLAUSE_ORDERED);
35130 {
35132 "%<ordered%> clause with parameter may not be specified "
35135 }
35136 }
35147 }
35149 /* OpenMP 2.5:
35150 #pragma omp for for-clause[optseq] new-line
35151 for-loop
35153 OpenMP 4.0:
35154 #pragma omp for simd for-simd-clause[optseq] new-line
35155 for-loop */
35157 #define OMP_FOR_CLAUSE_MASK \
35158 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35168 static tree
35172 {
35179 /* parallel for{, simd} disallows nowait clause, but for
35180 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35183 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35188 {
35193 {
35217 }
35218 }
35220 {
35223 }
35225 /* Composite distribute parallel for disallows linear clause. */
35232 {
35235 }
35246 }
35248 /* OpenMP 2.5:
35249 # pragma omp master new-line
35250 structured-block */
35252 static tree
35254 {
35258 }
35260 /* OpenMP 2.5:
35261 # pragma omp ordered new-line
35262 structured-block
35264 OpenMP 4.5:
35265 # pragma omp ordered ordered-clauses new-line
35266 structured-block */
35268 #define OMP_ORDERED_CLAUSE_MASK \
35269 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35272 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35273 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35275 static bool
35278 {
35282 {
35287 {
35289 {
35292 }
35294 {
35296 "%<depend%> clause may only be used in compound "
35300 }
35301 tree clauses
35303 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35307 }
35308 }
35310 tree clauses
35321 }
35323 /* OpenMP 2.5:
35325 section-scope:
35326 { section-sequence }
35328 section-sequence:
35329 section-directive[opt] structured-block
35330 section-sequence section-directive structured-block */
35332 static tree
35334 {
35339 matching_braces braces;
35347 {
35351 }
35354 {
35362 {
35366 }
35368 {
35371 }
35376 }
35387 }
35389 /* OpenMP 2.5:
35390 # pragma omp sections sections-clause[optseq] newline
35391 sections-scope */
35393 #define OMP_SECTIONS_CLAUSE_MASK \
35394 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35400 static tree
35403 {
35415 {
35418 }
35425 }
35427 /* OpenMP 2.5:
35428 # pragma omp parallel parallel-clause[optseq] new-line
35429 structured-block
35430 # pragma omp parallel for parallel-for-clause[optseq] new-line
35431 structured-block
35432 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35433 structured-block
35435 OpenMP 4.0:
35436 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35437 structured-block */
35439 #define OMP_PARALLEL_CLAUSE_MASK \
35440 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35450 static tree
35454 {
35461 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35467 {
35475 if_p);
35479 if_p);
35482 block);
35487 }
35488 /* When combined with distribute, parallel has to be followed by for.
35489 #pragma omp target parallel is allowed though. */
35493 {
35497 }
35499 {
35502 }
35504 {
35508 {
35518 block);
35521 }
35522 }
35527 {
35530 }
35538 }
35540 /* OpenMP 2.5:
35541 # pragma omp single single-clause[optseq] new-line
35542 structured-block */
35544 #define OMP_SINGLE_CLAUSE_MASK \
35545 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35550 static tree
35552 {
35562 }
35564 /* OpenMP 3.0:
35565 # pragma omp task task-clause[optseq] new-line
35566 structured-block */
35568 #define OMP_TASK_CLAUSE_MASK \
35569 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35580 static tree
35582 {
35593 }
35595 /* OpenMP 3.0:
35596 # pragma omp taskwait new-line */
35598 static void
35600 {
35603 }
35605 /* OpenMP 3.1:
35606 # pragma omp taskyield new-line */
35608 static void
35610 {
35613 }
35615 /* OpenMP 4.0:
35616 # pragma omp taskgroup new-line
35617 structured-block */
35619 static tree
35621 {
35625 if_p));
35626 }
35629 /* OpenMP 2.5:
35630 # pragma omp threadprivate (variable-list) */
35632 static void
35634 {
35635 tree vars;
35641 }
35643 /* OpenMP 4.0:
35644 # pragma omp cancel cancel-clause[optseq] new-line */
35646 #define OMP_CANCEL_CLAUSE_MASK \
35647 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35653 static void
35655 {
35659 }
35661 /* OpenMP 4.0:
35662 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35664 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35665 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35670 static void
35673 {
35674 tree clauses;
35678 {
35683 {
35686 }
35687 }
35689 {
35693 }
35696 {
35701 else
35705 }
35708 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35710 pragma_tok);
35712 }
35714 /* OpenMP 4.0:
35715 #pragma omp distribute distribute-clause[optseq] new-line
35716 for-loop */
35718 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35719 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35725 static tree
35729 {
35738 {
35746 else
35749 {
35755 {
35759 else
35762 }
35768 else
35782 }
35783 }
35785 {
35788 }
35793 {
35796 }
35807 }
35809 /* OpenMP 4.0:
35810 # pragma omp teams teams-clause[optseq] new-line
35811 structured-block */
35813 #define OMP_TEAMS_CLAUSE_MASK \
35814 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35822 static tree
35826 {
35835 {
35839 {
35864 }
35865 }
35867 {
35870 }
35875 {
35878 }
35887 }
35889 /* OpenMP 4.0:
35890 # pragma omp target data target-data-clause[optseq] new-line
35891 structured-block */
35893 #define OMP_TARGET_DATA_CLAUSE_MASK \
35894 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35899 static tree
35901 {
35902 tree clauses
35907 {
35910 {
35927 "%<#pragma omp target data%> with map-type other "
35928 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35932 }
35934 }
35937 {
35940 "%<#pragma omp target data%> must contain at least "
35943 }
35954 }
35956 /* OpenMP 4.5:
35957 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35958 structured-block */
35960 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35961 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35967 static tree
35970 {
35973 {
35978 {
35981 }
35982 }
35984 {
35988 }
35991 {
35997 }
35999 tree clauses
36004 {
36007 {
36020 "%<#pragma omp target enter data%> with map-type other "
36024 }
36026 }
36029 {
36032 "%<#pragma omp target enter data%> must contain at least "
36035 }
36042 }
36044 /* OpenMP 4.5:
36045 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36046 structured-block */
36048 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36049 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36055 static tree
36058 {
36061 {
36066 {
36069 }
36070 }
36072 {
36076 }
36079 {
36085 }
36087 tree clauses
36092 {
36095 {
36109 "%<#pragma omp target exit data%> with map-type other "
36110 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36114 }
36116 }
36119 {
36122 "%<#pragma omp target exit data%> must contain at least "
36125 }
36132 }
36134 /* OpenMP 4.0:
36135 # pragma omp target update target-update-clause[optseq] new-line */
36137 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36138 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36145 static bool
36148 {
36150 {
36156 }
36158 tree clauses
36163 {
36165 "%<#pragma omp target update%> must contain at least one "
36168 }
36176 }
36178 /* OpenMP 4.0:
36179 # pragma omp target target-clause[optseq] new-line
36180 structured-block */
36182 #define OMP_TARGET_CLAUSE_MASK \
36183 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36193 static bool
36196 {
36200 {
36212 {
36220 {
36221 tree stmt;
36223 {
36226 OMP_TARGET_CLAUSE_MASK,
36231 OMP_TARGET_CLAUSE_MASK,
36236 OMP_TARGET_CLAUSE_MASK,
36241 }
36243 }
36248 {
36252 if_p);
36257 if_p);
36262 if_p);
36266 }
36272 {
36273 /* For combined target teams, ensure the num_teams and
36274 thread_limit clause expressions are evaluated on the host,
36275 before entering the target construct. */
36276 tree c;
36282 {
36291 OMP_CLAUSE_FIRSTPRIVATE);
36296 }
36297 }
36307 }
36309 {
36312 }
36314 {
36318 }
36320 {
36324 }
36326 {
36330 }
36332 {
36335 }
36336 }
36338 {
36341 }
36356 check_clauses:
36358 {
36361 {
36375 "%<#pragma omp target%> with map-type other "
36376 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36380 }
36382 }
36384 }
36386 /* OpenACC 2.0:
36387 # pragma acc cache (variable-list) new-line
36388 */
36390 static tree
36392 {
36407 }
36409 /* OpenACC 2.0:
36410 # pragma acc data oacc-data-clause[optseq] new-line
36411 structured-block */
36413 #define OACC_DATA_CLAUSE_MASK \
36414 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36426 static tree
36428 {
36441 }
36443 /* OpenACC 2.0:
36444 # pragma acc host_data <clauses> new-line
36445 structured-block */
36447 #define OACC_HOST_DATA_CLAUSE_MASK \
36448 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36450 static tree
36452 {
36465 }
36467 /* OpenACC 2.0:
36468 # pragma acc declare oacc-data-clause[optseq] new-line
36469 */
36471 #define OACC_DECLARE_CLAUSE_MASK \
36472 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36485 static tree
36487 {
36496 {
36500 }
36503 {
36507 {
36511 }
36514 {
36526 {
36528 "%qD must be a global variable in "
36530 decl);
36533 }
36538 {
36542 }
36544 {
36546 "invalid use of %<extern%> variable %qD "
36550 }
36552 {
36554 "invalid use of %<global%> variable %qD "
36558 }
36560 }
36565 {
36570 }
36573 {
36574 tree id;
36578 else
36584 {
36587 {
36590 {
36594 }
36595 }
36596 }
36597 }
36598 }
36611 }
36613 /* OpenACC 2.0:
36614 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36616 or
36618 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36620 LOC is the location of the #pragma token.
36621 */
36623 #define OACC_ENTER_DATA_CLAUSE_MASK \
36624 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36632 #define OACC_EXIT_DATA_CLAUSE_MASK \
36633 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36639 static tree
36642 {
36651 {
36656 }
36663 else
36668 {
36672 }
36680 }
36682 /* OpenACC 2.0:
36683 # pragma acc loop oacc-loop-clause[optseq] new-line
36684 structured-block */
36686 #define OACC_LOOP_CLAUSE_MASK \
36687 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36698 static tree
36701 {
36710 {
36716 }
36725 }
36727 /* OpenACC 2.0:
36728 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36729 structured-block
36731 or
36733 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36734 structured-block
36735 */
36737 #define OACC_KERNELS_CLAUSE_MASK \
36738 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36756 #define OACC_PARALLEL_CLAUSE_MASK \
36757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36778 static tree
36781 {
36782 omp_clause_mask mask;
36785 {
36798 }
36801 {
36805 {
36808 tree clauses;
36810 if_p);
36812 }
36813 }
36822 }
36824 /* OpenACC 2.0:
36825 # pragma acc update oacc-update-clause[optseq] new-line
36826 */
36828 #define OACC_UPDATE_CLAUSE_MASK \
36829 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36836 static tree
36838 {
36845 {
36847 "%<#pragma acc update%> must contain at least one "
36850 }
36858 }
36860 /* OpenACC 2.0:
36861 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36863 LOC is the location of the #pragma token.
36864 */
36866 #define OACC_WAIT_CLAUSE_MASK \
36867 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36869 static tree
36871 {
36885 }
36887 /* OpenMP 4.0:
36888 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36890 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36891 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36898 static void
36901 {
36903 cp_omp_declare_simd_data data;
36905 {
36910 /* It is safe to take the address of a local variable; it will only be
36911 used while this scope is live. */
36913 }
36915 /* Store away all pragma tokens. */
36927 {
36931 {
36944 }
36949 "%<#pragma omp declare simd%> not immediately followed by "
36953 }
36954 }
36956 /* Finalize #pragma omp declare simd clauses after direct declarator has
36957 been parsed, and put that into "omp declare simd" attribute. */
36959 static tree
36961 {
36967 {
36971 }
36976 {
36994 }
36998 }
37001 /* OpenMP 4.0:
37002 # pragma omp declare target new-line
37003 declarations and definitions
37004 # pragma omp end declare target new-line
37006 OpenMP 4.5:
37007 # pragma omp declare target ( extended-list ) new-line
37009 # pragma omp declare target declare-target-clauses[seq] new-line */
37011 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37012 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37015 static void
37017 {
37020 clauses
37024 {
37026 clauses);
37029 }
37030 else
37031 {
37035 }
37038 "%<#pragma omp declare target%> with clauses in between "
37039 "%<#pragma omp declare target%> without clauses and "
37042 {
37048 {
37051 }
37052 else
37055 {
37057 "%qD specified both in declare target %<link%> and %<to%>"
37060 }
37062 {
37069 {
37072 {
37076 }
37077 }
37078 }
37079 }
37080 }
37082 static void
37084 {
37087 {
37090 }
37092 {
37096 {
37099 }
37102 else
37103 {
37107 }
37108 }
37109 else
37110 {
37114 }
37118 "%<#pragma omp end declare target%> without corresponding "
37120 else
37122 }
37124 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37125 expression and optional initializer clause of
37126 #pragma omp declare reduction. We store the expression(s) as
37127 either 3, 6 or 7 special statements inside of the artificial function's
37128 body. The first two statements are DECL_EXPRs for the artificial
37129 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37130 expression that uses those variables.
37131 If there was any INITIALIZER clause, this is followed by further statements,
37132 the fourth and fifth statements are DECL_EXPRs for the artificial
37133 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37134 constructor variant (first token after open paren is not omp_priv),
37135 then the sixth statement is a statement with the function call expression
37136 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37137 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37138 to initialize the OMP_PRIV artificial variable and there is seventh
37139 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37141 static bool
37143 {
37155 tree combiner;
37170 {
37173 }
37176 {
37178 matching_parens parens;
37184 {
37187 }
37203 {
37207 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37211 == CPP_CLOSE_PAREN
37214 {
37218 }
37223 }
37224 else
37225 {
37241 {
37246 }
37248 tree arg;
37261 }
37272 }
37276 UNKNOWN_LOCATION);
37279 }
37281 /* OpenMP 4.0
37282 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37283 initializer-clause[opt] new-line
37285 initializer-clause:
37286 initializer (omp_priv initializer)
37287 initializer (function-name (argument-list)) */
37289 static void
37292 {
37302 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37309 {
37341 }
37353 /* Types may not be defined in declare reduction type list. */
37356 parser->type_definition_forbidden_message
37362 saved_colon_doesnt_start_class_def_p
37367 {
37371 ;
37390 else
37395 else
37397 }
37399 /* Restore the saved message. */
37402 parser->colon_doesnt_start_class_def_p
37407 {
37408 fail:
37411 }
37417 {
37418 tree fntype
37421 NULL_TREE);
37441 {
37446 }
37448 {
37450 {
37459 }
37466 }
37467 else
37468 {
37471 }
37474 else
37477 {
37480 }
37482 {
37485 else
37490 }
37495 else
37496 {
37505 }
37512 }
37516 done:
37517 /* Free any declarators allocated. */
37519 }
37521 /* OpenMP 4.0
37522 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37523 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37524 initializer-clause[opt] new-line
37525 #pragma omp declare target new-line */
37527 static bool
37530 {
37532 {
37537 {
37540 context);
37542 }
37545 {
37548 context);
37550 }
37552 {
37555 }
37557 {
37561 }
37562 }
37567 }
37569 /* OpenMP 4.5:
37570 #pragma omp taskloop taskloop-clause[optseq] new-line
37571 for-loop
37573 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37574 for-loop */
37576 #define OMP_TASKLOOP_CLAUSE_MASK \
37577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37592 static tree
37596 {
37605 {
37610 {
37634 }
37635 }
37637 {
37640 }
37645 {
37648 }
37654 if_p);
37660 }
37663 /* OpenACC 2.0:
37664 # pragma acc routine oacc-routine-clause[optseq] new-line
37665 function-definition
37667 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37668 */
37670 #define OACC_ROUTINE_CLAUSE_MASK \
37671 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37677 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37678 component, which must resolve to a declared namespace-scope
37679 function. The clauses are either processed directly (for a named
37680 function), or defered until the immediatley following declaration
37681 is parsed. */
37683 static void
37686 {
37688 /* The checking for "another pragma following this one" in the "no optional
37689 '( name )'" case makes sure that we dont re-enter. */
37692 cp_oacc_routine_data data;
37698 /* It is safe to take the address of a local variable; it will only be
37699 used while this scope is live. */
37702 /* Look for optional '( name )'. */
37704 {
37705 matching_parens parens;
37708 /* We parse the name as an id-expression. If it resolves to
37709 anything other than a non-overloaded function at namespace
37710 scope, it's an error. */
37724 {
37728 }
37730 data.clauses
37738 {
37743 }
37745 /* Perhaps we should use the same rule as declarations in different
37746 namespaces? */
37748 {
37753 }
37756 {
37760 }
37764 }
37766 {
37767 /* Store away all pragma tokens. */
37778 /* Emit a helpful diagnostic if there's another pragma following this
37779 one. */
37781 {
37784 /* ..., and then just keep going. */
37786 }
37788 /* We only have to consider the pragma_external case here. */
37793 else
37796 }
37797 }
37799 /* Finalize #pragma acc routine clauses after direct declarator has
37800 been parsed. */
37802 static tree
37804 {
37809 {
37811 "%<#pragma acc routine%> not immediately followed by "
37814 }
37831 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37832 fndecl_seen. */
37835 }
37837 /* Apply any saved OpenACC routine clauses to a just-parsed
37838 declaration. */
37840 static void
37842 {
37844 {
37845 /* Keep going if we're in error reporting mode. */
37851 {
37853 "%<#pragma acc routine%> not immediately followed by"
37857 }
37859 {
37862 }
37865 {
37870 }
37873 {
37881 }
37883 /* Process the routine's dimension clauses. */
37887 /* Add an "omp declare target" attribute. */
37892 /* Don't unset parser->oacc_routine here: we may still need it to
37893 diagnose wrong usage. But, remember that we've used this "#pragma acc
37894 routine". */
37896 }
37897 }
37899 /* Main entry point to OpenMP statement pragmas. */
37901 static void
37903 {
37904 tree stmt;
37909 {
37932 if_p);
37937 if_p);
37954 if_p);
37959 if_p);
37967 if_p);
37976 if_p);
37990 if_p);
37995 if_p);
37999 }
38002 }
38003 \f
38004 /* Transactional Memory parsing routines. */
38006 /* Parse a transaction attribute.
38008 txn-attribute:
38009 attribute
38010 [ [ identifier ] ]
38012 We use this instead of cp_parser_attributes_opt for transactions to avoid
38013 the pedwarn in C++98 mode. */
38015 static tree
38017 {
38032 {
38036 /* For keywords, use the canonical spelling,
38037 not the parsed identifier. */
38041 }
38042 else
38046 error1:
38049 }
38051 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38053 transaction-statement:
38054 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38055 compound-statement
38056 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38057 */
38059 static tree
38061 {
38072 else
38073 {
38077 }
38079 /* Parse a noexcept specification. */
38083 {
38084 /* cancel-and-throw is unimplemented. */
38087 }
38088 else
38091 /* Keep track if we're in the lexical scope of an outer transaction. */
38103 }
38105 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38107 transaction-expression:
38108 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38109 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38110 */
38112 static tree
38114 {
38127 keyword == RID_TRANSACTION_RELAXED
38141 /* Set this early. This might mean that we allow transaction_cancel in
38142 an expression that we find out later actually has to be a constexpr.
38143 However, we expect that cxx_constant_value will be able to deal with
38144 this; also, if the noexcept has no constexpr, then what we parse next
38145 really is a transaction's body. */
38148 /* Parse a noexcept specification. */
38154 {
38155 matching_parens parens;
38162 }
38163 else
38164 {
38165 /* The only expression that is available got parsed for the noexcept
38166 already. noexcept is true then. */
38169 }
38178 }
38180 /* Parse a function-transaction-block.
38182 function-transaction-block:
38183 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38184 function-body
38185 __transaction_atomic txn-attribute[opt] function-try-block
38186 __transaction_relaxed ctor-initializer[opt] function-body
38187 __transaction_relaxed function-try-block
38188 */
38190 static void
38192 {
38207 else
38208 {
38212 }
38220 else
38221 cp_parser_ctor_initializer_opt_and_function_body
38227 }
38229 /* Parse a __transaction_cancel statement.
38231 cancel-statement:
38232 __transaction_cancel txn-attribute[opt] ;
38233 __transaction_cancel txn-attribute[opt] throw-expression ;
38235 ??? Cancel and throw is not yet implemented. */
38237 static tree
38239 {
38245 RT_TRANSACTION_CANCEL);
38252 /* ??? Parse cancel-and-throw here. */
38257 {
38261 }
38263 {
38267 }
38269 {
38272 {
38278 }
38279 }
38281 {
38285 }
38291 }
38292 \f
38293 /* The parser. */
38297 \f
38298 /* Special handling for the first token or line in the file. The first
38299 thing in the file might be #pragma GCC pch_preprocess, which loads a
38300 PCH file, which is a GC collection point. So we need to handle this
38301 first pragma without benefit of an existing lexer structure.
38303 Always returns one token to the caller in *FIRST_TOKEN. This is
38304 either the true first token of the file, or the first token after
38305 the initial pragma. */
38307 static void
38309 {
38318 {
38325 }
38326 else
38329 /* Skip to the end of the pragma. */
38333 /* Now actually load the PCH file. */
38337 /* Read one more token to return to our caller. We have to do this
38338 after reading the PCH file in, since its pointers have to be
38339 live. */
38341 }
38343 /* Normal parsing of a pragma token. Here we can (and must) use the
38344 regular lexer. */
38346 static bool
38348 {
38351 tree stmt;
38362 {
38370 {
38380 }
38385 {
38395 }
38400 {
38411 }
38416 {
38427 }
38432 {
38443 }
38463 {
38468 }
38476 {
38481 }
38489 {
38493 }
38499 {
38504 }
38512 {
38517 }
38572 "%<#pragma omp section%> may only be used in "
38577 {
38579 {
38583 }
38590 {
38593 }
38596 }
38603 bad_stmt:
38606 }
38610 }
38612 /* The interface the pragma parsers have to the lexer. */
38614 enum cpp_ttype
38616 {
38628 else
38629 {
38633 }
38636 }
38638 \f
38639 /* External interface. */
38641 /* Parse one entire translation unit. */
38643 void
38645 {
38658 }
38660 /* Create an identifier for a generic parameter type (a synthesized
38661 template parameter implied by `auto' or a concept identifier). */
38664 static tree
38666 {
38670 }
38672 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38673 (creating a new template parameter list if necessary). Returns the newly
38674 created template type parm. */
38676 static tree
38678 {
38681 /* Before committing to modifying any scope, if we're in an
38682 implicit template scope, and we're trying to synthesize a
38683 constrained parameter, try to find a previous parameter with
38684 the same name. This is the same-type rule for abbreviated
38685 function templates.
38687 NOTE: We can generate implicit parameters when tentatively
38688 parsing a nested name specifier, only to reject that parse
38689 later. However, matching the same template-id as part of a
38690 direct-declarator should generate an identical template
38691 parameter, so this rule will merge them. */
38693 {
38696 {
38698 {
38701 /* Return the TEMPLATE_PARM_INDEX. */
38704 }
38706 }
38707 }
38709 /* We are either continuing a function template that already contains implicit
38710 template parameters, creating a new fully-implicit function template, or
38711 extending an existing explicit function template with implicit template
38712 parameters. */
38720 {
38724 }
38725 else
38726 {
38727 /* Roll back to the existing template parameter scope (in the case of
38728 extending an explicit function template) or introduce a new template
38729 parameter scope ahead of the function parameter scope (or class scope
38730 in the case of out-of-line member definitions). The function scope is
38731 added back after template parameter synthesis below. */
38736 {
38739 }
38741 {
38742 /* If not defining a class, then any class scope is a scope level in
38743 an out-of-line member definition. In this case simply wind back
38744 beyond the first such scope to inject the template parameter list.
38745 Otherwise wind back to the class being defined. The latter can
38746 occur in class member friend declarations such as:
38748 class A {
38749 void foo (auto);
38750 };
38751 class B {
38752 friend void A::foo (auto);
38753 };
38755 The template parameter list synthesized for the friend declaration
38756 must be injected in the scope of 'B'. This can also occur in
38757 erroneous cases such as:
38759 struct A {
38760 struct B {
38761 void foo (auto);
38762 };
38763 void B::foo (auto) {}
38764 };
38766 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38767 but, nevertheless, the template parameter list synthesized for the
38768 declarator should be injected into the scope of 'A' as if the
38769 ill-formed template was specified explicitly. */
38772 {
38775 }
38776 }
38782 {
38783 /* Introduce a new template parameter list for implicit template
38784 parameters. */
38788 parser->implicit_template_scope
38795 }
38796 else
38797 {
38798 /* Synthesize implicit template parameters at the end of the explicit
38799 template parameter list. */
38806 parser->implicit_template_parms
38808 }
38809 }
38811 /* Synthesize a new template parameter and track the current template
38812 parameter chain with implicit_template_parms. */
38816 tree synth_tmpl_parm;
38820 synth_tmpl_parm
38823 synth_tmpl_parm
38825 else
38826 {
38830 }
38832 // Attach the constraint to the parm before processing.
38835 tree new_parm
38837 input_location,
38838 node,
38842 // Chain the new parameter to the list of implicit parameters.
38844 parser->implicit_template_parms
38846 else
38851 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38854 /* If creating a fully implicit function template, start the new implicit
38855 template parameter list with this synthesized type, otherwise grow the
38856 current template parameter list. */
38859 {
38866 }
38867 else
38868 {
38873 }
38875 // If the new parameter was constrained, we need to add that to the
38876 // constraints in the template parameter list.
38878 {
38882 }
38887 }
38889 /* Finish the declaration of a fully implicit function template. Such a
38890 template has no explicit template parameter list so has not been through the
38891 normal template head and tail processing. synthesize_implicit_template_parm
38892 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38893 provided if the declaration is a class member such that its template
38894 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38895 form is returned. Otherwise NULL_TREE is returned. */
38897 static tree
38899 {
38904 {
38908 }
38918 }
38920 /* Helper function for diagnostics that have complained about things
38921 being used with 'extern "C"' linkage.
38923 Attempt to issue a note showing where the 'extern "C"' linkage began. */
38925 void
38927 {
38931 }