| blob | 9a05e4fc812b4549c6a00e0ac0ad775a737634d7 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2268 /* Classes [gram.class] */
2270 static tree cp_parser_class_name
2272 static tree cp_parser_class_specifier
2274 static tree cp_parser_class_head
2276 static enum tag_types cp_parser_class_key
2278 static void cp_parser_type_parameter_key
2280 static void cp_parser_member_specification_opt
2282 static void cp_parser_member_declaration
2284 static tree cp_parser_pure_specifier
2286 static tree cp_parser_constant_initializer
2289 /* Derived classes [gram.class.derived] */
2291 static tree cp_parser_base_clause
2293 static tree cp_parser_base_specifier
2296 /* Special member functions [gram.special] */
2298 static tree cp_parser_conversion_function_id
2300 static tree cp_parser_conversion_type_id
2304 static void cp_parser_ctor_initializer_opt
2306 static void cp_parser_mem_initializer_list
2308 static tree cp_parser_mem_initializer
2310 static tree cp_parser_mem_initializer_id
2313 /* Overloading [gram.over] */
2315 static cp_expr cp_parser_operator_function_id
2317 static cp_expr cp_parser_operator
2320 /* Templates [gram.temp] */
2322 static void cp_parser_template_declaration
2324 static tree cp_parser_template_parameter_list
2326 static tree cp_parser_template_parameter
2328 static tree cp_parser_type_parameter
2330 static tree cp_parser_template_id
2332 static tree cp_parser_template_name
2334 static tree cp_parser_template_argument_list
2336 static tree cp_parser_template_argument
2338 static void cp_parser_explicit_instantiation
2340 static void cp_parser_explicit_specialization
2343 /* Exception handling [gram.exception] */
2345 static tree cp_parser_try_block
2347 static void cp_parser_function_try_block
2349 static void cp_parser_handler_seq
2351 static void cp_parser_handler
2353 static tree cp_parser_exception_declaration
2355 static tree cp_parser_throw_expression
2357 static tree cp_parser_exception_specification_opt
2359 static tree cp_parser_type_id_list
2362 /* GNU Extensions */
2364 static tree cp_parser_asm_specification_opt
2366 static tree cp_parser_asm_operand_list
2368 static tree cp_parser_asm_clobber_list
2370 static tree cp_parser_asm_label_list
2372 static bool cp_next_tokens_can_be_attribute_p
2374 static bool cp_next_tokens_can_be_gnu_attribute_p
2376 static bool cp_next_tokens_can_be_std_attribute_p
2378 static bool cp_nth_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_gnu_attribute_p
2382 static bool cp_nth_tokens_can_be_attribute_p
2384 static tree cp_parser_attributes_opt
2386 static tree cp_parser_gnu_attributes_opt
2388 static tree cp_parser_gnu_attribute_list
2390 static tree cp_parser_std_attribute
2392 static tree cp_parser_std_attribute_spec
2394 static tree cp_parser_std_attribute_spec_seq
2396 static bool cp_parser_extension_opt
2398 static void cp_parser_label_declaration
2401 /* Concept Extensions */
2403 static tree cp_parser_requires_clause
2405 static tree cp_parser_requires_clause_opt
2407 static tree cp_parser_requires_expression
2409 static tree cp_parser_requirement_parameter_list
2411 static tree cp_parser_requirement_body
2413 static tree cp_parser_requirement_list
2415 static tree cp_parser_requirement
2417 static tree cp_parser_simple_requirement
2419 static tree cp_parser_compound_requirement
2421 static tree cp_parser_type_requirement
2423 static tree cp_parser_nested_requirement
2426 /* Transactional Memory Extensions */
2428 static tree cp_parser_transaction
2430 static tree cp_parser_transaction_expression
2432 static void cp_parser_function_transaction
2434 static tree cp_parser_transaction_cancel
2438 pragma_external,
2439 pragma_member,
2440 pragma_objc_icode,
2441 pragma_stmt,
2442 pragma_compound
2443 };
2444 static bool cp_parser_pragma
2447 /* Objective-C++ Productions */
2449 static tree cp_parser_objc_message_receiver
2451 static tree cp_parser_objc_message_args
2453 static tree cp_parser_objc_message_expression
2455 static cp_expr cp_parser_objc_encode_expression
2457 static tree cp_parser_objc_defs_expression
2459 static tree cp_parser_objc_protocol_expression
2461 static tree cp_parser_objc_selector_expression
2463 static cp_expr cp_parser_objc_expression
2465 static bool cp_parser_objc_selector_p
2467 static tree cp_parser_objc_selector
2469 static tree cp_parser_objc_protocol_refs_opt
2471 static void cp_parser_objc_declaration
2473 static tree cp_parser_objc_statement
2475 static bool cp_parser_objc_valid_prefix_attributes
2477 static void cp_parser_objc_at_property_declaration
2479 static void cp_parser_objc_at_synthesize_declaration
2481 static void cp_parser_objc_at_dynamic_declaration
2483 static tree cp_parser_objc_struct_declaration
2486 /* Utility Routines */
2488 static cp_expr cp_parser_lookup_name
2490 static tree cp_parser_lookup_name_simple
2492 static tree cp_parser_maybe_treat_template_as_class
2494 static bool cp_parser_check_declarator_template_parameters
2496 static bool cp_parser_check_template_parameters
2498 static cp_expr cp_parser_simple_cast_expression
2500 static tree cp_parser_global_scope_opt
2502 static bool cp_parser_constructor_declarator_p
2504 static tree cp_parser_function_definition_from_specifiers_and_declarator
2506 static tree cp_parser_function_definition_after_declarator
2508 static bool cp_parser_template_declaration_after_export
2510 static void cp_parser_perform_template_parameter_access_checks
2512 static tree cp_parser_single_declaration
2514 static cp_expr cp_parser_functional_cast
2516 static tree cp_parser_save_member_function_body
2518 static tree cp_parser_save_nsdmi
2520 static tree cp_parser_enclosed_template_argument_list
2522 static void cp_parser_save_default_args
2524 static void cp_parser_late_parsing_for_member
2526 static tree cp_parser_late_parse_one_default_arg
2528 static void cp_parser_late_parsing_nsdmi
2530 static void cp_parser_late_parsing_default_args
2532 static tree cp_parser_sizeof_operand
2534 static cp_expr cp_parser_trait_expr
2536 static bool cp_parser_declares_only_class_p
2538 static void cp_parser_set_storage_class
2540 static void cp_parser_set_decl_spec_type
2542 static void set_and_check_decl_spec_loc
2545 static bool cp_parser_friend_p
2547 static void cp_parser_required_error
2553 static bool cp_parser_token_starts_function_definition_p
2555 static bool cp_parser_next_token_starts_class_definition_p
2557 static bool cp_parser_next_token_ends_template_argument_p
2559 static bool cp_parser_nth_token_starts_template_argument_list_p
2561 static enum tag_types cp_parser_token_is_class_key
2563 static enum tag_types cp_parser_token_is_type_parameter_key
2565 static void cp_parser_check_class_key
2567 static void cp_parser_check_access_in_redeclaration
2569 static bool cp_parser_optional_template_keyword
2571 static void cp_parser_pre_parsed_nested_name_specifier
2573 static bool cp_parser_cache_group
2575 static tree cp_parser_cache_defarg
2577 static void cp_parser_parse_tentatively
2579 static void cp_parser_commit_to_tentative_parse
2581 static void cp_parser_commit_to_topmost_tentative_parse
2583 static void cp_parser_abort_tentative_parse
2585 static bool cp_parser_parse_definitely
2589 static bool cp_parser_uncommitted_to_tentative_parse_p
2591 static void cp_parser_error
2593 static void cp_parser_name_lookup_error
2595 static bool cp_parser_simulate_error
2597 static bool cp_parser_check_type_definition
2599 static void cp_parser_check_for_definition_in_return_type
2601 static void cp_parser_check_for_invalid_template_id
2603 static bool cp_parser_non_integral_constant_expression
2605 static void cp_parser_diagnose_invalid_type_name
2607 static bool cp_parser_parse_and_diagnose_invalid_type_name
2609 static int cp_parser_skip_to_closing_parenthesis
2611 static void cp_parser_skip_to_end_of_statement
2613 static void cp_parser_consume_semicolon_at_end_of_statement
2615 static void cp_parser_skip_to_end_of_block_or_statement
2617 static bool cp_parser_skip_to_closing_brace
2619 static void cp_parser_skip_to_end_of_template_parameter_list
2621 static void cp_parser_skip_to_pragma_eol
2623 static bool cp_parser_error_occurred
2625 static bool cp_parser_allow_gnu_extensions_p
2627 static bool cp_parser_is_pure_string_literal
2629 static bool cp_parser_is_string_literal
2631 static bool cp_parser_is_keyword
2633 static tree cp_parser_make_typename_type
2637 static bool cp_parser_compound_literal_p
2639 static bool cp_parser_array_designator_p
2641 static bool cp_parser_init_statement_p
2643 static bool cp_parser_skip_to_closing_square_bracket
2646 /* Concept-related syntactic transformations */
2651 // -------------------------------------------------------------------------- //
2652 // Unevaluated Operand Guard
2653 //
2654 // Implementation of an RAII helper for unevaluated operand parsing.
2656 {
2659 }
2662 {
2665 }
2667 // -------------------------------------------------------------------------- //
2668 // Tentative Parsing
2670 /* Returns nonzero if we are parsing tentatively. */
2674 {
2676 }
2678 /* Returns nonzero if TOKEN is a string literal. */
2680 static bool
2682 {
2688 }
2690 /* Returns nonzero if TOKEN is a string literal
2691 of a user-defined string literal. */
2693 static bool
2695 {
2702 }
2704 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2706 static bool
2708 {
2710 }
2712 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2713 PRAGMA_NONE. */
2715 static enum pragma_kind
2717 {
2720 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2722 }
2724 /* Helper function for cp_parser_error.
2725 Having peeked a token of kind TOK1_KIND that might signify
2726 a conflict marker, peek successor tokens to determine
2727 if we actually do have a conflict marker.
2728 Specifically, we consider a run of 7 '<', '=' or '>' characters
2729 at the start of a line as a conflict marker.
2730 These come through the lexer as three pairs and a single,
2731 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2732 If it returns true, *OUT_LOC is written to with the location/range
2733 of the marker. */
2735 static bool
2738 {
2749 /* It must be at the start of the line. */
2754 /* We have a conflict marker. Construct a location of the form:
2755 <<<<<<<
2756 ^~~~~~~
2757 with start == caret, finishing at the end of the marker. */
2762 }
2764 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2765 RT_CLOSE_PAREN. */
2769 {
2771 {
2779 }
2780 }
2782 /* Attempt to convert TOKEN_DESC from a required_token to an
2783 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2785 static enum cpp_ttype
2787 {
2789 {
2810 /* Use CPP_EOF as a "no completions possible" code. */
2812 }
2813 }
2816 /* Subroutine of cp_parser_error and cp_parser_required_error.
2818 Issue a diagnostic of the form
2819 FILE:LINE: MESSAGE before TOKEN
2820 where TOKEN is the next token in the input stream. MESSAGE
2821 (specified by the caller) is usually of the form "expected
2822 OTHER-TOKEN".
2824 This bypasses the check for tentative passing, and potentially
2825 adds material needed by cp_parser_required_error.
2827 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2828 suggesting insertion of the missing token.
2830 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2831 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2832 location. */
2834 static void
2836 required_token missing_token_desc,
2837 location_t matching_location)
2838 {
2840 /* This diagnostic makes more sense if it is tagged to the line
2841 of the token we just peeked at. */
2845 {
2850 }
2852 /* If this is actually a conflict marker, report it as such. */
2856 {
2857 location_t loc;
2859 {
2862 }
2863 }
2870 {
2871 /* Potentially supply a fix-it hint, suggesting to add the
2872 missing token immediately after the *previous* token.
2873 This may move the primary location within richloc. */
2875 location_t prev_token_loc
2879 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2880 Attempt to consolidate diagnostics by printing it as a
2881 secondary range within the main diagnostic. */
2883 added_matching_location
2885 }
2887 /* Actually emit the error. */
2889 /* Because c_parser_error does not understand
2890 CPP_KEYWORD, keywords are treated like
2891 identifiers. */
2896 {
2897 /* If we weren't able to consolidate matching_location, then
2898 print it as a secondary diagnostic. */
2903 }
2904 }
2906 /* If not parsing tentatively, issue a diagnostic of the form
2907 FILE:LINE: MESSAGE before TOKEN
2908 where TOKEN is the next token in the input stream. MESSAGE
2909 (specified by the caller) is usually of the form "expected
2910 OTHER-TOKEN". */
2912 static void
2914 {
2917 }
2919 /* Issue an error about name-lookup failing. NAME is the
2920 IDENTIFIER_NODE DECL is the result of
2921 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2922 the thing that we hoped to find. */
2924 static void
2926 tree name,
2927 tree decl,
2928 name_lookup_error desired,
2929 location_t location)
2930 {
2931 /* If name lookup completely failed, tell the user that NAME was not
2932 declared. */
2934 {
2947 else
2949 }
2951 {
2953 {
2970 }
2971 }
2973 {
2975 {
2985 name);
2989 }
2990 }
2991 else
2992 {
2994 {
3007 }
3008 }
3009 }
3011 /* If we are parsing tentatively, remember that an error has occurred
3012 during this tentative parse. Returns true if the error was
3013 simulated; false if a message should be issued by the caller. */
3015 static bool
3017 {
3019 {
3022 }
3024 }
3026 /* This function is called when a type is defined. If type
3027 definitions are forbidden at this point, an error message is
3028 issued. */
3030 static bool
3032 {
3033 /* If types are forbidden here, issue a message. */
3035 {
3036 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3037 in the message need to be interpreted. */
3040 }
3042 }
3044 /* This function is called when the DECLARATOR is processed. The TYPE
3045 was a type defined in the decl-specifiers. If it is invalid to
3046 define a type in the decl-specifiers for DECLARATOR, an error is
3047 issued. TYPE_LOCATION is the location of TYPE and is used
3048 for error reporting. */
3050 static void
3053 {
3054 /* [dcl.fct] forbids type definitions in return types.
3055 Unfortunately, it's not easy to know whether or not we are
3056 processing a return type until after the fact. */
3064 {
3069 type);
3070 }
3071 }
3073 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3074 "<" in any valid C++ program. If the next token is indeed "<",
3075 issue a message warning the user about what appears to be an
3076 invalid attempt to form a template-id. LOCATION is the location
3077 of the type-specifier (TYPE) */
3079 static void
3081 tree type,
3083 location_t location)
3084 {
3088 {
3094 {
3097 else
3099 }
3100 else
3102 /* Remember the location of the invalid "<". */
3105 /* Consume the "<". */
3107 /* Parse the template arguments. */
3109 /* Permanently remove the invalid template arguments so that
3110 this error message is not issued again. */
3113 }
3114 }
3116 /* If parsing an integral constant-expression, issue an error message
3117 about the fact that THING appeared and return true. Otherwise,
3118 return false. In either case, set
3119 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3121 static bool
3123 non_integral_constant thing)
3124 {
3127 {
3129 {
3132 {
3135 "ISO C++ forbids using a floating-point literal "
3140 "enumeration type cannot appear in a "
3231 }
3235 }
3236 }
3238 }
3240 /* Emit a diagnostic for an invalid type name. This function commits
3241 to the current active tentative parse, if any. (Otherwise, the
3242 problematic construct might be encountered again later, resulting
3243 in duplicate error messages.) LOCATION is the location of ID. */
3245 static void
3247 location_t location)
3248 {
3251 /* Try to lookup the identifier. */
3258 /* If the lookup was ambiguous, an error will already have
3259 been issued. */
3261 /* If the lookup found a template-name, it means that the user forgot
3262 to specify an argument list. Emit a useful error message. */
3264 {
3267 decl);
3272 }
3276 /* Something like 'unsigned A a;' */
3279 {
3280 /* Issue an error message. */
3281 name_hint hint;
3285 {
3291 }
3292 else
3294 /* If we're in a template class, it's possible that the user was
3295 referring to a type from a base class. For example:
3297 template <typename T> struct A { typedef T X; };
3298 template <typename T> struct B : public A<T> { X x; };
3300 The user should have said "typename A<T>::X". */
3316 {
3317 tree b;
3320 b;
3322 {
3326 {
3327 tree field;
3328 /* Go from a particular instantiation of the
3329 template (which will have an empty TYPE_FIELDs),
3330 to the main version. */
3333 field;
3337 {
3342 }
3345 }
3346 }
3347 }
3348 }
3349 /* Here we diagnose qualified-ids where the scope is actually correct,
3350 but the identifier does not resolve to a valid type name. */
3352 {
3354 {
3363 else
3372 }
3375 {
3376 /* A<T>::A<T>() */
3382 }
3385 {
3388 "need %<typename%> before %<%T::%D::%E%> because "
3392 id,
3395 else
3399 }
3401 {
3413 else
3419 }
3420 else
3422 }
3423 }
3425 /* Check for a common situation where a type-name should be present,
3426 but is not, and issue a sensible error message. Returns true if an
3427 invalid type-name was detected.
3429 The situation handled by this function are variable declarations of the
3430 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3431 Usually, `ID' should name a type, but if we got here it means that it
3432 does not. We try to emit the best possible error message depending on
3433 how exactly the id-expression looks like. */
3435 static bool
3437 {
3438 tree id;
3441 /* Avoid duplicate error about ambiguous lookup. */
3443 {
3447 }
3456 /* If the next token is a (, this is a function with no explicit return
3457 type, i.e. constructor, destructor or conversion op. */
3460 {
3463 }
3467 /* Emit a diagnostic for the invalid type. */
3469 out:
3470 /* If we aren't in the middle of a declarator (i.e. in a
3471 parameter-declaration-clause), skip to the end of the declaration;
3472 there's no point in trying to process it. */
3476 }
3478 /* Consume tokens up to, and including, the next non-nested closing `)'.
3479 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3480 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3481 found an unnested token of that type. */
3483 static int
3486 cpp_ttype or_ttype,
3488 {
3498 {
3501 /* Have we found what we're looking for before the closing paren? */
3507 {
3510 /* If we've run out of tokens, then there is no closing `)'. */
3513 /* This is good for lambda expression capture-lists. */
3523 /* This matches the processing in skip_to_end_of_statement. */
3543 {
3547 }
3552 }
3554 /* Consume the token. */
3556 }
3557 }
3559 /* Consume tokens up to, and including, the next non-nested closing `)'.
3560 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3561 are doing error recovery. Returns -1 if OR_COMMA is true and we
3562 found an unnested token of that type. */
3564 static int
3569 {
3573 }
3575 /* Consume tokens until we reach the end of the current statement.
3576 Normally, that will be just before consuming a `;'. However, if a
3577 non-nested `}' comes first, then we stop before consuming that. */
3579 static void
3581 {
3584 /* Unwind generic function template scope if necessary. */
3589 {
3593 {
3596 /* If we've run out of tokens, stop. */
3600 /* If the next token is a `;', we have reached the end of the
3601 statement. */
3607 /* If this is a non-nested '}', stop before consuming it.
3608 That way, when confronted with something like:
3610 { 3 + }
3612 we stop before consuming the closing '}', even though we
3613 have not yet reached a `;'. */
3617 /* If it is the closing '}' for a block that we have
3618 scanned, stop -- but only after consuming the token.
3619 That way given:
3621 void f g () { ... }
3622 typedef int I;
3624 we will stop after the body of the erroneously declared
3625 function, but before consuming the following `typedef'
3626 declaration. */
3628 {
3631 }
3640 }
3642 /* Consume the token. */
3644 }
3645 }
3647 /* This function is called at the end of a statement or declaration.
3648 If the next token is a semicolon, it is consumed; otherwise, error
3649 recovery is attempted. */
3651 static void
3653 {
3654 /* Look for the trailing `;'. */
3656 {
3657 /* If there is additional (erroneous) input, skip to the end of
3658 the statement. */
3660 /* If the next token is now a `;', consume it. */
3663 }
3664 }
3666 /* Skip tokens until we have consumed an entire block, or until we
3667 have consumed a non-nested `;'. */
3669 static void
3671 {
3674 /* Unwind generic function template scope if necessary. */
3679 {
3683 {
3686 /* If we've run out of tokens, stop. */
3690 /* Stop if this is an unnested ';'. */
3696 /* Stop if this is an unnested '}', or closes the outermost
3697 nesting level. */
3698 nesting_depth--;
3706 /* Nest. */
3707 nesting_depth++;
3712 }
3714 /* Consume the token. */
3716 }
3717 }
3719 /* Skip tokens until a non-nested closing curly brace is the next
3720 token, or there are no more tokens. Return true in the first case,
3721 false otherwise. */
3723 static bool
3725 {
3729 {
3733 {
3736 /* If we've run out of tokens, stop. */
3740 /* If the next token is a non-nested `}', then we have reached
3741 the end of the current block. */
3747 /* If it the next token is a `{', then we are entering a new
3748 block. Consume the entire block. */
3754 }
3756 /* Consume the token. */
3758 }
3759 }
3761 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3762 parameter is the PRAGMA token, allowing us to purge the entire pragma
3763 sequence. */
3765 static void
3767 {
3772 do
3776 /* Ensure that the pragma is not parsed again. */
3778 }
3780 /* Require pragma end of line, resyncing with it as necessary. The
3781 arguments are as for cp_parser_skip_to_pragma_eol. */
3783 static void
3785 {
3789 }
3791 /* This is a simple wrapper around make_typename_type. When the id is
3792 an unresolved identifier node, we can provide a superior diagnostic
3793 using cp_parser_diagnose_invalid_type_name. */
3795 static tree
3797 location_t id_location)
3798 {
3799 tree result;
3801 {
3807 }
3809 }
3811 /* This is a wrapper around the
3812 make_{pointer,ptrmem,reference}_declarator functions that decides
3813 which one to call based on the CODE and CLASS_TYPE arguments. The
3814 CODE argument should be one of the values returned by
3815 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3816 appertain to the pointer or reference. */
3820 cp_cv_quals cv_qualifiers,
3822 tree attributes)
3823 {
3830 else
3840 }
3842 /* Create a new C++ parser. */
3846 {
3851 /* cp_lexer_new_main is called before doing GC allocation because
3852 cp_lexer_new_main might load a PCH file. */
3855 /* Initialize the binops_by_token so that we can get the tree
3856 directly from the token. */
3864 /* For now, we always accept GNU extensions. */
3867 /* The `>' token is a greater-than operator, not the end of a
3868 template-id. */
3873 /* We are not parsing a constant-expression. */
3878 /* Local variable names are not forbidden. */
3881 /* We are not processing an `extern "C"' declaration. */
3884 /* We are not processing a declarator. */
3887 /* We are not processing a template-argument-list. */
3890 /* We are not in an iteration statement. */
3893 /* We are not in a switch statement. */
3896 /* We are not parsing a type-id inside an expression. */
3899 /* Declarations aren't implicitly extern "C". */
3902 /* String literals should be translated to the execution character set. */
3905 /* We are not parsing a function body. */
3908 /* We can correct until told otherwise. */
3911 /* The unparsed function queue is empty. */
3914 /* There are no classes being defined. */
3917 /* No template parameters apply. */
3920 /* Special parsing data structures. */
3924 /* Not declaring an implicit function template. */
3930 /* Allow constrained-type-specifiers. */
3933 /* We haven't yet seen an 'extern "C"'. */
3937 }
3939 /* Create a cp_lexer structure which will emit the tokens in CACHE
3940 and push it onto the parser's lexer stack. This is used for delayed
3941 parsing of in-class method bodies and default arguments, and should
3942 not be confused with tentative parsing. */
3943 static void
3945 {
3950 /* Move the current source position to that of the first token in the
3951 new lexer. */
3953 }
3955 /* Pop the top lexer off the parser stack. This is never used for the
3956 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3957 static void
3959 {
3964 /* Put the current source position back where it was before this
3965 lexer was pushed. */
3967 }
3969 /* Lexical conventions [gram.lex] */
3971 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3972 identifier. */
3974 static cp_expr
3976 {
3979 /* Look for the identifier. */
3981 /* Return the value. */
3984 else
3986 }
3988 /* Parse a sequence of adjacent string constants. Returns a
3989 TREE_STRING representing the combined, nul-terminated string
3990 constant. If TRANSLATE is true, translate the string to the
3991 execution character set. If WIDE_OK is true, a wide string is
3992 invalid here.
3994 C++98 [lex.string] says that if a narrow string literal token is
3995 adjacent to a wide string literal token, the behavior is undefined.
3996 However, C99 6.4.5p4 says that this results in a wide string literal.
3997 We follow C99 here, for consistency with the C front end.
3999 This code is largely lifted from lex_string() in c-lex.c.
4001 FUTURE: ObjC++ will need to handle @-strings here. */
4002 static cp_expr
4005 {
4006 tree value;
4013 tree string_tree;
4019 {
4022 }
4027 {
4031 }
4032 else
4033 {
4036 }
4039 /* Try to avoid the overhead of creating and destroying an obstack
4040 for the common case of just one string. */
4043 {
4051 {
4055 }
4056 else
4060 }
4061 else
4062 {
4067 do
4068 {
4070 count++;
4075 {
4078 {
4081 }
4084 {
4089 }
4091 }
4092 else
4096 {
4100 {
4104 "unsupported non-standard concatenation "
4106 }
4107 }
4115 {
4119 }
4120 else
4121 {
4125 }
4126 }
4129 /* A string literal built by concatenation has its caret=start at
4130 the start of the initial string, and its finish at the finish of
4131 the final string literal. */
4135 }
4138 {
4141 }
4145 {
4150 {
4165 }
4170 {
4175 else
4177 }
4178 }
4179 else
4180 /* cpp_interpret_string has issued an error. */
4187 }
4189 /* Look up a literal operator with the name and the exact arguments. */
4191 static tree
4193 {
4194 tree decl;
4200 {
4206 {
4209 {
4219 }
4222 /* May be this should be sufficient_parms_p instead,
4223 depending on how exactly should user-defined literals
4224 work in presence of default arguments on the literal
4225 operator parameters. */
4228 }
4229 }
4232 }
4234 /* Parse a user-defined char constant. Returns a call to a user-defined
4235 literal operator taking the character as an argument. */
4237 static cp_expr
4239 {
4247 /* Build up a call to the user-defined operator */
4248 /* Lookup the name we got back from the id-expression. */
4253 {
4258 }
4262 }
4264 /* A subroutine of cp_parser_userdef_numeric_literal to
4265 create a char... template parameter pack from a string node. */
4267 static tree
4269 {
4270 tree charvec;
4276 /* Fill in CHARVEC with all of the parameters. */
4281 /* Build the argument packs. */
4287 }
4289 /* A subroutine of cp_parser_userdef_numeric_literal to
4290 create a char... template parameter pack from a string node. */
4292 static tree
4294 {
4295 tree charvec;
4306 /* First template parm is character type. */
4309 /* Fill in CHARVEC with all of the parameters. */
4316 /* Build the argument packs. */
4322 }
4324 /* Parse a user-defined numeric constant. returns a call to a user-defined
4325 literal operator. */
4327 static cp_expr
4329 {
4340 /* Look for a literal operator taking the exact type of numeric argument
4341 as the literal value. */
4346 {
4348 tf_warning_or_error);
4351 {
4354 long_long_unsigned_type_node);
4355 }
4356 else
4357 {
4361 long_double_type_node);
4365 }
4369 }
4372 /* If the numeric argument didn't work, look for a raw literal
4373 operator taking a const char* argument consisting of the number
4374 in string format. */
4379 {
4381 tf_warning_or_error);
4384 }
4387 /* If the raw literal didn't work, look for a non-type template
4388 function with parameter pack char.... Call the function with
4389 template parameter characters representing the number. */
4393 {
4397 tf_warning_or_error);
4400 }
4404 /* In C++14 the standard library defines complex number suffixes that
4405 conflict with GNU extensions. Prefer them if <complex> is #included. */
4415 {
4420 {
4421 /* No <complex>, so pedwarn and use GNU semantics. */
4424 }
4425 }
4427 bool complained
4434 {
4436 "(from <complex>) to enable the C++14 user-defined literal "
4441 }
4448 else
4449 {
4450 /* Use the built-in semantics. */
4451 tree type;
4453 {
4456 else
4458 }
4467 }
4470 /* Avoid repeated diagnostics. */
4473 }
4475 /* Parse a user-defined string constant. Returns a call to a user-defined
4476 literal operator taking a character pointer and the length of the string
4477 as arguments. */
4479 static tree
4481 {
4490 /* Build up a call to the user-defined operator. */
4491 /* Lookup the name we got back from the id-expression. */
4498 {
4500 tf_warning_or_error);
4503 }
4506 /* Look for a template function with typename parameter CharT
4507 and parameter pack CharT... Call the function with
4508 template parameter characters representing the string. */
4512 {
4516 tf_warning_or_error);
4519 }
4525 }
4528 /* Basic concepts [gram.basic] */
4530 /* Parse a translation-unit.
4532 translation-unit:
4533 declaration-seq [opt]
4535 Returns TRUE if all went well. */
4537 static bool
4539 {
4540 /* The address of the first non-permanent object on the declarator
4541 obstack. */
4546 /* Create the declarator obstack, if necessary. */
4548 {
4550 /* Create the error declarator. */
4552 /* Create the empty parameter list. */
4554 UNKNOWN_LOCATION);
4555 /* Remember where the base of the declarator obstack lies. */
4557 }
4561 /* If there are no tokens left then all went well. */
4563 {
4564 /* Get rid of the token array; we don't need it any more. */
4568 /* This file might have been a context that's implicitly extern
4569 "C". If so, pop the lang context. (Only relevant for PCH.) */
4571 {
4574 }
4576 /* Finish up. */
4580 }
4581 else
4582 {
4585 }
4587 /* Make sure the declarator obstack was fully cleaned up. */
4591 /* All went well. */
4593 }
4595 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4596 decltype context. */
4600 {
4605 }
4607 /* We're about to parse a collection of statements. If we're currently
4608 parsing tentatively, set up a firewall so that any nested
4609 cp_parser_commit_to_tentative_parse won't affect the current context. */
4611 static cp_token_position
4613 {
4620 }
4622 /* We've finished parsing the collection of statements. Wrap up the
4623 firewall and replace the relevant tokens with the parsed form. */
4625 static void
4627 tree expr)
4628 {
4632 /* Finish the firewall level. */
4634 /* And remember the result of the parse for when we try again. */
4640 }
4642 /* Like the above functions, but let the user modify the tokens. Used by
4643 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4644 later parses, so it makes sense to localize the effects of
4645 cp_parser_commit_to_tentative_parse. */
4647 struct tentative_firewall
4648 {
4653 {
4654 /* If we're currently parsing tentatively, start a committed level as a
4655 firewall and then an inner tentative parse. */
4657 {
4661 }
4662 }
4665 {
4667 {
4668 /* Finish the inner tentative parse and the firewall, propagating any
4669 uncommitted error state to the outer tentative parse. */
4675 }
4676 }
4677 };
4679 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4680 This class is for tracking such a matching pair of symbols.
4681 In particular, it tracks the location of the first token,
4682 so that if the second token is missing, we can highlight the
4683 location of the first token when notifying the user about the
4684 problem. */
4687 class token_pair
4688 {
4690 /* token_pair's ctor. */
4693 /* If the next token is the opening symbol for this pair, consume it and
4694 return true.
4695 Otherwise, issue an error and return false.
4696 In either case, record the location of the opening token. */
4699 {
4703 }
4705 /* Consume the next token from PARSER, recording its location as
4706 that of the opening token within the pair. */
4709 {
4714 }
4716 /* If the next token is the closing symbol for this pair, consume it
4717 and return it.
4718 Otherwise, issue an error, highlighting the location of the
4719 corresponding opening token, and return NULL. */
4722 {
4725 m_open_loc);
4726 }
4729 location_t m_open_loc;
4730 };
4732 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4734 struct matching_paren_traits
4735 {
4740 };
4742 /* "matching_parens" is a token_pair<T> class for tracking matching
4743 pairs of parentheses. */
4747 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4749 struct matching_brace_traits
4750 {
4755 };
4757 /* "matching_braces" is a token_pair<T> class for tracking matching
4758 pairs of braces. */
4763 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4764 enclosing parentheses. */
4766 static cp_expr
4768 {
4771 /* Consume the '('. */
4773 matching_parens parens;
4775 /* Start the statement-expression. */
4777 /* Parse the compound-statement. */
4779 /* Finish up. */
4781 /* Consume the ')'. */
4789 }
4791 /* Expressions [gram.expr] */
4793 /* Parse a fold-operator.
4795 fold-operator:
4796 - * / % ^ & | = < > << >>
4797 = -= *= /= %= ^= &= |= <<= >>=
4798 == != <= >= && || , .* ->*
4800 This returns the tree code corresponding to the matched operator
4801 as an int. When the current token matches a compound assignment
4802 opertor, the resulting tree code is the negative value of the
4803 non-assignment operator. */
4805 static int
4807 {
4809 {
4849 }
4850 }
4852 /* Returns true if CODE indicates a binary expression, which is not allowed in
4853 the LHS of a fold-expression. More codes will need to be added to use this
4854 function in other contexts. */
4856 static bool
4858 {
4860 {
4893 }
4894 }
4896 /* If the next token is a suitable fold operator, consume it and return as
4897 the function above. */
4899 static int
4901 {
4907 }
4909 /* Parse a fold-expression.
4911 fold-expression:
4912 ( ... folding-operator cast-expression)
4913 ( cast-expression folding-operator ... )
4914 ( cast-expression folding operator ... folding-operator cast-expression)
4916 Note that the '(' and ')' are matched in primary expression. */
4918 static cp_expr
4920 {
4921 cp_id_kind pidk;
4923 // Left fold.
4925 {
4929 {
4932 }
4939 }
4944 {
4947 }
4950 {
4953 }
4956 /* The operands of a fold-expression are cast-expressions, so binary or
4957 conditional expressions are not allowed. We check this here to avoid
4958 tentative parsing. */
4968 // Right fold.
4973 {
4976 }
4979 // Binary left or right fold.
4984 }
4986 /* Parse a primary-expression.
4988 primary-expression:
4989 literal
4990 this
4991 ( expression )
4992 id-expression
4993 lambda-expression (C++11)
4995 GNU Extensions:
4997 primary-expression:
4998 ( compound-statement )
4999 __builtin_va_arg ( assignment-expression , type-id )
5000 __builtin_offsetof ( type-id , offsetof-expression )
5002 C++ Extensions:
5003 __has_nothrow_assign ( type-id )
5004 __has_nothrow_constructor ( type-id )
5005 __has_nothrow_copy ( type-id )
5006 __has_trivial_assign ( type-id )
5007 __has_trivial_constructor ( type-id )
5008 __has_trivial_copy ( type-id )
5009 __has_trivial_destructor ( type-id )
5010 __has_virtual_destructor ( type-id )
5011 __is_abstract ( type-id )
5012 __is_base_of ( type-id , type-id )
5013 __is_class ( type-id )
5014 __is_empty ( type-id )
5015 __is_enum ( type-id )
5016 __is_final ( type-id )
5017 __is_literal_type ( type-id )
5018 __is_pod ( type-id )
5019 __is_polymorphic ( type-id )
5020 __is_std_layout ( type-id )
5021 __is_trivial ( type-id )
5022 __is_union ( type-id )
5024 Objective-C++ Extension:
5026 primary-expression:
5027 objc-expression
5029 literal:
5030 __null
5032 ADDRESS_P is true iff this expression was immediately preceded by
5033 "&" and therefore might denote a pointer-to-member. CAST_P is true
5034 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5035 true iff this expression is a template argument.
5037 Returns a representation of the expression. Upon return, *IDK
5038 indicates what kind of id-expression (if any) was present. */
5040 static cp_expr
5047 {
5050 /* Assume the primary expression is not an id-expression. */
5053 /* Peek at the next token. */
5056 {
5057 /* literal:
5058 integer-literal
5059 character-literal
5060 floating-literal
5061 string-literal
5062 boolean-literal
5063 pointer-literal
5064 user-defined-literal */
5076 {
5080 }
5081 /* Floating-point literals are only allowed in an integral
5082 constant expression if they are cast to an integral or
5083 enumeration type. */
5087 {
5088 /* CAST_P will be set even in invalid code like "int(2.7 +
5089 ...)". Therefore, we have to check that the next token
5090 is sure to end the cast. */
5092 {
5097 enumerator-definition. */
5099 /* The curly brace at the end of an enum-specifier. */
5101 /* The end of a statement. */
5103 /* The end of the cast-expression. */
5105 /* The end of an array bound. */
5107 /* The closing ">" in a template-argument-list. */
5110 /* C++0x only: A ">>" treated like two ">" tokens,
5111 in a template-argument-list. */
5116 }
5118 /* If we are within a cast, then the constraint that the
5119 cast is to an integral or enumeration type will be
5120 checked at that point. If we are not within a cast, then
5121 this code is invalid. */
5124 }
5144 /* ??? Should wide strings be allowed when parser->translate_strings_p
5145 is false (i.e. in attributes)? If not, we can kill the third
5146 argument to cp_parser_string_literal. */
5152 /* If we see `( { ' then we are looking at the beginning of
5153 a GNU statement-expression. */
5156 {
5157 /* Statement-expressions are not allowed by the standard. */
5161 /* And they're not allowed outside of a function-body; you
5162 cannot, for example, write:
5164 int i = ({ int j = 3; j + 1; });
5166 at class or namespace scope. */
5169 {
5171 "statement-expressions are not allowed outside "
5177 }
5178 else
5180 }
5181 /* Otherwise it's a normal parenthesized expression. */
5182 {
5183 cp_expr expr;
5188 /* Consume the `('. */
5189 matching_parens parens;
5191 /* Within a parenthesized expression, a `>' token is always
5192 the greater-than operator. */
5193 saved_greater_than_is_operator_p
5198 /* Left fold expression. */
5200 else
5201 /* Parse the parenthesized expression. */
5206 {
5213 }
5214 else
5215 /* Let the front end know that this expression was
5216 enclosed in parentheses. This matters in case, for
5217 example, the expression is of the form `A::B', since
5218 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5219 not. */
5222 /* DR 705: Wrapping an unqualified name in parentheses
5223 suppresses arg-dependent lookup. We want to pass back
5224 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5225 (c++/37862), but none of the others. */
5229 /* The `>' token might be the end of a template-id or
5230 template-parameter-list now. */
5231 parser->greater_than_is_operator_p
5234 /* Consume the `)'. */
5243 }
5246 {
5248 {
5249 /* We might have an Objective-C++ message. */
5252 /* If that works out, we're done ... */
5255 /* ... else, fall though to see if it's a lambda. */
5256 }
5258 /* Don't warn about a failed tentative parse. */
5263 }
5267 /* We have an Objective-C++ string literal. */
5274 {
5275 /* These two are the boolean literals. */
5283 /* The `__null' literal. */
5288 /* The `nullptr' literal. */
5293 /* Recognize the `this' keyword. */
5297 {
5301 }
5302 /* Pointers cannot appear in constant-expressions. */
5307 /* The `operator' keyword can be the beginning of an
5308 id-expression. */
5315 {
5316 non_integral_constant name;
5318 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5319 __func__ are the names of variables -- but they are
5320 treated specially. Therefore, they are handled here,
5321 rather than relying on the generic id-expression logic
5322 below. Grammatically, these names are id-expressions.
5324 Consume the token. */
5328 {
5340 }
5345 /* Look up the name. */
5347 }
5350 {
5351 tree expression;
5352 tree type;
5353 source_location type_location;
5354 location_t start_loc
5356 /* The `__builtin_va_arg' construct is used to handle
5357 `va_arg'. Consume the `__builtin_va_arg' token. */
5359 /* Look for the opening `('. */
5360 matching_parens parens;
5362 /* Now, parse the assignment-expression. */
5364 /* Look for the `,'. */
5367 /* Parse the type-id. */
5368 {
5371 }
5372 /* Look for the closing `)'. */
5373 location_t finish_loc
5376 /* Using `va_arg' in a constant-expression is not
5377 allowed. */
5379 NIC_VA_ARG))
5381 /* Construct a location of the form:
5382 __builtin_va_arg (v, int)
5383 ~~~~~~~~~~~~~~~~~~~~~^~~~
5384 with the caret at the type, ranging from the start of the
5385 "__builtin_va_arg" token to the close paren. */
5386 location_t combined_loc
5389 }
5424 // C++ concepts
5428 /* Objective-C++ expressions. */
5438 {
5443 }
5444 /* FALLTHRU */
5448 }
5450 /* An id-expression can start with either an identifier, a
5451 `::' as the beginning of a qualified-id, or the "operator"
5452 keyword. */
5457 {
5458 id_expression:
5459 cp_expr id_expression;
5460 cp_expr decl;
5466 /* Parse the id-expression. */
5467 id_expression
5484 /* If we have a template-id, then no further lookup is
5485 required. If the template-id was for a template-class, we
5486 will sometimes have a TYPE_DECL at this point. */
5490 /* Look up the name. */
5491 else
5492 {
5493 tree ambiguous_decls;
5495 /* If we already know that this lookup is ambiguous, then
5496 we've already issued an error message; there's no reason
5497 to check again. */
5500 {
5503 }
5506 none_type,
5507 template_p,
5512 /* If the lookup was ambiguous, an error will already have
5513 been issued. */
5517 /* In Objective-C++, we may have an Objective-C 2.0
5518 dot-syntax for classes here. */
5523 {
5524 tree component;
5531 component);
5532 /* Build a location of the form:
5533 expr.component
5534 ~~~~~^~~~~~~~~
5535 with caret at the start of the component name (at
5536 input_location), ranging from the start of the id_expression
5537 to the end of the component name. */
5538 location_t combined_loc
5543 }
5545 /* In Objective-C++, an instance variable (ivar) may be preferred
5546 to whatever cp_parser_lookup_name() found.
5547 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5548 rest of c-family, we have to do a little extra work to preserve
5549 any location information in cp_expr "decl". Given that
5550 objc_lookup_ivar is implemented in "c-family" and "objc", we
5551 have a trip through the pure "tree" type, rather than cp_expr.
5552 Naively copying it back to "decl" would implicitly give the
5553 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5554 store an EXPR_LOCATION. Hence we only update "decl" (and
5555 hence its location_t) if we get back a different tree node. */
5557 id_expression);
5561 /* If name lookup gives us a SCOPE_REF, then the
5562 qualifying scope was dependent. */
5564 {
5565 /* At this point, we do not know if DECL is a valid
5566 integral constant expression. We assume that it is
5567 in fact such an expression, so that code like:
5569 template <int N> struct A {
5570 int a[B<N>::i];
5571 };
5573 is accepted. At template-instantiation time, we
5574 will check that B<N>::i is actually a constant. */
5576 }
5577 /* Check to see if DECL is a local variable in a context
5578 where that is forbidden. */
5581 {
5582 /* It might be that we only found DECL because we are
5583 trying to be generous with pre-ISO scoping rules.
5584 For example, consider:
5586 int i;
5587 void g() {
5588 for (int i = 0; i < 10; ++i) {}
5589 extern void f(int j = i);
5590 }
5592 Here, name look up will originally find the out
5593 of scope `i'. We need to issue a warning message,
5594 but then use the global `i'. */
5597 {
5602 }
5603 }
5604 }
5606 decl = (finish_id_expression
5608 idk,
5613 template_arg_p,
5620 }
5622 /* Anything else is an error. */
5626 }
5627 }
5635 {
5638 }
5640 /* Parse an id-expression.
5642 id-expression:
5643 unqualified-id
5644 qualified-id
5646 qualified-id:
5647 :: [opt] nested-name-specifier template [opt] unqualified-id
5648 :: identifier
5649 :: operator-function-id
5650 :: template-id
5652 Return a representation of the unqualified portion of the
5653 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5654 a `::' or nested-name-specifier.
5656 Often, if the id-expression was a qualified-id, the caller will
5657 want to make a SCOPE_REF to represent the qualified-id. This
5658 function does not do this in order to avoid wastefully creating
5659 SCOPE_REFs when they are not required.
5661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5662 `template' keyword.
5664 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5665 uninstantiated templates.
5667 If *TEMPLATE_P is non-NULL, it is set to true iff the
5668 `template' keyword is used to explicitly indicate that the entity
5669 named is a template.
5671 If DECLARATOR_P is true, the id-expression is appearing as part of
5672 a declarator, rather than as part of an expression. */
5674 static cp_expr
5681 {
5685 /* Assume the `template' keyword was not used. */
5689 /* Look for the optional `::' operator. */
5690 global_scope_p
5691 = (!template_keyword_p
5696 /* Look for the optional nested-name-specifier. */
5697 nested_name_specifier_p
5700 check_dependency_p,
5702 declarator_p,
5703 template_keyword_p)
5706 /* If there is a nested-name-specifier, then we are looking at
5707 the first qualified-id production. */
5709 {
5710 tree saved_scope;
5711 tree saved_object_scope;
5712 tree saved_qualifying_scope;
5713 cp_expr unqualified_id;
5716 /* See if the next token is the `template' keyword. */
5720 /* Name lookup we do during the processing of the
5721 unqualified-id might obliterate SCOPE. */
5725 /* Process the final unqualified-id. */
5727 check_dependency_p,
5728 declarator_p,
5730 /* Restore the SAVED_SCOPE for our caller. */
5736 }
5737 /* Otherwise, if we are in global scope, then we are looking at one
5738 of the other qualified-id productions. */
5740 {
5742 tree id;
5744 /* Peek at the next token. */
5747 /* If it's an identifier, and the next token is not a "<", then
5748 we can avoid the template-id case. This is an optimization
5749 for this common case. */
5751 && !cp_parser_nth_token_starts_template_argument_list_p
5756 /* Try a template-id. */
5760 none_type,
5761 declarator_p);
5762 /* If that worked, we're done. */
5766 /* Peek at the next token. (Changes in the token buffer may
5767 have invalidated the pointer obtained above.) */
5771 {
5778 /* Fall through. */
5783 }
5784 }
5785 else
5788 declarator_p,
5789 optional_p);
5790 }
5792 /* Parse an unqualified-id.
5794 unqualified-id:
5795 identifier
5796 operator-function-id
5797 conversion-function-id
5798 ~ class-name
5799 template-id
5801 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5802 keyword, in a construct like `A::template ...'.
5804 Returns a representation of unqualified-id. For the `identifier'
5805 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5806 production a BIT_NOT_EXPR is returned; the operand of the
5807 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5808 other productions, see the documentation accompanying the
5809 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5810 names are looked up in uninstantiated templates. If DECLARATOR_P
5811 is true, the unqualified-id is appearing as part of a declarator,
5812 rather than as part of an expression. */
5814 static cp_expr
5820 {
5823 /* Peek at the next token. */
5827 {
5829 {
5830 tree id;
5832 /* We don't know yet whether or not this will be a
5833 template-id. */
5835 /* Try a template-id. */
5837 check_dependency_p,
5838 none_type,
5839 declarator_p);
5840 /* If it worked, we're done. */
5843 /* Otherwise, it's an ordinary identifier. */
5845 }
5849 check_dependency_p,
5850 none_type,
5851 declarator_p);
5854 {
5855 tree type_decl;
5856 tree qualifying_scope;
5857 tree object_scope;
5858 tree scope;
5861 /* Consume the `~' token. */
5863 /* Parse the class-name. The standard, as written, seems to
5864 say that:
5866 template <typename T> struct S { ~S (); };
5867 template <typename T> S<T>::~S() {}
5869 is invalid, since `~' must be followed by a class-name, but
5870 `S<T>' is dependent, and so not known to be a class.
5871 That's not right; we need to look in uninstantiated
5872 templates. A further complication arises from:
5874 template <typename T> void f(T t) {
5875 t.T::~T();
5876 }
5878 Here, it is not possible to look up `T' in the scope of `T'
5879 itself. We must look in both the current scope, and the
5880 scope of the containing complete expression.
5882 Yet another issue is:
5884 struct S {
5885 int S;
5886 ~S();
5887 };
5889 S::~S() {}
5891 The standard does not seem to say that the `S' in `~S'
5892 should refer to the type `S' and not the data member
5893 `S::S'. */
5895 /* DR 244 says that we look up the name after the "~" in the
5896 same scope as we looked up the qualifying name. That idea
5897 isn't fully worked out; it's more complicated than that. */
5902 /* Check for invalid scopes. */
5904 {
5908 }
5910 {
5914 scope);
5919 }
5922 /* If the name is of the form "X::~X" it's OK even if X is a
5923 typedef. */
5932 {
5935 }
5937 /* ~auto means the destructor of whatever the object is. */
5939 {
5942 "%<~auto%> only available with "
5946 }
5948 /* If there was an explicit qualification (S::~T), first look
5949 in the scope given by the qualification (i.e., S).
5951 Note: in the calls to cp_parser_class_name below we pass
5952 typename_type so that lookup finds the injected-class-name
5953 rather than the constructor. */
5957 {
5962 typename_type,
5965 declarator_p);
5968 }
5969 /* In "N::S::~S", look in "N" as well. */
5971 {
5976 type_decl
5980 typename_type,
5983 declarator_p);
5986 }
5987 /* In "p->S::~T", look in the scope given by "*p" as well. */
5989 {
5994 type_decl
5998 typename_type,
6001 declarator_p);
6004 }
6005 /* Look in the surrounding context. */
6007 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 {
6024 /* We couldn't find a type with this name. If we're parsing
6025 tentatively, fail and try something else. */
6027 {
6030 }
6031 /* Otherwise, accept it and check for a match at instantiation
6032 time. */
6037 }
6038 }
6039 /* If an error occurred, assume that the name of the
6040 destructor is the same as the name of the qualifying
6041 class. That allows us to keep parsing after running
6042 into ill-formed destructor names. */
6048 /* Check that destructor name and scope match. */
6050 {
6057 }
6059 /* [class.dtor]
6061 A typedef-name that names a class shall not be used as the
6062 identifier in the declarator for a destructor declaration. */
6069 type_decl);
6072 }
6076 {
6077 cp_expr id;
6079 /* This could be a template-id, so we try that first. */
6081 /* Try a template-id. */
6084 none_type,
6085 declarator_p);
6086 /* If that worked, we're done. */
6089 /* We still don't know whether we're looking at an
6090 operator-function-id or a conversion-function-id. */
6092 /* Try an operator-function-id. */
6094 /* If that didn't work, try a conversion-function-id. */
6098 {
6099 /* 17.6.3.3.5 */
6104 "literal operator suffixes not preceded by %<_%>"
6106 }
6109 }
6110 /* Fall through. */
6117 }
6118 }
6120 /* Parse an (optional) nested-name-specifier.
6122 nested-name-specifier: [C++98]
6123 class-or-namespace-name :: nested-name-specifier [opt]
6124 class-or-namespace-name :: template nested-name-specifier [opt]
6126 nested-name-specifier: [C++0x]
6127 type-name ::
6128 namespace-name ::
6129 nested-name-specifier identifier ::
6130 nested-name-specifier template [opt] simple-template-id ::
6132 PARSER->SCOPE should be set appropriately before this function is
6133 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6134 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6135 in name lookups.
6137 Sets PARSER->SCOPE to the class (TYPE) or namespace
6138 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6139 it unchanged if there is no nested-name-specifier. Returns the new
6140 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6142 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6143 part of a declaration and/or decl-specifier. */
6145 static tree
6152 {
6157 /* Remember where the nested-name-specifier starts. */
6159 {
6162 }
6165 {
6166 tree new_scope;
6167 tree old_scope;
6168 tree saved_qualifying_scope;
6170 /* Spot cases that cannot be the beginning of a
6171 nested-name-specifier. */
6174 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6175 the already parsed nested-name-specifier. */
6177 {
6178 /* Grab the nested-name-specifier and continue the loop. */
6180 /* If we originally encountered this nested-name-specifier
6181 with IS_DECLARATION set to false, we will not have
6182 resolved TYPENAME_TYPEs, so we must do so here. */
6185 {
6190 }
6193 }
6195 /* Spot cases that cannot be the beginning of a
6196 nested-name-specifier. On the second and subsequent times
6197 through the loop, we look for the `template' keyword. */
6199 ;
6200 /* A template-id can start a nested-name-specifier. */
6202 ;
6203 /* DR 743: decltype can be used in a nested-name-specifier. */
6205 ;
6206 else
6207 {
6208 /* If the next token is not an identifier, then it is
6209 definitely not a type-name or namespace-name. */
6212 /* If the following token is neither a `<' (to begin a
6213 template-id), nor a `::', then we are not looking at a
6214 nested-name-specifier. */
6220 {
6224 "found %<:%> in nested-name-specifier, "
6227 }
6230 && !cp_parser_nth_token_starts_template_argument_list_p
6233 }
6235 /* The nested-name-specifier is optional, so we parse
6236 tentatively. */
6239 /* Look for the optional `template' keyword, if this isn't the
6240 first time through the loop. */
6244 /* Save the old scope since the name lookup we are about to do
6245 might destroy it. */
6248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6249 look up names in "X<T>::I" in order to determine that "Y" is
6250 a template. So, if we have a typename at this point, we make
6251 an effort to look through it. */
6253 && !typename_keyword_p
6258 /* Parse the qualifying entity. */
6259 new_scope
6261 typename_keyword_p,
6262 template_keyword_p,
6263 check_dependency_p,
6264 type_p,
6265 is_declaration);
6266 /* Look for the `::' token. */
6269 /* If we found what we wanted, we keep going; otherwise, we're
6270 done. */
6272 {
6275 /* Restore the OLD_SCOPE since it was valid before the
6276 failed attempt at finding the last
6277 class-or-namespace-name. */
6281 /* If the next token is a decltype, and the one after that is a
6282 `::', then the decltype has failed to resolve to a class or
6283 enumeration type. Give this error even when parsing
6284 tentatively since it can't possibly be valid--and we're going
6285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6286 won't get another chance.*/
6290 {
6297 /* As below. */
6300 }
6304 {
6305 /* If we have a non-type template-id followed by ::, it can't
6306 possibly be valid. */
6311 {
6314 {
6320 }
6321 else
6322 {
6323 /* Variable template. */
6328 }
6335 /* As below. */
6339 }
6340 }
6344 /* If the next token is an identifier, and the one after
6345 that is a `::', then any valid interpretation would have
6346 found a class-or-namespace-name. */
6352 {
6355 {
6357 {
6358 tree decl;
6359 tree ambiguous_decls;
6362 none_type,
6371 decl);
6373 {
6374 // cp_parser_lookup_name has the same diagnostic,
6375 // thus make sure to emit it at most once.
6378 {
6383 }
6385 }
6386 else
6387 {
6389 cp_parser_name_lookup_error
6392 else
6393 cp_parser_name_lookup_error
6396 }
6397 }
6400 /* Treat this as a successful nested-name-specifier
6401 due to:
6403 [basic.lookup.qual]
6405 If the name found is not a class-name (clause
6406 _class_) or namespace-name (_namespace.def_), the
6407 program is ill-formed. */
6409 }
6411 }
6413 }
6414 /* We've found one valid nested-name-specifier. */
6416 /* Name lookup always gives us a DECL. */
6419 /* Uses of "template" must be followed by actual templates. */
6431 new_scope);
6432 /* If it is a class scope, try to complete it; we are about to
6433 be looking up names inside the class. */
6435 /* Since checking types for dependency can be expensive,
6436 avoid doing it if the type is already complete. */
6438 /* Do not try to complete dependent types. */
6440 {
6442 /* If it is a typedef to current class, use the current
6443 class instead, as the typedef won't have any names inside
6444 it yet. */
6448 }
6449 /* Make sure we look in the right scope the next time through
6450 the loop. */
6452 }
6454 /* If parsing tentatively, replace the sequence of tokens that makes
6455 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6456 token. That way, should we re-parse the token stream, we will
6457 not have to repeat the effort required to do the parse, nor will
6458 we issue duplicate error messages. */
6460 {
6464 /* Reset the contents of the START token. */
6466 /* Retrieve any deferred checks. Do not pop this access checks yet
6467 so the memory will not be reclaimed during token replacing below. */
6475 /* Purge all subsequent tokens. */
6477 }
6483 }
6485 /* Parse a nested-name-specifier. See
6486 cp_parser_nested_name_specifier_opt for details. This function
6487 behaves identically, except that it will an issue an error if no
6488 nested-name-specifier is present. */
6490 static tree
6496 {
6497 tree scope;
6499 /* Look for the nested-name-specifier. */
6501 typename_keyword_p,
6502 check_dependency_p,
6503 type_p,
6504 is_declaration);
6505 /* If it was not present, issue an error message. */
6507 {
6510 }
6513 }
6515 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6516 this is either a class-name or a namespace-name (which corresponds
6517 to the class-or-namespace-name production in the grammar). For
6518 C++0x, it can also be a type-name that refers to an enumeration
6519 type or a simple-template-id.
6521 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6522 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6523 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6524 TYPE_P is TRUE iff the next name should be taken as a class-name,
6525 even the same name is declared to be another entity in the same
6526 scope.
6528 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6529 specified by the class-or-namespace-name. If neither is found the
6530 ERROR_MARK_NODE is returned. */
6532 static tree
6539 {
6540 tree saved_scope;
6541 tree saved_qualifying_scope;
6542 tree saved_object_scope;
6543 tree scope;
6547 /* DR 743: decltype can appear in a nested-name-specifier. */
6549 {
6553 {
6556 }
6560 }
6562 /* Before we try to parse the class-name, we must save away the
6563 current PARSER->SCOPE since cp_parser_class_name will destroy
6564 it. */
6568 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6569 there is no need to look for a namespace-name. */
6570 only_class_p = template_keyword_p
6575 typename_keyword_p,
6576 template_keyword_p,
6578 check_dependency_p,
6580 is_declaration,
6583 /* If that didn't work, try for a namespace-name. */
6585 {
6586 /* Restore the saved scope. */
6590 /* If we are not looking at an identifier followed by the scope
6591 resolution operator, then this is not part of a
6592 nested-name-specifier. (Note that this function is only used
6593 to parse the components of a nested-name-specifier.) */
6598 }
6601 }
6603 /* Return true if we are looking at a compound-literal, false otherwise. */
6605 static bool
6607 {
6610 /* Skip tokens until the next token is a closing parenthesis.
6611 If we find the closing `)', and the next token is a `{', then
6612 we are looking at a compound-literal. */
6613 bool compound_literal_p
6618 /* Roll back the tokens we skipped. */
6622 }
6624 /* Return true if EXPR is the integer constant zero or a complex constant
6625 of zero, without any folding, but ignoring location wrappers. */
6627 static bool
6629 {
6632 }
6634 /* Parse a postfix-expression.
6636 postfix-expression:
6637 primary-expression
6638 postfix-expression [ expression ]
6639 postfix-expression ( expression-list [opt] )
6640 simple-type-specifier ( expression-list [opt] )
6641 typename :: [opt] nested-name-specifier identifier
6642 ( expression-list [opt] )
6643 typename :: [opt] nested-name-specifier template [opt] template-id
6644 ( expression-list [opt] )
6645 postfix-expression . template [opt] id-expression
6646 postfix-expression -> template [opt] id-expression
6647 postfix-expression . pseudo-destructor-name
6648 postfix-expression -> pseudo-destructor-name
6649 postfix-expression ++
6650 postfix-expression --
6651 dynamic_cast < type-id > ( expression )
6652 static_cast < type-id > ( expression )
6653 reinterpret_cast < type-id > ( expression )
6654 const_cast < type-id > ( expression )
6655 typeid ( expression )
6656 typeid ( type-id )
6658 GNU Extension:
6660 postfix-expression:
6661 ( type-id ) { initializer-list , [opt] }
6663 This extension is a GNU version of the C99 compound-literal
6664 construct. (The C99 grammar uses `type-name' instead of `type-id',
6665 but they are essentially the same concept.)
6667 If ADDRESS_P is true, the postfix expression is the operand of the
6668 `&' operator. CAST_P is true if this expression is the target of a
6669 cast.
6671 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6672 class member access expressions [expr.ref].
6674 Returns a representation of the expression. */
6676 static cp_expr
6680 {
6682 location_t loc;
6688 /* Peek at the next token. */
6693 /* Some of the productions are determined by keywords. */
6696 {
6701 {
6702 tree type;
6703 cp_expr expression;
6707 /* All of these can be handled in the same way from the point
6708 of view of parsing. Begin by consuming the token
6709 identifying the cast. */
6712 /* New types cannot be defined in the cast. */
6714 parser->type_definition_forbidden_message
6717 /* Look for the opening `<'. */
6719 /* Parse the type to which we are casting. */
6724 /* Look for the closing `>'. */
6726 /* Restore the old message. */
6729 bool saved_greater_than_is_operator_p
6733 /* And the expression which is being cast. */
6734 matching_parens parens;
6738 RT_CLOSE_PAREN);
6742 parser->greater_than_is_operator_p
6745 /* Only type conversions to integral or enumeration types
6746 can be used in constant-expressions. */
6749 {
6752 }
6755 {
6757 postfix_expression
6761 postfix_expression
6765 postfix_expression
6767 tf_warning_or_error);
6770 postfix_expression
6775 }
6777 /* Construct a location e.g. :
6778 reinterpret_cast <int *> (expr)
6779 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6780 ranging from the start of the "*_cast" token to the final closing
6781 paren, with the caret at the start. */
6784 }
6788 {
6789 tree type;
6793 /* Consume the `typeid' token. */
6795 /* Look for the `(' token. */
6796 matching_parens parens;
6798 /* Types cannot be defined in a `typeid' expression. */
6800 parser->type_definition_forbidden_message
6802 /* We can't be sure yet whether we're looking at a type-id or an
6803 expression. */
6805 /* Try a type-id first. */
6810 /* Look for the `)' token. Otherwise, we can't be sure that
6811 we're not looking at an expression: consider `typeid (int
6812 (3))', for example. */
6814 /* If all went well, simply lookup the type-id. */
6817 /* Otherwise, fall back to the expression variant. */
6818 else
6819 {
6820 tree expression;
6822 /* Look for an expression. */
6824 /* Compute its typeid. */
6826 /* Look for the `)' token. */
6828 }
6829 /* Restore the saved message. */
6831 /* `typeid' may not appear in an integral constant expression. */
6835 /* Construct a location e.g. :
6836 typeid (expr)
6837 ^~~~~~~~~~~~~
6838 ranging from the start of the "typeid" token to the final closing
6839 paren, with the caret at the start. */
6841 {
6842 location_t typeid_loc
6846 }
6847 }
6851 {
6852 tree type;
6853 /* The syntax permitted here is the same permitted for an
6854 elaborated-type-specifier. */
6861 }
6867 {
6870 tree p;
6877 {
6880 }
6886 {
6889 postfix_expression
6891 else
6892 {
6896 }
6902 tf_warning_or_error);
6903 else
6904 {
6908 }
6913 postfix_expression
6917 postfix_expression
6920 else
6921 {
6925 }
6930 }
6932 }
6935 {
6936 tree type;
6938 /* If the next thing is a simple-type-specifier, we may be
6939 looking at a functional cast. We could also be looking at
6940 an id-expression. So, we try the functional cast, and if
6941 that doesn't work we fall back to the primary-expression. */
6943 /* Look for the simple-type-specifier. */
6947 CP_PARSER_FLAGS_NONE);
6949 /* Parse the cast itself. */
6951 postfix_expression
6953 /* If that worked, we're done. */
6957 /* If the functional-cast didn't work out, try a
6958 compound-literal. */
6961 {
6966 matching_parens parens;
6969 /* Avoid calling cp_parser_type_id pointlessly, see comment
6970 in cp_parser_cast_expression about c++/29234. */
6973 else
6974 {
6975 /* Parse the type. */
6981 }
6983 /* If things aren't going well, there's no need to
6984 keep going. */
6986 {
6988 /* Parse the brace-enclosed initializer list. */
6991 }
6992 /* If that worked, we're definitely looking at a
6993 compound-literal expression. */
6995 {
6996 /* Warn the user that a compound literal is not
6997 allowed in standard C++. */
7000 /* For simplicity, we disallow compound literals in
7001 constant-expressions. We could
7002 allow compound literals of integer type, whose
7003 initializer was a constant, in constant
7004 expressions. Permitting that usage, as a further
7005 extension, would not change the meaning of any
7006 currently accepted programs. (Of course, as
7007 compound literals are not part of ISO C++, the
7008 standard has nothing to say.) */
7010 NIC_NCC))
7011 {
7014 }
7015 /* Form the representation of the compound-literal. */
7016 postfix_expression
7021 }
7022 }
7024 /* It must be a primary-expression. */
7025 postfix_expression
7028 decltype_p,
7030 }
7032 }
7034 /* Note that we don't need to worry about calling build_cplus_new on a
7035 class-valued CALL_EXPR in decltype when it isn't the end of the
7036 postfix-expression; unary_complex_lvalue will take care of that for
7037 all these cases. */
7039 /* Keep looping until the postfix-expression is complete. */
7041 {
7045 /* It is not a Koenig lookup function call. */
7046 postfix_expression
7049 /* Peek at the next token. */
7053 {
7056 {
7058 "two consecutive %<[%> shall "
7061 }
7062 postfix_expression
7064 postfix_expression,
7066 decltype_p);
7075 /* postfix-expression ( expression-list [opt] ) */
7076 {
7087 is_builtin_constant_p
7090 {
7091 /* The whole point of __builtin_constant_p is to allow
7092 non-constant expressions to appear as arguments. */
7093 saved_integral_constant_expression_p
7095 saved_non_integral_constant_expression_p
7098 }
7099 args = (cp_parser_parenthesized_expression_list
7106 {
7107 parser->integral_constant_expression_p
7109 parser->non_integral_constant_expression_p
7111 }
7114 {
7117 }
7119 /* Function calls are not permitted in
7120 constant-expressions. */
7123 NIC_FUNC_CALL))
7124 {
7128 }
7133 {
7135 {
7137 {
7140 postfix_expression
7142 complain);
7143 }
7144 else
7145 postfix_expression
7147 }
7148 /* We do not perform argument-dependent lookup if
7149 normal lookup finds a non-function, in accordance
7150 with the expected resolution of DR 218. */
7153 {
7157 /* Do not do argument dependent lookup if regular
7158 lookup finds a member function or a block-scope
7159 function declaration. [basic.lookup.argdep]/3 */
7162 {
7165 postfix_expression
7167 complain);
7168 }
7169 }
7170 }
7176 {
7183 }
7186 {
7196 {
7198 postfix_expression
7202 }
7205 {
7206 postfix_expression
7207 = (build_new_method_call
7213 complain));
7214 }
7215 else
7216 postfix_expression
7220 complain);
7221 }
7225 postfix_expression = (build_offset_ref_call_from_tree
7227 complain));
7229 /* A call to a static class member, or a namespace-scope
7230 function. */
7231 postfix_expression
7234 koenig_p,
7235 complain);
7236 else
7237 /* All other function calls. */
7238 postfix_expression
7241 koenig_p,
7242 complain);
7245 {
7247 start_loc,
7248 close_paren_loc);
7250 }
7252 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7256 }
7261 /* postfix-expression . template [opt] id-expression
7262 postfix-expression . pseudo-destructor-name
7263 postfix-expression -> template [opt] id-expression
7264 postfix-expression -> pseudo-destructor-name */
7266 /* Consume the `.' or `->' operator. */
7269 postfix_expression
7271 postfix_expression,
7278 /* postfix-expression ++ */
7279 /* Consume the `++' token. */
7281 /* Generate a representation for the complete expression. */
7282 postfix_expression
7284 POSTINCREMENT_EXPR);
7285 /* Increments may not appear in constant-expressions. */
7293 /* postfix-expression -- */
7294 /* Consume the `--' token. */
7296 /* Generate a representation for the complete expression. */
7297 postfix_expression
7299 POSTDECREMENT_EXPR);
7300 /* Decrements may not appear in constant-expressions. */
7311 return is_member_access
7312 ? postfix_expression
7314 else
7316 }
7317 }
7319 /* We should never get here. */
7322 }
7324 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7325 by cp_parser_builtin_offsetof. We're looking for
7327 postfix-expression [ expression ]
7328 postfix-expression [ braced-init-list ] (C++11)
7330 FOR_OFFSETOF is set if we're being called in that context, which
7331 changes how we deal with integer constant expressions. */
7333 static tree
7335 tree postfix_expression,
7338 {
7343 /* Consume the `[' token. */
7349 /* Parse the index expression. */
7350 /* ??? For offsetof, there is a question of what to allow here. If
7351 offsetof is not being used in an integral constant expression context,
7352 then we *could* get the right answer by computing the value at runtime.
7353 If we are in an integral constant expression context, then we might
7354 could accept any constant expression; hard to say without analysis.
7355 Rather than open the barn door too wide right away, allow only integer
7356 constant expressions here. */
7359 else
7360 {
7362 {
7367 }
7368 else
7370 }
7374 /* Look for the closing `]'. */
7377 /* Build the ARRAY_REF. */
7381 /* When not doing offsetof, array references are not permitted in
7382 constant-expressions. */
7388 }
7390 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7391 dereference of incomplete type, returns true if error_mark_node should
7392 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7393 and *DEPENDENT_P. */
7395 bool
7398 {
7399 /* In a template, be permissive by treating an object expression
7400 of incomplete type as dependent (after a pedwarn). */
7401 diagnostic_t kind = (processing_template_decl
7405 {
7417 /* Don't emit any diagnostic for OVERLOADs. */
7421 /* Avoid clobbering e.g. DECLs. */
7425 }
7437 {
7440 }
7442 }
7444 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7445 by cp_parser_builtin_offsetof. We're looking for
7447 postfix-expression . template [opt] id-expression
7448 postfix-expression . pseudo-destructor-name
7449 postfix-expression -> template [opt] id-expression
7450 postfix-expression -> pseudo-destructor-name
7452 FOR_OFFSETOF is set if we're being called in that context. That sorta
7453 limits what of the above we'll actually accept, but nevermind.
7454 TOKEN_TYPE is the "." or "->" token, which will already have been
7455 removed from the stream. */
7457 static tree
7460 cp_expr postfix_expression,
7462 location_t location)
7463 {
7464 tree name;
7470 /* If this is a `->' operator, dereference the pointer. */
7473 tf_warning_or_error);
7474 /* Check to see whether or not the expression is type-dependent and
7475 not the current instantiation. */
7477 /* The identifier following the `->' or `.' is not qualified. */
7483 /* Enter the scope corresponding to the type of the object
7484 given by the POSTFIX_EXPRESSION. */
7486 {
7488 /* According to the standard, no expression should ever have
7489 reference type. Unfortunately, we do not currently match
7490 the standard in this respect in that our internal representation
7491 of an expression may have reference type even when the standard
7492 says it does not. Therefore, we have to manually obtain the
7493 underlying type here. */
7495 /* The type of the POSTFIX_EXPRESSION must be complete. */
7496 /* Unlike the object expression in other contexts, *this is not
7497 required to be of complete type for purposes of class member
7498 access (5.2.5) outside the member function body. */
7501 && !(processing_template_decl
7502 && current_class_type
7503 && (same_type_ignoring_top_level_qualifiers_p
7505 {
7511 }
7514 {
7515 /* Let the name lookup machinery know that we are processing a
7516 class member access expression. */
7518 /* If something went wrong, we want to be able to discern that case,
7519 as opposed to the case where there was no SCOPE due to the type
7520 of expression being dependent. */
7523 /* If the SCOPE was erroneous, make the various semantic analysis
7524 functions exit quickly -- and without issuing additional error
7525 messages. */
7528 }
7529 }
7532 /* Tell cp_parser_lookup_name that there was an object, even though it's
7533 type-dependent. */
7536 /* Assume this expression is not a pseudo-destructor access. */
7539 /* If the SCOPE is a scalar type, then, if this is a valid program,
7540 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7541 is type dependent, it can be pseudo-destructor-name or something else.
7542 Try to parse it as pseudo-destructor-name first. */
7544 {
7545 tree s;
7546 tree type;
7549 /* Parse the pseudo-destructor-name. */
7558 {
7560 postfix_expression
7563 }
7564 }
7567 {
7568 /* If the SCOPE is not a scalar type, we are looking at an
7569 ordinary class member access expression, rather than a
7570 pseudo-destructor-name. */
7573 /* Parse the id-expression. */
7574 name = (cp_parser_id_expression
7581 /* In general, build a SCOPE_REF if the member name is qualified.
7582 However, if the name was not dependent and has already been
7583 resolved; there is no need to build the SCOPE_REF. For example;
7585 struct X { void f(); };
7586 template <typename T> void f(T* t) { t->X::f(); }
7588 Even though "t" is dependent, "X::f" is not and has been resolved
7589 to a BASELINK; there is no need to include scope information. */
7591 /* But we do need to remember that there was an explicit scope for
7592 virtual function calls. */
7596 /* If the name is a template-id that names a type, we will get a
7597 TYPE_DECL here. That is invalid code. */
7599 {
7602 }
7603 else
7604 {
7606 {
7608 {
7612 }
7613 else
7616 name,
7617 template_p);
7621 }
7623 adjust_result_of_qualified_name_lookup
7625 postfix_expression
7627 template_p,
7628 tf_warning_or_error);
7629 /* Build a location e.g.:
7630 ptr->access_expr
7631 ~~~^~~~~~~~~~~~~
7632 where the caret is at the deref token, ranging from
7633 the start of postfix_expression to the end of the access expr. */
7634 location_t end_loc
7636 location_t combined_loc
7639 }
7640 }
7642 /* We no longer need to look up names in the scope of the object on
7643 the left-hand side of the `.' or `->' operator. */
7646 /* Outside of offsetof, these operators may not appear in
7647 constant-expressions. */
7649 && (cp_parser_non_integral_constant_expression
7654 }
7656 /* Parse a parenthesized expression-list.
7658 expression-list:
7659 assignment-expression
7660 expression-list, assignment-expression
7662 attribute-list:
7663 expression-list
7664 identifier
7665 identifier, expression-list
7667 CAST_P is true if this expression is the target of a cast.
7669 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7670 argument pack.
7672 WRAP_LOCATIONS_P is true if expressions within this list for which
7673 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7674 their source locations.
7676 Returns a vector of trees. Each element is a representation of an
7677 assignment-expression. NULL is returned if the ( and or ) are
7678 missing. An empty, but allocated, vector is returned on no
7679 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7680 if we are parsing an attribute list for an attribute that wants a
7681 plain identifier argument, normal_attr for an attribute that wants
7682 an expression, or non_attr if we aren't parsing an attribute list. If
7683 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7684 not all of the expressions in the list were constant.
7685 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7686 will be written to with the location of the closing parenthesis. If
7687 an error occurs, it may or may not be written to. */
7697 {
7703 /* Assume all the expressions will be constant. */
7707 matching_parens parens;
7713 /* Within a parenthesized expression, a `>' token is always
7714 the greater-than operator. */
7715 saved_greater_than_is_operator_p
7721 /* Consume expressions until there are no more. */
7724 {
7725 /* At the beginning of attribute lists, check to see if the
7726 next token is an identifier. */
7729 {
7732 /* Consume the identifier. */
7734 /* Save the identifier. */
7736 }
7737 else
7738 {
7741 /* Parse the next assignment-expression. */
7743 {
7744 /* A braced-init-list. */
7750 }
7752 {
7753 expr = (cp_parser_constant_expression
7758 }
7759 else
7761 cast_p);
7766 /* If we have an ellipsis, then this is an expression
7767 expansion. */
7770 {
7771 /* Consume the `...'. */
7774 /* Build the argument pack. */
7776 }
7781 /* Add it to the list. We add error_mark_node
7782 expressions to the list, so that we can still tell if
7783 the correct form for a parenthesized expression-list
7784 is found. That gives better errors. */
7789 }
7791 /* After the first item, attribute lists look the same as
7792 expression lists. */
7795 get_comma:;
7796 /* If the next token isn't a `,', then we are done. */
7800 /* Otherwise, consume the `,' and keep going. */
7802 }
7808 {
7811 skip_comma:;
7812 /* We try and resync to an unnested comma, as that will give the
7813 user better diagnostics. */
7821 {
7822 parser->greater_than_is_operator_p
7825 }
7826 }
7828 parser->greater_than_is_operator_p
7835 }
7837 /* Parse a pseudo-destructor-name.
7839 pseudo-destructor-name:
7840 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7841 :: [opt] nested-name-specifier template template-id :: ~ type-name
7842 :: [opt] nested-name-specifier [opt] ~ type-name
7844 If either of the first two productions is used, sets *SCOPE to the
7845 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7846 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7847 or ERROR_MARK_NODE if the parse fails. */
7849 static void
7851 tree object,
7854 {
7857 /* Handle ~auto. */
7861 {
7864 "%<~auto%> only available with "
7871 }
7873 /* Assume that things will not work out. */
7876 /* Look for the optional `::' operator. */
7878 /* Look for the optional nested-name-specifier. */
7879 nested_name_specifier_p
7886 /* Now, if we saw a nested-name-specifier, we might be doing the
7887 second production. */
7890 {
7891 /* Consume the `template' keyword. */
7893 /* Parse the template-id. */
7897 class_type,
7899 /* Look for the `::' token. */
7901 }
7902 /* If the next token is not a `~', then there might be some
7903 additional qualification. */
7905 {
7906 /* At this point, we're looking for "type-name :: ~". The type-name
7907 must not be a class-name, since this is a pseudo-destructor. So,
7908 it must be either an enum-name, or a typedef-name -- both of which
7909 are just identifiers. So, we peek ahead to check that the "::"
7910 and "~" tokens are present; if they are not, then we can avoid
7911 calling type_name. */
7915 {
7918 }
7920 /* Look for the type-name. */
7925 /* Look for the `::' token. */
7927 }
7928 else
7931 /* Look for the `~'. */
7934 /* Once we see the ~, this has to be a pseudo-destructor. */
7938 /* Look for the type-name again. We are not responsible for
7939 checking that it matches the first type-name. */
7941 }
7943 /* Parse a unary-expression.
7945 unary-expression:
7946 postfix-expression
7947 ++ cast-expression
7948 -- cast-expression
7949 unary-operator cast-expression
7950 sizeof unary-expression
7951 sizeof ( type-id )
7952 alignof ( type-id ) [C++0x]
7953 new-expression
7954 delete-expression
7956 GNU Extensions:
7958 unary-expression:
7959 __extension__ cast-expression
7960 __alignof__ unary-expression
7961 __alignof__ ( type-id )
7962 alignof unary-expression [C++0x]
7963 __real__ cast-expression
7964 __imag__ cast-expression
7965 && identifier
7966 sizeof ( type-id ) { initializer-list , [opt] }
7967 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7968 __alignof__ ( type-id ) { initializer-list , [opt] }
7970 ADDRESS_P is true iff the unary-expression is appearing as the
7971 operand of the `&' operator. CAST_P is true if this expression is
7972 the target of a cast.
7974 Returns a representation of the expression. */
7976 static cp_expr
7979 {
7983 /* Peek at the next token. */
7985 /* Some keywords give away the kind of expression. */
7987 {
7991 {
7994 {
8000 /* Consume the token. */
8002 /* Parse the operand. */
8007 else
8008 {
8009 /* ISO C++ defines alignof only with types, not with
8010 expressions. So pedwarn if alignof is used with a non-
8011 type expression. However, __alignof__ is ok. */
8014 "ISO C++ does not allow %<alignof%> "
8018 }
8019 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8020 SIZEOF_EXPR with the original operand. */
8022 {
8024 {
8026 {
8029 error_mark_node));
8031 }
8032 else
8036 }
8037 }
8039 /* Construct a location e.g. :
8040 alignof (expr)
8041 ^~~~~~~~~~~~~~
8042 with start == caret at the start of the "alignof"/"sizeof"
8043 token, with the endpoint at the final closing paren. */
8044 location_t finish_loc
8046 location_t compound_loc
8053 }
8062 {
8063 /* The saved value of the PEDANTIC flag. */
8065 tree expr;
8067 /* Save away the PEDANTIC flag. */
8069 /* Parse the cast-expression. */
8071 /* Restore the PEDANTIC flag. */
8075 }
8079 {
8080 tree expression;
8082 /* Consume the `__real__' or `__imag__' token. */
8084 /* Parse the cast-expression. */
8086 /* Create the complete representation. */
8090 expression,
8091 tf_warning_or_error);
8092 }
8100 {
8101 tree expr;
8110 matching_parens parens;
8114 parser->type_definition_forbidden_message
8117 saved_integral_constant_expression_p
8119 saved_non_integral_constant_expression_p
8123 saved_greater_than_is_operator_p
8135 parser->greater_than_is_operator_p
8138 parser->integral_constant_expression_p
8140 parser->non_integral_constant_expression_p
8145 location_t finish_loc
8149 /* Construct a location of the form:
8150 noexcept (expr)
8151 ^~~~~~~~~~~~~~~
8152 with start == caret, finishing at the close-paren. */
8153 location_t noexcept_loc
8157 noexcept_loc);
8158 }
8162 }
8163 }
8165 /* Look for the `:: new' and `:: delete', which also signal the
8166 beginning of a new-expression, or delete-expression,
8167 respectively. If the next token is `::', then it might be one of
8168 these. */
8170 {
8173 /* See if the token after the `::' is one of the keywords in
8174 which we're interested. */
8176 /* If it's `new', we have a new-expression. */
8179 /* Similarly, for `delete'. */
8182 }
8184 /* Look for a unary operator. */
8186 /* The `++' and `--' operators can be handled similarly, even though
8187 they are not technically unary-operators in the grammar. */
8189 {
8194 /* Handle the GNU address-of-label extension. */
8197 {
8198 tree identifier;
8199 tree expression;
8202 /* Consume the '&&' token. */
8204 /* Look for the identifier. */
8205 location_t finish_loc
8208 /* Construct a location of the form:
8209 &&label
8210 ^~~~~~~
8211 with caret==start at the "&&", finish at the end of the label. */
8212 location_t combined_loc
8214 /* Create an expression representing the address. */
8217 NIC_ADDR_LABEL))
8220 }
8221 }
8223 {
8224 cp_expr cast_expression;
8230 /* Consume the operator token. */
8234 /* Parse the cast-expression. */
8235 cast_expression
8240 pidk);
8242 /* Make a location:
8243 OP_TOKEN CAST_EXPRESSION
8244 ^~~~~~~~~~~~~~~~~~~~~~~~~
8245 with start==caret at the operator token, and
8246 extending to the end of the cast_expression. */
8249 /* Now, build an appropriate representation. */
8251 {
8255 RO_UNARY_STAR,
8256 complain);
8257 /* TODO: build_x_indirect_ref does not always honor the
8258 location, so ensure it is set. */
8264 /* Fall through. */
8267 cast_expression,
8268 complain);
8269 /* TODO: build_x_unary_op does not always honor the location,
8270 so ensure it is set. */
8278 /* Fall through. */
8280 /* Immediately fold negation of a constant, unless the constant is 0
8281 (since -0 == 0) or it would overflow. */
8286 {
8289 cast_expression);
8291 {
8294 }
8295 }
8296 /* Fall through. */
8305 }
8309 non_constant_p))
8313 }
8317 decltype_p,
8318 pidk);
8319 }
8321 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8322 unary-operator, the corresponding tree code is returned. */
8324 static enum tree_code
8326 {
8328 {
8349 }
8350 }
8352 /* Parse a new-expression.
8354 new-expression:
8355 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8356 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8358 Returns a representation of the expression. */
8360 static tree
8362 {
8365 tree type;
8368 tree ret;
8372 /* Look for the optional `::' operator. */
8373 global_scope_p
8377 /* Look for the `new' operator. */
8379 /* There's no easy way to tell a new-placement from the
8380 `( type-id )' construct. */
8382 /* Look for a new-placement. */
8384 /* If that didn't work out, there's no new-placement. */
8386 {
8390 }
8392 /* If the next token is a `(', then we have a parenthesized
8393 type-id. */
8395 {
8399 /* Consume the `('. */
8400 matching_parens parens;
8403 /* Parse the type-id. */
8404 parser->type_definition_forbidden_message
8406 {
8409 }
8412 /* Look for the closing `)'. */
8415 /* There should not be a direct-new-declarator in this production,
8416 but GCC used to allowed this, so we check and emit a sensible error
8417 message for this case. */
8419 {
8425 }
8426 }
8427 /* Otherwise, there must be a new-type-id. */
8428 else
8431 /* If the next token is a `(' or '{', then we have a new-initializer. */
8436 else
8439 /* A new-expression may not appear in an integral constant
8440 expression. */
8443 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8444 of a new-type-id or type-id of a new-expression, the new-expression shall
8445 contain a new-initializer of the form ( assignment-expression )".
8446 Additionally, consistently with the spirit of DR 1467, we want to accept
8447 'new auto { 2 }' too. */
8453 {
8455 "initialization of new-expression for type %<auto%> "
8458 }
8459 else
8460 {
8461 /* Construct a location e.g.:
8462 ptr = new int[100]
8463 ^~~~~~~~~~~~
8464 with caret == start at the start of the "new" token, and the end
8465 at the end of the final token we consumed. */
8470 /* Create a representation of the new-expression. */
8472 tf_warning_or_error);
8474 }
8482 }
8484 /* Parse a new-placement.
8486 new-placement:
8487 ( expression-list )
8489 Returns the same representation as for an expression-list. */
8493 {
8496 /* Parse the expression-list. */
8497 expression_list = (cp_parser_parenthesized_expression_list
8506 }
8508 /* Parse a new-type-id.
8510 new-type-id:
8511 type-specifier-seq new-declarator [opt]
8513 Returns the TYPE allocated. If the new-type-id indicates an array
8514 type, *NELTS is set to the number of elements in the last array
8515 bound; the TYPE will not include the last array bound. */
8517 static tree
8519 {
8520 cp_decl_specifier_seq type_specifier_seq;
8526 /* The type-specifier sequence must not contain type definitions.
8527 (It cannot contain declarations of new types either, but if they
8528 are not definitions we will catch that because they are not
8529 complete.) */
8531 parser->type_definition_forbidden_message
8533 /* Parse the type-specifier-seq. */
8537 /* Restore the old message. */
8543 /* Parse the new-declarator. */
8546 /* Determine the number of elements in the last array dimension, if
8547 any. */
8549 /* Skip down to the last array dimension. */
8554 {
8557 }
8562 {
8565 }
8568 {
8575 else
8577 }
8580 }
8582 /* Parse an (optional) new-declarator.
8584 new-declarator:
8585 ptr-operator new-declarator [opt]
8586 direct-new-declarator
8588 Returns the declarator. */
8592 {
8595 cp_cv_quals cv_quals;
8597 /* We don't know if there's a ptr-operator next, or not. */
8599 /* Look for a ptr-operator. */
8601 /* If that worked, look for more new-declarators. */
8603 {
8606 /* Parse another optional declarator. */
8609 declarator = cp_parser_make_indirect_declarator
8613 }
8615 /* If the next token is a `[', there is a direct-new-declarator. */
8620 }
8622 /* Parse a direct-new-declarator.
8624 direct-new-declarator:
8625 [ expression ]
8626 direct-new-declarator [constant-expression]
8628 */
8632 {
8636 {
8637 tree expression;
8640 /* Look for the opening `['. */
8645 /* The standard requires that the expression have integral
8646 type. DR 74 adds enumeration types. We believe that the
8647 real intent is that these expressions be handled like the
8648 expression in a `switch' condition, which also allows
8649 classes with a single conversion to integral or
8650 enumeration type. */
8652 {
8653 expression
8655 expression,
8658 {
8660 "expression in new-declarator must have integral "
8663 }
8664 }
8666 /* Look for the closing `]'. */
8669 /* Add this bound to the declarator. */
8672 /* If the next token is not a `[', then there are no more
8673 bounds. */
8676 }
8679 }
8681 /* Parse a new-initializer.
8683 new-initializer:
8684 ( expression-list [opt] )
8685 braced-init-list
8687 Returns a representation of the expression-list. */
8691 {
8695 {
8696 tree t;
8703 }
8704 else
8705 expression_list = (cp_parser_parenthesized_expression_list
8711 }
8713 /* Parse a delete-expression.
8715 delete-expression:
8716 :: [opt] delete cast-expression
8717 :: [opt] delete [ ] cast-expression
8719 Returns a representation of the expression. */
8721 static tree
8723 {
8726 tree expression;
8728 /* Look for the optional `::' operator. */
8729 global_scope_p
8733 /* Look for the `delete' keyword. */
8735 /* See if the array syntax is in use. */
8737 {
8738 /* Consume the `[' token. */
8740 /* Look for the `]' token. */
8742 /* Remember that this is the `[]' construct. */
8744 }
8745 else
8748 /* Parse the cast-expression. */
8751 /* A delete-expression may not appear in an integral constant
8752 expression. */
8757 tf_warning_or_error);
8758 }
8760 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8761 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8762 0 otherwise. */
8764 static int
8766 {
8769 {
8811 /* In ((type ()) () the last () isn't a valid cast-expression,
8812 so the whole must be parsed as postfix-expression. */
8817 /* '[' may start a primary-expression in obj-c++ and in C++11,
8818 as a lambda-expression, eg, '(void)[]{}'. */
8825 /* '++' and '--' may or may not start a cast-expression:
8827 struct T { void operator++(int); };
8828 void f() { (T())++; }
8830 vs
8832 int a;
8833 (int)++a; */
8838 }
8839 }
8841 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8842 in the order: const_cast, static_cast, reinterpret_cast.
8844 Don't suggest dynamic_cast.
8846 Return the first legal cast kind found, or NULL otherwise. */
8850 {
8851 tree trial;
8853 /* Reuse the parser logic by attempting to build the various kinds of
8854 cast, with "complain" disabled.
8855 Identify the first such cast that is valid. */
8857 /* Don't attempt to run such logic within template processing. */
8861 /* First try const_cast. */
8866 /* If that fails, try static_cast. */
8871 /* Finally, try reinterpret_cast. */
8876 /* No such cast possible. */
8878 }
8880 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8881 suggesting how to convert a C-style cast of the form:
8883 (DST_TYPE)ORIG_EXPR
8885 to a C++-style cast.
8887 The primary range of RICHLOC is asssumed to be that of the original
8888 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8889 of the parens in the C-style cast. */
8891 static void
8894 tree dst_type)
8895 {
8896 /* This function is non-trivial, so bail out now if the warning isn't
8897 going to be emitted. */
8901 /* Try to find a legal C++ cast, trying them in order:
8902 const_cast, static_cast, reinterpret_cast. */
8907 /* Replace the open paren with "CAST_SUGGESTION<". */
8908 pretty_printer pp;
8912 /* Replace the close paren with "> (". */
8915 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8917 }
8920 /* Parse a cast-expression.
8922 cast-expression:
8923 unary-expression
8924 ( type-id ) cast-expression
8926 ADDRESS_P is true iff the unary-expression is appearing as the
8927 operand of the `&' operator. CAST_P is true if this expression is
8928 the target of a cast.
8930 Returns a representation of the expression. */
8932 static cp_expr
8935 {
8936 /* If it's a `(', then we might be looking at a cast. */
8938 {
8944 /* There's no way to know yet whether or not this is a cast.
8945 For example, `(int (3))' is a unary-expression, while `(int)
8946 3' is a cast. So, we resort to parsing tentatively. */
8948 /* Types may not be defined in a cast. */
8950 parser->type_definition_forbidden_message
8952 /* Consume the `('. */
8953 matching_parens parens;
8958 /* A very tricky bit is that `(struct S) { 3 }' is a
8959 compound-literal (which we permit in C++ as an extension).
8960 But, that construct is not a cast-expression -- it is a
8961 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8962 is legal; if the compound-literal were a cast-expression,
8963 you'd need an extra set of parentheses.) But, if we parse
8964 the type-id, and it happens to be a class-specifier, then we
8965 will commit to the parse at that point, because we cannot
8966 undo the action that is done when creating a new class. So,
8967 then we cannot back up and do a postfix-expression.
8969 Another tricky case is the following (c++/29234):
8971 struct S { void operator () (); };
8973 void foo ()
8974 {
8975 ( S()() );
8976 }
8978 As a type-id we parse the parenthesized S()() as a function
8979 returning a function, groktypename complains and we cannot
8980 back up in this case either.
8982 Therefore, we scan ahead to the closing `)', and check to see
8983 if the tokens after the `)' can start a cast-expression. Otherwise
8984 we are dealing with an unary-expression, a postfix-expression
8985 or something else.
8987 Yet another tricky case, in C++11, is the following (c++/54891):
8989 (void)[]{};
8991 The issue is that usually, besides the case of lambda-expressions,
8992 the parenthesized type-id cannot be followed by '[', and, eg, we
8993 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8994 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8995 we don't commit, we try a cast-expression, then an unary-expression.
8997 Save tokens so that we can put them back. */
9000 /* We may be looking at a cast-expression. */
9003 cast_expression
9006 /* Roll back the tokens we skipped. */
9008 /* If we aren't looking at a cast-expression, simulate an error so
9009 that the call to cp_parser_error_occurred below returns true. */
9012 else
9013 {
9016 /* Look for the type-id. */
9018 /* Look for the closing `)'. */
9023 }
9025 /* Restore the saved message. */
9028 /* At this point this can only be either a cast or a
9029 parenthesized ctor such as `(T ())' that looks like a cast to
9030 function returning T. */
9032 {
9033 /* Only commit if the cast-expression doesn't start with
9034 '++', '--', or '[' in C++11. */
9042 pidk);
9045 {
9046 /* Warn about old-style casts, if so requested. */
9051 {
9057 }
9059 /* Only type conversions to integral or enumeration types
9060 can be used in constant-expressions. */
9063 NIC_CAST))
9066 /* Perform the cast. */
9067 /* Make a location:
9068 (TYPE) EXPR
9069 ^~~~~~~~~~~
9070 with start==caret at the open paren, extending to the
9071 end of "expr". */
9073 open_paren_loc,
9077 }
9078 }
9079 else
9081 }
9083 /* If we get here, then it's not a cast, so it must be a
9084 unary-expression. */
9087 }
9089 /* Parse a binary expression of the general form:
9091 pm-expression:
9092 cast-expression
9093 pm-expression .* cast-expression
9094 pm-expression ->* cast-expression
9096 multiplicative-expression:
9097 pm-expression
9098 multiplicative-expression * pm-expression
9099 multiplicative-expression / pm-expression
9100 multiplicative-expression % pm-expression
9102 additive-expression:
9103 multiplicative-expression
9104 additive-expression + multiplicative-expression
9105 additive-expression - multiplicative-expression
9107 shift-expression:
9108 additive-expression
9109 shift-expression << additive-expression
9110 shift-expression >> additive-expression
9112 relational-expression:
9113 shift-expression
9114 relational-expression < shift-expression
9115 relational-expression > shift-expression
9116 relational-expression <= shift-expression
9117 relational-expression >= shift-expression
9119 GNU Extension:
9121 relational-expression:
9122 relational-expression <? shift-expression
9123 relational-expression >? shift-expression
9125 equality-expression:
9126 relational-expression
9127 equality-expression == relational-expression
9128 equality-expression != relational-expression
9130 and-expression:
9131 equality-expression
9132 and-expression & equality-expression
9134 exclusive-or-expression:
9135 and-expression
9136 exclusive-or-expression ^ and-expression
9138 inclusive-or-expression:
9139 exclusive-or-expression
9140 inclusive-or-expression | exclusive-or-expression
9142 logical-and-expression:
9143 inclusive-or-expression
9144 logical-and-expression && inclusive-or-expression
9146 logical-or-expression:
9147 logical-and-expression
9148 logical-or-expression || logical-and-expression
9150 All these are implemented with a single function like:
9152 binary-expression:
9153 simple-cast-expression
9154 binary-expression <token> binary-expression
9156 CAST_P is true if this expression is the target of a cast.
9158 The binops_by_token map is used to get the tree codes for each <token> type.
9159 binary-expressions are associated according to a precedence table. */
9161 #define TOKEN_PRECEDENCE(token) \
9162 (((token->type == CPP_GREATER \
9163 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9164 && !parser->greater_than_is_operator_p) \
9165 ? PREC_NOT_OPERATOR \
9166 : binops_by_token[token->type].prec)
9168 static cp_expr
9174 {
9175 cp_parser_expression_stack stack;
9177 cp_parser_expression_stack_entry current;
9178 cp_expr rhs;
9182 tree overload;
9184 /* Parse the first expression. */
9195 {
9196 /* Get an operator token. */
9202 {
9204 "%<>>%> operator is treated"
9208 }
9213 /* This is a fold-expression; handle it later. */
9216 /* Popping an entry off the stack means we completed a subexpression:
9217 - either we found a token which is not an operator (`>' where it is not
9218 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9219 will happen repeatedly;
9220 - or, we found an operator which has lower priority. This is the case
9221 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9222 parsing `3 * 4'. */
9224 {
9227 else
9229 }
9231 get_rhs:
9235 /* We used the operator token. */
9238 /* For "false && x" or "true || x", x will never be executed;
9239 disable warnings while evaluating it. */
9241 c_inhibit_evaluation_warnings +=
9244 c_inhibit_evaluation_warnings +=
9247 /* Extract another operand. It may be the RHS of this expression
9248 or the LHS of a new, higher priority expression. */
9253 /* Get another operator token. Look up its precedence to avoid
9254 building a useless (immediately popped) stack entry for common
9255 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9262 {
9263 /* ... and prepare to parse the RHS of the new, higher priority
9264 expression. Since precedence levels on the stack are
9265 monotonically increasing, we do not have to care about
9266 stack overflows. */
9275 pop:
9277 /* If the stack is not empty, we have parsed into LHS the right side
9278 (`4' in the example above) of an expression we had suspended.
9279 We can use the information on the stack to recover the LHS (`3')
9280 from the stack together with the tree code (`MULT_EXPR'), and
9281 the precedence of the higher level subexpression
9282 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9283 which will be used to actually build the additive expression. */
9288 }
9290 /* Undo the disabling of warnings done above. */
9292 c_inhibit_evaluation_warnings -=
9295 c_inhibit_evaluation_warnings -=
9301 /* Avoid warning for !!x == y. */
9306 /* Avoid warning for !b == y where b is boolean. */
9310 /* Avoid warning for !!b == y where b is boolean. */
9323 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9324 ERROR_MARK for everything that is not a binary expression.
9325 This makes warn_about_parentheses miss some warnings that
9326 involve unary operators. For unary expressions we should
9327 pass the correct tree_code unless the unary expression was
9328 surrounded by parentheses.
9329 */
9333 {
9334 current.lhs
9340 }
9341 else
9342 {
9347 /* TODO: build_x_binary_op doesn't always honor the location. */
9349 }
9352 /* If the binary operator required the use of an overloaded operator,
9353 then this expression cannot be an integral constant-expression.
9354 An overloaded operator can be used even if both operands are
9355 otherwise permissible in an integral constant-expression if at
9356 least one of the operands is of enumeration type. */
9360 NIC_OVERLOADED))
9362 }
9365 }
9367 static cp_expr
9372 {
9375 }
9377 /* Parse the `? expression : assignment-expression' part of a
9378 conditional-expression. The LOGICAL_OR_EXPR is the
9379 logical-or-expression that started the conditional-expression.
9380 Returns a representation of the entire conditional-expression.
9382 This routine is used by cp_parser_assignment_expression.
9384 ? expression : assignment-expression
9386 GNU Extensions:
9388 ? : assignment-expression */
9390 static tree
9392 {
9394 cp_expr assignment_expr;
9398 /* Consume the `?' token. */
9403 {
9406 /* Implicit true clause. */
9408 c_inhibit_evaluation_warnings +=
9411 }
9412 else
9413 {
9416 /* Parse the expression. */
9417 c_inhibit_evaluation_warnings +=
9420 c_inhibit_evaluation_warnings +=
9424 }
9426 /* The next token should be a `:'. */
9428 /* Parse the assignment-expression. */
9430 c_inhibit_evaluation_warnings -=
9433 /* Make a location:
9434 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9435 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9436 with the caret at the "?", ranging from the start of
9437 the logical_or_expr to the end of the assignment_expr. */
9442 /* Build the conditional-expression. */
9444 expr,
9445 assignment_expr,
9446 tf_warning_or_error);
9447 }
9449 /* Parse an assignment-expression.
9451 assignment-expression:
9452 conditional-expression
9453 logical-or-expression assignment-operator assignment_expression
9454 throw-expression
9456 CAST_P is true if this expression is the target of a cast.
9457 DECLTYPE_P is true if this expression is the operand of decltype.
9459 Returns a representation for the expression. */
9461 static cp_expr
9464 {
9465 cp_expr expr;
9467 /* If the next token is the `throw' keyword, then we're looking at
9468 a throw-expression. */
9471 /* Otherwise, it must be that we are looking at a
9472 logical-or-expression. */
9473 else
9474 {
9475 /* Parse the binary expressions (logical-or-expression). */
9477 decltype_p,
9479 /* If the next token is a `?' then we're actually looking at a
9480 conditional-expression. */
9483 else
9484 {
9487 /* If it's an assignment-operator, we're using the second
9488 production. */
9489 enum tree_code assignment_operator
9492 {
9495 /* Parse the right-hand side of the assignment. */
9502 /* An assignment may not appear in a
9503 constant-expression. */
9505 NIC_ASSIGNMENT))
9507 /* Build the assignment expression. Its default
9508 location:
9509 LHS = RHS
9510 ~~~~^~~~~
9511 is the location of the '=' token as the
9512 caret, ranging from the start of the lhs to the
9513 end of the rhs. */
9518 assignment_operator,
9519 rhs,
9521 /* TODO: build_x_modify_expr doesn't honor the location,
9522 so we must set it here. */
9524 }
9525 }
9526 }
9529 }
9531 /* Parse an (optional) assignment-operator.
9533 assignment-operator: one of
9534 = *= /= %= += -= >>= <<= &= ^= |=
9536 GNU Extension:
9538 assignment-operator: one of
9539 <?= >?=
9541 If the next token is an assignment operator, the corresponding tree
9542 code is returned, and the token is consumed. For example, for
9543 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9544 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9545 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9546 operator, ERROR_MARK is returned. */
9548 static enum tree_code
9550 {
9554 /* Peek at the next token. */
9558 {
9604 /* Nothing else is an assignment operator. */
9606 }
9608 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9613 /* If it was an assignment operator, consume it. */
9618 }
9620 /* Parse an expression.
9622 expression:
9623 assignment-expression
9624 expression , assignment-expression
9626 CAST_P is true if this expression is the target of a cast.
9627 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9628 except possibly parenthesized or on the RHS of a comma (N3276).
9630 Returns a representation of the expression. */
9632 static cp_expr
9635 {
9640 {
9641 cp_expr assignment_expression;
9643 /* Parse the next assignment-expression. */
9644 assignment_expression
9647 /* We don't create a temporary for a call that is the immediate operand
9648 of decltype or on the RHS of a comma. But when we see a comma, we
9649 need to create a temporary for a call on the LHS. */
9654 assignment_expression
9658 /* If this is the first assignment-expression, we can just
9659 save it away. */
9662 else
9663 {
9664 /* Create a location with caret at the comma, ranging
9665 from the start of the LHS to the end of the RHS. */
9670 assignment_expression,
9673 }
9674 /* If the next token is not a comma, or we're in a fold-expression, then
9675 we are done with the expression. */
9679 /* Consume the `,'. */
9682 /* A comma operator cannot appear in a constant-expression. */
9685 }
9688 }
9690 /* Parse a constant-expression.
9692 constant-expression:
9693 conditional-expression
9695 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9696 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9697 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9698 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9699 only parse a conditional-expression, otherwise parse an
9700 assignment-expression. See below for rationale. */
9702 static cp_expr
9707 {
9711 cp_expr expression;
9713 /* It might seem that we could simply parse the
9714 conditional-expression, and then check to see if it were
9715 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9716 one that the compiler can figure out is constant, possibly after
9717 doing some simplifications or optimizations. The standard has a
9718 precise definition of constant-expression, and we must honor
9719 that, even though it is somewhat more restrictive.
9721 For example:
9723 int i[(2, 3)];
9725 is not a legal declaration, because `(2, 3)' is not a
9726 constant-expression. The `,' operator is forbidden in a
9727 constant-expression. However, GCC's constant-folding machinery
9728 will fold this operation to an INTEGER_CST for `3'. */
9730 /* Save the old settings. */
9732 saved_allow_non_integral_constant_expression_p
9735 /* We are now parsing a constant-expression. */
9737 parser->allow_non_integral_constant_expression_p
9740 /* Although the grammar says "conditional-expression", when not STRICT_P,
9741 we parse an "assignment-expression", which also permits
9742 "throw-expression" and the use of assignment operators. In the case
9743 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9744 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9745 actually essential that we look for an assignment-expression.
9746 For example, cp_parser_initializer_clauses uses this function to
9747 determine whether a particular assignment-expression is in fact
9748 constant. */
9750 {
9751 /* Parse the binary expressions (logical-or-expression). */
9754 /* If the next token is a `?' then we're actually looking at
9755 a conditional-expression; otherwise we're done. */
9758 }
9759 else
9761 /* Restore the old settings. */
9762 parser->integral_constant_expression_p
9764 parser->allow_non_integral_constant_expression_p
9767 {
9768 /* Require an rvalue constant expression here; that's what our
9769 callers expect. Reference constant expressions are handled
9770 separately in e.g. cp_parser_template_argument. */
9779 }
9782 parser->non_integral_constant_expression_p
9786 }
9788 /* Parse __builtin_offsetof.
9790 offsetof-expression:
9791 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9793 offsetof-member-designator:
9794 id-expression
9795 | offsetof-member-designator "." id-expression
9796 | offsetof-member-designator "[" expression "]"
9797 | offsetof-member-designator "->" id-expression */
9799 static cp_expr
9801 {
9803 tree type;
9804 cp_expr expr;
9805 cp_id_kind dummy;
9807 location_t finish_loc;
9809 /* We're about to accept non-integral-constant things, but will
9810 definitely yield an integral constant expression. Save and
9811 restore these values around our local parsing. */
9817 /* Consume the "__builtin_offsetof" token. */
9819 /* Consume the opening `('. */
9820 matching_parens parens;
9822 /* Parse the type-id. */
9825 /* Look for the `,'. */
9829 /* Build the (type *)null that begins the traditional offsetof macro. */
9830 tree object_ptr
9832 tf_warning_or_error);
9834 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9838 {
9841 {
9843 /* offsetof-member-designator "[" expression "]" */
9849 /* offsetof-member-designator "->" identifier */
9852 /* FALLTHRU */
9855 /* offsetof-member-designator "." identifier */
9863 /* Consume the ")" token. */
9869 /* Error. We know the following require will fail, but
9870 that gives the proper error message. */
9875 }
9876 }
9878 success:
9879 /* Make a location of the form:
9880 __builtin_offsetof (struct s, f)
9881 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9882 with caret at the type-id, ranging from the start of the
9883 "_builtin_offsetof" token to the close paren. */
9885 /* The result will be an INTEGER_CST, so we need to explicitly
9886 preserve the location. */
9889 failure:
9895 }
9897 /* Parse a trait expression.
9899 Returns a representation of the expression, the underlying type
9900 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9902 static cp_expr
9904 {
9905 cp_trait_kind kind;
9911 {
10013 }
10015 /* Get location of initial token. */
10018 /* Consume the token. */
10021 matching_parens parens;
10024 {
10027 }
10033 {
10036 {
10039 }
10043 }
10045 {
10047 {
10051 {
10054 }
10058 }
10059 }
10064 /* Construct a location of the form:
10065 __is_trivially_copyable(_Tp)
10066 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10067 with start == caret, finishing at the close-paren. */
10070 /* Complete the trait expression, which may mean either processing
10071 the trait expr now or saving it for template instantiation. */
10073 {
10082 }
10083 }
10085 /* Parse a lambda expression.
10087 lambda-expression:
10088 lambda-introducer lambda-declarator [opt] compound-statement
10090 Returns a representation of the expression. */
10092 static cp_expr
10094 {
10096 tree type;
10104 {
10106 {
10110 }
10112 }
10114 {
10116 {
10119 }
10121 }
10123 /* We may be in the middle of deferred access check. Disable
10124 it now. */
10135 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10138 /* Now that we've started the type, add the capture fields for any
10139 explicit captures. */
10142 {
10143 /* Inside the class, surrounding template-parameter-lists do not apply. */
10144 unsigned int saved_num_template_parameter_lists
10148 bool fully_implicit_function_template_p
10152 bool auto_is_implicit_function_template_parm_p
10163 /* By virtue of defining a local class, a lambda expression has access to
10164 the private variables of enclosing classes. */
10172 {
10177 }
10179 {
10182 }
10184 /* The capture list was built up in reverse order; fix that now. */
10196 parser->fully_implicit_function_template_p
10200 parser->auto_is_implicit_function_template_parm_p
10202 }
10204 /* This field is only used during parsing of the lambda. */
10207 /* This lambda shouldn't have any proxies left at this point. */
10209 /* And now that we're done, push proxies for an enclosing lambda. */
10214 else
10222 }
10224 /* Parse the beginning of a lambda expression.
10226 lambda-introducer:
10227 [ lambda-capture [opt] ]
10229 LAMBDA_EXPR is the current representation of the lambda expression. */
10231 static void
10233 {
10234 /* Need commas after the first capture. */
10237 /* Eat the leading `['. */
10240 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10248 {
10251 }
10254 {
10256 tree capture_id;
10257 tree capture_init_expr;
10261 enum capture_kind_type
10262 {
10263 BY_COPY,
10264 BY_REFERENCE
10265 };
10269 {
10272 }
10276 else
10279 /* Possibly capture `this'. */
10281 {
10292 explicit_init_p);
10294 }
10296 /* Possibly capture `*this'. */
10299 {
10310 explicit_init_p);
10312 }
10314 /* Remember whether we want to capture as a reference or not. */
10316 {
10319 }
10321 /* Get the identifier. */
10326 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10327 delimiters, but I modified this to stop on unnested ']' as well. It
10328 was already changed to stop on unnested '}', so the
10329 "closing_parenthesis" name is no more misleading with my change. */
10330 {
10336 }
10338 /* Find the initializer for this capture. */
10342 {
10344 /* An explicit initializer exists. */
10347 "lambda capture initializers "
10353 {
10356 }
10357 }
10358 else
10359 {
10362 /* Turn the identifier into an id-expression. */
10363 capture_init_expr
10368 {
10371 }
10375 {
10378 capture_init_expr);
10382 }
10385 {
10388 capture_init_expr))
10392 }
10394 capture_init_expr
10395 = finish_id_expression
10397 capture_init_expr,
10411 {
10414 }
10415 else
10417 }
10421 {
10426 capture_id);
10430 "capture of %qD redundant with by-reference capture "
10432 }
10435 capture_id,
10436 capture_init_expr,
10438 explicit_init_p);
10439 }
10442 }
10444 /* Parse the (optional) middle of a lambda expression.
10446 lambda-declarator:
10447 < template-parameter-list [opt] >
10448 ( parameter-declaration-clause [opt] )
10449 attribute-specifier [opt]
10450 decl-specifier-seq [opt]
10451 exception-specification [opt]
10452 lambda-return-type-clause [opt]
10454 LAMBDA_EXPR is the current representation of the lambda expression. */
10456 static bool
10458 {
10459 /* 5.1.1.4 of the standard says:
10460 If a lambda-expression does not include a lambda-declarator, it is as if
10461 the lambda-declarator were ().
10462 This means an empty parameter list, no attributes, and no exception
10463 specification. */
10470 cp_decl_specifier_seq lambda_specs;
10473 /* The template-parameter-list is optional, but must begin with
10474 an opening angle if present. */
10476 {
10479 "lambda templates are only available with "
10483 "lambda templates are only available with "
10492 /* We just processed one more parameter list. */
10494 }
10496 /* The parameter-declaration-clause is optional (unless
10497 template-parameter-list was given), but must begin with an
10498 opening parenthesis if present. */
10500 {
10501 matching_parens parens;
10506 /* Parse parameters. */
10509 /* Default arguments shall not be specified in the
10510 parameter-declaration-clause of a lambda-declarator. */
10521 /* In the decl-specifier-seq of the lambda-declarator, each
10522 decl-specifier shall either be mutable or constexpr. */
10526 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10529 {
10534 }
10538 /* Parse optional exception specification. */
10541 /* Parse optional trailing return type. */
10543 {
10546 }
10548 /* The function parameters must be in scope all the way until after the
10549 trailing-return-type in case of decltype. */
10551 }
10555 /* Create the function call operator.
10557 Messing with declarators like this is no uglier than building up the
10558 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10559 other code. */
10560 {
10561 cp_decl_specifier_seq return_type_specs;
10563 tree fco;
10570 else
10571 /* Maybe we will deduce the return type later. */
10575 {
10579 else
10582 }
10591 VIRT_SPEC_UNSPECIFIED,
10592 REF_QUAL_NONE,
10593 tx_qual,
10594 exception_spec,
10600 declarator,
10601 attributes);
10603 {
10606 /* Give the object parameter a different name. */
10610 }
10612 {
10616 }
10625 }
10626 }
10628 /* Parse the body of a lambda expression, which is simply
10630 compound-statement
10632 but which requires special handling.
10633 LAMBDA_EXPR is the current representation of the lambda expression. */
10635 static void
10637 {
10644 else
10645 /* Still increment function_depth so that we don't GC in the
10646 middle of an expression. */
10651 /* Clear this in case we're in the middle of a default argument. */
10655 {
10659 matching_braces braces;
10662 {
10665 /* Originally C++11 required us to peek for 'return expr'; and
10666 process it specially here to deduce the return type. N3638
10667 removed the need for that. */
10675 }
10678 }
10685 else
10687 }
10689 /* Statements [gram.stmt.stmt] */
10691 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10693 static void
10695 {
10702 }
10704 /* Parse a statement.
10706 statement:
10707 labeled-statement
10708 expression-statement
10709 compound-statement
10710 selection-statement
10711 iteration-statement
10712 jump-statement
10713 declaration-statement
10714 try-block
10716 C++11:
10718 statement:
10719 labeled-statement
10720 attribute-specifier-seq (opt) expression-statement
10721 attribute-specifier-seq (opt) compound-statement
10722 attribute-specifier-seq (opt) selection-statement
10723 attribute-specifier-seq (opt) iteration-statement
10724 attribute-specifier-seq (opt) jump-statement
10725 declaration-statement
10726 attribute-specifier-seq (opt) try-block
10728 init-statement:
10729 expression-statement
10730 simple-declaration
10732 TM Extension:
10734 statement:
10735 atomic-statement
10737 IN_COMPOUND is true when the statement is nested inside a
10738 cp_parser_compound_statement; this matters for certain pragmas.
10740 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10741 is a (possibly labeled) if statement which is not enclosed in braces
10742 and has an else clause. This is used to implement -Wparentheses.
10744 CHAIN is a vector of if-else-if conditions. */
10746 static void
10750 {
10755 restart:
10758 /* There is no statement yet. */
10764 /* In obj-c++, seeing '[[' might be the either the beginning of
10765 c++11 attributes, or a nested objc-message-expression. So
10766 let's parse the c++11 attributes tentatively. */
10770 {
10773 }
10775 /* Peek at the next token. */
10777 /* Remember the location of the first token in the statement. */
10780 /* If this is a keyword, then that will often determine what kind of
10781 statement we have. */
10783 {
10787 {
10790 /* Looks like a labeled-statement with a case label.
10791 Parse the label, and then use tail recursion to parse
10792 the statement. */
10815 /* Objective-C++ exception-handling constructs. */
10829 /* This must be a namespace alias definition. */
10845 /* It might be a keyword like `int' that can start a
10846 declaration-statement. */
10848 }
10849 }
10851 {
10852 /* If the next token is a `:', then we are looking at a
10853 labeled-statement. */
10856 {
10857 /* Looks like a labeled-statement with an ordinary label.
10858 Parse the label, and then use tail recursion to parse
10859 the statement. */
10864 }
10865 }
10866 /* Anything that starts with a `{' must be a compound-statement. */
10869 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10870 a statement all its own. */
10872 {
10873 /* Only certain OpenMP pragmas are attached to statements, and thus
10874 are considered statements themselves. All others are not. In
10875 the context of a compound, accept the pragma as a "statement" and
10876 return so that we can check for a close brace. Otherwise we
10877 require a real statement and must go back and read one. */
10883 }
10885 {
10888 }
10890 /* Everything else must be a declaration-statement or an
10891 expression-statement. Try for the declaration-statement
10892 first, unless we are looking at a `;', in which case we know that
10893 we have an expression-statement. */
10895 {
10897 {
10899 {
10900 /* Attributes should be parsed as part of the the
10901 declaration, so let's un-parse them. */
10904 }
10907 /* Try to parse the declaration-statement. */
10909 /* If that worked, we're done. */
10912 }
10913 /* All preceding labels have been parsed at this point. */
10917 /* Look for an expression-statement instead. */
10920 /* Handle [[fallthrough]];. */
10922 {
10923 /* The next token after the fallthrough attribute is ';'. */
10925 {
10926 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10928 IFN_FALLTHROUGH,
10931 }
10932 else
10936 }
10937 }
10939 /* Set the line number for the statement. */
10943 /* Allow "[[fallthrough]];", but warn otherwise. */
10946 OPT_Wattributes,
10948 }
10950 /* Append ATTR to attribute list ATTRS. */
10952 static tree
10954 {
10960 }
10962 /* Parse the label for a labeled-statement, i.e.
10964 identifier :
10965 case constant-expression :
10966 default :
10968 GNU Extension:
10969 case constant-expression ... constant-expression : statement
10971 When a label is parsed without errors, the label is added to the
10972 parse tree by the finish_* functions, so this function doesn't
10973 have to return the label. */
10975 static void
10977 {
10982 /* The next token should be an identifier. */
10986 {
10989 }
10991 /* Remember whether this case or a user-defined label is allowed to fall
10992 through to. */
10997 {
10999 {
11003 /* Consume the `case' token. */
11005 /* Parse the constant-expression. */
11012 {
11013 /* Consume the `...' token. */
11019 /* We don't need to emit warnings here, as the common code
11020 will do this for us. */
11021 }
11022 else
11026 {
11030 }
11031 else
11034 expr);
11035 }
11039 /* Consume the `default' token. */
11043 {
11047 }
11048 else
11053 /* Anything else must be an ordinary label. */
11058 }
11060 /* Require the `:' token. */
11063 /* An ordinary label may optionally be followed by attributes.
11064 However, this is only permitted if the attributes are then
11065 followed by a semicolon. This is because, for backward
11066 compatibility, when parsing
11067 lab: __attribute__ ((unused)) int i;
11068 we want the attribute to attach to "i", not "lab". */
11071 {
11072 tree attrs;
11079 ;
11080 else
11082 }
11088 }
11090 /* Parse an expression-statement.
11092 expression-statement:
11093 expression [opt] ;
11095 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11096 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11097 indicates whether this expression-statement is part of an
11098 expression statement. */
11100 static tree
11102 {
11107 /* There might be attribute fallthrough. */
11110 /* If the next token is a ';', then there is no expression
11111 statement. */
11113 {
11117 {
11120 }
11121 }
11123 /* Handle [[fallthrough]];. */
11125 {
11126 /* The next token after the fallthrough attribute is ';'. */
11128 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11131 else
11135 }
11137 /* Allow "[[fallthrough]];", but warn otherwise. */
11142 /* Give a helpful message for "A<T>::type t;" and the like. */
11145 {
11152 {
11153 /* A::A a; */
11158 }
11159 }
11161 /* Consume the final `;'. */
11166 /* This is the final expression statement of a statement
11167 expression. */
11173 }
11175 /* Parse a compound-statement.
11177 compound-statement:
11178 { statement-seq [opt] }
11180 GNU extension:
11182 compound-statement:
11183 { label-declaration-seq [opt] statement-seq [opt] }
11185 label-declaration-seq:
11186 label-declaration
11187 label-declaration-seq label-declaration
11189 Returns a tree representing the statement. */
11191 static tree
11194 {
11195 tree compound_stmt;
11196 matching_braces braces;
11198 /* Consume the `{'. */
11205 /* Begin the compound-statement. */
11207 /* If the next keyword is `__label__' we have a label declaration. */
11210 /* Parse an (optional) statement-seq. */
11212 /* Finish the compound-statement. */
11214 /* Consume the `}'. */
11218 }
11220 /* Parse an (optional) statement-seq.
11222 statement-seq:
11223 statement
11224 statement-seq [opt] statement */
11226 static void
11228 {
11229 /* Scan statements until there aren't any more. */
11231 {
11234 /* If we are looking at a `}', then we have run out of
11235 statements; the same is true if we have reached the end
11236 of file, or have stumbled upon a stray '@end'. */
11243 /* If we are in a compound statement and find 'else' then
11244 something went wrong. */
11246 {
11249 else
11250 {
11253 }
11254 }
11256 /* Parse the statement. */
11258 }
11259 }
11261 /* Return true if we're looking at (init; cond), false otherwise. */
11263 static bool
11265 {
11266 /* Save tokens so that we can put them back. */
11269 /* Look for ';' that is not nested in () or {}. */
11272 CPP_SEMICOLON,
11275 /* Roll back the tokens we skipped. */
11279 }
11281 /* Parse a selection-statement.
11283 selection-statement:
11284 if ( init-statement [opt] condition ) statement
11285 if ( init-statement [opt] condition ) statement else statement
11286 switch ( init-statement [opt] condition ) statement
11288 Returns the new IF_STMT or SWITCH_STMT.
11290 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11291 is a (possibly labeled) if statement which is not enclosed in
11292 braces and has an else clause. This is used to implement
11293 -Wparentheses.
11295 CHAIN is a vector of if-else-if conditions. This is used to implement
11296 -Wduplicated-cond. */
11298 static tree
11301 {
11304 token_indent_info guard_tinfo;
11309 /* Peek at the next token. */
11313 /* See what kind of keyword it is. */
11316 {
11319 {
11320 tree statement;
11321 tree condition;
11326 RID_CONSTEXPR))
11327 {
11333 }
11335 /* Look for the `('. */
11336 matching_parens parens;
11338 {
11341 }
11343 /* Begin the selection-statement. */
11345 {
11348 }
11349 else
11352 /* Parse the optional init-statement. */
11354 {
11355 tree decl;
11358 "init-statement in selection statements only available "
11361 }
11363 /* Parse the condition. */
11365 /* Look for the `)'. */
11371 {
11375 /* Add the condition. */
11382 /* Parse the then-clause. */
11386 /* Outside a template, the non-selected branch of a constexpr
11387 if is a 'discarded statement', i.e. unevaluated. */
11392 {
11395 }
11398 guard_tinfo);
11405 {
11409 }
11411 /* If the next token is `else', parse the else-clause. */
11413 RID_ELSE))
11414 {
11418 {
11421 }
11423 guard_tinfo
11425 /* Consume the `else' keyword. */
11428 {
11430 RID_IF)
11432 {
11433 /* We've got "if (COND) else if (COND2)". Start
11434 the condition chain and add COND as the first
11435 element. */
11439 {
11440 /* Wrap it in a NOP_EXPR so that we can set the
11441 location of the condition. */
11443 condition);
11446 }
11447 }
11449 RID_IF))
11450 {
11451 /* This is if-else without subsequent if. Zap the
11452 condition chain; we would have already warned at
11453 this point. */
11456 }
11457 }
11459 /* Parse the else-clause. */
11465 /* If we are currently parsing a then-clause, then
11466 IF_P will not be NULL. We set it to true to
11467 indicate that this if statement has an else clause.
11468 This may trigger the Wparentheses warning below
11469 when we get back up to the parent if statement. */
11474 {
11478 }
11479 }
11480 else
11481 {
11482 /* This if statement does not have an else clause. If
11483 NESTED_IF is true, then the then-clause has an if
11484 statement which does have an else clause. We warn
11485 about the potential ambiguity. */
11488 "suggest explicit braces to avoid ambiguous"
11491 {
11492 /* We don't need the condition chain anymore. */
11495 }
11496 }
11498 /* Now we're all done with the if-statement. */
11500 }
11501 else
11502 {
11506 /* Add the condition. */
11509 /* Parse the body of the switch-statement. */
11515 guard_tinfo);
11519 /* Now we're all done with the switch-statement. */
11521 }
11524 }
11530 }
11531 }
11533 /* Parse a condition.
11535 condition:
11536 expression
11537 type-specifier-seq declarator = initializer-clause
11538 type-specifier-seq declarator braced-init-list
11540 GNU Extension:
11542 condition:
11543 type-specifier-seq declarator asm-specification [opt]
11544 attributes [opt] = assignment-expression
11546 Returns the expression that should be tested. */
11548 static tree
11550 {
11551 cp_decl_specifier_seq type_specifiers;
11555 /* Try the declaration first. */
11557 /* New types are not allowed in the type-specifier-seq for a
11558 condition. */
11560 parser->type_definition_forbidden_message
11562 /* Parse the type-specifier-seq. */
11564 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11567 /* Restore the saved message. */
11569 /* If all is well, we might be looking at a declaration. */
11571 {
11572 tree decl;
11573 tree asm_specification;
11574 tree attributes;
11578 /* Parse the declarator. */
11584 /* Parse the attributes. */
11586 /* Parse the asm-specification. */
11588 /* If the next token is not an `=' or '{', then we might still be
11589 looking at an expression. For example:
11591 if (A(a).x)
11593 looks like a decl-specifier-seq and a declarator -- but then
11594 there is no `=', so this is an expression. */
11599 /* If we did see an `=' or '{', then we are looking at a declaration
11600 for sure. */
11602 {
11603 tree pushed_scope;
11607 /* Create the declaration. */
11613 /* Parse the initializer. */
11615 {
11619 }
11620 else
11621 {
11622 /* Consume the `='. */
11625 }
11629 /* Process the initializer. */
11632 asm_specification,
11633 flags);
11639 }
11640 }
11641 /* If we didn't even get past the declarator successfully, we are
11642 definitely not looking at a declaration. */
11643 else
11646 /* Otherwise, we are looking at an expression. */
11648 }
11650 /* Parses a for-statement or range-for-statement until the closing ')',
11651 not included. */
11653 static tree
11655 {
11659 /* Begin the for-statement. */
11662 /* Parse the initialization. */
11667 else
11669 }
11671 static tree
11674 {
11675 /* Normal for loop */
11678 tree stmt;
11681 /* The init-statement has already been parsed in
11682 cp_parser_init_statement, so no work is needed here. */
11685 /* If there's a condition, process it. */
11689 {
11693 }
11695 {
11699 }
11701 /* Look for the `;'. */
11704 /* If there's an expression, process it. */
11710 }
11712 /* Tries to parse a range-based for-statement:
11714 range-based-for:
11715 decl-specifier-seq declarator : expression
11717 The decl-specifier-seq declarator and the `:' are already parsed by
11718 cp_parser_init_statement. If processing_template_decl it returns a
11719 newly created RANGE_FOR_STMT; if not, it is converted to a
11720 regular FOR_STMT. */
11722 static tree
11725 {
11732 /* Get the range declaration momentarily out of the way so that
11733 the range expression doesn't clash with it. */
11735 {
11737 {
11739 /* For decomposition declaration get all of the corresponding
11740 declarations out of the way. */
11744 {
11750 {
11756 }
11757 }
11758 }
11760 {
11765 }
11766 }
11769 {
11772 }
11773 else
11776 /* Put the range declaration(s) back into scope. */
11778 {
11782 }
11784 /* If in template, STMT is converted to a normal for-statement
11785 at instantiation. If not, it is done just ahead. */
11787 {
11797 /* do_auto_deduction doesn't mess with template init-lists. */
11800 }
11801 else
11802 {
11806 unroll);
11807 }
11809 }
11811 /* Subroutine of cp_convert_range_for: given the initializer expression,
11812 builds up the range temporary. */
11814 static tree
11816 {
11819 /* Find out the type deduced by the declaration
11820 `auto &&__range = range_expr'. */
11825 /* Create the __range variable. */
11832 }
11834 /* Used by cp_parser_range_for in template context: we aren't going to
11835 do a full conversion yet, but we still need to resolve auto in the
11836 type of the for-range-declaration if present. This is basically
11837 a shortcut version of cp_convert_range_for. */
11839 static void
11841 {
11844 {
11847 iter_type = (cp_parser_perform_range_for_lookup
11850 {
11852 iter_type);
11854 RO_UNARY_STAR,
11855 tf_warning_or_error);
11858 }
11859 }
11860 }
11862 /* Converts a range-based for-statement into a normal
11863 for-statement, as per the definition.
11865 for (RANGE_DECL : RANGE_EXPR)
11866 BLOCK
11868 should be equivalent to:
11870 {
11871 auto &&__range = RANGE_EXPR;
11872 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11873 __begin != __end;
11874 ++__begin)
11875 {
11876 RANGE_DECL = *__begin;
11877 BLOCK
11878 }
11879 }
11881 If RANGE_EXPR is an array:
11882 BEGIN_EXPR = __range
11883 END_EXPR = __range + ARRAY_SIZE(__range)
11884 Else if RANGE_EXPR has a member 'begin' or 'end':
11885 BEGIN_EXPR = __range.begin()
11886 END_EXPR = __range.end()
11887 Else:
11888 BEGIN_EXPR = begin(__range)
11889 END_EXPR = end(__range);
11891 If __range has a member 'begin' but not 'end', or vice versa, we must
11892 still use the second alternative (it will surely fail, however).
11893 When calling begin()/end() in the third alternative we must use
11894 argument dependent lookup, but always considering 'std' as an associated
11895 namespace. */
11897 tree
11901 {
11909 /* If an error happened previously do nothing or else a lot of
11910 unhelpful errors would be issued. */
11912 else
11913 {
11914 tree range_temp;
11918 /* Can't bind a reference to an array of runtime bound. */
11920 else
11921 {
11926 LOOKUP_ONLYCONVERTING);
11928 }
11931 }
11933 /* The new for initialization statement. */
11941 LOOKUP_ONLYCONVERTING);
11952 LOOKUP_ONLYCONVERTING);
11956 /* The new for condition. */
11963 /* The new increment expression. */
11966 tf_warning_or_error);
11972 /* The declaration is initialized with *__begin inside the loop body. */
11975 tf_warning_or_error),
11977 LOOKUP_ONLYCONVERTING);
11982 }
11984 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11985 We need to solve both at the same time because the method used
11986 depends on the existence of members begin or end.
11987 Returns the type deduced for the iterator expression. */
11989 static tree
11991 {
11993 {
11996 }
11999 {
12004 }
12006 {
12007 /* If RANGE is an array, we will use pointer arithmetic. */
12010 range,
12014 }
12015 else
12016 {
12017 /* If it is not an array, we must do a bit of magic. */
12027 tf_warning_or_error);
12030 tf_warning_or_error);
12033 {
12034 /* Use the member functions. */
12037 else
12043 else
12046 }
12047 else
12048 {
12049 /* Use global functions with ADL. */
12056 tf_warning_or_error);
12058 tf_warning_or_error);
12060 tf_warning_or_error);
12062 tf_warning_or_error);
12065 }
12067 /* Last common checks. */
12069 {
12070 /* If one of the expressions is an error do no more checks. */
12073 }
12076 /* Can happen, when, eg, in a template context, Koenig lookup
12077 can't resolve begin/end (c++/58503). */
12079 else
12080 {
12082 /* The unqualified type of the __begin and __end temporaries should
12083 be the same, as required by the multiple auto declaration. */
12085 {
12092 /* P0184R0 allows __begin and __end to have different types,
12093 but make sure they are comparable so we can give a better
12095 else
12099 }
12101 }
12102 }
12103 }
12105 /* Helper function for cp_parser_perform_range_for_lookup.
12106 Builds a tree for RANGE.IDENTIFIER(). */
12108 static tree
12110 {
12123 tf_warning_or_error);
12126 }
12128 /* Parse an iteration-statement.
12130 iteration-statement:
12131 while ( condition ) statement
12132 do statement while ( expression ) ;
12133 for ( init-statement condition [opt] ; expression [opt] )
12134 statement
12136 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12138 static tree
12141 {
12144 tree statement;
12146 token_indent_info guard_tinfo;
12148 /* Peek at the next token. */
12155 /* Remember whether or not we are already within an iteration
12156 statement. */
12159 /* See what kind of keyword it is. */
12162 {
12164 {
12165 tree condition;
12167 /* Begin the while-statement. */
12169 /* Look for the `('. */
12170 matching_parens parens;
12172 /* Parse the condition. */
12175 /* Look for the `)'. */
12177 /* Parse the dependent statement. */
12183 /* We're done with the while-statement. */
12185 }
12189 {
12190 tree expression;
12192 /* Begin the do-statement. */
12194 /* Parse the body of the do-statement. */
12201 /* Look for the `while' keyword. */
12203 /* Look for the `('. */
12204 matching_parens parens;
12206 /* Parse the expression. */
12208 /* We're done with the do-statement. */
12210 /* Look for the `)'. */
12212 /* Look for the `;'. */
12214 }
12218 {
12219 /* Look for the `('. */
12220 matching_parens parens;
12225 /* Look for the `)'. */
12228 /* Parse the body of the for-statement. */
12235 /* We're done with the for-statement. */
12237 }
12244 }
12247 }
12249 /* Parse a init-statement or the declarator of a range-based-for.
12250 Returns true if a range-based-for declaration is seen.
12252 init-statement:
12253 expression-statement
12254 simple-declaration */
12256 static bool
12258 {
12259 /* If the next token is a `;', then we have an empty
12260 expression-statement. Grammatically, this is also a
12261 simple-declaration, but an invalid one, because it does not
12262 declare anything. Therefore, if we did not handle this case
12263 specially, we would issue an error message about an invalid
12264 declaration. */
12266 {
12270 /* A colon is used in range-based for. */
12273 /* We're going to speculatively look for a declaration, falling back
12274 to an expression, if necessary. */
12276 /* Parse the declaration. */
12279 decl);
12282 {
12283 /* It is a range-for, consume the ':' */
12287 {
12289 "range-based %<for%> loops only available with "
12292 }
12293 }
12294 else
12295 /* The ';' is not consumed yet because we told
12296 cp_parser_simple_declaration not to. */
12301 /* If the tentative parse failed, then we shall need to look for an
12302 expression-statement. */
12303 }
12304 /* If we are here, it is an expression-statement. */
12307 }
12309 /* Parse a jump-statement.
12311 jump-statement:
12312 break ;
12313 continue ;
12314 return expression [opt] ;
12315 return braced-init-list ;
12316 goto identifier ;
12318 GNU extension:
12320 jump-statement:
12321 goto * expression ;
12323 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12325 static tree
12327 {
12333 /* Peek at the next token. */
12338 /* See what kind of keyword it is. */
12341 {
12345 {
12362 }
12368 {
12372 /* Fall through. */
12382 }
12387 {
12388 tree expr;
12392 {
12396 }
12399 else
12400 /* If the next token is a `;', then there is no
12401 expression. */
12403 /* Build the return-statement. */
12406 else
12408 /* Look for the final `;'. */
12410 }
12416 {
12419 }
12421 /* Create the goto-statement. */
12423 {
12424 /* Issue a warning about this use of a GNU extension. */
12426 /* Consume the '*' token. */
12428 /* Parse the dependent expression. */
12430 }
12431 else
12433 /* Look for the final `;'. */
12440 }
12443 }
12445 /* Parse a declaration-statement.
12447 declaration-statement:
12448 block-declaration */
12450 static void
12452 {
12455 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12458 /* Parse the block-declaration. */
12461 /* Free any declarators allocated. */
12463 }
12465 /* Some dependent statements (like `if (cond) statement'), are
12466 implicitly in their own scope. In other words, if the statement is
12467 a single statement (as opposed to a compound-statement), it is
12468 none-the-less treated as if it were enclosed in braces. Any
12469 declarations appearing in the dependent statement are out of scope
12470 after control passes that point. This function parses a statement,
12471 but ensures that is in its own scope, even if it is not a
12472 compound-statement.
12474 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12475 is a (possibly labeled) if statement which is not enclosed in
12476 braces and has an else clause. This is used to implement
12477 -Wparentheses.
12479 CHAIN is a vector of if-else-if conditions. This is used to implement
12480 -Wduplicated-cond.
12482 Returns the new statement. */
12484 static tree
12488 {
12489 tree statement;
12492 token_indent_info body_tinfo
12498 /* Mark if () ; with a special NOP_EXPR. */
12500 {
12511 }
12512 /* if a compound is opened, we simply parse the statement directly. */
12515 /* If the token is not a `{', then we must take special action. */
12516 else
12517 {
12518 /* Create a compound-statement. */
12520 /* Parse the dependent-statement. */
12523 /* Finish the dummy compound-statement. */
12525 }
12527 token_indent_info next_tinfo
12536 /* Return the statement. */
12538 }
12540 /* For some dependent statements (like `while (cond) statement'), we
12541 have already created a scope. Therefore, even if the dependent
12542 statement is a compound-statement, we do not want to create another
12543 scope. */
12545 static void
12548 {
12549 /* If the token is a `{', then we must take special action. */
12551 {
12552 token_indent_info body_tinfo
12558 token_indent_info next_tinfo
12567 }
12568 else
12569 {
12570 /* Avoid calling cp_parser_compound_statement, so that we
12571 don't create a new scope. Do everything else by hand. */
12572 matching_braces braces;
12574 /* If the next keyword is `__label__' we have a label declaration. */
12577 /* Parse an (optional) statement-seq. */
12580 }
12581 }
12583 /* Declarations [gram.dcl.dcl] */
12585 /* Parse an optional declaration-sequence.
12587 declaration-seq:
12588 declaration
12589 declaration-seq declaration */
12591 static void
12593 {
12595 {
12606 {
12607 /* A declaration consisting of a single semicolon is
12608 invalid. Allow it unless we're being pedantic. */
12613 }
12615 /* If we're entering or exiting a region that's implicitly
12616 extern "C", modify the lang context appropriately. */
12618 {
12621 }
12623 {
12626 }
12629 {
12630 /* A top-level declaration can consist solely of a #pragma.
12631 A nested declaration cannot, so this is done here and not
12632 in cp_parser_declaration. (A #pragma at block scope is
12633 handled in cp_parser_statement.) */
12636 }
12638 /* Parse the declaration itself. */
12640 }
12641 }
12643 /* Parse a declaration.
12645 declaration:
12646 block-declaration
12647 function-definition
12648 template-declaration
12649 explicit-instantiation
12650 explicit-specialization
12651 linkage-specification
12652 namespace-definition
12654 C++17:
12655 deduction-guide
12657 GNU extension:
12659 declaration:
12660 __extension__ declaration */
12662 static void
12664 {
12665 cp_token token1;
12666 cp_token token2;
12671 /* Check for the `__extension__' keyword. */
12673 {
12674 /* Parse the qualified declaration. */
12676 /* Restore the PEDANTIC flag. */
12680 }
12682 /* Try to figure out what kind of declaration is present. */
12687 else
12688 {
12691 }
12693 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12696 /* If the next token is `extern' and the following token is a string
12697 literal, then we have a linkage specification. */
12701 /* If the next token is `template', then we have either a template
12702 declaration, an explicit instantiation, or an explicit
12703 specialization. */
12705 {
12706 /* `template <>' indicates a template specialization. */
12710 /* `template <' indicates a template declaration. */
12713 /* Anything else must be an explicit instantiation. */
12714 else
12716 }
12717 /* If the next token is `export', then we have a template
12718 declaration. */
12721 /* If the next token is `extern', 'static' or 'inline' and the one
12722 after that is `template', we have a GNU extended explicit
12723 instantiation directive. */
12730 /* If the next token is `namespace', check for a named or unnamed
12731 namespace definition. */
12740 /* An unnamed namespace definition. */
12744 /* An inline (associated) namespace definition. */
12748 /* Objective-C++ declaration/definition. */
12755 /* At this point we may have a template declared by a concept
12756 introduction. */
12761 else
12762 /* Try to parse a block-declaration, or a function-definition. */
12765 /* Free any declarators allocated. */
12767 }
12769 /* Parse a block-declaration.
12771 block-declaration:
12772 simple-declaration
12773 asm-definition
12774 namespace-alias-definition
12775 using-declaration
12776 using-directive
12778 GNU Extension:
12780 block-declaration:
12781 __extension__ block-declaration
12783 C++0x Extension:
12785 block-declaration:
12786 static_assert-declaration
12788 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12789 part of a declaration-statement. */
12791 static void
12794 {
12798 /* Check for the `__extension__' keyword. */
12800 {
12801 /* Parse the qualified declaration. */
12803 /* Restore the PEDANTIC flag. */
12807 }
12809 /* Peek at the next token to figure out which kind of declaration is
12810 present. */
12813 /* If the next keyword is `asm', we have an asm-definition. */
12815 {
12819 }
12820 /* If the next keyword is `namespace', we have a
12821 namespace-alias-definition. */
12824 /* If the next keyword is `using', we have a
12825 using-declaration, a using-directive, or an alias-declaration. */
12827 {
12832 /* If the token after `using' is `namespace', then we have a
12833 using-directive. */
12837 /* If the second token after 'using' is '=', then we have an
12838 alias-declaration. */
12844 /* Otherwise, it's a using-declaration. */
12845 else
12848 }
12849 /* If the next keyword is `__label__' we have a misplaced label
12850 declaration. */
12852 {
12856 /* If the next token is now a `;', consume it. */
12859 }
12860 /* If the next token is `static_assert' we have a static assertion. */
12863 /* Anything else must be a simple-declaration. */
12864 else
12867 }
12869 /* Parse a simple-declaration.
12871 simple-declaration:
12872 decl-specifier-seq [opt] init-declarator-list [opt] ;
12873 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12874 brace-or-equal-initializer ;
12876 init-declarator-list:
12877 init-declarator
12878 init-declarator-list , init-declarator
12880 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12881 function-definition as a simple-declaration.
12883 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12884 parsed declaration if it is an uninitialized single declarator not followed
12885 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12886 if present, will not be consumed. */
12888 static void
12892 {
12893 cp_decl_specifier_seq decl_specifiers;
12902 /* Defer access checks until we know what is being declared; the
12903 checks for names appearing in the decl-specifier-seq should be
12904 done as if we were in the scope of the thing being declared. */
12907 /* Parse the decl-specifier-seq. We have to keep track of whether
12908 or not the decl-specifier-seq declares a named class or
12909 enumeration type, since that is the only case in which the
12910 init-declarator-list is allowed to be empty.
12912 [dcl.dcl]
12914 In a simple-declaration, the optional init-declarator-list can be
12915 omitted only when declaring a class or enumeration, that is when
12916 the decl-specifier-seq contains either a class-specifier, an
12917 elaborated-type-specifier, or an enum-specifier. */
12919 CP_PARSER_FLAGS_OPTIONAL,
12922 /* We no longer need to defer access checks. */
12925 /* In a block scope, a valid declaration must always have a
12926 decl-specifier-seq. By not trying to parse declarators, we can
12927 resolve the declaration/expression ambiguity more quickly. */
12930 {
12933 }
12935 /* If the next two tokens are both identifiers, the code is
12936 erroneous. The usual cause of this situation is code like:
12938 T t;
12940 where "T" should name a type -- but does not. */
12943 {
12944 /* If parsing tentatively, we should commit; we really are
12945 looking at a declaration. */
12947 /* Give up. */
12949 }
12951 /* If we have seen at least one decl-specifier, and the next token
12952 is not a parenthesis, then we must be looking at a declaration.
12953 (After "int (" we might be looking at a functional cast.) */
12960 /* Look for C++17 decomposition declaration. */
12968 {
12969 tree decl
12971 maybe_range_for_decl,
12974 /* The next token should be either a `,' or a `;'. */
12976 /* If it's a `;', we are done. */
12979 /* Anything else is an error. */
12980 else
12981 {
12982 /* If we have already issued an error message we don't need
12983 to issue another one. */
12988 /* Skip tokens until we reach the end of the statement. */
12990 /* If the next token is now a `;', consume it. */
12994 }
12995 }
12996 else
12999 tree last_type;
13001 /* NULL_TREE if both variable and function declaration are allowed,
13002 error_mark_node if function declaration are not allowed and
13003 a FUNCTION_DECL that should be diagnosed if it is followed by
13004 variable declarations. */
13005 tree auto_function_declaration;
13008 auto_specifier_p
13012 /* Keep going until we hit the `;' at the end of the simple
13013 declaration. */
13016 CPP_SEMICOLON))
13017 {
13020 tree decl;
13024 {
13025 /* If we are processing next declarator, comma is expected */
13030 {
13034 }
13035 }
13036 else
13039 /* Parse the init-declarator. */
13042 function_definition_allowed_p,
13044 declares_class_or_enum,
13046 maybe_range_for_decl,
13049 /* If an error occurred while parsing tentatively, exit quickly.
13050 (That usually happens when in the body of a function; each
13051 statement is treated as a declaration-statement until proven
13052 otherwise.) */
13057 {
13058 /* If the init-declarator-list contains more than one
13059 init-declarator, they shall all form declarations of
13060 variables. */
13062 auto_function_declaration
13066 {
13068 "non-variable %qD in declaration with more than one "
13073 }
13074 }
13078 {
13082 {
13083 /* If the list of declarators contains more than one declarator,
13084 the type of each declared variable is determined as described
13085 above. If the type deduced for the template parameter U is not
13086 the same in each deduction, the program is ill-formed. */
13091 }
13092 else
13094 }
13096 /* Handle function definitions specially. */
13098 {
13099 /* If the next token is a `,', then we are probably
13100 processing something like:
13102 void f() {}, *p;
13104 which is erroneous. */
13106 {
13109 "mixing"
13111 }
13112 /* Otherwise, we're done with the list of declarators. */
13113 else
13114 {
13117 }
13118 }
13121 /* The next token should be either a `,' or a `;'. */
13123 /* If it's a `,', there are more declarators to come. */
13126 /* If it's a `;', we are done. */
13130 {
13135 }
13136 /* Anything else is an error. */
13137 else
13138 {
13139 /* If we have already issued an error message we don't need
13140 to issue another one. */
13145 /* Skip tokens until we reach the end of the statement. */
13147 /* If the next token is now a `;', consume it. */
13151 }
13152 /* After the first time around, a function-definition is not
13153 allowed -- even if it was OK at first. For example:
13155 int i, f() {}
13157 is not valid. */
13159 }
13161 /* Issue an error message if no declarators are present, and the
13162 decl-specifier-seq does not itself declare a class or
13163 enumeration: [dcl.dcl]/3. */
13165 {
13167 {
13171 /* Ensure an error is issued anyway when finish_decltype_type,
13172 called via cp_parser_decl_specifier_seq, returns a class or
13173 an enumeration (c++/51786). */
13176 }
13177 /* Perform any deferred access checks. */
13179 }
13181 /* Consume the `;'. */
13182 finish:
13186 {
13192 }
13194 done:
13196 }
13198 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13199 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13200 initializer ; */
13202 static tree
13207 {
13212 /* Parse the identifier-list. */
13216 {
13224 }
13228 {
13234 else
13235 {
13238 }
13239 }
13245 tree pushed_scope;
13252 NULL_TREE);
13259 cp_expr e;
13260 cp_decl_specifier_seq decl_specs;
13265 {
13268 else
13271 tree elt_pushed_scope;
13277 {
13278 /* Ensure we've diagnosed redeclaration if we aren't creating
13279 a new VAR_DECL. */
13282 }
13283 else
13287 }
13290 {
13293 }
13297 {
13305 || (is_direct_init
13308 {
13312 }
13315 {
13320 }
13321 }
13323 {
13325 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13326 the underlying DECL. */
13328 }
13334 {
13337 }
13340 }
13342 /* Parse a decl-specifier-seq.
13344 decl-specifier-seq:
13345 decl-specifier-seq [opt] decl-specifier
13346 decl-specifier attribute-specifier-seq [opt] (C++11)
13348 decl-specifier:
13349 storage-class-specifier
13350 type-specifier
13351 function-specifier
13352 friend
13353 typedef
13355 GNU Extension:
13357 decl-specifier:
13358 attributes
13360 Concepts Extension:
13362 decl-specifier:
13363 concept
13365 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13367 The parser flags FLAGS is used to control type-specifier parsing.
13369 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13370 flags:
13372 1: one of the decl-specifiers is an elaborated-type-specifier
13373 (i.e., a type declaration)
13374 2: one of the decl-specifiers is an enum-specifier or a
13375 class-specifier (i.e., a type definition)
13377 */
13379 static void
13381 cp_parser_flags flags,
13384 {
13388 cp_decl_spec ds;
13390 /* Clear DECL_SPECS. */
13393 /* Assume no class or enumeration type is declared. */
13396 /* Keep reading specifiers until there are no more to read. */
13398 {
13403 /* Peek at the next token. */
13406 /* Save the first token of the decl spec list for error
13407 reporting. */
13410 /* Handle attributes. */
13412 {
13413 /* Parse the attributes. */
13416 /* In a sequence of declaration specifiers, c++11 attributes
13417 appertain to the type that precede them. In that case
13418 [dcl.spec]/1 says:
13420 The attribute-specifier-seq affects the type only for
13421 the declaration it appears in, not other declarations
13422 involving the same type.
13424 But for now let's force the user to position the
13425 attribute either at the beginning of the declaration or
13426 after the declarator-id, which would clearly mean that it
13427 applies to the declarator. */
13429 {
13431 /* The c++11 attribute is at the beginning of the
13432 declaration. It appertains to the entity being
13434 else
13435 {
13437 {
13438 /* This is an attribute following a
13439 class-specifier. */
13444 }
13445 else
13446 {
13447 decl_specs->std_attributes
13451 }
13453 }
13454 }
13456 decl_specs->attributes
13461 }
13462 /* Assume we will find a decl-specifier keyword. */
13464 /* If the next token is an appropriate keyword, we can simply
13465 add it to the list. */
13467 {
13468 /* decl-specifier:
13469 friend
13470 constexpr */
13473 {
13478 }
13479 else
13480 {
13482 /* Consume the token. */
13484 }
13497 /* function-specifier:
13498 inline
13499 virtual
13500 explicit */
13507 /* decl-specifier:
13508 typedef */
13511 /* Consume the token. */
13513 /* A constructor declarator cannot appear in a typedef. */
13515 /* The "typedef" keyword can only occur in a declaration; we
13516 may as well commit at this point. */
13523 /* storage-class-specifier:
13524 auto
13525 register
13526 static
13527 extern
13528 mutable
13530 GNU Extension:
13531 thread */
13534 {
13535 /* Consume the token. */
13538 /* Complain about `auto' as a storage specifier, if
13539 we're complaining about C++0x compatibility. */
13543 "%<auto%> changes meaning in C++11; "
13546 /* Set the storage class anyway. */
13548 token);
13549 }
13550 else
13551 /* C++0x auto type-specifier. */
13559 /* Consume the token. */
13562 token);
13565 /* Consume the token. */
13571 /* We did not yet find a decl-specifier yet. */
13574 }
13591 /* Constructors are a special case. The `S' in `S()' is not a
13592 decl-specifier; it is the beginning of the declarator. */
13593 constructor_p
13594 = (!found_decl_spec
13595 && constructor_possible_p
13596 && (cp_parser_constructor_declarator_p
13599 /* If we don't have a DECL_SPEC yet, then we must be looking at
13600 a type-specifier. */
13602 {
13605 tree type_spec;
13607 type_spec
13609 decl_specs,
13615 /* If this type-specifier referenced a user-defined type
13616 (a typedef, class-name, etc.), then we can't allow any
13617 more such type-specifiers henceforth.
13619 [dcl.spec]
13621 The longest sequence of decl-specifiers that could
13622 possibly be a type name is taken as the
13623 decl-specifier-seq of a declaration. The sequence shall
13624 be self-consistent as described below.
13626 [dcl.type]
13628 As a general rule, at most one type-specifier is allowed
13629 in the complete decl-specifier-seq of a declaration. The
13630 only exceptions are the following:
13632 -- const or volatile can be combined with any other
13633 type-specifier.
13635 -- signed or unsigned can be combined with char, long,
13636 short, or int.
13638 -- ..
13640 Example:
13642 typedef char* Pc;
13643 void g (const int Pc);
13645 Here, Pc is *not* part of the decl-specifier seq; it's
13646 the declarator. Therefore, once we see a type-specifier
13647 (other than a cv-qualifier), we forbid any additional
13648 user-defined types. We *do* still allow things like `int
13649 int' to be considered a decl-specifier-seq, and issue the
13650 error message later. */
13653 /* A constructor declarator cannot follow a type-specifier. */
13655 {
13660 }
13661 }
13663 /* If we still do not have a DECL_SPEC, then there are no more
13664 decl-specifiers. */
13669 /* After we see one decl-specifier, further decl-specifiers are
13670 always optional. */
13672 }
13674 /* Don't allow a friend specifier with a class definition. */
13679 }
13681 /* Parse an (optional) storage-class-specifier.
13683 storage-class-specifier:
13684 auto
13685 register
13686 static
13687 extern
13688 mutable
13690 GNU Extension:
13692 storage-class-specifier:
13693 thread
13695 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13697 static tree
13699 {
13701 {
13705 /* Fall through for C++98. */
13713 /* Consume the token. */
13718 }
13719 }
13721 /* Parse an (optional) function-specifier.
13723 function-specifier:
13724 inline
13725 virtual
13726 explicit
13728 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13729 Updates DECL_SPECS, if it is non-NULL. */
13731 static tree
13734 {
13737 {
13743 /* 14.5.2.3 [temp.mem]
13745 A member function template shall not be virtual. */
13749 else
13759 }
13761 /* Consume the token. */
13763 }
13765 /* Parse a linkage-specification.
13767 linkage-specification:
13768 extern string-literal { declaration-seq [opt] }
13769 extern string-literal declaration */
13771 static void
13773 {
13774 tree linkage;
13776 /* Look for the `extern' keyword. */
13777 cp_token *extern_token
13780 /* Look for the string-literal. */
13784 /* Transform the literal into an identifier. If the literal is a
13785 wide-character string, or contains embedded NULs, then we can't
13786 handle it as the user wants. */
13789 {
13791 /* Assume C++ linkage. */
13793 }
13794 else
13797 /* We're now using the new linkage. */
13800 /* Preserve the location of the the innermost linkage specification,
13801 tracking the locations of nested specifications via a local. */
13802 location_t saved_location
13804 /* Construct a location ranging from the start of the "extern" to
13805 the end of the string-literal, with the caret at the start, e.g.:
13806 extern "C" {
13807 ^~~~~~~~~~
13808 */
13809 parser->innermost_linkage_specification_location
13814 /* If the next token is a `{', then we're using the first
13815 production. */
13817 {
13821 /* Consume the `{' token. */
13822 matching_braces braces;
13824 /* Parse the declarations. */
13826 /* Look for the closing `}'. */
13828 }
13829 /* Otherwise, there's just one declaration. */
13830 else
13831 {
13834 saved_in_unbraced_linkage_specification_p
13838 parser->in_unbraced_linkage_specification_p
13840 }
13842 /* We're done with the linkage-specification. */
13845 /* Restore location of parent linkage specification, if any. */
13847 }
13849 /* Parse a static_assert-declaration.
13851 static_assert-declaration:
13852 static_assert ( constant-expression , string-literal ) ;
13853 static_assert ( constant-expression ) ; (C++17)
13855 If MEMBER_P, this static_assert is a class member. */
13857 static void
13859 {
13860 cp_expr condition;
13861 location_t token_loc;
13862 tree message;
13865 /* Peek at the `static_assert' token so we can keep track of exactly
13866 where the static assertion started. */
13869 /* Look for the `static_assert' keyword. */
13871 RT_STATIC_ASSERT))
13874 /* We know we are in a static assertion; commit to any tentative
13875 parse. */
13879 /* Parse the `(' starting the static assertion condition. */
13880 matching_parens parens;
13883 /* Parse the constant-expression. Allow a non-constant expression
13884 here in order to give better diagnostics in finish_static_assert. */
13885 condition =
13891 {
13894 "static_assert without a message "
13896 /* Eat the ')' */
13901 }
13902 else
13903 {
13904 /* Parse the separating `,'. */
13907 /* Parse the string-literal message. */
13912 /* A `)' completes the static assertion. */
13918 }
13920 /* A semicolon terminates the declaration. */
13923 /* Get the location for the static assertion. Use that of the
13924 condition if available, otherwise, use that of the "static_assert"
13925 token. */
13930 /* Complete the static assertion, which may mean either processing
13931 the static assert now or saving it for template instantiation. */
13933 }
13935 /* Parse the expression in decltype ( expression ). */
13937 static tree
13940 {
13942 tree expr;
13944 /* Since we're going to preserve any side-effects from this parse, set up a
13945 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13946 in the expression. */
13949 /* First, try parsing an id-expression. */
13960 {
13963 cp_id_kind idk;
13967 /* Lookup the name we got back from the id-expression. */
13977 {
13978 /* Complete lookup of the id-expression. */
13979 expr = (finish_id_expression
13992 /* We found an id-expression, but it was something that we
13993 should not have found. This is an error, not something
13994 we can recover from, so note that we found an
13995 id-expression and we'll recover as gracefully as
13996 possible. */
13998 }
14003 /* We have an id-expression. */
14005 }
14008 {
14009 /* Abort the id-expression parse. */
14012 /* Parsing tentatively, again. */
14015 /* Parse a class member access. */
14023 /* We have an id-expression. */
14025 }
14028 /* We have parsed the complete id-expression or member access. */
14030 else
14031 {
14032 /* Abort our attempt to parse an id-expression or member access
14033 expression. */
14036 /* Parse a full expression. */
14039 }
14042 }
14044 /* Parse a `decltype' type. Returns the type.
14046 simple-type-specifier:
14047 decltype ( expression )
14048 C++14 proposal:
14049 decltype ( auto ) */
14051 static tree
14053 {
14058 {
14059 /* Already parsed. */
14062 }
14064 /* Look for the `decltype' token. */
14068 /* Parse the opening `('. */
14069 matching_parens parens;
14079 /* decltype (auto) */
14081 else
14082 {
14083 /* decltype (expression) */
14085 /* Types cannot be defined in a `decltype' expression. Save away the
14086 old message and set the new one. */
14088 parser->type_definition_forbidden_message
14091 /* The restrictions on constant-expressions do not apply inside
14092 decltype expressions. */
14093 bool saved_integral_constant_expression_p
14095 bool saved_non_integral_constant_expression_p
14099 /* Within a parenthesized expression, a `>' token is always
14100 the greater-than operator. */
14101 bool saved_greater_than_is_operator_p
14105 /* Do not actually evaluate the expression. */
14108 /* Do not warn about problems with the expression. */
14113 /* Go back to evaluating expressions. */
14117 /* The `>' token might be the end of a template-id or
14118 template-parameter-list now. */
14119 parser->greater_than_is_operator_p
14122 /* Restore the old message and the integral constant expression
14123 flags. */
14125 parser->integral_constant_expression_p
14127 parser->non_integral_constant_expression_p
14129 }
14131 /* Parse to the closing `)'. */
14133 {
14138 }
14141 {
14142 /* Build auto. */
14145 }
14146 else
14148 tf_warning_or_error);
14150 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14151 it again. */
14162 }
14164 /* Special member functions [gram.special] */
14166 /* Parse a conversion-function-id.
14168 conversion-function-id:
14169 operator conversion-type-id
14171 Returns an IDENTIFIER_NODE representing the operator. */
14173 static tree
14175 {
14176 tree type;
14177 tree saved_scope;
14178 tree saved_qualifying_scope;
14179 tree saved_object_scope;
14182 /* Look for the `operator' token. */
14185 /* When we parse the conversion-type-id, the current scope will be
14186 reset. However, we need that information in able to look up the
14187 conversion function later, so we save it here. */
14191 /* We must enter the scope of the class so that the names of
14192 entities declared within the class are available in the
14193 conversion-type-id. For example, consider:
14195 struct S {
14196 typedef int I;
14197 operator I();
14198 };
14200 S::operator I() { ... }
14202 In order to see that `I' is a type-name in the definition, we
14203 must be in the scope of `S'. */
14206 /* Parse the conversion-type-id. */
14208 /* Leave the scope of the class, if any. */
14211 /* Restore the saved scope. */
14215 /* If the TYPE is invalid, indicate failure. */
14219 }
14221 /* Parse a conversion-type-id:
14223 conversion-type-id:
14224 type-specifier-seq conversion-declarator [opt]
14226 Returns the TYPE specified. */
14228 static tree
14230 {
14231 tree attributes;
14232 cp_decl_specifier_seq type_specifiers;
14234 tree type_specified;
14237 /* Parse the attributes. */
14241 parser->type_definition_forbidden_message
14244 /* Parse the type-specifiers. */
14251 /* If that didn't work, stop. */
14254 /* Parse the conversion-declarator. */
14262 /* Don't give this error when parsing tentatively. This happens to
14263 work because we always parse this definitively once. */
14266 {
14268 {
14271 }
14275 }
14278 }
14280 /* Parse an (optional) conversion-declarator.
14282 conversion-declarator:
14283 ptr-operator conversion-declarator [opt]
14285 */
14289 {
14292 cp_cv_quals cv_quals;
14294 /* We don't know if there's a ptr-operator next, or not. */
14296 /* Try the ptr-operator. */
14299 /* If it worked, look for more conversion-declarators. */
14301 {
14304 /* Parse another optional declarator. */
14307 declarator = cp_parser_make_indirect_declarator
14311 }
14314 }
14316 /* Parse an (optional) ctor-initializer.
14318 ctor-initializer:
14319 : mem-initializer-list */
14321 static void
14323 {
14324 /* If the next token is not a `:', then there is no
14325 ctor-initializer. */
14327 {
14328 /* Do default initialization of any bases and members. */
14332 }
14334 /* Consume the `:' token. */
14336 /* And the mem-initializer-list. */
14338 }
14340 /* Parse a mem-initializer-list.
14342 mem-initializer-list:
14343 mem-initializer ... [opt]
14344 mem-initializer ... [opt] , mem-initializer-list */
14346 static void
14348 {
14353 /* Let the semantic analysis code know that we are starting the
14354 mem-initializer-list. */
14359 /* Loop through the list. */
14361 {
14362 tree mem_initializer;
14365 /* Parse the mem-initializer. */
14367 /* If the next token is a `...', we're expanding member initializers. */
14369 {
14370 /* Consume the `...'. */
14373 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14374 can be expanded but members cannot. */
14377 {
14382 }
14384 /* Construct the pack expansion type. */
14387 }
14390 {
14394 }
14395 /* Look for a target constructor. */
14399 {
14402 {
14406 }
14408 }
14409 /* Add it to the list, unless it was erroneous. */
14411 {
14414 }
14415 /* If the next token is not a `,', we're done. */
14418 /* Consume the `,' token. */
14420 }
14422 /* Perform semantic analysis. */
14425 }
14427 /* Parse a mem-initializer.
14429 mem-initializer:
14430 mem-initializer-id ( expression-list [opt] )
14431 mem-initializer-id braced-init-list
14433 GNU extension:
14435 mem-initializer:
14436 ( expression-list [opt] )
14438 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14439 class) or FIELD_DECL (for a non-static data member) to initialize;
14440 the TREE_VALUE is the expression-list. An empty initialization
14441 list is represented by void_list_node. */
14443 static tree
14445 {
14446 tree mem_initializer_id;
14447 tree expression_list;
14448 tree member;
14451 /* Find out what is being initialized. */
14453 {
14457 }
14458 else
14459 {
14463 }
14469 {
14476 }
14477 else
14478 {
14488 }
14498 }
14500 /* Parse a mem-initializer-id.
14502 mem-initializer-id:
14503 :: [opt] nested-name-specifier [opt] class-name
14504 decltype-specifier (C++11)
14505 identifier
14507 Returns a TYPE indicating the class to be initialized for the first
14508 production (and the second in C++11). Returns an IDENTIFIER_NODE
14509 indicating the data member to be initialized for the last production. */
14511 static tree
14513 {
14517 tree id;
14521 /* `typename' is not allowed in this context ([temp.res]). */
14523 {
14525 "keyword %<typename%> not allowed in this context (a qualified "
14528 }
14529 /* Look for the optional `::' operator. */
14530 global_scope_p
14534 /* Look for the optional nested-name-specifier. The simplest way to
14535 implement:
14537 [temp.res]
14539 The keyword `typename' is not permitted in a base-specifier or
14540 mem-initializer; in these contexts a qualified name that
14541 depends on a template-parameter is implicitly assumed to be a
14542 type name.
14544 is to assume that we have seen the `typename' keyword at this
14545 point. */
14546 nested_name_specifier_p
14555 /* If there is a `::' operator or a nested-name-specifier, then we
14556 are definitely looking for a class-name. */
14561 typename_type,
14565 /* Otherwise, we could also be looking for an ordinary identifier. */
14568 /* Try a decltype-specifier. */
14570 else
14571 /* Otherwise, try a class-name. */
14575 none_type,
14579 /* If we found one, we're done. */
14582 /* Otherwise, look for an ordinary identifier. */
14584 }
14586 /* Overloading [gram.over] */
14588 /* Parse an operator-function-id.
14590 operator-function-id:
14591 operator operator
14593 Returns an IDENTIFIER_NODE for the operator which is a
14594 human-readable spelling of the identifier, e.g., `operator +'. */
14596 static cp_expr
14598 {
14599 /* Look for the `operator' keyword. */
14602 /* And then the name of the operator itself. */
14604 }
14606 /* Return an identifier node for a user-defined literal operator.
14607 The suffix identifier is chained to the operator name identifier. */
14609 tree
14611 {
14612 tree identifier;
14619 }
14621 /* Parse an operator.
14623 operator:
14624 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14625 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14626 || ++ -- , ->* -> () []
14628 GNU Extensions:
14630 operator:
14631 <? >? <?= >?=
14633 Returns an IDENTIFIER_NODE for the operator which is a
14634 human-readable spelling of the identifier, e.g., `operator +'. */
14636 static cp_expr
14638 {
14643 /* Peek at the next token. */
14648 /* Figure out which operator we have. */
14653 {
14655 {
14656 /* The keyword should be either `new' or `delete'. */
14661 else
14664 /* Consume the `new' or `delete' token. */
14667 /* Peek at the next token. */
14669 /* If it's a `[' token then this is the array variant of the
14670 operator. */
14672 {
14673 /* Consume the `[' token. */
14675 /* Look for the `]' token. */
14680 }
14684 }
14842 {
14843 /* Consume the `('. */
14844 matching_parens parens;
14846 /* Look for the matching `)'. */
14851 }
14854 /* Consume the `['. */
14856 /* Look for the matching `]'. */
14865 /* FALLTHRU */
14874 {
14881 /* Consume the string. */
14887 {
14890 }
14891 else
14892 {
14894 /* Look for the suffix identifier. */
14899 {
14903 }
14904 else
14905 {
14908 }
14909 }
14914 {
14917 }
14920 {
14923 }
14925 {
14928 }
14930 }
14933 /* Anything else is an error. */
14935 }
14937 /* If we have selected an identifier, we need to consume the
14938 operator token. */
14940 {
14944 }
14945 /* Otherwise, no valid operator name was present. */
14946 else
14947 {
14950 }
14953 }
14955 /* Parse a template-declaration.
14957 template-declaration:
14958 export [opt] template < template-parameter-list > declaration
14960 If MEMBER_P is TRUE, this template-declaration occurs within a
14961 class-specifier.
14963 The grammar rule given by the standard isn't correct. What
14964 is really meant is:
14966 template-declaration:
14967 export [opt] template-parameter-list-seq
14968 decl-specifier-seq [opt] init-declarator [opt] ;
14969 export [opt] template-parameter-list-seq
14970 function-definition
14972 template-parameter-list-seq:
14973 template-parameter-list-seq [opt]
14974 template < template-parameter-list >
14976 Concept Extensions:
14978 template-parameter-list-seq:
14979 template < template-parameter-list > requires-clause [opt]
14981 requires-clause:
14982 requires logical-or-expression */
14984 static void
14986 {
14987 /* Check for `export'. */
14989 {
14990 /* Consume the `export' token. */
14992 /* Warn that we do not support `export'. */
14994 }
14997 }
14999 /* Parse a template-parameter-list.
15001 template-parameter-list:
15002 template-parameter
15003 template-parameter-list , template-parameter
15005 Returns a TREE_LIST. Each node represents a template parameter.
15006 The nodes are connected via their TREE_CHAINs. */
15008 static tree
15010 {
15015 /* The loop below parses the template parms. We first need to know
15016 the total number of template parms to be able to compute proper
15017 canonical types of each dependent type. So after the loop, when
15018 we know the total number of template parms,
15019 end_template_parm_list computes the proper canonical types and
15020 fixes up the dependent types accordingly. */
15022 {
15023 tree parameter;
15026 location_t parm_loc;
15028 /* Parse the template-parameter. */
15033 /* Add it to the list. */
15036 parm_loc,
15037 parameter,
15038 is_non_type,
15039 is_parameter_pack);
15040 else
15041 {
15044 }
15046 /* If the next token is not a `,', we're done. */
15049 /* Otherwise, consume the `,' token. */
15051 }
15054 }
15056 /* Parse a introduction-list.
15058 introduction-list:
15059 introduced-parameter
15060 introduction-list , introduced-parameter
15062 introduced-parameter:
15063 ...[opt] identifier
15065 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15066 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15067 WILDCARD_DECL will also have DECL_NAME set and token location in
15068 DECL_SOURCE_LOCATION. */
15070 static tree
15072 {
15076 {
15081 /* Build placeholder. */
15089 /* If the next token is not a `,', we're done. */
15092 /* Otherwise, consume the `,' token. */
15094 }
15096 /* Convert the vec into a TREE_VEC. */
15099 tree parm;
15105 }
15107 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15108 is an abstract declarator. */
15112 {
15117 }
15119 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15120 is an abstract declarator. */
15124 {
15128 else
15130 }
15132 /* Returns true if DECL represents a constrained-parameter. */
15136 {
15141 }
15143 /* Returns true if PARM declares a constrained-parameter. */
15147 {
15149 }
15151 /* Check that the type parameter is only a declarator-id, and that its
15152 type is not cv-qualified. */
15154 bool
15157 {
15162 {
15165 }
15167 /* Don't allow cv-qualified type parameters. */
15170 {
15173 }
15176 }
15178 /* Finish parsing/processing a template type parameter and checking
15179 various restrictions. */
15183 tree id,
15185 {
15188 else
15190 }
15192 static tree
15194 {
15195 /* FIXME: This should probably be copied, and we may need to adjust
15196 the template parameter depths. */
15206 }
15208 /* Finish parsing/processing a template template parameter by borrowing
15209 the template parameter list from the prototype parameter. */
15211 static tree
15213 tree proto,
15214 tree id,
15216 {
15220 }
15222 /* Create a new non-type template parameter from the given PARM
15223 declarator. */
15225 static tree
15228 {
15234 }
15236 /* Build a constrained template parameter based on the PARMDECL
15237 declarator. The type of PARMDECL is the constrained type, which
15238 refers to the prototype template parameter that ultimately
15239 specifies the type of the declared parameter. */
15241 static tree
15246 {
15252 /* A template parameter constrained by a variadic concept shall also
15253 be declared as a template parameter pack. */
15258 /* Build the parameter. Return an error if the declarator was invalid. */
15259 tree parm;
15264 parmdecl);
15265 else
15270 /* Finish the parameter decl and create a node attaching the
15271 default argument and constraint. */
15276 }
15278 /* Returns true if the parsed type actually represents the declaration
15279 of a type template-parameter. */
15283 {
15286 }
15289 /* Returns true if the parsed type actually represents the declaration of
15290 a template template-parameter. */
15292 static bool
15294 {
15297 }
15299 /* Parse a default argument for a type template-parameter.
15300 Note that diagnostics are handled in cp_parser_template_parameter. */
15302 static tree
15304 {
15307 /* Consume the `=' token. */
15312 /* Parse the default-argument. */
15318 {
15322 }
15325 }
15327 /* Parse a default argument for a template template-parameter. */
15329 static tree
15331 {
15336 /* Consume the `='. */
15338 /* Parse the id-expression. */
15340 /* save token before parsing the id-expression, for error
15341 reporting */
15343 tree default_argument
15351 /* If the id-expression was a template-id that refers to
15352 a template-class, we already have the declaration here,
15353 so no further lookup is needed. */
15354 ;
15355 else
15356 /* Look up the name. */
15357 default_argument
15359 none_type,
15365 /* See if the default argument is valid. */
15369 }
15371 /* Parse a template-parameter.
15373 template-parameter:
15374 type-parameter
15375 parameter-declaration
15377 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15378 the parameter. The TREE_PURPOSE is the default value, if any.
15379 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15380 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15381 set to true iff this parameter is a parameter pack. */
15383 static tree
15386 {
15389 tree parm;
15391 /* Assume it is a type parameter or a template parameter. */
15393 /* Assume it not a parameter pack. */
15395 /* Peek at the next token. */
15397 /* If it is `template', we have a type-parameter. */
15400 /* If it is `class' or `typename' we do not know yet whether it is a
15401 type parameter or a non-type parameter. Consider:
15403 template <typename T, typename T::X X> ...
15405 or:
15407 template <class C, class D*> ...
15409 Here, the first parameter is a type parameter, and the second is
15410 a non-type parameter. We can tell by looking at the token after
15411 the identifier -- if it is a `,', `=', or `>' then we have a type
15412 parameter. */
15414 {
15415 /* Peek at the token after `class' or `typename'. */
15417 /* If it's an ellipsis, we have a template type parameter
15418 pack. */
15421 /* If it's an identifier, skip it. */
15424 /* Now, see if the token looks like the end of a template
15425 parameter. */
15430 }
15432 /* Otherwise, it is a non-type parameter or a constrained parameter.
15434 [temp.param]
15436 When parsing a default template-argument for a non-type
15437 template-parameter, the first non-nested `>' is taken as the end
15438 of the template parameter-list rather than a greater-than
15439 operator. */
15440 parameter_declarator
15447 /* If the parameter declaration is marked as a parameter pack, set
15448 *IS_PARAMETER_PACK to notify the caller. */
15453 {
15454 /* Can happen in some cases of erroneous input (c++/34892). */
15456 /* Consume the `...' for better error recovery. */
15458 }
15460 // The parameter may have been constrained.
15463 parameter_declarator,
15464 is_non_type,
15465 is_parameter_pack);
15467 // Now we're sure that the parameter is a non-type parameter.
15478 }
15480 /* Parse a type-parameter.
15482 type-parameter:
15483 class identifier [opt]
15484 class identifier [opt] = type-id
15485 typename identifier [opt]
15486 typename identifier [opt] = type-id
15487 template < template-parameter-list > class identifier [opt]
15488 template < template-parameter-list > class identifier [opt]
15489 = id-expression
15491 GNU Extension (variadic templates):
15493 type-parameter:
15494 class ... identifier [opt]
15495 typename ... identifier [opt]
15497 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15498 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15499 the declaration of the parameter.
15501 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15503 static tree
15505 {
15507 tree parameter;
15509 /* Look for a keyword to tell us what kind of parameter this is. */
15515 {
15518 {
15519 tree identifier;
15520 tree default_argument;
15522 /* If the next token is an ellipsis, we have a template
15523 argument pack. */
15525 {
15526 /* Consume the `...' token. */
15531 }
15533 /* If the next token is an identifier, then it names the
15534 parameter. */
15537 else
15540 /* Create the parameter. */
15543 /* If the next token is an `=', we have a default argument. */
15545 {
15546 default_argument
15549 /* Template parameter packs cannot have default
15550 arguments. */
15552 {
15555 "template parameter pack %qD cannot have a "
15557 else
15559 "template parameter packs cannot have "
15562 }
15565 }
15566 else
15569 /* Create the combined representation of the parameter and the
15570 default argument. */
15572 }
15576 {
15577 tree identifier;
15578 tree default_argument;
15580 /* Look for the `<'. */
15582 /* Parse the template-parameter-list. */
15584 /* Look for the `>'. */
15587 // If template requirements are present, parse them.
15589 {
15594 }
15596 /* Look for the `class' or 'typename' keywords. */
15598 /* If the next token is an ellipsis, we have a template
15599 argument pack. */
15601 {
15602 /* Consume the `...' token. */
15607 }
15608 /* If the next token is an `=', then there is a
15609 default-argument. If the next token is a `>', we are at
15610 the end of the parameter-list. If the next token is a `,',
15611 then we are at the end of this parameter. */
15615 {
15617 /* Treat invalid names as if the parameter were nameless. */
15620 }
15621 else
15624 /* Create the template parameter. */
15626 identifier);
15628 /* If the next token is an `=', then there is a
15629 default-argument. */
15631 {
15632 default_argument
15635 /* Template parameter packs cannot have default
15636 arguments. */
15638 {
15641 "template parameter pack %qD cannot "
15643 identifier);
15644 else
15648 }
15649 }
15650 else
15653 /* Create the combined representation of the parameter and the
15654 default argument. */
15656 }
15662 }
15665 }
15667 /* Parse a template-id.
15669 template-id:
15670 template-name < template-argument-list [opt] >
15672 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15673 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15674 returned. Otherwise, if the template-name names a function, or set
15675 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15676 names a class, returns a TYPE_DECL for the specialization.
15678 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15679 uninstantiated templates. */
15681 static tree
15687 {
15688 tree templ;
15689 tree arguments;
15690 tree template_id;
15695 /* If the next token corresponds to a template-id, there is no need
15696 to reparse it. */
15699 {
15702 }
15704 /* Avoid performing name lookup if there is no possibility of
15705 finding a template-id. */
15708 && !cp_parser_nth_token_starts_template_argument_list_p
15710 {
15713 }
15715 /* Remember where the template-id starts. */
15721 /* Parse the template-name. */
15724 check_dependency_p,
15725 is_declaration,
15726 tag_type,
15729 {
15732 }
15734 /* Since we're going to preserve any side-effects from this parse, set up a
15735 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15736 in the template arguments. */
15739 /* If we find the sequence `[:' after a template-name, it's probably
15740 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15741 parse correctly the argument list. */
15748 {
15750 /* Change `:' into `::'. */
15752 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15753 CPP_LESS. */
15756 /* Parse the arguments. */
15759 {
15760 /* If we couldn't parse an argument list, then we revert our changes
15761 and return simply an error. Maybe this is not a template-id
15762 after all. */
15767 }
15768 /* Otherwise, emit an error about the invalid digraph, but continue
15769 parsing because we got our argument list. */
15772 {
15775 "%<<:%> is an alternate spelling for %<[%>."
15778 {
15780 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15783 }
15784 }
15785 }
15786 else
15787 {
15788 /* Look for the `<' that starts the template-argument-list. */
15790 {
15793 }
15794 /* Parse the arguments. */
15796 }
15798 /* Set the location to be of the form:
15799 template-name < template-argument-list [opt] >
15800 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15801 with caret == start at the start of the template-name,
15802 ranging until the closing '>'. */
15803 location_t finish_loc
15805 location_t combined_loc
15808 /* Build a representation of the specialization. */
15811 TEMPLATE_ID_EXPR,
15815 {
15817 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15818 template (rather than some instantiation thereof) only if
15819 is not nested within some other construct. For example, in
15820 "template <typename T> void f(T) { A<T>::", A<T> is just an
15821 instantiation of A. */
15824 CPP_SCOPE));
15825 template_id
15827 }
15828 /* A template-like identifier may be a partial concept id. */
15834 {
15838 }
15839 else
15840 {
15841 /* If it's not a class-template or a template-template, it should be
15842 a function-template. */
15850 }
15852 /* If parsing tentatively, replace the sequence of tokens that makes
15853 up the template-id with a CPP_TEMPLATE_ID token. That way,
15854 should we re-parse the token stream, we will not have to repeat
15855 the effort required to do the parse, nor will we issue duplicate
15856 error messages about problems during instantiation of the
15857 template. */
15859 /* Don't do this if we had a parse error in a declarator; re-parsing
15860 might succeed if a name changes meaning (60361). */
15864 {
15865 /* Reset the contents of the START_OF_ID token. */
15869 /* We must mark the lookup as kept, so we don't throw it away on
15870 the first parse. */
15874 /* Retrieve any deferred checks. Do not pop this access checks yet
15875 so the memory will not be reclaimed during token replacing below. */
15881 /* Purge all subsequent tokens. */
15884 /* ??? Can we actually assume that, if template_id ==
15885 error_mark_node, we will have issued a diagnostic to the
15886 user, as opposed to simply marking the tentative parse as
15887 failed? */
15890 }
15894 }
15896 /* Parse a template-name.
15898 template-name:
15899 identifier
15901 The standard should actually say:
15903 template-name:
15904 identifier
15905 operator-function-id
15907 A defect report has been filed about this issue.
15909 A conversion-function-id cannot be a template name because they cannot
15910 be part of a template-id. In fact, looking at this code:
15912 a.operator K<int>()
15914 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15915 It is impossible to call a templated conversion-function-id with an
15916 explicit argument list, since the only allowed template parameter is
15917 the type to which it is converting.
15919 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15920 `template' keyword, in a construction like:
15922 T::template f<3>()
15924 In that case `f' is taken to be a template-name, even though there
15925 is no way of knowing for sure.
15927 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15928 name refers to a set of overloaded functions, at least one of which
15929 is a template, or an IDENTIFIER_NODE with the name of the template,
15930 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15931 names are looked up inside uninstantiated templates. */
15933 static tree
15940 {
15941 tree identifier;
15942 tree decl;
15945 /* If the next token is `operator', then we have either an
15946 operator-function-id or a conversion-function-id. */
15948 {
15949 /* We don't know whether we're looking at an
15950 operator-function-id or a conversion-function-id. */
15952 /* Try an operator-function-id. */
15954 /* If that didn't work, try a conversion-function-id. */
15956 {
15959 }
15960 }
15961 /* Look for the identifier. */
15962 else
15965 /* If we didn't find an identifier, we don't have a template-id. */
15969 /* If the name immediately followed the `template' keyword, then it
15970 is a template-name. However, if the next token is not `<', then
15971 we do not treat it as a template-name, since it is not being used
15972 as part of a template-id. This enables us to handle constructs
15973 like:
15975 template <typename T> struct S { S(); };
15976 template <typename T> S<T>::S();
15978 correctly. We would treat `S' as a template -- if it were `S<T>'
15979 -- but we do not if there is no `<'. */
15983 {
15984 /* In a declaration, in a dependent context, we pretend that the
15985 "template" keyword was present in order to improve error
15986 recovery. For example, given:
15988 template <typename T> void f(T::X<int>);
15990 we want to treat "X<int>" as a template-id. */
15992 && !template_keyword_p
15994 && check_dependency_p
15996 /* Do not do this for dtors (or ctors), since they never
15997 need the template keyword before their name. */
15999 {
16002 /* Explain what went wrong. */
16004 identifier);
16007 /* If parsing tentatively, find the location of the "<" token. */
16010 /* Parse the template arguments so that we can issue error
16011 messages about them. */
16014 /* Skip tokens until we find a good place from which to
16015 continue parsing. */
16020 /* If parsing tentatively, permanently remove the
16021 template argument list. That will prevent duplicate
16022 error messages from being issued about the missing
16023 "template" keyword. */
16030 }
16032 /* If the "template" keyword is present, then there is generally
16033 no point in doing name-lookup, so we just return IDENTIFIER.
16034 But, if the qualifying scope is non-dependent then we can
16035 (and must) do name-lookup normally. */
16037 {
16043 {
16044 /* We're optimizing away the call to cp_parser_lookup_name, but
16045 we still need to do this. */
16048 }
16049 }
16050 }
16052 /* Look up the name. */
16054 tag_type,
16057 check_dependency_p,
16063 /* If DECL is a template, then the name was a template-name. */
16065 {
16069 }
16070 else
16071 {
16072 /* The standard does not explicitly indicate whether a name that
16073 names a set of overloaded declarations, some of which are
16074 templates, is a template-name. However, such a name should
16075 be a template-name; otherwise, there is no way to form a
16076 template-id for the overloaded templates. */
16085 {
16086 /* The name does not name a template. */
16089 }
16090 }
16092 /* If DECL is dependent, and refers to a function, then just return
16093 its name; we will look it up again during template instantiation. */
16095 {
16099 }
16102 }
16104 /* Parse a template-argument-list.
16106 template-argument-list:
16107 template-argument ... [opt]
16108 template-argument-list , template-argument ... [opt]
16110 Returns a TREE_VEC containing the arguments. */
16112 static tree
16114 {
16119 tree vec;
16126 /* Even if the template-id appears in an integral
16127 constant-expression, the contents of the argument list do
16128 not. */
16134 /* Parse the arguments. */
16135 do
16136 {
16137 tree argument;
16140 /* Consume the comma. */
16143 /* Parse the template-argument. */
16146 /* If the next token is an ellipsis, we're expanding a template
16147 argument pack. */
16149 {
16151 {
16155 }
16156 /* Consume the `...' token. */
16159 /* Make the argument into a TYPE_PACK_EXPANSION or
16160 EXPR_PACK_EXPANSION. */
16162 }
16165 {
16169 {
16172 }
16173 else
16175 }
16177 }
16193 }
16195 /* Parse a template-argument.
16197 template-argument:
16198 assignment-expression
16199 type-id
16200 id-expression
16202 The representation is that of an assignment-expression, type-id, or
16203 id-expression -- except that the qualified id-expression is
16204 evaluated, so that the value returned is either a DECL or an
16205 OVERLOAD.
16207 Although the standard says "assignment-expression", it forbids
16208 throw-expressions or assignments in the template argument.
16209 Therefore, we use "conditional-expression" instead. */
16211 static tree
16213 {
16214 tree argument;
16220 cp_id_kind idk;
16222 /* There's really no way to know what we're looking at, so we just
16223 try each alternative in order.
16225 [temp.arg]
16227 In a template-argument, an ambiguity between a type-id and an
16228 expression is resolved to a type-id, regardless of the form of
16229 the corresponding template-parameter.
16231 Therefore, we try a type-id first. */
16234 /* If there was no error parsing the type-id but the next token is a
16235 '>>', our behavior depends on which dialect of C++ we're
16236 parsing. In C++98, we probably found a typo for '> >'. But there
16237 are type-id which are also valid expressions. For instance:
16239 struct X { int operator >> (int); };
16240 template <int V> struct Foo {};
16241 Foo<X () >> 5> r;
16243 Here 'X()' is a valid type-id of a function type, but the user just
16244 wanted to write the expression "X() >> 5". Thus, we remember that we
16245 found a valid type-id, but we still try to parse the argument as an
16246 expression to see what happens.
16248 In C++0x, the '>>' will be considered two separate '>'
16249 tokens. */
16253 {
16256 }
16257 else
16258 {
16259 /* If the next token isn't a `,' or a `>', then this argument wasn't
16260 really finished. This means that the argument is not a valid
16261 type-id. */
16264 /* If that worked, we're done. */
16267 }
16268 /* We're still not sure what the argument will be. */
16270 /* Try a template. */
16278 /* If the next token isn't a `,' or a `>', then this argument wasn't
16279 really finished. */
16283 {
16284 /* Figure out what is being referred to. If the id-expression
16285 was for a class template specialization, then we will have a
16286 TYPE_DECL at this point. There is no need to do name lookup
16287 at this point in that case. */
16290 none_type,
16296 /* Handle a constrained-type-specifier for a non-type template
16297 parameter. */
16303 }
16305 {
16309 }
16310 /* It must be a non-type argument. In C++17 any constant-expression is
16311 allowed. */
16315 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16317 -- an integral constant-expression of integral or enumeration
16318 type; or
16320 -- the name of a non-type template-parameter; or
16322 -- the name of an object or function with external linkage...
16324 -- the address of an object or function with external linkage...
16326 -- a pointer to member... */
16327 /* Look for a non-type template parameter. */
16329 {
16341 }
16343 /* If the next token is "&", the argument must be the address of an
16344 object or function with external linkage. */
16347 {
16350 }
16351 /* See if we might have an id-expression. */
16358 {
16361 address_p,
16368 else
16369 {
16370 tree probe;
16373 {
16374 /* Strip the dereference temporarily. */
16377 }
16379 /* If we're in a template, we represent a qualified-id referring
16380 to a static data member as a SCOPE_REF even if the scope isn't
16381 dependent so that we can check access control later. */
16386 {
16387 /* A variable without external linkage might still be a
16388 valid constant-expression, so no error is issued here
16389 if the external-linkage check fails. */
16392 }
16394 /* All overloaded functions are allowed; if the external
16395 linkage test does not pass, an error will be issued
16396 later. */
16397 ;
16401 /* A pointer-to-member. */
16402 ;
16404 ;
16405 else
16409 {
16412 tf_warning_or_error);
16413 else
16416 }
16417 }
16418 }
16419 /* If the argument started with "&", there are no other valid
16420 alternatives at this point. */
16422 {
16425 }
16427 general_expr:
16428 /* If the argument wasn't successfully parsed as a type-id followed
16429 by '>>', the argument can only be a constant expression now.
16430 Otherwise, we try parsing the constant-expression tentatively,
16431 because the argument could really be a type-id. */
16437 else
16438 {
16439 /* With C++17 generalized non-type template arguments we need to handle
16440 lvalue constant expressions, too. */
16443 }
16451 /* We did our best to parse the argument as a non type-id, but that
16452 was the only alternative that matched (albeit with a '>' after
16453 it). We can assume it's just a typo from the user, and a
16454 diagnostic will then be issued. */
16456 }
16458 /* Parse an explicit-instantiation.
16460 explicit-instantiation:
16461 template declaration
16463 Although the standard says `declaration', what it really means is:
16465 explicit-instantiation:
16466 template decl-specifier-seq [opt] declarator [opt] ;
16468 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16469 supposed to be allowed. A defect report has been filed about this
16470 issue.
16472 GNU Extension:
16474 explicit-instantiation:
16475 storage-class-specifier template
16476 decl-specifier-seq [opt] declarator [opt] ;
16477 function-specifier template
16478 decl-specifier-seq [opt] declarator [opt] ; */
16480 static void
16482 {
16484 cp_decl_specifier_seq decl_specifiers;
16489 /* Look for an (optional) storage-class-specifier or
16490 function-specifier. */
16492 {
16493 extension_specifier
16496 extension_specifier
16499 }
16501 /* Look for the `template' keyword. */
16503 /* Let the front end know that we are processing an explicit
16504 instantiation. */
16506 /* [temp.explicit] says that we are supposed to ignore access
16507 control while processing explicit instantiation directives. */
16509 /* Parse a decl-specifier-seq. */
16511 CP_PARSER_FLAGS_OPTIONAL,
16514 /* If there was exactly one decl-specifier, and it declared a class,
16515 and there's no declarator, then we have an explicit type
16516 instantiation. */
16518 {
16519 tree type;
16523 /* Turn access control back on for names used during
16524 template instantiation. */
16529 }
16530 else
16531 {
16533 tree decl;
16535 /* Parse the declarator. */
16536 declarator
16547 {
16550 "explicit instantiation shall not use"
16554 "explicit instantiation shall not use"
16559 /* Turn access control back on for names used during
16560 template instantiation. */
16562 /* Do the explicit instantiation. */
16564 }
16565 else
16566 {
16568 /* Skip the body of the explicit instantiation. */
16570 }
16571 }
16572 /* We're done with the instantiation. */
16578 }
16580 /* Parse an explicit-specialization.
16582 explicit-specialization:
16583 template < > declaration
16585 Although the standard says `declaration', what it really means is:
16587 explicit-specialization:
16588 template <> decl-specifier [opt] init-declarator [opt] ;
16589 template <> function-definition
16590 template <> explicit-specialization
16591 template <> template-declaration */
16593 static void
16595 {
16599 /* Look for the `template' keyword. */
16601 /* Look for the `<'. */
16603 /* Look for the `>'. */
16605 /* We have processed another parameter list. */
16607 /* [temp]
16609 A template ... explicit specialization ... shall not have C
16610 linkage. */
16612 {
16615 /* Give it C++ linkage to avoid confusing other parts of the
16616 front end. */
16619 }
16620 else
16622 /* Let the front end know that we are beginning a specialization. */
16624 {
16627 }
16629 /* If the next keyword is `template', we need to figure out whether
16630 or not we're looking a template-declaration. */
16632 {
16637 else
16639 }
16640 else
16641 /* Parse the dependent declaration. */
16647 /* We're done with the specialization. */
16649 /* For the erroneous case of a template with C linkage, we pushed an
16650 implicit C++ linkage scope; exit that scope now. */
16653 /* We're done with this parameter list. */
16655 }
16657 /* Parse a type-specifier.
16659 type-specifier:
16660 simple-type-specifier
16661 class-specifier
16662 enum-specifier
16663 elaborated-type-specifier
16664 cv-qualifier
16666 GNU Extension:
16668 type-specifier:
16669 __complex__
16671 Returns a representation of the type-specifier. For a
16672 class-specifier, enum-specifier, or elaborated-type-specifier, a
16673 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16675 The parser flags FLAGS is used to control type-specifier parsing.
16677 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16678 in a decl-specifier-seq.
16680 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16681 class-specifier, enum-specifier, or elaborated-type-specifier, then
16682 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16683 if a type is declared; 2 if it is defined. Otherwise, it is set to
16684 zero.
16686 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16687 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16688 is set to FALSE. */
16690 static tree
16692 cp_parser_flags flags,
16697 {
16703 /* Assume this type-specifier does not declare a new type. */
16706 /* And that it does not specify a cv-qualifier. */
16709 /* Peek at the next token. */
16712 /* If we're looking at a keyword, we can use that to guide the
16713 production we choose. */
16716 {
16721 /* Look for the enum-specifier. */
16723 /* If that worked, we're done. */
16725 {
16730 type_spec,
16731 token,
16734 }
16735 else
16738 /* Any of these indicate either a class-specifier, or an
16739 elaborated-type-specifier. */
16746 /* Parse tentatively so that we can back up if we don't find a
16747 class-specifier. */
16749 /* Look for the class-specifier. */
16752 /* If that worked, we're done. */
16754 {
16759 type_spec,
16760 token,
16763 }
16765 /* Fall through. */
16766 elaborated_type_specifier:
16767 /* We're declaring (not defining) a class or enum. */
16771 /* Fall through. */
16773 /* Look for an elaborated-type-specifier. */
16774 type_spec
16775 = (cp_parser_elaborated_type_specifier
16778 is_declaration));
16781 type_spec,
16782 token,
16805 /* The `__complex__' keyword is a GNU extension. */
16811 }
16813 /* Handle simple keywords. */
16815 {
16817 {
16820 }
16822 }
16824 /* If we do not already have a type-specifier, assume we are looking
16825 at a simple-type-specifier. */
16827 decl_specs,
16828 flags);
16830 /* If we didn't find a type-specifier, and a type-specifier was not
16831 optional in this context, issue an error message. */
16833 {
16836 }
16839 }
16841 /* Parse a simple-type-specifier.
16843 simple-type-specifier:
16844 :: [opt] nested-name-specifier [opt] type-name
16845 :: [opt] nested-name-specifier template template-id
16846 char
16847 wchar_t
16848 bool
16849 short
16850 int
16851 long
16852 signed
16853 unsigned
16854 float
16855 double
16856 void
16858 C++11 Extension:
16860 simple-type-specifier:
16861 auto
16862 decltype ( expression )
16863 char16_t
16864 char32_t
16865 __underlying_type ( type-id )
16867 C++17 extension:
16869 nested-name-specifier(opt) template-name
16871 GNU Extension:
16873 simple-type-specifier:
16874 __int128
16875 __typeof__ unary-expression
16876 __typeof__ ( type-id )
16877 __typeof__ ( type-id ) { initializer-list , [opt] }
16879 Concepts Extension:
16881 simple-type-specifier:
16882 constrained-type-specifier
16884 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16885 appropriately updated. */
16887 static tree
16890 cp_parser_flags flags)
16891 {
16896 /* Peek at the next token. */
16899 /* If we're looking at a keyword, things are easy. */
16901 {
16936 {
16939 }
16968 {
16969 /* The 'auto' might be the placeholder return type for a function decl
16970 with trailing return type. */
16979 {
16981 {
16988 }
16991 {
16994 }
16997 }
17001 {
17004 }
17007 {
17010 }
17011 else
17015 {
17018 "use of %<auto%> in lambda parameter declaration "
17019 "only available with "
17021 }
17024 "use of %<auto%> in parameter declaration "
17025 "only available with "
17029 "ISO C++ forbids use of %<auto%> in parameter "
17031 }
17032 else
17037 /* Since DR 743, decltype can either be a simple-type-specifier by
17038 itself or begin a nested-name-specifier. Parsing it will replace
17039 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17040 handling below decide what to do. */
17046 /* Consume the `typeof' token. */
17048 /* Parse the operand to `typeof'. */
17050 /* If it is not already a TYPE, take its type. */
17056 token,
17065 token,
17075 token,
17080 }
17082 /* If token is an already-parsed decltype not followed by ::,
17083 it's a simple-type-specifier. */
17086 {
17089 {
17091 token,
17093 /* Remember that we are handling a decltype in order to
17094 implement the resolution of DR 1510 when the argument
17095 isn't instantiation dependent. */
17097 }
17100 }
17102 /* If the type-specifier was for a built-in type, we're done. */
17104 {
17105 /* Record the type. */
17112 type,
17113 token,
17118 /* Consume the token. */
17124 /* There is no valid C++ program where a non-template type is
17125 followed by a "<". That usually indicates that the user thought
17126 that the type was a template. */
17131 }
17133 /* The type-specifier must be a user-defined type. */
17135 {
17139 /* Don't gobble tokens or issue error messages if this is an
17140 optional type-specifier. */
17146 /* Look for the optional `::' operator. */
17147 global_p
17151 /* Look for the nested-name specifier. */
17152 qualified_p
17159 /* If we have seen a nested-name-specifier, and the next token
17160 is `template', then we are using the template-id production. */
17163 {
17164 /* Look for the template-id. */
17168 none_type,
17170 /* If the template-id did not name a type, we are out of
17171 luck. */
17173 {
17176 }
17177 }
17178 /* Otherwise, look for a type-name. */
17179 else
17181 /* Keep track of all name-lookups performed in class scopes. */
17183 && !global_p
17184 && !qualified_p
17188 /* If it didn't work out, we don't have a TYPE. */
17193 {
17207 {
17209 none_type,
17219 else
17220 {
17225 }
17226 }
17227 else
17233 }
17236 token,
17238 }
17240 /* If we didn't get a type-name, issue an error message. */
17242 {
17245 }
17248 {
17249 /* See if TYPE is an Objective-C type, and if so, parse and
17250 accept any protocol references following it. Do this before
17251 the cp_parser_check_for_invalid_template_id() call, because
17252 Objective-C types can be followed by '<...>' which would
17253 enclose protocol names rather than template arguments, and so
17254 everything is fine. */
17257 {
17261 /* Clobber the "unqualified" type previously entered into
17262 DECL_SPECS with the new, improved protocol-qualified version. */
17267 }
17269 /* There is no valid C++ program where a non-template type is
17270 followed by a "<". That usually indicates that the user
17271 thought that the type was a template. */
17273 none_type,
17275 }
17278 }
17280 /* Parse a type-name.
17282 type-name:
17283 class-name
17284 enum-name
17285 typedef-name
17286 simple-template-id [in c++0x]
17288 enum-name:
17289 identifier
17291 typedef-name:
17292 identifier
17294 Concepts:
17296 type-name:
17297 concept-name
17298 partial-concept-id
17300 concept-name:
17301 identifier
17303 Returns a TYPE_DECL for the type. */
17305 static tree
17307 {
17309 }
17311 /* See above. */
17312 static tree
17314 {
17315 tree type_decl;
17317 /* We can't know yet whether it is a class-name or not. */
17319 /* Try a class-name. */
17321 typename_keyword_p,
17323 none_type,
17327 /* If it's not a class-name, keep looking. */
17329 {
17331 /* It must be a typedef-name or an enum-name. */
17335 /* It is either a simple-template-id representing an
17336 instantiation of an alias template... */
17340 none_type,
17342 /* Note that this must be an instantiation of an alias template
17343 because [temp.names]/6 says:
17345 A template-id that names an alias template specialization
17346 is a type-name.
17348 Whereas [temp.names]/7 says:
17350 A simple-template-id that names a class template
17351 specialization is a class-name.
17353 With concepts, this could also be a partial-concept-id that
17354 declares a non-type template parameter. */
17361 else
17365 /* ... Or a typedef-name or an enum-name. */
17367 }
17370 }
17372 /* Check if DECL and ARGS can form a constrained-type-specifier.
17373 If ARGS is non-null, we try to form a concept check of the
17374 form DECL<?, ARGS> where ? is a wildcard that matches any
17375 kind of template argument. If ARGS is NULL, then we try to
17376 form a concept check of the form DECL<?>. */
17378 static tree
17381 {
17384 /* If we a constrained-type-specifier cannot be deduced. */
17388 /* A constrained type specifier can only be found in an
17389 overload set or as a reference to a template declaration.
17391 FIXME: This might be masking a bug. It's possible that
17392 that the deduction below is causing template specializations
17393 to be formed with the wildcard as an argument. */
17397 /* Try to build a call expression that evaluates the
17398 concept. This can fail if the overload set refers
17399 only to non-templates. */
17405 /* Deduce the checked constraint and the prototype parameter.
17407 FIXME: In certain cases, failure to deduce should be a
17408 diagnosable error. */
17409 tree conc;
17410 tree proto;
17414 /* In template parameter scope, this results in a constrained
17415 parameter. Return a descriptor of that parm. */
17419 /* In a parameter-declaration-clause, constrained-type
17420 specifiers result in invented template parameters. */
17422 {
17425 }
17426 else
17427 {
17428 /* Otherwise, we're in a context where the constrained
17429 type name is deduced and the constraint applies
17430 after deduction. */
17432 }
17435 }
17437 /* If DECL refers to a concept, return a TYPE_DECL representing
17438 the result of using the constrained type specifier in the
17439 current context. DECL refers to a concept if
17441 - it is an overload set containing a function concept taking a single
17442 type argument, or
17444 - it is a variable concept taking a single type argument. */
17446 static tree
17448 {
17454 else
17456 }
17458 /* Check if DECL and ARGS form a partial-concept-id. If so,
17459 assign ID to the resulting constrained placeholder.
17461 Returns true if the partial-concept-id designates a placeholder
17462 and false otherwise. Note that *id is set to NULL_TREE in
17463 this case. */
17465 static tree
17467 {
17469 }
17471 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17472 or a concept-name.
17474 enum-name:
17475 identifier
17477 typedef-name:
17478 identifier
17480 concept-name:
17481 identifier
17483 Returns a TYPE_DECL for the type. */
17485 static tree
17487 {
17488 tree type_decl;
17489 tree identifier;
17496 /* Look up the type-name. */
17501 /* If we found an overload set, then it may refer to a concept-name. */
17507 {
17508 /* See if this is an Objective-C type. */
17513 }
17515 /* Issue an error if we did not find a type-name. */
17517 /* In Objective-C, we have the complication that class names are
17518 normally type names and start declarations (eg, the
17519 "NSObject" in "NSObject *object;"), but can be used in an
17520 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17521 is an expression. So, a classname followed by a dot is not a
17522 valid type-name. */
17525 {
17530 }
17531 /* Remember that the name was used in the definition of the
17532 current class so that we can check later to see if the
17533 meaning would have been different after the class was
17534 entirely defined. */
17540 }
17542 /* Parse an elaborated-type-specifier. Note that the grammar given
17543 here incorporates the resolution to DR68.
17545 elaborated-type-specifier:
17546 class-key :: [opt] nested-name-specifier [opt] identifier
17547 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17548 enum-key :: [opt] nested-name-specifier [opt] identifier
17549 typename :: [opt] nested-name-specifier identifier
17550 typename :: [opt] nested-name-specifier template [opt]
17551 template-id
17553 GNU extension:
17555 elaborated-type-specifier:
17556 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17557 class-key attributes :: [opt] nested-name-specifier [opt]
17558 template [opt] template-id
17559 enum attributes :: [opt] nested-name-specifier [opt] identifier
17561 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17562 declared `friend'. If IS_DECLARATION is TRUE, then this
17563 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17564 something is being declared.
17566 Returns the TYPE specified. */
17568 static tree
17572 {
17574 tree identifier;
17577 tree globalscope;
17580 /* See if we're looking at the `enum' keyword. */
17582 {
17583 /* Consume the `enum' token. */
17585 /* Remember that it's an enumeration type. */
17587 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17588 enums) is used here. */
17592 {
17599 /* Consume the `struct' or `class' and parse it anyway. */
17601 }
17602 /* Parse the attributes. */
17604 }
17605 /* Or, it might be `typename'. */
17607 RID_TYPENAME))
17608 {
17609 /* Consume the `typename' token. */
17611 /* Remember that it's a `typename' type. */
17613 }
17614 /* Otherwise it must be a class-key. */
17615 else
17616 {
17620 /* Parse the attributes. */
17622 }
17624 /* Look for the `::' operator. */
17627 /* Look for the nested-name-specifier. */
17628 tree nested_name_specifier;
17630 {
17631 nested_name_specifier
17636 is_declaration);
17639 }
17640 else
17641 /* Even though `typename' is not present, the proposed resolution
17642 to Core Issue 180 says that in `class A<T>::B', `B' should be
17643 considered a type-name, even if `A<T>' is dependent. */
17644 nested_name_specifier
17649 is_declaration);
17650 /* For everything but enumeration types, consider a template-id.
17651 For an enumeration type, consider only a plain identifier. */
17653 {
17655 tree decl;
17657 /* Allow the `template' keyword. */
17659 /* If we didn't see `template', we don't know if there's a
17660 template-id or not. */
17663 /* Parse the template-id. */
17667 tag_type,
17668 is_declaration);
17669 /* If we didn't find a template-id, look for an ordinary
17670 identifier. */
17672 ;
17673 /* We can get here when cp_parser_template_id, called by
17674 cp_parser_class_name with tag_type == none_type, succeeds
17675 and caches a BASELINK. Then, when called again here,
17676 instead of failing and returning an error_mark_node
17677 returns it (see template/typename17.C in C++11).
17678 ??? Could we diagnose this earlier? */
17680 {
17683 }
17684 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17685 in effect, then we must assume that, upon instantiation, the
17686 template will correspond to a class. */
17690 typename_type,
17692 /* If the `typename' keyword is in effect and DECL is not a type
17693 decl, then type is non existent. */
17695 ;
17697 {
17701 /* If the next token is a semicolon, this must be a specialization,
17702 instantiation, or friend declaration. Check the scope while we
17703 still know whether or not we had a nested-name-specifier. */
17708 }
17711 }
17714 {
17719 {
17722 }
17724 /* For a `typename', we needn't call xref_tag. */
17730 /* Template parameter lists apply only if we are not within a
17731 function parameter list. */
17732 bool template_parm_lists_apply
17741 /* Look up a qualified name in the usual way. */
17743 {
17744 tree decl;
17745 tree ambiguous_decls;
17748 tag_type,
17755 /* If the lookup was ambiguous, an error will already have been
17756 issued. */
17760 /* If we are parsing friend declaration, DECL may be a
17761 TEMPLATE_DECL tree node here. However, we need to check
17762 whether this TEMPLATE_DECL results in valid code. Consider
17763 the following example:
17765 namespace N {
17766 template <class T> class C {};
17767 }
17768 class X {
17769 template <class T> friend class N::C; // #1, valid code
17770 };
17771 template <class T> class Y {
17772 friend class N::C; // #2, invalid code
17773 };
17775 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17776 name lookup of `N::C'. We see that friend declaration must
17777 be template for the code to be valid. Note that
17778 processing_template_decl does not work here since it is
17779 always 1 for the above two cases. */
17781 decl = (cp_parser_maybe_treat_template_as_class
17786 {
17788 identifier,
17791 }
17794 {
17798 allow_template);
17802 }
17804 /* Forward declarations of nested types, such as
17806 class C1::C2;
17807 class C1::C2::C3;
17809 are invalid unless all components preceding the final '::'
17810 are complete. If all enclosing types are complete, these
17811 declarations become merely pointless.
17813 Invalid forward declarations of nested types are errors
17814 caught elsewhere in parsing. Those that are pointless arrive
17815 here. */
17822 }
17823 else
17824 {
17825 /* An elaborated-type-specifier sometimes introduces a new type and
17826 sometimes names an existing type. Normally, the rule is that it
17827 introduces a new type only if there is not an existing type of
17828 the same name already in scope. For example, given:
17830 struct S {};
17831 void f() { struct S s; }
17833 the `struct S' in the body of `f' is the same `struct S' as in
17834 the global scope; the existing definition is used. However, if
17835 there were no global declaration, this would introduce a new
17836 local class named `S'.
17838 An exception to this rule applies to the following code:
17840 namespace N { struct S; }
17842 Here, the elaborated-type-specifier names a new type
17843 unconditionally; even if there is already an `S' in the
17844 containing scope this declaration names a new type.
17845 This exception only applies if the elaborated-type-specifier
17846 forms the complete declaration:
17848 [class.name]
17850 A declaration consisting solely of `class-key identifier ;' is
17851 either a redeclaration of the name in the current scope or a
17852 forward declaration of the identifier as a class name. It
17853 introduces the name into the current scope.
17855 We are in this situation precisely when the next token is a `;'.
17857 An exception to the exception is that a `friend' declaration does
17858 *not* name a new type; i.e., given:
17860 struct S { friend struct T; };
17862 `T' is not a new type in the scope of `S'.
17864 Also, `new struct S' or `sizeof (struct S)' never results in the
17865 definition of a new type; a new type can only be declared in a
17866 declaration context. */
17868 tag_scope ts;
17872 /* Friends have special name lookup rules. */
17876 CPP_SEMICOLON))
17877 /* This is a `class-key identifier ;' */
17879 else
17882 template_p =
17883 (template_parm_lists_apply
17886 /* An unqualified name was used to reference this type, so
17887 there were no qualifying templates. */
17895 }
17896 }
17901 /* Allow attributes on forward declarations of classes. */
17903 {
17913 else
17916 }
17919 {
17920 /* Indicate whether this class was declared as a `class' or as a
17921 `struct'. */
17925 }
17927 /* A "<" cannot follow an elaborated type specifier. If that
17928 happens, the user was probably trying to form a template-id. */
17933 }
17935 /* Parse an enum-specifier.
17937 enum-specifier:
17938 enum-head { enumerator-list [opt] }
17939 enum-head { enumerator-list , } [C++0x]
17941 enum-head:
17942 enum-key identifier [opt] enum-base [opt]
17943 enum-key nested-name-specifier identifier enum-base [opt]
17945 enum-key:
17946 enum
17947 enum class [C++0x]
17948 enum struct [C++0x]
17950 enum-base: [C++0x]
17951 : type-specifier-seq
17953 opaque-enum-specifier:
17954 enum-key identifier enum-base [opt] ;
17956 GNU Extensions:
17957 enum-key attributes[opt] identifier [opt] enum-base [opt]
17958 { enumerator-list [opt] }attributes[opt]
17959 enum-key attributes[opt] identifier [opt] enum-base [opt]
17960 { enumerator-list, }attributes[opt] [C++0x]
17962 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17963 if the token stream isn't an enum-specifier after all. */
17965 static tree
17967 {
17968 tree identifier;
17970 tree prev_scope;
17972 tree attributes;
17985 /* Parse tentatively so that we can back up if we don't find a
17986 enum-specifier. */
17989 /* Caller guarantees that the current token is 'enum', an identifier
17990 possibly follows, and the token after that is an opening brace.
17991 If we don't have an identifier, fabricate an anonymous name for
17992 the enumeration being defined. */
17995 /* Parse the "class" or "struct", which indicates a scoped
17996 enumeration type in C++0x. */
17999 {
18003 /* Consume the `struct' or `class' token. */
18007 }
18011 /* Clear the qualification. */
18016 /* Figure out in what scope the declaration is being placed. */
18022 nested_name_specifier
18030 {
18031 tree name;
18035 enum_type,
18040 input_location);
18042 {
18045 {
18046 /* Are template enums allowed in ISO? */
18050 /* ignore a typename reference, for it will be solved by name
18051 in start_enum. */
18053 }
18054 }
18057 else
18058 {
18063 }
18064 }
18065 else
18066 {
18069 else
18070 {
18076 }
18077 }
18080 /* Check for the `:' that denotes a specified underlying type in C++0x.
18081 Note that a ':' could also indicate a bitfield width, however. */
18083 {
18084 cp_decl_specifier_seq type_specifiers;
18086 /* Consume the `:'. */
18089 /* Parse the type-specifier-seq. */
18094 /* At this point this is surely not elaborated type specifier. */
18103 /* If that didn't work, stop. */
18105 {
18111 }
18112 }
18114 /* Look for the `{' but don't consume it yet. */
18116 {
18118 {
18121 {
18124 }
18125 }
18126 /* An opaque-enum-specifier must have a ';' here. */
18129 {
18132 {
18135 }
18136 }
18137 }
18143 {
18145 {
18149 }
18151 {
18153 }
18154 }
18156 /* Issue an error message if type-definitions are forbidden here. */
18159 else
18160 /* Create the new type. We do this before consuming the opening
18161 brace so the enum will be recorded as being on the line of its
18162 tag (or the 'enum' keyword, if there is no tag). */
18166 /* If the next token is not '{' it is an opaque-enum-specifier or an
18167 elaborated-type-specifier. */
18169 {
18173 {
18174 /* The following catches invalid code such as:
18175 enum class S<int>::E { A, B, C }; */
18183 {
18187 nested_name_specifier);
18189 }
18192 {
18194 "%qT for enum declaration does not name a class "
18197 }
18198 /* If that scope does not contain the scope in which the
18199 class was originally declared, the program is invalid. */
18201 nested_name_specifier))
18202 {
18205 "declaration of %qD in namespace %qD which does not "
18208 else
18210 "declaration of %qD in %qD which does not "
18214 }
18215 /* If that scope is the scope where the declaration is being placed
18216 the program is invalid. */
18220 {
18224 }
18225 }
18230 /* Consume the opening brace. */
18231 matching_braces braces;
18238 {
18242 }
18243 else
18244 {
18250 }
18254 /* If the next token is not '}', then there are some enumerators. */
18256 {
18260 }
18261 else
18264 /* Consume the final '}'. */
18270 }
18271 else
18272 {
18273 /* If a ';' follows, then it is an opaque-enum-specifier
18274 and additional restrictions apply. */
18276 {
18283 }
18284 }
18286 /* Look for trailing attributes to apply to this enumeration, and
18287 apply them if appropriate. */
18289 {
18292 trailing_attr,
18294 }
18296 /* Finish up the enumeration. */
18298 {
18303 }
18306 {
18308 {
18311 }
18313 {
18315 }
18316 }
18317 out:
18320 }
18322 /* Parse an enumerator-list. The enumerators all have the indicated
18323 TYPE.
18325 enumerator-list:
18326 enumerator-definition
18327 enumerator-list , enumerator-definition */
18329 static void
18331 {
18333 {
18334 /* Parse an enumerator-definition. */
18337 /* If the next token is not a ',', we've reached the end of
18338 the list. */
18341 /* Otherwise, consume the `,' and keep going. */
18343 /* If the next token is a `}', there is a trailing comma. */
18345 {
18350 }
18351 }
18352 }
18354 /* Parse an enumerator-definition. The enumerator has the indicated
18355 TYPE.
18357 enumerator-definition:
18358 enumerator
18359 enumerator = constant-expression
18361 enumerator:
18362 identifier
18364 GNU Extensions:
18366 enumerator-definition:
18367 enumerator attributes [opt]
18368 enumerator attributes [opt] = constant-expression */
18370 static void
18372 {
18373 tree identifier;
18374 tree value;
18375 location_t loc;
18377 /* Save the input location because we are interested in the location
18378 of the identifier and not the location of the explicit value. */
18381 /* Look for the identifier. */
18386 /* Parse any specified attributes. */
18389 /* If the next token is an '=', then there is an explicit value. */
18391 {
18392 /* Consume the `=' token. */
18394 /* Parse the value. */
18396 }
18397 else
18400 /* If we are processing a template, make sure the initializer of the
18401 enumerator doesn't contain any bare template parameter pack. */
18405 /* Create the enumerator. */
18407 }
18409 /* Parse a namespace-name.
18411 namespace-name:
18412 original-namespace-name
18413 namespace-alias
18415 Returns the NAMESPACE_DECL for the namespace. */
18417 static tree
18419 {
18420 tree identifier;
18421 tree namespace_decl;
18425 /* Get the name of the namespace. */
18430 /* Look up the identifier in the currently active scope. Look only
18431 for namespaces, due to:
18433 [basic.lookup.udir]
18435 When looking up a namespace-name in a using-directive or alias
18436 definition, only namespace names are considered.
18438 And:
18440 [basic.lookup.qual]
18442 During the lookup of a name preceding the :: scope resolution
18443 operator, object, function, and enumerator names are ignored.
18445 (Note that cp_parser_qualifying_entity only calls this
18446 function if the token after the name is the scope resolution
18447 operator.) */
18449 none_type,
18455 /* If it's not a namespace, issue an error. */
18458 {
18460 {
18466 }
18469 }
18472 }
18474 /* Parse a namespace-definition.
18476 namespace-definition:
18477 named-namespace-definition
18478 unnamed-namespace-definition
18480 named-namespace-definition:
18481 original-namespace-definition
18482 extension-namespace-definition
18484 original-namespace-definition:
18485 namespace identifier { namespace-body }
18487 extension-namespace-definition:
18488 namespace original-namespace-name { namespace-body }
18490 unnamed-namespace-definition:
18491 namespace { namespace-body } */
18493 static void
18495 {
18496 tree identifier;
18505 {
18508 }
18510 /* Look for the `namespace' keyword. */
18511 cp_token* token
18514 /* Parse any specified attributes before the identifier. */
18518 {
18522 {
18525 /* Parse any attributes specified after the identifier. */
18527 }
18534 "nested namespace definitions only available with "
18537 /* Nested namespace names can create new namespaces (unlike
18538 other qualified-ids). */
18541 else
18544 }
18556 /* Start the namespace. */
18563 /* Look for the `{' to validate starting the namespace. */
18564 matching_braces braces;
18566 {
18567 /* Parse the body of the namespace. */
18570 /* Look for the final `}'. */
18572 }
18577 /* Pop the nested namespace definitions. */
18580 }
18582 /* Parse a namespace-body.
18584 namespace-body:
18585 declaration-seq [opt] */
18587 static void
18589 {
18591 }
18593 /* Parse a namespace-alias-definition.
18595 namespace-alias-definition:
18596 namespace identifier = qualified-namespace-specifier ; */
18598 static void
18600 {
18601 tree identifier;
18602 tree namespace_specifier;
18606 /* Look for the `namespace' keyword. */
18608 /* Look for the identifier. */
18612 /* Look for the `=' token. */
18615 {
18617 /* Skip the definition. */
18622 }
18624 /* Look for the qualified-namespace-specifier. */
18625 namespace_specifier
18627 /* Look for the `;' token. */
18630 /* Register the alias in the symbol table. */
18632 }
18634 /* Parse a qualified-namespace-specifier.
18636 qualified-namespace-specifier:
18637 :: [opt] nested-name-specifier [opt] namespace-name
18639 Returns a NAMESPACE_DECL corresponding to the specified
18640 namespace. */
18642 static tree
18644 {
18645 /* Look for the optional `::'. */
18649 /* Look for the optional nested-name-specifier. */
18657 }
18659 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18660 access declaration.
18662 using-declaration:
18663 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18664 using :: unqualified-id ;
18666 access-declaration:
18667 qualified-id ;
18669 */
18671 static bool
18674 {
18678 tree decl;
18679 tree identifier;
18680 tree qscope;
18685 {
18688 }
18689 else
18690 {
18691 /* Look for the `using' keyword. */
18694 again:
18695 /* Peek at the next token. */
18697 /* See if it's `typename'. */
18699 {
18700 /* Remember that we've seen it. */
18702 /* Consume the `typename' token. */
18704 }
18705 }
18707 /* Look for the optional global scope qualification. */
18708 global_scope_p
18713 /* If we saw `typename', or didn't see `::', then there must be a
18714 nested-name-specifier present. */
18716 {
18722 {
18725 }
18726 }
18727 /* Otherwise, we could be in either of the two productions. In that
18728 case, treat the nested-name-specifier as optional. */
18729 else
18741 /* Something has already gone wrong; there's no need to parse
18742 further. Since an error has occurred, the return value of
18743 cp_parser_parse_definitely will be false, as required. */
18747 /* Parse the unqualified-id. */
18755 {
18760 }
18762 {
18767 "pack expansion in using-declaration only available "
18770 }
18772 /* The function we call to handle a using-declaration is different
18773 depending on what scope we are in. */
18775 ;
18778 /* [namespace.udecl]
18780 A using declaration shall not name a template-id. */
18783 else
18784 {
18786 {
18787 /* Create the USING_DECL. */
18794 {
18797 }
18798 else
18799 /* Add it to the list of members in this class. */
18801 }
18802 else
18803 {
18805 identifier,
18812 {
18815 }
18818 else
18820 }
18821 }
18825 {
18829 "comma-separated list in using-declaration only available "
18832 }
18834 /* Look for the final `;'. */
18839 "access declarations are deprecated "
18840 "in favour of using-declarations; "
18844 }
18846 /* Parse an alias-declaration.
18848 alias-declaration:
18849 using identifier attribute-specifier-seq [opt] = type-id */
18851 static tree
18853 {
18855 location_t id_location;
18857 cp_decl_specifier_seq decl_specs;
18861 /* Look for the `using' keyword. */
18862 cp_token *using_token
18884 /* Now we are going to parse the type-id of the declaration. */
18886 /*
18887 [dcl.type]/3 says:
18889 "A type-specifier-seq shall not define a class or enumeration
18890 unless it appears in the type-id of an alias-declaration (7.1.3) that
18891 is not the declaration of a template-declaration."
18893 In other words, if we currently are in an alias template, the
18894 type-id should not define a type.
18896 So let's set parser->type_definition_forbidden_message in that
18897 case; cp_parser_check_type_definition (called by
18898 cp_parser_class_specifier) will then emit an error if a type is
18899 defined in the type-id. */
18901 {
18905 }
18909 /* Restore the error message if need be. */
18915 {
18918 }
18920 /* A typedef-name can also be introduced by an alias-declaration. The
18921 identifier following the using keyword becomes a typedef-name. It has
18922 the same semantics as if it were introduced by the typedef
18923 specifier. In particular, it does not define a new type and it shall
18924 not appear in the type-id. */
18929 {
18932 ds_attribute,
18933 attrs_token);
18934 }
18936 ds_typedef,
18937 using_token);
18939 ds_alias,
18940 using_token);
18949 else
18955 // Attach constraints to the alias declaration.
18957 {
18961 }
18968 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18969 added into the symbol table; otherwise, return the TYPE_DECL. */
18973 {
18977 }
18980 }
18982 /* Parse a using-directive.
18984 using-directive:
18985 using namespace :: [opt] nested-name-specifier [opt]
18986 namespace-name ; */
18988 static void
18990 {
18991 tree namespace_decl;
18992 tree attribs;
18994 /* Look for the `using' keyword. */
18996 /* And the `namespace' keyword. */
18998 /* Look for the optional `::' operator. */
19000 /* And the optional nested-name-specifier. */
19006 /* Get the namespace being used. */
19008 /* And any specified attributes. */
19011 /* Update the symbol table. */
19014 else
19017 /* Look for the final `;'. */
19019 }
19021 /* Parse an asm-definition.
19023 asm-definition:
19024 asm ( string-literal ) ;
19026 GNU Extension:
19028 asm-definition:
19029 asm volatile [opt] ( string-literal ) ;
19030 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19031 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19032 : asm-operand-list [opt] ) ;
19033 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19034 : asm-operand-list [opt]
19035 : asm-clobber-list [opt] ) ;
19036 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19037 : asm-clobber-list [opt]
19038 : asm-goto-list ) ; */
19040 static void
19042 {
19043 tree string;
19048 tree asm_stmt;
19056 /* Look for the `asm' keyword. */
19061 {
19064 }
19066 /* See if the next token is `volatile'. */
19069 {
19070 /* Remember that we saw the `volatile' keyword. */
19072 /* Consume the token. */
19074 }
19078 {
19079 /* Remember that we saw the `goto' keyword. */
19081 /* Consume the token. */
19083 }
19084 /* Look for the opening `('. */
19087 /* Look for the string. */
19090 {
19094 }
19096 /* If we're allowing GNU extensions, check for the extended assembly
19097 syntax. Unfortunately, the `:' tokens need not be separated by
19098 a space in C, and so, for compatibility, we tolerate that here
19099 too. Doing that means that we have to treat the `::' operator as
19100 two `:' tokens. */
19105 {
19110 /* The extended syntax was used. */
19113 /* Look for outputs. */
19115 {
19116 /* Consume the `:'. */
19118 /* Parse the output-operands. */
19120 CPP_COLON)
19122 CPP_SCOPE)
19124 CPP_CLOSE_PAREN)
19126 {
19130 }
19131 }
19132 /* If the next token is `::', there are no outputs, and the
19133 next token is the beginning of the inputs. */
19135 /* The inputs are coming next. */
19138 /* Look for inputs. */
19141 {
19142 /* Consume the `:' or `::'. */
19144 /* Parse the output-operands. */
19146 CPP_COLON)
19148 CPP_SCOPE)
19150 CPP_CLOSE_PAREN))
19151 {
19155 }
19156 }
19158 /* The clobbers are coming next. */
19161 /* Look for clobbers. */
19164 {
19166 /* Consume the `:' or `::'. */
19168 /* Parse the clobbers. */
19170 CPP_COLON)
19172 CPP_CLOSE_PAREN))
19174 }
19177 /* The labels are coming next. */
19180 /* Look for labels. */
19183 {
19185 /* Consume the `:' or `::'. */
19187 /* Parse the labels. */
19189 }
19193 }
19197 /* Look for the closing `)'. */
19205 {
19206 /* Create the ASM_EXPR. */
19208 {
19211 /* If the extended syntax was not used, mark the ASM_EXPR. */
19213 {
19219 }
19220 }
19221 else
19223 }
19224 }
19226 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19227 type that comes from the decl-specifier-seq. */
19229 static tree
19231 {
19234 {
19247 }
19250 }
19252 /* Declarators [gram.dcl.decl] */
19254 /* Parse an init-declarator.
19256 init-declarator:
19257 declarator initializer [opt]
19259 GNU Extension:
19261 init-declarator:
19262 declarator asm-specification [opt] attributes [opt] initializer [opt]
19264 function-definition:
19265 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19266 function-body
19267 decl-specifier-seq [opt] declarator function-try-block
19269 GNU Extension:
19271 function-definition:
19272 __extension__ function-definition
19274 TM Extension:
19276 function-definition:
19277 decl-specifier-seq [opt] declarator function-transaction-block
19279 The DECL_SPECIFIERS apply to this declarator. Returns a
19280 representation of the entity declared. If MEMBER_P is TRUE, then
19281 this declarator appears in a class scope. The new DECL created by
19282 this declarator is returned.
19284 The CHECKS are access checks that should be performed once we know
19285 what entity is being declared (and, therefore, what classes have
19286 befriended it).
19288 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19289 for a function-definition here as well. If the declarator is a
19290 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19291 be TRUE upon return. By that point, the function-definition will
19292 have been completely parsed.
19294 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19295 is FALSE.
19297 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19298 parsed declaration if it is an uninitialized single declarator not followed
19299 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19300 if present, will not be consumed. If returned, this declarator will be
19301 created with SD_INITIALIZED but will not call cp_finish_decl.
19303 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19304 and there is an initializer, the pointed location_t is set to the
19305 location of the '=' or `(', or '{' in C++11 token introducing the
19306 initializer. */
19308 static tree
19319 {
19323 tree prefix_attributes;
19325 tree asm_specification;
19326 tree initializer;
19328 tree scope;
19330 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19331 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19332 "(...)". */
19343 /* Gather the attributes that were provided with the
19344 decl-specifiers. */
19347 /* Assume that this is not the declarator for a function
19348 definition. */
19352 /* Default arguments are only permitted for function parameters. */
19356 /* Defer access checks while parsing the declarator; we cannot know
19357 what names are accessible until we know what is being
19358 declared. */
19363 /* Parse the declarator. */
19364 declarator
19369 /* Gather up the deferred checks. */
19374 /* If the DECLARATOR was erroneous, there's no need to go
19375 further. */
19379 /* Check that the number of template-parameter-lists is OK. */
19389 /* Figure out what scope the entity declared by the DECLARATOR is
19390 located in. `grokdeclarator' sometimes changes the scope, so
19391 we compute it now. */
19394 /* Perform any lookups in the declared type which were thought to be
19395 dependent, but are not in the scope of the declarator. */
19396 decl_specifiers->type
19399 /* If we're allowing GNU extensions, look for an
19400 asm-specification. */
19402 {
19403 /* Look for an asm-specification. */
19406 }
19407 else
19410 /* Look for attributes. */
19414 /* Peek at the next token. */
19420 {
19421 /* Handle C++17 deduction guides. */
19425 {
19433 {
19437 }
19438 }
19440 /* Check to see if the token indicates the start of a
19441 function-definition. */
19443 {
19445 {
19446 /* If a function-definition should not appear here, issue an
19447 error message. */
19451 }
19453 location_t func_brace_location
19456 /* Neither attributes nor an asm-specification are allowed
19457 on a function-definition. */
19460 "an asm-specification is not allowed "
19464 "attributes are not allowed "
19466 /* This is a function-definition. */
19469 /* Parse the function definition. */
19472 decl_specifiers,
19473 declarator,
19474 prefix_attributes);
19475 else
19476 decl =
19477 (cp_parser_function_definition_from_specifiers_and_declarator
19481 {
19482 /* This is where the prologue starts... */
19485 }
19488 }
19489 }
19491 {
19492 /* A non-template declaration involving a function parameter list
19493 containing an implicit template parameter will be made into a
19494 template. If the resulting declaration is not going to be an
19495 actual function then finish the template scope here to prevent it.
19496 An error message will be issued once we have a decl to talk about.
19498 FIXME probably we should do type deduction rather than create an
19499 implicit template, but the standard currently doesn't allow it. */
19502 }
19504 /* [dcl.dcl]
19506 Only in function declarations for constructors, destructors, type
19507 conversions, and deduction guides can the decl-specifier-seq be omitted.
19509 We explicitly postpone this check past the point where we handle
19510 function-definitions because we tolerate function-definitions
19511 that are missing their return types in some modes. */
19513 {
19517 }
19519 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19523 {
19534 {
19540 }
19541 }
19542 else
19543 {
19544 /* If the init-declarator isn't initialized and isn't followed by a
19545 `,' or `;', it's not a valid init-declarator. */
19548 {
19551 else
19552 {
19556 }
19557 }
19560 }
19562 /* Because start_decl has side-effects, we should only call it if we
19563 know we're going ahead. By this point, we know that we cannot
19564 possibly be looking at any other construct. */
19567 /* Enter the newly declared entry in the symbol table. If we're
19568 processing a declaration in a class-specifier, we wait until
19569 after processing the initializer. */
19571 {
19579 /* Adjust location of decl if declarator->id_loc is more appropriate:
19580 set, and decl wasn't merged with another decl, in which case its
19581 location would be different from input_location, and more accurate. */
19586 }
19588 /* Enter the SCOPE. That way unqualified names appearing in the
19589 initializer will be looked up in SCOPE. */
19592 /* Perform deferred access control checks, now that we know in which
19593 SCOPE the declared entity resides. */
19595 {
19598 /* If the entity being declared is a function, pretend that we
19599 are in its scope. If it is a `friend', it may have access to
19600 things that would not otherwise be accessible. */
19602 {
19605 }
19607 /* Perform access checks for template parameters. */
19610 /* Perform the access control checks for the declarator and the
19611 decl-specifiers. */
19614 /* Restore the saved value. */
19617 }
19619 /* Parse the initializer. */
19624 {
19626 {
19629 else
19630 {
19631 /* If the declaration was erroneous, we don't really
19632 know what the user intended, so just silently
19633 consume the initializer. */
19640 }
19641 }
19642 else
19643 {
19644 /* We want to record the extra mangling scope for in-class
19645 initializers of class members and initializers of static data
19646 member templates. The former involves deferring
19647 parsing of the initializer until end of class as with default
19648 arguments. So right here we only handle the latter. */
19658 }
19659 }
19661 /* The old parser allows attributes to appear after a parenthesized
19662 initializer. Mark Mitchell proposed removing this functionality
19663 on the GCC mailing lists on 2002-08-13. This parser accepts the
19664 attributes -- but ignores them. */
19671 /* And now complain about a non-function implicit template. */
19676 /* For an in-class declaration, use `grokfield' to create the
19677 declaration. */
19679 {
19681 {
19684 }
19693 }
19695 /* Finish processing the declaration. But, skip member
19696 declarations. */
19698 {
19701 asm_specification,
19702 /* If the initializer is in parentheses, then this is
19703 a direct-initialization, which means that an
19704 `explicit' constructor is OK. Otherwise, an
19705 `explicit' constructor cannot be used. */
19708 }
19711 /* Core issue #226 (C++0x only): A default template-argument
19712 shall not be specified in a friend class template
19713 declaration. */
19722 {
19725 else
19727 }
19734 }
19736 /* Parse a declarator.
19738 declarator:
19739 direct-declarator
19740 ptr-operator declarator
19742 abstract-declarator:
19743 ptr-operator abstract-declarator [opt]
19744 direct-abstract-declarator
19746 GNU Extensions:
19748 declarator:
19749 attributes [opt] direct-declarator
19750 attributes [opt] ptr-operator declarator
19752 abstract-declarator:
19753 attributes [opt] ptr-operator abstract-declarator [opt]
19754 attributes [opt] direct-abstract-declarator
19756 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19757 detect constructors, destructors, deduction guides, or conversion operators.
19758 It is set to -1 if the declarator is a name, and +1 if it is a
19759 function. Otherwise it is set to zero. Usually you just want to
19760 test for >0, but internally the negative value is used.
19762 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19763 a decl-specifier-seq unless it declares a constructor, destructor,
19764 or conversion. It might seem that we could check this condition in
19765 semantic analysis, rather than parsing, but that makes it difficult
19766 to handle something like `f()'. We want to notice that there are
19767 no decl-specifiers, and therefore realize that this is an
19768 expression, not a declaration.)
19770 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19771 the declarator is a direct-declarator of the form "(...)".
19773 MEMBER_P is true iff this declarator is a member-declarator.
19775 FRIEND_P is true iff this declarator is a friend. */
19779 cp_parser_declarator_kind dcl_kind,
19783 {
19786 cp_cv_quals cv_quals;
19787 tree class_type;
19790 /* Assume this is not a constructor, destructor, or type-conversion
19791 operator. */
19798 /* Check for the ptr-operator production. */
19800 /* Parse the ptr-operator. */
19806 /* If that worked, then we have a ptr-operator. */
19808 {
19809 /* If a ptr-operator was found, then this declarator was not
19810 parenthesized. */
19813 /* The dependent declarator is optional if we are parsing an
19814 abstract-declarator. */
19818 /* Parse the dependent declarator. */
19823 friend_p);
19825 /* If we are parsing an abstract-declarator, we must handle the
19826 case where the dependent declarator is absent. */
19831 declarator = cp_parser_make_indirect_declarator
19833 }
19834 /* Everything else is a direct-declarator. */
19835 else
19836 {
19839 CPP_OPEN_PAREN);
19841 ctor_dtor_or_conv_p,
19843 }
19848 }
19850 /* Parse a direct-declarator or direct-abstract-declarator.
19852 direct-declarator:
19853 declarator-id
19854 direct-declarator ( parameter-declaration-clause )
19855 cv-qualifier-seq [opt]
19856 ref-qualifier [opt]
19857 exception-specification [opt]
19858 direct-declarator [ constant-expression [opt] ]
19859 ( declarator )
19861 direct-abstract-declarator:
19862 direct-abstract-declarator [opt]
19863 ( parameter-declaration-clause )
19864 cv-qualifier-seq [opt]
19865 ref-qualifier [opt]
19866 exception-specification [opt]
19867 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19868 ( abstract-declarator )
19870 Returns a representation of the declarator. DCL_KIND is
19871 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19872 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19873 we are parsing a direct-declarator. It is
19874 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19875 of ambiguity we prefer an abstract declarator, as per
19876 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19877 as for cp_parser_declarator. */
19881 cp_parser_declarator_kind dcl_kind,
19884 {
19895 {
19896 /* Peek at the next token. */
19899 {
19900 /* This is either a parameter-declaration-clause, or a
19901 parenthesized declarator. When we know we are parsing a
19902 named declarator, it must be a parenthesized declarator
19903 if FIRST is true. For instance, `(int)' is a
19904 parameter-declaration-clause, with an omitted
19905 direct-abstract-declarator. But `((*))', is a
19906 parenthesized abstract declarator. Finally, when T is a
19907 template parameter `(T)' is a
19908 parameter-declaration-clause, and not a parenthesized
19909 named declarator.
19911 We first try and parse a parameter-declaration-clause,
19912 and then try a nested declarator (if FIRST is true).
19914 It is not an error for it not to be a
19915 parameter-declaration-clause, even when FIRST is
19916 false. Consider,
19918 int i (int);
19919 int i (3);
19921 The first is the declaration of a function while the
19922 second is the definition of a variable, including its
19923 initializer.
19925 Having seen only the parenthesis, we cannot know which of
19926 these two alternatives should be selected. Even more
19927 complex are examples like:
19929 int i (int (a));
19930 int i (int (3));
19932 The former is a function-declaration; the latter is a
19933 variable initialization.
19935 Thus again, we try a parameter-declaration-clause, and if
19936 that fails, we back out and return. */
19939 {
19940 tree params;
19945 /* In a member-declarator, the only valid interpretation
19946 of a parenthesis is the start of a
19947 parameter-declaration-clause. (It is invalid to
19948 initialize a static data member with a parenthesized
19949 initializer; only the "=" form of initialization is
19950 permitted.) */
19954 /* Consume the `('. */
19955 matching_parens parens;
19958 {
19959 /* If this is going to be an abstract declarator, we're
19960 in a declarator and we can't have default args. */
19963 }
19967 /* Parse the parameter-declaration-clause. */
19970 /* Consume the `)'. */
19973 /* If all went well, parse the cv-qualifier-seq,
19974 ref-qualifier and the exception-specification. */
19976 {
19977 cp_cv_quals cv_quals;
19978 cp_virt_specifiers virt_specifiers;
19979 cp_ref_qualifier ref_qual;
19980 tree exception_specification;
19981 tree late_return;
19982 tree attrs;
19992 /* Parse the cv-qualifier-seq. */
19994 /* Parse the ref-qualifier. */
19996 /* Parse the tx-qualifier. */
19998 /* And the exception-specification. */
19999 exception_specification
20004 /* In here, we handle cases where attribute is used after
20005 the function declaration. For example:
20006 void func (int x) __attribute__((vector(..))); */
20009 late_return = (cp_parser_late_return_type_opt
20013 /* Parse the virt-specifier-seq. */
20016 /* Create the function-declarator. */
20018 params,
20019 cv_quals,
20020 virt_specifiers,
20021 ref_qual,
20022 tx_qual,
20023 exception_specification,
20024 late_return,
20025 requires_clause);
20028 /* Any subsequent parameter lists are to do with
20029 return type, so are not those of the declared
20030 function. */
20032 }
20034 /* Remove the function parms from scope. */
20038 /* Repeat the main loop. */
20040 }
20042 /* If this is the first, we can try a parenthesized
20043 declarator. */
20045 {
20052 /* Consume the `('. */
20053 matching_parens parens;
20055 /* Parse the nested declarator. */
20058 declarator
20064 /* Expect a `)'. */
20072 }
20073 /* Otherwise, we must be done. */
20074 else
20076 }
20080 {
20081 /* Parse an array-declarator. */
20091 /* Consume the `['. */
20093 /* Peek at the next token. */
20095 /* If the next token is `]', then there is no
20096 constant-expression. */
20098 {
20100 bounds
20110 {
20111 /* Normally, the array bound must be an integral constant
20112 expression. However, as an extension, we allow VLAs
20113 in function scopes as long as they aren't part of a
20114 parameter declaration. */
20118 }
20121 {
20122 /* Remember this wasn't a constant-expression. */
20125 }
20126 }
20127 else
20129 /* Look for the closing `]'. */
20131 {
20134 }
20139 }
20141 {
20142 {
20143 tree qualifying_scope;
20144 tree unqualified_name;
20145 tree attrs;
20146 special_function_kind sfk;
20151 /* Parse a declarator-id */
20154 {
20157 /* If we see an ellipsis, we should be looking at a
20158 parameter pack. */
20160 {
20161 /* Consume the `...' */
20165 }
20166 }
20169 unqualified_name
20173 {
20177 {
20178 /* Check whether an error occurred. */
20181 /* We already consumed the ellipsis to mark a
20182 parameter pack, but we have no way to report it,
20183 so abort the tentative parse. We will be exiting
20184 immediately anyway. */
20186 }
20187 else
20193 && (qualifying_scope
20195 {
20198 }
20199 }
20204 {
20209 }
20215 {
20216 /* In the declaration of a member of a template class
20217 outside of the class itself, the SCOPE will sometimes
20218 be a TYPENAME_TYPE. For example, given:
20220 template <typename T>
20221 int S<T>::R::i = 3;
20223 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20224 this context, we must resolve S<T>::R to an ordinary
20225 type, rather than a typename type.
20227 The reason we normally avoid resolving TYPENAME_TYPEs
20228 is that a specialization of `S' might render
20229 `S<T>::R' not a type. However, if `S' is
20230 specialized, then this `i' will not be used, so there
20231 is no harm in resolving the types here. */
20232 tree type;
20234 /* Resolve the TYPENAME_TYPE. */
20237 /* If that failed, the declarator is invalid. */
20239 {
20242 "cannot define member of dependent typedef "
20244 else
20249 }
20251 }
20256 {
20257 tree class_type;
20262 else
20266 {
20270 {
20271 /* We do not attempt to print the declarator
20272 here because we do not have enough
20273 information about its original syntactic
20274 form. */
20278 }
20281 {
20285 "use %<%T::%D%> instead of %<%T::%D%> to "
20287 class_type,
20292 }
20294 }
20297 {
20304 for an unnamed type, even if the type
20305 got a name for linkage purposes. */
20307 /* Handle correctly (c++/19200):
20309 struct S {
20310 struct T{};
20311 friend void S(T);
20312 };
20314 and also:
20316 namespace N {
20317 void S();
20318 }
20320 struct S {
20321 friend void N::S();
20322 }; */
20325 class_type))
20334 }
20335 }
20337 unqualified_name,
20338 sfk);
20345 }
20347 handle_declarator:;
20350 {
20351 /* Any names that appear after the declarator-id for a
20352 member are looked up in the containing scope. */
20354 {
20355 /* But declarations with qualified-ids can't appear in a
20356 function. */
20360 }
20362 }
20366 /* Default args are only allowed on function
20367 declarations. */
20369 else
20373 }
20374 /* We're done. */
20375 else
20377 }
20379 /* For an abstract declarator, we might wind up with nothing at this
20380 point. That's an error; the declarator is not optional. */
20384 {
20385 /* Record overly parenthesized declarator so we can give a
20386 diagnostic about confusing decl/expr disambiguation. */
20388 {
20389 /* If the open and close parens are on different lines, this
20390 is probably a formatting thing, so ignore. */
20395 }
20398 }
20400 /* If we entered a scope, we must exit it now. */
20408 }
20410 /* Parse a ptr-operator.
20412 ptr-operator:
20413 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20414 * cv-qualifier-seq [opt]
20415 &
20416 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20417 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20419 GNU Extension:
20421 ptr-operator:
20422 & cv-qualifier-seq [opt]
20424 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20425 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20426 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20427 filled in with the TYPE containing the member. *CV_QUALS is
20428 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20429 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20430 Note that the tree codes returned by this function have nothing
20431 to do with the types of trees that will be eventually be created
20432 to represent the pointer or reference type being parsed. They are
20433 just constants with suggestive names. */
20434 static enum tree_code
20439 {
20444 /* Assume that it's not a pointer-to-member. */
20446 /* And that there are no cv-qualifiers. */
20449 /* Peek at the next token. */
20452 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20462 {
20463 /* Consume the `*', `&' or `&&'. */
20466 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20467 `&', if we are allowing GNU extensions. (The only qualifier
20468 that can legally appear after `&' is `restrict', but that is
20469 enforced during semantic analysis. */
20477 }
20478 else
20479 {
20480 /* Try the pointer-to-member case. */
20482 /* Look for the optional `::' operator. */
20485 /* Look for the nested-name specifier. */
20492 /* If we found it, and the next token is a `*', then we are
20493 indeed looking at a pointer-to-member operator. */
20496 {
20497 /* Indicate that the `*' operator was used. */
20505 else
20506 {
20507 /* The type of which the member is a member is given by the
20508 current SCOPE. */
20510 /* The next name will not be qualified. */
20514 /* Look for optional c++11 attributes. */
20518 /* Look for the optional cv-qualifier-seq. */
20520 }
20521 }
20522 /* If that didn't work we don't have a ptr-operator. */
20525 }
20528 }
20530 /* Parse an (optional) cv-qualifier-seq.
20532 cv-qualifier-seq:
20533 cv-qualifier cv-qualifier-seq [opt]
20535 cv-qualifier:
20536 const
20537 volatile
20539 GNU Extension:
20541 cv-qualifier:
20542 __restrict__
20544 Returns a bitmask representing the cv-qualifiers. */
20546 static cp_cv_quals
20548 {
20552 {
20554 cp_cv_quals cv_qualifier;
20556 /* Peek at the next token. */
20558 /* See if it's a cv-qualifier. */
20560 {
20576 }
20582 {
20587 }
20588 else
20589 {
20592 }
20593 }
20596 }
20598 /* Parse an (optional) ref-qualifier
20600 ref-qualifier:
20601 &
20602 &&
20604 Returns cp_ref_qualifier representing ref-qualifier. */
20606 static cp_ref_qualifier
20608 {
20611 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20616 {
20621 {
20633 }
20638 {
20641 }
20642 else
20643 {
20646 }
20647 }
20650 }
20652 /* Parse an optional tx-qualifier.
20654 tx-qualifier:
20655 transaction_safe
20656 transaction_safe_dynamic */
20658 static tree
20660 {
20663 {
20668 {
20672 {
20675 {
20678 }
20679 else
20681 }
20682 }
20683 }
20685 }
20687 /* Parse an (optional) virt-specifier-seq.
20689 virt-specifier-seq:
20690 virt-specifier virt-specifier-seq [opt]
20692 virt-specifier:
20693 override
20694 final
20696 Returns a bitmask representing the virt-specifiers. */
20698 static cp_virt_specifiers
20700 {
20704 {
20706 cp_virt_specifiers virt_specifier;
20708 /* Peek at the next token. */
20710 /* See if it's a virt-specifier-qualifier. */
20714 {
20717 }
20719 {
20722 }
20724 {
20726 }
20727 else
20731 {
20736 }
20737 else
20738 {
20741 }
20742 }
20744 }
20746 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20747 is in scope even though it isn't real. */
20749 void
20751 {
20752 tree this_parm;
20755 {
20756 /* We don't clear this between NSDMIs. Is it already what we want? */
20763 }
20766 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20768 current_class_ref
20771 }
20773 /* Return true iff our current scope is a non-static data member
20774 initializer. */
20776 bool
20778 {
20779 /* We recognize NSDMI context by the context-less 'this' pointer set up
20780 by the function above. */
20786 }
20788 /* Parse a late-specified return type, if any. This is not a separate
20789 non-terminal, but part of a function declarator, which looks like
20791 -> trailing-type-specifier-seq abstract-declarator(opt)
20793 Returns the type indicated by the type-id.
20795 In addition to this, parse any queued up #pragma omp declare simd
20796 clauses, and #pragma acc routine clauses.
20798 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20799 function. */
20801 static tree
20804 {
20808 && declarator
20812 && declarator
20815 /* Peek at the next token. */
20817 /* A late-specified return type is indicated by an initial '->'. */
20828 {
20829 /* DR 1207: 'this' is in scope in the trailing return type. */
20831 }
20834 {
20835 /* Consume the ->. */
20839 }
20841 /* Function declarations may be followed by a trailing
20842 requires-clause. */
20846 declarator->attributes
20850 declarator->attributes
20855 {
20858 }
20861 }
20863 /* Parse a declarator-id.
20865 declarator-id:
20866 id-expression
20867 :: [opt] nested-name-specifier [opt] type-name
20869 In the `id-expression' case, the value returned is as for
20870 cp_parser_id_expression if the id-expression was an unqualified-id.
20871 If the id-expression was a qualified-id, then a SCOPE_REF is
20872 returned. The first operand is the scope (either a NAMESPACE_DECL
20873 or TREE_TYPE), but the second is still just a representation of an
20874 unqualified-id. */
20876 static tree
20878 {
20879 tree id;
20880 /* The expression must be an id-expression. Assume that qualified
20881 names are the names of types so that:
20883 template <class T>
20884 int S<T>::R::i = 3;
20886 will work; we must treat `S<T>::R' as the name of a type.
20887 Similarly, assume that qualified names are templates, where
20888 required, so that:
20890 template <class T>
20891 int S<T>::R<T>::i = 3;
20893 will work, too. */
20899 optional_p);
20903 }
20905 /* Parse a type-id.
20907 type-id:
20908 type-specifier-seq abstract-declarator [opt]
20910 Returns the TYPE specified. */
20912 static tree
20915 {
20916 cp_decl_specifier_seq type_specifier_seq;
20919 /* Parse the type-specifier-seq. */
20921 is_trailing_return,
20926 /* A bare template name as a template argument is a template template
20927 argument, not a placeholder, so fail parsing it as a type argument. */
20928 {
20932 }
20936 /* There might or might not be an abstract declarator. */
20938 /* Look for the declarator. */
20939 abstract_declarator
20944 /* Check to see if there really was a declarator. */
20949 /* The concepts TS allows 'auto' as a type-id. */
20951 /* None of the valid uses of 'auto' in C++14 involve the type-id
20952 nonterminal, but it is valid in a trailing-return-type. */
20955 {
20956 /* A type-id with type 'auto' is only ok if the abstract declarator
20957 is a function declarator with a late-specified return type.
20959 A type-id with 'auto' is also valid in a trailing-return-type
20960 in a compound-requirement. */
20967 else
20968 {
20971 {
20973 auto_node);
20975 tmpl);
20976 }
20977 else
20980 }
20981 }
20984 is_template_arg);
20985 }
20987 static tree
20989 {
20991 }
20993 static tree
20995 {
20996 tree r;
20998 parser->type_definition_forbidden_message
21003 {
21006 }
21008 }
21010 static tree
21012 {
21014 }
21016 /* Parse a type-specifier-seq.
21018 type-specifier-seq:
21019 type-specifier type-specifier-seq [opt]
21021 GNU extension:
21023 type-specifier-seq:
21024 attributes type-specifier-seq [opt]
21026 If IS_DECLARATION is true, we are at the start of a "condition" or
21027 exception-declaration, so we might be followed by a declarator-id.
21029 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21030 i.e. we've just seen "->".
21032 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21034 static void
21039 {
21044 /* Clear the TYPE_SPECIFIER_SEQ. */
21047 /* In the context of a trailing return type, enum E { } is an
21048 elaborated-type-specifier followed by a function-body, not an
21049 enum-specifier. */
21053 /* Parse the type-specifiers and attributes. */
21055 {
21056 tree type_specifier;
21059 /* Check for attributes first. */
21061 {
21062 type_specifier_seq->attributes
21066 }
21068 /* record the token of the beginning of the type specifier seq,
21069 for error reporting purposes*/
21073 /* Look for the type-specifier. */
21075 flags,
21076 type_specifier_seq,
21078 NULL,
21081 {
21082 /* If the first type-specifier could not be found, this is not a
21083 type-specifier-seq at all. */
21085 {
21086 /* Set in_declarator_p to avoid skipping to the semicolon. */
21098 }
21099 /* If subsequent type-specifiers could not be found, the
21100 type-specifier-seq is complete. */
21102 }
21105 /* The standard says that a condition can be:
21107 type-specifier-seq declarator = assignment-expression
21109 However, given:
21111 struct S {};
21112 if (int S = ...)
21114 we should treat the "S" as a declarator, not as a
21115 type-specifier. The standard doesn't say that explicitly for
21116 type-specifier-seq, but it does say that for
21117 decl-specifier-seq in an ordinary declaration. Perhaps it
21118 would be clearer just to allow a decl-specifier-seq here, and
21119 then add a semantic restriction that if any decl-specifiers
21120 that are not type-specifiers appear, the program is invalid. */
21123 }
21124 }
21126 /* Return whether the function currently being declared has an associated
21127 template parameter list. */
21129 static bool
21131 {
21144 }
21146 /* Parse a parameter-declaration-clause.
21148 parameter-declaration-clause:
21149 parameter-declaration-list [opt] ... [opt]
21150 parameter-declaration-list , ...
21152 Returns a representation for the parameter declarations. A return
21153 value of NULL indicates a parameter-declaration-clause consisting
21154 only of an ellipsis. */
21156 static tree
21158 {
21159 tree parameters;
21168 parser->auto_is_implicit_function_template_parm_p
21170 }
21176 && !processing_template_parmlist
21182 /* Peek at the next token. */
21184 /* Check for trivial parameter-declaration-clauses. */
21186 {
21187 /* Consume the `...' token. */
21190 }
21192 /* There are no parameters. */
21193 {
21194 #ifndef NO_IMPLICIT_EXTERN_C
21199 else
21200 #endif
21202 }
21203 /* Check for `(void)', too, which is a special case. */
21207 {
21208 /* Consume the `void' token. */
21210 /* There are no parameters. */
21212 }
21214 /* Parse the parameter-declaration-list. */
21216 /* If a parse error occurred while parsing the
21217 parameter-declaration-list, then the entire
21218 parameter-declaration-clause is erroneous. */
21222 /* Peek at the next token. */
21224 /* If it's a `,', the clause should terminate with an ellipsis. */
21226 {
21227 /* Consume the `,'. */
21229 /* Expect an ellipsis. */
21230 ellipsis_p
21232 }
21233 /* It might also be `...' if the optional trailing `,' was
21234 omitted. */
21236 {
21237 /* Consume the `...' token. */
21239 /* And remember that we saw it. */
21241 }
21242 else
21245 /* Finish the parameter list. */
21250 }
21252 /* Parse a parameter-declaration-list.
21254 parameter-declaration-list:
21255 parameter-declaration
21256 parameter-declaration-list , parameter-declaration
21258 Returns a representation of the parameter-declaration-list, as for
21259 cp_parser_parameter_declaration_clause. However, the
21260 `void_list_node' is never appended to the list. Upon return,
21261 *IS_ERROR will be true iff an error occurred. */
21263 static tree
21265 {
21271 /* Assume all will go well. */
21273 /* The special considerations that apply to a function within an
21274 unbraced linkage specifications do not apply to the parameters
21275 to the function. */
21276 saved_in_unbraced_linkage_specification_p
21280 /* Look for more parameters. */
21282 {
21290 /* Parse the parameter. */
21291 parameter
21296 /* We don't know yet if the enclosing context is deprecated, so wait
21297 and warn in grokparms if appropriate. */
21301 {
21302 /* If a function parameter pack was specified and an implicit template
21303 parameter was introduced during cp_parser_parameter_declaration,
21304 change any implicit parameters introduced into packs. */
21308 {
21316 }
21320 PARM,
21325 }
21329 /* If a parse error occurred parsing the parameter declaration,
21330 then the entire parameter-declaration-list is erroneous. */
21332 {
21336 }
21346 {
21350 }
21352 /* Add the new parameter to the list. */
21356 /* Peek at the next token. */
21359 /* These are for Objective-C++ */
21362 /* The parameter-declaration-list is complete. */
21365 {
21368 /* Peek at the next token. */
21370 /* If it's an ellipsis, then the list is complete. */
21373 /* Otherwise, there must be more parameters. Consume the
21374 `,'. */
21376 /* When parsing something like:
21378 int i(float f, double d)
21380 we can tell after seeing the declaration for "f" that we
21381 are not looking at an initialization of a variable "i",
21382 but rather at the declaration of a function "i".
21384 Due to the fact that the parsing of template arguments
21385 (as specified to a template-id) requires backtracking we
21386 cannot use this technique when inside a template argument
21387 list. */
21391 /* However, a parameter-declaration of the form
21392 "float(f)" (which is a valid declaration of a
21393 parameter "f") can also be interpreted as an
21394 expression (the conversion of "f" to "float"). */
21397 }
21398 else
21399 {
21407 }
21408 }
21410 parser->in_unbraced_linkage_specification_p
21413 /* Reset implicit_template_scope if we are about to leave the function
21414 parameter list that introduced it. Note that for out-of-line member
21415 definitions, there will be one or more class scopes before we get to
21416 the template parameter scope. */
21420 {
21424 {
21427 }
21428 }
21431 }
21433 /* Parse a parameter declaration.
21435 parameter-declaration:
21436 decl-specifier-seq ... [opt] declarator
21437 decl-specifier-seq declarator = assignment-expression
21438 decl-specifier-seq ... [opt] abstract-declarator [opt]
21439 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21441 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21442 declares a template parameter. (In that case, a non-nested `>'
21443 token encountered during the parsing of the assignment-expression
21444 is not interpreted as a greater-than operator.)
21446 Returns a representation of the parameter, or NULL if an error
21447 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21448 true iff the declarator is of the form "(p)". */
21454 {
21456 cp_decl_specifier_seq decl_specifiers;
21458 tree default_argument;
21463 /* In a template parameter, `>' is not an operator.
21465 [temp.param]
21467 When parsing a default template-argument for a non-type
21468 template-parameter, the first non-nested `>' is taken as the end
21469 of the template parameter-list rather than a greater-than
21470 operator. */
21472 /* Type definitions may not appear in parameter types. */
21474 parser->type_definition_forbidden_message
21477 /* Parse the declaration-specifiers. */
21480 CP_PARSER_FLAGS_NONE,
21484 /* Complain about missing 'typename' or other invalid type names. */
21489 /* If an error occurred, there's no reason to attempt to parse the
21490 rest of the declaration. */
21492 {
21495 }
21497 /* Peek at the next token. */
21500 /* If the next token is a `)', `,', `=', `>', or `...', then there
21501 is no declarator. However, when variadic templates are enabled,
21502 there may be a declarator following `...'. */
21507 {
21511 }
21512 /* Otherwise, there should be a declarator. */
21513 else
21514 {
21518 /* After seeing a decl-specifier-seq, if the next token is not a
21519 "(", there is no possibility that the code is a valid
21520 expression. Therefore, if parsing tentatively, we commit at
21521 this point. */
21523 /* In an expression context, having seen:
21525 (int((char ...
21527 we cannot be sure whether we are looking at a
21528 function-type (taking a "char" as a parameter) or a cast
21529 of some object of type "char" to "int". */
21535 /* Parse the declarator. */
21538 CP_PARSER_DECLARATOR_EITHER,
21540 parenthesized_p,
21544 /* After the declarator, allow more attributes. */
21545 decl_specifiers.attributes
21549 /* If the declarator is a template parameter pack, remember that and
21550 clear the flag in the declarator itself so we don't get errors
21551 from grokdeclarator. */
21553 {
21556 }
21557 }
21559 /* If the next token is an ellipsis, and we have not seen a declarator
21560 name, and if either the type of the declarator contains parameter
21561 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21562 for, eg, abbreviated integral type names), then we actually have a
21563 parameter pack expansion expression. Otherwise, leave the ellipsis
21564 for a C-style variadic function. */
21567 {
21578 {
21579 /* Consume the `...'. */
21583 /* Build a pack expansion type */
21588 else
21590 }
21591 }
21593 /* The restriction on defining new types applies only to the type
21594 of the parameter, not to the default argument. */
21597 /* If the next token is `=', then process a default argument. */
21599 {
21602 /* If we are defining a class, then the tokens that make up the
21603 default argument must be saved and processed later. */
21609 // A constrained-type-specifier may declare a type template-parameter.
21611 default_argument
21614 // A constrained-type-specifier may declare a template-template-parameter.
21616 default_argument
21619 /* Outside of a class definition, we can just parse the
21620 assignment-expression. */
21621 else
21622 default_argument
21626 {
21628 "default arguments are only "
21630 }
21632 || template_parameter_pack_p
21635 {
21636 /* Find the name of the parameter pack. */
21643 template_parm_p
21649 else
21651 template_parm_p
21658 }
21659 }
21660 else
21663 /* Generate a location for the parameter, ranging from the start of the
21664 initial token to the end of the final token (using input_location for
21665 the latter, set up by cp_lexer_set_source_position_from_token when
21666 consuming tokens).
21668 If we have a identifier, then use it for the caret location, e.g.
21670 extern int callee (int one, int (*two)(int, int), float three);
21671 ~~~~~~^~~~~~~~~~~~~~
21673 otherwise, reuse the start location for the caret location e.g.:
21675 extern int callee (int one, int (*)(int, int), float three);
21676 ^~~~~~~~~~~~~~~~~
21678 */
21684 input_location);
21687 declarator,
21688 default_argument,
21689 param_loc,
21690 template_parameter_pack_p);
21691 }
21693 /* Parse a default argument and return it.
21695 TEMPLATE_PARM_P is true if this is a default argument for a
21696 non-type template parameter. */
21697 static tree
21699 {
21705 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21706 set correctly. */
21709 /* Local variable names (and the `this' keyword) may not
21710 appear in a default argument. */
21713 /* Parse the assignment-expression. */
21718 /* The "this" pointer is not valid in a default argument. */
21720 {
21725 }
21726 default_argument
21728 /* Restore the "this" pointer. */
21730 {
21733 }
21742 }
21744 /* Parse a function-body.
21746 function-body:
21747 compound_statement */
21749 static void
21751 {
21755 }
21757 /* Parse a ctor-initializer-opt followed by a function-body. Return
21758 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21759 is true we are parsing a function-try-block. */
21761 static void
21764 {
21771 /* Begin the function body. */
21773 /* Parse the optional ctor-initializer. */
21776 /* If we're parsing a constexpr constructor definition, we need
21777 to check that the constructor body is indeed empty. However,
21778 before we get to cp_parser_function_body lot of junk has been
21779 generated, so we can't just check that we have an empty block.
21780 Rather we take a snapshot of the outermost block, and check whether
21781 cp_parser_function_body changed its state. */
21783 {
21787 }
21788 /* Parse the function-body. */
21792 /* Finish the function body. */
21794 }
21796 /* Parse an initializer.
21798 initializer:
21799 = initializer-clause
21800 ( expression-list )
21802 Returns an expression representing the initializer. If no
21803 initializer is present, NULL_TREE is returned.
21805 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21806 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21807 set to TRUE if there is no initializer present. If there is an
21808 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21809 is set to true; otherwise it is set to false. */
21811 static tree
21814 {
21816 tree init;
21818 /* Peek at the next token. */
21821 /* Let our caller know whether or not this initializer was
21822 parenthesized. */
21824 /* Assume that the initializer is constant. */
21828 {
21829 /* Consume the `='. */
21831 /* Parse the initializer-clause. */
21833 }
21835 {
21840 non_constant_p);
21845 }
21847 {
21852 }
21853 else
21854 {
21855 /* Anything else is an error. */
21858 }
21864 }
21866 /* Parse an initializer-clause.
21868 initializer-clause:
21869 assignment-expression
21870 braced-init-list
21872 Returns an expression representing the initializer.
21874 If the `assignment-expression' production is used the value
21875 returned is simply a representation for the expression.
21877 Otherwise, calls cp_parser_braced_list. */
21879 static cp_expr
21881 {
21882 cp_expr initializer;
21884 /* Assume the expression is constant. */
21887 /* If it is not a `{', then we are looking at an
21888 assignment-expression. */
21890 {
21891 initializer
21894 non_constant_p);
21895 }
21896 else
21900 }
21902 /* Parse a brace-enclosed initializer list.
21904 braced-init-list:
21905 { initializer-list , [opt] }
21906 { designated-initializer-list , [opt] }
21907 { }
21909 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21910 the elements of the initializer-list (or NULL, if the last
21911 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21912 NULL_TREE. There is no way to detect whether or not the optional
21913 trailing `,' was provided. NON_CONSTANT_P is as for
21914 cp_parser_initializer. */
21916 static cp_expr
21918 {
21919 tree initializer;
21922 /* Consume the `{' token. */
21923 matching_braces braces;
21925 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21927 /* If it's not a `}', then there is a non-trivial initializer. */
21929 {
21930 /* Parse the initializer list. */
21933 /* A trailing `,' token is allowed. */
21936 }
21937 else
21939 /* Now, there should be a trailing `}'. */
21945 /* Build a location of the form:
21946 { ... }
21947 ^~~~~~~
21948 with caret==start at the open brace, finish at the close brace. */
21952 }
21954 /* Consume tokens up to, and including, the next non-nested closing `]'.
21955 Returns true iff we found a closing `]'. */
21957 static bool
21959 {
21963 {
21967 {
21970 /* If we've run out of tokens, then there is no closing `]'. */
21979 {
21982 }
21987 }
21989 /* Consume the token. */
21991 }
21992 }
21994 /* Return true if we are looking at an array-designator, false otherwise. */
21996 static bool
21998 {
21999 /* Consume the `['. */
22004 /* Skip tokens until the next token is a closing square bracket.
22005 If we find the closing `]', and the next token is a `=', then
22006 we are looking at an array designator. */
22007 bool array_designator_p
22011 /* Roll back the tokens we skipped. */
22015 }
22017 /* Parse an initializer-list.
22019 initializer-list:
22020 initializer-clause ... [opt]
22021 initializer-list , initializer-clause ... [opt]
22023 C++2A Extension:
22025 designated-initializer-list:
22026 designated-initializer-clause
22027 designated-initializer-list , designated-initializer-clause
22029 designated-initializer-clause:
22030 designator brace-or-equal-initializer
22032 designator:
22033 . identifier
22035 GNU Extension:
22037 initializer-list:
22038 designation initializer-clause ...[opt]
22039 initializer-list , designation initializer-clause ...[opt]
22041 designation:
22042 . identifier =
22043 identifier :
22044 [ constant-expression ] =
22046 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22047 for the initializer. If the INDEX of the elt is non-NULL, it is the
22048 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22049 as for cp_parser_initializer. */
22053 {
22058 /* Assume all of the expressions are constant. */
22061 /* Parse the rest of the list. */
22063 {
22065 tree designator;
22066 tree initializer;
22070 /* Handle the C++2A syntax, '. id ='. */
22078 {
22081 "C++ designated initializers only available with "
22083 /* Consume the `.'. */
22085 /* Consume the identifier. */
22088 /* Consume the `='. */
22090 }
22091 /* Also, if the next token is an identifier and the following one is a
22092 colon, we are looking at the GNU designated-initializer
22093 syntax. */
22098 {
22099 /* Warn the user that they are using an extension. */
22102 /* Consume the identifier. */
22104 /* Consume the `:'. */
22106 }
22107 /* Also handle C99 array designators, '[ const ] ='. */
22111 {
22112 /* In C++11, [ could start a lambda-introducer. */
22118 {
22121 }
22122 else
22123 {
22128 }
22133 && (!require_potential_rvalue_constant_expression
22137 /* Warn the user that they are using an extension. */
22140 }
22141 else
22145 {
22148 }
22152 {
22156 }
22160 /* Parse the initializer. */
22163 /* If any clause is non-constant, so is the entire initializer. */
22167 /* If we have an ellipsis, this is an initializer pack
22168 expansion. */
22170 {
22173 /* Consume the `...'. */
22180 /* Turn the initializer into an initializer expansion. */
22182 }
22184 /* Add it to the vector. */
22187 /* If the next token is not a comma, we have reached the end of
22188 the list. */
22192 /* Peek at the next token. */
22194 /* If the next token is a `}', then we're still done. An
22195 initializer-clause can have a trailing `,' after the
22196 initializer-list and before the closing `}'. */
22200 /* Consume the `,' token. */
22202 }
22204 /* The same identifier shall not appear in multiple designators
22205 of a designated-initializer-list. */
22207 {
22212 {
22214 {
22216 "%<.%s%> designator used multiple times in "
22220 }
22221 else
22223 }
22227 }
22230 }
22232 /* Classes [gram.class] */
22234 /* Parse a class-name.
22236 class-name:
22237 identifier
22238 template-id
22240 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22241 to indicate that names looked up in dependent types should be
22242 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22243 keyword has been used to indicate that the name that appears next
22244 is a template. TAG_TYPE indicates the explicit tag given before
22245 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22246 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22247 is the class being defined in a class-head. If ENUM_OK is TRUE,
22248 enum-names are also accepted.
22250 Returns the TYPE_DECL representing the class. */
22252 static tree
22261 {
22262 tree decl;
22263 tree scope;
22268 /* All class-names start with an identifier. */
22271 {
22274 }
22276 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22277 to a template-id, so we save it here. */
22282 /* Any name names a type if we're following the `typename' keyword
22283 in a qualified name where the enclosing scope is type-dependent. */
22286 /* Handle the common case (an identifier, but not a template-id)
22287 efficiently. */
22290 {
22294 /* Look for the identifier. */
22298 /* If the next token isn't an identifier, we are certainly not
22299 looking at a class-name. */
22302 /* If we know this is a type-name, there's no need to look it
22303 up. */
22306 else
22307 {
22308 tree ambiguous_decls;
22309 /* If we already know that this lookup is ambiguous, then
22310 we've already issued an error message; there's no reason
22311 to check again. */
22313 {
22316 }
22317 /* If the next token is a `::', then the name must be a type
22318 name.
22320 [basic.lookup.qual]
22322 During the lookup for a name preceding the :: scope
22323 resolution operator, object, function, and enumerator
22324 names are ignored. */
22327 /* Look up the name. */
22329 tag_type,
22332 check_dependency_p,
22336 {
22340 }
22341 }
22342 }
22343 else
22344 {
22345 /* Try a template-id. */
22347 check_dependency_p,
22348 tag_type,
22349 is_declaration);
22352 }
22356 /* If this is a typename, create a TYPENAME_TYPE. */
22358 {
22363 }
22367 /* Check to see that it is really the name of a class. */
22371 /* Situations like this:
22373 template <typename T> struct A {
22374 typename T::template X<int>::I i;
22375 };
22377 are problematic. Is `T::template X<int>' a class-name? The
22378 standard does not seem to be definitive, but there is no other
22379 valid interpretation of the following `::'. Therefore, those
22380 names are considered class-names. */
22381 {
22385 }
22390 /* In Objective-C 2.0, a classname followed by '.' starts a
22391 dot-syntax expression, and it's not a type-name. */
22403 }
22405 /* Parse a class-specifier.
22407 class-specifier:
22408 class-head { member-specification [opt] }
22410 Returns the TREE_TYPE representing the class. */
22412 static tree
22414 {
22415 tree type;
22429 /* Parse the class-head. */
22432 /* If the class-head was a semantic disaster, skip the entire body
22433 of the class. */
22435 {
22439 }
22441 /* Look for the `{'. */
22442 matching_braces braces;
22444 {
22447 }
22452 /* Issue an error message if type-definitions are forbidden here. */
22454 /* Remember that we are defining one more class. */
22456 /* Inside the class, surrounding template-parameter-lists do not
22457 apply. */
22458 saved_num_template_parameter_lists
22461 /* We are not in a function body. */
22464 /* Or in a loop. */
22467 /* Or in a switch. */
22470 /* We are not immediately inside an extern "lang" block. */
22471 saved_in_unbraced_linkage_specification_p
22475 // Associate constraints with the type.
22479 /* Start the class. */
22481 {
22484 }
22488 /* If the type is erroneous, skip the entire body of the class. */
22490 else
22491 /* Parse the member-specification. */
22494 /* Look for the trailing `}'. */
22496 /* Look for trailing attributes to apply to this class. */
22504 /* We've finished a type definition. Check for the common syntax
22505 error of forgetting a semicolon after the definition. We need to
22506 be careful, as we can't just check for not-a-semicolon and be done
22507 with it; the user might have typed:
22509 class X { } c = ...;
22510 class X { } *p = ...;
22512 and so forth. Instead, enumerate all the possible tokens that
22513 might follow this production; if we don't see one of them, then
22514 complain and silently insert the semicolon. */
22515 {
22520 /* Don't try to parse c++11 attributes here. As per the
22521 grammar, that should be a task for
22522 cp_parser_decl_specifier_seq. */
22526 {
22537 /* While it's legal for type qualifiers and storage class
22538 specifiers to follow type definitions in the grammar, only
22539 compiler testsuites contain code like that. Assume that if
22540 we see such code, then what we're really seeing is a case
22541 like:
22543 class X { }
22544 const <type> var = ...;
22546 or
22548 class Y { }
22549 static <type> func (...) ...
22551 i.e. the qualifier or specifier applies to the next
22552 declaration. To do so, however, we need to look ahead one
22553 more token to see if *that* token is a type specifier.
22555 This code could be improved to handle:
22557 class Z { }
22558 static const <type> var = ...; */
22561 {
22564 /* Handling user-defined types here would be nice, but very
22565 tricky. */
22566 want_semicolon
22569 }
22573 }
22575 /* If we don't have a type, then something is very wrong and we
22576 shouldn't try to do anything clever. Likewise for not seeing the
22577 closing brace. */
22579 {
22580 /* Locate the closing brace. */
22581 cp_token_position prev
22586 /* We want to suggest insertion of a ';' immediately *after* the
22587 closing brace, so, if we can, offset the location by 1 column. */
22594 /* If we successfully offset the location, suggest the fix-it. */
22607 else
22610 /* Unget one token and smash it to look as though we encountered
22611 a semicolon in the input stream. */
22616 }
22617 }
22619 /* If this class is not itself within the scope of another class,
22620 then we need to parse the bodies of all of the queued function
22621 definitions. Note that the queued functions defined in a class
22622 are not always processed immediately following the
22623 class-specifier for that class. Consider:
22625 struct A {
22626 struct B { void f() { sizeof (A); } };
22627 };
22629 If `f' were processed before the processing of `A' were
22630 completed, there would be no way to compute the size of `A'.
22631 Note that the nesting we are interested in here is lexical --
22632 not the semantic nesting given by TYPE_CONTEXT. In particular,
22633 for:
22635 struct A { struct B; };
22636 struct A::B { void f() { } };
22638 there is no need to delay the parsing of `A::B::f'. */
22640 {
22641 tree decl;
22648 /* In a first pass, parse default arguments to the functions.
22649 Then, in a second pass, parse the bodies of the functions.
22650 This two-phased approach handles cases like:
22652 struct S {
22653 void f() { g(); }
22654 void g(int i = 3);
22655 };
22657 */
22659 {
22661 /* If there are default arguments that have not yet been processed,
22662 take care of them now. */
22664 {
22669 }
22670 /* Make sure that any template parameters are in scope. */
22672 /* Parse the default argument expressions. */
22674 /* Remove any template parameters from the symbol table. */
22676 }
22678 /* Now parse any NSDMIs. */
22682 {
22684 {
22689 }
22692 }
22699 /* Now do some post-NSDMI bookkeeping. */
22705 /* Now parse the body of the functions. */
22707 {
22708 /* OpenMP UDRs need to be parsed before all other functions. */
22715 }
22716 else
22720 }
22721 else
22724 /* Put back any saved access checks. */
22727 /* Restore saved state. */
22731 parser->num_template_parameter_lists
22733 parser->in_unbraced_linkage_specification_p
22737 }
22739 static tree
22741 {
22742 tree ret;
22747 }
22749 /* Parse a class-head.
22751 class-head:
22752 class-key identifier [opt] base-clause [opt]
22753 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22754 class-key nested-name-specifier [opt] template-id
22755 base-clause [opt]
22757 class-virt-specifier:
22758 final
22760 GNU Extensions:
22761 class-key attributes identifier [opt] base-clause [opt]
22762 class-key attributes nested-name-specifier identifier base-clause [opt]
22763 class-key attributes nested-name-specifier [opt] template-id
22764 base-clause [opt]
22766 Upon return BASES is initialized to the list of base classes (or
22767 NULL, if there are none) in the same form returned by
22768 cp_parser_base_clause.
22770 Returns the TYPE of the indicated class. Sets
22771 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22772 involving a nested-name-specifier was used, and FALSE otherwise.
22774 Returns error_mark_node if this is not a class-head.
22776 Returns NULL_TREE if the class-head is syntactically valid, but
22777 semantically invalid in a way that means we should skip the entire
22778 body of the class. */
22780 static tree
22783 {
22784 tree nested_name_specifier;
22788 tree attributes;
22789 tree bases;
22799 /* Assume no nested-name-specifier will be present. */
22801 /* Assume no template parameter lists will be used in defining the
22802 type. */
22806 /* Look for the class-key. */
22813 /* Parse the attributes. */
22816 /* If the next token is `::', that is invalid -- but sometimes
22817 people do try to write:
22819 struct ::S {};
22821 Handle this gracefully by accepting the extra qualifier, and then
22822 issuing an error about it later if this really is a
22823 class-head. If it turns out just to be an elaborated type
22824 specifier, remain silent. */
22830 /* Determine the name of the class. Begin by looking for an
22831 optional nested-name-specifier. */
22833 nested_name_specifier
22839 /* If there was a nested-name-specifier, then there *must* be an
22840 identifier. */
22845 {
22847 /* Although the grammar says `identifier', it really means
22848 `class-name' or `template-name'. You are only allowed to
22849 define a class that has already been declared with this
22850 syntax.
22852 The proposed resolution for Core Issue 180 says that wherever
22853 you see `class T::X' you should treat `X' as a type-name.
22855 It is OK to define an inaccessible class; for example:
22857 class A { class B; };
22858 class A::B {};
22860 We do not know if we will see a class-name, or a
22861 template-name. We look for a class-name first, in case the
22862 class-name is a template-id; if we looked for the
22863 template-name first we would stop after the template-name. */
22870 class_type,
22874 /* If that didn't work, ignore the nested-name-specifier. */
22876 {
22882 }
22883 /* If we could not find a corresponding TYPE, treat this
22884 declaration like an unqualified declaration. */
22887 /* Otherwise, count the number of templates used in TYPE and its
22888 containing scopes. */
22889 else
22890 {
22891 tree scope;
22903 }
22904 }
22905 /* Otherwise, the identifier is optional. */
22906 else
22907 {
22908 /* We don't know whether what comes next is a template-id,
22909 an identifier, or nothing at all. */
22911 /* Check for a template-id. */
22916 class_key,
22918 /* If that didn't work, it could still be an identifier. */
22920 {
22922 {
22925 }
22926 else
22928 }
22929 else
22930 {
22933 }
22934 }
22939 {
22941 class_key,
22943 }
22946 /* If it's not a `:' or a `{' then we can't really be looking at a
22947 class-head, since a class-head only appears as part of a
22948 class-specifier. We have to detect this situation before calling
22949 xref_tag, since that has irreversible side-effects. */
22951 {
22955 }
22957 /* At this point, we're going ahead with the class-specifier, even
22958 if some other problem occurs. */
22961 {
22966 }
22967 /* Issue the error about the overly-qualified name now. */
22969 {
22974 }
22976 {
22981 }
22983 {
22984 tree scope;
22987 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22988 keyword template shall not appear at the top level. */
22992 /* Reject typedef-names in class heads. */
22994 {
22997 type);
23000 }
23002 /* Figure out in what scope the declaration is being placed. */
23004 /* If that scope does not contain the scope in which the
23005 class was originally declared, the program is invalid. */
23007 {
23010 "declaration of %qD in namespace %qD which does not "
23013 else
23019 }
23020 /* [dcl.meaning]
23022 A declarator-id shall not be qualified except for the
23023 definition of a ... nested class outside of its class
23024 ... [or] the definition or explicit instantiation of a
23025 class member of a namespace outside of its namespace. */
23027 {
23032 }
23033 }
23034 /* An explicit-specialization must be preceded by "template <>". If
23035 it is not, try to recover gracefully. */
23038 && !processing_template_parmlist
23040 {
23041 /* Build a location of this form:
23042 struct typename <ARGS>
23043 ^~~~~~~~~~~~~~~~~~~~~~
23044 with caret==start at the start token, and
23045 finishing at the end of the type. */
23046 location_t reported_loc
23048 class_head_start_location,
23054 "an explicit specialization must be preceded by"
23057 /* Take the same action that would have been taken by
23058 cp_parser_explicit_specialization. */
23061 }
23062 /* There must be no "return" statements between this point and the
23063 end of this function; set "type "to the correct return value and
23064 use "goto done;" to return. */
23065 /* Make sure that the right number of template parameters were
23066 present. */
23070 {
23071 /* If something went wrong, there is no point in even trying to
23072 process the class-definition. */
23075 }
23077 /* Look up the type. */
23079 {
23083 {
23087 }
23088 else
23089 {
23093 /* Check the scope while we still know whether or not we had a
23094 nested-name-specifier. */
23097 }
23100 }
23102 {
23103 tree class_type;
23105 /* Given:
23107 template <typename T> struct S { struct T };
23108 template <typename T> struct S<T>::T { };
23110 we will get a TYPENAME_TYPE when processing the definition of
23111 `S::T'. We need to resolve it to the actual type before we
23112 try to define it. */
23114 {
23119 else
23120 {
23123 }
23124 }
23128 {
23131 }
23134 /* Enter the scope indicated by the nested-name-specifier. */
23136 /* Get the canonical version of this type. */
23138 /* Call push_template_decl if it seems like we should be defining a
23139 template either from the template headers or the type we're
23140 defining, so that we diagnose both extra and missing headers. */
23144 {
23147 {
23150 }
23151 }
23155 }
23157 {
23158 /* If the class was unnamed, create a dummy name. */
23162 ? ts_within_enclosing_non_class
23166 }
23168 /* Indicate whether this class was declared as a `class' or as a
23169 `struct'. */
23174 /* If this type was already complete, and we see another definition,
23175 that's an error. */
23177 {
23179 type);
23181 type);
23184 }
23189 {
23190 /* Apply attributes now, before any use of the class as a template
23191 argument in its base list. */
23194 }
23196 /* We will have entered the scope containing the class; the names of
23197 base classes should be looked up in that context. For example:
23199 struct A { struct B {}; struct C; };
23200 struct A::C : B {};
23202 is valid. */
23204 /* Get the list of base-classes, if there is one. */
23206 {
23207 /* PR59482: enter the class scope so that base-specifiers are looked
23208 up correctly. */
23212 /* PR59482: get out of the previously pushed class scope so that the
23213 subsequent pops pop the right thing. */
23216 }
23217 else
23220 /* If we're really defining a class, process the base classes.
23221 If they're invalid, fail. */
23225 done:
23226 /* Leave the scope given by the nested-name-specifier. We will
23227 enter the class scope itself while processing the members. */
23232 {
23235 }
23241 out:
23244 }
23246 /* Parse a class-key.
23248 class-key:
23249 class
23250 struct
23251 union
23253 Returns the kind of class-key specified, or none_type to indicate
23254 error. */
23256 static enum tag_types
23258 {
23262 /* Look for the class-key. */
23267 /* Check to see if the TOKEN is a class-key. */
23272 }
23274 /* Parse a type-parameter-key.
23276 type-parameter-key:
23277 class
23278 typename
23279 */
23281 static void
23283 {
23284 /* Look for the type-parameter-key. */
23288 {
23291 /* typename is not allowed in a template template parameter
23292 by the standard until C++17. */
23294 "ISO C++ forbids typename key in template template parameter;"
23296 }
23297 else
23301 }
23303 /* Parse an (optional) member-specification.
23305 member-specification:
23306 member-declaration member-specification [opt]
23307 access-specifier : member-specification [opt] */
23309 static void
23311 {
23313 {
23317 /* Peek at the next token. */
23319 /* If it's a `}', or EOF then we've seen all the members. */
23325 /* See if this token is a keyword. */
23328 {
23332 /* Consume the access-specifier. */
23334 /* Remember which access-specifier is active. */
23336 /* Look for the `:'. */
23341 /* Accept #pragmas at class scope. */
23343 {
23346 }
23348 /* Otherwise, the next construction must be a
23349 member-declaration. */
23351 }
23352 }
23353 }
23355 /* Parse a member-declaration.
23357 member-declaration:
23358 decl-specifier-seq [opt] member-declarator-list [opt] ;
23359 function-definition ; [opt]
23360 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23361 using-declaration
23362 template-declaration
23363 alias-declaration
23365 member-declarator-list:
23366 member-declarator
23367 member-declarator-list , member-declarator
23369 member-declarator:
23370 declarator pure-specifier [opt]
23371 declarator constant-initializer [opt]
23372 identifier [opt] : constant-expression
23374 GNU Extensions:
23376 member-declaration:
23377 __extension__ member-declaration
23379 member-declarator:
23380 declarator attributes [opt] pure-specifier [opt]
23381 declarator attributes [opt] constant-initializer [opt]
23382 identifier [opt] attributes [opt] : constant-expression
23384 C++0x Extensions:
23386 member-declaration:
23387 static_assert-declaration */
23389 static void
23391 {
23392 cp_decl_specifier_seq decl_specifiers;
23393 tree prefix_attributes;
23394 tree decl;
23403 /* Check for the `__extension__' keyword. */
23405 {
23406 /* Recurse. */
23408 /* Restore the old value of the PEDANTIC flag. */
23412 }
23414 /* Check for a template-declaration. */
23416 {
23417 /* An explicit specialization here is an error condition, and we
23418 expect the specialization handler to detect and report this. */
23422 else
23426 }
23427 /* Check for a template introduction. */
23431 /* Check for a using-declaration. */
23433 {
23435 {
23436 /* Parse the using-declaration. */
23440 }
23441 else
23442 {
23443 tree decl;
23447 /* Note that if we actually see the '=' token after the
23448 identifier, cp_parser_alias_declaration commits the
23449 tentative parse. In that case, we really expect an
23450 alias-declaration. Otherwise, we expect a using
23451 declaration. */
23452 alias_decl_expected =
23458 else
23462 }
23463 }
23465 /* Check for @defs. */
23467 {
23472 {
23477 }
23479 }
23481 /* If the next token is `static_assert' we have a static assertion. */
23483 {
23486 }
23493 /* Parse the decl-specifier-seq. */
23496 CP_PARSER_FLAGS_OPTIONAL,
23499 /* Check for an invalid type-name. */
23503 /* If there is no declarator, then the decl-specifier-seq should
23504 specify a type. */
23506 {
23507 /* If there was no decl-specifier-seq, and the next token is a
23508 `;', then we have something like:
23510 struct S { ; };
23512 [class.mem]
23514 Each member-declaration shall declare at least one member
23515 name of the class. */
23517 {
23520 {
23524 }
23525 }
23526 else
23527 {
23528 tree type;
23530 /* See if this declaration is a friend. */
23532 /* If there were decl-specifiers, check to see if there was
23533 a class-declaration. */
23536 /* Nested classes have already been added to the class, but
23537 a `friend' needs to be explicitly registered. */
23539 {
23540 /* If the `friend' keyword was present, the friend must
23541 be introduced with a class-key. */
23544 "in C++03 a class-key must be used "
23546 /* In this case:
23548 template <typename T> struct A {
23549 friend struct A<T>::B;
23550 };
23552 A<T>::B will be represented by a TYPENAME_TYPE, and
23553 therefore not recognized by check_tag_decl. */
23555 {
23559 }
23562 "friend declaration does not name a class or "
23564 else
23567 }
23568 /* If there is no TYPE, an error message will already have
23569 been issued. */
23571 ;
23572 /* An anonymous aggregate has to be handled specially; such
23573 a declaration really declares a data member (with a
23574 particular type), as opposed to a nested class. */
23576 {
23577 /* C++11 9.5/6. */
23580 "a storage class on an anonymous aggregate "
23583 /* Remove constructors and such from TYPE, now that we
23584 know it is an anonymous aggregate. */
23586 /* And make the corresponding data member. */
23589 /* Add it to the class. */
23591 }
23592 else
23593 cp_parser_check_access_in_redeclaration
23596 }
23597 }
23598 else
23599 {
23602 /* Clear attributes from the decl_specifiers but keep them
23603 around as prefix attributes that apply them to the entity
23604 being declared. */
23608 /* See if these declarations will be friends. */
23611 /* Keep going until we hit the `;' at the end of the
23612 declaration. */
23614 {
23616 tree first_attribute;
23617 tree initializer;
23621 /* Peek at the next token. */
23624 /* The following code wants to know early if it is a bit-field
23625 or some other declaration. Attributes can appear before
23626 the `:' token, but are hopefully rare enough that the
23627 simplicity of the tentative lookup pays off. */
23632 {
23640 }
23642 /* Check for a bitfield declaration. */
23648 {
23649 tree identifier;
23650 tree width;
23655 else
23658 /* Look for attributes that apply to the bitfield. */
23661 /* Consume the `:' token. */
23664 /* Get the width of the bitfield. */
23668 /* In C++2A and as extension for C++11 and above we allow
23669 default member initializers for bit-fields. */
23674 CPP_OPEN_BRACE)))
23675 {
23676 location_t loc
23682 "default member initializers for bit-fields "
23683 "only available with -std=c++2a or "
23688 {
23692 }
23693 }
23694 else
23695 {
23696 /* Look for attributes that apply to the bitfield after
23697 the `:' token and width. This is where GCC used to
23698 parse attributes in the past, pedwarn if there is
23699 a std attribute. */
23702 "ISO C++ allows bit-field attributes only "
23706 }
23710 /* Remember which attributes are prefix attributes and
23711 which are not. */
23713 /* Combine the attributes. */
23716 /* Create the bitfield declaration. */
23719 identifier,
23720 sfk_none)
23724 attributes);
23725 }
23726 else
23727 {
23729 tree asm_specification;
23732 /* Parse the declarator. */
23733 declarator
23738 friend_p);
23740 /* If something went wrong parsing the declarator, make sure
23741 that we at least consume some tokens. */
23743 {
23744 /* Skip to the end of the statement. */
23746 /* If the next token is not a semicolon, that is
23747 probably because we just skipped over the body of
23748 a function. So, we consume a semicolon if
23749 present, but do not issue an error message if it
23750 is not present. */
23752 CPP_SEMICOLON))
23755 }
23758 cp_parser_check_for_definition_in_return_type
23762 /* Look for an asm-specification. */
23764 /* Look for attributes that apply to the declaration. */
23766 /* Remember which attributes are prefix attributes and
23767 which are not. */
23769 /* Combine the attributes. */
23772 /* If it's an `=', then we have a constant-initializer or a
23773 pure-specifier. It is not correct to parse the
23774 initializer before registering the member declaration
23775 since the member declaration should be in scope while
23776 its initializer is processed. However, the rest of the
23777 front end does not yet provide an interface that allows
23778 us to handle this correctly. */
23780 {
23781 /* In [class.mem]:
23783 A pure-specifier shall be used only in the declaration of
23784 a virtual function.
23786 A member-declarator can contain a constant-initializer
23787 only if it declares a static member of integral or
23788 enumeration type.
23790 Therefore, if the DECLARATOR is for a function, we look
23791 for a pure-specifier; otherwise, we look for a
23792 constant-initializer. When we call `grokfield', it will
23793 perform more stringent semantics checks. */
23805 {
23807 /* Don't require a constant rvalue in C++11, since we
23808 might want a reference constant. We'll enforce
23809 constancy later. */
23811 /* Parse the initializer. */
23814 }
23815 else
23816 /* Parse the initializer. */
23818 }
23821 {
23825 else
23827 }
23828 /* Otherwise, there is no initializer. */
23829 else
23832 /* See if we are probably looking at a function
23833 definition. We are certainly not looking at a
23834 member-declarator. Calling `grokfield' has
23835 side-effects, so we must not do it unless we are sure
23836 that we are looking at a member-declarator. */
23839 {
23840 /* The grammar does not allow a pure-specifier to be
23841 used when a member function is defined. (It is
23842 possible that this fact is an oversight in the
23843 standard, since a pure function may be defined
23844 outside of the class-specifier. */
23850 declarator,
23851 attributes);
23854 /* If the member was not a friend, declare it here. */
23857 /* Peek at the next token. */
23859 /* If the next token is a semicolon, consume it. */
23861 {
23862 location_t semicolon_loc
23867 "extra %<;%> after in-class "
23869 }
23871 }
23872 else
23875 /* Create the declaration. */
23880 {
23883 else
23885 }
23886 }
23891 /* Reset PREFIX_ATTRIBUTES. */
23893 {
23898 }
23900 /* If there is any qualification still in effect, clear it
23901 now; we will be starting fresh with the next declarator. */
23905 /* If it's a `,', then there are more declarators. */
23907 {
23910 {
23916 }
23917 }
23918 /* If the next token isn't a `;', then we have a parse error. */
23920 CPP_SEMICOLON))
23921 {
23922 /* The next token might be a ways away from where the
23923 actual semicolon is missing. Find the previous token
23924 and use that for our error position. */
23931 /* Assume that the user meant to provide a semicolon. If
23932 we were to cp_parser_skip_to_end_of_statement, we might
23933 skip to a semicolon inside a member function definition
23934 and issue nonsensical error messages. */
23936 }
23939 {
23940 /* Add DECL to the list of members. */
23942 /* Explicitly include, eg, NSDMIs, for better error
23943 recovery (c++/58650). */
23951 /* Add DECL to the queue of NSDMI to be parsed later. */
23953 }
23957 }
23958 }
23961 out:
23963 }
23965 /* Parse a pure-specifier.
23967 pure-specifier:
23968 = 0
23970 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23971 Otherwise, ERROR_MARK_NODE is returned. */
23973 static tree
23975 {
23978 /* Look for the `=' token. */
23981 /* Look for the `0' token. */
23990 /* Accept = default or = delete in c++0x mode. */
23993 {
23996 }
23998 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24000 {
24005 }
24007 {
24010 }
24013 }
24015 /* Parse a constant-initializer.
24017 constant-initializer:
24018 = constant-expression
24020 Returns a representation of the constant-expression. */
24022 static tree
24024 {
24025 /* Look for the `=' token. */
24029 /* It is invalid to write:
24031 struct S { static const int i = { 7 }; };
24033 */
24035 {
24038 /* Consume the opening brace. */
24039 matching_braces braces;
24041 /* Skip the initializer. */
24043 /* Look for the trailing `}'. */
24047 }
24050 }
24052 /* Derived classes [gram.class.derived] */
24054 /* Parse a base-clause.
24056 base-clause:
24057 : base-specifier-list
24059 base-specifier-list:
24060 base-specifier ... [opt]
24061 base-specifier-list , base-specifier ... [opt]
24063 Returns a TREE_LIST representing the base-classes, in the order in
24064 which they were declared. The representation of each node is as
24065 described by cp_parser_base_specifier.
24067 In the case that no bases are specified, this function will return
24068 NULL_TREE, not ERROR_MARK_NODE. */
24070 static tree
24072 {
24075 /* Look for the `:' that begins the list. */
24078 /* Scan the base-specifier-list. */
24080 {
24082 tree base;
24085 /* Look for the base-specifier. */
24087 /* Look for the (optional) ellipsis. */
24089 {
24090 /* Consume the `...'. */
24094 }
24096 /* Add BASE to the front of the list. */
24098 {
24100 /* Make this a pack expansion type. */
24104 {
24107 }
24108 }
24109 /* Peek at the next token. */
24111 /* If it's not a comma, then the list is complete. */
24114 /* Consume the `,'. */
24116 }
24118 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24119 base class had a qualified name. However, the next name that
24120 appears is certainly not qualified. */
24126 }
24128 /* Parse a base-specifier.
24130 base-specifier:
24131 :: [opt] nested-name-specifier [opt] class-name
24132 virtual access-specifier [opt] :: [opt] nested-name-specifier
24133 [opt] class-name
24134 access-specifier virtual [opt] :: [opt] nested-name-specifier
24135 [opt] class-name
24137 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24138 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24139 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24140 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24142 static tree
24144 {
24152 tree type;
24154 /* Process the optional `virtual' and `access-specifier'. */
24156 {
24157 /* Peek at the next token. */
24159 /* Process `virtual'. */
24161 {
24163 /* If `virtual' appears more than once, issue an error. */
24165 {
24169 }
24173 /* Consume the `virtual' token. */
24181 /* If more than one access specifier appears, issue an
24182 error. */
24185 {
24189 }
24193 /* Consume the access-specifier. */
24201 }
24202 }
24203 /* It is not uncommon to see programs mechanically, erroneously, use
24204 the 'typename' keyword to denote (dependent) qualified types
24205 as base classes. */
24207 {
24212 else
24214 "keyword %<typename%> not allowed in this context "
24217 }
24219 /* Look for the optional `::' operator. */
24221 /* Look for the nested-name-specifier. The simplest way to
24222 implement:
24224 [temp.res]
24226 The keyword `typename' is not permitted in a base-specifier or
24227 mem-initializer; in these contexts a qualified name that
24228 depends on a template-parameter is implicitly assumed to be a
24229 type name.
24231 is to pretend that we have seen the `typename' keyword at this
24232 point. */
24238 /* If the base class is given by a qualified name, assume that names
24239 we see are type names or templates, as appropriate. */
24245 /* DR 950 allows decltype as a base-specifier. */
24247 else
24248 {
24249 /* Otherwise, look for the class-name. */
24251 class_scope_p,
24252 template_p,
24253 typename_type,
24258 }
24264 }
24266 /* Exception handling [gram.exception] */
24268 /* Parse an (optional) noexcept-specification.
24270 noexcept-specification:
24271 noexcept ( constant-expression ) [opt]
24273 If no noexcept-specification is present, returns NULL_TREE.
24274 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24275 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24276 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24277 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24278 in which case a boolean condition is returned instead. */
24280 static tree
24285 {
24289 /* Peek at the next token. */
24292 /* Is it a noexcept-specification? */
24294 {
24295 tree expr;
24299 {
24300 matching_parens parens;
24304 {
24305 /* Types may not be defined in an exception-specification. */
24307 parser->type_definition_forbidden_message
24312 /* Restore the saved message. */
24314 }
24315 else
24316 {
24319 }
24322 }
24323 else
24324 {
24328 }
24330 /* We cannot build a noexcept-spec right away because this will check
24331 that expr is a constexpr. */
24334 else
24336 }
24337 else
24339 }
24341 /* Parse an (optional) exception-specification.
24343 exception-specification:
24344 throw ( type-id-list [opt] )
24346 Returns a TREE_LIST representing the exception-specification. The
24347 TREE_VALUE of each node is a type. */
24349 static tree
24351 {
24353 tree type_id_list;
24356 /* Peek at the next token. */
24359 /* Is it a noexcept-specification? */
24365 /* If it's not `throw', then there's no exception-specification. */
24371 /* Consume the `throw'. */
24374 /* Look for the `('. */
24375 matching_parens parens;
24378 /* Peek at the next token. */
24380 /* If it's not a `)', then there is a type-id-list. */
24382 {
24383 /* Types may not be defined in an exception-specification. */
24385 parser->type_definition_forbidden_message
24387 /* Parse the type-id-list. */
24389 /* Restore the saved message. */
24393 {
24397 }
24400 "dynamic exception specifications are deprecated in "
24402 }
24403 /* In C++17, throw() is equivalent to noexcept (true). throw()
24404 is deprecated in C++11 and above as well, but is still widely used,
24405 so don't warn about it yet. */
24408 else
24411 /* Look for the `)'. */
24415 }
24417 /* Parse an (optional) type-id-list.
24419 type-id-list:
24420 type-id ... [opt]
24421 type-id-list , type-id ... [opt]
24423 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24424 in the order that the types were presented. */
24426 static tree
24428 {
24432 {
24434 tree type;
24438 /* Get the next type-id. */
24440 /* Check for invalid 'auto'. */
24442 {
24446 }
24447 /* Parse the optional ellipsis. */
24449 {
24450 /* Consume the `...'. */
24453 /* Turn the type into a pack expansion expression. */
24455 }
24456 /* Add it to the list. */
24458 /* Peek at the next token. */
24460 /* If it is not a `,', we are done. */
24463 /* Consume the `,'. */
24465 }
24468 }
24470 /* Parse a try-block.
24472 try-block:
24473 try compound-statement handler-seq */
24475 static tree
24477 {
24478 tree try_block;
24492 }
24494 /* Parse a function-try-block.
24496 function-try-block:
24497 try ctor-initializer [opt] function-body handler-seq */
24499 static void
24501 {
24502 tree compound_stmt;
24503 tree try_block;
24505 /* Look for the `try' keyword. */
24508 /* Let the rest of the front end know where we are. */
24510 /* Parse the function-body. */
24511 cp_parser_ctor_initializer_opt_and_function_body
24513 /* We're done with the `try' part. */
24515 /* Parse the handlers. */
24517 /* We're done with the handlers. */
24519 }
24521 /* Parse a handler-seq.
24523 handler-seq:
24524 handler handler-seq [opt] */
24526 static void
24528 {
24530 {
24533 /* Parse the handler. */
24535 /* Peek at the next token. */
24537 /* If it's not `catch' then there are no more handlers. */
24540 }
24541 }
24543 /* Parse a handler.
24545 handler:
24546 catch ( exception-declaration ) compound-statement */
24548 static void
24550 {
24551 tree handler;
24552 tree declaration;
24556 matching_parens parens;
24563 }
24565 /* Parse an exception-declaration.
24567 exception-declaration:
24568 type-specifier-seq declarator
24569 type-specifier-seq abstract-declarator
24570 type-specifier-seq
24571 ...
24573 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24574 ellipsis variant is used. */
24576 static tree
24578 {
24579 cp_decl_specifier_seq type_specifiers;
24583 /* If it's an ellipsis, it's easy to handle. */
24585 {
24586 /* Consume the `...' token. */
24589 }
24591 /* Types may not be defined in exception-declarations. */
24593 parser->type_definition_forbidden_message
24596 /* Parse the type-specifier-seq. */
24600 /* If it's a `)', then there is no declarator. */
24603 else
24610 /* Restore the saved message. */
24617 }
24619 /* Parse a throw-expression.
24621 throw-expression:
24622 throw assignment-expression [opt]
24624 Returns a THROW_EXPR representing the throw-expression. */
24626 static tree
24628 {
24629 tree expression;
24634 /* Figure out whether or not there is an assignment-expression
24635 following the "throw" keyword. */
24643 else
24647 }
24649 /* GNU Extensions */
24651 /* Parse an (optional) asm-specification.
24653 asm-specification:
24654 asm ( string-literal )
24656 If the asm-specification is present, returns a STRING_CST
24657 corresponding to the string-literal. Otherwise, returns
24658 NULL_TREE. */
24660 static tree
24662 {
24664 tree asm_specification;
24666 /* Peek at the next token. */
24668 /* If the next token isn't the `asm' keyword, then there's no
24669 asm-specification. */
24673 /* Consume the `asm' token. */
24675 /* Look for the `('. */
24676 matching_parens parens;
24679 /* Look for the string-literal. */
24682 /* Look for the `)'. */
24686 }
24688 /* Parse an asm-operand-list.
24690 asm-operand-list:
24691 asm-operand
24692 asm-operand-list , asm-operand
24694 asm-operand:
24695 string-literal ( expression )
24696 [ string-literal ] string-literal ( expression )
24698 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24699 each node is the expression. The TREE_PURPOSE is itself a
24700 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24701 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24702 is a STRING_CST for the string literal before the parenthesis. Returns
24703 ERROR_MARK_NODE if any of the operands are invalid. */
24705 static tree
24707 {
24712 {
24713 tree string_literal;
24714 tree expression;
24715 tree name;
24718 {
24719 /* Consume the `[' token. */
24721 /* Read the operand name. */
24726 /* Look for the closing `]'. */
24728 }
24729 else
24731 /* Look for the string-literal. */
24734 /* Look for the `('. */
24735 matching_parens parens;
24737 /* Parse the expression. */
24739 /* Look for the `)'. */
24747 /* Add this operand to the list. */
24749 expression,
24750 asm_operands);
24751 /* If the next token is not a `,', there are no more
24752 operands. */
24755 /* Consume the `,'. */
24757 }
24760 }
24762 /* Parse an asm-clobber-list.
24764 asm-clobber-list:
24765 string-literal
24766 asm-clobber-list , string-literal
24768 Returns a TREE_LIST, indicating the clobbers in the order that they
24769 appeared. The TREE_VALUE of each node is a STRING_CST. */
24771 static tree
24773 {
24777 {
24778 tree string_literal;
24780 /* Look for the string literal. */
24782 /* Add it to the list. */
24784 /* If the next token is not a `,', then the list is
24785 complete. */
24788 /* Consume the `,' token. */
24790 }
24793 }
24795 /* Parse an asm-label-list.
24797 asm-label-list:
24798 identifier
24799 asm-label-list , identifier
24801 Returns a TREE_LIST, indicating the labels in the order that they
24802 appeared. The TREE_VALUE of each node is a label. */
24804 static tree
24806 {
24810 {
24813 /* Look for the identifier. */
24816 {
24819 {
24825 }
24826 }
24827 /* If the next token is not a `,', then the list is
24828 complete. */
24831 /* Consume the `,' token. */
24833 }
24836 }
24838 /* Return TRUE iff the next tokens in the stream are possibly the
24839 beginning of a GNU extension attribute. */
24841 static bool
24843 {
24845 }
24847 /* Return TRUE iff the next tokens in the stream are possibly the
24848 beginning of a standard C++-11 attribute specifier. */
24850 static bool
24852 {
24854 }
24856 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24857 beginning of a standard C++-11 attribute specifier. */
24859 static bool
24861 {
24869 }
24871 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24872 beginning of a GNU extension attribute. */
24874 static bool
24876 {
24880 }
24882 /* Return true iff the next tokens can be the beginning of either a
24883 GNU attribute list, or a standard C++11 attribute sequence. */
24885 static bool
24887 {
24890 }
24892 /* Return true iff the next Nth tokens can be the beginning of either
24893 a GNU attribute list, or a standard C++11 attribute sequence. */
24895 static bool
24897 {
24900 }
24902 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24903 of GNU attributes, or return NULL. */
24905 static tree
24907 {
24911 }
24913 /* Parse an (optional) series of attributes.
24915 attributes:
24916 attributes attribute
24918 attribute:
24919 __attribute__ (( attribute-list [opt] ))
24921 The return value is as for cp_parser_gnu_attribute_list. */
24923 static tree
24925 {
24929 {
24931 tree attribute_list;
24934 /* Peek at the next token. */
24936 /* If it's not `__attribute__', then we're done. */
24940 /* Consume the `__attribute__' keyword. */
24942 /* Look for the two `(' tokens. */
24943 matching_parens outer_parens;
24945 matching_parens inner_parens;
24948 /* Peek at the next token. */
24951 /* Parse the attribute-list. */
24953 else
24954 /* If the next token is a `)', then there is no attribute
24955 list. */
24958 /* Look for the two `)' tokens. */
24966 /* Add these new attributes to the list. */
24968 }
24971 }
24973 /* Parse a GNU attribute-list.
24975 attribute-list:
24976 attribute
24977 attribute-list , attribute
24979 attribute:
24980 identifier
24981 identifier ( identifier )
24982 identifier ( identifier , expression-list )
24983 identifier ( expression-list )
24985 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24986 to an attribute. The TREE_PURPOSE of each node is the identifier
24987 indicating which attribute is in use. The TREE_VALUE represents
24988 the arguments, if any. */
24990 static tree
24992 {
24998 {
25000 tree identifier;
25001 tree attribute;
25003 /* Look for the identifier. We also allow keywords here; for
25004 example `__attribute__ ((const))' is legal. */
25008 {
25011 /* Consume the token, but save it since we need it for the
25012 SIMD enabled function parsing. */
25015 /* Save away the identifier that indicates which attribute
25016 this is. */
25018 /* For keywords, use the canonical spelling, not the
25019 parsed identifier. */
25026 /* Peek at the next token. */
25028 /* If it's an `(', then parse the attribute arguments. */
25030 {
25034 vec = cp_parser_parenthesized_expression_list
25040 else
25041 {
25044 }
25045 /* Save the arguments away. */
25047 }
25050 {
25051 /* Add this attribute to the list. */
25054 }
25057 }
25058 /* Now, look for more attributes. If the next token isn't a
25059 `,', we're done. */
25063 /* Consume the comma and keep going. */
25065 }
25068 /* We built up the list in reverse order. */
25070 }
25072 /* Parse a standard C++11 attribute.
25074 The returned representation is a TREE_LIST which TREE_PURPOSE is
25075 the scoped name of the attribute, and the TREE_VALUE is its
25076 arguments list.
25078 Note that the scoped name of the attribute is itself a TREE_LIST
25079 which TREE_PURPOSE is the namespace of the attribute, and
25080 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25081 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25082 and which TREE_PURPOSE is directly the attribute name.
25084 Clients of the attribute code should use get_attribute_namespace
25085 and get_attribute_name to get the actual namespace and name of
25086 attributes, regardless of their being GNU or C++11 attributes.
25088 attribute:
25089 attribute-token attribute-argument-clause [opt]
25091 attribute-token:
25092 identifier
25093 attribute-scoped-token
25095 attribute-scoped-token:
25096 attribute-namespace :: identifier
25098 attribute-namespace:
25099 identifier
25101 attribute-argument-clause:
25102 ( balanced-token-seq )
25104 balanced-token-seq:
25105 balanced-token [opt]
25106 balanced-token-seq balanced-token
25108 balanced-token:
25109 ( balanced-token-seq )
25110 [ balanced-token-seq ]
25111 { balanced-token-seq }. */
25113 static tree
25115 {
25119 /* First, parse name of the attribute, a.k.a attribute-token. */
25136 {
25137 /* We are seeing a scoped attribute token. */
25152 else
25153 {
25157 }
25161 NULL_TREE);
25163 }
25166 NULL_TREE);
25167 else
25168 {
25171 NULL_TREE);
25172 /* C++11 noreturn attribute is equivalent to GNU's. */
25175 /* C++14 deprecated attribute is equivalent to GNU's. */
25178 /* C++17 fallthrough attribute is equivalent to GNU's. */
25181 /* Transactional Memory TS optimize_for_synchronized attribute is
25182 equivalent to GNU transaction_callable. */
25186 /* Transactional Memory attributes are GNU attributes. */
25189 }
25191 /* Now parse the optional argument clause of the attribute. */
25196 {
25202 /* A GNU attribute that takes an identifier in parameter. */
25205 vec = cp_parser_parenthesized_expression_list
25211 else
25212 {
25215 }
25219 else
25221 }
25224 }
25226 /* Check that the attribute ATTRIBUTE appears at most once in the
25227 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25228 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25229 isn't implemented yet in GCC. */
25231 static void
25233 {
25235 {
25245 }
25246 }
25248 /* Parse a list of standard C++-11 attributes.
25250 attribute-list:
25251 attribute [opt]
25252 attribute-list , attribute[opt]
25253 attribute ...
25254 attribute-list , attribute ...
25255 */
25257 static tree
25259 {
25264 {
25269 {
25273 }
25276 {
25281 else
25282 {
25287 }
25289 }
25293 }
25296 }
25298 /* Parse a standard C++-11 attribute specifier.
25300 attribute-specifier:
25301 [ [ attribute-using-prefix [opt] attribute-list ] ]
25302 alignment-specifier
25304 attribute-using-prefix:
25305 using attribute-namespace :
25307 alignment-specifier:
25308 alignas ( type-id ... [opt] )
25309 alignas ( alignment-expression ... [opt] ). */
25311 static tree
25313 {
25319 {
25326 {
25337 {
25341 "attribute using prefix only available "
25347 }
25348 else
25350 }
25357 else
25358 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25359 when we are sure that we have actually parsed them. */
25361 }
25362 else
25363 {
25364 tree alignas_expr;
25366 /* Look for an alignment-specifier. */
25377 matching_parens parens;
25385 {
25392 }
25397 /* Handle alignas (pack...). */
25399 {
25402 }
25404 /* Something went wrong, so don't build the attribute. */
25411 /* Build the C++-11 representation of an 'aligned'
25412 attribute. */
25413 attributes =
25416 alignas_expr);
25417 }
25420 }
25422 /* Parse a standard C++-11 attribute-specifier-seq.
25424 attribute-specifier-seq:
25425 attribute-specifier-seq [opt] attribute-specifier
25426 */
25428 static tree
25430 {
25435 {
25444 else
25447 }
25450 }
25452 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25453 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25454 current value of the PEDANTIC flag, regardless of whether or not
25455 the `__extension__' keyword is present. The caller is responsible
25456 for restoring the value of the PEDANTIC flag. */
25458 static bool
25460 {
25461 /* Save the old value of the PEDANTIC flag. */
25465 {
25466 /* Consume the `__extension__' token. */
25468 /* We're not being pedantic while the `__extension__' keyword is
25469 in effect. */
25473 }
25476 }
25478 /* Parse a label declaration.
25480 label-declaration:
25481 __label__ label-declarator-seq ;
25483 label-declarator-seq:
25484 identifier , label-declarator-seq
25485 identifier */
25487 static void
25489 {
25490 /* Look for the `__label__' keyword. */
25494 {
25495 tree identifier;
25497 /* Look for an identifier. */
25499 /* If we failed, stop. */
25502 /* Declare it as a label. */
25504 /* If the next token is a `;', stop. */
25507 /* Look for the `,' separating the label declarations. */
25509 }
25511 /* Look for the final `;'. */
25513 }
25515 // -------------------------------------------------------------------------- //
25516 // Requires Clause
25518 // Parse a requires clause.
25519 //
25520 // requires-clause:
25521 // 'requires' logical-or-expression
25522 //
25523 // The required logical-or-expression must be a constant expression. Note
25524 // that we don't check that the expression is constepxr here. We defer until
25525 // we analyze constraints and then, we only check atomic constraints.
25526 static tree
25528 {
25529 // Parse the requires clause so that it is not automatically folded.
25537 }
25539 // Optionally parse a requires clause:
25540 static tree
25542 {
25545 {
25548 {
25551 /* Parse and discard the requires-clause. */
25554 }
25556 }
25559 }
25562 /*---------------------------------------------------------------------------
25563 Requires expressions
25564 ---------------------------------------------------------------------------*/
25566 /* Parse a requires expression
25568 requirement-expression:
25569 'requires' requirement-parameter-list [opt] requirement-body */
25570 static tree
25572 {
25576 /* A requires-expression shall appear only within a concept
25577 definition or a requires-clause.
25579 TODO: Implement this diagnostic correctly. */
25581 {
25585 }
25588 {
25589 /* Local parameters are delared as variables within the scope
25590 of the expression. They are not visible past the end of
25591 the expression. Expressions within the requires-expression
25592 are unevaluated. */
25593 struct scope_sentinel
25594 {
25596 {
25599 }
25602 {
25605 }
25608 /* Parse the optional parameter list. */
25610 {
25614 }
25615 else
25618 /* Parse the requirement body. */
25622 }
25624 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25625 the parm chain. */
25628 }
25630 /* Parse a parameterized requirement.
25632 requirement-parameter-list:
25633 '(' parameter-declaration-clause ')' */
25634 static tree
25636 {
25637 matching_parens parens;
25647 }
25649 /* Parse the body of a requirement.
25651 requirement-body:
25652 '{' requirement-list '}' */
25653 static tree
25655 {
25656 matching_braces braces;
25666 }
25668 /* Parse a list of requirements.
25670 requirement-list:
25671 requirement
25672 requirement-list ';' requirement[opt] */
25673 static tree
25675 {
25678 {
25685 /* If we see a semi-colon, consume it. */
25689 /* Stop processing at the end of the list. */
25692 }
25694 /* Reverse the order of requirements so they are analyzed in
25695 declaration order. */
25697 }
25699 /* Parse a syntactic requirement or type requirement.
25701 requirement:
25702 simple-requirement
25703 compound-requirement
25704 type-requirement
25705 nested-requirement */
25706 static tree
25708 {
25715 else
25717 }
25719 /* Parse a simple requirement.
25721 simple-requirement:
25722 expression ';' */
25723 static tree
25725 {
25734 }
25736 /* Parse a type requirement
25738 type-requirement
25739 nested-name-specifier [opt] required-type-name ';'
25741 required-type-name:
25742 type-name
25743 'template' [opt] simple-template-id */
25744 static tree
25746 {
25749 // Save the scope before parsing name specifiers.
25760 tree type;
25762 {
25771 }
25772 else
25791 }
25793 /* Parse a compound requirement
25795 compound-requirement:
25796 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25797 static tree
25799 {
25800 /* Parse an expression enclosed in '{ }'s. */
25801 matching_braces braces;
25812 /* Parse the optional noexcept. */
25815 {
25818 }
25820 /* Parse the optional trailing return type. */
25823 {
25831 }
25834 }
25836 /* Parse a nested requirement. This is the same as a requires clause.
25838 nested-requirement:
25839 requires-clause */
25840 static tree
25842 {
25848 }
25850 /* Support Functions */
25852 /* Return the appropriate prefer_type argument for lookup_name_real based on
25853 tag_type and template_mem_access. */
25857 {
25858 /* DR 141: When looking in the current enclosing context for a template-name
25859 after -> or ., only consider class templates. */
25863 {
25867 }
25868 }
25870 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25871 NAME should have one of the representations used for an
25872 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25873 is returned. If PARSER->SCOPE is a dependent type, then a
25874 SCOPE_REF is returned.
25876 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25877 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25878 was formed. Abstractly, such entities should not be passed to this
25879 function, because they do not need to be looked up, but it is
25880 simpler to check for this special case here, rather than at the
25881 call-sites.
25883 In cases not explicitly covered above, this function returns a
25884 DECL, OVERLOAD, or baselink representing the result of the lookup.
25885 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25886 is returned.
25888 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25889 (e.g., "struct") that was used. In that case bindings that do not
25890 refer to types are ignored.
25892 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25893 ignored.
25895 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25896 are ignored.
25898 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25899 types.
25901 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25902 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25903 NULL_TREE otherwise. */
25905 static cp_expr
25912 location_t name_location)
25913 {
25914 tree decl;
25917 /* Assume that the lookup will be unambiguous. */
25921 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25922 no longer valid. Note that if we are parsing tentatively, and
25923 the parse fails, OBJECT_TYPE will be automatically restored. */
25929 /* A template-id has already been resolved; there is no lookup to
25930 do. */
25934 {
25938 }
25940 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25941 it should already have been checked to make sure that the name
25942 used matches the type being destroyed. */
25944 {
25945 tree type;
25947 /* Figure out to which type this destructor applies. */
25952 else
25954 /* If that's not a class type, there is no destructor. */
25965 }
25967 /* By this point, the NAME should be an ordinary identifier. If
25968 the id-expression was a qualified name, the qualifying scope is
25969 stored in PARSER->SCOPE at this point. */
25972 /* Perform the lookup. */
25974 {
25980 /* If the SCOPE is dependent, the lookup must be deferred until
25981 the template is instantiated -- unless we are explicitly
25982 looking up names in uninstantiated templates. Even then, we
25983 cannot look up the name if the scope is not a class type; it
25984 might, for example, be a template type parameter. */
25989 /* Defer lookup. */
25991 else
25992 {
25995 /* If PARSER->SCOPE is a dependent type, then it must be a
25996 class type, and we must not be checking dependencies;
25997 otherwise, we would have processed this lookup above. So
25998 that PARSER->SCOPE is not considered a dependent base by
25999 lookup_member, we must enter the scope here. */
26003 /* If the PARSER->SCOPE is a template specialization, it
26004 may be instantiated during name lookup. In that case,
26005 errors may be issued. Even if we rollback the current
26006 tentative parse, those errors are valid. */
26011 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26012 lookup result and the nested-name-specifier nominates a class C:
26013 * if the name specified after the nested-name-specifier, when
26014 looked up in C, is the injected-class-name of C (Clause 9), or
26015 * if the name specified after the nested-name-specifier is the
26016 same as the identifier or the simple-template-id's template-
26017 name in the last component of the nested-name-specifier,
26018 the name is instead considered to name the constructor of
26019 class C. [ Note: for example, the constructor is not an
26020 acceptable lookup result in an elaborated-type-specifier so
26021 the constructor would not be used in place of the
26022 injected-class-name. --end note ] Such a constructor name
26023 shall be used only in the declarator-id of a declaration that
26024 names a constructor or in a using-declaration. */
26032 /* If we have a single function from a using decl, pull it out. */
26039 }
26041 /* If the scope is a dependent type and either we deferred lookup or
26042 we did lookup but didn't find the name, rememeber the name. */
26045 {
26047 {
26048 tree type;
26050 /* The resolution to Core Issue 180 says that `struct
26051 A::B' should be considered a type-name, even if `A'
26052 is dependent. */
26057 }
26061 CPP_CLOSE_PAREN)))
26065 else
26068 is_template);
26069 }
26072 }
26074 {
26075 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26076 OBJECT_TYPE is not a class. */
26078 /* If the OBJECT_TYPE is a template specialization, it may
26079 be instantiated during name lookup. In that case, errors
26080 may be issued. Even if we rollback the current tentative
26081 parse, those errors are valid. */
26083 name,
26086 tf_warning_or_error);
26087 else
26091 /* Look it up in the enclosing context. DR 141: When looking for a
26092 template-name after -> or ., only consider class templates. */
26097 /* The object is type-dependent, so we can't look anything up; we used
26098 this to get the DR 141 behavior. */
26102 }
26103 else
26104 {
26110 }
26112 /* If the lookup failed, let our caller know. */
26116 /* Pull out the template from an injected-class-name (or multiple). */
26120 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26122 {
26125 /* The error message we have to print is too complicated for
26126 cp_parser_error, so we incorporate its actions directly. */
26128 {
26130 name);
26132 }
26134 }
26142 /* If we have resolved the name of a member declaration, check to
26143 see if the declaration is accessible. When the name resolves to
26144 set of overloaded functions, accessibility is checked when
26145 overload resolution is done.
26147 During an explicit instantiation, access is not checked at all,
26148 as per [temp.explicit]. */
26155 }
26157 /* Like cp_parser_lookup_name, but for use in the typical case where
26158 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26159 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26161 static tree
26163 {
26165 none_type,
26170 location);
26171 }
26173 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26174 the current context, return the TYPE_DECL. If TAG_NAME_P is
26175 true, the DECL indicates the class being defined in a class-head,
26176 or declared in an elaborated-type-specifier.
26178 Otherwise, return DECL. */
26180 static tree
26182 {
26183 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26184 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26186 struct A {
26187 template <typename T> struct B;
26188 };
26190 template <typename T> struct A::B {};
26192 Similarly, in an elaborated-type-specifier:
26194 namespace N { struct X{}; }
26196 struct A {
26197 template <typename T> friend struct N::X;
26198 };
26200 However, if the DECL refers to a class type, and we are in
26201 the scope of the class, then the name lookup automatically
26202 finds the TYPE_DECL created by build_self_reference rather
26203 than a TEMPLATE_DECL. For example, in:
26205 template <class T> struct S {
26206 S s;
26207 };
26209 there is no need to handle such case. */
26215 }
26217 /* If too many, or too few, template-parameter lists apply to the
26218 declarator, issue an error message. Returns TRUE if all went well,
26219 and FALSE otherwise. */
26221 static bool
26224 location_t declarator_location)
26225 {
26227 {
26229 {
26237 /* If the DECLARATOR has the form `X<y>' then it uses one
26238 additional level of template parameters. */
26241 return cp_parser_check_template_parameters
26243 }
26259 }
26261 }
26263 /* NUM_TEMPLATES were used in the current declaration. If that is
26264 invalid, return FALSE and issue an error messages. Otherwise,
26265 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26266 declarator and we can print more accurate diagnostics. */
26268 static bool
26271 location_t location,
26273 {
26274 /* If there are the same number of template classes and parameter
26275 lists, that's OK. */
26278 /* If there are more, but only one more, then we are referring to a
26279 member template. That's OK too. */
26282 /* If there are more template classes than parameter lists, we have
26283 something like:
26285 template <class T> void S<T>::R<T>::f (); */
26287 {
26297 else
26300 }
26301 /* Otherwise, there are too many template parameter lists. We have
26302 something like:
26304 template <class T> template <class U> void S::f(); */
26307 }
26309 /* Parse an optional `::' token indicating that the following name is
26310 from the global namespace. If so, PARSER->SCOPE is set to the
26311 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26312 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26313 Returns the new value of PARSER->SCOPE, if the `::' token is
26314 present, and NULL_TREE otherwise. */
26316 static tree
26318 {
26321 /* Peek at the next token. */
26323 /* If we're looking at a `::' token then we're starting from the
26324 global namespace, not our current location. */
26326 {
26327 /* Consume the `::' token. */
26329 /* Set the SCOPE so that we know where to start the lookup. */
26335 }
26337 {
26341 }
26344 }
26346 /* Returns TRUE if the upcoming token sequence is the start of a
26347 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26348 declarator is preceded by the `friend' specifier. */
26350 static bool
26352 {
26355 tree nested_name_specifier;
26358 /* The common case is that this is not a constructor declarator, so
26359 try to avoid doing lots of work if at all possible. It's not
26360 valid declare a constructor at function scope. */
26363 /* And only certain tokens can begin a constructor declarator. */
26371 /* Parse tentatively; we are going to roll back all of the tokens
26372 consumed here. */
26374 /* Assume that we are looking at a constructor declarator. */
26377 /* Look for the optional `::' operator. */
26380 /* Look for the nested-name-specifier. */
26381 nested_name_specifier
26392 /* Outside of a class-specifier, there must be a
26393 nested-name-specifier. Except in C++17 mode, where we
26394 might be declaring a guiding declaration. */
26401 /* If we have a class scope, this is easy; DR 147 says that S::S always
26402 names the constructor, and no other qualified name could. */
26405 {
26415 }
26416 /* If we still think that this might be a constructor-declarator,
26417 look for a class-name. */
26419 {
26420 /* If we have:
26422 template <typename T> struct S {
26423 S();
26424 };
26426 we must recognize that the nested `S' names a class. */
26430 tree type_decl;
26434 none_type,
26441 {
26447 none_type,
26452 else
26454 }
26456 /* If there was no class-name, then this is not a constructor.
26457 Otherwise, if we are in a class-specifier and we aren't
26458 handling a friend declaration, check that its type matches
26459 current_class_type (c++/38313). Note: error_mark_node
26460 is left alone for error recovery purposes. */
26462 && (outside_class_specifier_p
26468 /* If we're still considering a constructor, we have to see a `(',
26469 to begin the parameter-declaration-clause, followed by either a
26470 `)', an `...', or a decl-specifier. We need to check for a
26471 type-specifier to avoid being fooled into thinking that:
26473 S (f) (int);
26475 is a constructor. (It is actually a function named `f' that
26476 takes one parameter (of type `int') and returns a value of type
26477 `S'. */
26485 /* A parameter declaration begins with a decl-specifier,
26486 which is either the "attribute" keyword, a storage class
26487 specifier, or (usually) a type-specifier. */
26489 {
26490 tree type;
26494 /* Names appearing in the type-specifier should be looked up
26495 in the scope of the class. */
26499 {
26502 {
26506 {
26509 }
26510 }
26512 }
26514 /* Inside the constructor parameter list, surrounding
26515 template-parameter-lists do not apply. */
26516 saved_num_template_parameter_lists
26520 /* Look for the type-specifier. */
26522 CP_PARSER_FLAGS_NONE,
26528 parser->num_template_parameter_lists
26531 /* Leave the scope of the class. */
26536 }
26537 }
26539 /* We did not really want to consume any tokens. */
26543 }
26545 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26546 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26547 they must be performed once we are in the scope of the function.
26549 Returns the function defined. */
26551 static tree
26552 cp_parser_function_definition_from_specifiers_and_declarator
26555 tree attributes,
26557 {
26558 tree fn;
26561 /* Begin the function-definition. */
26564 /* The things we're about to see are not directly qualified by any
26565 template headers we've seen thus far. */
26568 /* If there were names looked up in the decl-specifier-seq that we
26569 did not check, check them now. We must wait until we are in the
26570 scope of the function to perform the checks, since the function
26571 might be a friend. */
26575 {
26580 }
26583 {
26584 /* Skip the entire function. */
26587 }
26589 {
26590 /* Seen already, skip it. An error message has already been output. */
26594 /* If this is a function from a class, pop the nested class. */
26597 }
26598 else
26599 {
26600 timevar_id_t tv;
26603 else
26609 }
26612 }
26614 /* Parse the part of a function-definition that follows the
26615 declarator. INLINE_P is TRUE iff this function is an inline
26616 function defined within a class-specifier.
26618 Returns the function defined. */
26620 static tree
26623 {
26624 tree fn;
26629 bool fully_implicit_function_template_p
26632 tree implicit_template_parms
26635 cp_binding_level* implicit_template_scope
26641 /* If the next token is `return', then the code may be trying to
26642 make use of the "named return value" extension that G++ used to
26643 support. */
26646 {
26647 /* Consume the `return' keyword. */
26649 /* Look for the identifier that indicates what value is to be
26650 returned. */
26652 /* Issue an error message. */
26655 /* Skip tokens until we reach the start of the function body. */
26657 {
26664 }
26665 }
26666 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26667 anything declared inside `f'. */
26668 saved_in_unbraced_linkage_specification_p
26671 /* Inside the function, surrounding template-parameter-lists do not
26672 apply. */
26673 saved_num_template_parameter_lists
26677 /* If the next token is `try', `__transaction_atomic', or
26678 `__transaction_relaxed`, then we are looking at either function-try-block
26679 or function-transaction-block. Note that all of these include the
26680 function-body. */
26684 RID_TRANSACTION_RELAXED))
26688 else
26689 cp_parser_ctor_initializer_opt_and_function_body
26692 /* Finish the function. */
26694 /* Generate code for it, if necessary. */
26696 /* Restore the saved values. */
26697 parser->in_unbraced_linkage_specification_p
26699 parser->num_template_parameter_lists
26703 parser->fully_implicit_function_template_p
26705 parser->implicit_template_parms
26707 parser->implicit_template_scope
26714 }
26716 /* Parse a template-declaration body (following argument list). */
26718 static void
26720 tree parameter_list,
26722 {
26726 /* We just processed one more parameter list. */
26729 /* Get the deferred access checks from the parameter list. These
26730 will be checked once we know what is being declared, as for a
26731 member template the checks must be performed in the scope of the
26732 class containing the member. */
26735 /* Tentatively parse for a new template parameter list, which can either be
26736 the template keyword or a template introduction. */
26742 else
26743 {
26744 /* There are no access checks when parsing a template, as we do not
26745 know if a specialization will be a friend. */
26749 checks,
26750 member_p,
26755 /* If this is a member template declaration, let the front
26756 end know. */
26758 {
26763 }
26768 }
26769 /* We are done with the current parameter list. */
26774 /* Finish up. */
26777 /* Check the template arguments for a literal operator template. */
26781 {
26785 else
26786 {
26789 {
26795 }
26797 {
26806 }
26807 else
26809 }
26811 {
26814 " Expected non-type template argument pack <char...>"
26816 decl);
26817 else
26820 decl);
26821 }
26822 }
26824 /* Register member declarations. */
26827 /* If DECL is a function template, we must return to parse it later.
26828 (Even though there is no definition, there might be default
26829 arguments that need handling.) */
26833 }
26835 /* Parse a template introduction header for a template-declaration. Returns
26836 false if tentative parse fails. */
26838 static bool
26840 {
26847 /* Look for the optional `::' operator. */
26850 /* Look for the nested-name-specifier. */
26860 /* Look up the concept for which we will be matching
26861 template parameters. */
26871 /* Look for opening brace for introduction. */
26872 matching_braces braces;
26880 /* Build vector of placeholder parameters and grab
26881 matching identifiers. */
26884 /* The introduction-list shall not be empty. */
26887 {
26890 }
26892 /* Look for closing brace for introduction. */
26897 {
26901 }
26903 /* Build and associate the constraint. */
26906 {
26908 member_p);
26910 }
26914 }
26916 /* Parse a normal template-declaration following the template keyword. */
26918 static void
26920 {
26921 tree parameter_list;
26925 /* Look for the `<' token. */
26929 {
26930 /* 14.5.2.2 [temp.mem]
26932 A local class shall not have member templates. */
26937 }
26938 /* [temp]
26940 A template ... shall not have C linkage. */
26942 {
26945 /* Give it C++ linkage to avoid confusing other parts of the
26946 front end. */
26949 }
26950 else
26953 /* We cannot perform access checks on the template parameter
26954 declarations until we know what is being declared, just as we
26955 cannot check the decl-specifier list. */
26958 /* If the next token is `>', then we have an invalid
26959 specialization. Rather than complain about an invalid template
26960 parameter, issue an error message here. */
26962 {
26966 }
26967 else
26968 {
26969 /* Parse the template parameters. */
26971 }
26973 /* Look for the `>'. */
26976 /* Manage template requirements */
26978 {
26983 }
26986 member_p);
26988 /* For the erroneous case of a template with C linkage, we pushed an
26989 implicit C++ linkage scope; exit that scope now. */
26992 }
26994 /* Parse a template-declaration, assuming that the `export' (and
26995 `extern') keywords, if present, has already been scanned. MEMBER_P
26996 is as for cp_parser_template_declaration. */
26998 static bool
27000 {
27002 {
27006 }
27011 }
27013 /* Perform the deferred access checks from a template-parameter-list.
27014 CHECKS is a TREE_LIST of access checks, as returned by
27015 get_deferred_access_checks. */
27017 static void
27018 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27019 {
27023 }
27025 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27026 `function-definition' sequence that follows a template header.
27027 If MEMBER_P is true, this declaration appears in a class scope.
27029 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27030 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27032 static tree
27038 {
27041 cp_decl_specifier_seq decl_specifiers;
27045 /* This function is only used when processing a template
27046 declaration. */
27050 /* Defer access checks until we know what is being declared. */
27053 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27054 alternative. */
27057 CP_PARSER_FLAGS_OPTIONAL,
27063 /* There are no template typedefs. */
27065 {
27069 }
27071 /* Gather up the access checks that occurred the
27072 decl-specifier-seq. */
27075 /* Check for the declaration of a template class. */
27077 {
27080 {
27081 // If this is a declaration, but not a definition, associate
27082 // any constraints with the type declaration. Constraints
27083 // are associated with definitions in cp_parser_class_specifier.
27089 /* In this case:
27091 struct C {
27092 friend template <typename T> struct A<T>::B;
27093 };
27095 A<T>::B will be represented by a TYPENAME_TYPE, and
27096 therefore not recognized by shadow_tag. */
27098 && !decl
27105 else
27108 /* Perform access checks for template parameters. */
27111 /* Give a helpful diagnostic for
27112 template <class T> struct A { } a;
27113 if we aren't already recovering from an error. */
27116 {
27118 "a class template declaration must not declare "
27122 }
27123 }
27124 }
27126 /* Complain about missing 'typename' or other invalid type names. */
27129 {
27130 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27131 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27132 the rest of this declaration. */
27135 }
27137 /* If it's not a template class, try for a template function. If
27138 the next token is a `;', then this declaration does not declare
27139 anything. But, if there were errors in the decl-specifiers, then
27140 the error might well have come from an attempted class-specifier.
27141 In that case, there's no need to warn about a missing declarator. */
27145 {
27148 checks,
27150 member_p,
27151 declares_class_or_enum,
27155 /* 7.1.1-1 [dcl.stc]
27157 A storage-class-specifier shall not be specified in an explicit
27158 specialization... */
27160 && explicit_specialization_p
27162 {
27166 }
27170 }
27172 /* Look for a trailing `;' after the declaration. */
27178 out:
27181 /* Clear any current qualification; whatever comes next is the start
27182 of something new. */
27188 }
27190 /* Parse a cast-expression that is not the operand of a unary "&". */
27192 static cp_expr
27194 {
27197 }
27199 /* Parse a functional cast to TYPE. Returns an expression
27200 representing the cast. */
27202 static cp_expr
27204 {
27206 tree expression_list;
27207 cp_expr cast;
27216 {
27226 /* Create a location of the form:
27227 type_name{i, f}
27228 ^~~~~~~~~~~~~~~
27229 with caret == start at the start of the type name,
27230 finishing at the closing brace. */
27231 location_t finish_loc
27234 finish_loc);
27237 }
27246 else
27247 {
27250 }
27253 tf_warning_or_error);
27254 /* [expr.const]/1: In an integral constant expression "only type
27255 conversions to integral or enumeration type can be used". */
27261 NIC_CONSTRUCTOR))
27264 /* Create a location of the form:
27265 float(i)
27266 ^~~~~~~~
27267 with caret == start at the start of the type name,
27268 finishing at the closing paren. */
27269 location_t finish_loc
27274 }
27276 /* Save the tokens that make up the body of a member function defined
27277 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27278 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27279 specifiers applied to the declaration. Returns the FUNCTION_DECL
27280 for the member function. */
27282 static tree
27286 tree attributes)
27287 {
27290 tree fn;
27293 /* Create the FUNCTION_DECL. */
27297 /* If something went badly wrong, bail out now. */
27299 {
27300 /* If there's a function-body, skip it. */
27305 }
27307 /* Remember it, if there default args to post process. */
27310 /* Save away the tokens that make up the body of the
27311 function. */
27317 RID_TRANSACTION_ATOMIC))
27318 {
27320 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27327 {
27333 }
27334 else
27337 {
27341 }
27342 }
27344 /* Handle function try blocks. */
27346 {
27349 }
27350 /* We can have braced-init-list mem-initializers before the fn body. */
27352 {
27355 {
27356 /* cache_group will stop after an un-nested { } pair, too. */
27360 /* variadic mem-inits have ... after the ')'. */
27363 }
27364 }
27366 /* Handle function try blocks. */
27372 /* Save away the inline definition; we will process it when the
27373 class is complete. */
27377 /* We need to know that this was defined in the class, so that
27378 friend templates are handled correctly. */
27381 /* Add FN to the queue of functions to be parsed later. */
27385 }
27387 /* Save the tokens that make up the in-class initializer for a non-static
27388 data member. Returns a DEFAULT_ARG. */
27390 static tree
27392 {
27394 }
27396 /* Parse a template-argument-list, as well as the trailing ">" (but
27397 not the opening "<"). See cp_parser_template_argument_list for the
27398 return value. */
27400 static tree
27402 {
27403 tree arguments;
27404 tree saved_scope;
27405 tree saved_qualifying_scope;
27406 tree saved_object_scope;
27411 /* [temp.names]
27413 When parsing a template-id, the first non-nested `>' is taken as
27414 the end of the template-argument-list rather than a greater-than
27415 operator. */
27416 saved_greater_than_is_operator_p
27419 /* Parsing the argument list may modify SCOPE, so we save it
27420 here. */
27424 /* We need to evaluate the template arguments, even though this
27425 template-id may be nested within a "sizeof". */
27430 /* Parse the template-argument-list itself. */
27434 else
27436 /* Look for the `>' that ends the template-argument-list. If we find
27437 a '>>' instead, it's probably just a typo. */
27439 {
27441 {
27442 /* In C++0x, a `>>' in a template argument list or cast
27443 expression is considered to be two separate `>'
27444 tokens. So, change the current token to a `>', but don't
27445 consume it: it will be consumed later when the outer
27446 template argument list (or cast expression) is parsed.
27447 Note that this replacement of `>' for `>>' is necessary
27448 even if we are parsing tentatively: in the tentative
27449 case, after calling
27450 cp_parser_enclosed_template_argument_list we will always
27451 throw away all of the template arguments and the first
27452 closing `>', either because the template argument list
27453 was erroneous or because we are replacing those tokens
27454 with a CPP_TEMPLATE_ID token. The second `>' (which will
27455 not have been thrown away) is needed either to close an
27456 outer template argument list or to complete a new-style
27457 cast. */
27460 }
27462 {
27463 /* If we're in a nested template argument list, the '>>' has
27464 to be a typo for '> >'. We emit the error message, but we
27465 continue parsing and we push a '>' as next token, so that
27466 the argument list will be parsed correctly. Note that the
27467 global source location is still on the token before the
27468 '>>', so we need to say explicitly where we want it. */
27476 }
27477 else
27478 {
27479 /* If this is not a nested template argument list, the '>>'
27480 is a typo for '>'. Emit an error message and continue.
27481 Same deal about the token location, but here we can get it
27482 right by consuming the '>>' before issuing the diagnostic. */
27485 "spurious %<>>%>, use %<>%> to terminate "
27487 }
27488 }
27489 else
27491 /* The `>' token might be a greater-than operator again now. */
27492 parser->greater_than_is_operator_p
27494 /* Restore the SAVED_SCOPE. */
27502 }
27504 /* MEMBER_FUNCTION is a member function, or a friend. If default
27505 arguments, or the body of the function have not yet been parsed,
27506 parse them now. */
27508 static void
27510 {
27512 /* If this member is a template, get the underlying
27513 FUNCTION_DECL. */
27517 /* There should not be any class definitions in progress at this
27518 point; the bodies of members are only parsed outside of all class
27519 definitions. */
27521 /* While we're parsing the member functions we might encounter more
27522 classes. We want to handle them right away, but we don't want
27523 them getting mixed up with functions that are currently in the
27524 queue. */
27527 /* Make sure that any template parameters are in scope. */
27530 /* If the body of the function has not yet been parsed, parse it
27531 now. */
27533 {
27534 tree function_scope;
27537 /* The function is no longer pending; we are processing it. */
27542 /* If this is a local class, enter the scope of the containing
27543 function. */
27548 /* Push the body of the function onto the lexer stack. */
27551 /* Let the front end know that we going to be defining this
27552 function. */
27556 /* Don't do access checking if it is a templated function. */
27560 /* #pragma omp declare reduction needs special parsing. */
27562 {
27567 }
27568 else
27569 /* Now, parse the body of the function. */
27576 /* Leave the scope of the containing function. */
27580 }
27582 /* Remove any template parameters from the symbol table. */
27585 /* Restore the queue. */
27588 }
27590 /* If DECL contains any default args, remember it on the unparsed
27591 functions queue. */
27593 static void
27595 {
27596 tree probe;
27599 probe;
27602 {
27606 }
27607 }
27609 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27610 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27611 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27612 from the parameter-type-list. */
27614 static tree
27617 {
27619 tree parsed_arg;
27625 /* Push the saved tokens for the default argument onto the parser's
27626 lexer stack. */
27632 /* Parse the default argument. */
27643 {
27644 /* In a non-template class, check conversions now. In a template,
27645 we'll wait and instantiate these as needed. */
27648 tf_warning_or_error);
27651 else
27653 }
27655 /* If the token stream has not been completely used up, then
27656 there was extra junk after the end of the default
27657 argument. */
27659 {
27662 else
27664 }
27666 /* Revert to the main lexer. */
27670 }
27672 /* FIELD is a non-static data member with an initializer which we saved for
27673 later; parse it now. */
27675 static void
27677 {
27678 tree def;
27685 NULL_TREE);
27691 }
27693 /* FN is a FUNCTION_DECL which may contains a parameter with an
27694 unparsed DEFAULT_ARG. Parse the default args now. This function
27695 assumes that the current scope is the scope in which the default
27696 argument should be processed. */
27698 static void
27700 {
27704 /* While we're parsing the default args, we might (due to the
27705 statement expression extension) encounter more classes. We want
27706 to handle them right away, but we don't want them getting mixed
27707 up with default args that are currently in the queue. */
27710 /* Local variable names (and the `this' keyword) may not appear
27711 in a default argument. */
27722 {
27724 tree parsed_arg;
27726 tree copy;
27733 /* This can happen for a friend declaration for a function
27734 already declared with default arguments. */
27737 parsed_arg
27739 default_arg,
27743 /* Update any instantiations we've already created. */
27747 }
27751 /* Make sure no default arg is missing. */
27754 /* Restore the state of local_variables_forbidden_p. */
27757 /* Restore the queue. */
27759 }
27761 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27763 sizeof ... ( identifier )
27765 where the 'sizeof' token has already been consumed. */
27767 static tree
27769 {
27770 /* Consume the `...'. */
27774 matching_parens parens;
27778 else
27786 /* The name is not qualified. */
27805 }
27807 /* Parse the operand of `sizeof' (or a similar operator). Returns
27808 either a TYPE or an expression, depending on the form of the
27809 input. The KEYWORD indicates which kind of expression we have
27810 encountered. */
27812 static tree
27814 {
27821 /* If it's a `...', then we are computing the length of a parameter
27822 pack. */
27827 /* Types cannot be defined in a `sizeof' expression. Save away the
27828 old message. */
27830 /* And create the new one. */
27836 /* The restrictions on constant-expressions do not apply inside
27837 sizeof expressions. */
27838 saved_integral_constant_expression_p
27840 saved_non_integral_constant_expression_p
27844 /* Do not actually evaluate the expression. */
27847 /* If it's a `(', then we might be looking at the type-id
27848 construction. */
27850 {
27853 /* We can't be sure yet whether we're looking at a type-id or an
27854 expression. */
27857 matching_parens parens;
27860 /* Note: as a GNU Extension, compound literals are considered
27861 postfix-expressions as they are in C99, so they are valid
27862 arguments to sizeof. See comment in cp_parser_cast_expression
27863 for details. */
27866 else
27867 {
27870 /* Look for the type-id. */
27872 /* Look for the closing `)'. */
27875 }
27877 /* If all went well, then we're done. */
27879 {
27880 cp_decl_specifier_seq decl_specs;
27882 /* Build a trivial decl-specifier-seq. */
27886 /* Call grokdeclarator to figure out what type this is. */
27889 TYPENAME,
27892 }
27893 }
27895 /* If the type-id production did not work out, then we must be
27896 looking at the unary-expression production. */
27900 /* Go back to evaluating expressions. */
27904 /* Free the message we created. */
27906 /* And restore the old one. */
27908 parser->integral_constant_expression_p
27910 parser->non_integral_constant_expression_p
27914 }
27916 /* If the current declaration has no declarator, return true. */
27918 static bool
27920 {
27921 /* If the next token is a `;' or a `,' then there is no
27922 declarator. */
27925 }
27927 /* Update the DECL_SPECS to reflect the storage class indicated by
27928 KEYWORD. */
27930 static void
27935 {
27936 cp_storage_class storage_class;
27939 {
27943 }
27945 {
27948 }
27953 {
27956 }
27959 {
27977 }
27981 /* A storage class specifier cannot be applied alongside a typedef
27982 specifier. If there is a typedef specifier present then set
27983 conflicting_specifiers_p which will trigger an error later
27984 on in grokdeclarator. */
27987 }
27989 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27990 is true, the type is a class or enum definition. */
27992 static void
27994 tree type_spec,
27997 {
28000 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28001 (with, for example, in "typedef int wchar_t;") we remember that
28002 this is what happened. In system headers, we ignore these
28003 declarations so that G++ can work with system headers that are not
28004 C++-safe. */
28006 && !type_definition_p
28016 {
28019 ds_redefined_builtin_type_spec,
28020 token);
28022 {
28026 }
28027 }
28030 else
28031 {
28036 }
28037 }
28039 /* True iff TOKEN is the GNU keyword __thread. */
28041 static bool
28043 {
28046 }
28048 /* Set the location for a declarator specifier and check if it is
28049 duplicated.
28051 DECL_SPECS is the sequence of declarator specifiers onto which to
28052 set the location.
28054 DS is the single declarator specifier to set which location is to
28055 be set onto the existing sequence of declarators.
28057 LOCATION is the location for the declarator specifier to
28058 consider. */
28060 static void
28063 {
28072 {
28076 }
28077 else
28078 {
28080 {
28084 else
28085 {
28088 OPT_Wlong_long,
28090 }
28091 }
28093 {
28098 else
28099 {
28103 }
28104 }
28105 else
28106 {
28122 "__complex"
28123 };
28127 }
28128 }
28129 }
28131 /* Return true iff the declarator specifier DS is present in the
28132 sequence of declarator specifiers DECL_SPECS. */
28134 bool
28136 cp_decl_spec ds)
28137 {
28144 }
28146 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28147 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28149 static bool
28151 {
28153 }
28155 /* Issue an error message indicating that TOKEN_DESC was expected.
28156 If KEYWORD is true, it indicated this function is called by
28157 cp_parser_require_keword and the required token can only be
28158 a indicated keyword.
28160 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28161 within any error as the location of an "opening" token matching
28162 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28163 RT_CLOSE_PAREN). */
28165 static void
28167 required_token token_desc,
28169 location_t matching_location)
28170 {
28176 {
28245 }
28248 {
28250 {
28328 }
28329 }
28333 }
28336 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28337 issue an error message indicating that TOKEN_DESC was expected.
28339 Returns the token consumed, if the token had the appropriate type.
28340 Otherwise, returns NULL.
28342 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28343 within any error as the location of an "opening" token matching
28344 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28345 RT_CLOSE_PAREN). */
28350 required_token token_desc,
28351 location_t matching_location)
28352 {
28355 else
28356 {
28357 /* Output the MESSAGE -- unless we're parsing tentatively. */
28360 matching_location);
28362 }
28363 }
28365 /* An error message is produced if the next token is not '>'.
28366 All further tokens are skipped until the desired token is
28367 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28369 static void
28371 {
28372 /* Current level of '< ... >'. */
28374 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28377 /* Are we ready, yet? If not, issue error message. */
28381 /* Skip tokens until the desired token is found. */
28383 {
28384 /* Peek at the next token. */
28386 {
28394 /* C++0x views the `>>' operator as two `>' tokens, but
28395 C++98 does not. */
28398 {
28399 /* We've hit a `>>' where the first `>' closes the
28400 template argument list, and the second `>' is
28401 spurious. Just consume the `>>' and stop; we've
28402 already produced at least one error. */
28405 }
28406 /* Fall through for C++0x, so we handle the second `>' in
28407 the `>>'. */
28412 {
28413 /* We've reached the token we want, consume it and stop. */
28416 }
28435 /* The '>' was probably forgotten, don't look further. */
28440 }
28442 /* Consume this token. */
28444 }
28445 }
28447 /* If the next token is the indicated keyword, consume it. Otherwise,
28448 issue an error message indicating that TOKEN_DESC was expected.
28450 Returns the token consumed, if the token had the appropriate type.
28451 Otherwise, returns NULL. */
28456 required_token token_desc)
28457 {
28461 {
28463 UNKNOWN_LOCATION);
28465 }
28468 }
28470 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28471 function-definition. */
28473 static bool
28475 {
28478 /* A ctor-initializer begins with a `:'. */
28480 /* A function-try-block begins with `try'. */
28482 /* A function-transaction-block begins with `__transaction_atomic'
28483 or `__transaction_relaxed'. */
28486 /* The named return value extension begins with `return'. */
28488 }
28490 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28491 definition. */
28493 static bool
28495 {
28502 }
28504 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28505 C++0x) ending a template-argument. */
28507 static bool
28509 {
28517 }
28519 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28520 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28522 static bool
28525 {
28531 /* Check for the sequence `<::' in the original code. It would be lexed as
28532 `[:', where `[' is a digraph, and there is no whitespace before
28533 `:'. */
28535 {
28540 }
28542 }
28544 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28545 or none_type otherwise. */
28547 static enum tag_types
28549 {
28551 {
28561 }
28562 }
28564 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28565 or none_type otherwise or if the token is null. */
28567 static enum tag_types
28569 {
28574 {
28582 }
28583 }
28585 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28587 static void
28589 {
28593 {
28597 type))
28600 }
28601 }
28603 /* Issue an error message if DECL is redeclared with different
28604 access than its original declaration [class.access.spec/3].
28605 This applies to nested classes, nested class templates and
28606 enumerations [class.mem/1]. */
28608 static void
28610 {
28621 }
28623 /* Look for the `template' keyword, as a syntactic disambiguator.
28624 Return TRUE iff it is present, in which case it will be
28625 consumed. */
28627 static bool
28629 {
28631 {
28632 /* In C++98 the `template' keyword can only be used within templates;
28633 outside templates the parser can always figure out what is a
28634 template and what is not. In C++11, per the resolution of DR 468,
28635 `template' is allowed in cases where it is not strictly necessary. */
28638 {
28641 "in C++98 %<template%> (as a disambiguator) is only "
28643 /* If this part of the token stream is rescanned, the same
28644 error message would be generated. So, we purge the token
28645 from the stream. */
28648 }
28649 else
28650 {
28651 /* Consume the `template' keyword. */
28654 }
28655 }
28657 }
28659 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28660 set PARSER->SCOPE, and perform other related actions. */
28662 static void
28664 {
28667 /* Get the stored value. */
28669 /* Set the scope from the stored value. */
28673 }
28675 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28676 encounter the end of a block before what we were looking for. */
28678 static bool
28682 {
28684 {
28687 /* Abort a parenthesized expression if we encounter a semicolon. */
28691 /* If we've reached the end of the file, stop. */
28697 /* We've hit the end of an enclosing block, so there's been some
28698 kind of syntax error. */
28701 /* Consume the token. */
28703 /* See if it starts a new group. */
28705 {
28707 /* In theory this should probably check end == '}', but
28708 cp_parser_save_member_function_body needs it to exit
28709 after either '}' or ')' when called with ')'. */
28712 }
28714 {
28718 }
28723 }
28724 }
28726 /* Like above, for caching a default argument or NSDMI. Both of these are
28727 terminated by a non-nested comma, but it can be unclear whether or not a
28728 comma is nested in a template argument list unless we do more parsing.
28729 In order to handle this ambiguity, when we encounter a ',' after a '<'
28730 we try to parse what follows as a parameter-declaration-list (in the
28731 case of a default argument) or a member-declarator (in the case of an
28732 NSDMI). If that succeeds, then we stop caching. */
28734 static tree
28736 {
28741 tree default_argument;
28743 /* Add tokens until we have processed the entire default
28744 argument. We add the range [first_token, token). */
28747 {
28748 /* For list-initialization, this is straightforward. */
28751 }
28753 {
28756 /* Peek at the next token. */
28758 /* What we do depends on what token we have. */
28760 {
28761 /* In valid code, a default argument must be
28762 immediately followed by a `,' `)', or `...'. */
28765 {
28766 /* If we've seen a '<', we might be in a
28767 template-argument-list. Until Core issue 325 is
28768 resolved, we don't know how this situation ought
28769 to be handled, so try to DTRT. We check whether
28770 what comes after the comma is a valid parameter
28771 declaration list. If it is, then the comma ends
28772 the default argument; otherwise the default
28773 argument continues. */
28777 /* Set ITALP so cp_parser_parameter_declaration_list
28778 doesn't decide to commit to this parse. */
28785 {
28786 /* Parse declarators until we reach a non-comma or
28787 somthing that cannot be an initializer.
28788 Just checking whether we're looking at a single
28789 declarator is insufficient. Consider:
28790 int var = tuple<T,U>::x;
28791 The template parameter 'U' looks exactly like a
28792 declarator. */
28793 do
28794 {
28805 }
28807 /* If we met an '=' or ';' then the original comma
28808 was the end of the NSDMI. Otherwise assume
28809 we're still in the NSDMI. */
28812 }
28813 else
28814 {
28819 }
28826 }
28827 /* FALLTHRU */
28830 /* If we run into a non-nested `;', `}', or `]',
28831 then the code is invalid -- but the default
28832 argument is certainly over. */
28837 /* Handle correctly int n = sizeof ... ( p ); */
28840 /* Update DEPTH, if necessary. */
28855 /* This might be the comparison operator, or it might
28856 start a template argument list. */
28863 /* Fall through for C++0x, which treats the `>>'
28864 operator like two `>' tokens in certain
28865 cases. */
28870 {
28871 /* This might be an operator, or it might close a
28872 template argument list. But if a previous '<'
28873 started a template argument list, this will have
28874 closed it, so we can't be in one anymore. */
28878 }
28881 /* If we run out of tokens, issue an error message. */
28889 /* In these cases, we should look for template-ids.
28890 For example, if the default argument is
28891 `X<int, double>()', we need to do name lookup to
28892 figure out whether or not `X' is a template; if
28893 so, the `,' does not end the default argument.
28895 That is not yet done. */
28900 }
28902 /* If we've reached the end, stop. */
28906 /* Add the token to the token block. */
28908 }
28910 /* Create a DEFAULT_ARG to represent the unparsed default
28911 argument. */
28918 }
28920 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28922 location_t
28924 {
28929 }
28931 /* Begin parsing tentatively. We always save tokens while parsing
28932 tentatively so that if the tentative parsing fails we can restore the
28933 tokens. */
28935 static void
28937 {
28938 /* Enter a new parsing context. */
28940 /* Begin saving tokens. */
28942 /* In order to avoid repetitive access control error messages,
28943 access checks are queued up until we are no longer parsing
28944 tentatively. */
28946 }
28948 /* Commit to the currently active tentative parse. */
28950 static void
28952 {
28956 /* Mark all of the levels as committed. */
28959 {
28966 }
28967 }
28969 /* Commit to the topmost currently active tentative parse.
28971 Note that this function shouldn't be called when there are
28972 irreversible side-effects while in a tentative state. For
28973 example, we shouldn't create a permanent entry in the symbol
28974 table, or issue an error message that might not apply if the
28975 tentative parse is aborted. */
28977 static void
28979 {
28984 {
28992 }
28993 }
28995 /* Abort the currently active tentative parse. All consumed tokens
28996 will be rolled back, and no diagnostics will be issued. */
28998 static void
29000 {
29004 /* Now, pretend that we want to see if the construct was
29005 successfully parsed. */
29007 }
29009 /* Stop parsing tentatively. If a parse error has occurred, restore the
29010 token stream. Otherwise, commit to the tokens we have consumed.
29011 Returns true if no error occurred; false otherwise. */
29013 static bool
29015 {
29019 /* Remember whether or not an error occurred, since we are about to
29020 destroy that information. */
29022 /* Remove the topmost context from the stack. */
29025 /* If no parse errors occurred, commit to the tentative parse. */
29027 {
29028 /* Commit to the tokens read tentatively, unless that was
29029 already done. */
29034 }
29035 /* Otherwise, if errors occurred, roll back our state so that things
29036 are just as they were before we began the tentative parse. */
29037 else
29038 {
29041 }
29042 /* Add the context to the front of the free list. */
29047 }
29049 /* Returns true if we are parsing tentatively and are not committed to
29050 this tentative parse. */
29052 static bool
29054 {
29057 }
29059 /* Returns nonzero iff an error has occurred during the most recent
29060 tentative parse. */
29062 static bool
29064 {
29067 }
29069 /* Returns nonzero if GNU extensions are allowed. */
29071 static bool
29073 {
29075 }
29076 \f
29077 /* Objective-C++ Productions */
29080 /* Parse an Objective-C expression, which feeds into a primary-expression
29081 above.
29083 objc-expression:
29084 objc-message-expression
29085 objc-string-literal
29086 objc-encode-expression
29087 objc-protocol-expression
29088 objc-selector-expression
29090 Returns a tree representation of the expression. */
29092 static cp_expr
29094 {
29095 /* Try to figure out what kind of declaration is present. */
29099 {
29109 {
29121 }
29122 /* FALLTHRU */
29128 }
29131 }
29133 /* Parse an Objective-C message expression.
29135 objc-message-expression:
29136 [ objc-message-receiver objc-message-args ]
29138 Returns a representation of an Objective-C message. */
29140 static tree
29142 {
29154 /* Construct a location e.g.
29155 [self func1:5]
29156 ^~~~~~~~~~~~~~
29157 ranging from the '[' to the ']', with the caret at the start. */
29162 }
29164 /* Parse an objc-message-receiver.
29166 objc-message-receiver:
29167 expression
29168 simple-type-specifier
29170 Returns a representation of the type or expression. */
29172 static tree
29174 {
29175 tree rcv;
29177 /* An Objective-C message receiver may be either (1) a type
29178 or (2) an expression. */
29182 /* If that worked out, fine. */
29189 CP_PARSER_FLAGS_NONE);
29196 }
29198 /* Parse the arguments and selectors comprising an Objective-C message.
29200 objc-message-args:
29201 objc-selector
29202 objc-selector-args
29203 objc-selector-args , objc-comma-args
29205 objc-selector-args:
29206 objc-selector [opt] : assignment-expression
29207 objc-selector-args objc-selector [opt] : assignment-expression
29209 objc-comma-args:
29210 assignment-expression
29211 objc-comma-args , assignment-expression
29213 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29214 selector arguments and TREE_VALUE containing a list of comma
29215 arguments. */
29217 static tree
29219 {
29225 {
29231 /* Detect if we have a unary selector. */
29240 sel_args
29245 }
29247 /* Handle non-selector arguments, if any. */
29249 {
29250 tree arg;
29255 addl_args
29260 }
29263 {
29266 }
29269 }
29271 /* Parse an Objective-C encode expression.
29273 objc-encode-expression:
29274 @encode objc-typename
29276 Returns an encoded representation of the type argument. */
29278 static cp_expr
29280 {
29281 tree type;
29286 matching_parens parens;
29293 {
29297 }
29299 /* This happens if we find @encode(T) (where T is a template
29300 typename or something dependent on a template typename) when
29301 parsing a template. In that case, we can't compile it
29302 immediately, but we rather create an AT_ENCODE_EXPR which will
29303 need to be instantiated when the template is used.
29304 */
29306 {
29310 }
29313 /* Build a location of the form:
29314 @encode(int)
29315 ^~~~~~~~~~~~
29316 with caret==start at the @ token, finishing at the close paren. */
29317 location_t combined_loc
29322 }
29324 /* Parse an Objective-C @defs expression. */
29326 static tree
29328 {
29329 tree name;
29332 matching_parens parens;
29338 }
29340 /* Parse an Objective-C protocol expression.
29342 objc-protocol-expression:
29343 @protocol ( identifier )
29345 Returns a representation of the protocol expression. */
29347 static tree
29349 {
29350 tree proto;
29354 matching_parens parens;
29359 /* Build a location of the form:
29360 @protocol(prot)
29361 ^~~~~~~~~~~~~~~
29362 with caret==start at the @ token, finishing at the close paren. */
29363 location_t combined_loc
29369 }
29371 /* Parse an Objective-C selector expression.
29373 objc-selector-expression:
29374 @selector ( objc-method-signature )
29376 objc-method-signature:
29377 objc-selector
29378 objc-selector-seq
29380 objc-selector-seq:
29381 objc-selector :
29382 objc-selector-seq objc-selector :
29384 Returns a representation of the method selector. */
29386 static tree
29388 {
29395 matching_parens parens;
29401 {
29410 {
29411 /* Detect if we have a unary selector. */
29413 {
29416 }
29417 else
29418 {
29420 }
29421 }
29426 {
29427 sel_seq
29430 sel_seq
29433 }
29434 else
29435 sel_seq
29440 }
29442 finish_selector:
29446 /* Build a location of the form:
29447 @selector(func)
29448 ^~~~~~~~~~~~~~~
29449 with caret==start at the @ token, finishing at the close paren. */
29450 location_t combined_loc
29454 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29457 }
29459 /* Parse a list of identifiers.
29461 objc-identifier-list:
29462 identifier
29463 objc-identifier-list , identifier
29465 Returns a TREE_LIST of identifier nodes. */
29467 static tree
29469 {
29470 tree identifier;
29471 tree list;
29482 {
29489 identifier));
29491 }
29494 }
29496 /* Parse an Objective-C alias declaration.
29498 objc-alias-declaration:
29499 @compatibility_alias identifier identifier ;
29501 This function registers the alias mapping with the Objective-C front end.
29502 It returns nothing. */
29504 static void
29506 {
29514 }
29516 /* Parse an Objective-C class forward-declaration.
29518 objc-class-declaration:
29519 @class objc-identifier-list ;
29521 The function registers the forward declarations with the Objective-C
29522 front end. It returns nothing. */
29524 static void
29526 {
29529 {
29530 tree id;
29540 else
29542 }
29544 }
29546 /* Parse a list of Objective-C protocol references.
29548 objc-protocol-refs-opt:
29549 objc-protocol-refs [opt]
29551 objc-protocol-refs:
29552 < objc-identifier-list >
29554 Returns a TREE_LIST of identifiers, if any. */
29556 static tree
29558 {
29562 {
29566 }
29569 }
29571 /* Parse a Objective-C visibility specification. */
29573 static void
29575 {
29579 {
29594 }
29596 /* Eat '@private'/'@protected'/'@public'. */
29598 }
29600 /* Parse an Objective-C method type. Return 'true' if it is a class
29601 (+) method, and 'false' if it is an instance (-) method. */
29605 {
29608 else
29610 }
29612 /* Parse an Objective-C protocol qualifier. */
29614 static tree
29616 {
29629 {
29634 }
29637 }
29639 /* Parse an Objective-C typename. */
29641 static tree
29643 {
29647 {
29650 matching_parens parens;
29654 /* An ObjC type name may consist of just protocol qualifiers, in which
29655 case the type shall default to 'id'. */
29657 {
29660 /* If the type could not be parsed, an error has already
29661 been produced. For error recovery, behave as if it had
29662 not been specified, which will use the default type
29663 'id'. */
29665 {
29667 /* We need to skip to the closing parenthesis as
29668 cp_parser_type_id() does not seem to do it for
29669 us. */
29674 }
29675 }
29679 }
29682 }
29684 /* Check to see if TYPE refers to an Objective-C selector name. */
29686 static bool
29688 {
29694 }
29696 /* Parse an Objective-C selector. */
29698 static tree
29700 {
29704 {
29707 }
29709 /* C++ operator names are allowed to appear in ObjC selectors. */
29711 {
29724 }
29725 }
29727 /* Parse an Objective-C params list. */
29729 static tree
29731 {
29737 {
29747 /* Detect if we have a unary selector. */
29750 {
29753 }
29757 {
29758 /* Something went quite wrong. There should be a colon
29759 here, but there is not. Stop parsing parameters. */
29761 }
29763 /* New ObjC allows attributes on parameters too. */
29768 params
29771 type_name,
29772 identifier,
29773 parm_attr));
29776 }
29779 {
29782 }
29784 /* We allow tail attributes for the method. */
29786 {
29794 }
29797 {
29800 }
29802 }
29804 /* Parse the non-keyword Objective-C params. */
29806 static tree
29809 {
29815 {
29817 tree parm;
29823 {
29828 }
29830 /* TODO: parse attributes for tail parameters. */
29839 }
29841 /* We allow tail attributes for the method. */
29843 {
29845 {
29850 }
29851 else
29852 /* We have an error, but parse the attributes, so that we can
29853 carry on. */
29859 }
29862 }
29864 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29866 static void
29868 {
29871 /* If the next token is `extern' and the following token is a string
29872 literal, then we have a linkage specification. */
29874 && cp_parser_is_pure_string_literal
29877 /* Handle #pragma, if any. */
29880 /* Allow stray semicolons. */
29883 /* Mark methods as optional or required, when building protocols. */
29885 {
29888 }
29890 {
29893 }
29896 /* Other stray characters must generate errors. */
29898 {
29902 }
29903 /* Finally, try to parse a block-declaration, or a function-definition. */
29904 else
29906 }
29908 /* Parse a method signature. */
29910 static tree
29912 {
29928 }
29930 static bool
29932 {
29933 tree tattr;
29938 /* If the attributes are followed by a method introducer, this is not allowed.
29939 Dump the attributes and flag the situation. */
29944 /* Otherwise, the attributes introduce some interstitial code, possibly so
29945 rewind to allow that check. */
29948 }
29950 /* Parse an Objective-C method prototype list. */
29952 static void
29954 {
29958 {
29960 {
29965 else
29969 {
29973 }
29976 }
29982 OPT_Wattributes,
29984 else
29985 /* Allow for interspersed non-ObjC++ code. */
29989 }
29993 else
29997 }
29999 /* Parse an Objective-C method definition list. */
30001 static void
30003 {
30007 {
30008 tree meth;
30011 {
30017 else
30022 {
30026 }
30028 NULL_TREE);
30030 /* For historical reasons, we accept an optional semicolon. */
30037 {
30044 }
30045 }
30046 /* The following case will be removed once @synthesize is
30047 completely implemented. */
30058 else
30059 /* Allow for interspersed non-ObjC++ code. */
30063 }
30067 else
30071 }
30073 /* Parse Objective-C ivars. */
30075 static void
30077 {
30088 {
30089 cp_decl_specifier_seq declspecs;
30091 tree prefix_attributes;
30099 CP_PARSER_FLAGS_OPTIONAL,
30103 /* auto, register, static, extern, mutable. */
30105 {
30108 }
30110 /* thread_local. */
30112 {
30115 }
30117 /* typedef. */
30119 {
30122 }
30127 /* Keep going until we hit the `;' at the end of the
30128 declaration. */
30130 {
30135 /* Check for a (possibly unnamed) bitfield declaration. */
30143 {
30144 /* Get the name of the bitfield. */
30147 sfk_none);
30149 eat_colon:
30151 /* Get the width of the bitfield. */
30152 width
30154 }
30155 else
30156 {
30157 /* Parse the declarator. */
30158 declarator
30164 }
30166 /* Look for attributes that apply to the ivar. */
30168 /* Remember which attributes are prefix attributes and
30169 which are not. */
30171 /* Combine the attributes. */
30175 /* Create the bitfield declaration. */
30178 else
30183 /* Add the instance variable. */
30187 /* Reset PREFIX_ATTRIBUTES. */
30189 {
30194 }
30199 {
30202 }
30204 }
30208 }
30213 /* Do not consume the RID_AT_END, so it will be read again as terminating
30214 the @interface of @implementation. */
30218 /* For historical reasons, we accept an optional semicolon. */
30221 }
30223 /* Parse an Objective-C protocol declaration. */
30225 static void
30227 {
30233 {
30238 }
30240 /* See if we have a forward declaration or a definition. */
30243 /* Try a forward declaration first. */
30245 {
30247 {
30248 tree id;
30258 else
30260 }
30262 }
30264 /* Ok, we got a full-fledged definition (or at least should). */
30265 else
30266 {
30271 }
30272 }
30274 /* Parse an Objective-C superclass or category. */
30276 static void
30281 {
30287 {
30290 }
30292 {
30293 matching_parens parens;
30296 /* If there is no category name, and this is an @interface, we
30297 have a class extension. */
30299 {
30302 }
30303 else
30307 }
30308 }
30310 /* Parse an Objective-C class interface. */
30312 static void
30314 {
30321 {
30322 /* It's hard to recover because even if valid @interface stuff
30323 is to follow, we can't compile it (or validate it) if we
30324 don't even know which class it refers to. Let's assume this
30325 was a stray '@interface' token in the stream and skip it.
30326 */
30328 }
30333 /* We have either a class or a category on our hands. */
30336 else
30337 {
30339 /* Handle instance variable declarations, if any. */
30342 }
30345 }
30347 /* Parse an Objective-C class implementation. */
30349 static void
30351 {
30358 {
30359 /* It's hard to recover because even if valid @implementation
30360 stuff is to follow, we can't compile it (or validate it) if
30361 we don't even know which class it refers to. Let's assume
30362 this was a stray '@implementation' token in the stream and
30363 skip it.
30364 */
30366 }
30370 /* We have either a class or a category on our hands. */
30373 else
30374 {
30376 /* Handle instance variable declarations, if any. */
30379 }
30382 }
30384 /* Consume the @end token and finish off the implementation. */
30386 static void
30388 {
30391 }
30393 /* Parse an Objective-C declaration. */
30395 static void
30397 {
30398 /* Try to figure out what kind of declaration is present. */
30403 {
30419 }
30422 {
30445 }
30446 }
30448 /* Parse an Objective-C try-catch-finally statement.
30450 objc-try-catch-finally-stmt:
30451 @try compound-statement objc-catch-clause-seq [opt]
30452 objc-finally-clause [opt]
30454 objc-catch-clause-seq:
30455 objc-catch-clause objc-catch-clause-seq [opt]
30457 objc-catch-clause:
30458 @catch ( objc-exception-declaration ) compound-statement
30460 objc-finally-clause:
30461 @finally compound-statement
30463 objc-exception-declaration:
30464 parameter-declaration
30465 '...'
30467 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30469 Returns NULL_TREE.
30471 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30472 for C. Keep them in sync. */
30474 static tree
30476 {
30477 location_t location;
30478 tree stmt;
30483 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30484 node, lest it get absorbed into the surrounding block. */
30490 {
30494 matching_parens parens;
30500 {
30501 /* We have "@catch (...)" (where the '...' are literally
30502 what is in the code). Skip the '...'.
30503 parameter_declaration is set to NULL_TREE, and
30504 objc_being_catch_clauses() knows that that means
30505 '...'. */
30508 }
30509 else
30510 {
30511 /* We have "@catch (NSException *exception)" or something
30512 like that. Parse the parameter declaration. */
30516 else
30521 }
30524 else
30525 {
30526 /* If there was no open parenthesis, we are recovering from
30527 an error, and we are trying to figure out what mistake
30528 the user has made. */
30530 /* If there is an immediate closing parenthesis, the user
30531 probably forgot the opening one (ie, they typed "@catch
30532 NSException *e)". Parse the closing parenthesis and keep
30533 going. */
30537 /* If these is no immediate closing parenthesis, the user
30538 probably doesn't know that parenthesis are required at
30539 all (ie, they typed "@catch NSException *e"). So, just
30540 forget about the closing parenthesis and keep going. */
30541 }
30545 }
30547 {
30550 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30551 node, lest it get absorbed into the surrounding block. */
30555 }
30558 }
30560 /* Parse an Objective-C synchronized statement.
30562 objc-synchronized-stmt:
30563 @synchronized ( expression ) compound-statement
30565 Returns NULL_TREE. */
30567 static tree
30569 {
30570 location_t location;
30577 matching_parens parens;
30582 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30583 node, lest it get absorbed into the surrounding block. */
30588 }
30590 /* Parse an Objective-C throw statement.
30592 objc-throw-stmt:
30593 @throw assignment-expression [opt] ;
30595 Returns a constructed '@throw' statement. */
30597 static tree
30599 {
30611 }
30613 /* Parse an Objective-C statement. */
30615 static tree
30617 {
30618 /* Try to figure out what kind of declaration is present. */
30622 {
30633 }
30636 }
30638 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30639 look ahead to see if an objc keyword follows the attributes. This
30640 is to detect the use of prefix attributes on ObjC @interface and
30641 @protocol. */
30643 static bool
30645 {
30650 {
30653 }
30656 }
30658 /* This routine is a minimal replacement for
30659 c_parser_struct_declaration () used when parsing the list of
30660 types/names or ObjC++ properties. For example, when parsing the
30661 code
30663 @property (readonly) int a, b, c;
30665 this function is responsible for parsing "int a, int b, int c" and
30666 returning the declarations as CHAIN of DECLs.
30668 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30669 similar parsing. */
30670 static tree
30672 {
30674 cp_decl_specifier_seq declspecs;
30676 tree prefix_attributes;
30679 CP_PARSER_FLAGS_NONE,
30686 /* auto, register, static, extern, mutable. */
30688 {
30691 }
30693 /* thread_local. */
30695 {
30698 }
30700 /* typedef. */
30702 {
30705 }
30710 /* Keep going until we hit the `;' at the end of the declaration. */
30712 {
30717 /* Parse the declarator. */
30721 /* Look for attributes that apply to the ivar. */
30723 /* Remember which attributes are prefix attributes and
30724 which are not. */
30726 /* Combine the attributes. */
30736 /* Reset PREFIX_ATTRIBUTES. */
30738 {
30743 }
30750 {
30753 }
30754 else
30756 }
30758 }
30760 /* Parse an Objective-C @property declaration. The syntax is:
30762 objc-property-declaration:
30763 '@property' objc-property-attributes[opt] struct-declaration ;
30765 objc-property-attributes:
30766 '(' objc-property-attribute-list ')'
30768 objc-property-attribute-list:
30769 objc-property-attribute
30770 objc-property-attribute-list, objc-property-attribute
30772 objc-property-attribute
30773 'getter' = identifier
30774 'setter' = identifier
30775 'readonly'
30776 'readwrite'
30777 'assign'
30778 'retain'
30779 'copy'
30780 'nonatomic'
30782 For example:
30783 @property NSString *name;
30784 @property (readonly) id object;
30785 @property (retain, nonatomic, getter=getTheName) id name;
30786 @property int a, b, c;
30788 PS: This function is identical to
30789 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30790 static void
30792 {
30793 /* The following variables hold the attributes of the properties as
30794 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30795 seen. When we see an attribute, we set them to 'true' (if they
30796 are boolean properties) or to the identifier (if they have an
30797 argument, ie, for getter and setter). Note that here we only
30798 parse the list of attributes, check the syntax and accumulate the
30799 attributes that we find. objc_add_property_declaration() will
30800 then process the information. */
30810 /* 'properties' is the list of properties that we read. Usually a
30811 single one, but maybe more (eg, in "@property int a, b, c;" there
30812 are three). */
30813 tree properties;
30814 location_t loc;
30820 /* Parse the optional attribute list... */
30822 {
30823 /* Eat the '('. */
30824 matching_parens parens;
30828 {
30834 {
30837 }
30841 {
30852 {
30856 else
30861 }
30864 {
30868 }
30870 {
30872 {
30875 }
30876 else
30880 else
30882 }
30883 else
30884 {
30886 {
30889 }
30890 else
30892 }
30898 }
30905 else
30907 }
30909 /* FIXME: "@property (setter, assign);" will generate a spurious
30910 "error: expected ‘)’ before ‘,’ token". This is because
30911 cp_parser_require, unlike the C counterpart, will produce an
30912 error even if we are in error recovery. */
30914 {
30919 }
30920 }
30922 /* ... and the property declaration(s). */
30926 {
30928 /* If the next token is now a `;', consume it. */
30932 }
30936 else
30937 {
30938 /* Comma-separated properties are chained together in
30939 reverse order; add them one by one. */
30948 }
30951 }
30953 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30955 objc-synthesize-declaration:
30956 @synthesize objc-synthesize-identifier-list ;
30958 objc-synthesize-identifier-list:
30959 objc-synthesize-identifier
30960 objc-synthesize-identifier-list, objc-synthesize-identifier
30962 objc-synthesize-identifier
30963 identifier
30964 identifier = identifier
30966 For example:
30967 @synthesize MyProperty;
30968 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30970 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30971 for C. Keep them in sync.
30972 */
30973 static void
30975 {
30977 location_t loc;
30982 {
30986 {
30989 }
30991 {
30995 {
30998 }
30999 }
31000 else
31005 else
31007 }
31010 }
31012 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31014 objc-dynamic-declaration:
31015 @dynamic identifier-list ;
31017 For example:
31018 @dynamic MyProperty;
31019 @dynamic MyProperty, AnotherProperty;
31021 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31022 for C. Keep them in sync.
31023 */
31024 static void
31026 {
31028 location_t loc;
31033 {
31034 tree property;
31037 {
31040 }
31044 else
31046 }
31049 }
31051 \f
31052 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31054 /* Returns name of the next clause.
31055 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31056 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31057 returned and the token is consumed. */
31059 static pragma_omp_clause
31061 {
31077 {
31082 {
31259 }
31260 }
31266 }
31268 /* Validate that a clause of the given type does not already exist. */
31270 static void
31273 {
31274 tree c;
31278 {
31281 }
31282 }
31284 /* OpenMP 2.5:
31285 variable-list:
31286 identifier
31287 variable-list , identifier
31289 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31290 colon). An opening parenthesis will have been consumed by the caller.
31292 If KIND is nonzero, create the appropriate node and install the decl
31293 in OMP_CLAUSE_DECL and add the node to the head of the list.
31295 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31296 return the list created.
31298 COLON can be NULL if only closing parenthesis should end the list,
31299 or pointer to bool which will receive false if the list is terminated
31300 by closing parenthesis or true if the list is terminated by colon. */
31302 static tree
31305 {
31309 {
31312 }
31314 {
31319 && current_class_ptr
31321 {
31327 }
31328 else
31329 {
31342 }
31344 ;
31346 {
31348 {
31350 /* The OpenACC cache directive explicitly only allows "array
31351 elements or subarrays". */
31353 {
31357 }
31358 /* FALLTHROUGH. */
31363 {
31364 location_t loc
31369 decl
31373 }
31374 /* FALLTHROUGH. */
31378 {
31386 parser->colon_corrects_to_scope_p
31390 else
31391 {
31392 /* Look for `:'. */
31396 CPP_CLOSE_SQUARE))
31398 }
31399 /* Look for the closing `]'. */
31401 RT_CLOSE_SQUARE))
31405 }
31409 }
31415 }
31416 else
31419 get_comma:
31423 }
31429 {
31433 }
31436 {
31439 /* Try to resync to an unnested comma. Copied from
31440 cp_parser_parenthesized_expression_list. */
31441 skip_comma:
31450 }
31453 }
31455 /* Similarly, but expect leading and trailing parenthesis. This is a very
31456 common case for omp clauses. */
31458 static tree
31460 {
31464 }
31466 /* OpenACC 2.0:
31467 copy ( variable-list )
31468 copyin ( variable-list )
31469 copyout ( variable-list )
31470 create ( variable-list )
31471 delete ( variable-list )
31472 present ( variable-list )
31473 present_or_copy ( variable-list )
31474 pcopy ( variable-list )
31475 present_or_copyin ( variable-list )
31476 pcopyin ( variable-list )
31477 present_or_copyout ( variable-list )
31478 pcopyout ( variable-list )
31479 present_or_create ( variable-list )
31480 pcreate ( variable-list ) */
31482 static tree
31484 tree list)
31485 {
31488 {
31534 }
31542 }
31544 /* OpenACC 2.0:
31545 deviceptr ( variable-list ) */
31547 static tree
31549 {
31553 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31554 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31555 variable-list must only allow for pointer variables. */
31558 {
31565 }
31568 }
31570 /* OpenACC 2.0:
31571 auto
31572 independent
31573 nohost
31574 seq */
31576 static tree
31580 {
31585 }
31587 /* OpenACC:
31588 num_gangs ( expression )
31589 num_workers ( expression )
31590 vector_length ( expression ) */
31592 static tree
31595 {
31598 matching_parens parens;
31606 {
31611 }
31619 }
31621 /* OpenACC:
31623 gang [( gang-arg-list )]
31624 worker [( [num:] int-expr )]
31625 vector [( [length:] int-expr )]
31627 where gang-arg is one of:
31629 [num:] int-expr
31630 static: size-expr
31632 and size-expr may be:
31634 *
31635 int-expr
31636 */
31638 static tree
31641 {
31651 {
31652 matching_parens parens;
31655 do
31656 {
31660 /* Gang static argument. */
31663 {
31671 {
31674 }
31676 /* Check for the '*' argument. */
31680 CPP_CLOSE_PAREN)))
31681 {
31686 {
31689 }
31691 }
31692 }
31693 /* Worker num: argument and vector length: arguments. */
31697 {
31700 }
31702 /* Now collect the actual argument. */
31704 {
31707 }
31719 {
31722 }
31724 }
31729 }
31743 cleanup_error:
31746 }
31748 /* OpenACC 2.0:
31749 tile ( size-expr-list ) */
31751 static tree
31753 {
31757 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31758 so, but the spec authors never considered such a case and have
31759 differing opinions on what it might mean, including 'not
31760 allowed'.) */
31763 clause_loc);
31768 do
31769 {
31776 {
31779 }
31780 else
31784 }
31787 /* Consume the trailing ')'. */
31795 }
31797 /* OpenACC 2.0
31798 Parse wait clause or directive parameters. */
31800 static tree
31802 {
31812 {
31817 }
31824 {
31828 {
31831 else
31832 {
31839 }
31840 }
31841 }
31844 }
31846 /* OpenACC:
31847 wait ( int-expr-list ) */
31849 static tree
31851 {
31860 }
31862 /* OpenMP 3.0:
31863 collapse ( constant-expression ) */
31865 static tree
31867 {
31869 location_t loc;
31870 HOST_WIDE_INT n;
31873 matching_parens parens;
31891 {
31894 }
31903 }
31905 /* OpenMP 2.5:
31906 default ( none | shared )
31908 OpenACC:
31909 default ( none | present ) */
31911 static tree
31914 {
31916 tree c;
31918 matching_parens parens;
31922 {
31927 {
31948 }
31951 }
31952 else
31953 {
31954 invalid_kind:
31957 else
31959 }
31976 }
31978 /* OpenMP 3.1:
31979 final ( expression ) */
31981 static tree
31983 {
31986 matching_parens parens;
32005 }
32007 /* OpenMP 2.5:
32008 if ( expression )
32010 OpenMP 4.5:
32011 if ( directive-name-modifier : expression )
32013 directive-name-modifier:
32014 parallel | task | taskloop | target data | target | target update
32015 | target enter data | target exit data */
32017 static tree
32020 {
32024 matching_parens parens;
32029 {
32041 {
32044 {
32057 else
32058 {
32059 location_t loc
32064 }
32067 {
32069 {
32074 }
32076 {
32077 location_t loc
32081 }
32082 }
32083 }
32084 }
32086 {
32088 {
32091 }
32092 else
32093 {
32095 {
32096 location_t loc
32099 }
32101 }
32102 }
32103 }
32115 {
32118 {
32121 {
32131 }
32133 p);
32135 }
32137 {
32140 else
32143 }
32146 {
32150 }
32151 }
32159 }
32161 /* OpenMP 3.1:
32162 mergeable */
32164 static tree
32167 {
32168 tree c;
32171 location);
32176 }
32178 /* OpenMP 2.5:
32179 nowait */
32181 static tree
32184 {
32185 tree c;
32192 }
32194 /* OpenMP 2.5:
32195 num_threads ( expression ) */
32197 static tree
32199 location_t location)
32200 {
32203 matching_parens parens;
32223 }
32225 /* OpenMP 4.5:
32226 num_tasks ( expression ) */
32228 static tree
32230 location_t location)
32231 {
32234 matching_parens parens;
32254 }
32256 /* OpenMP 4.5:
32257 grainsize ( expression ) */
32259 static tree
32261 location_t location)
32262 {
32265 matching_parens parens;
32285 }
32287 /* OpenMP 4.5:
32288 priority ( expression ) */
32290 static tree
32292 location_t location)
32293 {
32296 matching_parens parens;
32316 }
32318 /* OpenMP 4.5:
32319 hint ( expression ) */
32321 static tree
32323 location_t location)
32324 {
32327 matching_parens parens;
32346 }
32348 /* OpenMP 4.5:
32349 defaultmap ( tofrom : scalar ) */
32351 static tree
32353 location_t location)
32354 {
32358 matching_parens parens;
32363 {
32366 }
32370 {
32373 }
32379 {
32382 }
32386 {
32389 }
32395 location);
32401 out_err:
32406 }
32408 /* OpenMP 2.5:
32409 ordered
32411 OpenMP 4.5:
32412 ordered ( constant-expression ) */
32414 static tree
32417 {
32419 HOST_WIDE_INT n;
32425 {
32426 matching_parens parens;
32443 {
32445 "ordered argument needs positive constant integer "
32448 }
32449 }
32455 }
32457 /* OpenMP 2.5:
32458 reduction ( reduction-operator : variable-list )
32460 reduction-operator:
32461 One of: + * - & ^ | && ||
32463 OpenMP 3.1:
32465 reduction-operator:
32466 One of: + * - & ^ | && || min max
32468 OpenMP 4.0:
32470 reduction-operator:
32471 One of: + * - & ^ | && ||
32472 id-expression */
32474 static tree
32476 {
32484 {
32494 }
32498 else
32499 {
32510 {
32540 }
32541 else
32542 {
32544 resync_fail:
32549 }
32550 }
32556 NULL);
32558 {
32561 }
32564 }
32566 /* OpenMP 2.5:
32567 schedule ( schedule-kind )
32568 schedule ( schedule-kind , expression )
32570 schedule-kind:
32571 static | dynamic | guided | runtime | auto
32573 OpenMP 4.5:
32574 schedule ( schedule-modifier : schedule-kind )
32575 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32577 schedule-modifier:
32578 simd
32579 monotonic
32580 nonmonotonic */
32582 static tree
32584 {
32588 matching_parens parens;
32595 {
32604 else
32610 else
32611 {
32614 }
32615 }
32618 {
32623 {
32644 }
32645 }
32650 else
32656 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32658 {
32662 }
32665 {
32680 else
32685 }
32697 invalid_kind:
32699 resync_fail:
32704 }
32706 /* OpenMP 3.0:
32707 untied */
32709 static tree
32712 {
32713 tree c;
32720 }
32722 /* OpenMP 4.0:
32723 inbranch
32724 notinbranch */
32726 static tree
32729 {
32734 }
32736 /* OpenMP 4.0:
32737 parallel
32738 for
32739 sections
32740 taskgroup */
32742 static tree
32746 {
32750 }
32752 /* OpenMP 4.5:
32753 nogroup */
32755 static tree
32758 {
32763 }
32765 /* OpenMP 4.5:
32766 simd
32767 threads */
32769 static tree
32773 {
32778 }
32780 /* OpenMP 4.0:
32781 num_teams ( expression ) */
32783 static tree
32785 location_t location)
32786 {
32789 matching_parens parens;
32809 }
32811 /* OpenMP 4.0:
32812 thread_limit ( expression ) */
32814 static tree
32816 location_t location)
32817 {
32820 matching_parens parens;
32840 }
32842 /* OpenMP 4.0:
32843 aligned ( variable-list )
32844 aligned ( variable-list : constant-expression ) */
32846 static tree
32848 {
32852 matching_parens parens;
32860 {
32870 }
32876 }
32878 /* OpenMP 4.0:
32879 linear ( variable-list )
32880 linear ( variable-list : expression )
32882 OpenMP 4.5:
32883 linear ( modifier ( variable-list ) )
32884 linear ( modifier ( variable-list ) : expression ) */
32886 static tree
32889 {
32894 matching_parens parens;
32899 {
32911 else
32913 }
32918 else
32919 {
32928 }
32931 {
32936 {
32947 {
32950 }
32953 }
32964 }
32967 {
32970 }
32973 }
32975 /* OpenMP 4.0:
32976 safelen ( constant-expression ) */
32978 static tree
32980 location_t location)
32981 {
32984 matching_parens parens;
33003 }
33005 /* OpenMP 4.0:
33006 simdlen ( constant-expression ) */
33008 static tree
33010 location_t location)
33011 {
33014 matching_parens parens;
33033 }
33035 /* OpenMP 4.5:
33036 vec:
33037 identifier [+/- integer]
33038 vec , identifier [+/- integer]
33039 */
33041 static tree
33043 tree list)
33044 {
33048 {
33051 }
33054 {
33061 else
33062 {
33063 t = cp_parser_lookup_name_simple
33068 id_loc);
33069 }
33075 {
33078 }
33082 {
33085 }
33089 {
33092 }
33095 add_to_vector:
33097 {
33101 }
33107 }
33110 {
33116 }
33118 }
33120 /* OpenMP 4.0:
33121 depend ( depend-kind : variable-list )
33123 depend-kind:
33124 in | out | inout
33126 OpenMP 4.5:
33127 depend ( source )
33129 depend ( sink : vec ) */
33131 static tree
33133 {
33137 matching_parens parens;
33142 {
33156 else
33158 }
33159 else
33165 {
33175 }
33182 else
33183 {
33189 }
33192 invalid_kind:
33194 resync_fail:
33199 }
33201 /* OpenMP 4.0:
33202 map ( map-kind : variable-list )
33203 map ( variable-list )
33205 map-kind:
33206 alloc | to | from | tofrom
33208 OpenMP 4.5:
33209 map-kind:
33210 alloc | to | from | tofrom | release | delete
33212 map ( always [,] map-kind: variable-list ) */
33214 static tree
33216 {
33225 {
33230 {
33233 nth++;
33239 {
33244 }
33245 }
33246 }
33250 {
33264 else
33265 {
33271 }
33274 }
33277 {
33281 }
33284 NULL);
33290 }
33292 /* OpenMP 4.0:
33293 device ( expression ) */
33295 static tree
33297 location_t location)
33298 {
33301 matching_parens parens;
33321 }
33323 /* OpenMP 4.0:
33324 dist_schedule ( static )
33325 dist_schedule ( static , expression ) */
33327 static tree
33329 location_t location)
33330 {
33333 matching_parens parens;
33344 {
33355 }
33360 location);
33364 invalid_kind:
33366 resync_fail:
33371 }
33373 /* OpenMP 4.0:
33374 proc_bind ( proc-bind-kind )
33376 proc-bind-kind:
33377 master | close | spread */
33379 static tree
33381 location_t location)
33382 {
33383 tree c;
33390 {
33400 else
33402 }
33403 else
33412 location);
33417 invalid_kind:
33419 resync_fail:
33424 }
33426 /* OpenACC:
33427 async [( int-expr )] */
33429 static tree
33431 {
33438 {
33439 matching_parens parens;
33448 }
33458 }
33460 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33461 is a bitmask in MASK. Return the list of clauses found. */
33463 static tree
33467 {
33472 {
33473 location_t here;
33474 pragma_omp_clause c_kind;
33475 omp_clause_code code;
33486 {
33538 clauses);
33556 OMP_CLAUSE_INDEPENDENT,
33568 clauses);
33574 clauses);
33598 clauses);
33620 clauses);
33632 clauses);
33646 }
33651 {
33652 /* Remove the invalid clause(s) from the list to avoid
33653 confusing the rest of the compiler. */
33656 }
33657 }
33659 saw_error:
33666 }
33668 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33669 is a bitmask in MASK. Return the list of clauses found; the result
33670 of clause default goes in *pdefault. */
33672 static tree
33676 {
33682 {
33683 pragma_omp_clause c_kind;
33694 {
33706 clauses);
33720 clauses);
33740 clauses);
33745 clauses);
33755 clauses);
33789 clauses);
33803 clauses);
33818 OMP_CLAUSE_NOTINBRANCH,
33827 {
33828 clause_not_first:
33832 }
33862 clauses);
33863 else
33873 clauses);
33891 {
33896 }
33939 clauses
33945 clauses
33953 }
33958 {
33959 /* Remove the invalid clause(s) from the list to avoid
33960 confusing the rest of the compiler. */
33963 }
33964 }
33965 saw_error:
33968 {
33971 else
33973 }
33975 }
33977 /* OpenMP 2.5:
33978 structured-block:
33979 statement
33981 In practice, we're also interested in adding the statement to an
33982 outer node. So it is convenient if we work around the fact that
33983 cp_parser_statement calls add_stmt. */
33985 static unsigned
33987 {
33990 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33991 This preserves the "not within loop or switch" style error messages
33992 for nonsense cases like
33993 void foo() {
33994 #pragma omp single
33995 break;
33996 }
33997 */
34002 }
34004 static void
34006 {
34008 }
34010 static tree
34012 {
34020 }
34022 /* OpenMP 2.5:
34023 # pragma omp atomic new-line
34024 expression-stmt
34026 expression-stmt:
34027 x binop= expr | x++ | ++x | x-- | --x
34028 binop:
34029 +, *, -, /, &, ^, |, <<, >>
34031 where x is an lvalue expression with scalar type.
34033 OpenMP 3.1:
34034 # pragma omp atomic new-line
34035 update-stmt
34037 # pragma omp atomic read new-line
34038 read-stmt
34040 # pragma omp atomic write new-line
34041 write-stmt
34043 # pragma omp atomic update new-line
34044 update-stmt
34046 # pragma omp atomic capture new-line
34047 capture-stmt
34049 # pragma omp atomic capture new-line
34050 capture-block
34052 read-stmt:
34053 v = x
34054 write-stmt:
34055 x = expr
34056 update-stmt:
34057 expression-stmt | x = x binop expr
34058 capture-stmt:
34059 v = expression-stmt
34060 capture-block:
34061 { v = x; update-stmt; } | { update-stmt; v = x; }
34063 OpenMP 4.0:
34064 update-stmt:
34065 expression-stmt | x = x binop expr | x = expr binop x
34066 capture-stmt:
34067 v = update-stmt
34068 capture-block:
34069 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34071 where x and v are lvalue expressions with scalar type. */
34073 static void
34075 {
34083 {
34088 {
34094 }
34095 }
34097 {
34109 else
34113 }
34115 {
34121 {
34126 {
34129 }
34130 }
34131 }
34135 {
34145 else
34150 {
34151 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34152 opcode. */
34157 }
34161 {
34164 }
34165 else
34166 {
34172 }
34175 }
34177 restart:
34181 {
34188 /* FALLTHROUGH */
34198 /* FALLTHROUGH */
34213 /* Undo effects of boolean_increment for post {in,de}crement. */
34215 /* FALLTHRU */
34219 {
34220 /* Undo effects of boolean_increment. */
34222 {
34223 /* This is pre or post increment. */
34228 && !structured_block
34232 }
34233 }
34234 /* FALLTHRU */
34237 {
34272 {
34276 }
34279 {
34285 {
34290 }
34292 {
34304 {
34306 {
34311 }
34312 else
34314 }
34318 }
34321 {
34328 }
34332 }
34336 {
34339 {
34347 }
34349 {
34354 }
34389 }
34400 /* FALLTHROUGH */
34405 }
34412 }
34413 stmt_done:
34415 {
34426 }
34428 {
34431 }
34432 done:
34438 saw_error:
34441 {
34445 {
34449 }
34450 }
34451 }
34454 /* OpenMP 2.5:
34455 # pragma omp barrier new-line */
34457 static void
34459 {
34462 }
34464 /* OpenMP 2.5:
34465 # pragma omp critical [(name)] new-line
34466 structured-block
34468 OpenMP 4.5:
34469 # pragma omp critical [(name) [hint(expression)]] new-line
34470 structured-block */
34472 #define OMP_CRITICAL_CLAUSE_MASK \
34473 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34475 static tree
34477 {
34481 {
34482 matching_parens parens;
34496 OMP_CRITICAL_CLAUSE_MASK,
34498 }
34499 else
34504 }
34506 /* OpenMP 2.5:
34507 # pragma omp flush flush-vars[opt] new-line
34509 flush-vars:
34510 ( variable-list ) */
34512 static void
34514 {
34520 }
34522 /* Helper function, to parse omp for increment expression. */
34524 static tree
34526 {
34531 {
34534 }
34537 {
34544 /* Fall through: OpenMP disallows NE_EXPR. */
34548 }
34550 /* If decl is an iterator, preserve LHS and RHS of the relational
34551 expr until finish_omp_for. */
34562 }
34564 /* Helper function, to parse omp for increment expression. */
34566 static tree
34568 {
34572 cp_id_kind idk;
34576 {
34585 }
34594 {
34599 }
34606 {
34610 }
34623 do
34624 {
34631 {
34633 {
34636 else
34638 tf_warning_or_error);
34639 }
34640 else
34643 }
34644 }
34648 {
34654 }
34655 else
34659 }
34661 /* Parse the initialization statement of an OpenMP for loop.
34663 Return true if the resulting construct should have an
34664 OMP_CLAUSE_PRIVATE added to it. */
34666 static tree
34674 {
34680 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34682 init-expr:
34683 var = lb
34684 integer-type var = lb
34685 random-access-iterator-type var = lb
34686 pointer-type var = lb
34687 */
34688 cp_decl_specifier_seq type_specifiers;
34690 /* First, try to parse as an initialized declaration. See
34691 cp_parser_condition, from whence the bulk of this is copied. */
34698 {
34699 /* If parsing a type specifier seq succeeded, then this
34700 MUST be a initialized declaration. */
34705 CP_PARSER_DECLARATOR_NAMED,
34716 else
34717 {
34727 {
34729 CPP_OPEN_PAREN))
34732 else
34733 /* Trigger an error. */
34738 }
34742 {
34750 {
34753 auto_node);
34758 }
34761 asm_specification,
34762 LOOKUP_ONLYCONVERTING);
34765 {
34768 }
34769 else
34770 {
34773 {
34775 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34777 {
34781 {
34785 }
34787 }
34789 {
34794 }
34795 }
34796 }
34798 }
34799 else
34800 {
34801 /* Consume '='. */
34805 non_class:
34808 else
34811 asm_specification,
34812 LOOKUP_ONLYCONVERTING);
34813 }
34817 }
34818 }
34819 else
34820 {
34821 cp_id_kind idk;
34822 /* If parsing a type specifier sequence failed, then
34823 this MUST be a simple expression. */
34829 && decl
34832 {
34843 {
34848 }
34853 }
34855 && decl
34858 {
34859 tree rhs;
34867 rhs,
34868 tf_warning_or_error));
34871 }
34872 else
34873 {
34878 {
34882 }
34883 }
34884 }
34886 }
34888 /* Parse the restricted form of the for statement allowed by OpenMP. */
34890 static tree
34893 {
34897 location_t loc_first;
34908 {
34911 }
34914 {
34917 }
34920 {
34926 }
34928 {
34931 {
34933 "%<linear%> clause may not be specified together "
34936 }
34937 else
34939 }
34952 {
34955 location_t loc;
34958 {
34962 }
34965 matching_parens parens;
34972 add_private_clause
34978 {
34981 {
34987 }
34988 else
34990 }
34997 {
35002 {
35006 }
35009 {
35010 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35014 {
35017 }
35018 else
35019 {
35022 }
35024 }
35025 else
35026 {
35031 }
35032 }
35035 {
35036 tree c;
35038 {
35047 decl);
35051 decl);
35052 }
35054 {
35059 else
35064 {
35067 /* For linear, signal that we need to fill up
35068 the so far unknown linear step. */
35071 }
35072 }
35073 }
35082 {
35083 /* If decl is an iterator, preserve the operator on decl
35084 until finish_omp_for. */
35086 && ((processing_template_decl
35091 else
35095 }
35107 {
35110 }
35115 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35116 in between the collapsed for loops to be still considered perfectly
35117 nested. Hopefully the final version clarifies this.
35118 For now handle (multiple) {'s and empty statements. */
35121 {
35125 {
35127 bracecount++;
35128 }
35132 else
35133 {
35140 }
35141 }
35144 {
35147 }
35148 }
35153 /* Note that we saved the original contents of this flag when we entered
35154 the structured block, and so we don't need to re-save it here. */
35157 /* Note that the grammar doesn't call for a structured block here,
35158 though the loop as a whole is a structured block. */
35165 else
35170 {
35172 {
35174 nbraces--;
35175 }
35178 else
35179 {
35181 {
35184 }
35189 }
35190 }
35193 {
35197 else
35199 }
35203 }
35205 /* Helper function for OpenMP parsing, split clauses and call
35206 finish_omp_clauses on each of the set of clauses afterwards. */
35208 static void
35211 {
35217 }
35219 /* OpenMP 4.0:
35220 #pragma omp simd simd-clause[optseq] new-line
35221 for-loop */
35223 #define OMP_SIMD_CLAUSE_MASK \
35224 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35233 static tree
35237 {
35248 {
35252 OMP_CLAUSE_ORDERED);
35254 {
35256 "%<ordered%> clause with parameter may not be specified "
35259 }
35260 }
35271 }
35273 /* OpenMP 2.5:
35274 #pragma omp for for-clause[optseq] new-line
35275 for-loop
35277 OpenMP 4.0:
35278 #pragma omp for simd for-simd-clause[optseq] new-line
35279 for-loop */
35281 #define OMP_FOR_CLAUSE_MASK \
35282 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35292 static tree
35296 {
35303 /* parallel for{, simd} disallows nowait clause, but for
35304 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35307 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35312 {
35317 {
35341 }
35342 }
35344 {
35347 }
35349 /* Composite distribute parallel for disallows linear clause. */
35356 {
35359 }
35370 }
35372 /* OpenMP 2.5:
35373 # pragma omp master new-line
35374 structured-block */
35376 static tree
35378 {
35382 }
35384 /* OpenMP 2.5:
35385 # pragma omp ordered new-line
35386 structured-block
35388 OpenMP 4.5:
35389 # pragma omp ordered ordered-clauses new-line
35390 structured-block */
35392 #define OMP_ORDERED_CLAUSE_MASK \
35393 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35396 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35397 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35399 static bool
35402 {
35406 {
35411 {
35413 {
35416 }
35418 {
35420 "%<depend%> clause may only be used in compound "
35424 }
35425 tree clauses
35427 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35431 }
35432 }
35434 tree clauses
35445 }
35447 /* OpenMP 2.5:
35449 section-scope:
35450 { section-sequence }
35452 section-sequence:
35453 section-directive[opt] structured-block
35454 section-sequence section-directive structured-block */
35456 static tree
35458 {
35463 matching_braces braces;
35471 {
35475 }
35478 {
35486 {
35490 }
35492 {
35495 }
35500 }
35511 }
35513 /* OpenMP 2.5:
35514 # pragma omp sections sections-clause[optseq] newline
35515 sections-scope */
35517 #define OMP_SECTIONS_CLAUSE_MASK \
35518 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35524 static tree
35527 {
35539 {
35542 }
35549 }
35551 /* OpenMP 2.5:
35552 # pragma omp parallel parallel-clause[optseq] new-line
35553 structured-block
35554 # pragma omp parallel for parallel-for-clause[optseq] new-line
35555 structured-block
35556 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35557 structured-block
35559 OpenMP 4.0:
35560 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35561 structured-block */
35563 #define OMP_PARALLEL_CLAUSE_MASK \
35564 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35574 static tree
35578 {
35585 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35591 {
35599 if_p);
35603 if_p);
35606 block);
35611 }
35612 /* When combined with distribute, parallel has to be followed by for.
35613 #pragma omp target parallel is allowed though. */
35617 {
35621 }
35623 {
35626 }
35628 {
35632 {
35642 block);
35645 }
35646 }
35651 {
35654 }
35662 }
35664 /* OpenMP 2.5:
35665 # pragma omp single single-clause[optseq] new-line
35666 structured-block */
35668 #define OMP_SINGLE_CLAUSE_MASK \
35669 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35674 static tree
35676 {
35686 }
35688 /* OpenMP 3.0:
35689 # pragma omp task task-clause[optseq] new-line
35690 structured-block */
35692 #define OMP_TASK_CLAUSE_MASK \
35693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35704 static tree
35706 {
35717 }
35719 /* OpenMP 3.0:
35720 # pragma omp taskwait new-line */
35722 static void
35724 {
35727 }
35729 /* OpenMP 3.1:
35730 # pragma omp taskyield new-line */
35732 static void
35734 {
35737 }
35739 /* OpenMP 4.0:
35740 # pragma omp taskgroup new-line
35741 structured-block */
35743 static tree
35745 {
35749 if_p));
35750 }
35753 /* OpenMP 2.5:
35754 # pragma omp threadprivate (variable-list) */
35756 static void
35758 {
35759 tree vars;
35765 }
35767 /* OpenMP 4.0:
35768 # pragma omp cancel cancel-clause[optseq] new-line */
35770 #define OMP_CANCEL_CLAUSE_MASK \
35771 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35777 static void
35779 {
35783 }
35785 /* OpenMP 4.0:
35786 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35788 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35789 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35794 static void
35797 {
35798 tree clauses;
35802 {
35807 {
35810 }
35811 }
35813 {
35817 }
35820 {
35825 else
35829 }
35832 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35834 pragma_tok);
35836 }
35838 /* OpenMP 4.0:
35839 #pragma omp distribute distribute-clause[optseq] new-line
35840 for-loop */
35842 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35843 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35849 static tree
35853 {
35862 {
35870 else
35873 {
35879 {
35883 else
35886 }
35892 else
35906 }
35907 }
35909 {
35912 }
35917 {
35920 }
35931 }
35933 /* OpenMP 4.0:
35934 # pragma omp teams teams-clause[optseq] new-line
35935 structured-block */
35937 #define OMP_TEAMS_CLAUSE_MASK \
35938 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35946 static tree
35950 {
35959 {
35963 {
35988 }
35989 }
35991 {
35994 }
35999 {
36002 }
36011 }
36013 /* OpenMP 4.0:
36014 # pragma omp target data target-data-clause[optseq] new-line
36015 structured-block */
36017 #define OMP_TARGET_DATA_CLAUSE_MASK \
36018 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36023 static tree
36025 {
36026 tree clauses
36031 {
36034 {
36051 "%<#pragma omp target data%> with map-type other "
36052 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36056 }
36058 }
36061 {
36064 "%<#pragma omp target data%> must contain at least "
36067 }
36078 }
36080 /* OpenMP 4.5:
36081 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36082 structured-block */
36084 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36085 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36091 static tree
36094 {
36097 {
36102 {
36105 }
36106 }
36108 {
36112 }
36115 {
36121 }
36123 tree clauses
36128 {
36131 {
36144 "%<#pragma omp target enter data%> with map-type other "
36148 }
36150 }
36153 {
36156 "%<#pragma omp target enter data%> must contain at least "
36159 }
36166 }
36168 /* OpenMP 4.5:
36169 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36170 structured-block */
36172 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36173 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36179 static tree
36182 {
36185 {
36190 {
36193 }
36194 }
36196 {
36200 }
36203 {
36209 }
36211 tree clauses
36216 {
36219 {
36233 "%<#pragma omp target exit data%> with map-type other "
36234 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36238 }
36240 }
36243 {
36246 "%<#pragma omp target exit data%> must contain at least "
36249 }
36256 }
36258 /* OpenMP 4.0:
36259 # pragma omp target update target-update-clause[optseq] new-line */
36261 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36262 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36269 static bool
36272 {
36274 {
36280 }
36282 tree clauses
36287 {
36289 "%<#pragma omp target update%> must contain at least one "
36292 }
36300 }
36302 /* OpenMP 4.0:
36303 # pragma omp target target-clause[optseq] new-line
36304 structured-block */
36306 #define OMP_TARGET_CLAUSE_MASK \
36307 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36314 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36317 static bool
36320 {
36324 {
36336 {
36344 {
36345 tree stmt;
36347 {
36350 OMP_TARGET_CLAUSE_MASK,
36355 OMP_TARGET_CLAUSE_MASK,
36360 OMP_TARGET_CLAUSE_MASK,
36365 }
36367 }
36372 {
36376 if_p);
36381 if_p);
36386 if_p);
36390 }
36396 {
36397 /* For combined target teams, ensure the num_teams and
36398 thread_limit clause expressions are evaluated on the host,
36399 before entering the target construct. */
36400 tree c;
36406 {
36415 OMP_CLAUSE_FIRSTPRIVATE);
36420 }
36421 }
36431 }
36433 {
36436 }
36438 {
36442 }
36444 {
36448 }
36450 {
36454 }
36456 {
36459 }
36460 }
36462 {
36465 }
36480 check_clauses:
36482 {
36485 {
36499 "%<#pragma omp target%> with map-type other "
36500 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36504 }
36506 }
36508 }
36510 /* OpenACC 2.0:
36511 # pragma acc cache (variable-list) new-line
36512 */
36514 static tree
36516 {
36531 }
36533 /* OpenACC 2.0:
36534 # pragma acc data oacc-data-clause[optseq] new-line
36535 structured-block */
36537 #define OACC_DATA_CLAUSE_MASK \
36538 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36550 static tree
36552 {
36565 }
36567 /* OpenACC 2.0:
36568 # pragma acc host_data <clauses> new-line
36569 structured-block */
36571 #define OACC_HOST_DATA_CLAUSE_MASK \
36572 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36574 static tree
36576 {
36589 }
36591 /* OpenACC 2.0:
36592 # pragma acc declare oacc-data-clause[optseq] new-line
36593 */
36595 #define OACC_DECLARE_CLAUSE_MASK \
36596 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36609 static tree
36611 {
36620 {
36624 }
36627 {
36631 {
36635 }
36638 {
36650 {
36652 "%qD must be a global variable in "
36654 decl);
36657 }
36662 {
36666 }
36668 {
36670 "invalid use of %<extern%> variable %qD "
36674 }
36676 {
36678 "invalid use of %<global%> variable %qD "
36682 }
36684 }
36689 {
36694 }
36697 {
36698 tree id;
36702 else
36708 {
36711 {
36714 {
36718 }
36719 }
36720 }
36721 }
36722 }
36735 }
36737 /* OpenACC 2.0:
36738 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36740 or
36742 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36744 LOC is the location of the #pragma token.
36745 */
36747 #define OACC_ENTER_DATA_CLAUSE_MASK \
36748 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36756 #define OACC_EXIT_DATA_CLAUSE_MASK \
36757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36763 static tree
36766 {
36775 {
36780 }
36787 else
36792 {
36796 }
36804 }
36806 /* OpenACC 2.0:
36807 # pragma acc loop oacc-loop-clause[optseq] new-line
36808 structured-block */
36810 #define OACC_LOOP_CLAUSE_MASK \
36811 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36822 static tree
36825 {
36834 {
36840 }
36849 }
36851 /* OpenACC 2.0:
36852 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36853 structured-block
36855 or
36857 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36858 structured-block
36859 */
36861 #define OACC_KERNELS_CLAUSE_MASK \
36862 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36880 #define OACC_PARALLEL_CLAUSE_MASK \
36881 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36902 static tree
36905 {
36906 omp_clause_mask mask;
36909 {
36922 }
36925 {
36929 {
36932 tree clauses;
36934 if_p);
36936 }
36937 }
36946 }
36948 /* OpenACC 2.0:
36949 # pragma acc update oacc-update-clause[optseq] new-line
36950 */
36952 #define OACC_UPDATE_CLAUSE_MASK \
36953 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36960 static tree
36962 {
36969 {
36971 "%<#pragma acc update%> must contain at least one "
36974 }
36982 }
36984 /* OpenACC 2.0:
36985 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36987 LOC is the location of the #pragma token.
36988 */
36990 #define OACC_WAIT_CLAUSE_MASK \
36991 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36993 static tree
36995 {
37009 }
37011 /* OpenMP 4.0:
37012 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37014 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37015 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37022 static void
37025 {
37027 cp_omp_declare_simd_data data;
37029 {
37034 /* It is safe to take the address of a local variable; it will only be
37035 used while this scope is live. */
37037 }
37039 /* Store away all pragma tokens. */
37051 {
37055 {
37068 }
37073 "%<#pragma omp declare simd%> not immediately followed by "
37077 }
37078 }
37080 /* Finalize #pragma omp declare simd clauses after direct declarator has
37081 been parsed, and put that into "omp declare simd" attribute. */
37083 static tree
37085 {
37091 {
37095 }
37100 {
37118 }
37122 }
37125 /* OpenMP 4.0:
37126 # pragma omp declare target new-line
37127 declarations and definitions
37128 # pragma omp end declare target new-line
37130 OpenMP 4.5:
37131 # pragma omp declare target ( extended-list ) new-line
37133 # pragma omp declare target declare-target-clauses[seq] new-line */
37135 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37136 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37139 static void
37141 {
37144 clauses
37148 {
37150 clauses);
37153 }
37154 else
37155 {
37159 }
37162 "%<#pragma omp declare target%> with clauses in between "
37163 "%<#pragma omp declare target%> without clauses and "
37166 {
37172 {
37175 }
37176 else
37179 {
37181 "%qD specified both in declare target %<link%> and %<to%>"
37184 }
37186 {
37193 {
37196 {
37200 }
37201 }
37202 }
37203 }
37204 }
37206 static void
37208 {
37211 {
37214 }
37216 {
37220 {
37223 }
37226 else
37227 {
37231 }
37232 }
37233 else
37234 {
37238 }
37242 "%<#pragma omp end declare target%> without corresponding "
37244 else
37246 }
37248 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37249 expression and optional initializer clause of
37250 #pragma omp declare reduction. We store the expression(s) as
37251 either 3, 6 or 7 special statements inside of the artificial function's
37252 body. The first two statements are DECL_EXPRs for the artificial
37253 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37254 expression that uses those variables.
37255 If there was any INITIALIZER clause, this is followed by further statements,
37256 the fourth and fifth statements are DECL_EXPRs for the artificial
37257 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37258 constructor variant (first token after open paren is not omp_priv),
37259 then the sixth statement is a statement with the function call expression
37260 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37261 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37262 to initialize the OMP_PRIV artificial variable and there is seventh
37263 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37265 static bool
37267 {
37279 tree combiner;
37294 {
37297 }
37300 {
37302 matching_parens parens;
37308 {
37311 }
37327 {
37331 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37335 == CPP_CLOSE_PAREN
37338 {
37342 }
37347 }
37348 else
37349 {
37365 {
37370 }
37372 tree arg;
37385 }
37396 }
37400 UNKNOWN_LOCATION);
37403 }
37405 /* OpenMP 4.0
37406 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37407 initializer-clause[opt] new-line
37409 initializer-clause:
37410 initializer (omp_priv initializer)
37411 initializer (function-name (argument-list)) */
37413 static void
37416 {
37426 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37433 {
37465 }
37477 /* Types may not be defined in declare reduction type list. */
37480 parser->type_definition_forbidden_message
37486 saved_colon_doesnt_start_class_def_p
37491 {
37495 ;
37514 else
37519 else
37521 }
37523 /* Restore the saved message. */
37526 parser->colon_doesnt_start_class_def_p
37531 {
37532 fail:
37535 }
37541 {
37542 tree fntype
37545 NULL_TREE);
37565 {
37570 }
37572 {
37574 {
37583 }
37590 }
37591 else
37592 {
37595 }
37598 else
37601 {
37604 }
37606 {
37609 else
37614 }
37619 else
37620 {
37629 }
37636 }
37640 done:
37641 /* Free any declarators allocated. */
37643 }
37645 /* OpenMP 4.0
37646 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37647 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37648 initializer-clause[opt] new-line
37649 #pragma omp declare target new-line */
37651 static bool
37654 {
37656 {
37661 {
37664 context);
37666 }
37669 {
37672 context);
37674 }
37676 {
37679 }
37681 {
37685 }
37686 }
37691 }
37693 /* OpenMP 4.5:
37694 #pragma omp taskloop taskloop-clause[optseq] new-line
37695 for-loop
37697 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37698 for-loop */
37700 #define OMP_TASKLOOP_CLAUSE_MASK \
37701 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37716 static tree
37720 {
37729 {
37734 {
37758 }
37759 }
37761 {
37764 }
37769 {
37772 }
37778 if_p);
37784 }
37787 /* OpenACC 2.0:
37788 # pragma acc routine oacc-routine-clause[optseq] new-line
37789 function-definition
37791 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37792 */
37794 #define OACC_ROUTINE_CLAUSE_MASK \
37795 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37801 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37802 component, which must resolve to a declared namespace-scope
37803 function. The clauses are either processed directly (for a named
37804 function), or defered until the immediatley following declaration
37805 is parsed. */
37807 static void
37810 {
37812 /* The checking for "another pragma following this one" in the "no optional
37813 '( name )'" case makes sure that we dont re-enter. */
37816 cp_oacc_routine_data data;
37822 /* It is safe to take the address of a local variable; it will only be
37823 used while this scope is live. */
37826 /* Look for optional '( name )'. */
37828 {
37829 matching_parens parens;
37832 /* We parse the name as an id-expression. If it resolves to
37833 anything other than a non-overloaded function at namespace
37834 scope, it's an error. */
37848 {
37852 }
37854 data.clauses
37862 {
37867 }
37869 /* Perhaps we should use the same rule as declarations in different
37870 namespaces? */
37872 {
37877 }
37880 {
37884 }
37888 }
37890 {
37891 /* Store away all pragma tokens. */
37902 /* Emit a helpful diagnostic if there's another pragma following this
37903 one. */
37905 {
37908 /* ..., and then just keep going. */
37910 }
37912 /* We only have to consider the pragma_external case here. */
37917 else
37920 }
37921 }
37923 /* Finalize #pragma acc routine clauses after direct declarator has
37924 been parsed. */
37926 static tree
37928 {
37933 {
37935 "%<#pragma acc routine%> not immediately followed by "
37938 }
37955 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37956 fndecl_seen. */
37959 }
37961 /* Apply any saved OpenACC routine clauses to a just-parsed
37962 declaration. */
37964 static void
37966 {
37968 {
37969 /* Keep going if we're in error reporting mode. */
37975 {
37977 "%<#pragma acc routine%> not immediately followed by"
37981 }
37983 {
37986 }
37989 {
37994 }
37997 {
38005 }
38007 /* Process the routine's dimension clauses. */
38011 /* Add an "omp declare target" attribute. */
38016 /* Don't unset parser->oacc_routine here: we may still need it to
38017 diagnose wrong usage. But, remember that we've used this "#pragma acc
38018 routine". */
38020 }
38021 }
38023 /* Main entry point to OpenMP statement pragmas. */
38025 static void
38027 {
38028 tree stmt;
38033 {
38056 if_p);
38061 if_p);
38078 if_p);
38083 if_p);
38091 if_p);
38100 if_p);
38114 if_p);
38119 if_p);
38123 }
38126 }
38127 \f
38128 /* Transactional Memory parsing routines. */
38130 /* Parse a transaction attribute.
38132 txn-attribute:
38133 attribute
38134 [ [ identifier ] ]
38136 We use this instead of cp_parser_attributes_opt for transactions to avoid
38137 the pedwarn in C++98 mode. */
38139 static tree
38141 {
38156 {
38160 /* For keywords, use the canonical spelling,
38161 not the parsed identifier. */
38165 }
38166 else
38170 error1:
38173 }
38175 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38177 transaction-statement:
38178 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38179 compound-statement
38180 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38181 */
38183 static tree
38185 {
38196 else
38197 {
38201 }
38203 /* Parse a noexcept specification. */
38207 {
38208 /* cancel-and-throw is unimplemented. */
38211 }
38212 else
38215 /* Keep track if we're in the lexical scope of an outer transaction. */
38227 }
38229 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38231 transaction-expression:
38232 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38233 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38234 */
38236 static tree
38238 {
38251 keyword == RID_TRANSACTION_RELAXED
38265 /* Set this early. This might mean that we allow transaction_cancel in
38266 an expression that we find out later actually has to be a constexpr.
38267 However, we expect that cxx_constant_value will be able to deal with
38268 this; also, if the noexcept has no constexpr, then what we parse next
38269 really is a transaction's body. */
38272 /* Parse a noexcept specification. */
38278 {
38279 matching_parens parens;
38286 }
38287 else
38288 {
38289 /* The only expression that is available got parsed for the noexcept
38290 already. noexcept is true then. */
38293 }
38302 }
38304 /* Parse a function-transaction-block.
38306 function-transaction-block:
38307 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38308 function-body
38309 __transaction_atomic txn-attribute[opt] function-try-block
38310 __transaction_relaxed ctor-initializer[opt] function-body
38311 __transaction_relaxed function-try-block
38312 */
38314 static void
38316 {
38331 else
38332 {
38336 }
38344 else
38345 cp_parser_ctor_initializer_opt_and_function_body
38351 }
38353 /* Parse a __transaction_cancel statement.
38355 cancel-statement:
38356 __transaction_cancel txn-attribute[opt] ;
38357 __transaction_cancel txn-attribute[opt] throw-expression ;
38359 ??? Cancel and throw is not yet implemented. */
38361 static tree
38363 {
38369 RT_TRANSACTION_CANCEL);
38376 /* ??? Parse cancel-and-throw here. */
38381 {
38385 }
38387 {
38391 }
38393 {
38396 {
38402 }
38403 }
38405 {
38409 }
38415 }
38416 \f
38417 /* The parser. */
38421 \f
38422 /* Special handling for the first token or line in the file. The first
38423 thing in the file might be #pragma GCC pch_preprocess, which loads a
38424 PCH file, which is a GC collection point. So we need to handle this
38425 first pragma without benefit of an existing lexer structure.
38427 Always returns one token to the caller in *FIRST_TOKEN. This is
38428 either the true first token of the file, or the first token after
38429 the initial pragma. */
38431 static void
38433 {
38442 {
38449 }
38450 else
38453 /* Skip to the end of the pragma. */
38457 /* Now actually load the PCH file. */
38461 /* Read one more token to return to our caller. We have to do this
38462 after reading the PCH file in, since its pointers have to be
38463 live. */
38465 }
38467 /* Parse a pragma GCC ivdep. */
38469 static bool
38471 {
38474 }
38476 /* Parse a pragma GCC unroll. */
38478 static unsigned short
38480 {
38490 {
38492 " assignment-expression that evaluates to a non-negative"
38495 }
38496 else
38497 {
38501 }
38504 }
38506 /* Normal parsing of a pragma token. Here we can (and must) use the
38507 regular lexer. */
38509 static bool
38511 {
38514 tree stmt;
38525 {
38533 {
38543 }
38548 {
38558 }
38563 {
38574 }
38579 {
38590 }
38595 {
38606 }
38626 {
38631 }
38639 {
38644 }
38652 {
38656 }
38662 {
38667 }
38675 {
38680 }
38735 "%<#pragma omp section%> may only be used in "
38740 {
38742 {
38746 }
38752 {
38756 }
38757 else
38763 {
38766 }
38769 }
38772 {
38774 {
38778 }
38779 const unsigned short unroll
38785 {
38789 }
38790 else
38796 {
38799 }
38802 }
38809 bad_stmt:
38812 }
38816 }
38818 /* The interface the pragma parsers have to the lexer. */
38820 enum cpp_ttype
38822 {
38834 else
38835 {
38839 }
38842 }
38844 \f
38845 /* External interface. */
38847 /* Parse one entire translation unit. */
38849 void
38851 {
38864 }
38866 /* Create an identifier for a generic parameter type (a synthesized
38867 template parameter implied by `auto' or a concept identifier). */
38870 static tree
38872 {
38876 }
38878 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38879 (creating a new template parameter list if necessary). Returns the newly
38880 created template type parm. */
38882 static tree
38884 {
38887 /* Before committing to modifying any scope, if we're in an
38888 implicit template scope, and we're trying to synthesize a
38889 constrained parameter, try to find a previous parameter with
38890 the same name. This is the same-type rule for abbreviated
38891 function templates.
38893 NOTE: We can generate implicit parameters when tentatively
38894 parsing a nested name specifier, only to reject that parse
38895 later. However, matching the same template-id as part of a
38896 direct-declarator should generate an identical template
38897 parameter, so this rule will merge them. */
38899 {
38902 {
38904 {
38907 /* Return the TEMPLATE_PARM_INDEX. */
38910 }
38912 }
38913 }
38915 /* We are either continuing a function template that already contains implicit
38916 template parameters, creating a new fully-implicit function template, or
38917 extending an existing explicit function template with implicit template
38918 parameters. */
38926 {
38930 }
38931 else
38932 {
38933 /* Roll back to the existing template parameter scope (in the case of
38934 extending an explicit function template) or introduce a new template
38935 parameter scope ahead of the function parameter scope (or class scope
38936 in the case of out-of-line member definitions). The function scope is
38937 added back after template parameter synthesis below. */
38942 {
38945 }
38947 {
38948 /* If not defining a class, then any class scope is a scope level in
38949 an out-of-line member definition. In this case simply wind back
38950 beyond the first such scope to inject the template parameter list.
38951 Otherwise wind back to the class being defined. The latter can
38952 occur in class member friend declarations such as:
38954 class A {
38955 void foo (auto);
38956 };
38957 class B {
38958 friend void A::foo (auto);
38959 };
38961 The template parameter list synthesized for the friend declaration
38962 must be injected in the scope of 'B'. This can also occur in
38963 erroneous cases such as:
38965 struct A {
38966 struct B {
38967 void foo (auto);
38968 };
38969 void B::foo (auto) {}
38970 };
38972 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38973 but, nevertheless, the template parameter list synthesized for the
38974 declarator should be injected into the scope of 'A' as if the
38975 ill-formed template was specified explicitly. */
38978 {
38981 }
38982 }
38988 {
38989 /* Introduce a new template parameter list for implicit template
38990 parameters. */
38994 parser->implicit_template_scope
39001 }
39002 else
39003 {
39004 /* Synthesize implicit template parameters at the end of the explicit
39005 template parameter list. */
39012 parser->implicit_template_parms
39014 }
39015 }
39017 /* Synthesize a new template parameter and track the current template
39018 parameter chain with implicit_template_parms. */
39022 tree synth_tmpl_parm;
39026 synth_tmpl_parm
39029 synth_tmpl_parm
39031 else
39032 {
39036 }
39038 // Attach the constraint to the parm before processing.
39041 tree new_parm
39043 input_location,
39044 node,
39048 // Chain the new parameter to the list of implicit parameters.
39050 parser->implicit_template_parms
39052 else
39057 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39060 /* If creating a fully implicit function template, start the new implicit
39061 template parameter list with this synthesized type, otherwise grow the
39062 current template parameter list. */
39065 {
39072 }
39073 else
39074 {
39079 }
39081 // If the new parameter was constrained, we need to add that to the
39082 // constraints in the template parameter list.
39084 {
39088 }
39093 }
39095 /* Finish the declaration of a fully implicit function template. Such a
39096 template has no explicit template parameter list so has not been through the
39097 normal template head and tail processing. synthesize_implicit_template_parm
39098 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39099 provided if the declaration is a class member such that its template
39100 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39101 form is returned. Otherwise NULL_TREE is returned. */
39103 static tree
39105 {
39110 {
39114 }
39124 }
39126 /* Helper function for diagnostics that have complained about things
39127 being used with 'extern "C"' linkage.
39129 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39131 void
39133 {
39137 }