| blob | 891f742eb2159c642abde71faf6f92f58cb1c94e |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2051 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2053 static void cp_parser_pseudo_destructor_name
2055 static cp_expr cp_parser_unary_expression
2057 static enum tree_code cp_parser_unary_operator
2059 static tree cp_parser_new_expression
2063 static tree cp_parser_new_type_id
2071 static tree cp_parser_delete_expression
2073 static cp_expr cp_parser_cast_expression
2075 static cp_expr cp_parser_binary_expression
2077 static tree cp_parser_question_colon_clause
2079 static cp_expr cp_parser_assignment_expression
2081 static enum tree_code cp_parser_assignment_operator_opt
2083 static cp_expr cp_parser_expression
2085 static cp_expr cp_parser_constant_expression
2087 static cp_expr cp_parser_builtin_offsetof
2089 static cp_expr cp_parser_lambda_expression
2091 static void cp_parser_lambda_introducer
2093 static bool cp_parser_lambda_declarator_opt
2095 static void cp_parser_lambda_body
2098 /* Statements [gram.stmt.stmt] */
2100 static void cp_parser_statement
2102 static void cp_parser_label_for_labeled_statement
2104 static tree cp_parser_expression_statement
2106 static tree cp_parser_compound_statement
2108 static void cp_parser_statement_seq_opt
2110 static tree cp_parser_selection_statement
2112 static tree cp_parser_condition
2114 static tree cp_parser_iteration_statement
2116 static bool cp_parser_init_statement
2118 static tree cp_parser_for
2120 static tree cp_parser_c_for
2122 static tree cp_parser_range_for
2124 static void do_range_for_auto_deduction
2126 static tree cp_parser_perform_range_for_lookup
2128 static tree cp_parser_range_for_member_function
2130 static tree cp_parser_jump_statement
2132 static void cp_parser_declaration_statement
2135 static tree cp_parser_implicitly_scoped_statement
2137 static void cp_parser_already_scoped_statement
2140 /* Declarations [gram.dcl.dcl] */
2142 static void cp_parser_declaration_seq_opt
2144 static void cp_parser_declaration
2146 static void cp_parser_block_declaration
2148 static void cp_parser_simple_declaration
2150 static void cp_parser_decl_specifier_seq
2152 static tree cp_parser_storage_class_specifier_opt
2154 static tree cp_parser_function_specifier_opt
2156 static tree cp_parser_type_specifier
2159 static tree cp_parser_simple_type_specifier
2161 static tree cp_parser_type_name
2163 static tree cp_parser_type_name
2165 static tree cp_parser_nonclass_name
2167 static tree cp_parser_elaborated_type_specifier
2169 static tree cp_parser_enum_specifier
2171 static void cp_parser_enumerator_list
2173 static void cp_parser_enumerator_definition
2175 static tree cp_parser_namespace_name
2177 static void cp_parser_namespace_definition
2179 static void cp_parser_namespace_body
2181 static tree cp_parser_qualified_namespace_specifier
2183 static void cp_parser_namespace_alias_definition
2185 static bool cp_parser_using_declaration
2187 static void cp_parser_using_directive
2189 static tree cp_parser_alias_declaration
2191 static void cp_parser_asm_definition
2193 static void cp_parser_linkage_specification
2195 static void cp_parser_static_assert
2197 static tree cp_parser_decltype
2199 static tree cp_parser_decomposition_declaration
2202 /* Declarators [gram.dcl.decl] */
2204 static tree cp_parser_init_declarator
2211 static enum tree_code cp_parser_ptr_operator
2213 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2215 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2217 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2219 static tree cp_parser_tx_qualifier_opt
2221 static tree cp_parser_late_return_type_opt
2223 static tree cp_parser_declarator_id
2225 static tree cp_parser_type_id
2227 static tree cp_parser_template_type_arg
2230 static tree cp_parser_type_id_1
2232 static void cp_parser_type_specifier_seq
2234 static tree cp_parser_parameter_declaration_clause
2236 static tree cp_parser_parameter_declaration_list
2240 static tree cp_parser_default_argument
2242 static void cp_parser_function_body
2244 static tree cp_parser_initializer
2246 static cp_expr cp_parser_initializer_clause
2248 static cp_expr cp_parser_braced_list
2253 static void cp_parser_ctor_initializer_opt_and_function_body
2256 static tree cp_parser_late_parsing_omp_declare_simd
2259 static tree cp_parser_late_parsing_oacc_routine
2262 static tree synthesize_implicit_template_parm
2264 static tree finish_fully_implicit_template
2267 /* Classes [gram.class] */
2269 static tree cp_parser_class_name
2271 static tree cp_parser_class_specifier
2273 static tree cp_parser_class_head
2275 static enum tag_types cp_parser_class_key
2277 static void cp_parser_type_parameter_key
2279 static void cp_parser_member_specification_opt
2281 static void cp_parser_member_declaration
2283 static tree cp_parser_pure_specifier
2285 static tree cp_parser_constant_initializer
2288 /* Derived classes [gram.class.derived] */
2290 static tree cp_parser_base_clause
2292 static tree cp_parser_base_specifier
2295 /* Special member functions [gram.special] */
2297 static tree cp_parser_conversion_function_id
2299 static tree cp_parser_conversion_type_id
2303 static void cp_parser_ctor_initializer_opt
2305 static void cp_parser_mem_initializer_list
2307 static tree cp_parser_mem_initializer
2309 static tree cp_parser_mem_initializer_id
2312 /* Overloading [gram.over] */
2314 static cp_expr cp_parser_operator_function_id
2316 static cp_expr cp_parser_operator
2319 /* Templates [gram.temp] */
2321 static void cp_parser_template_declaration
2323 static tree cp_parser_template_parameter_list
2325 static tree cp_parser_template_parameter
2327 static tree cp_parser_type_parameter
2329 static tree cp_parser_template_id
2331 static tree cp_parser_template_name
2333 static tree cp_parser_template_argument_list
2335 static tree cp_parser_template_argument
2337 static void cp_parser_explicit_instantiation
2339 static void cp_parser_explicit_specialization
2342 /* Exception handling [gram.exception] */
2344 static tree cp_parser_try_block
2346 static void cp_parser_function_try_block
2348 static void cp_parser_handler_seq
2350 static void cp_parser_handler
2352 static tree cp_parser_exception_declaration
2354 static tree cp_parser_throw_expression
2356 static tree cp_parser_exception_specification_opt
2358 static tree cp_parser_type_id_list
2361 /* GNU Extensions */
2363 static tree cp_parser_asm_specification_opt
2365 static tree cp_parser_asm_operand_list
2367 static tree cp_parser_asm_clobber_list
2369 static tree cp_parser_asm_label_list
2371 static bool cp_next_tokens_can_be_attribute_p
2373 static bool cp_next_tokens_can_be_gnu_attribute_p
2375 static bool cp_next_tokens_can_be_std_attribute_p
2377 static bool cp_nth_tokens_can_be_std_attribute_p
2379 static bool cp_nth_tokens_can_be_gnu_attribute_p
2381 static bool cp_nth_tokens_can_be_attribute_p
2383 static tree cp_parser_attributes_opt
2385 static tree cp_parser_gnu_attributes_opt
2387 static tree cp_parser_gnu_attribute_list
2389 static tree cp_parser_std_attribute
2391 static tree cp_parser_std_attribute_spec
2393 static tree cp_parser_std_attribute_spec_seq
2395 static bool cp_parser_extension_opt
2397 static void cp_parser_label_declaration
2400 /* Concept Extensions */
2402 static tree cp_parser_requires_clause
2404 static tree cp_parser_requires_clause_opt
2406 static tree cp_parser_requires_expression
2408 static tree cp_parser_requirement_parameter_list
2410 static tree cp_parser_requirement_body
2412 static tree cp_parser_requirement_list
2414 static tree cp_parser_requirement
2416 static tree cp_parser_simple_requirement
2418 static tree cp_parser_compound_requirement
2420 static tree cp_parser_type_requirement
2422 static tree cp_parser_nested_requirement
2425 /* Transactional Memory Extensions */
2427 static tree cp_parser_transaction
2429 static tree cp_parser_transaction_expression
2431 static void cp_parser_function_transaction
2433 static tree cp_parser_transaction_cancel
2437 pragma_external,
2438 pragma_member,
2439 pragma_objc_icode,
2440 pragma_stmt,
2441 pragma_compound
2442 };
2443 static bool cp_parser_pragma
2446 /* Objective-C++ Productions */
2448 static tree cp_parser_objc_message_receiver
2450 static tree cp_parser_objc_message_args
2452 static tree cp_parser_objc_message_expression
2454 static cp_expr cp_parser_objc_encode_expression
2456 static tree cp_parser_objc_defs_expression
2458 static tree cp_parser_objc_protocol_expression
2460 static tree cp_parser_objc_selector_expression
2462 static cp_expr cp_parser_objc_expression
2464 static bool cp_parser_objc_selector_p
2466 static tree cp_parser_objc_selector
2468 static tree cp_parser_objc_protocol_refs_opt
2470 static void cp_parser_objc_declaration
2472 static tree cp_parser_objc_statement
2474 static bool cp_parser_objc_valid_prefix_attributes
2476 static void cp_parser_objc_at_property_declaration
2478 static void cp_parser_objc_at_synthesize_declaration
2480 static void cp_parser_objc_at_dynamic_declaration
2482 static tree cp_parser_objc_struct_declaration
2485 /* Utility Routines */
2487 static cp_expr cp_parser_lookup_name
2489 static tree cp_parser_lookup_name_simple
2491 static tree cp_parser_maybe_treat_template_as_class
2493 static bool cp_parser_check_declarator_template_parameters
2495 static bool cp_parser_check_template_parameters
2497 static cp_expr cp_parser_simple_cast_expression
2499 static tree cp_parser_global_scope_opt
2501 static bool cp_parser_constructor_declarator_p
2503 static tree cp_parser_function_definition_from_specifiers_and_declarator
2505 static tree cp_parser_function_definition_after_declarator
2507 static bool cp_parser_template_declaration_after_export
2509 static void cp_parser_perform_template_parameter_access_checks
2511 static tree cp_parser_single_declaration
2513 static cp_expr cp_parser_functional_cast
2515 static tree cp_parser_save_member_function_body
2517 static tree cp_parser_save_nsdmi
2519 static tree cp_parser_enclosed_template_argument_list
2521 static void cp_parser_save_default_args
2523 static void cp_parser_late_parsing_for_member
2525 static tree cp_parser_late_parse_one_default_arg
2527 static void cp_parser_late_parsing_nsdmi
2529 static void cp_parser_late_parsing_default_args
2531 static tree cp_parser_sizeof_operand
2533 static cp_expr cp_parser_trait_expr
2535 static bool cp_parser_declares_only_class_p
2537 static void cp_parser_set_storage_class
2539 static void cp_parser_set_decl_spec_type
2541 static void set_and_check_decl_spec_loc
2544 static bool cp_parser_friend_p
2546 static void cp_parser_required_error
2552 static bool cp_parser_token_starts_function_definition_p
2554 static bool cp_parser_next_token_starts_class_definition_p
2556 static bool cp_parser_next_token_ends_template_argument_p
2558 static bool cp_parser_nth_token_starts_template_argument_list_p
2560 static enum tag_types cp_parser_token_is_class_key
2562 static enum tag_types cp_parser_token_is_type_parameter_key
2564 static void cp_parser_check_class_key
2566 static void cp_parser_check_access_in_redeclaration
2568 static bool cp_parser_optional_template_keyword
2570 static void cp_parser_pre_parsed_nested_name_specifier
2572 static bool cp_parser_cache_group
2574 static tree cp_parser_cache_defarg
2576 static void cp_parser_parse_tentatively
2578 static void cp_parser_commit_to_tentative_parse
2580 static void cp_parser_commit_to_topmost_tentative_parse
2582 static void cp_parser_abort_tentative_parse
2584 static bool cp_parser_parse_definitely
2588 static bool cp_parser_uncommitted_to_tentative_parse_p
2590 static void cp_parser_error
2592 static void cp_parser_name_lookup_error
2594 static bool cp_parser_simulate_error
2596 static bool cp_parser_check_type_definition
2598 static void cp_parser_check_for_definition_in_return_type
2600 static void cp_parser_check_for_invalid_template_id
2602 static bool cp_parser_non_integral_constant_expression
2604 static void cp_parser_diagnose_invalid_type_name
2606 static bool cp_parser_parse_and_diagnose_invalid_type_name
2608 static int cp_parser_skip_to_closing_parenthesis
2610 static void cp_parser_skip_to_end_of_statement
2612 static void cp_parser_consume_semicolon_at_end_of_statement
2614 static void cp_parser_skip_to_end_of_block_or_statement
2616 static bool cp_parser_skip_to_closing_brace
2618 static void cp_parser_skip_to_end_of_template_parameter_list
2620 static void cp_parser_skip_to_pragma_eol
2622 static bool cp_parser_error_occurred
2624 static bool cp_parser_allow_gnu_extensions_p
2626 static bool cp_parser_is_pure_string_literal
2628 static bool cp_parser_is_string_literal
2630 static bool cp_parser_is_keyword
2632 static tree cp_parser_make_typename_type
2636 static bool cp_parser_compound_literal_p
2638 static bool cp_parser_array_designator_p
2640 static bool cp_parser_init_statement_p
2642 static bool cp_parser_skip_to_closing_square_bracket
2645 /* Concept-related syntactic transformations */
2650 // -------------------------------------------------------------------------- //
2651 // Unevaluated Operand Guard
2652 //
2653 // Implementation of an RAII helper for unevaluated operand parsing.
2655 {
2658 }
2661 {
2664 }
2666 // -------------------------------------------------------------------------- //
2667 // Tentative Parsing
2669 /* Returns nonzero if we are parsing tentatively. */
2673 {
2675 }
2677 /* Returns nonzero if TOKEN is a string literal. */
2679 static bool
2681 {
2687 }
2689 /* Returns nonzero if TOKEN is a string literal
2690 of a user-defined string literal. */
2692 static bool
2694 {
2701 }
2703 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2705 static bool
2707 {
2709 }
2711 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2712 PRAGMA_NONE. */
2714 static enum pragma_kind
2716 {
2719 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2721 }
2723 /* Helper function for cp_parser_error.
2724 Having peeked a token of kind TOK1_KIND that might signify
2725 a conflict marker, peek successor tokens to determine
2726 if we actually do have a conflict marker.
2727 Specifically, we consider a run of 7 '<', '=' or '>' characters
2728 at the start of a line as a conflict marker.
2729 These come through the lexer as three pairs and a single,
2730 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2731 If it returns true, *OUT_LOC is written to with the location/range
2732 of the marker. */
2734 static bool
2737 {
2748 /* It must be at the start of the line. */
2753 /* We have a conflict marker. Construct a location of the form:
2754 <<<<<<<
2755 ^~~~~~~
2756 with start == caret, finishing at the end of the marker. */
2761 }
2763 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2764 RT_CLOSE_PAREN. */
2768 {
2770 {
2778 }
2779 }
2781 /* Attempt to convert TOKEN_DESC from a required_token to an
2782 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2784 static enum cpp_ttype
2786 {
2788 {
2809 /* Use CPP_EOF as a "no completions possible" code. */
2811 }
2812 }
2815 /* Subroutine of cp_parser_error and cp_parser_required_error.
2817 Issue a diagnostic of the form
2818 FILE:LINE: MESSAGE before TOKEN
2819 where TOKEN is the next token in the input stream. MESSAGE
2820 (specified by the caller) is usually of the form "expected
2821 OTHER-TOKEN".
2823 This bypasses the check for tentative passing, and potentially
2824 adds material needed by cp_parser_required_error.
2826 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2827 suggesting insertion of the missing token.
2829 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2830 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2831 location. */
2833 static void
2835 required_token missing_token_desc,
2836 location_t matching_location)
2837 {
2839 /* This diagnostic makes more sense if it is tagged to the line
2840 of the token we just peeked at. */
2844 {
2849 }
2851 /* If this is actually a conflict marker, report it as such. */
2855 {
2856 location_t loc;
2858 {
2861 }
2862 }
2869 {
2870 /* Potentially supply a fix-it hint, suggesting to add the
2871 missing token immediately after the *previous* token.
2872 This may move the primary location within richloc. */
2874 location_t prev_token_loc
2878 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2879 Attempt to consolidate diagnostics by printing it as a
2880 secondary range within the main diagnostic. */
2882 added_matching_location
2884 }
2886 /* Actually emit the error. */
2888 /* Because c_parser_error does not understand
2889 CPP_KEYWORD, keywords are treated like
2890 identifiers. */
2895 {
2896 /* If we weren't able to consolidate matching_location, then
2897 print it as a secondary diagnostic. */
2902 }
2903 }
2905 /* If not parsing tentatively, issue a diagnostic of the form
2906 FILE:LINE: MESSAGE before TOKEN
2907 where TOKEN is the next token in the input stream. MESSAGE
2908 (specified by the caller) is usually of the form "expected
2909 OTHER-TOKEN". */
2911 static void
2913 {
2916 }
2918 /* Issue an error about name-lookup failing. NAME is the
2919 IDENTIFIER_NODE DECL is the result of
2920 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2921 the thing that we hoped to find. */
2923 static void
2925 tree name,
2926 tree decl,
2927 name_lookup_error desired,
2928 location_t location)
2929 {
2930 /* If name lookup completely failed, tell the user that NAME was not
2931 declared. */
2933 {
2946 else
2948 }
2950 {
2952 {
2969 }
2970 }
2972 {
2974 {
2984 name);
2988 }
2989 }
2990 else
2991 {
2993 {
3006 }
3007 }
3008 }
3010 /* If we are parsing tentatively, remember that an error has occurred
3011 during this tentative parse. Returns true if the error was
3012 simulated; false if a message should be issued by the caller. */
3014 static bool
3016 {
3018 {
3021 }
3023 }
3025 /* This function is called when a type is defined. If type
3026 definitions are forbidden at this point, an error message is
3027 issued. */
3029 static bool
3031 {
3032 /* If types are forbidden here, issue a message. */
3034 {
3035 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3036 in the message need to be interpreted. */
3039 }
3041 }
3043 /* This function is called when the DECLARATOR is processed. The TYPE
3044 was a type defined in the decl-specifiers. If it is invalid to
3045 define a type in the decl-specifiers for DECLARATOR, an error is
3046 issued. TYPE_LOCATION is the location of TYPE and is used
3047 for error reporting. */
3049 static void
3052 {
3053 /* [dcl.fct] forbids type definitions in return types.
3054 Unfortunately, it's not easy to know whether or not we are
3055 processing a return type until after the fact. */
3063 {
3068 type);
3069 }
3070 }
3072 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3073 "<" in any valid C++ program. If the next token is indeed "<",
3074 issue a message warning the user about what appears to be an
3075 invalid attempt to form a template-id. LOCATION is the location
3076 of the type-specifier (TYPE) */
3078 static void
3080 tree type,
3082 location_t location)
3083 {
3087 {
3093 {
3096 else
3098 }
3099 else
3101 /* Remember the location of the invalid "<". */
3104 /* Consume the "<". */
3106 /* Parse the template arguments. */
3108 /* Permanently remove the invalid template arguments so that
3109 this error message is not issued again. */
3112 }
3113 }
3115 /* If parsing an integral constant-expression, issue an error message
3116 about the fact that THING appeared and return true. Otherwise,
3117 return false. In either case, set
3118 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3120 static bool
3122 non_integral_constant thing)
3123 {
3126 {
3128 {
3131 {
3134 "ISO C++ forbids using a floating-point literal "
3139 "enumeration type cannot appear in a "
3230 }
3234 }
3235 }
3237 }
3239 /* Emit a diagnostic for an invalid type name. This function commits
3240 to the current active tentative parse, if any. (Otherwise, the
3241 problematic construct might be encountered again later, resulting
3242 in duplicate error messages.) LOCATION is the location of ID. */
3244 static void
3246 location_t location)
3247 {
3250 /* Try to lookup the identifier. */
3257 /* If the lookup was ambiguous, an error will already have
3258 been issued. */
3260 /* If the lookup found a template-name, it means that the user forgot
3261 to specify an argument list. Emit a useful error message. */
3263 {
3266 decl);
3271 }
3275 /* Something like 'unsigned A a;' */
3278 {
3279 /* Issue an error message. */
3280 name_hint hint;
3284 {
3290 }
3291 else
3293 /* If we're in a template class, it's possible that the user was
3294 referring to a type from a base class. For example:
3296 template <typename T> struct A { typedef T X; };
3297 template <typename T> struct B : public A<T> { X x; };
3299 The user should have said "typename A<T>::X". */
3315 {
3316 tree b;
3319 b;
3321 {
3325 {
3326 tree field;
3327 /* Go from a particular instantiation of the
3328 template (which will have an empty TYPE_FIELDs),
3329 to the main version. */
3332 field;
3336 {
3341 }
3344 }
3345 }
3346 }
3347 }
3348 /* Here we diagnose qualified-ids where the scope is actually correct,
3349 but the identifier does not resolve to a valid type name. */
3351 {
3353 {
3362 else
3371 }
3374 {
3375 /* A<T>::A<T>() */
3381 }
3384 {
3387 "need %<typename%> before %<%T::%D::%E%> because "
3391 id,
3394 else
3398 }
3400 {
3412 else
3418 }
3419 else
3421 }
3422 }
3424 /* Check for a common situation where a type-name should be present,
3425 but is not, and issue a sensible error message. Returns true if an
3426 invalid type-name was detected.
3428 The situation handled by this function are variable declarations of the
3429 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3430 Usually, `ID' should name a type, but if we got here it means that it
3431 does not. We try to emit the best possible error message depending on
3432 how exactly the id-expression looks like. */
3434 static bool
3436 {
3437 tree id;
3440 /* Avoid duplicate error about ambiguous lookup. */
3442 {
3446 }
3455 /* If the next token is a (, this is a function with no explicit return
3456 type, i.e. constructor, destructor or conversion op. */
3459 {
3462 }
3466 /* Emit a diagnostic for the invalid type. */
3468 out:
3469 /* If we aren't in the middle of a declarator (i.e. in a
3470 parameter-declaration-clause), skip to the end of the declaration;
3471 there's no point in trying to process it. */
3475 }
3477 /* Consume tokens up to, and including, the next non-nested closing `)'.
3478 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3479 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3480 found an unnested token of that type. */
3482 static int
3485 cpp_ttype or_ttype,
3487 {
3497 {
3500 /* Have we found what we're looking for before the closing paren? */
3506 {
3509 /* If we've run out of tokens, then there is no closing `)'. */
3512 /* This is good for lambda expression capture-lists. */
3522 /* This matches the processing in skip_to_end_of_statement. */
3542 {
3546 }
3551 }
3553 /* Consume the token. */
3555 }
3556 }
3558 /* Consume tokens up to, and including, the next non-nested closing `)'.
3559 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3560 are doing error recovery. Returns -1 if OR_COMMA is true and we
3561 found an unnested token of that type. */
3563 static int
3568 {
3572 }
3574 /* Consume tokens until we reach the end of the current statement.
3575 Normally, that will be just before consuming a `;'. However, if a
3576 non-nested `}' comes first, then we stop before consuming that. */
3578 static void
3580 {
3583 /* Unwind generic function template scope if necessary. */
3588 {
3592 {
3595 /* If we've run out of tokens, stop. */
3599 /* If the next token is a `;', we have reached the end of the
3600 statement. */
3606 /* If this is a non-nested '}', stop before consuming it.
3607 That way, when confronted with something like:
3609 { 3 + }
3611 we stop before consuming the closing '}', even though we
3612 have not yet reached a `;'. */
3616 /* If it is the closing '}' for a block that we have
3617 scanned, stop -- but only after consuming the token.
3618 That way given:
3620 void f g () { ... }
3621 typedef int I;
3623 we will stop after the body of the erroneously declared
3624 function, but before consuming the following `typedef'
3625 declaration. */
3627 {
3630 }
3639 }
3641 /* Consume the token. */
3643 }
3644 }
3646 /* This function is called at the end of a statement or declaration.
3647 If the next token is a semicolon, it is consumed; otherwise, error
3648 recovery is attempted. */
3650 static void
3652 {
3653 /* Look for the trailing `;'. */
3655 {
3656 /* If there is additional (erroneous) input, skip to the end of
3657 the statement. */
3659 /* If the next token is now a `;', consume it. */
3662 }
3663 }
3665 /* Skip tokens until we have consumed an entire block, or until we
3666 have consumed a non-nested `;'. */
3668 static void
3670 {
3673 /* Unwind generic function template scope if necessary. */
3678 {
3682 {
3685 /* If we've run out of tokens, stop. */
3689 /* Stop if this is an unnested ';'. */
3695 /* Stop if this is an unnested '}', or closes the outermost
3696 nesting level. */
3697 nesting_depth--;
3705 /* Nest. */
3706 nesting_depth++;
3711 }
3713 /* Consume the token. */
3715 }
3716 }
3718 /* Skip tokens until a non-nested closing curly brace is the next
3719 token, or there are no more tokens. Return true in the first case,
3720 false otherwise. */
3722 static bool
3724 {
3728 {
3732 {
3735 /* If we've run out of tokens, stop. */
3739 /* If the next token is a non-nested `}', then we have reached
3740 the end of the current block. */
3746 /* If it the next token is a `{', then we are entering a new
3747 block. Consume the entire block. */
3753 }
3755 /* Consume the token. */
3757 }
3758 }
3760 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3761 parameter is the PRAGMA token, allowing us to purge the entire pragma
3762 sequence. */
3764 static void
3766 {
3771 do
3775 /* Ensure that the pragma is not parsed again. */
3777 }
3779 /* Require pragma end of line, resyncing with it as necessary. The
3780 arguments are as for cp_parser_skip_to_pragma_eol. */
3782 static void
3784 {
3788 }
3790 /* This is a simple wrapper around make_typename_type. When the id is
3791 an unresolved identifier node, we can provide a superior diagnostic
3792 using cp_parser_diagnose_invalid_type_name. */
3794 static tree
3796 location_t id_location)
3797 {
3798 tree result;
3800 {
3806 }
3808 }
3810 /* This is a wrapper around the
3811 make_{pointer,ptrmem,reference}_declarator functions that decides
3812 which one to call based on the CODE and CLASS_TYPE arguments. The
3813 CODE argument should be one of the values returned by
3814 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3815 appertain to the pointer or reference. */
3819 cp_cv_quals cv_qualifiers,
3821 tree attributes)
3822 {
3829 else
3839 }
3841 /* Create a new C++ parser. */
3845 {
3850 /* cp_lexer_new_main is called before doing GC allocation because
3851 cp_lexer_new_main might load a PCH file. */
3854 /* Initialize the binops_by_token so that we can get the tree
3855 directly from the token. */
3863 /* For now, we always accept GNU extensions. */
3866 /* The `>' token is a greater-than operator, not the end of a
3867 template-id. */
3872 /* We are not parsing a constant-expression. */
3877 /* Local variable names are not forbidden. */
3880 /* We are not processing an `extern "C"' declaration. */
3883 /* We are not processing a declarator. */
3886 /* We are not processing a template-argument-list. */
3889 /* We are not in an iteration statement. */
3892 /* We are not in a switch statement. */
3895 /* We are not parsing a type-id inside an expression. */
3898 /* Declarations aren't implicitly extern "C". */
3901 /* String literals should be translated to the execution character set. */
3904 /* We are not parsing a function body. */
3907 /* We can correct until told otherwise. */
3910 /* The unparsed function queue is empty. */
3913 /* There are no classes being defined. */
3916 /* No template parameters apply. */
3919 /* Special parsing data structures. */
3923 /* Not declaring an implicit function template. */
3929 /* Allow constrained-type-specifiers. */
3932 /* We haven't yet seen an 'extern "C"'. */
3936 }
3938 /* Create a cp_lexer structure which will emit the tokens in CACHE
3939 and push it onto the parser's lexer stack. This is used for delayed
3940 parsing of in-class method bodies and default arguments, and should
3941 not be confused with tentative parsing. */
3942 static void
3944 {
3949 /* Move the current source position to that of the first token in the
3950 new lexer. */
3952 }
3954 /* Pop the top lexer off the parser stack. This is never used for the
3955 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3956 static void
3958 {
3963 /* Put the current source position back where it was before this
3964 lexer was pushed. */
3966 }
3968 /* Lexical conventions [gram.lex] */
3970 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3971 identifier. */
3973 static cp_expr
3975 {
3978 /* Look for the identifier. */
3980 /* Return the value. */
3983 else
3985 }
3987 /* Parse a sequence of adjacent string constants. Returns a
3988 TREE_STRING representing the combined, nul-terminated string
3989 constant. If TRANSLATE is true, translate the string to the
3990 execution character set. If WIDE_OK is true, a wide string is
3991 invalid here.
3993 C++98 [lex.string] says that if a narrow string literal token is
3994 adjacent to a wide string literal token, the behavior is undefined.
3995 However, C99 6.4.5p4 says that this results in a wide string literal.
3996 We follow C99 here, for consistency with the C front end.
3998 This code is largely lifted from lex_string() in c-lex.c.
4000 FUTURE: ObjC++ will need to handle @-strings here. */
4001 static cp_expr
4004 {
4005 tree value;
4012 tree string_tree;
4018 {
4021 }
4026 {
4030 }
4031 else
4032 {
4035 }
4038 /* Try to avoid the overhead of creating and destroying an obstack
4039 for the common case of just one string. */
4042 {
4050 {
4054 }
4055 else
4059 }
4060 else
4061 {
4066 do
4067 {
4069 count++;
4074 {
4077 {
4080 }
4083 {
4088 }
4090 }
4091 else
4095 {
4099 {
4103 "unsupported non-standard concatenation "
4105 }
4106 }
4114 {
4118 }
4119 else
4120 {
4124 }
4125 }
4128 /* A string literal built by concatenation has its caret=start at
4129 the start of the initial string, and its finish at the finish of
4130 the final string literal. */
4134 }
4137 {
4140 }
4144 {
4149 {
4164 }
4169 {
4174 else
4176 }
4177 }
4178 else
4179 /* cpp_interpret_string has issued an error. */
4186 }
4188 /* Look up a literal operator with the name and the exact arguments. */
4190 static tree
4192 {
4193 tree decl;
4199 {
4205 {
4208 {
4218 }
4221 /* May be this should be sufficient_parms_p instead,
4222 depending on how exactly should user-defined literals
4223 work in presence of default arguments on the literal
4224 operator parameters. */
4227 }
4228 }
4231 }
4233 /* Parse a user-defined char constant. Returns a call to a user-defined
4234 literal operator taking the character as an argument. */
4236 static cp_expr
4238 {
4246 /* Build up a call to the user-defined operator */
4247 /* Lookup the name we got back from the id-expression. */
4252 {
4257 }
4261 }
4263 /* A subroutine of cp_parser_userdef_numeric_literal to
4264 create a char... template parameter pack from a string node. */
4266 static tree
4268 {
4269 tree charvec;
4275 /* Fill in CHARVEC with all of the parameters. */
4280 /* Build the argument packs. */
4286 }
4288 /* A subroutine of cp_parser_userdef_numeric_literal to
4289 create a char... template parameter pack from a string node. */
4291 static tree
4293 {
4294 tree charvec;
4305 /* First template parm is character type. */
4308 /* Fill in CHARVEC with all of the parameters. */
4315 /* Build the argument packs. */
4321 }
4323 /* Parse a user-defined numeric constant. returns a call to a user-defined
4324 literal operator. */
4326 static cp_expr
4328 {
4339 /* Look for a literal operator taking the exact type of numeric argument
4340 as the literal value. */
4345 {
4347 tf_warning_or_error);
4350 {
4353 long_long_unsigned_type_node);
4354 }
4355 else
4356 {
4360 long_double_type_node);
4364 }
4368 }
4371 /* If the numeric argument didn't work, look for a raw literal
4372 operator taking a const char* argument consisting of the number
4373 in string format. */
4378 {
4380 tf_warning_or_error);
4383 }
4386 /* If the raw literal didn't work, look for a non-type template
4387 function with parameter pack char.... Call the function with
4388 template parameter characters representing the number. */
4392 {
4396 tf_warning_or_error);
4399 }
4403 /* In C++14 the standard library defines complex number suffixes that
4404 conflict with GNU extensions. Prefer them if <complex> is #included. */
4414 {
4419 {
4420 /* No <complex>, so pedwarn and use GNU semantics. */
4423 }
4424 }
4426 bool complained
4433 {
4435 "(from <complex>) to enable the C++14 user-defined literal "
4440 }
4447 else
4448 {
4449 /* Use the built-in semantics. */
4450 tree type;
4452 {
4455 else
4457 }
4466 }
4469 /* Avoid repeated diagnostics. */
4472 }
4474 /* Parse a user-defined string constant. Returns a call to a user-defined
4475 literal operator taking a character pointer and the length of the string
4476 as arguments. */
4478 static tree
4480 {
4489 /* Build up a call to the user-defined operator. */
4490 /* Lookup the name we got back from the id-expression. */
4497 {
4499 tf_warning_or_error);
4502 }
4505 /* Look for a template function with typename parameter CharT
4506 and parameter pack CharT... Call the function with
4507 template parameter characters representing the string. */
4511 {
4515 tf_warning_or_error);
4518 }
4524 }
4527 /* Basic concepts [gram.basic] */
4529 /* Parse a translation-unit.
4531 translation-unit:
4532 declaration-seq [opt]
4534 Returns TRUE if all went well. */
4536 static bool
4538 {
4539 /* The address of the first non-permanent object on the declarator
4540 obstack. */
4545 /* Create the declarator obstack, if necessary. */
4547 {
4549 /* Create the error declarator. */
4551 /* Create the empty parameter list. */
4553 UNKNOWN_LOCATION);
4554 /* Remember where the base of the declarator obstack lies. */
4556 }
4560 /* If there are no tokens left then all went well. */
4562 {
4563 /* Get rid of the token array; we don't need it any more. */
4567 /* This file might have been a context that's implicitly extern
4568 "C". If so, pop the lang context. (Only relevant for PCH.) */
4570 {
4573 }
4575 /* Finish up. */
4579 }
4580 else
4581 {
4584 }
4586 /* Make sure the declarator obstack was fully cleaned up. */
4590 /* All went well. */
4592 }
4594 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4595 decltype context. */
4599 {
4604 }
4606 /* We're about to parse a collection of statements. If we're currently
4607 parsing tentatively, set up a firewall so that any nested
4608 cp_parser_commit_to_tentative_parse won't affect the current context. */
4610 static cp_token_position
4612 {
4619 }
4621 /* We've finished parsing the collection of statements. Wrap up the
4622 firewall and replace the relevant tokens with the parsed form. */
4624 static void
4626 tree expr)
4627 {
4631 /* Finish the firewall level. */
4633 /* And remember the result of the parse for when we try again. */
4639 }
4641 /* Like the above functions, but let the user modify the tokens. Used by
4642 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4643 later parses, so it makes sense to localize the effects of
4644 cp_parser_commit_to_tentative_parse. */
4646 struct tentative_firewall
4647 {
4652 {
4653 /* If we're currently parsing tentatively, start a committed level as a
4654 firewall and then an inner tentative parse. */
4656 {
4660 }
4661 }
4664 {
4666 {
4667 /* Finish the inner tentative parse and the firewall, propagating any
4668 uncommitted error state to the outer tentative parse. */
4674 }
4675 }
4676 };
4678 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4679 This class is for tracking such a matching pair of symbols.
4680 In particular, it tracks the location of the first token,
4681 so that if the second token is missing, we can highlight the
4682 location of the first token when notifying the user about the
4683 problem. */
4686 class token_pair
4687 {
4689 /* token_pair's ctor. */
4692 /* If the next token is the opening symbol for this pair, consume it and
4693 return true.
4694 Otherwise, issue an error and return false.
4695 In either case, record the location of the opening token. */
4698 {
4702 }
4704 /* Consume the next token from PARSER, recording its location as
4705 that of the opening token within the pair. */
4708 {
4713 }
4715 /* If the next token is the closing symbol for this pair, consume it
4716 and return it.
4717 Otherwise, issue an error, highlighting the location of the
4718 corresponding opening token, and return NULL. */
4721 {
4724 m_open_loc);
4725 }
4728 location_t m_open_loc;
4729 };
4731 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4733 struct matching_paren_traits
4734 {
4739 };
4741 /* "matching_parens" is a token_pair<T> class for tracking matching
4742 pairs of parentheses. */
4746 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4748 struct matching_brace_traits
4749 {
4754 };
4756 /* "matching_braces" is a token_pair<T> class for tracking matching
4757 pairs of braces. */
4762 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4763 enclosing parentheses. */
4765 static cp_expr
4767 {
4770 /* Consume the '('. */
4772 matching_parens parens;
4774 /* Start the statement-expression. */
4776 /* Parse the compound-statement. */
4778 /* Finish up. */
4780 /* Consume the ')'. */
4788 }
4790 /* Expressions [gram.expr] */
4792 /* Parse a fold-operator.
4794 fold-operator:
4795 - * / % ^ & | = < > << >>
4796 = -= *= /= %= ^= &= |= <<= >>=
4797 == != <= >= && || , .* ->*
4799 This returns the tree code corresponding to the matched operator
4800 as an int. When the current token matches a compound assignment
4801 opertor, the resulting tree code is the negative value of the
4802 non-assignment operator. */
4804 static int
4806 {
4808 {
4848 }
4849 }
4851 /* Returns true if CODE indicates a binary expression, which is not allowed in
4852 the LHS of a fold-expression. More codes will need to be added to use this
4853 function in other contexts. */
4855 static bool
4857 {
4859 {
4892 }
4893 }
4895 /* If the next token is a suitable fold operator, consume it and return as
4896 the function above. */
4898 static int
4900 {
4906 }
4908 /* Parse a fold-expression.
4910 fold-expression:
4911 ( ... folding-operator cast-expression)
4912 ( cast-expression folding-operator ... )
4913 ( cast-expression folding operator ... folding-operator cast-expression)
4915 Note that the '(' and ')' are matched in primary expression. */
4917 static cp_expr
4919 {
4920 cp_id_kind pidk;
4922 // Left fold.
4924 {
4928 {
4931 }
4938 }
4943 {
4946 }
4949 {
4952 }
4955 /* The operands of a fold-expression are cast-expressions, so binary or
4956 conditional expressions are not allowed. We check this here to avoid
4957 tentative parsing. */
4967 // Right fold.
4972 {
4975 }
4978 // Binary left or right fold.
4983 }
4985 /* Parse a primary-expression.
4987 primary-expression:
4988 literal
4989 this
4990 ( expression )
4991 id-expression
4992 lambda-expression (C++11)
4994 GNU Extensions:
4996 primary-expression:
4997 ( compound-statement )
4998 __builtin_va_arg ( assignment-expression , type-id )
4999 __builtin_offsetof ( type-id , offsetof-expression )
5001 C++ Extensions:
5002 __has_nothrow_assign ( type-id )
5003 __has_nothrow_constructor ( type-id )
5004 __has_nothrow_copy ( type-id )
5005 __has_trivial_assign ( type-id )
5006 __has_trivial_constructor ( type-id )
5007 __has_trivial_copy ( type-id )
5008 __has_trivial_destructor ( type-id )
5009 __has_virtual_destructor ( type-id )
5010 __is_abstract ( type-id )
5011 __is_base_of ( type-id , type-id )
5012 __is_class ( type-id )
5013 __is_empty ( type-id )
5014 __is_enum ( type-id )
5015 __is_final ( type-id )
5016 __is_literal_type ( type-id )
5017 __is_pod ( type-id )
5018 __is_polymorphic ( type-id )
5019 __is_std_layout ( type-id )
5020 __is_trivial ( type-id )
5021 __is_union ( type-id )
5023 Objective-C++ Extension:
5025 primary-expression:
5026 objc-expression
5028 literal:
5029 __null
5031 ADDRESS_P is true iff this expression was immediately preceded by
5032 "&" and therefore might denote a pointer-to-member. CAST_P is true
5033 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5034 true iff this expression is a template argument.
5036 Returns a representation of the expression. Upon return, *IDK
5037 indicates what kind of id-expression (if any) was present. */
5039 static cp_expr
5046 {
5049 /* Assume the primary expression is not an id-expression. */
5052 /* Peek at the next token. */
5055 {
5056 /* literal:
5057 integer-literal
5058 character-literal
5059 floating-literal
5060 string-literal
5061 boolean-literal
5062 pointer-literal
5063 user-defined-literal */
5075 {
5079 }
5080 /* Floating-point literals are only allowed in an integral
5081 constant expression if they are cast to an integral or
5082 enumeration type. */
5086 {
5087 /* CAST_P will be set even in invalid code like "int(2.7 +
5088 ...)". Therefore, we have to check that the next token
5089 is sure to end the cast. */
5091 {
5096 enumerator-definition. */
5098 /* The curly brace at the end of an enum-specifier. */
5100 /* The end of a statement. */
5102 /* The end of the cast-expression. */
5104 /* The end of an array bound. */
5106 /* The closing ">" in a template-argument-list. */
5109 /* C++0x only: A ">>" treated like two ">" tokens,
5110 in a template-argument-list. */
5115 }
5117 /* If we are within a cast, then the constraint that the
5118 cast is to an integral or enumeration type will be
5119 checked at that point. If we are not within a cast, then
5120 this code is invalid. */
5123 }
5143 /* ??? Should wide strings be allowed when parser->translate_strings_p
5144 is false (i.e. in attributes)? If not, we can kill the third
5145 argument to cp_parser_string_literal. */
5151 /* If we see `( { ' then we are looking at the beginning of
5152 a GNU statement-expression. */
5155 {
5156 /* Statement-expressions are not allowed by the standard. */
5160 /* And they're not allowed outside of a function-body; you
5161 cannot, for example, write:
5163 int i = ({ int j = 3; j + 1; });
5165 at class or namespace scope. */
5168 {
5170 "statement-expressions are not allowed outside "
5176 }
5177 else
5179 }
5180 /* Otherwise it's a normal parenthesized expression. */
5181 {
5182 cp_expr expr;
5187 /* Consume the `('. */
5188 matching_parens parens;
5190 /* Within a parenthesized expression, a `>' token is always
5191 the greater-than operator. */
5192 saved_greater_than_is_operator_p
5197 /* Left fold expression. */
5199 else
5200 /* Parse the parenthesized expression. */
5205 {
5212 }
5213 else
5214 /* Let the front end know that this expression was
5215 enclosed in parentheses. This matters in case, for
5216 example, the expression is of the form `A::B', since
5217 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5218 not. */
5221 /* DR 705: Wrapping an unqualified name in parentheses
5222 suppresses arg-dependent lookup. We want to pass back
5223 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5224 (c++/37862), but none of the others. */
5228 /* The `>' token might be the end of a template-id or
5229 template-parameter-list now. */
5230 parser->greater_than_is_operator_p
5233 /* Consume the `)'. */
5242 }
5245 {
5247 {
5248 /* We might have an Objective-C++ message. */
5251 /* If that works out, we're done ... */
5254 /* ... else, fall though to see if it's a lambda. */
5255 }
5257 /* Don't warn about a failed tentative parse. */
5262 }
5266 /* We have an Objective-C++ string literal. */
5273 {
5274 /* These two are the boolean literals. */
5282 /* The `__null' literal. */
5287 /* The `nullptr' literal. */
5292 /* Recognize the `this' keyword. */
5296 {
5300 }
5301 /* Pointers cannot appear in constant-expressions. */
5306 /* The `operator' keyword can be the beginning of an
5307 id-expression. */
5314 {
5315 non_integral_constant name;
5317 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5318 __func__ are the names of variables -- but they are
5319 treated specially. Therefore, they are handled here,
5320 rather than relying on the generic id-expression logic
5321 below. Grammatically, these names are id-expressions.
5323 Consume the token. */
5327 {
5339 }
5344 /* Look up the name. */
5346 }
5349 {
5350 tree expression;
5351 tree type;
5352 source_location type_location;
5353 location_t start_loc
5355 /* The `__builtin_va_arg' construct is used to handle
5356 `va_arg'. Consume the `__builtin_va_arg' token. */
5358 /* Look for the opening `('. */
5359 matching_parens parens;
5361 /* Now, parse the assignment-expression. */
5363 /* Look for the `,'. */
5366 /* Parse the type-id. */
5367 {
5370 }
5371 /* Look for the closing `)'. */
5372 location_t finish_loc
5375 /* Using `va_arg' in a constant-expression is not
5376 allowed. */
5378 NIC_VA_ARG))
5380 /* Construct a location of the form:
5381 __builtin_va_arg (v, int)
5382 ~~~~~~~~~~~~~~~~~~~~~^~~~
5383 with the caret at the type, ranging from the start of the
5384 "__builtin_va_arg" token to the close paren. */
5385 location_t combined_loc
5388 }
5423 // C++ concepts
5427 /* Objective-C++ expressions. */
5437 {
5442 }
5443 /* FALLTHRU */
5447 }
5449 /* An id-expression can start with either an identifier, a
5450 `::' as the beginning of a qualified-id, or the "operator"
5451 keyword. */
5456 {
5457 id_expression:
5458 cp_expr id_expression;
5459 cp_expr decl;
5465 /* Parse the id-expression. */
5466 id_expression
5483 /* If we have a template-id, then no further lookup is
5484 required. If the template-id was for a template-class, we
5485 will sometimes have a TYPE_DECL at this point. */
5489 /* Look up the name. */
5490 else
5491 {
5492 tree ambiguous_decls;
5494 /* If we already know that this lookup is ambiguous, then
5495 we've already issued an error message; there's no reason
5496 to check again. */
5499 {
5502 }
5505 none_type,
5506 template_p,
5511 /* If the lookup was ambiguous, an error will already have
5512 been issued. */
5516 /* In Objective-C++, we may have an Objective-C 2.0
5517 dot-syntax for classes here. */
5522 {
5523 tree component;
5530 component);
5531 /* Build a location of the form:
5532 expr.component
5533 ~~~~~^~~~~~~~~
5534 with caret at the start of the component name (at
5535 input_location), ranging from the start of the id_expression
5536 to the end of the component name. */
5537 location_t combined_loc
5542 }
5544 /* In Objective-C++, an instance variable (ivar) may be preferred
5545 to whatever cp_parser_lookup_name() found.
5546 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5547 rest of c-family, we have to do a little extra work to preserve
5548 any location information in cp_expr "decl". Given that
5549 objc_lookup_ivar is implemented in "c-family" and "objc", we
5550 have a trip through the pure "tree" type, rather than cp_expr.
5551 Naively copying it back to "decl" would implicitly give the
5552 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5553 store an EXPR_LOCATION. Hence we only update "decl" (and
5554 hence its location_t) if we get back a different tree node. */
5556 id_expression);
5560 /* If name lookup gives us a SCOPE_REF, then the
5561 qualifying scope was dependent. */
5563 {
5564 /* At this point, we do not know if DECL is a valid
5565 integral constant expression. We assume that it is
5566 in fact such an expression, so that code like:
5568 template <int N> struct A {
5569 int a[B<N>::i];
5570 };
5572 is accepted. At template-instantiation time, we
5573 will check that B<N>::i is actually a constant. */
5575 }
5576 /* Check to see if DECL is a local variable in a context
5577 where that is forbidden. */
5580 {
5581 /* It might be that we only found DECL because we are
5582 trying to be generous with pre-ISO scoping rules.
5583 For example, consider:
5585 int i;
5586 void g() {
5587 for (int i = 0; i < 10; ++i) {}
5588 extern void f(int j = i);
5589 }
5591 Here, name look up will originally find the out
5592 of scope `i'. We need to issue a warning message,
5593 but then use the global `i'. */
5596 {
5601 }
5602 }
5603 }
5605 decl = (finish_id_expression
5607 idk,
5612 template_arg_p,
5619 }
5621 /* Anything else is an error. */
5625 }
5626 }
5634 {
5637 }
5639 /* Parse an id-expression.
5641 id-expression:
5642 unqualified-id
5643 qualified-id
5645 qualified-id:
5646 :: [opt] nested-name-specifier template [opt] unqualified-id
5647 :: identifier
5648 :: operator-function-id
5649 :: template-id
5651 Return a representation of the unqualified portion of the
5652 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5653 a `::' or nested-name-specifier.
5655 Often, if the id-expression was a qualified-id, the caller will
5656 want to make a SCOPE_REF to represent the qualified-id. This
5657 function does not do this in order to avoid wastefully creating
5658 SCOPE_REFs when they are not required.
5660 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5661 `template' keyword.
5663 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5664 uninstantiated templates.
5666 If *TEMPLATE_P is non-NULL, it is set to true iff the
5667 `template' keyword is used to explicitly indicate that the entity
5668 named is a template.
5670 If DECLARATOR_P is true, the id-expression is appearing as part of
5671 a declarator, rather than as part of an expression. */
5673 static cp_expr
5680 {
5684 /* Assume the `template' keyword was not used. */
5688 /* Look for the optional `::' operator. */
5689 global_scope_p
5690 = (!template_keyword_p
5695 /* Look for the optional nested-name-specifier. */
5696 nested_name_specifier_p
5699 check_dependency_p,
5701 declarator_p,
5702 template_keyword_p)
5705 /* If there is a nested-name-specifier, then we are looking at
5706 the first qualified-id production. */
5708 {
5709 tree saved_scope;
5710 tree saved_object_scope;
5711 tree saved_qualifying_scope;
5712 cp_expr unqualified_id;
5715 /* See if the next token is the `template' keyword. */
5719 /* Name lookup we do during the processing of the
5720 unqualified-id might obliterate SCOPE. */
5724 /* Process the final unqualified-id. */
5726 check_dependency_p,
5727 declarator_p,
5729 /* Restore the SAVED_SCOPE for our caller. */
5735 }
5736 /* Otherwise, if we are in global scope, then we are looking at one
5737 of the other qualified-id productions. */
5739 {
5741 tree id;
5743 /* Peek at the next token. */
5746 /* If it's an identifier, and the next token is not a "<", then
5747 we can avoid the template-id case. This is an optimization
5748 for this common case. */
5750 && !cp_parser_nth_token_starts_template_argument_list_p
5755 /* Try a template-id. */
5759 none_type,
5760 declarator_p);
5761 /* If that worked, we're done. */
5765 /* Peek at the next token. (Changes in the token buffer may
5766 have invalidated the pointer obtained above.) */
5770 {
5777 /* Fall through. */
5782 }
5783 }
5784 else
5787 declarator_p,
5788 optional_p);
5789 }
5791 /* Parse an unqualified-id.
5793 unqualified-id:
5794 identifier
5795 operator-function-id
5796 conversion-function-id
5797 ~ class-name
5798 template-id
5800 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5801 keyword, in a construct like `A::template ...'.
5803 Returns a representation of unqualified-id. For the `identifier'
5804 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5805 production a BIT_NOT_EXPR is returned; the operand of the
5806 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5807 other productions, see the documentation accompanying the
5808 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5809 names are looked up in uninstantiated templates. If DECLARATOR_P
5810 is true, the unqualified-id is appearing as part of a declarator,
5811 rather than as part of an expression. */
5813 static cp_expr
5819 {
5822 /* Peek at the next token. */
5826 {
5828 {
5829 tree id;
5831 /* We don't know yet whether or not this will be a
5832 template-id. */
5834 /* Try a template-id. */
5836 check_dependency_p,
5837 none_type,
5838 declarator_p);
5839 /* If it worked, we're done. */
5842 /* Otherwise, it's an ordinary identifier. */
5844 }
5848 check_dependency_p,
5849 none_type,
5850 declarator_p);
5853 {
5854 tree type_decl;
5855 tree qualifying_scope;
5856 tree object_scope;
5857 tree scope;
5860 /* Consume the `~' token. */
5862 /* Parse the class-name. The standard, as written, seems to
5863 say that:
5865 template <typename T> struct S { ~S (); };
5866 template <typename T> S<T>::~S() {}
5868 is invalid, since `~' must be followed by a class-name, but
5869 `S<T>' is dependent, and so not known to be a class.
5870 That's not right; we need to look in uninstantiated
5871 templates. A further complication arises from:
5873 template <typename T> void f(T t) {
5874 t.T::~T();
5875 }
5877 Here, it is not possible to look up `T' in the scope of `T'
5878 itself. We must look in both the current scope, and the
5879 scope of the containing complete expression.
5881 Yet another issue is:
5883 struct S {
5884 int S;
5885 ~S();
5886 };
5888 S::~S() {}
5890 The standard does not seem to say that the `S' in `~S'
5891 should refer to the type `S' and not the data member
5892 `S::S'. */
5894 /* DR 244 says that we look up the name after the "~" in the
5895 same scope as we looked up the qualifying name. That idea
5896 isn't fully worked out; it's more complicated than that. */
5901 /* Check for invalid scopes. */
5903 {
5907 }
5909 {
5913 scope);
5918 }
5921 /* If the name is of the form "X::~X" it's OK even if X is a
5922 typedef. */
5931 {
5934 }
5936 /* ~auto means the destructor of whatever the object is. */
5938 {
5941 "%<~auto%> only available with "
5945 }
5947 /* If there was an explicit qualification (S::~T), first look
5948 in the scope given by the qualification (i.e., S).
5950 Note: in the calls to cp_parser_class_name below we pass
5951 typename_type so that lookup finds the injected-class-name
5952 rather than the constructor. */
5956 {
5961 typename_type,
5964 declarator_p);
5967 }
5968 /* In "N::S::~S", look in "N" as well. */
5970 {
5975 type_decl
5979 typename_type,
5982 declarator_p);
5985 }
5986 /* In "p->S::~T", look in the scope given by "*p" as well. */
5988 {
5993 type_decl
5997 typename_type,
6000 declarator_p);
6003 }
6004 /* Look in the surrounding context. */
6006 {
6012 type_decl
6016 typename_type,
6019 declarator_p);
6022 {
6023 /* We couldn't find a type with this name. If we're parsing
6024 tentatively, fail and try something else. */
6026 {
6029 }
6030 /* Otherwise, accept it and check for a match at instantiation
6031 time. */
6036 }
6037 }
6038 /* If an error occurred, assume that the name of the
6039 destructor is the same as the name of the qualifying
6040 class. That allows us to keep parsing after running
6041 into ill-formed destructor names. */
6047 /* Check that destructor name and scope match. */
6049 {
6056 }
6058 /* [class.dtor]
6060 A typedef-name that names a class shall not be used as the
6061 identifier in the declarator for a destructor declaration. */
6068 type_decl);
6071 }
6075 {
6076 cp_expr id;
6078 /* This could be a template-id, so we try that first. */
6080 /* Try a template-id. */
6083 none_type,
6084 declarator_p);
6085 /* If that worked, we're done. */
6088 /* We still don't know whether we're looking at an
6089 operator-function-id or a conversion-function-id. */
6091 /* Try an operator-function-id. */
6093 /* If that didn't work, try a conversion-function-id. */
6097 {
6098 /* 17.6.3.3.5 */
6103 "literal operator suffixes not preceded by %<_%>"
6105 }
6108 }
6109 /* Fall through. */
6116 }
6117 }
6119 /* Parse an (optional) nested-name-specifier.
6121 nested-name-specifier: [C++98]
6122 class-or-namespace-name :: nested-name-specifier [opt]
6123 class-or-namespace-name :: template nested-name-specifier [opt]
6125 nested-name-specifier: [C++0x]
6126 type-name ::
6127 namespace-name ::
6128 nested-name-specifier identifier ::
6129 nested-name-specifier template [opt] simple-template-id ::
6131 PARSER->SCOPE should be set appropriately before this function is
6132 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6133 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6134 in name lookups.
6136 Sets PARSER->SCOPE to the class (TYPE) or namespace
6137 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6138 it unchanged if there is no nested-name-specifier. Returns the new
6139 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6141 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6142 part of a declaration and/or decl-specifier. */
6144 static tree
6151 {
6156 /* Remember where the nested-name-specifier starts. */
6158 {
6161 }
6164 {
6165 tree new_scope;
6166 tree old_scope;
6167 tree saved_qualifying_scope;
6169 /* Spot cases that cannot be the beginning of a
6170 nested-name-specifier. */
6173 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6174 the already parsed nested-name-specifier. */
6176 {
6177 /* Grab the nested-name-specifier and continue the loop. */
6179 /* If we originally encountered this nested-name-specifier
6180 with IS_DECLARATION set to false, we will not have
6181 resolved TYPENAME_TYPEs, so we must do so here. */
6184 {
6189 }
6192 }
6194 /* Spot cases that cannot be the beginning of a
6195 nested-name-specifier. On the second and subsequent times
6196 through the loop, we look for the `template' keyword. */
6198 ;
6199 /* A template-id can start a nested-name-specifier. */
6201 ;
6202 /* DR 743: decltype can be used in a nested-name-specifier. */
6204 ;
6205 else
6206 {
6207 /* If the next token is not an identifier, then it is
6208 definitely not a type-name or namespace-name. */
6211 /* If the following token is neither a `<' (to begin a
6212 template-id), nor a `::', then we are not looking at a
6213 nested-name-specifier. */
6219 {
6223 "found %<:%> in nested-name-specifier, "
6226 }
6229 && !cp_parser_nth_token_starts_template_argument_list_p
6232 }
6234 /* The nested-name-specifier is optional, so we parse
6235 tentatively. */
6238 /* Look for the optional `template' keyword, if this isn't the
6239 first time through the loop. */
6243 /* Save the old scope since the name lookup we are about to do
6244 might destroy it. */
6247 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6248 look up names in "X<T>::I" in order to determine that "Y" is
6249 a template. So, if we have a typename at this point, we make
6250 an effort to look through it. */
6252 && !typename_keyword_p
6257 /* Parse the qualifying entity. */
6258 new_scope
6260 typename_keyword_p,
6261 template_keyword_p,
6262 check_dependency_p,
6263 type_p,
6264 is_declaration);
6265 /* Look for the `::' token. */
6268 /* If we found what we wanted, we keep going; otherwise, we're
6269 done. */
6271 {
6274 /* Restore the OLD_SCOPE since it was valid before the
6275 failed attempt at finding the last
6276 class-or-namespace-name. */
6280 /* If the next token is a decltype, and the one after that is a
6281 `::', then the decltype has failed to resolve to a class or
6282 enumeration type. Give this error even when parsing
6283 tentatively since it can't possibly be valid--and we're going
6284 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6285 won't get another chance.*/
6289 {
6296 /* As below. */
6299 }
6303 {
6304 /* If we have a non-type template-id followed by ::, it can't
6305 possibly be valid. */
6310 {
6313 {
6319 }
6320 else
6321 {
6322 /* Variable template. */
6327 }
6334 /* As below. */
6338 }
6339 }
6343 /* If the next token is an identifier, and the one after
6344 that is a `::', then any valid interpretation would have
6345 found a class-or-namespace-name. */
6351 {
6354 {
6356 {
6357 tree decl;
6358 tree ambiguous_decls;
6361 none_type,
6370 decl);
6372 {
6373 // cp_parser_lookup_name has the same diagnostic,
6374 // thus make sure to emit it at most once.
6377 {
6382 }
6384 }
6385 else
6386 {
6388 cp_parser_name_lookup_error
6391 else
6392 cp_parser_name_lookup_error
6395 }
6396 }
6399 /* Treat this as a successful nested-name-specifier
6400 due to:
6402 [basic.lookup.qual]
6404 If the name found is not a class-name (clause
6405 _class_) or namespace-name (_namespace.def_), the
6406 program is ill-formed. */
6408 }
6410 }
6412 }
6413 /* We've found one valid nested-name-specifier. */
6415 /* Name lookup always gives us a DECL. */
6418 /* Uses of "template" must be followed by actual templates. */
6430 new_scope);
6431 /* If it is a class scope, try to complete it; we are about to
6432 be looking up names inside the class. */
6434 /* Since checking types for dependency can be expensive,
6435 avoid doing it if the type is already complete. */
6437 /* Do not try to complete dependent types. */
6439 {
6441 /* If it is a typedef to current class, use the current
6442 class instead, as the typedef won't have any names inside
6443 it yet. */
6447 }
6448 /* Make sure we look in the right scope the next time through
6449 the loop. */
6451 }
6453 /* If parsing tentatively, replace the sequence of tokens that makes
6454 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6455 token. That way, should we re-parse the token stream, we will
6456 not have to repeat the effort required to do the parse, nor will
6457 we issue duplicate error messages. */
6459 {
6463 /* Reset the contents of the START token. */
6465 /* Retrieve any deferred checks. Do not pop this access checks yet
6466 so the memory will not be reclaimed during token replacing below. */
6474 /* Purge all subsequent tokens. */
6476 }
6482 }
6484 /* Parse a nested-name-specifier. See
6485 cp_parser_nested_name_specifier_opt for details. This function
6486 behaves identically, except that it will an issue an error if no
6487 nested-name-specifier is present. */
6489 static tree
6495 {
6496 tree scope;
6498 /* Look for the nested-name-specifier. */
6500 typename_keyword_p,
6501 check_dependency_p,
6502 type_p,
6503 is_declaration);
6504 /* If it was not present, issue an error message. */
6506 {
6509 }
6512 }
6514 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6515 this is either a class-name or a namespace-name (which corresponds
6516 to the class-or-namespace-name production in the grammar). For
6517 C++0x, it can also be a type-name that refers to an enumeration
6518 type or a simple-template-id.
6520 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6521 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6522 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6523 TYPE_P is TRUE iff the next name should be taken as a class-name,
6524 even the same name is declared to be another entity in the same
6525 scope.
6527 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6528 specified by the class-or-namespace-name. If neither is found the
6529 ERROR_MARK_NODE is returned. */
6531 static tree
6538 {
6539 tree saved_scope;
6540 tree saved_qualifying_scope;
6541 tree saved_object_scope;
6542 tree scope;
6546 /* DR 743: decltype can appear in a nested-name-specifier. */
6548 {
6552 {
6555 }
6559 }
6561 /* Before we try to parse the class-name, we must save away the
6562 current PARSER->SCOPE since cp_parser_class_name will destroy
6563 it. */
6567 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6568 there is no need to look for a namespace-name. */
6569 only_class_p = template_keyword_p
6574 typename_keyword_p,
6575 template_keyword_p,
6577 check_dependency_p,
6579 is_declaration,
6582 /* If that didn't work, try for a namespace-name. */
6584 {
6585 /* Restore the saved scope. */
6589 /* If we are not looking at an identifier followed by the scope
6590 resolution operator, then this is not part of a
6591 nested-name-specifier. (Note that this function is only used
6592 to parse the components of a nested-name-specifier.) */
6597 }
6600 }
6602 /* Return true if we are looking at a compound-literal, false otherwise. */
6604 static bool
6606 {
6609 /* Skip tokens until the next token is a closing parenthesis.
6610 If we find the closing `)', and the next token is a `{', then
6611 we are looking at a compound-literal. */
6612 bool compound_literal_p
6617 /* Roll back the tokens we skipped. */
6621 }
6623 /* Parse a postfix-expression.
6625 postfix-expression:
6626 primary-expression
6627 postfix-expression [ expression ]
6628 postfix-expression ( expression-list [opt] )
6629 simple-type-specifier ( expression-list [opt] )
6630 typename :: [opt] nested-name-specifier identifier
6631 ( expression-list [opt] )
6632 typename :: [opt] nested-name-specifier template [opt] template-id
6633 ( expression-list [opt] )
6634 postfix-expression . template [opt] id-expression
6635 postfix-expression -> template [opt] id-expression
6636 postfix-expression . pseudo-destructor-name
6637 postfix-expression -> pseudo-destructor-name
6638 postfix-expression ++
6639 postfix-expression --
6640 dynamic_cast < type-id > ( expression )
6641 static_cast < type-id > ( expression )
6642 reinterpret_cast < type-id > ( expression )
6643 const_cast < type-id > ( expression )
6644 typeid ( expression )
6645 typeid ( type-id )
6647 GNU Extension:
6649 postfix-expression:
6650 ( type-id ) { initializer-list , [opt] }
6652 This extension is a GNU version of the C99 compound-literal
6653 construct. (The C99 grammar uses `type-name' instead of `type-id',
6654 but they are essentially the same concept.)
6656 If ADDRESS_P is true, the postfix expression is the operand of the
6657 `&' operator. CAST_P is true if this expression is the target of a
6658 cast.
6660 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6661 class member access expressions [expr.ref].
6663 Returns a representation of the expression. */
6665 static cp_expr
6669 {
6671 location_t loc;
6677 /* Peek at the next token. */
6682 /* Some of the productions are determined by keywords. */
6685 {
6690 {
6691 tree type;
6692 cp_expr expression;
6696 /* All of these can be handled in the same way from the point
6697 of view of parsing. Begin by consuming the token
6698 identifying the cast. */
6701 /* New types cannot be defined in the cast. */
6703 parser->type_definition_forbidden_message
6706 /* Look for the opening `<'. */
6708 /* Parse the type to which we are casting. */
6713 /* Look for the closing `>'. */
6715 /* Restore the old message. */
6718 bool saved_greater_than_is_operator_p
6722 /* And the expression which is being cast. */
6723 matching_parens parens;
6727 RT_CLOSE_PAREN);
6731 parser->greater_than_is_operator_p
6734 /* Only type conversions to integral or enumeration types
6735 can be used in constant-expressions. */
6738 {
6741 }
6744 {
6746 postfix_expression
6750 postfix_expression
6754 postfix_expression
6756 tf_warning_or_error);
6759 postfix_expression
6764 }
6766 /* Construct a location e.g. :
6767 reinterpret_cast <int *> (expr)
6768 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6769 ranging from the start of the "*_cast" token to the final closing
6770 paren, with the caret at the start. */
6773 }
6777 {
6778 tree type;
6782 /* Consume the `typeid' token. */
6784 /* Look for the `(' token. */
6785 matching_parens parens;
6787 /* Types cannot be defined in a `typeid' expression. */
6789 parser->type_definition_forbidden_message
6791 /* We can't be sure yet whether we're looking at a type-id or an
6792 expression. */
6794 /* Try a type-id first. */
6799 /* Look for the `)' token. Otherwise, we can't be sure that
6800 we're not looking at an expression: consider `typeid (int
6801 (3))', for example. */
6803 /* If all went well, simply lookup the type-id. */
6806 /* Otherwise, fall back to the expression variant. */
6807 else
6808 {
6809 tree expression;
6811 /* Look for an expression. */
6813 /* Compute its typeid. */
6815 /* Look for the `)' token. */
6817 }
6818 /* Restore the saved message. */
6820 /* `typeid' may not appear in an integral constant expression. */
6824 /* Construct a location e.g. :
6825 typeid (expr)
6826 ^~~~~~~~~~~~~
6827 ranging from the start of the "typeid" token to the final closing
6828 paren, with the caret at the start. */
6830 {
6831 location_t typeid_loc
6834 }
6835 }
6839 {
6840 tree type;
6841 /* The syntax permitted here is the same permitted for an
6842 elaborated-type-specifier. */
6849 }
6855 {
6858 tree p;
6865 {
6868 }
6874 {
6877 postfix_expression
6879 else
6880 {
6884 }
6890 tf_warning_or_error);
6891 else
6892 {
6896 }
6901 postfix_expression
6905 postfix_expression
6908 else
6909 {
6913 }
6918 }
6920 }
6923 {
6924 tree type;
6926 /* If the next thing is a simple-type-specifier, we may be
6927 looking at a functional cast. We could also be looking at
6928 an id-expression. So, we try the functional cast, and if
6929 that doesn't work we fall back to the primary-expression. */
6931 /* Look for the simple-type-specifier. */
6935 CP_PARSER_FLAGS_NONE);
6937 /* Parse the cast itself. */
6939 postfix_expression
6941 /* If that worked, we're done. */
6945 /* If the functional-cast didn't work out, try a
6946 compound-literal. */
6949 {
6954 matching_parens parens;
6957 /* Avoid calling cp_parser_type_id pointlessly, see comment
6958 in cp_parser_cast_expression about c++/29234. */
6961 else
6962 {
6963 /* Parse the type. */
6969 }
6971 /* If things aren't going well, there's no need to
6972 keep going. */
6974 {
6976 /* Parse the brace-enclosed initializer list. */
6979 }
6980 /* If that worked, we're definitely looking at a
6981 compound-literal expression. */
6983 {
6984 /* Warn the user that a compound literal is not
6985 allowed in standard C++. */
6988 /* For simplicity, we disallow compound literals in
6989 constant-expressions. We could
6990 allow compound literals of integer type, whose
6991 initializer was a constant, in constant
6992 expressions. Permitting that usage, as a further
6993 extension, would not change the meaning of any
6994 currently accepted programs. (Of course, as
6995 compound literals are not part of ISO C++, the
6996 standard has nothing to say.) */
6998 NIC_NCC))
6999 {
7002 }
7003 /* Form the representation of the compound-literal. */
7004 postfix_expression
7009 }
7010 }
7012 /* It must be a primary-expression. */
7013 postfix_expression
7016 decltype_p,
7018 }
7020 }
7022 /* Note that we don't need to worry about calling build_cplus_new on a
7023 class-valued CALL_EXPR in decltype when it isn't the end of the
7024 postfix-expression; unary_complex_lvalue will take care of that for
7025 all these cases. */
7027 /* Keep looping until the postfix-expression is complete. */
7029 {
7033 /* It is not a Koenig lookup function call. */
7034 postfix_expression
7037 /* Peek at the next token. */
7041 {
7044 {
7046 "two consecutive %<[%> shall "
7049 }
7050 postfix_expression
7052 postfix_expression,
7054 decltype_p);
7063 /* postfix-expression ( expression-list [opt] ) */
7064 {
7075 is_builtin_constant_p
7078 {
7079 /* The whole point of __builtin_constant_p is to allow
7080 non-constant expressions to appear as arguments. */
7081 saved_integral_constant_expression_p
7083 saved_non_integral_constant_expression_p
7086 }
7087 args = (cp_parser_parenthesized_expression_list
7093 {
7094 parser->integral_constant_expression_p
7096 parser->non_integral_constant_expression_p
7098 }
7101 {
7104 }
7106 /* Function calls are not permitted in
7107 constant-expressions. */
7110 NIC_FUNC_CALL))
7111 {
7115 }
7120 {
7122 {
7124 {
7127 postfix_expression
7129 complain);
7130 }
7131 else
7132 postfix_expression
7134 }
7135 /* We do not perform argument-dependent lookup if
7136 normal lookup finds a non-function, in accordance
7137 with the expected resolution of DR 218. */
7140 {
7144 /* Do not do argument dependent lookup if regular
7145 lookup finds a member function or a block-scope
7146 function declaration. [basic.lookup.argdep]/3 */
7149 {
7152 postfix_expression
7154 complain);
7155 }
7156 }
7157 }
7163 {
7172 }
7175 {
7185 {
7187 postfix_expression
7191 }
7194 {
7195 postfix_expression
7196 = (build_new_method_call
7202 complain));
7203 }
7204 else
7205 postfix_expression
7209 complain);
7210 }
7214 postfix_expression = (build_offset_ref_call_from_tree
7216 complain));
7218 /* A call to a static class member, or a namespace-scope
7219 function. */
7220 postfix_expression
7223 koenig_p,
7224 complain);
7225 else
7226 /* All other function calls. */
7227 postfix_expression
7230 koenig_p,
7231 complain);
7234 {
7236 start_loc,
7237 close_paren_loc);
7239 }
7241 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7245 }
7250 /* postfix-expression . template [opt] id-expression
7251 postfix-expression . pseudo-destructor-name
7252 postfix-expression -> template [opt] id-expression
7253 postfix-expression -> pseudo-destructor-name */
7255 /* Consume the `.' or `->' operator. */
7258 postfix_expression
7260 postfix_expression,
7267 /* postfix-expression ++ */
7268 /* Consume the `++' token. */
7270 /* Generate a representation for the complete expression. */
7271 postfix_expression
7273 POSTINCREMENT_EXPR);
7274 /* Increments may not appear in constant-expressions. */
7282 /* postfix-expression -- */
7283 /* Consume the `--' token. */
7285 /* Generate a representation for the complete expression. */
7286 postfix_expression
7288 POSTDECREMENT_EXPR);
7289 /* Decrements may not appear in constant-expressions. */
7300 return is_member_access
7301 ? postfix_expression
7303 else
7305 }
7306 }
7308 /* We should never get here. */
7311 }
7313 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7314 by cp_parser_builtin_offsetof. We're looking for
7316 postfix-expression [ expression ]
7317 postfix-expression [ braced-init-list ] (C++11)
7319 FOR_OFFSETOF is set if we're being called in that context, which
7320 changes how we deal with integer constant expressions. */
7322 static tree
7324 tree postfix_expression,
7327 {
7332 /* Consume the `[' token. */
7338 /* Parse the index expression. */
7339 /* ??? For offsetof, there is a question of what to allow here. If
7340 offsetof is not being used in an integral constant expression context,
7341 then we *could* get the right answer by computing the value at runtime.
7342 If we are in an integral constant expression context, then we might
7343 could accept any constant expression; hard to say without analysis.
7344 Rather than open the barn door too wide right away, allow only integer
7345 constant expressions here. */
7348 else
7349 {
7351 {
7356 }
7357 else
7359 }
7363 /* Look for the closing `]'. */
7366 /* Build the ARRAY_REF. */
7370 /* When not doing offsetof, array references are not permitted in
7371 constant-expressions. */
7377 }
7379 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7380 by cp_parser_builtin_offsetof. We're looking for
7382 postfix-expression . template [opt] id-expression
7383 postfix-expression . pseudo-destructor-name
7384 postfix-expression -> template [opt] id-expression
7385 postfix-expression -> pseudo-destructor-name
7387 FOR_OFFSETOF is set if we're being called in that context. That sorta
7388 limits what of the above we'll actually accept, but nevermind.
7389 TOKEN_TYPE is the "." or "->" token, which will already have been
7390 removed from the stream. */
7392 static tree
7395 cp_expr postfix_expression,
7397 location_t location)
7398 {
7399 tree name;
7405 /* If this is a `->' operator, dereference the pointer. */
7408 tf_warning_or_error);
7409 /* Check to see whether or not the expression is type-dependent and
7410 not the current instantiation. */
7412 /* The identifier following the `->' or `.' is not qualified. */
7418 /* Enter the scope corresponding to the type of the object
7419 given by the POSTFIX_EXPRESSION. */
7421 {
7423 /* According to the standard, no expression should ever have
7424 reference type. Unfortunately, we do not currently match
7425 the standard in this respect in that our internal representation
7426 of an expression may have reference type even when the standard
7427 says it does not. Therefore, we have to manually obtain the
7428 underlying type here. */
7430 /* The type of the POSTFIX_EXPRESSION must be complete. */
7431 /* Unlike the object expression in other contexts, *this is not
7432 required to be of complete type for purposes of class member
7433 access (5.2.5) outside the member function body. */
7436 && !(processing_template_decl
7437 && current_class_type
7438 && (same_type_ignoring_top_level_qualifiers_p
7440 {
7443 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7445 {
7446 /* In a template, be permissive by treating an object expression
7447 of incomplete type as dependent (after a pedwarn). */
7448 diagnostic_t kind = (processing_template_decl
7450 ? DK_PEDWARN
7452 cxx_incomplete_type_diagnostic
7458 {
7461 }
7462 }
7463 }
7466 {
7467 /* Let the name lookup machinery know that we are processing a
7468 class member access expression. */
7470 /* If something went wrong, we want to be able to discern that case,
7471 as opposed to the case where there was no SCOPE due to the type
7472 of expression being dependent. */
7475 /* If the SCOPE was erroneous, make the various semantic analysis
7476 functions exit quickly -- and without issuing additional error
7477 messages. */
7480 }
7481 }
7484 /* Tell cp_parser_lookup_name that there was an object, even though it's
7485 type-dependent. */
7488 /* Assume this expression is not a pseudo-destructor access. */
7491 /* If the SCOPE is a scalar type, then, if this is a valid program,
7492 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7493 is type dependent, it can be pseudo-destructor-name or something else.
7494 Try to parse it as pseudo-destructor-name first. */
7496 {
7497 tree s;
7498 tree type;
7501 /* Parse the pseudo-destructor-name. */
7510 {
7512 postfix_expression
7515 }
7516 }
7519 {
7520 /* If the SCOPE is not a scalar type, we are looking at an
7521 ordinary class member access expression, rather than a
7522 pseudo-destructor-name. */
7525 /* Parse the id-expression. */
7526 name = (cp_parser_id_expression
7533 /* In general, build a SCOPE_REF if the member name is qualified.
7534 However, if the name was not dependent and has already been
7535 resolved; there is no need to build the SCOPE_REF. For example;
7537 struct X { void f(); };
7538 template <typename T> void f(T* t) { t->X::f(); }
7540 Even though "t" is dependent, "X::f" is not and has been resolved
7541 to a BASELINK; there is no need to include scope information. */
7543 /* But we do need to remember that there was an explicit scope for
7544 virtual function calls. */
7548 /* If the name is a template-id that names a type, we will get a
7549 TYPE_DECL here. That is invalid code. */
7551 {
7554 }
7555 else
7556 {
7558 {
7560 {
7564 }
7565 else
7568 name,
7569 template_p);
7573 }
7575 adjust_result_of_qualified_name_lookup
7577 postfix_expression
7579 template_p,
7580 tf_warning_or_error);
7581 /* Build a location e.g.:
7582 ptr->access_expr
7583 ~~~^~~~~~~~~~~~~
7584 where the caret is at the deref token, ranging from
7585 the start of postfix_expression to the end of the access expr. */
7586 location_t end_loc
7588 location_t combined_loc
7591 }
7592 }
7594 /* We no longer need to look up names in the scope of the object on
7595 the left-hand side of the `.' or `->' operator. */
7598 /* Outside of offsetof, these operators may not appear in
7599 constant-expressions. */
7601 && (cp_parser_non_integral_constant_expression
7606 }
7608 /* Parse a parenthesized expression-list.
7610 expression-list:
7611 assignment-expression
7612 expression-list, assignment-expression
7614 attribute-list:
7615 expression-list
7616 identifier
7617 identifier, expression-list
7619 CAST_P is true if this expression is the target of a cast.
7621 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7622 argument pack.
7624 Returns a vector of trees. Each element is a representation of an
7625 assignment-expression. NULL is returned if the ( and or ) are
7626 missing. An empty, but allocated, vector is returned on no
7627 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7628 if we are parsing an attribute list for an attribute that wants a
7629 plain identifier argument, normal_attr for an attribute that wants
7630 an expression, or non_attr if we aren't parsing an attribute list. If
7631 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7632 not all of the expressions in the list were constant.
7633 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7634 will be written to with the location of the closing parenthesis. If
7635 an error occurs, it may or may not be written to. */
7644 {
7650 /* Assume all the expressions will be constant. */
7654 matching_parens parens;
7660 /* Within a parenthesized expression, a `>' token is always
7661 the greater-than operator. */
7662 saved_greater_than_is_operator_p
7666 /* Consume expressions until there are no more. */
7669 {
7670 tree expr;
7672 /* At the beginning of attribute lists, check to see if the
7673 next token is an identifier. */
7676 {
7679 /* Consume the identifier. */
7681 /* Save the identifier. */
7683 }
7684 else
7685 {
7688 /* Parse the next assignment-expression. */
7690 {
7691 /* A braced-init-list. */
7697 }
7699 {
7700 expr = (cp_parser_constant_expression
7705 }
7706 else
7708 cast_p);
7713 /* If we have an ellipsis, then this is an expression
7714 expansion. */
7717 {
7718 /* Consume the `...'. */
7721 /* Build the argument pack. */
7723 }
7725 /* Add it to the list. We add error_mark_node
7726 expressions to the list, so that we can still tell if
7727 the correct form for a parenthesized expression-list
7728 is found. That gives better errors. */
7733 }
7735 /* After the first item, attribute lists look the same as
7736 expression lists. */
7739 get_comma:;
7740 /* If the next token isn't a `,', then we are done. */
7744 /* Otherwise, consume the `,' and keep going. */
7746 }
7752 {
7755 skip_comma:;
7756 /* We try and resync to an unnested comma, as that will give the
7757 user better diagnostics. */
7765 {
7766 parser->greater_than_is_operator_p
7769 }
7770 }
7772 parser->greater_than_is_operator_p
7779 }
7781 /* Parse a pseudo-destructor-name.
7783 pseudo-destructor-name:
7784 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7785 :: [opt] nested-name-specifier template template-id :: ~ type-name
7786 :: [opt] nested-name-specifier [opt] ~ type-name
7788 If either of the first two productions is used, sets *SCOPE to the
7789 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7790 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7791 or ERROR_MARK_NODE if the parse fails. */
7793 static void
7795 tree object,
7798 {
7801 /* Handle ~auto. */
7805 {
7808 "%<~auto%> only available with "
7815 }
7817 /* Assume that things will not work out. */
7820 /* Look for the optional `::' operator. */
7822 /* Look for the optional nested-name-specifier. */
7823 nested_name_specifier_p
7830 /* Now, if we saw a nested-name-specifier, we might be doing the
7831 second production. */
7834 {
7835 /* Consume the `template' keyword. */
7837 /* Parse the template-id. */
7841 class_type,
7843 /* Look for the `::' token. */
7845 }
7846 /* If the next token is not a `~', then there might be some
7847 additional qualification. */
7849 {
7850 /* At this point, we're looking for "type-name :: ~". The type-name
7851 must not be a class-name, since this is a pseudo-destructor. So,
7852 it must be either an enum-name, or a typedef-name -- both of which
7853 are just identifiers. So, we peek ahead to check that the "::"
7854 and "~" tokens are present; if they are not, then we can avoid
7855 calling type_name. */
7859 {
7862 }
7864 /* Look for the type-name. */
7869 /* Look for the `::' token. */
7871 }
7872 else
7875 /* Look for the `~'. */
7878 /* Once we see the ~, this has to be a pseudo-destructor. */
7882 /* Look for the type-name again. We are not responsible for
7883 checking that it matches the first type-name. */
7885 }
7887 /* Parse a unary-expression.
7889 unary-expression:
7890 postfix-expression
7891 ++ cast-expression
7892 -- cast-expression
7893 unary-operator cast-expression
7894 sizeof unary-expression
7895 sizeof ( type-id )
7896 alignof ( type-id ) [C++0x]
7897 new-expression
7898 delete-expression
7900 GNU Extensions:
7902 unary-expression:
7903 __extension__ cast-expression
7904 __alignof__ unary-expression
7905 __alignof__ ( type-id )
7906 alignof unary-expression [C++0x]
7907 __real__ cast-expression
7908 __imag__ cast-expression
7909 && identifier
7910 sizeof ( type-id ) { initializer-list , [opt] }
7911 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7912 __alignof__ ( type-id ) { initializer-list , [opt] }
7914 ADDRESS_P is true iff the unary-expression is appearing as the
7915 operand of the `&' operator. CAST_P is true if this expression is
7916 the target of a cast.
7918 Returns a representation of the expression. */
7920 static cp_expr
7923 {
7927 /* Peek at the next token. */
7929 /* Some keywords give away the kind of expression. */
7931 {
7935 {
7938 {
7944 /* Consume the token. */
7946 /* Parse the operand. */
7951 else
7952 {
7953 /* ISO C++ defines alignof only with types, not with
7954 expressions. So pedwarn if alignof is used with a non-
7955 type expression. However, __alignof__ is ok. */
7958 "ISO C++ does not allow %<alignof%> "
7962 }
7963 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7964 SIZEOF_EXPR with the original operand. */
7966 {
7968 {
7970 {
7973 error_mark_node));
7975 }
7976 else
7980 }
7981 }
7983 /* Construct a location e.g. :
7984 alignof (expr)
7985 ^~~~~~~~~~~~~~
7986 with start == caret at the start of the "alignof"/"sizeof"
7987 token, with the endpoint at the final closing paren. */
7988 location_t finish_loc
7990 location_t compound_loc
7996 }
8005 {
8006 /* The saved value of the PEDANTIC flag. */
8008 tree expr;
8010 /* Save away the PEDANTIC flag. */
8012 /* Parse the cast-expression. */
8014 /* Restore the PEDANTIC flag. */
8018 }
8022 {
8023 tree expression;
8025 /* Consume the `__real__' or `__imag__' token. */
8027 /* Parse the cast-expression. */
8029 /* Create the complete representation. */
8033 expression,
8034 tf_warning_or_error);
8035 }
8043 {
8044 tree expr;
8053 matching_parens parens;
8057 parser->type_definition_forbidden_message
8060 saved_integral_constant_expression_p
8062 saved_non_integral_constant_expression_p
8066 saved_greater_than_is_operator_p
8078 parser->greater_than_is_operator_p
8081 parser->integral_constant_expression_p
8083 parser->non_integral_constant_expression_p
8088 location_t finish_loc
8092 /* Construct a location of the form:
8093 noexcept (expr)
8094 ^~~~~~~~~~~~~~~
8095 with start == caret, finishing at the close-paren. */
8096 location_t noexcept_loc
8100 noexcept_loc);
8101 }
8105 }
8106 }
8108 /* Look for the `:: new' and `:: delete', which also signal the
8109 beginning of a new-expression, or delete-expression,
8110 respectively. If the next token is `::', then it might be one of
8111 these. */
8113 {
8116 /* See if the token after the `::' is one of the keywords in
8117 which we're interested. */
8119 /* If it's `new', we have a new-expression. */
8122 /* Similarly, for `delete'. */
8125 }
8127 /* Look for a unary operator. */
8129 /* The `++' and `--' operators can be handled similarly, even though
8130 they are not technically unary-operators in the grammar. */
8132 {
8137 /* Handle the GNU address-of-label extension. */
8140 {
8141 tree identifier;
8142 tree expression;
8145 /* Consume the '&&' token. */
8147 /* Look for the identifier. */
8148 location_t finish_loc
8151 /* Construct a location of the form:
8152 &&label
8153 ^~~~~~~
8154 with caret==start at the "&&", finish at the end of the label. */
8155 location_t combined_loc
8157 /* Create an expression representing the address. */
8160 NIC_ADDR_LABEL))
8163 }
8164 }
8166 {
8167 cp_expr cast_expression;
8173 /* Consume the operator token. */
8177 /* Parse the cast-expression. */
8178 cast_expression
8183 pidk);
8185 /* Make a location:
8186 OP_TOKEN CAST_EXPRESSION
8187 ^~~~~~~~~~~~~~~~~~~~~~~~~
8188 with start==caret at the operator token, and
8189 extending to the end of the cast_expression. */
8192 /* Now, build an appropriate representation. */
8194 {
8198 RO_UNARY_STAR,
8199 complain);
8200 /* TODO: build_x_indirect_ref does not always honor the
8201 location, so ensure it is set. */
8207 /* Fall through. */
8210 cast_expression,
8211 complain);
8212 /* TODO: build_x_unary_op does not always honor the location,
8213 so ensure it is set. */
8221 /* Fall through. */
8223 /* Immediately fold negation of a constant, unless the constant is 0
8224 (since -0 == 0) or it would overflow. */
8229 {
8232 cast_expression);
8234 {
8237 }
8238 }
8239 /* Fall through. */
8248 }
8252 non_constant_p))
8256 }
8260 decltype_p,
8261 pidk);
8262 }
8264 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8265 unary-operator, the corresponding tree code is returned. */
8267 static enum tree_code
8269 {
8271 {
8292 }
8293 }
8295 /* Parse a new-expression.
8297 new-expression:
8298 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8299 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8301 Returns a representation of the expression. */
8303 static tree
8305 {
8308 tree type;
8311 tree ret;
8315 /* Look for the optional `::' operator. */
8316 global_scope_p
8320 /* Look for the `new' operator. */
8322 /* There's no easy way to tell a new-placement from the
8323 `( type-id )' construct. */
8325 /* Look for a new-placement. */
8327 /* If that didn't work out, there's no new-placement. */
8329 {
8333 }
8335 /* If the next token is a `(', then we have a parenthesized
8336 type-id. */
8338 {
8342 /* Consume the `('. */
8343 matching_parens parens;
8346 /* Parse the type-id. */
8347 parser->type_definition_forbidden_message
8349 {
8352 }
8355 /* Look for the closing `)'. */
8358 /* There should not be a direct-new-declarator in this production,
8359 but GCC used to allowed this, so we check and emit a sensible error
8360 message for this case. */
8362 {
8368 }
8369 }
8370 /* Otherwise, there must be a new-type-id. */
8371 else
8374 /* If the next token is a `(' or '{', then we have a new-initializer. */
8379 else
8382 /* A new-expression may not appear in an integral constant
8383 expression. */
8386 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8387 of a new-type-id or type-id of a new-expression, the new-expression shall
8388 contain a new-initializer of the form ( assignment-expression )".
8389 Additionally, consistently with the spirit of DR 1467, we want to accept
8390 'new auto { 2 }' too. */
8396 {
8398 "initialization of new-expression for type %<auto%> "
8401 }
8402 else
8403 {
8404 /* Construct a location e.g.:
8405 ptr = new int[100]
8406 ^~~~~~~~~~~~
8407 with caret == start at the start of the "new" token, and the end
8408 at the end of the final token we consumed. */
8413 /* Create a representation of the new-expression. */
8415 tf_warning_or_error);
8417 }
8425 }
8427 /* Parse a new-placement.
8429 new-placement:
8430 ( expression-list )
8432 Returns the same representation as for an expression-list. */
8436 {
8439 /* Parse the expression-list. */
8440 expression_list = (cp_parser_parenthesized_expression_list
8449 }
8451 /* Parse a new-type-id.
8453 new-type-id:
8454 type-specifier-seq new-declarator [opt]
8456 Returns the TYPE allocated. If the new-type-id indicates an array
8457 type, *NELTS is set to the number of elements in the last array
8458 bound; the TYPE will not include the last array bound. */
8460 static tree
8462 {
8463 cp_decl_specifier_seq type_specifier_seq;
8469 /* The type-specifier sequence must not contain type definitions.
8470 (It cannot contain declarations of new types either, but if they
8471 are not definitions we will catch that because they are not
8472 complete.) */
8474 parser->type_definition_forbidden_message
8476 /* Parse the type-specifier-seq. */
8480 /* Restore the old message. */
8486 /* Parse the new-declarator. */
8489 /* Determine the number of elements in the last array dimension, if
8490 any. */
8492 /* Skip down to the last array dimension. */
8497 {
8500 }
8505 {
8508 }
8511 {
8518 else
8520 }
8523 }
8525 /* Parse an (optional) new-declarator.
8527 new-declarator:
8528 ptr-operator new-declarator [opt]
8529 direct-new-declarator
8531 Returns the declarator. */
8535 {
8538 cp_cv_quals cv_quals;
8540 /* We don't know if there's a ptr-operator next, or not. */
8542 /* Look for a ptr-operator. */
8544 /* If that worked, look for more new-declarators. */
8546 {
8549 /* Parse another optional declarator. */
8552 declarator = cp_parser_make_indirect_declarator
8556 }
8558 /* If the next token is a `[', there is a direct-new-declarator. */
8563 }
8565 /* Parse a direct-new-declarator.
8567 direct-new-declarator:
8568 [ expression ]
8569 direct-new-declarator [constant-expression]
8571 */
8575 {
8579 {
8580 tree expression;
8583 /* Look for the opening `['. */
8588 /* The standard requires that the expression have integral
8589 type. DR 74 adds enumeration types. We believe that the
8590 real intent is that these expressions be handled like the
8591 expression in a `switch' condition, which also allows
8592 classes with a single conversion to integral or
8593 enumeration type. */
8595 {
8596 expression
8598 expression,
8601 {
8603 "expression in new-declarator must have integral "
8606 }
8607 }
8609 /* Look for the closing `]'. */
8612 /* Add this bound to the declarator. */
8615 /* If the next token is not a `[', then there are no more
8616 bounds. */
8619 }
8622 }
8624 /* Parse a new-initializer.
8626 new-initializer:
8627 ( expression-list [opt] )
8628 braced-init-list
8630 Returns a representation of the expression-list. */
8634 {
8638 {
8639 tree t;
8646 }
8647 else
8648 expression_list = (cp_parser_parenthesized_expression_list
8654 }
8656 /* Parse a delete-expression.
8658 delete-expression:
8659 :: [opt] delete cast-expression
8660 :: [opt] delete [ ] cast-expression
8662 Returns a representation of the expression. */
8664 static tree
8666 {
8669 tree expression;
8671 /* Look for the optional `::' operator. */
8672 global_scope_p
8676 /* Look for the `delete' keyword. */
8678 /* See if the array syntax is in use. */
8680 {
8681 /* Consume the `[' token. */
8683 /* Look for the `]' token. */
8685 /* Remember that this is the `[]' construct. */
8687 }
8688 else
8691 /* Parse the cast-expression. */
8694 /* A delete-expression may not appear in an integral constant
8695 expression. */
8700 tf_warning_or_error);
8701 }
8703 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8704 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8705 0 otherwise. */
8707 static int
8709 {
8712 {
8754 /* In ((type ()) () the last () isn't a valid cast-expression,
8755 so the whole must be parsed as postfix-expression. */
8760 /* '[' may start a primary-expression in obj-c++ and in C++11,
8761 as a lambda-expression, eg, '(void)[]{}'. */
8768 /* '++' and '--' may or may not start a cast-expression:
8770 struct T { void operator++(int); };
8771 void f() { (T())++; }
8773 vs
8775 int a;
8776 (int)++a; */
8781 }
8782 }
8784 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8785 in the order: const_cast, static_cast, reinterpret_cast.
8787 Don't suggest dynamic_cast.
8789 Return the first legal cast kind found, or NULL otherwise. */
8793 {
8794 tree trial;
8796 /* Reuse the parser logic by attempting to build the various kinds of
8797 cast, with "complain" disabled.
8798 Identify the first such cast that is valid. */
8800 /* Don't attempt to run such logic within template processing. */
8804 /* First try const_cast. */
8809 /* If that fails, try static_cast. */
8814 /* Finally, try reinterpret_cast. */
8819 /* No such cast possible. */
8821 }
8823 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8824 suggesting how to convert a C-style cast of the form:
8826 (DST_TYPE)ORIG_EXPR
8828 to a C++-style cast.
8830 The primary range of RICHLOC is asssumed to be that of the original
8831 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8832 of the parens in the C-style cast. */
8834 static void
8837 tree dst_type)
8838 {
8839 /* This function is non-trivial, so bail out now if the warning isn't
8840 going to be emitted. */
8844 /* Try to find a legal C++ cast, trying them in order:
8845 const_cast, static_cast, reinterpret_cast. */
8850 /* Replace the open paren with "CAST_SUGGESTION<". */
8851 pretty_printer pp;
8855 /* Replace the close paren with "> (". */
8858 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8860 }
8863 /* Parse a cast-expression.
8865 cast-expression:
8866 unary-expression
8867 ( type-id ) cast-expression
8869 ADDRESS_P is true iff the unary-expression is appearing as the
8870 operand of the `&' operator. CAST_P is true if this expression is
8871 the target of a cast.
8873 Returns a representation of the expression. */
8875 static cp_expr
8878 {
8879 /* If it's a `(', then we might be looking at a cast. */
8881 {
8887 /* There's no way to know yet whether or not this is a cast.
8888 For example, `(int (3))' is a unary-expression, while `(int)
8889 3' is a cast. So, we resort to parsing tentatively. */
8891 /* Types may not be defined in a cast. */
8893 parser->type_definition_forbidden_message
8895 /* Consume the `('. */
8896 matching_parens parens;
8901 /* A very tricky bit is that `(struct S) { 3 }' is a
8902 compound-literal (which we permit in C++ as an extension).
8903 But, that construct is not a cast-expression -- it is a
8904 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8905 is legal; if the compound-literal were a cast-expression,
8906 you'd need an extra set of parentheses.) But, if we parse
8907 the type-id, and it happens to be a class-specifier, then we
8908 will commit to the parse at that point, because we cannot
8909 undo the action that is done when creating a new class. So,
8910 then we cannot back up and do a postfix-expression.
8912 Another tricky case is the following (c++/29234):
8914 struct S { void operator () (); };
8916 void foo ()
8917 {
8918 ( S()() );
8919 }
8921 As a type-id we parse the parenthesized S()() as a function
8922 returning a function, groktypename complains and we cannot
8923 back up in this case either.
8925 Therefore, we scan ahead to the closing `)', and check to see
8926 if the tokens after the `)' can start a cast-expression. Otherwise
8927 we are dealing with an unary-expression, a postfix-expression
8928 or something else.
8930 Yet another tricky case, in C++11, is the following (c++/54891):
8932 (void)[]{};
8934 The issue is that usually, besides the case of lambda-expressions,
8935 the parenthesized type-id cannot be followed by '[', and, eg, we
8936 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8937 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8938 we don't commit, we try a cast-expression, then an unary-expression.
8940 Save tokens so that we can put them back. */
8943 /* We may be looking at a cast-expression. */
8946 cast_expression
8949 /* Roll back the tokens we skipped. */
8951 /* If we aren't looking at a cast-expression, simulate an error so
8952 that the call to cp_parser_error_occurred below returns true. */
8955 else
8956 {
8959 /* Look for the type-id. */
8961 /* Look for the closing `)'. */
8966 }
8968 /* Restore the saved message. */
8971 /* At this point this can only be either a cast or a
8972 parenthesized ctor such as `(T ())' that looks like a cast to
8973 function returning T. */
8975 {
8976 /* Only commit if the cast-expression doesn't start with
8977 '++', '--', or '[' in C++11. */
8985 pidk);
8988 {
8989 /* Warn about old-style casts, if so requested. */
8994 {
9000 }
9002 /* Only type conversions to integral or enumeration types
9003 can be used in constant-expressions. */
9006 NIC_CAST))
9009 /* Perform the cast. */
9010 /* Make a location:
9011 (TYPE) EXPR
9012 ^~~~~~~~~~~
9013 with start==caret at the open paren, extending to the
9014 end of "expr". */
9016 open_paren_loc,
9020 }
9021 }
9022 else
9024 }
9026 /* If we get here, then it's not a cast, so it must be a
9027 unary-expression. */
9030 }
9032 /* Parse a binary expression of the general form:
9034 pm-expression:
9035 cast-expression
9036 pm-expression .* cast-expression
9037 pm-expression ->* cast-expression
9039 multiplicative-expression:
9040 pm-expression
9041 multiplicative-expression * pm-expression
9042 multiplicative-expression / pm-expression
9043 multiplicative-expression % pm-expression
9045 additive-expression:
9046 multiplicative-expression
9047 additive-expression + multiplicative-expression
9048 additive-expression - multiplicative-expression
9050 shift-expression:
9051 additive-expression
9052 shift-expression << additive-expression
9053 shift-expression >> additive-expression
9055 relational-expression:
9056 shift-expression
9057 relational-expression < shift-expression
9058 relational-expression > shift-expression
9059 relational-expression <= shift-expression
9060 relational-expression >= shift-expression
9062 GNU Extension:
9064 relational-expression:
9065 relational-expression <? shift-expression
9066 relational-expression >? shift-expression
9068 equality-expression:
9069 relational-expression
9070 equality-expression == relational-expression
9071 equality-expression != relational-expression
9073 and-expression:
9074 equality-expression
9075 and-expression & equality-expression
9077 exclusive-or-expression:
9078 and-expression
9079 exclusive-or-expression ^ and-expression
9081 inclusive-or-expression:
9082 exclusive-or-expression
9083 inclusive-or-expression | exclusive-or-expression
9085 logical-and-expression:
9086 inclusive-or-expression
9087 logical-and-expression && inclusive-or-expression
9089 logical-or-expression:
9090 logical-and-expression
9091 logical-or-expression || logical-and-expression
9093 All these are implemented with a single function like:
9095 binary-expression:
9096 simple-cast-expression
9097 binary-expression <token> binary-expression
9099 CAST_P is true if this expression is the target of a cast.
9101 The binops_by_token map is used to get the tree codes for each <token> type.
9102 binary-expressions are associated according to a precedence table. */
9104 #define TOKEN_PRECEDENCE(token) \
9105 (((token->type == CPP_GREATER \
9106 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9107 && !parser->greater_than_is_operator_p) \
9108 ? PREC_NOT_OPERATOR \
9109 : binops_by_token[token->type].prec)
9111 static cp_expr
9117 {
9118 cp_parser_expression_stack stack;
9120 cp_parser_expression_stack_entry current;
9121 cp_expr rhs;
9125 tree overload;
9127 /* Parse the first expression. */
9138 {
9139 /* Get an operator token. */
9145 {
9147 "%<>>%> operator is treated"
9151 }
9156 /* This is a fold-expression; handle it later. */
9159 /* Popping an entry off the stack means we completed a subexpression:
9160 - either we found a token which is not an operator (`>' where it is not
9161 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9162 will happen repeatedly;
9163 - or, we found an operator which has lower priority. This is the case
9164 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9165 parsing `3 * 4'. */
9167 {
9170 else
9172 }
9174 get_rhs:
9178 /* We used the operator token. */
9181 /* For "false && x" or "true || x", x will never be executed;
9182 disable warnings while evaluating it. */
9184 c_inhibit_evaluation_warnings +=
9187 c_inhibit_evaluation_warnings +=
9190 /* Extract another operand. It may be the RHS of this expression
9191 or the LHS of a new, higher priority expression. */
9196 /* Get another operator token. Look up its precedence to avoid
9197 building a useless (immediately popped) stack entry for common
9198 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9205 {
9206 /* ... and prepare to parse the RHS of the new, higher priority
9207 expression. Since precedence levels on the stack are
9208 monotonically increasing, we do not have to care about
9209 stack overflows. */
9218 pop:
9220 /* If the stack is not empty, we have parsed into LHS the right side
9221 (`4' in the example above) of an expression we had suspended.
9222 We can use the information on the stack to recover the LHS (`3')
9223 from the stack together with the tree code (`MULT_EXPR'), and
9224 the precedence of the higher level subexpression
9225 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9226 which will be used to actually build the additive expression. */
9231 }
9233 /* Undo the disabling of warnings done above. */
9235 c_inhibit_evaluation_warnings -=
9238 c_inhibit_evaluation_warnings -=
9244 /* Avoid warning for !!x == y. */
9249 /* Avoid warning for !b == y where b is boolean. */
9253 /* Avoid warning for !!b == y where b is boolean. */
9266 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9267 ERROR_MARK for everything that is not a binary expression.
9268 This makes warn_about_parentheses miss some warnings that
9269 involve unary operators. For unary expressions we should
9270 pass the correct tree_code unless the unary expression was
9271 surrounded by parentheses.
9272 */
9279 == tcc_comparison
9282 else
9283 {
9288 /* TODO: build_x_binary_op doesn't always honor the location. */
9290 }
9293 /* If the binary operator required the use of an overloaded operator,
9294 then this expression cannot be an integral constant-expression.
9295 An overloaded operator can be used even if both operands are
9296 otherwise permissible in an integral constant-expression if at
9297 least one of the operands is of enumeration type. */
9301 NIC_OVERLOADED))
9303 }
9306 }
9308 static cp_expr
9313 {
9316 }
9318 /* Parse the `? expression : assignment-expression' part of a
9319 conditional-expression. The LOGICAL_OR_EXPR is the
9320 logical-or-expression that started the conditional-expression.
9321 Returns a representation of the entire conditional-expression.
9323 This routine is used by cp_parser_assignment_expression.
9325 ? expression : assignment-expression
9327 GNU Extensions:
9329 ? : assignment-expression */
9331 static tree
9333 {
9335 cp_expr assignment_expr;
9339 /* Consume the `?' token. */
9344 {
9347 /* Implicit true clause. */
9349 c_inhibit_evaluation_warnings +=
9352 }
9353 else
9354 {
9357 /* Parse the expression. */
9358 c_inhibit_evaluation_warnings +=
9361 c_inhibit_evaluation_warnings +=
9365 }
9367 /* The next token should be a `:'. */
9369 /* Parse the assignment-expression. */
9371 c_inhibit_evaluation_warnings -=
9374 /* Make a location:
9375 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9376 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9377 with the caret at the "?", ranging from the start of
9378 the logical_or_expr to the end of the assignment_expr. */
9383 /* Build the conditional-expression. */
9385 expr,
9386 assignment_expr,
9387 tf_warning_or_error);
9388 }
9390 /* Parse an assignment-expression.
9392 assignment-expression:
9393 conditional-expression
9394 logical-or-expression assignment-operator assignment_expression
9395 throw-expression
9397 CAST_P is true if this expression is the target of a cast.
9398 DECLTYPE_P is true if this expression is the operand of decltype.
9400 Returns a representation for the expression. */
9402 static cp_expr
9405 {
9406 cp_expr expr;
9408 /* If the next token is the `throw' keyword, then we're looking at
9409 a throw-expression. */
9412 /* Otherwise, it must be that we are looking at a
9413 logical-or-expression. */
9414 else
9415 {
9416 /* Parse the binary expressions (logical-or-expression). */
9418 decltype_p,
9420 /* If the next token is a `?' then we're actually looking at a
9421 conditional-expression. */
9424 else
9425 {
9428 /* If it's an assignment-operator, we're using the second
9429 production. */
9430 enum tree_code assignment_operator
9433 {
9436 /* Parse the right-hand side of the assignment. */
9443 /* An assignment may not appear in a
9444 constant-expression. */
9446 NIC_ASSIGNMENT))
9448 /* Build the assignment expression. Its default
9449 location:
9450 LHS = RHS
9451 ~~~~^~~~~
9452 is the location of the '=' token as the
9453 caret, ranging from the start of the lhs to the
9454 end of the rhs. */
9459 assignment_operator,
9460 rhs,
9462 /* TODO: build_x_modify_expr doesn't honor the location,
9463 so we must set it here. */
9465 }
9466 }
9467 }
9470 }
9472 /* Parse an (optional) assignment-operator.
9474 assignment-operator: one of
9475 = *= /= %= += -= >>= <<= &= ^= |=
9477 GNU Extension:
9479 assignment-operator: one of
9480 <?= >?=
9482 If the next token is an assignment operator, the corresponding tree
9483 code is returned, and the token is consumed. For example, for
9484 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9485 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9486 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9487 operator, ERROR_MARK is returned. */
9489 static enum tree_code
9491 {
9495 /* Peek at the next token. */
9499 {
9545 /* Nothing else is an assignment operator. */
9547 }
9549 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9554 /* If it was an assignment operator, consume it. */
9559 }
9561 /* Parse an expression.
9563 expression:
9564 assignment-expression
9565 expression , assignment-expression
9567 CAST_P is true if this expression is the target of a cast.
9568 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9569 except possibly parenthesized or on the RHS of a comma (N3276).
9571 Returns a representation of the expression. */
9573 static cp_expr
9576 {
9581 {
9582 cp_expr assignment_expression;
9584 /* Parse the next assignment-expression. */
9585 assignment_expression
9588 /* We don't create a temporary for a call that is the immediate operand
9589 of decltype or on the RHS of a comma. But when we see a comma, we
9590 need to create a temporary for a call on the LHS. */
9595 assignment_expression
9599 /* If this is the first assignment-expression, we can just
9600 save it away. */
9603 else
9604 {
9605 /* Create a location with caret at the comma, ranging
9606 from the start of the LHS to the end of the RHS. */
9611 assignment_expression,
9614 }
9615 /* If the next token is not a comma, or we're in a fold-expression, then
9616 we are done with the expression. */
9620 /* Consume the `,'. */
9623 /* A comma operator cannot appear in a constant-expression. */
9626 }
9629 }
9631 /* Parse a constant-expression.
9633 constant-expression:
9634 conditional-expression
9636 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9637 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9638 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9639 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9640 only parse a conditional-expression, otherwise parse an
9641 assignment-expression. See below for rationale. */
9643 static cp_expr
9648 {
9652 cp_expr expression;
9654 /* It might seem that we could simply parse the
9655 conditional-expression, and then check to see if it were
9656 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9657 one that the compiler can figure out is constant, possibly after
9658 doing some simplifications or optimizations. The standard has a
9659 precise definition of constant-expression, and we must honor
9660 that, even though it is somewhat more restrictive.
9662 For example:
9664 int i[(2, 3)];
9666 is not a legal declaration, because `(2, 3)' is not a
9667 constant-expression. The `,' operator is forbidden in a
9668 constant-expression. However, GCC's constant-folding machinery
9669 will fold this operation to an INTEGER_CST for `3'. */
9671 /* Save the old settings. */
9673 saved_allow_non_integral_constant_expression_p
9676 /* We are now parsing a constant-expression. */
9678 parser->allow_non_integral_constant_expression_p
9681 /* Although the grammar says "conditional-expression", when not STRICT_P,
9682 we parse an "assignment-expression", which also permits
9683 "throw-expression" and the use of assignment operators. In the case
9684 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9685 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9686 actually essential that we look for an assignment-expression.
9687 For example, cp_parser_initializer_clauses uses this function to
9688 determine whether a particular assignment-expression is in fact
9689 constant. */
9691 {
9692 /* Parse the binary expressions (logical-or-expression). */
9695 /* If the next token is a `?' then we're actually looking at
9696 a conditional-expression; otherwise we're done. */
9699 }
9700 else
9702 /* Restore the old settings. */
9703 parser->integral_constant_expression_p
9705 parser->allow_non_integral_constant_expression_p
9708 {
9709 /* Require an rvalue constant expression here; that's what our
9710 callers expect. Reference constant expressions are handled
9711 separately in e.g. cp_parser_template_argument. */
9720 }
9723 parser->non_integral_constant_expression_p
9727 }
9729 /* Parse __builtin_offsetof.
9731 offsetof-expression:
9732 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9734 offsetof-member-designator:
9735 id-expression
9736 | offsetof-member-designator "." id-expression
9737 | offsetof-member-designator "[" expression "]"
9738 | offsetof-member-designator "->" id-expression */
9740 static cp_expr
9742 {
9744 tree type;
9745 cp_expr expr;
9746 cp_id_kind dummy;
9748 location_t finish_loc;
9750 /* We're about to accept non-integral-constant things, but will
9751 definitely yield an integral constant expression. Save and
9752 restore these values around our local parsing. */
9758 /* Consume the "__builtin_offsetof" token. */
9760 /* Consume the opening `('. */
9761 matching_parens parens;
9763 /* Parse the type-id. */
9766 /* Look for the `,'. */
9770 /* Build the (type *)null that begins the traditional offsetof macro. */
9771 tree object_ptr
9773 tf_warning_or_error);
9775 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9779 {
9782 {
9784 /* offsetof-member-designator "[" expression "]" */
9790 /* offsetof-member-designator "->" identifier */
9793 /* FALLTHRU */
9796 /* offsetof-member-designator "." identifier */
9804 /* Consume the ")" token. */
9810 /* Error. We know the following require will fail, but
9811 that gives the proper error message. */
9816 }
9817 }
9819 success:
9820 /* Make a location of the form:
9821 __builtin_offsetof (struct s, f)
9822 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9823 with caret at the type-id, ranging from the start of the
9824 "_builtin_offsetof" token to the close paren. */
9826 /* The result will be an INTEGER_CST, so we need to explicitly
9827 preserve the location. */
9830 failure:
9835 }
9837 /* Parse a trait expression.
9839 Returns a representation of the expression, the underlying type
9840 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9842 static cp_expr
9844 {
9845 cp_trait_kind kind;
9851 {
9953 }
9955 /* Get location of initial token. */
9958 /* Consume the token. */
9961 matching_parens parens;
9964 {
9967 }
9973 {
9976 {
9979 }
9983 }
9985 {
9987 {
9991 {
9994 }
9998 }
9999 }
10004 /* Construct a location of the form:
10005 __is_trivially_copyable(_Tp)
10006 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10007 with start == caret, finishing at the close-paren. */
10010 /* Complete the trait expression, which may mean either processing
10011 the trait expr now or saving it for template instantiation. */
10013 {
10022 }
10023 }
10025 /* Parse a lambda expression.
10027 lambda-expression:
10028 lambda-introducer lambda-declarator [opt] compound-statement
10030 Returns a representation of the expression. */
10032 static cp_expr
10034 {
10036 tree type;
10044 {
10046 {
10050 }
10052 }
10054 {
10056 {
10059 }
10061 }
10063 /* We may be in the middle of deferred access check. Disable
10064 it now. */
10075 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10078 /* Now that we've started the type, add the capture fields for any
10079 explicit captures. */
10082 {
10083 /* Inside the class, surrounding template-parameter-lists do not apply. */
10084 unsigned int saved_num_template_parameter_lists
10088 bool fully_implicit_function_template_p
10092 bool auto_is_implicit_function_template_parm_p
10103 /* By virtue of defining a local class, a lambda expression has access to
10104 the private variables of enclosing classes. */
10112 {
10117 }
10119 {
10122 }
10124 /* The capture list was built up in reverse order; fix that now. */
10136 parser->fully_implicit_function_template_p
10140 parser->auto_is_implicit_function_template_parm_p
10142 }
10144 /* This field is only used during parsing of the lambda. */
10147 /* This lambda shouldn't have any proxies left at this point. */
10149 /* And now that we're done, push proxies for an enclosing lambda. */
10154 else
10162 }
10164 /* Parse the beginning of a lambda expression.
10166 lambda-introducer:
10167 [ lambda-capture [opt] ]
10169 LAMBDA_EXPR is the current representation of the lambda expression. */
10171 static void
10173 {
10174 /* Need commas after the first capture. */
10177 /* Eat the leading `['. */
10180 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10188 {
10191 }
10194 {
10196 tree capture_id;
10197 tree capture_init_expr;
10201 enum capture_kind_type
10202 {
10203 BY_COPY,
10204 BY_REFERENCE
10205 };
10209 {
10212 }
10216 else
10219 /* Possibly capture `this'. */
10221 {
10232 explicit_init_p);
10234 }
10236 /* Possibly capture `*this'. */
10239 {
10250 explicit_init_p);
10252 }
10254 /* Remember whether we want to capture as a reference or not. */
10256 {
10259 }
10261 /* Get the identifier. */
10266 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10267 delimiters, but I modified this to stop on unnested ']' as well. It
10268 was already changed to stop on unnested '}', so the
10269 "closing_parenthesis" name is no more misleading with my change. */
10270 {
10276 }
10278 /* Find the initializer for this capture. */
10282 {
10284 /* An explicit initializer exists. */
10287 "lambda capture initializers "
10293 {
10296 }
10297 }
10298 else
10299 {
10302 /* Turn the identifier into an id-expression. */
10303 capture_init_expr
10308 {
10311 }
10315 {
10318 capture_init_expr);
10322 }
10325 {
10328 capture_init_expr))
10332 }
10334 capture_init_expr
10335 = finish_id_expression
10337 capture_init_expr,
10351 {
10354 }
10355 else
10357 }
10361 {
10366 capture_id);
10370 "capture of %qD redundant with by-reference capture "
10372 }
10375 capture_id,
10376 capture_init_expr,
10378 explicit_init_p);
10379 }
10382 }
10384 /* Parse the (optional) middle of a lambda expression.
10386 lambda-declarator:
10387 < template-parameter-list [opt] >
10388 ( parameter-declaration-clause [opt] )
10389 attribute-specifier [opt]
10390 decl-specifier-seq [opt]
10391 exception-specification [opt]
10392 lambda-return-type-clause [opt]
10394 LAMBDA_EXPR is the current representation of the lambda expression. */
10396 static bool
10398 {
10399 /* 5.1.1.4 of the standard says:
10400 If a lambda-expression does not include a lambda-declarator, it is as if
10401 the lambda-declarator were ().
10402 This means an empty parameter list, no attributes, and no exception
10403 specification. */
10410 cp_decl_specifier_seq lambda_specs;
10413 /* The template-parameter-list is optional, but must begin with
10414 an opening angle if present. */
10416 {
10419 "lambda templates are only available with "
10423 "lambda templates are only available with "
10432 /* We just processed one more parameter list. */
10434 }
10436 /* The parameter-declaration-clause is optional (unless
10437 template-parameter-list was given), but must begin with an
10438 opening parenthesis if present. */
10440 {
10441 matching_parens parens;
10446 /* Parse parameters. */
10449 /* Default arguments shall not be specified in the
10450 parameter-declaration-clause of a lambda-declarator. */
10461 /* In the decl-specifier-seq of the lambda-declarator, each
10462 decl-specifier shall either be mutable or constexpr. */
10466 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10469 {
10474 }
10478 /* Parse optional exception specification. */
10481 /* Parse optional trailing return type. */
10483 {
10486 }
10488 /* The function parameters must be in scope all the way until after the
10489 trailing-return-type in case of decltype. */
10491 }
10495 /* Create the function call operator.
10497 Messing with declarators like this is no uglier than building up the
10498 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10499 other code. */
10500 {
10501 cp_decl_specifier_seq return_type_specs;
10503 tree fco;
10510 else
10511 /* Maybe we will deduce the return type later. */
10515 {
10519 else
10522 }
10531 VIRT_SPEC_UNSPECIFIED,
10532 REF_QUAL_NONE,
10533 tx_qual,
10534 exception_spec,
10540 declarator,
10541 attributes);
10543 {
10546 /* Give the object parameter a different name. */
10550 }
10552 {
10556 }
10565 }
10566 }
10568 /* Parse the body of a lambda expression, which is simply
10570 compound-statement
10572 but which requires special handling.
10573 LAMBDA_EXPR is the current representation of the lambda expression. */
10575 static void
10577 {
10583 else
10584 /* Still increment function_depth so that we don't GC in the
10585 middle of an expression. */
10589 /* Clear this in case we're in the middle of a default argument. */
10593 /* Finish the function call operator
10594 - class_specifier
10595 + late_parsing_for_member
10596 + function_definition_after_declarator
10597 + ctor_initializer_opt_and_function_body */
10598 {
10604 tree compound_stmt;
10606 matching_braces braces;
10612 /* 5.1.1.4 of the standard says:
10613 If a lambda-expression does not include a trailing-return-type, it
10614 is as if the trailing-return-type denotes the following type:
10615 * if the compound-statement is of the form
10616 { return attribute-specifier [opt] expression ; }
10617 the type of the returned expression after lvalue-to-rvalue
10618 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10619 (_conv.array_ 4.2), and function-to-pointer conversion
10620 (_conv.func_ 4.3);
10621 * otherwise, void. */
10623 /* In a lambda that has neither a lambda-return-type-clause
10624 nor a deducible form, errors should be reported for return statements
10625 in the body. Since we used void as the placeholder return type, parsing
10626 the body as usual will give such desired behavior. */
10630 {
10634 /* Parse tentatively in case there's more after the initial return
10635 statement. */
10646 {
10648 {
10653 }
10655 /* Will get error here if type not deduced yet. */
10659 }
10660 }
10663 {
10668 }
10672 out:
10674 }
10681 else
10683 }
10685 /* Statements [gram.stmt.stmt] */
10687 /* Parse a statement.
10689 statement:
10690 labeled-statement
10691 expression-statement
10692 compound-statement
10693 selection-statement
10694 iteration-statement
10695 jump-statement
10696 declaration-statement
10697 try-block
10699 C++11:
10701 statement:
10702 labeled-statement
10703 attribute-specifier-seq (opt) expression-statement
10704 attribute-specifier-seq (opt) compound-statement
10705 attribute-specifier-seq (opt) selection-statement
10706 attribute-specifier-seq (opt) iteration-statement
10707 attribute-specifier-seq (opt) jump-statement
10708 declaration-statement
10709 attribute-specifier-seq (opt) try-block
10711 init-statement:
10712 expression-statement
10713 simple-declaration
10715 TM Extension:
10717 statement:
10718 atomic-statement
10720 IN_COMPOUND is true when the statement is nested inside a
10721 cp_parser_compound_statement; this matters for certain pragmas.
10723 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10724 is a (possibly labeled) if statement which is not enclosed in braces
10725 and has an else clause. This is used to implement -Wparentheses.
10727 CHAIN is a vector of if-else-if conditions. */
10729 static void
10733 {
10738 restart:
10741 /* There is no statement yet. */
10747 /* In obj-c++, seeing '[[' might be the either the beginning of
10748 c++11 attributes, or a nested objc-message-expression. So
10749 let's parse the c++11 attributes tentatively. */
10753 {
10756 }
10758 /* Peek at the next token. */
10760 /* Remember the location of the first token in the statement. */
10762 /* If this is a keyword, then that will often determine what kind of
10763 statement we have. */
10765 {
10769 {
10772 /* Looks like a labeled-statement with a case label.
10773 Parse the label, and then use tail recursion to parse
10774 the statement. */
10797 /* Objective-C++ exception-handling constructs. */
10811 /* This must be a namespace alias definition. */
10827 /* It might be a keyword like `int' that can start a
10828 declaration-statement. */
10830 }
10831 }
10833 {
10834 /* If the next token is a `:', then we are looking at a
10835 labeled-statement. */
10838 {
10839 /* Looks like a labeled-statement with an ordinary label.
10840 Parse the label, and then use tail recursion to parse
10841 the statement. */
10846 }
10847 }
10848 /* Anything that starts with a `{' must be a compound-statement. */
10851 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10852 a statement all its own. */
10854 {
10855 /* Only certain OpenMP pragmas are attached to statements, and thus
10856 are considered statements themselves. All others are not. In
10857 the context of a compound, accept the pragma as a "statement" and
10858 return so that we can check for a close brace. Otherwise we
10859 require a real statement and must go back and read one. */
10865 }
10867 {
10870 }
10872 /* Everything else must be a declaration-statement or an
10873 expression-statement. Try for the declaration-statement
10874 first, unless we are looking at a `;', in which case we know that
10875 we have an expression-statement. */
10877 {
10879 {
10881 {
10882 /* Attributes should be parsed as part of the the
10883 declaration, so let's un-parse them. */
10886 }
10889 /* Try to parse the declaration-statement. */
10891 /* If that worked, we're done. */
10894 }
10895 /* All preceding labels have been parsed at this point. */
10899 /* Look for an expression-statement instead. */
10902 /* Handle [[fallthrough]];. */
10904 {
10905 /* The next token after the fallthrough attribute is ';'. */
10907 {
10908 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10910 IFN_FALLTHROUGH,
10913 }
10914 else
10918 }
10919 }
10921 /* Set the line number for the statement. */
10925 /* Allow "[[fallthrough]];", but warn otherwise. */
10928 OPT_Wattributes,
10930 }
10932 /* Parse the label for a labeled-statement, i.e.
10934 identifier :
10935 case constant-expression :
10936 default :
10938 GNU Extension:
10939 case constant-expression ... constant-expression : statement
10941 When a label is parsed without errors, the label is added to the
10942 parse tree by the finish_* functions, so this function doesn't
10943 have to return the label. */
10945 static void
10947 {
10952 /* The next token should be an identifier. */
10956 {
10959 }
10961 /* Remember whether this case or a user-defined label is allowed to fall
10962 through to. */
10967 {
10969 {
10973 /* Consume the `case' token. */
10975 /* Parse the constant-expression. */
10982 {
10983 /* Consume the `...' token. */
10989 /* We don't need to emit warnings here, as the common code
10990 will do this for us. */
10991 }
10992 else
10996 {
11000 }
11001 else
11004 expr);
11005 }
11009 /* Consume the `default' token. */
11013 {
11017 }
11018 else
11023 /* Anything else must be an ordinary label. */
11028 }
11030 /* Require the `:' token. */
11033 /* An ordinary label may optionally be followed by attributes.
11034 However, this is only permitted if the attributes are then
11035 followed by a semicolon. This is because, for backward
11036 compatibility, when parsing
11037 lab: __attribute__ ((unused)) int i;
11038 we want the attribute to attach to "i", not "lab". */
11041 {
11042 tree attrs;
11049 ;
11050 else
11052 }
11058 }
11060 /* Parse an expression-statement.
11062 expression-statement:
11063 expression [opt] ;
11065 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11066 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11067 indicates whether this expression-statement is part of an
11068 expression statement. */
11070 static tree
11072 {
11077 /* There might be attribute fallthrough. */
11080 /* If the next token is a ';', then there is no expression
11081 statement. */
11083 {
11087 {
11090 }
11091 }
11093 /* Handle [[fallthrough]];. */
11095 {
11096 /* The next token after the fallthrough attribute is ';'. */
11098 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11101 else
11105 }
11107 /* Allow "[[fallthrough]];", but warn otherwise. */
11112 /* Give a helpful message for "A<T>::type t;" and the like. */
11115 {
11122 {
11123 /* A::A a; */
11128 }
11129 }
11131 /* Consume the final `;'. */
11136 /* This is the final expression statement of a statement
11137 expression. */
11143 }
11145 /* Parse a compound-statement.
11147 compound-statement:
11148 { statement-seq [opt] }
11150 GNU extension:
11152 compound-statement:
11153 { label-declaration-seq [opt] statement-seq [opt] }
11155 label-declaration-seq:
11156 label-declaration
11157 label-declaration-seq label-declaration
11159 Returns a tree representing the statement. */
11161 static tree
11164 {
11165 tree compound_stmt;
11166 matching_braces braces;
11168 /* Consume the `{'. */
11175 /* Begin the compound-statement. */
11177 /* If the next keyword is `__label__' we have a label declaration. */
11180 /* Parse an (optional) statement-seq. */
11182 /* Finish the compound-statement. */
11184 /* Consume the `}'. */
11188 }
11190 /* Parse an (optional) statement-seq.
11192 statement-seq:
11193 statement
11194 statement-seq [opt] statement */
11196 static void
11198 {
11199 /* Scan statements until there aren't any more. */
11201 {
11204 /* If we are looking at a `}', then we have run out of
11205 statements; the same is true if we have reached the end
11206 of file, or have stumbled upon a stray '@end'. */
11213 /* If we are in a compound statement and find 'else' then
11214 something went wrong. */
11216 {
11219 else
11220 {
11223 }
11224 }
11226 /* Parse the statement. */
11228 }
11229 }
11231 /* Return true if we're looking at (init; cond), false otherwise. */
11233 static bool
11235 {
11236 /* Save tokens so that we can put them back. */
11239 /* Look for ';' that is not nested in () or {}. */
11242 CPP_SEMICOLON,
11245 /* Roll back the tokens we skipped. */
11249 }
11251 /* Parse a selection-statement.
11253 selection-statement:
11254 if ( init-statement [opt] condition ) statement
11255 if ( init-statement [opt] condition ) statement else statement
11256 switch ( init-statement [opt] condition ) statement
11258 Returns the new IF_STMT or SWITCH_STMT.
11260 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11261 is a (possibly labeled) if statement which is not enclosed in
11262 braces and has an else clause. This is used to implement
11263 -Wparentheses.
11265 CHAIN is a vector of if-else-if conditions. This is used to implement
11266 -Wduplicated-cond. */
11268 static tree
11271 {
11274 token_indent_info guard_tinfo;
11279 /* Peek at the next token. */
11283 /* See what kind of keyword it is. */
11286 {
11289 {
11290 tree statement;
11291 tree condition;
11296 RID_CONSTEXPR))
11297 {
11303 }
11305 /* Look for the `('. */
11306 matching_parens parens;
11308 {
11311 }
11313 /* Begin the selection-statement. */
11315 {
11318 }
11319 else
11322 /* Parse the optional init-statement. */
11324 {
11325 tree decl;
11328 "init-statement in selection statements only available "
11331 }
11333 /* Parse the condition. */
11335 /* Look for the `)'. */
11341 {
11345 /* Add the condition. */
11352 /* Parse the then-clause. */
11356 /* Outside a template, the non-selected branch of a constexpr
11357 if is a 'discarded statement', i.e. unevaluated. */
11362 {
11365 }
11368 guard_tinfo);
11375 {
11379 }
11381 /* If the next token is `else', parse the else-clause. */
11383 RID_ELSE))
11384 {
11388 {
11391 }
11393 guard_tinfo
11395 /* Consume the `else' keyword. */
11398 {
11400 RID_IF)
11402 {
11403 /* We've got "if (COND) else if (COND2)". Start
11404 the condition chain and add COND as the first
11405 element. */
11409 {
11410 /* Wrap it in a NOP_EXPR so that we can set the
11411 location of the condition. */
11413 condition);
11416 }
11417 }
11419 RID_IF))
11420 {
11421 /* This is if-else without subsequent if. Zap the
11422 condition chain; we would have already warned at
11423 this point. */
11426 }
11427 }
11429 /* Parse the else-clause. */
11435 /* If we are currently parsing a then-clause, then
11436 IF_P will not be NULL. We set it to true to
11437 indicate that this if statement has an else clause.
11438 This may trigger the Wparentheses warning below
11439 when we get back up to the parent if statement. */
11444 {
11448 }
11449 }
11450 else
11451 {
11452 /* This if statement does not have an else clause. If
11453 NESTED_IF is true, then the then-clause has an if
11454 statement which does have an else clause. We warn
11455 about the potential ambiguity. */
11458 "suggest explicit braces to avoid ambiguous"
11461 {
11462 /* We don't need the condition chain anymore. */
11465 }
11466 }
11468 /* Now we're all done with the if-statement. */
11470 }
11471 else
11472 {
11476 /* Add the condition. */
11479 /* Parse the body of the switch-statement. */
11485 guard_tinfo);
11489 /* Now we're all done with the switch-statement. */
11491 }
11494 }
11500 }
11501 }
11503 /* Parse a condition.
11505 condition:
11506 expression
11507 type-specifier-seq declarator = initializer-clause
11508 type-specifier-seq declarator braced-init-list
11510 GNU Extension:
11512 condition:
11513 type-specifier-seq declarator asm-specification [opt]
11514 attributes [opt] = assignment-expression
11516 Returns the expression that should be tested. */
11518 static tree
11520 {
11521 cp_decl_specifier_seq type_specifiers;
11525 /* Try the declaration first. */
11527 /* New types are not allowed in the type-specifier-seq for a
11528 condition. */
11530 parser->type_definition_forbidden_message
11532 /* Parse the type-specifier-seq. */
11534 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11537 /* Restore the saved message. */
11539 /* If all is well, we might be looking at a declaration. */
11541 {
11542 tree decl;
11543 tree asm_specification;
11544 tree attributes;
11548 /* Parse the declarator. */
11554 /* Parse the attributes. */
11556 /* Parse the asm-specification. */
11558 /* If the next token is not an `=' or '{', then we might still be
11559 looking at an expression. For example:
11561 if (A(a).x)
11563 looks like a decl-specifier-seq and a declarator -- but then
11564 there is no `=', so this is an expression. */
11569 /* If we did see an `=' or '{', then we are looking at a declaration
11570 for sure. */
11572 {
11573 tree pushed_scope;
11577 /* Create the declaration. */
11583 /* Parse the initializer. */
11585 {
11589 }
11590 else
11591 {
11592 /* Consume the `='. */
11595 }
11599 /* Process the initializer. */
11602 asm_specification,
11603 flags);
11609 }
11610 }
11611 /* If we didn't even get past the declarator successfully, we are
11612 definitely not looking at a declaration. */
11613 else
11616 /* Otherwise, we are looking at an expression. */
11618 }
11620 /* Parses a for-statement or range-for-statement until the closing ')',
11621 not included. */
11623 static tree
11625 {
11629 /* Begin the for-statement. */
11632 /* Parse the initialization. */
11637 else
11639 }
11641 static tree
11643 {
11644 /* Normal for loop */
11647 tree stmt;
11650 /* The init-statement has already been parsed in
11651 cp_parser_init_statement, so no work is needed here. */
11654 /* If there's a condition, process it. */
11658 {
11662 }
11664 /* Look for the `;'. */
11667 /* If there's an expression, process it. */
11673 }
11675 /* Tries to parse a range-based for-statement:
11677 range-based-for:
11678 decl-specifier-seq declarator : expression
11680 The decl-specifier-seq declarator and the `:' are already parsed by
11681 cp_parser_init_statement. If processing_template_decl it returns a
11682 newly created RANGE_FOR_STMT; if not, it is converted to a
11683 regular FOR_STMT. */
11685 static tree
11688 {
11695 /* Get the range declaration momentarily out of the way so that
11696 the range expression doesn't clash with it. */
11698 {
11700 {
11702 /* For decomposition declaration get all of the corresponding
11703 declarations out of the way. */
11707 {
11713 {
11719 }
11720 }
11721 }
11723 {
11728 }
11729 }
11732 {
11735 }
11736 else
11739 /* Put the range declaration(s) back into scope. */
11741 {
11745 }
11747 /* If in template, STMT is converted to a normal for-statement
11748 at instantiation. If not, it is done just ahead. */
11750 {
11758 /* do_auto_deduction doesn't mess with template init-lists. */
11761 }
11762 else
11763 {
11767 }
11769 }
11771 /* Subroutine of cp_convert_range_for: given the initializer expression,
11772 builds up the range temporary. */
11774 static tree
11776 {
11779 /* Find out the type deduced by the declaration
11780 `auto &&__range = range_expr'. */
11785 /* Create the __range variable. */
11792 }
11794 /* Used by cp_parser_range_for in template context: we aren't going to
11795 do a full conversion yet, but we still need to resolve auto in the
11796 type of the for-range-declaration if present. This is basically
11797 a shortcut version of cp_convert_range_for. */
11799 static void
11801 {
11804 {
11807 iter_type = (cp_parser_perform_range_for_lookup
11810 {
11812 iter_type);
11814 RO_UNARY_STAR,
11815 tf_warning_or_error);
11818 }
11819 }
11820 }
11822 /* Converts a range-based for-statement into a normal
11823 for-statement, as per the definition.
11825 for (RANGE_DECL : RANGE_EXPR)
11826 BLOCK
11828 should be equivalent to:
11830 {
11831 auto &&__range = RANGE_EXPR;
11832 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11833 __begin != __end;
11834 ++__begin)
11835 {
11836 RANGE_DECL = *__begin;
11837 BLOCK
11838 }
11839 }
11841 If RANGE_EXPR is an array:
11842 BEGIN_EXPR = __range
11843 END_EXPR = __range + ARRAY_SIZE(__range)
11844 Else if RANGE_EXPR has a member 'begin' or 'end':
11845 BEGIN_EXPR = __range.begin()
11846 END_EXPR = __range.end()
11847 Else:
11848 BEGIN_EXPR = begin(__range)
11849 END_EXPR = end(__range);
11851 If __range has a member 'begin' but not 'end', or vice versa, we must
11852 still use the second alternative (it will surely fail, however).
11853 When calling begin()/end() in the third alternative we must use
11854 argument dependent lookup, but always considering 'std' as an associated
11855 namespace. */
11857 tree
11861 {
11869 /* If an error happened previously do nothing or else a lot of
11870 unhelpful errors would be issued. */
11872 else
11873 {
11874 tree range_temp;
11878 /* Can't bind a reference to an array of runtime bound. */
11880 else
11881 {
11886 LOOKUP_ONLYCONVERTING);
11888 }
11891 }
11893 /* The new for initialization statement. */
11901 LOOKUP_ONLYCONVERTING);
11912 LOOKUP_ONLYCONVERTING);
11916 /* The new for condition. */
11923 /* The new increment expression. */
11926 tf_warning_or_error);
11929 /* The declaration is initialized with *__begin inside the loop body. */
11932 tf_warning_or_error),
11934 LOOKUP_ONLYCONVERTING);
11939 }
11941 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11942 We need to solve both at the same time because the method used
11943 depends on the existence of members begin or end.
11944 Returns the type deduced for the iterator expression. */
11946 static tree
11948 {
11950 {
11953 }
11956 {
11961 }
11963 {
11964 /* If RANGE is an array, we will use pointer arithmetic. */
11967 range,
11971 }
11972 else
11973 {
11974 /* If it is not an array, we must do a bit of magic. */
11984 tf_warning_or_error);
11987 tf_warning_or_error);
11990 {
11991 /* Use the member functions. */
11994 else
12000 else
12003 }
12004 else
12005 {
12006 /* Use global functions with ADL. */
12013 tf_warning_or_error);
12015 tf_warning_or_error);
12017 tf_warning_or_error);
12019 tf_warning_or_error);
12022 }
12024 /* Last common checks. */
12026 {
12027 /* If one of the expressions is an error do no more checks. */
12030 }
12033 /* Can happen, when, eg, in a template context, Koenig lookup
12034 can't resolve begin/end (c++/58503). */
12036 else
12037 {
12039 /* The unqualified type of the __begin and __end temporaries should
12040 be the same, as required by the multiple auto declaration. */
12042 {
12049 /* P0184R0 allows __begin and __end to have different types,
12050 but make sure they are comparable so we can give a better
12052 else
12056 }
12058 }
12059 }
12060 }
12062 /* Helper function for cp_parser_perform_range_for_lookup.
12063 Builds a tree for RANGE.IDENTIFIER(). */
12065 static tree
12067 {
12080 tf_warning_or_error);
12083 }
12085 /* Parse an iteration-statement.
12087 iteration-statement:
12088 while ( condition ) statement
12089 do statement while ( expression ) ;
12090 for ( init-statement condition [opt] ; expression [opt] )
12091 statement
12093 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12095 static tree
12097 {
12100 tree statement;
12102 token_indent_info guard_tinfo;
12104 /* Peek at the next token. */
12111 /* Remember whether or not we are already within an iteration
12112 statement. */
12115 /* See what kind of keyword it is. */
12118 {
12120 {
12121 tree condition;
12123 /* Begin the while-statement. */
12125 /* Look for the `('. */
12126 matching_parens parens;
12128 /* Parse the condition. */
12131 /* Look for the `)'. */
12133 /* Parse the dependent statement. */
12139 /* We're done with the while-statement. */
12141 }
12145 {
12146 tree expression;
12148 /* Begin the do-statement. */
12150 /* Parse the body of the do-statement. */
12157 /* Look for the `while' keyword. */
12159 /* Look for the `('. */
12160 matching_parens parens;
12162 /* Parse the expression. */
12164 /* We're done with the do-statement. */
12166 /* Look for the `)'. */
12168 /* Look for the `;'. */
12170 }
12174 {
12175 /* Look for the `('. */
12176 matching_parens parens;
12181 /* Look for the `)'. */
12184 /* Parse the body of the for-statement. */
12191 /* We're done with the for-statement. */
12193 }
12200 }
12203 }
12205 /* Parse a init-statement or the declarator of a range-based-for.
12206 Returns true if a range-based-for declaration is seen.
12208 init-statement:
12209 expression-statement
12210 simple-declaration */
12212 static bool
12214 {
12215 /* If the next token is a `;', then we have an empty
12216 expression-statement. Grammatically, this is also a
12217 simple-declaration, but an invalid one, because it does not
12218 declare anything. Therefore, if we did not handle this case
12219 specially, we would issue an error message about an invalid
12220 declaration. */
12222 {
12226 /* A colon is used in range-based for. */
12229 /* We're going to speculatively look for a declaration, falling back
12230 to an expression, if necessary. */
12232 /* Parse the declaration. */
12235 decl);
12238 {
12239 /* It is a range-for, consume the ':' */
12243 {
12245 "range-based %<for%> loops only available with "
12248 }
12249 }
12250 else
12251 /* The ';' is not consumed yet because we told
12252 cp_parser_simple_declaration not to. */
12257 /* If the tentative parse failed, then we shall need to look for an
12258 expression-statement. */
12259 }
12260 /* If we are here, it is an expression-statement. */
12263 }
12265 /* Parse a jump-statement.
12267 jump-statement:
12268 break ;
12269 continue ;
12270 return expression [opt] ;
12271 return braced-init-list ;
12272 goto identifier ;
12274 GNU extension:
12276 jump-statement:
12277 goto * expression ;
12279 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12281 static tree
12283 {
12289 /* Peek at the next token. */
12294 /* See what kind of keyword it is. */
12297 {
12301 {
12318 }
12324 {
12328 /* Fall through. */
12338 }
12343 {
12344 tree expr;
12348 {
12352 }
12355 else
12356 /* If the next token is a `;', then there is no
12357 expression. */
12359 /* Build the return-statement. */
12362 else
12364 /* Look for the final `;'. */
12366 }
12372 {
12375 }
12377 /* Create the goto-statement. */
12379 {
12380 /* Issue a warning about this use of a GNU extension. */
12382 /* Consume the '*' token. */
12384 /* Parse the dependent expression. */
12386 }
12387 else
12389 /* Look for the final `;'. */
12396 }
12399 }
12401 /* Parse a declaration-statement.
12403 declaration-statement:
12404 block-declaration */
12406 static void
12408 {
12411 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12414 /* Parse the block-declaration. */
12417 /* Free any declarators allocated. */
12419 }
12421 /* Some dependent statements (like `if (cond) statement'), are
12422 implicitly in their own scope. In other words, if the statement is
12423 a single statement (as opposed to a compound-statement), it is
12424 none-the-less treated as if it were enclosed in braces. Any
12425 declarations appearing in the dependent statement are out of scope
12426 after control passes that point. This function parses a statement,
12427 but ensures that is in its own scope, even if it is not a
12428 compound-statement.
12430 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12431 is a (possibly labeled) if statement which is not enclosed in
12432 braces and has an else clause. This is used to implement
12433 -Wparentheses.
12435 CHAIN is a vector of if-else-if conditions. This is used to implement
12436 -Wduplicated-cond.
12438 Returns the new statement. */
12440 static tree
12444 {
12445 tree statement;
12448 token_indent_info body_tinfo
12454 /* Mark if () ; with a special NOP_EXPR. */
12456 {
12467 }
12468 /* if a compound is opened, we simply parse the statement directly. */
12471 /* If the token is not a `{', then we must take special action. */
12472 else
12473 {
12474 /* Create a compound-statement. */
12476 /* Parse the dependent-statement. */
12479 /* Finish the dummy compound-statement. */
12481 }
12483 token_indent_info next_tinfo
12492 /* Return the statement. */
12494 }
12496 /* For some dependent statements (like `while (cond) statement'), we
12497 have already created a scope. Therefore, even if the dependent
12498 statement is a compound-statement, we do not want to create another
12499 scope. */
12501 static void
12504 {
12505 /* If the token is a `{', then we must take special action. */
12507 {
12508 token_indent_info body_tinfo
12514 token_indent_info next_tinfo
12523 }
12524 else
12525 {
12526 /* Avoid calling cp_parser_compound_statement, so that we
12527 don't create a new scope. Do everything else by hand. */
12528 matching_braces braces;
12530 /* If the next keyword is `__label__' we have a label declaration. */
12533 /* Parse an (optional) statement-seq. */
12536 }
12537 }
12539 /* Declarations [gram.dcl.dcl] */
12541 /* Parse an optional declaration-sequence.
12543 declaration-seq:
12544 declaration
12545 declaration-seq declaration */
12547 static void
12549 {
12551 {
12562 {
12563 /* A declaration consisting of a single semicolon is
12564 invalid. Allow it unless we're being pedantic. */
12569 }
12571 /* If we're entering or exiting a region that's implicitly
12572 extern "C", modify the lang context appropriately. */
12574 {
12577 }
12579 {
12582 }
12585 {
12586 /* A top-level declaration can consist solely of a #pragma.
12587 A nested declaration cannot, so this is done here and not
12588 in cp_parser_declaration. (A #pragma at block scope is
12589 handled in cp_parser_statement.) */
12592 }
12594 /* Parse the declaration itself. */
12596 }
12597 }
12599 /* Parse a declaration.
12601 declaration:
12602 block-declaration
12603 function-definition
12604 template-declaration
12605 explicit-instantiation
12606 explicit-specialization
12607 linkage-specification
12608 namespace-definition
12610 C++17:
12611 deduction-guide
12613 GNU extension:
12615 declaration:
12616 __extension__ declaration */
12618 static void
12620 {
12621 cp_token token1;
12622 cp_token token2;
12627 /* Check for the `__extension__' keyword. */
12629 {
12630 /* Parse the qualified declaration. */
12632 /* Restore the PEDANTIC flag. */
12636 }
12638 /* Try to figure out what kind of declaration is present. */
12643 else
12644 {
12647 }
12649 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12652 /* If the next token is `extern' and the following token is a string
12653 literal, then we have a linkage specification. */
12657 /* If the next token is `template', then we have either a template
12658 declaration, an explicit instantiation, or an explicit
12659 specialization. */
12661 {
12662 /* `template <>' indicates a template specialization. */
12666 /* `template <' indicates a template declaration. */
12669 /* Anything else must be an explicit instantiation. */
12670 else
12672 }
12673 /* If the next token is `export', then we have a template
12674 declaration. */
12677 /* If the next token is `extern', 'static' or 'inline' and the one
12678 after that is `template', we have a GNU extended explicit
12679 instantiation directive. */
12686 /* If the next token is `namespace', check for a named or unnamed
12687 namespace definition. */
12696 /* An unnamed namespace definition. */
12700 /* An inline (associated) namespace definition. */
12704 /* Objective-C++ declaration/definition. */
12711 /* At this point we may have a template declared by a concept
12712 introduction. */
12717 else
12718 /* Try to parse a block-declaration, or a function-definition. */
12721 /* Free any declarators allocated. */
12723 }
12725 /* Parse a block-declaration.
12727 block-declaration:
12728 simple-declaration
12729 asm-definition
12730 namespace-alias-definition
12731 using-declaration
12732 using-directive
12734 GNU Extension:
12736 block-declaration:
12737 __extension__ block-declaration
12739 C++0x Extension:
12741 block-declaration:
12742 static_assert-declaration
12744 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12745 part of a declaration-statement. */
12747 static void
12750 {
12754 /* Check for the `__extension__' keyword. */
12756 {
12757 /* Parse the qualified declaration. */
12759 /* Restore the PEDANTIC flag. */
12763 }
12765 /* Peek at the next token to figure out which kind of declaration is
12766 present. */
12769 /* If the next keyword is `asm', we have an asm-definition. */
12771 {
12775 }
12776 /* If the next keyword is `namespace', we have a
12777 namespace-alias-definition. */
12780 /* If the next keyword is `using', we have a
12781 using-declaration, a using-directive, or an alias-declaration. */
12783 {
12788 /* If the token after `using' is `namespace', then we have a
12789 using-directive. */
12793 /* If the second token after 'using' is '=', then we have an
12794 alias-declaration. */
12800 /* Otherwise, it's a using-declaration. */
12801 else
12804 }
12805 /* If the next keyword is `__label__' we have a misplaced label
12806 declaration. */
12808 {
12812 /* If the next token is now a `;', consume it. */
12815 }
12816 /* If the next token is `static_assert' we have a static assertion. */
12819 /* Anything else must be a simple-declaration. */
12820 else
12823 }
12825 /* Parse a simple-declaration.
12827 simple-declaration:
12828 decl-specifier-seq [opt] init-declarator-list [opt] ;
12829 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12830 brace-or-equal-initializer ;
12832 init-declarator-list:
12833 init-declarator
12834 init-declarator-list , init-declarator
12836 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12837 function-definition as a simple-declaration.
12839 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12840 parsed declaration if it is an uninitialized single declarator not followed
12841 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12842 if present, will not be consumed. */
12844 static void
12848 {
12849 cp_decl_specifier_seq decl_specifiers;
12858 /* Defer access checks until we know what is being declared; the
12859 checks for names appearing in the decl-specifier-seq should be
12860 done as if we were in the scope of the thing being declared. */
12863 /* Parse the decl-specifier-seq. We have to keep track of whether
12864 or not the decl-specifier-seq declares a named class or
12865 enumeration type, since that is the only case in which the
12866 init-declarator-list is allowed to be empty.
12868 [dcl.dcl]
12870 In a simple-declaration, the optional init-declarator-list can be
12871 omitted only when declaring a class or enumeration, that is when
12872 the decl-specifier-seq contains either a class-specifier, an
12873 elaborated-type-specifier, or an enum-specifier. */
12875 CP_PARSER_FLAGS_OPTIONAL,
12878 /* We no longer need to defer access checks. */
12881 /* In a block scope, a valid declaration must always have a
12882 decl-specifier-seq. By not trying to parse declarators, we can
12883 resolve the declaration/expression ambiguity more quickly. */
12886 {
12889 }
12891 /* If the next two tokens are both identifiers, the code is
12892 erroneous. The usual cause of this situation is code like:
12894 T t;
12896 where "T" should name a type -- but does not. */
12899 {
12900 /* If parsing tentatively, we should commit; we really are
12901 looking at a declaration. */
12903 /* Give up. */
12905 }
12907 /* If we have seen at least one decl-specifier, and the next token
12908 is not a parenthesis, then we must be looking at a declaration.
12909 (After "int (" we might be looking at a functional cast.) */
12916 /* Look for C++17 decomposition declaration. */
12924 {
12925 tree decl
12927 maybe_range_for_decl,
12930 /* The next token should be either a `,' or a `;'. */
12932 /* If it's a `;', we are done. */
12935 /* Anything else is an error. */
12936 else
12937 {
12938 /* If we have already issued an error message we don't need
12939 to issue another one. */
12944 /* Skip tokens until we reach the end of the statement. */
12946 /* If the next token is now a `;', consume it. */
12950 }
12951 }
12952 else
12955 tree last_type;
12957 /* NULL_TREE if both variable and function declaration are allowed,
12958 error_mark_node if function declaration are not allowed and
12959 a FUNCTION_DECL that should be diagnosed if it is followed by
12960 variable declarations. */
12961 tree auto_function_declaration;
12964 auto_specifier_p
12968 /* Keep going until we hit the `;' at the end of the simple
12969 declaration. */
12972 CPP_SEMICOLON))
12973 {
12976 tree decl;
12980 {
12981 /* If we are processing next declarator, comma is expected */
12986 {
12990 }
12991 }
12992 else
12995 /* Parse the init-declarator. */
12998 function_definition_allowed_p,
13000 declares_class_or_enum,
13002 maybe_range_for_decl,
13005 /* If an error occurred while parsing tentatively, exit quickly.
13006 (That usually happens when in the body of a function; each
13007 statement is treated as a declaration-statement until proven
13008 otherwise.) */
13013 {
13014 /* If the init-declarator-list contains more than one
13015 init-declarator, they shall all form declarations of
13016 variables. */
13018 auto_function_declaration
13022 {
13024 "non-variable %qD in declaration with more than one "
13029 }
13030 }
13034 {
13038 {
13039 /* If the list of declarators contains more than one declarator,
13040 the type of each declared variable is determined as described
13041 above. If the type deduced for the template parameter U is not
13042 the same in each deduction, the program is ill-formed. */
13047 }
13048 else
13050 }
13052 /* Handle function definitions specially. */
13054 {
13055 /* If the next token is a `,', then we are probably
13056 processing something like:
13058 void f() {}, *p;
13060 which is erroneous. */
13062 {
13065 "mixing"
13067 }
13068 /* Otherwise, we're done with the list of declarators. */
13069 else
13070 {
13073 }
13074 }
13077 /* The next token should be either a `,' or a `;'. */
13079 /* If it's a `,', there are more declarators to come. */
13082 /* If it's a `;', we are done. */
13086 {
13091 }
13092 /* Anything else is an error. */
13093 else
13094 {
13095 /* If we have already issued an error message we don't need
13096 to issue another one. */
13101 /* Skip tokens until we reach the end of the statement. */
13103 /* If the next token is now a `;', consume it. */
13107 }
13108 /* After the first time around, a function-definition is not
13109 allowed -- even if it was OK at first. For example:
13111 int i, f() {}
13113 is not valid. */
13115 }
13117 /* Issue an error message if no declarators are present, and the
13118 decl-specifier-seq does not itself declare a class or
13119 enumeration: [dcl.dcl]/3. */
13121 {
13123 {
13127 /* Ensure an error is issued anyway when finish_decltype_type,
13128 called via cp_parser_decl_specifier_seq, returns a class or
13129 an enumeration (c++/51786). */
13132 }
13133 /* Perform any deferred access checks. */
13135 }
13137 /* Consume the `;'. */
13138 finish:
13142 {
13148 }
13150 done:
13152 }
13154 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13155 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13156 initializer ; */
13158 static tree
13163 {
13168 /* Parse the identifier-list. */
13172 {
13180 }
13184 {
13190 else
13191 {
13194 }
13195 }
13201 tree pushed_scope;
13208 NULL_TREE);
13215 cp_expr e;
13216 cp_decl_specifier_seq decl_specs;
13221 {
13224 else
13227 tree elt_pushed_scope;
13233 {
13234 /* Ensure we've diagnosed redeclaration if we aren't creating
13235 a new VAR_DECL. */
13238 }
13239 else
13243 }
13246 {
13249 }
13253 {
13261 || (is_direct_init
13264 {
13268 }
13271 {
13275 }
13276 }
13278 {
13280 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13281 the underlying DECL. */
13283 }
13289 {
13292 }
13295 }
13297 /* Parse a decl-specifier-seq.
13299 decl-specifier-seq:
13300 decl-specifier-seq [opt] decl-specifier
13301 decl-specifier attribute-specifier-seq [opt] (C++11)
13303 decl-specifier:
13304 storage-class-specifier
13305 type-specifier
13306 function-specifier
13307 friend
13308 typedef
13310 GNU Extension:
13312 decl-specifier:
13313 attributes
13315 Concepts Extension:
13317 decl-specifier:
13318 concept
13320 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13322 The parser flags FLAGS is used to control type-specifier parsing.
13324 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13325 flags:
13327 1: one of the decl-specifiers is an elaborated-type-specifier
13328 (i.e., a type declaration)
13329 2: one of the decl-specifiers is an enum-specifier or a
13330 class-specifier (i.e., a type definition)
13332 */
13334 static void
13336 cp_parser_flags flags,
13339 {
13343 cp_decl_spec ds;
13345 /* Clear DECL_SPECS. */
13348 /* Assume no class or enumeration type is declared. */
13351 /* Keep reading specifiers until there are no more to read. */
13353 {
13358 /* Peek at the next token. */
13361 /* Save the first token of the decl spec list for error
13362 reporting. */
13365 /* Handle attributes. */
13367 {
13368 /* Parse the attributes. */
13371 /* In a sequence of declaration specifiers, c++11 attributes
13372 appertain to the type that precede them. In that case
13373 [dcl.spec]/1 says:
13375 The attribute-specifier-seq affects the type only for
13376 the declaration it appears in, not other declarations
13377 involving the same type.
13379 But for now let's force the user to position the
13380 attribute either at the beginning of the declaration or
13381 after the declarator-id, which would clearly mean that it
13382 applies to the declarator. */
13384 {
13386 /* The c++11 attribute is at the beginning of the
13387 declaration. It appertains to the entity being
13389 else
13390 {
13392 {
13393 /* This is an attribute following a
13394 class-specifier. */
13399 }
13400 else
13401 {
13402 decl_specs->std_attributes
13404 attrs);
13407 }
13409 }
13410 }
13412 decl_specs->attributes
13414 attrs);
13418 }
13419 /* Assume we will find a decl-specifier keyword. */
13421 /* If the next token is an appropriate keyword, we can simply
13422 add it to the list. */
13424 {
13425 /* decl-specifier:
13426 friend
13427 constexpr */
13430 {
13435 }
13436 else
13437 {
13439 /* Consume the token. */
13441 }
13454 /* function-specifier:
13455 inline
13456 virtual
13457 explicit */
13464 /* decl-specifier:
13465 typedef */
13468 /* Consume the token. */
13470 /* A constructor declarator cannot appear in a typedef. */
13472 /* The "typedef" keyword can only occur in a declaration; we
13473 may as well commit at this point. */
13480 /* storage-class-specifier:
13481 auto
13482 register
13483 static
13484 extern
13485 mutable
13487 GNU Extension:
13488 thread */
13491 {
13492 /* Consume the token. */
13495 /* Complain about `auto' as a storage specifier, if
13496 we're complaining about C++0x compatibility. */
13500 "%<auto%> changes meaning in C++11; "
13503 /* Set the storage class anyway. */
13505 token);
13506 }
13507 else
13508 /* C++0x auto type-specifier. */
13516 /* Consume the token. */
13519 token);
13522 /* Consume the token. */
13528 /* We did not yet find a decl-specifier yet. */
13531 }
13548 /* Constructors are a special case. The `S' in `S()' is not a
13549 decl-specifier; it is the beginning of the declarator. */
13550 constructor_p
13551 = (!found_decl_spec
13552 && constructor_possible_p
13553 && (cp_parser_constructor_declarator_p
13556 /* If we don't have a DECL_SPEC yet, then we must be looking at
13557 a type-specifier. */
13559 {
13562 tree type_spec;
13564 type_spec
13566 decl_specs,
13572 /* If this type-specifier referenced a user-defined type
13573 (a typedef, class-name, etc.), then we can't allow any
13574 more such type-specifiers henceforth.
13576 [dcl.spec]
13578 The longest sequence of decl-specifiers that could
13579 possibly be a type name is taken as the
13580 decl-specifier-seq of a declaration. The sequence shall
13581 be self-consistent as described below.
13583 [dcl.type]
13585 As a general rule, at most one type-specifier is allowed
13586 in the complete decl-specifier-seq of a declaration. The
13587 only exceptions are the following:
13589 -- const or volatile can be combined with any other
13590 type-specifier.
13592 -- signed or unsigned can be combined with char, long,
13593 short, or int.
13595 -- ..
13597 Example:
13599 typedef char* Pc;
13600 void g (const int Pc);
13602 Here, Pc is *not* part of the decl-specifier seq; it's
13603 the declarator. Therefore, once we see a type-specifier
13604 (other than a cv-qualifier), we forbid any additional
13605 user-defined types. We *do* still allow things like `int
13606 int' to be considered a decl-specifier-seq, and issue the
13607 error message later. */
13610 /* A constructor declarator cannot follow a type-specifier. */
13612 {
13617 }
13618 }
13620 /* If we still do not have a DECL_SPEC, then there are no more
13621 decl-specifiers. */
13626 /* After we see one decl-specifier, further decl-specifiers are
13627 always optional. */
13629 }
13631 /* Don't allow a friend specifier with a class definition. */
13636 }
13638 /* Parse an (optional) storage-class-specifier.
13640 storage-class-specifier:
13641 auto
13642 register
13643 static
13644 extern
13645 mutable
13647 GNU Extension:
13649 storage-class-specifier:
13650 thread
13652 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13654 static tree
13656 {
13658 {
13662 /* Fall through for C++98. */
13670 /* Consume the token. */
13675 }
13676 }
13678 /* Parse an (optional) function-specifier.
13680 function-specifier:
13681 inline
13682 virtual
13683 explicit
13685 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13686 Updates DECL_SPECS, if it is non-NULL. */
13688 static tree
13691 {
13694 {
13700 /* 14.5.2.3 [temp.mem]
13702 A member function template shall not be virtual. */
13706 else
13716 }
13718 /* Consume the token. */
13720 }
13722 /* Parse a linkage-specification.
13724 linkage-specification:
13725 extern string-literal { declaration-seq [opt] }
13726 extern string-literal declaration */
13728 static void
13730 {
13731 tree linkage;
13733 /* Look for the `extern' keyword. */
13734 cp_token *extern_token
13737 /* Look for the string-literal. */
13741 /* Transform the literal into an identifier. If the literal is a
13742 wide-character string, or contains embedded NULs, then we can't
13743 handle it as the user wants. */
13746 {
13748 /* Assume C++ linkage. */
13750 }
13751 else
13754 /* We're now using the new linkage. */
13757 /* Preserve the location of the the innermost linkage specification,
13758 tracking the locations of nested specifications via a local. */
13759 location_t saved_location
13761 /* Construct a location ranging from the start of the "extern" to
13762 the end of the string-literal, with the caret at the start, e.g.:
13763 extern "C" {
13764 ^~~~~~~~~~
13765 */
13766 parser->innermost_linkage_specification_location
13771 /* If the next token is a `{', then we're using the first
13772 production. */
13774 {
13778 /* Consume the `{' token. */
13779 matching_braces braces;
13781 /* Parse the declarations. */
13783 /* Look for the closing `}'. */
13785 }
13786 /* Otherwise, there's just one declaration. */
13787 else
13788 {
13791 saved_in_unbraced_linkage_specification_p
13795 parser->in_unbraced_linkage_specification_p
13797 }
13799 /* We're done with the linkage-specification. */
13802 /* Restore location of parent linkage specification, if any. */
13804 }
13806 /* Parse a static_assert-declaration.
13808 static_assert-declaration:
13809 static_assert ( constant-expression , string-literal ) ;
13810 static_assert ( constant-expression ) ; (C++17)
13812 If MEMBER_P, this static_assert is a class member. */
13814 static void
13816 {
13817 cp_expr condition;
13818 location_t token_loc;
13819 tree message;
13822 /* Peek at the `static_assert' token so we can keep track of exactly
13823 where the static assertion started. */
13826 /* Look for the `static_assert' keyword. */
13828 RT_STATIC_ASSERT))
13831 /* We know we are in a static assertion; commit to any tentative
13832 parse. */
13836 /* Parse the `(' starting the static assertion condition. */
13837 matching_parens parens;
13840 /* Parse the constant-expression. Allow a non-constant expression
13841 here in order to give better diagnostics in finish_static_assert. */
13842 condition =
13848 {
13851 "static_assert without a message "
13853 /* Eat the ')' */
13858 }
13859 else
13860 {
13861 /* Parse the separating `,'. */
13864 /* Parse the string-literal message. */
13869 /* A `)' completes the static assertion. */
13875 }
13877 /* A semicolon terminates the declaration. */
13880 /* Get the location for the static assertion. Use that of the
13881 condition if available, otherwise, use that of the "static_assert"
13882 token. */
13887 /* Complete the static assertion, which may mean either processing
13888 the static assert now or saving it for template instantiation. */
13890 }
13892 /* Parse the expression in decltype ( expression ). */
13894 static tree
13897 {
13899 tree expr;
13901 /* Since we're going to preserve any side-effects from this parse, set up a
13902 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13903 in the expression. */
13906 /* First, try parsing an id-expression. */
13917 {
13920 cp_id_kind idk;
13924 /* Lookup the name we got back from the id-expression. */
13934 {
13935 /* Complete lookup of the id-expression. */
13936 expr = (finish_id_expression
13949 /* We found an id-expression, but it was something that we
13950 should not have found. This is an error, not something
13951 we can recover from, so note that we found an
13952 id-expression and we'll recover as gracefully as
13953 possible. */
13955 }
13960 /* We have an id-expression. */
13962 }
13965 {
13966 /* Abort the id-expression parse. */
13969 /* Parsing tentatively, again. */
13972 /* Parse a class member access. */
13980 /* We have an id-expression. */
13982 }
13985 /* We have parsed the complete id-expression or member access. */
13987 else
13988 {
13989 /* Abort our attempt to parse an id-expression or member access
13990 expression. */
13993 /* Parse a full expression. */
13996 }
13999 }
14001 /* Parse a `decltype' type. Returns the type.
14003 simple-type-specifier:
14004 decltype ( expression )
14005 C++14 proposal:
14006 decltype ( auto ) */
14008 static tree
14010 {
14011 tree expr;
14020 {
14021 /* Already parsed. */
14024 }
14026 /* Look for the `decltype' token. */
14030 /* Parse the opening `('. */
14031 matching_parens parens;
14035 /* decltype (auto) */
14038 {
14045 }
14047 /* Types cannot be defined in a `decltype' expression. Save away the
14048 old message. */
14051 /* And create the new one. */
14052 parser->type_definition_forbidden_message
14055 /* The restrictions on constant-expressions do not apply inside
14056 decltype expressions. */
14057 saved_integral_constant_expression_p
14059 saved_non_integral_constant_expression_p
14063 /* Within a parenthesized expression, a `>' token is always
14064 the greater-than operator. */
14065 saved_greater_than_is_operator_p
14069 /* Do not actually evaluate the expression. */
14072 /* Do not warn about problems with the expression. */
14077 /* Go back to evaluating expressions. */
14081 /* The `>' token might be the end of a template-id or
14082 template-parameter-list now. */
14083 parser->greater_than_is_operator_p
14086 /* Restore the old message and the integral constant expression
14087 flags. */
14089 parser->integral_constant_expression_p
14091 parser->non_integral_constant_expression_p
14094 /* Parse to the closing `)'. */
14096 {
14100 }
14103 tf_warning_or_error);
14105 rewrite:
14106 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14107 it again. */
14116 }
14118 /* Special member functions [gram.special] */
14120 /* Parse a conversion-function-id.
14122 conversion-function-id:
14123 operator conversion-type-id
14125 Returns an IDENTIFIER_NODE representing the operator. */
14127 static tree
14129 {
14130 tree type;
14131 tree saved_scope;
14132 tree saved_qualifying_scope;
14133 tree saved_object_scope;
14136 /* Look for the `operator' token. */
14139 /* When we parse the conversion-type-id, the current scope will be
14140 reset. However, we need that information in able to look up the
14141 conversion function later, so we save it here. */
14145 /* We must enter the scope of the class so that the names of
14146 entities declared within the class are available in the
14147 conversion-type-id. For example, consider:
14149 struct S {
14150 typedef int I;
14151 operator I();
14152 };
14154 S::operator I() { ... }
14156 In order to see that `I' is a type-name in the definition, we
14157 must be in the scope of `S'. */
14160 /* Parse the conversion-type-id. */
14162 /* Leave the scope of the class, if any. */
14165 /* Restore the saved scope. */
14169 /* If the TYPE is invalid, indicate failure. */
14173 }
14175 /* Parse a conversion-type-id:
14177 conversion-type-id:
14178 type-specifier-seq conversion-declarator [opt]
14180 Returns the TYPE specified. */
14182 static tree
14184 {
14185 tree attributes;
14186 cp_decl_specifier_seq type_specifiers;
14188 tree type_specified;
14191 /* Parse the attributes. */
14195 parser->type_definition_forbidden_message
14198 /* Parse the type-specifiers. */
14205 /* If that didn't work, stop. */
14208 /* Parse the conversion-declarator. */
14216 /* Don't give this error when parsing tentatively. This happens to
14217 work because we always parse this definitively once. */
14220 {
14222 {
14225 }
14229 }
14232 }
14234 /* Parse an (optional) conversion-declarator.
14236 conversion-declarator:
14237 ptr-operator conversion-declarator [opt]
14239 */
14243 {
14246 cp_cv_quals cv_quals;
14248 /* We don't know if there's a ptr-operator next, or not. */
14250 /* Try the ptr-operator. */
14253 /* If it worked, look for more conversion-declarators. */
14255 {
14258 /* Parse another optional declarator. */
14261 declarator = cp_parser_make_indirect_declarator
14265 }
14268 }
14270 /* Parse an (optional) ctor-initializer.
14272 ctor-initializer:
14273 : mem-initializer-list */
14275 static void
14277 {
14278 /* If the next token is not a `:', then there is no
14279 ctor-initializer. */
14281 {
14282 /* Do default initialization of any bases and members. */
14286 }
14288 /* Consume the `:' token. */
14290 /* And the mem-initializer-list. */
14292 }
14294 /* Parse a mem-initializer-list.
14296 mem-initializer-list:
14297 mem-initializer ... [opt]
14298 mem-initializer ... [opt] , mem-initializer-list */
14300 static void
14302 {
14307 /* Let the semantic analysis code know that we are starting the
14308 mem-initializer-list. */
14313 /* Loop through the list. */
14315 {
14316 tree mem_initializer;
14319 /* Parse the mem-initializer. */
14321 /* If the next token is a `...', we're expanding member initializers. */
14323 {
14324 /* Consume the `...'. */
14327 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14328 can be expanded but members cannot. */
14331 {
14336 }
14338 /* Construct the pack expansion type. */
14341 }
14344 {
14348 }
14349 /* Look for a target constructor. */
14353 {
14356 {
14360 }
14362 }
14363 /* Add it to the list, unless it was erroneous. */
14365 {
14368 }
14369 /* If the next token is not a `,', we're done. */
14372 /* Consume the `,' token. */
14374 }
14376 /* Perform semantic analysis. */
14379 }
14381 /* Parse a mem-initializer.
14383 mem-initializer:
14384 mem-initializer-id ( expression-list [opt] )
14385 mem-initializer-id braced-init-list
14387 GNU extension:
14389 mem-initializer:
14390 ( expression-list [opt] )
14392 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14393 class) or FIELD_DECL (for a non-static data member) to initialize;
14394 the TREE_VALUE is the expression-list. An empty initialization
14395 list is represented by void_list_node. */
14397 static tree
14399 {
14400 tree mem_initializer_id;
14401 tree expression_list;
14402 tree member;
14405 /* Find out what is being initialized. */
14407 {
14411 }
14412 else
14413 {
14417 }
14423 {
14430 }
14431 else
14432 {
14442 }
14452 }
14454 /* Parse a mem-initializer-id.
14456 mem-initializer-id:
14457 :: [opt] nested-name-specifier [opt] class-name
14458 decltype-specifier (C++11)
14459 identifier
14461 Returns a TYPE indicating the class to be initialized for the first
14462 production (and the second in C++11). Returns an IDENTIFIER_NODE
14463 indicating the data member to be initialized for the last production. */
14465 static tree
14467 {
14471 tree id;
14475 /* `typename' is not allowed in this context ([temp.res]). */
14477 {
14479 "keyword %<typename%> not allowed in this context (a qualified "
14482 }
14483 /* Look for the optional `::' operator. */
14484 global_scope_p
14488 /* Look for the optional nested-name-specifier. The simplest way to
14489 implement:
14491 [temp.res]
14493 The keyword `typename' is not permitted in a base-specifier or
14494 mem-initializer; in these contexts a qualified name that
14495 depends on a template-parameter is implicitly assumed to be a
14496 type name.
14498 is to assume that we have seen the `typename' keyword at this
14499 point. */
14500 nested_name_specifier_p
14509 /* If there is a `::' operator or a nested-name-specifier, then we
14510 are definitely looking for a class-name. */
14515 typename_type,
14519 /* Otherwise, we could also be looking for an ordinary identifier. */
14522 /* Try a decltype-specifier. */
14524 else
14525 /* Otherwise, try a class-name. */
14529 none_type,
14533 /* If we found one, we're done. */
14536 /* Otherwise, look for an ordinary identifier. */
14538 }
14540 /* Overloading [gram.over] */
14542 /* Parse an operator-function-id.
14544 operator-function-id:
14545 operator operator
14547 Returns an IDENTIFIER_NODE for the operator which is a
14548 human-readable spelling of the identifier, e.g., `operator +'. */
14550 static cp_expr
14552 {
14553 /* Look for the `operator' keyword. */
14556 /* And then the name of the operator itself. */
14558 }
14560 /* Return an identifier node for a user-defined literal operator.
14561 The suffix identifier is chained to the operator name identifier. */
14563 tree
14565 {
14566 tree identifier;
14573 }
14575 /* Parse an operator.
14577 operator:
14578 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14579 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14580 || ++ -- , ->* -> () []
14582 GNU Extensions:
14584 operator:
14585 <? >? <?= >?=
14587 Returns an IDENTIFIER_NODE for the operator which is a
14588 human-readable spelling of the identifier, e.g., `operator +'. */
14590 static cp_expr
14592 {
14597 /* Peek at the next token. */
14602 /* Figure out which operator we have. */
14607 {
14609 {
14610 /* The keyword should be either `new' or `delete'. */
14615 else
14618 /* Consume the `new' or `delete' token. */
14621 /* Peek at the next token. */
14623 /* If it's a `[' token then this is the array variant of the
14624 operator. */
14626 {
14627 /* Consume the `[' token. */
14629 /* Look for the `]' token. */
14634 }
14638 }
14796 {
14797 /* Consume the `('. */
14798 matching_parens parens;
14800 /* Look for the matching `)'. */
14805 }
14808 /* Consume the `['. */
14810 /* Look for the matching `]'. */
14819 /* FALLTHRU */
14828 {
14835 /* Consume the string. */
14841 {
14844 }
14845 else
14846 {
14848 /* Look for the suffix identifier. */
14853 {
14857 }
14858 else
14859 {
14862 }
14863 }
14868 {
14871 }
14874 {
14877 }
14879 {
14882 }
14884 }
14887 /* Anything else is an error. */
14889 }
14891 /* If we have selected an identifier, we need to consume the
14892 operator token. */
14894 {
14898 }
14899 /* Otherwise, no valid operator name was present. */
14900 else
14901 {
14904 }
14907 }
14909 /* Parse a template-declaration.
14911 template-declaration:
14912 export [opt] template < template-parameter-list > declaration
14914 If MEMBER_P is TRUE, this template-declaration occurs within a
14915 class-specifier.
14917 The grammar rule given by the standard isn't correct. What
14918 is really meant is:
14920 template-declaration:
14921 export [opt] template-parameter-list-seq
14922 decl-specifier-seq [opt] init-declarator [opt] ;
14923 export [opt] template-parameter-list-seq
14924 function-definition
14926 template-parameter-list-seq:
14927 template-parameter-list-seq [opt]
14928 template < template-parameter-list >
14930 Concept Extensions:
14932 template-parameter-list-seq:
14933 template < template-parameter-list > requires-clause [opt]
14935 requires-clause:
14936 requires logical-or-expression */
14938 static void
14940 {
14941 /* Check for `export'. */
14943 {
14944 /* Consume the `export' token. */
14946 /* Warn that we do not support `export'. */
14948 }
14951 }
14953 /* Parse a template-parameter-list.
14955 template-parameter-list:
14956 template-parameter
14957 template-parameter-list , template-parameter
14959 Returns a TREE_LIST. Each node represents a template parameter.
14960 The nodes are connected via their TREE_CHAINs. */
14962 static tree
14964 {
14969 /* The loop below parses the template parms. We first need to know
14970 the total number of template parms to be able to compute proper
14971 canonical types of each dependent type. So after the loop, when
14972 we know the total number of template parms,
14973 end_template_parm_list computes the proper canonical types and
14974 fixes up the dependent types accordingly. */
14976 {
14977 tree parameter;
14980 location_t parm_loc;
14982 /* Parse the template-parameter. */
14987 /* Add it to the list. */
14990 parm_loc,
14991 parameter,
14992 is_non_type,
14993 is_parameter_pack);
14994 else
14995 {
14998 }
15000 /* If the next token is not a `,', we're done. */
15003 /* Otherwise, consume the `,' token. */
15005 }
15008 }
15010 /* Parse a introduction-list.
15012 introduction-list:
15013 introduced-parameter
15014 introduction-list , introduced-parameter
15016 introduced-parameter:
15017 ...[opt] identifier
15019 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15020 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15021 WILDCARD_DECL will also have DECL_NAME set and token location in
15022 DECL_SOURCE_LOCATION. */
15024 static tree
15026 {
15030 {
15035 /* Build placeholder. */
15043 /* If the next token is not a `,', we're done. */
15046 /* Otherwise, consume the `,' token. */
15048 }
15050 /* Convert the vec into a TREE_VEC. */
15053 tree parm;
15059 }
15061 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15062 is an abstract declarator. */
15066 {
15071 }
15073 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15074 is an abstract declarator. */
15078 {
15082 else
15084 }
15086 /* Returns true if DECL represents a constrained-parameter. */
15090 {
15095 }
15097 /* Returns true if PARM declares a constrained-parameter. */
15101 {
15103 }
15105 /* Check that the type parameter is only a declarator-id, and that its
15106 type is not cv-qualified. */
15108 bool
15111 {
15116 {
15119 }
15121 /* Don't allow cv-qualified type parameters. */
15124 {
15127 }
15130 }
15132 /* Finish parsing/processing a template type parameter and checking
15133 various restrictions. */
15137 tree id,
15139 {
15142 else
15144 }
15146 static tree
15148 {
15149 /* FIXME: This should probably be copied, and we may need to adjust
15150 the template parameter depths. */
15160 }
15162 /* Finish parsing/processing a template template parameter by borrowing
15163 the template parameter list from the prototype parameter. */
15165 static tree
15167 tree proto,
15168 tree id,
15170 {
15174 }
15176 /* Create a new non-type template parameter from the given PARM
15177 declarator. */
15179 static tree
15182 {
15188 }
15190 /* Build a constrained template parameter based on the PARMDECL
15191 declarator. The type of PARMDECL is the constrained type, which
15192 refers to the prototype template parameter that ultimately
15193 specifies the type of the declared parameter. */
15195 static tree
15200 {
15206 /* A template parameter constrained by a variadic concept shall also
15207 be declared as a template parameter pack. */
15212 /* Build the parameter. Return an error if the declarator was invalid. */
15213 tree parm;
15218 parmdecl);
15219 else
15224 /* Finish the parameter decl and create a node attaching the
15225 default argument and constraint. */
15230 }
15232 /* Returns true if the parsed type actually represents the declaration
15233 of a type template-parameter. */
15237 {
15240 }
15243 /* Returns true if the parsed type actually represents the declaration of
15244 a template template-parameter. */
15246 static bool
15248 {
15251 }
15253 /* Parse a default argument for a type template-parameter.
15254 Note that diagnostics are handled in cp_parser_template_parameter. */
15256 static tree
15258 {
15261 /* Consume the `=' token. */
15266 /* Parse the default-argument. */
15272 {
15276 }
15279 }
15281 /* Parse a default argument for a template template-parameter. */
15283 static tree
15285 {
15290 /* Consume the `='. */
15292 /* Parse the id-expression. */
15294 /* save token before parsing the id-expression, for error
15295 reporting */
15297 tree default_argument
15305 /* If the id-expression was a template-id that refers to
15306 a template-class, we already have the declaration here,
15307 so no further lookup is needed. */
15308 ;
15309 else
15310 /* Look up the name. */
15311 default_argument
15313 none_type,
15319 /* See if the default argument is valid. */
15323 }
15325 /* Parse a template-parameter.
15327 template-parameter:
15328 type-parameter
15329 parameter-declaration
15331 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15332 the parameter. The TREE_PURPOSE is the default value, if any.
15333 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15334 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15335 set to true iff this parameter is a parameter pack. */
15337 static tree
15340 {
15343 tree parm;
15345 /* Assume it is a type parameter or a template parameter. */
15347 /* Assume it not a parameter pack. */
15349 /* Peek at the next token. */
15351 /* If it is `template', we have a type-parameter. */
15354 /* If it is `class' or `typename' we do not know yet whether it is a
15355 type parameter or a non-type parameter. Consider:
15357 template <typename T, typename T::X X> ...
15359 or:
15361 template <class C, class D*> ...
15363 Here, the first parameter is a type parameter, and the second is
15364 a non-type parameter. We can tell by looking at the token after
15365 the identifier -- if it is a `,', `=', or `>' then we have a type
15366 parameter. */
15368 {
15369 /* Peek at the token after `class' or `typename'. */
15371 /* If it's an ellipsis, we have a template type parameter
15372 pack. */
15375 /* If it's an identifier, skip it. */
15378 /* Now, see if the token looks like the end of a template
15379 parameter. */
15384 }
15386 /* Otherwise, it is a non-type parameter or a constrained parameter.
15388 [temp.param]
15390 When parsing a default template-argument for a non-type
15391 template-parameter, the first non-nested `>' is taken as the end
15392 of the template parameter-list rather than a greater-than
15393 operator. */
15394 parameter_declarator
15401 /* If the parameter declaration is marked as a parameter pack, set
15402 *IS_PARAMETER_PACK to notify the caller. */
15407 {
15408 /* Can happen in some cases of erroneous input (c++/34892). */
15410 /* Consume the `...' for better error recovery. */
15412 }
15414 // The parameter may have been constrained.
15417 parameter_declarator,
15418 is_non_type,
15419 is_parameter_pack);
15421 // Now we're sure that the parameter is a non-type parameter.
15432 }
15434 /* Parse a type-parameter.
15436 type-parameter:
15437 class identifier [opt]
15438 class identifier [opt] = type-id
15439 typename identifier [opt]
15440 typename identifier [opt] = type-id
15441 template < template-parameter-list > class identifier [opt]
15442 template < template-parameter-list > class identifier [opt]
15443 = id-expression
15445 GNU Extension (variadic templates):
15447 type-parameter:
15448 class ... identifier [opt]
15449 typename ... identifier [opt]
15451 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15452 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15453 the declaration of the parameter.
15455 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15457 static tree
15459 {
15461 tree parameter;
15463 /* Look for a keyword to tell us what kind of parameter this is. */
15469 {
15472 {
15473 tree identifier;
15474 tree default_argument;
15476 /* If the next token is an ellipsis, we have a template
15477 argument pack. */
15479 {
15480 /* Consume the `...' token. */
15485 }
15487 /* If the next token is an identifier, then it names the
15488 parameter. */
15491 else
15494 /* Create the parameter. */
15497 /* If the next token is an `=', we have a default argument. */
15499 {
15500 default_argument
15503 /* Template parameter packs cannot have default
15504 arguments. */
15506 {
15509 "template parameter pack %qD cannot have a "
15511 else
15513 "template parameter packs cannot have "
15516 }
15519 }
15520 else
15523 /* Create the combined representation of the parameter and the
15524 default argument. */
15526 }
15530 {
15531 tree identifier;
15532 tree default_argument;
15534 /* Look for the `<'. */
15536 /* Parse the template-parameter-list. */
15538 /* Look for the `>'. */
15541 // If template requirements are present, parse them.
15543 {
15548 }
15550 /* Look for the `class' or 'typename' keywords. */
15552 /* If the next token is an ellipsis, we have a template
15553 argument pack. */
15555 {
15556 /* Consume the `...' token. */
15561 }
15562 /* If the next token is an `=', then there is a
15563 default-argument. If the next token is a `>', we are at
15564 the end of the parameter-list. If the next token is a `,',
15565 then we are at the end of this parameter. */
15569 {
15571 /* Treat invalid names as if the parameter were nameless. */
15574 }
15575 else
15578 /* Create the template parameter. */
15580 identifier);
15582 /* If the next token is an `=', then there is a
15583 default-argument. */
15585 {
15586 default_argument
15589 /* Template parameter packs cannot have default
15590 arguments. */
15592 {
15595 "template parameter pack %qD cannot "
15597 identifier);
15598 else
15602 }
15603 }
15604 else
15607 /* Create the combined representation of the parameter and the
15608 default argument. */
15610 }
15616 }
15619 }
15621 /* Parse a template-id.
15623 template-id:
15624 template-name < template-argument-list [opt] >
15626 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15627 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15628 returned. Otherwise, if the template-name names a function, or set
15629 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15630 names a class, returns a TYPE_DECL for the specialization.
15632 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15633 uninstantiated templates. */
15635 static tree
15641 {
15642 tree templ;
15643 tree arguments;
15644 tree template_id;
15649 /* If the next token corresponds to a template-id, there is no need
15650 to reparse it. */
15653 {
15656 }
15658 /* Avoid performing name lookup if there is no possibility of
15659 finding a template-id. */
15662 && !cp_parser_nth_token_starts_template_argument_list_p
15664 {
15667 }
15669 /* Remember where the template-id starts. */
15675 /* Parse the template-name. */
15678 check_dependency_p,
15679 is_declaration,
15680 tag_type,
15683 {
15686 }
15688 /* Since we're going to preserve any side-effects from this parse, set up a
15689 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15690 in the template arguments. */
15693 /* If we find the sequence `[:' after a template-name, it's probably
15694 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15695 parse correctly the argument list. */
15702 {
15704 /* Change `:' into `::'. */
15706 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15707 CPP_LESS. */
15710 /* Parse the arguments. */
15713 {
15714 /* If we couldn't parse an argument list, then we revert our changes
15715 and return simply an error. Maybe this is not a template-id
15716 after all. */
15721 }
15722 /* Otherwise, emit an error about the invalid digraph, but continue
15723 parsing because we got our argument list. */
15726 {
15729 "%<<:%> is an alternate spelling for %<[%>."
15732 {
15734 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15737 }
15738 }
15739 }
15740 else
15741 {
15742 /* Look for the `<' that starts the template-argument-list. */
15744 {
15747 }
15748 /* Parse the arguments. */
15750 }
15752 /* Set the location to be of the form:
15753 template-name < template-argument-list [opt] >
15754 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15755 with caret == start at the start of the template-name,
15756 ranging until the closing '>'. */
15757 location_t finish_loc
15759 location_t combined_loc
15762 /* Build a representation of the specialization. */
15765 TEMPLATE_ID_EXPR,
15769 {
15771 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15772 template (rather than some instantiation thereof) only if
15773 is not nested within some other construct. For example, in
15774 "template <typename T> void f(T) { A<T>::", A<T> is just an
15775 instantiation of A. */
15778 CPP_SCOPE));
15779 template_id
15781 }
15782 /* A template-like identifier may be a partial concept id. */
15788 {
15792 }
15793 else
15794 {
15795 /* If it's not a class-template or a template-template, it should be
15796 a function-template. */
15804 }
15806 /* If parsing tentatively, replace the sequence of tokens that makes
15807 up the template-id with a CPP_TEMPLATE_ID token. That way,
15808 should we re-parse the token stream, we will not have to repeat
15809 the effort required to do the parse, nor will we issue duplicate
15810 error messages about problems during instantiation of the
15811 template. */
15813 /* Don't do this if we had a parse error in a declarator; re-parsing
15814 might succeed if a name changes meaning (60361). */
15818 {
15819 /* Reset the contents of the START_OF_ID token. */
15823 /* We must mark the lookup as kept, so we don't throw it away on
15824 the first parse. */
15828 /* Retrieve any deferred checks. Do not pop this access checks yet
15829 so the memory will not be reclaimed during token replacing below. */
15835 /* Purge all subsequent tokens. */
15838 /* ??? Can we actually assume that, if template_id ==
15839 error_mark_node, we will have issued a diagnostic to the
15840 user, as opposed to simply marking the tentative parse as
15841 failed? */
15844 }
15848 }
15850 /* Parse a template-name.
15852 template-name:
15853 identifier
15855 The standard should actually say:
15857 template-name:
15858 identifier
15859 operator-function-id
15861 A defect report has been filed about this issue.
15863 A conversion-function-id cannot be a template name because they cannot
15864 be part of a template-id. In fact, looking at this code:
15866 a.operator K<int>()
15868 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15869 It is impossible to call a templated conversion-function-id with an
15870 explicit argument list, since the only allowed template parameter is
15871 the type to which it is converting.
15873 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15874 `template' keyword, in a construction like:
15876 T::template f<3>()
15878 In that case `f' is taken to be a template-name, even though there
15879 is no way of knowing for sure.
15881 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15882 name refers to a set of overloaded functions, at least one of which
15883 is a template, or an IDENTIFIER_NODE with the name of the template,
15884 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15885 names are looked up inside uninstantiated templates. */
15887 static tree
15894 {
15895 tree identifier;
15896 tree decl;
15899 /* If the next token is `operator', then we have either an
15900 operator-function-id or a conversion-function-id. */
15902 {
15903 /* We don't know whether we're looking at an
15904 operator-function-id or a conversion-function-id. */
15906 /* Try an operator-function-id. */
15908 /* If that didn't work, try a conversion-function-id. */
15910 {
15913 }
15914 }
15915 /* Look for the identifier. */
15916 else
15919 /* If we didn't find an identifier, we don't have a template-id. */
15923 /* If the name immediately followed the `template' keyword, then it
15924 is a template-name. However, if the next token is not `<', then
15925 we do not treat it as a template-name, since it is not being used
15926 as part of a template-id. This enables us to handle constructs
15927 like:
15929 template <typename T> struct S { S(); };
15930 template <typename T> S<T>::S();
15932 correctly. We would treat `S' as a template -- if it were `S<T>'
15933 -- but we do not if there is no `<'. */
15937 {
15938 /* In a declaration, in a dependent context, we pretend that the
15939 "template" keyword was present in order to improve error
15940 recovery. For example, given:
15942 template <typename T> void f(T::X<int>);
15944 we want to treat "X<int>" as a template-id. */
15946 && !template_keyword_p
15948 && check_dependency_p
15950 /* Do not do this for dtors (or ctors), since they never
15951 need the template keyword before their name. */
15953 {
15956 /* Explain what went wrong. */
15958 identifier);
15961 /* If parsing tentatively, find the location of the "<" token. */
15964 /* Parse the template arguments so that we can issue error
15965 messages about them. */
15968 /* Skip tokens until we find a good place from which to
15969 continue parsing. */
15974 /* If parsing tentatively, permanently remove the
15975 template argument list. That will prevent duplicate
15976 error messages from being issued about the missing
15977 "template" keyword. */
15984 }
15986 /* If the "template" keyword is present, then there is generally
15987 no point in doing name-lookup, so we just return IDENTIFIER.
15988 But, if the qualifying scope is non-dependent then we can
15989 (and must) do name-lookup normally. */
15991 {
15997 {
15998 /* We're optimizing away the call to cp_parser_lookup_name, but
15999 we still need to do this. */
16002 }
16003 }
16004 }
16006 /* Look up the name. */
16008 tag_type,
16011 check_dependency_p,
16017 /* If DECL is a template, then the name was a template-name. */
16019 {
16023 }
16024 else
16025 {
16026 /* The standard does not explicitly indicate whether a name that
16027 names a set of overloaded declarations, some of which are
16028 templates, is a template-name. However, such a name should
16029 be a template-name; otherwise, there is no way to form a
16030 template-id for the overloaded templates. */
16039 {
16040 /* The name does not name a template. */
16043 }
16044 }
16046 /* If DECL is dependent, and refers to a function, then just return
16047 its name; we will look it up again during template instantiation. */
16049 {
16053 }
16056 }
16058 /* Parse a template-argument-list.
16060 template-argument-list:
16061 template-argument ... [opt]
16062 template-argument-list , template-argument ... [opt]
16064 Returns a TREE_VEC containing the arguments. */
16066 static tree
16068 {
16073 tree vec;
16080 /* Even if the template-id appears in an integral
16081 constant-expression, the contents of the argument list do
16082 not. */
16088 /* Parse the arguments. */
16089 do
16090 {
16091 tree argument;
16094 /* Consume the comma. */
16097 /* Parse the template-argument. */
16100 /* If the next token is an ellipsis, we're expanding a template
16101 argument pack. */
16103 {
16105 {
16109 }
16110 /* Consume the `...' token. */
16113 /* Make the argument into a TYPE_PACK_EXPANSION or
16114 EXPR_PACK_EXPANSION. */
16116 }
16119 {
16123 {
16126 }
16127 else
16129 }
16131 }
16147 }
16149 /* Parse a template-argument.
16151 template-argument:
16152 assignment-expression
16153 type-id
16154 id-expression
16156 The representation is that of an assignment-expression, type-id, or
16157 id-expression -- except that the qualified id-expression is
16158 evaluated, so that the value returned is either a DECL or an
16159 OVERLOAD.
16161 Although the standard says "assignment-expression", it forbids
16162 throw-expressions or assignments in the template argument.
16163 Therefore, we use "conditional-expression" instead. */
16165 static tree
16167 {
16168 tree argument;
16174 cp_id_kind idk;
16176 /* There's really no way to know what we're looking at, so we just
16177 try each alternative in order.
16179 [temp.arg]
16181 In a template-argument, an ambiguity between a type-id and an
16182 expression is resolved to a type-id, regardless of the form of
16183 the corresponding template-parameter.
16185 Therefore, we try a type-id first. */
16188 /* If there was no error parsing the type-id but the next token is a
16189 '>>', our behavior depends on which dialect of C++ we're
16190 parsing. In C++98, we probably found a typo for '> >'. But there
16191 are type-id which are also valid expressions. For instance:
16193 struct X { int operator >> (int); };
16194 template <int V> struct Foo {};
16195 Foo<X () >> 5> r;
16197 Here 'X()' is a valid type-id of a function type, but the user just
16198 wanted to write the expression "X() >> 5". Thus, we remember that we
16199 found a valid type-id, but we still try to parse the argument as an
16200 expression to see what happens.
16202 In C++0x, the '>>' will be considered two separate '>'
16203 tokens. */
16207 {
16210 }
16211 else
16212 {
16213 /* If the next token isn't a `,' or a `>', then this argument wasn't
16214 really finished. This means that the argument is not a valid
16215 type-id. */
16218 /* If that worked, we're done. */
16221 }
16222 /* We're still not sure what the argument will be. */
16224 /* Try a template. */
16232 /* If the next token isn't a `,' or a `>', then this argument wasn't
16233 really finished. */
16237 {
16238 /* Figure out what is being referred to. If the id-expression
16239 was for a class template specialization, then we will have a
16240 TYPE_DECL at this point. There is no need to do name lookup
16241 at this point in that case. */
16244 none_type,
16250 /* Handle a constrained-type-specifier for a non-type template
16251 parameter. */
16257 }
16259 {
16263 }
16264 /* It must be a non-type argument. In C++17 any constant-expression is
16265 allowed. */
16269 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16271 -- an integral constant-expression of integral or enumeration
16272 type; or
16274 -- the name of a non-type template-parameter; or
16276 -- the name of an object or function with external linkage...
16278 -- the address of an object or function with external linkage...
16280 -- a pointer to member... */
16281 /* Look for a non-type template parameter. */
16283 {
16295 }
16297 /* If the next token is "&", the argument must be the address of an
16298 object or function with external linkage. */
16301 {
16304 }
16305 /* See if we might have an id-expression. */
16312 {
16315 address_p,
16322 else
16323 {
16324 tree probe;
16327 {
16328 /* Strip the dereference temporarily. */
16331 }
16333 /* If we're in a template, we represent a qualified-id referring
16334 to a static data member as a SCOPE_REF even if the scope isn't
16335 dependent so that we can check access control later. */
16340 {
16341 /* A variable without external linkage might still be a
16342 valid constant-expression, so no error is issued here
16343 if the external-linkage check fails. */
16346 }
16348 /* All overloaded functions are allowed; if the external
16349 linkage test does not pass, an error will be issued
16350 later. */
16351 ;
16355 /* A pointer-to-member. */
16356 ;
16358 ;
16359 else
16363 {
16366 tf_warning_or_error);
16367 else
16370 }
16371 }
16372 }
16373 /* If the argument started with "&", there are no other valid
16374 alternatives at this point. */
16376 {
16379 }
16381 general_expr:
16382 /* If the argument wasn't successfully parsed as a type-id followed
16383 by '>>', the argument can only be a constant expression now.
16384 Otherwise, we try parsing the constant-expression tentatively,
16385 because the argument could really be a type-id. */
16391 else
16392 {
16393 /* With C++17 generalized non-type template arguments we need to handle
16394 lvalue constant expressions, too. */
16397 }
16405 /* We did our best to parse the argument as a non type-id, but that
16406 was the only alternative that matched (albeit with a '>' after
16407 it). We can assume it's just a typo from the user, and a
16408 diagnostic will then be issued. */
16410 }
16412 /* Parse an explicit-instantiation.
16414 explicit-instantiation:
16415 template declaration
16417 Although the standard says `declaration', what it really means is:
16419 explicit-instantiation:
16420 template decl-specifier-seq [opt] declarator [opt] ;
16422 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16423 supposed to be allowed. A defect report has been filed about this
16424 issue.
16426 GNU Extension:
16428 explicit-instantiation:
16429 storage-class-specifier template
16430 decl-specifier-seq [opt] declarator [opt] ;
16431 function-specifier template
16432 decl-specifier-seq [opt] declarator [opt] ; */
16434 static void
16436 {
16438 cp_decl_specifier_seq decl_specifiers;
16443 /* Look for an (optional) storage-class-specifier or
16444 function-specifier. */
16446 {
16447 extension_specifier
16450 extension_specifier
16453 }
16455 /* Look for the `template' keyword. */
16457 /* Let the front end know that we are processing an explicit
16458 instantiation. */
16460 /* [temp.explicit] says that we are supposed to ignore access
16461 control while processing explicit instantiation directives. */
16463 /* Parse a decl-specifier-seq. */
16465 CP_PARSER_FLAGS_OPTIONAL,
16468 /* If there was exactly one decl-specifier, and it declared a class,
16469 and there's no declarator, then we have an explicit type
16470 instantiation. */
16472 {
16473 tree type;
16477 /* Turn access control back on for names used during
16478 template instantiation. */
16483 }
16484 else
16485 {
16487 tree decl;
16489 /* Parse the declarator. */
16490 declarator
16501 {
16504 "explicit instantiation shall not use"
16508 "explicit instantiation shall not use"
16513 /* Turn access control back on for names used during
16514 template instantiation. */
16516 /* Do the explicit instantiation. */
16518 }
16519 else
16520 {
16522 /* Skip the body of the explicit instantiation. */
16524 }
16525 }
16526 /* We're done with the instantiation. */
16532 }
16534 /* Parse an explicit-specialization.
16536 explicit-specialization:
16537 template < > declaration
16539 Although the standard says `declaration', what it really means is:
16541 explicit-specialization:
16542 template <> decl-specifier [opt] init-declarator [opt] ;
16543 template <> function-definition
16544 template <> explicit-specialization
16545 template <> template-declaration */
16547 static void
16549 {
16553 /* Look for the `template' keyword. */
16555 /* Look for the `<'. */
16557 /* Look for the `>'. */
16559 /* We have processed another parameter list. */
16561 /* [temp]
16563 A template ... explicit specialization ... shall not have C
16564 linkage. */
16566 {
16569 /* Give it C++ linkage to avoid confusing other parts of the
16570 front end. */
16573 }
16574 else
16576 /* Let the front end know that we are beginning a specialization. */
16578 {
16581 }
16583 /* If the next keyword is `template', we need to figure out whether
16584 or not we're looking a template-declaration. */
16586 {
16591 else
16593 }
16594 else
16595 /* Parse the dependent declaration. */
16601 /* We're done with the specialization. */
16603 /* For the erroneous case of a template with C linkage, we pushed an
16604 implicit C++ linkage scope; exit that scope now. */
16607 /* We're done with this parameter list. */
16609 }
16611 /* Parse a type-specifier.
16613 type-specifier:
16614 simple-type-specifier
16615 class-specifier
16616 enum-specifier
16617 elaborated-type-specifier
16618 cv-qualifier
16620 GNU Extension:
16622 type-specifier:
16623 __complex__
16625 Returns a representation of the type-specifier. For a
16626 class-specifier, enum-specifier, or elaborated-type-specifier, a
16627 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16629 The parser flags FLAGS is used to control type-specifier parsing.
16631 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16632 in a decl-specifier-seq.
16634 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16635 class-specifier, enum-specifier, or elaborated-type-specifier, then
16636 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16637 if a type is declared; 2 if it is defined. Otherwise, it is set to
16638 zero.
16640 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16641 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16642 is set to FALSE. */
16644 static tree
16646 cp_parser_flags flags,
16651 {
16657 /* Assume this type-specifier does not declare a new type. */
16660 /* And that it does not specify a cv-qualifier. */
16663 /* Peek at the next token. */
16666 /* If we're looking at a keyword, we can use that to guide the
16667 production we choose. */
16670 {
16675 /* Look for the enum-specifier. */
16677 /* If that worked, we're done. */
16679 {
16684 type_spec,
16685 token,
16688 }
16689 else
16692 /* Any of these indicate either a class-specifier, or an
16693 elaborated-type-specifier. */
16700 /* Parse tentatively so that we can back up if we don't find a
16701 class-specifier. */
16703 /* Look for the class-specifier. */
16706 /* If that worked, we're done. */
16708 {
16713 type_spec,
16714 token,
16717 }
16719 /* Fall through. */
16720 elaborated_type_specifier:
16721 /* We're declaring (not defining) a class or enum. */
16725 /* Fall through. */
16727 /* Look for an elaborated-type-specifier. */
16728 type_spec
16729 = (cp_parser_elaborated_type_specifier
16732 is_declaration));
16735 type_spec,
16736 token,
16759 /* The `__complex__' keyword is a GNU extension. */
16765 }
16767 /* Handle simple keywords. */
16769 {
16771 {
16774 }
16776 }
16778 /* If we do not already have a type-specifier, assume we are looking
16779 at a simple-type-specifier. */
16781 decl_specs,
16782 flags);
16784 /* If we didn't find a type-specifier, and a type-specifier was not
16785 optional in this context, issue an error message. */
16787 {
16790 }
16793 }
16795 /* Parse a simple-type-specifier.
16797 simple-type-specifier:
16798 :: [opt] nested-name-specifier [opt] type-name
16799 :: [opt] nested-name-specifier template template-id
16800 char
16801 wchar_t
16802 bool
16803 short
16804 int
16805 long
16806 signed
16807 unsigned
16808 float
16809 double
16810 void
16812 C++11 Extension:
16814 simple-type-specifier:
16815 auto
16816 decltype ( expression )
16817 char16_t
16818 char32_t
16819 __underlying_type ( type-id )
16821 C++17 extension:
16823 nested-name-specifier(opt) template-name
16825 GNU Extension:
16827 simple-type-specifier:
16828 __int128
16829 __typeof__ unary-expression
16830 __typeof__ ( type-id )
16831 __typeof__ ( type-id ) { initializer-list , [opt] }
16833 Concepts Extension:
16835 simple-type-specifier:
16836 constrained-type-specifier
16838 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16839 appropriately updated. */
16841 static tree
16844 cp_parser_flags flags)
16845 {
16850 /* Peek at the next token. */
16853 /* If we're looking at a keyword, things are easy. */
16855 {
16890 {
16893 }
16922 {
16923 /* The 'auto' might be the placeholder return type for a function decl
16924 with trailing return type. */
16933 {
16935 {
16942 }
16945 {
16948 }
16951 }
16955 {
16958 }
16961 {
16964 }
16965 else
16969 {
16972 "use of %<auto%> in lambda parameter declaration "
16973 "only available with "
16975 }
16978 "use of %<auto%> in parameter declaration "
16979 "only available with "
16983 "ISO C++ forbids use of %<auto%> in parameter "
16985 }
16986 else
16991 /* Since DR 743, decltype can either be a simple-type-specifier by
16992 itself or begin a nested-name-specifier. Parsing it will replace
16993 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16994 handling below decide what to do. */
17000 /* Consume the `typeof' token. */
17002 /* Parse the operand to `typeof'. */
17004 /* If it is not already a TYPE, take its type. */
17010 token,
17019 token,
17029 token,
17034 }
17036 /* If token is an already-parsed decltype not followed by ::,
17037 it's a simple-type-specifier. */
17040 {
17043 {
17045 token,
17047 /* Remember that we are handling a decltype in order to
17048 implement the resolution of DR 1510 when the argument
17049 isn't instantiation dependent. */
17051 }
17054 }
17056 /* If the type-specifier was for a built-in type, we're done. */
17058 {
17059 /* Record the type. */
17066 type,
17067 token,
17072 /* Consume the token. */
17078 /* There is no valid C++ program where a non-template type is
17079 followed by a "<". That usually indicates that the user thought
17080 that the type was a template. */
17085 }
17087 /* The type-specifier must be a user-defined type. */
17089 {
17093 /* Don't gobble tokens or issue error messages if this is an
17094 optional type-specifier. */
17100 /* Look for the optional `::' operator. */
17101 global_p
17105 /* Look for the nested-name specifier. */
17106 qualified_p
17113 /* If we have seen a nested-name-specifier, and the next token
17114 is `template', then we are using the template-id production. */
17117 {
17118 /* Look for the template-id. */
17122 none_type,
17124 /* If the template-id did not name a type, we are out of
17125 luck. */
17127 {
17130 }
17131 }
17132 /* Otherwise, look for a type-name. */
17133 else
17135 /* Keep track of all name-lookups performed in class scopes. */
17137 && !global_p
17138 && !qualified_p
17142 /* If it didn't work out, we don't have a TYPE. */
17147 {
17161 {
17163 none_type,
17173 else
17174 {
17179 }
17180 }
17181 else
17187 }
17190 token,
17192 }
17194 /* If we didn't get a type-name, issue an error message. */
17196 {
17199 }
17202 {
17203 /* See if TYPE is an Objective-C type, and if so, parse and
17204 accept any protocol references following it. Do this before
17205 the cp_parser_check_for_invalid_template_id() call, because
17206 Objective-C types can be followed by '<...>' which would
17207 enclose protocol names rather than template arguments, and so
17208 everything is fine. */
17211 {
17215 /* Clobber the "unqualified" type previously entered into
17216 DECL_SPECS with the new, improved protocol-qualified version. */
17221 }
17223 /* There is no valid C++ program where a non-template type is
17224 followed by a "<". That usually indicates that the user
17225 thought that the type was a template. */
17227 none_type,
17229 }
17232 }
17234 /* Parse a type-name.
17236 type-name:
17237 class-name
17238 enum-name
17239 typedef-name
17240 simple-template-id [in c++0x]
17242 enum-name:
17243 identifier
17245 typedef-name:
17246 identifier
17248 Concepts:
17250 type-name:
17251 concept-name
17252 partial-concept-id
17254 concept-name:
17255 identifier
17257 Returns a TYPE_DECL for the type. */
17259 static tree
17261 {
17263 }
17265 /* See above. */
17266 static tree
17268 {
17269 tree type_decl;
17271 /* We can't know yet whether it is a class-name or not. */
17273 /* Try a class-name. */
17275 typename_keyword_p,
17277 none_type,
17281 /* If it's not a class-name, keep looking. */
17283 {
17285 /* It must be a typedef-name or an enum-name. */
17289 /* It is either a simple-template-id representing an
17290 instantiation of an alias template... */
17294 none_type,
17296 /* Note that this must be an instantiation of an alias template
17297 because [temp.names]/6 says:
17299 A template-id that names an alias template specialization
17300 is a type-name.
17302 Whereas [temp.names]/7 says:
17304 A simple-template-id that names a class template
17305 specialization is a class-name.
17307 With concepts, this could also be a partial-concept-id that
17308 declares a non-type template parameter. */
17315 else
17319 /* ... Or a typedef-name or an enum-name. */
17321 }
17324 }
17326 /* Check if DECL and ARGS can form a constrained-type-specifier.
17327 If ARGS is non-null, we try to form a concept check of the
17328 form DECL<?, ARGS> where ? is a wildcard that matches any
17329 kind of template argument. If ARGS is NULL, then we try to
17330 form a concept check of the form DECL<?>. */
17332 static tree
17335 {
17338 /* If we a constrained-type-specifier cannot be deduced. */
17342 /* A constrained type specifier can only be found in an
17343 overload set or as a reference to a template declaration.
17345 FIXME: This might be masking a bug. It's possible that
17346 that the deduction below is causing template specializations
17347 to be formed with the wildcard as an argument. */
17351 /* Try to build a call expression that evaluates the
17352 concept. This can fail if the overload set refers
17353 only to non-templates. */
17359 /* Deduce the checked constraint and the prototype parameter.
17361 FIXME: In certain cases, failure to deduce should be a
17362 diagnosable error. */
17363 tree conc;
17364 tree proto;
17368 /* In template parameter scope, this results in a constrained
17369 parameter. Return a descriptor of that parm. */
17373 /* In a parameter-declaration-clause, constrained-type
17374 specifiers result in invented template parameters. */
17376 {
17379 }
17380 else
17381 {
17382 /* Otherwise, we're in a context where the constrained
17383 type name is deduced and the constraint applies
17384 after deduction. */
17386 }
17389 }
17391 /* If DECL refers to a concept, return a TYPE_DECL representing
17392 the result of using the constrained type specifier in the
17393 current context. DECL refers to a concept if
17395 - it is an overload set containing a function concept taking a single
17396 type argument, or
17398 - it is a variable concept taking a single type argument. */
17400 static tree
17402 {
17408 else
17410 }
17412 /* Check if DECL and ARGS form a partial-concept-id. If so,
17413 assign ID to the resulting constrained placeholder.
17415 Returns true if the partial-concept-id designates a placeholder
17416 and false otherwise. Note that *id is set to NULL_TREE in
17417 this case. */
17419 static tree
17421 {
17423 }
17425 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17426 or a concept-name.
17428 enum-name:
17429 identifier
17431 typedef-name:
17432 identifier
17434 concept-name:
17435 identifier
17437 Returns a TYPE_DECL for the type. */
17439 static tree
17441 {
17442 tree type_decl;
17443 tree identifier;
17450 /* Look up the type-name. */
17455 /* If we found an overload set, then it may refer to a concept-name. */
17461 {
17462 /* See if this is an Objective-C type. */
17467 }
17469 /* Issue an error if we did not find a type-name. */
17471 /* In Objective-C, we have the complication that class names are
17472 normally type names and start declarations (eg, the
17473 "NSObject" in "NSObject *object;"), but can be used in an
17474 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17475 is an expression. So, a classname followed by a dot is not a
17476 valid type-name. */
17479 {
17484 }
17485 /* Remember that the name was used in the definition of the
17486 current class so that we can check later to see if the
17487 meaning would have been different after the class was
17488 entirely defined. */
17494 }
17496 /* Parse an elaborated-type-specifier. Note that the grammar given
17497 here incorporates the resolution to DR68.
17499 elaborated-type-specifier:
17500 class-key :: [opt] nested-name-specifier [opt] identifier
17501 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17502 enum-key :: [opt] nested-name-specifier [opt] identifier
17503 typename :: [opt] nested-name-specifier identifier
17504 typename :: [opt] nested-name-specifier template [opt]
17505 template-id
17507 GNU extension:
17509 elaborated-type-specifier:
17510 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17511 class-key attributes :: [opt] nested-name-specifier [opt]
17512 template [opt] template-id
17513 enum attributes :: [opt] nested-name-specifier [opt] identifier
17515 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17516 declared `friend'. If IS_DECLARATION is TRUE, then this
17517 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17518 something is being declared.
17520 Returns the TYPE specified. */
17522 static tree
17526 {
17528 tree identifier;
17531 tree globalscope;
17534 /* See if we're looking at the `enum' keyword. */
17536 {
17537 /* Consume the `enum' token. */
17539 /* Remember that it's an enumeration type. */
17541 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17542 enums) is used here. */
17546 {
17553 /* Consume the `struct' or `class' and parse it anyway. */
17555 }
17556 /* Parse the attributes. */
17558 }
17559 /* Or, it might be `typename'. */
17561 RID_TYPENAME))
17562 {
17563 /* Consume the `typename' token. */
17565 /* Remember that it's a `typename' type. */
17567 }
17568 /* Otherwise it must be a class-key. */
17569 else
17570 {
17574 /* Parse the attributes. */
17576 }
17578 /* Look for the `::' operator. */
17581 /* Look for the nested-name-specifier. */
17582 tree nested_name_specifier;
17584 {
17585 nested_name_specifier
17590 is_declaration);
17593 }
17594 else
17595 /* Even though `typename' is not present, the proposed resolution
17596 to Core Issue 180 says that in `class A<T>::B', `B' should be
17597 considered a type-name, even if `A<T>' is dependent. */
17598 nested_name_specifier
17603 is_declaration);
17604 /* For everything but enumeration types, consider a template-id.
17605 For an enumeration type, consider only a plain identifier. */
17607 {
17609 tree decl;
17611 /* Allow the `template' keyword. */
17613 /* If we didn't see `template', we don't know if there's a
17614 template-id or not. */
17617 /* Parse the template-id. */
17621 tag_type,
17622 is_declaration);
17623 /* If we didn't find a template-id, look for an ordinary
17624 identifier. */
17626 ;
17627 /* We can get here when cp_parser_template_id, called by
17628 cp_parser_class_name with tag_type == none_type, succeeds
17629 and caches a BASELINK. Then, when called again here,
17630 instead of failing and returning an error_mark_node
17631 returns it (see template/typename17.C in C++11).
17632 ??? Could we diagnose this earlier? */
17634 {
17637 }
17638 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17639 in effect, then we must assume that, upon instantiation, the
17640 template will correspond to a class. */
17644 typename_type,
17646 /* If the `typename' keyword is in effect and DECL is not a type
17647 decl, then type is non existent. */
17649 ;
17651 {
17655 /* If the next token is a semicolon, this must be a specialization,
17656 instantiation, or friend declaration. Check the scope while we
17657 still know whether or not we had a nested-name-specifier. */
17662 }
17665 }
17668 {
17673 {
17676 }
17678 /* For a `typename', we needn't call xref_tag. */
17684 /* Template parameter lists apply only if we are not within a
17685 function parameter list. */
17686 bool template_parm_lists_apply
17695 /* Look up a qualified name in the usual way. */
17697 {
17698 tree decl;
17699 tree ambiguous_decls;
17702 tag_type,
17709 /* If the lookup was ambiguous, an error will already have been
17710 issued. */
17714 /* If we are parsing friend declaration, DECL may be a
17715 TEMPLATE_DECL tree node here. However, we need to check
17716 whether this TEMPLATE_DECL results in valid code. Consider
17717 the following example:
17719 namespace N {
17720 template <class T> class C {};
17721 }
17722 class X {
17723 template <class T> friend class N::C; // #1, valid code
17724 };
17725 template <class T> class Y {
17726 friend class N::C; // #2, invalid code
17727 };
17729 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17730 name lookup of `N::C'. We see that friend declaration must
17731 be template for the code to be valid. Note that
17732 processing_template_decl does not work here since it is
17733 always 1 for the above two cases. */
17735 decl = (cp_parser_maybe_treat_template_as_class
17740 {
17742 identifier,
17745 }
17748 {
17752 allow_template);
17756 }
17758 /* Forward declarations of nested types, such as
17760 class C1::C2;
17761 class C1::C2::C3;
17763 are invalid unless all components preceding the final '::'
17764 are complete. If all enclosing types are complete, these
17765 declarations become merely pointless.
17767 Invalid forward declarations of nested types are errors
17768 caught elsewhere in parsing. Those that are pointless arrive
17769 here. */
17776 }
17777 else
17778 {
17779 /* An elaborated-type-specifier sometimes introduces a new type and
17780 sometimes names an existing type. Normally, the rule is that it
17781 introduces a new type only if there is not an existing type of
17782 the same name already in scope. For example, given:
17784 struct S {};
17785 void f() { struct S s; }
17787 the `struct S' in the body of `f' is the same `struct S' as in
17788 the global scope; the existing definition is used. However, if
17789 there were no global declaration, this would introduce a new
17790 local class named `S'.
17792 An exception to this rule applies to the following code:
17794 namespace N { struct S; }
17796 Here, the elaborated-type-specifier names a new type
17797 unconditionally; even if there is already an `S' in the
17798 containing scope this declaration names a new type.
17799 This exception only applies if the elaborated-type-specifier
17800 forms the complete declaration:
17802 [class.name]
17804 A declaration consisting solely of `class-key identifier ;' is
17805 either a redeclaration of the name in the current scope or a
17806 forward declaration of the identifier as a class name. It
17807 introduces the name into the current scope.
17809 We are in this situation precisely when the next token is a `;'.
17811 An exception to the exception is that a `friend' declaration does
17812 *not* name a new type; i.e., given:
17814 struct S { friend struct T; };
17816 `T' is not a new type in the scope of `S'.
17818 Also, `new struct S' or `sizeof (struct S)' never results in the
17819 definition of a new type; a new type can only be declared in a
17820 declaration context. */
17822 tag_scope ts;
17826 /* Friends have special name lookup rules. */
17830 CPP_SEMICOLON))
17831 /* This is a `class-key identifier ;' */
17833 else
17836 template_p =
17837 (template_parm_lists_apply
17840 /* An unqualified name was used to reference this type, so
17841 there were no qualifying templates. */
17849 }
17850 }
17855 /* Allow attributes on forward declarations of classes. */
17857 {
17867 else
17870 }
17873 {
17874 /* Indicate whether this class was declared as a `class' or as a
17875 `struct'. */
17879 }
17881 /* A "<" cannot follow an elaborated type specifier. If that
17882 happens, the user was probably trying to form a template-id. */
17887 }
17889 /* Parse an enum-specifier.
17891 enum-specifier:
17892 enum-head { enumerator-list [opt] }
17893 enum-head { enumerator-list , } [C++0x]
17895 enum-head:
17896 enum-key identifier [opt] enum-base [opt]
17897 enum-key nested-name-specifier identifier enum-base [opt]
17899 enum-key:
17900 enum
17901 enum class [C++0x]
17902 enum struct [C++0x]
17904 enum-base: [C++0x]
17905 : type-specifier-seq
17907 opaque-enum-specifier:
17908 enum-key identifier enum-base [opt] ;
17910 GNU Extensions:
17911 enum-key attributes[opt] identifier [opt] enum-base [opt]
17912 { enumerator-list [opt] }attributes[opt]
17913 enum-key attributes[opt] identifier [opt] enum-base [opt]
17914 { enumerator-list, }attributes[opt] [C++0x]
17916 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17917 if the token stream isn't an enum-specifier after all. */
17919 static tree
17921 {
17922 tree identifier;
17924 tree prev_scope;
17926 tree attributes;
17939 /* Parse tentatively so that we can back up if we don't find a
17940 enum-specifier. */
17943 /* Caller guarantees that the current token is 'enum', an identifier
17944 possibly follows, and the token after that is an opening brace.
17945 If we don't have an identifier, fabricate an anonymous name for
17946 the enumeration being defined. */
17949 /* Parse the "class" or "struct", which indicates a scoped
17950 enumeration type in C++0x. */
17953 {
17957 /* Consume the `struct' or `class' token. */
17961 }
17965 /* Clear the qualification. */
17970 /* Figure out in what scope the declaration is being placed. */
17976 nested_name_specifier
17984 {
17985 tree name;
17989 enum_type,
17994 input_location);
17996 {
17999 {
18000 /* Are template enums allowed in ISO? */
18004 /* ignore a typename reference, for it will be solved by name
18005 in start_enum. */
18007 }
18008 }
18011 else
18012 {
18017 }
18018 }
18019 else
18020 {
18023 else
18024 {
18030 }
18031 }
18034 /* Check for the `:' that denotes a specified underlying type in C++0x.
18035 Note that a ':' could also indicate a bitfield width, however. */
18037 {
18038 cp_decl_specifier_seq type_specifiers;
18040 /* Consume the `:'. */
18043 /* Parse the type-specifier-seq. */
18048 /* At this point this is surely not elaborated type specifier. */
18057 /* If that didn't work, stop. */
18059 {
18065 }
18066 }
18068 /* Look for the `{' but don't consume it yet. */
18070 {
18072 {
18075 {
18078 }
18079 }
18080 /* An opaque-enum-specifier must have a ';' here. */
18083 {
18086 {
18089 }
18090 }
18091 }
18097 {
18099 {
18103 }
18105 {
18107 }
18108 }
18110 /* Issue an error message if type-definitions are forbidden here. */
18113 else
18114 /* Create the new type. We do this before consuming the opening
18115 brace so the enum will be recorded as being on the line of its
18116 tag (or the 'enum' keyword, if there is no tag). */
18120 /* If the next token is not '{' it is an opaque-enum-specifier or an
18121 elaborated-type-specifier. */
18123 {
18127 {
18128 /* The following catches invalid code such as:
18129 enum class S<int>::E { A, B, C }; */
18137 {
18141 nested_name_specifier);
18143 }
18146 {
18148 "%qT for enum declaration does not name a class "
18151 }
18152 /* If that scope does not contain the scope in which the
18153 class was originally declared, the program is invalid. */
18155 nested_name_specifier))
18156 {
18159 "declaration of %qD in namespace %qD which does not "
18162 else
18164 "declaration of %qD in %qD which does not "
18168 }
18169 /* If that scope is the scope where the declaration is being placed
18170 the program is invalid. */
18174 {
18178 }
18179 }
18184 /* Consume the opening brace. */
18185 matching_braces braces;
18192 {
18196 }
18197 else
18198 {
18204 }
18208 /* If the next token is not '}', then there are some enumerators. */
18210 {
18214 }
18215 else
18218 /* Consume the final '}'. */
18224 }
18225 else
18226 {
18227 /* If a ';' follows, then it is an opaque-enum-specifier
18228 and additional restrictions apply. */
18230 {
18237 }
18238 }
18240 /* Look for trailing attributes to apply to this enumeration, and
18241 apply them if appropriate. */
18243 {
18246 trailing_attr,
18248 }
18250 /* Finish up the enumeration. */
18252 {
18257 }
18260 {
18262 {
18265 }
18267 {
18269 }
18270 }
18271 out:
18274 }
18276 /* Parse an enumerator-list. The enumerators all have the indicated
18277 TYPE.
18279 enumerator-list:
18280 enumerator-definition
18281 enumerator-list , enumerator-definition */
18283 static void
18285 {
18287 {
18288 /* Parse an enumerator-definition. */
18291 /* If the next token is not a ',', we've reached the end of
18292 the list. */
18295 /* Otherwise, consume the `,' and keep going. */
18297 /* If the next token is a `}', there is a trailing comma. */
18299 {
18304 }
18305 }
18306 }
18308 /* Parse an enumerator-definition. The enumerator has the indicated
18309 TYPE.
18311 enumerator-definition:
18312 enumerator
18313 enumerator = constant-expression
18315 enumerator:
18316 identifier
18318 GNU Extensions:
18320 enumerator-definition:
18321 enumerator attributes [opt]
18322 enumerator attributes [opt] = constant-expression */
18324 static void
18326 {
18327 tree identifier;
18328 tree value;
18329 location_t loc;
18331 /* Save the input location because we are interested in the location
18332 of the identifier and not the location of the explicit value. */
18335 /* Look for the identifier. */
18340 /* Parse any specified attributes. */
18343 /* If the next token is an '=', then there is an explicit value. */
18345 {
18346 /* Consume the `=' token. */
18348 /* Parse the value. */
18350 }
18351 else
18354 /* If we are processing a template, make sure the initializer of the
18355 enumerator doesn't contain any bare template parameter pack. */
18359 /* Create the enumerator. */
18361 }
18363 /* Parse a namespace-name.
18365 namespace-name:
18366 original-namespace-name
18367 namespace-alias
18369 Returns the NAMESPACE_DECL for the namespace. */
18371 static tree
18373 {
18374 tree identifier;
18375 tree namespace_decl;
18379 /* Get the name of the namespace. */
18384 /* Look up the identifier in the currently active scope. Look only
18385 for namespaces, due to:
18387 [basic.lookup.udir]
18389 When looking up a namespace-name in a using-directive or alias
18390 definition, only namespace names are considered.
18392 And:
18394 [basic.lookup.qual]
18396 During the lookup of a name preceding the :: scope resolution
18397 operator, object, function, and enumerator names are ignored.
18399 (Note that cp_parser_qualifying_entity only calls this
18400 function if the token after the name is the scope resolution
18401 operator.) */
18403 none_type,
18409 /* If it's not a namespace, issue an error. */
18412 {
18414 {
18420 }
18423 }
18426 }
18428 /* Parse a namespace-definition.
18430 namespace-definition:
18431 named-namespace-definition
18432 unnamed-namespace-definition
18434 named-namespace-definition:
18435 original-namespace-definition
18436 extension-namespace-definition
18438 original-namespace-definition:
18439 namespace identifier { namespace-body }
18441 extension-namespace-definition:
18442 namespace original-namespace-name { namespace-body }
18444 unnamed-namespace-definition:
18445 namespace { namespace-body } */
18447 static void
18449 {
18450 tree identifier;
18459 {
18462 }
18464 /* Look for the `namespace' keyword. */
18465 cp_token* token
18468 /* Parse any specified attributes before the identifier. */
18472 {
18476 {
18479 /* Parse any attributes specified after the identifier. */
18481 }
18488 "nested namespace definitions only available with "
18491 /* Nested namespace names can create new namespaces (unlike
18492 other qualified-ids). */
18495 else
18498 }
18510 /* Start the namespace. */
18517 /* Look for the `{' to validate starting the namespace. */
18518 matching_braces braces;
18520 {
18521 /* Parse the body of the namespace. */
18524 /* Look for the final `}'. */
18526 }
18531 /* Pop the nested namespace definitions. */
18534 }
18536 /* Parse a namespace-body.
18538 namespace-body:
18539 declaration-seq [opt] */
18541 static void
18543 {
18545 }
18547 /* Parse a namespace-alias-definition.
18549 namespace-alias-definition:
18550 namespace identifier = qualified-namespace-specifier ; */
18552 static void
18554 {
18555 tree identifier;
18556 tree namespace_specifier;
18560 /* Look for the `namespace' keyword. */
18562 /* Look for the identifier. */
18566 /* Look for the `=' token. */
18569 {
18571 /* Skip the definition. */
18576 }
18578 /* Look for the qualified-namespace-specifier. */
18579 namespace_specifier
18581 /* Look for the `;' token. */
18584 /* Register the alias in the symbol table. */
18586 }
18588 /* Parse a qualified-namespace-specifier.
18590 qualified-namespace-specifier:
18591 :: [opt] nested-name-specifier [opt] namespace-name
18593 Returns a NAMESPACE_DECL corresponding to the specified
18594 namespace. */
18596 static tree
18598 {
18599 /* Look for the optional `::'. */
18603 /* Look for the optional nested-name-specifier. */
18611 }
18613 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18614 access declaration.
18616 using-declaration:
18617 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18618 using :: unqualified-id ;
18620 access-declaration:
18621 qualified-id ;
18623 */
18625 static bool
18628 {
18632 tree decl;
18633 tree identifier;
18634 tree qscope;
18639 {
18642 }
18643 else
18644 {
18645 /* Look for the `using' keyword. */
18648 again:
18649 /* Peek at the next token. */
18651 /* See if it's `typename'. */
18653 {
18654 /* Remember that we've seen it. */
18656 /* Consume the `typename' token. */
18658 }
18659 }
18661 /* Look for the optional global scope qualification. */
18662 global_scope_p
18667 /* If we saw `typename', or didn't see `::', then there must be a
18668 nested-name-specifier present. */
18670 {
18676 {
18679 }
18680 }
18681 /* Otherwise, we could be in either of the two productions. In that
18682 case, treat the nested-name-specifier as optional. */
18683 else
18695 /* Something has already gone wrong; there's no need to parse
18696 further. Since an error has occurred, the return value of
18697 cp_parser_parse_definitely will be false, as required. */
18701 /* Parse the unqualified-id. */
18709 {
18714 }
18716 {
18721 "pack expansion in using-declaration only available "
18724 }
18726 /* The function we call to handle a using-declaration is different
18727 depending on what scope we are in. */
18729 ;
18732 /* [namespace.udecl]
18734 A using declaration shall not name a template-id. */
18737 else
18738 {
18740 {
18741 /* Create the USING_DECL. */
18748 {
18751 }
18752 else
18753 /* Add it to the list of members in this class. */
18755 }
18756 else
18757 {
18759 identifier,
18766 {
18769 }
18772 else
18774 }
18775 }
18779 {
18783 "comma-separated list in using-declaration only available "
18786 }
18788 /* Look for the final `;'. */
18793 "access declarations are deprecated "
18794 "in favour of using-declarations; "
18798 }
18800 /* Parse an alias-declaration.
18802 alias-declaration:
18803 using identifier attribute-specifier-seq [opt] = type-id */
18805 static tree
18807 {
18809 location_t id_location;
18811 cp_decl_specifier_seq decl_specs;
18815 /* Look for the `using' keyword. */
18816 cp_token *using_token
18838 /* Now we are going to parse the type-id of the declaration. */
18840 /*
18841 [dcl.type]/3 says:
18843 "A type-specifier-seq shall not define a class or enumeration
18844 unless it appears in the type-id of an alias-declaration (7.1.3) that
18845 is not the declaration of a template-declaration."
18847 In other words, if we currently are in an alias template, the
18848 type-id should not define a type.
18850 So let's set parser->type_definition_forbidden_message in that
18851 case; cp_parser_check_type_definition (called by
18852 cp_parser_class_specifier) will then emit an error if a type is
18853 defined in the type-id. */
18855 {
18859 }
18863 /* Restore the error message if need be. */
18869 {
18872 }
18874 /* A typedef-name can also be introduced by an alias-declaration. The
18875 identifier following the using keyword becomes a typedef-name. It has
18876 the same semantics as if it were introduced by the typedef
18877 specifier. In particular, it does not define a new type and it shall
18878 not appear in the type-id. */
18883 {
18886 ds_attribute,
18887 attrs_token);
18888 }
18890 ds_typedef,
18891 using_token);
18893 ds_alias,
18894 using_token);
18903 else
18909 // Attach constraints to the alias declaration.
18911 {
18915 }
18922 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18923 added into the symbol table; otherwise, return the TYPE_DECL. */
18927 {
18931 }
18934 }
18936 /* Parse a using-directive.
18938 using-directive:
18939 using namespace :: [opt] nested-name-specifier [opt]
18940 namespace-name ; */
18942 static void
18944 {
18945 tree namespace_decl;
18946 tree attribs;
18948 /* Look for the `using' keyword. */
18950 /* And the `namespace' keyword. */
18952 /* Look for the optional `::' operator. */
18954 /* And the optional nested-name-specifier. */
18960 /* Get the namespace being used. */
18962 /* And any specified attributes. */
18965 /* Update the symbol table. */
18968 else
18971 /* Look for the final `;'. */
18973 }
18975 /* Parse an asm-definition.
18977 asm-definition:
18978 asm ( string-literal ) ;
18980 GNU Extension:
18982 asm-definition:
18983 asm volatile [opt] ( string-literal ) ;
18984 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18985 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18986 : asm-operand-list [opt] ) ;
18987 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18988 : asm-operand-list [opt]
18989 : asm-clobber-list [opt] ) ;
18990 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18991 : asm-clobber-list [opt]
18992 : asm-goto-list ) ; */
18994 static void
18996 {
18997 tree string;
19002 tree asm_stmt;
19010 /* Look for the `asm' keyword. */
19015 {
19018 }
19020 /* See if the next token is `volatile'. */
19023 {
19024 /* Remember that we saw the `volatile' keyword. */
19026 /* Consume the token. */
19028 }
19032 {
19033 /* Remember that we saw the `goto' keyword. */
19035 /* Consume the token. */
19037 }
19038 /* Look for the opening `('. */
19041 /* Look for the string. */
19044 {
19048 }
19050 /* If we're allowing GNU extensions, check for the extended assembly
19051 syntax. Unfortunately, the `:' tokens need not be separated by
19052 a space in C, and so, for compatibility, we tolerate that here
19053 too. Doing that means that we have to treat the `::' operator as
19054 two `:' tokens. */
19059 {
19064 /* The extended syntax was used. */
19067 /* Look for outputs. */
19069 {
19070 /* Consume the `:'. */
19072 /* Parse the output-operands. */
19074 CPP_COLON)
19076 CPP_SCOPE)
19078 CPP_CLOSE_PAREN)
19080 {
19084 }
19085 }
19086 /* If the next token is `::', there are no outputs, and the
19087 next token is the beginning of the inputs. */
19089 /* The inputs are coming next. */
19092 /* Look for inputs. */
19095 {
19096 /* Consume the `:' or `::'. */
19098 /* Parse the output-operands. */
19100 CPP_COLON)
19102 CPP_SCOPE)
19104 CPP_CLOSE_PAREN))
19105 {
19109 }
19110 }
19112 /* The clobbers are coming next. */
19115 /* Look for clobbers. */
19118 {
19120 /* Consume the `:' or `::'. */
19122 /* Parse the clobbers. */
19124 CPP_COLON)
19126 CPP_CLOSE_PAREN))
19128 }
19131 /* The labels are coming next. */
19134 /* Look for labels. */
19137 {
19139 /* Consume the `:' or `::'. */
19141 /* Parse the labels. */
19143 }
19147 }
19151 /* Look for the closing `)'. */
19159 {
19160 /* Create the ASM_EXPR. */
19162 {
19165 /* If the extended syntax was not used, mark the ASM_EXPR. */
19167 {
19173 }
19174 }
19175 else
19177 }
19178 }
19180 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19181 type that comes from the decl-specifier-seq. */
19183 static tree
19185 {
19188 {
19201 }
19204 }
19206 /* Declarators [gram.dcl.decl] */
19208 /* Parse an init-declarator.
19210 init-declarator:
19211 declarator initializer [opt]
19213 GNU Extension:
19215 init-declarator:
19216 declarator asm-specification [opt] attributes [opt] initializer [opt]
19218 function-definition:
19219 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19220 function-body
19221 decl-specifier-seq [opt] declarator function-try-block
19223 GNU Extension:
19225 function-definition:
19226 __extension__ function-definition
19228 TM Extension:
19230 function-definition:
19231 decl-specifier-seq [opt] declarator function-transaction-block
19233 The DECL_SPECIFIERS apply to this declarator. Returns a
19234 representation of the entity declared. If MEMBER_P is TRUE, then
19235 this declarator appears in a class scope. The new DECL created by
19236 this declarator is returned.
19238 The CHECKS are access checks that should be performed once we know
19239 what entity is being declared (and, therefore, what classes have
19240 befriended it).
19242 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19243 for a function-definition here as well. If the declarator is a
19244 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19245 be TRUE upon return. By that point, the function-definition will
19246 have been completely parsed.
19248 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19249 is FALSE.
19251 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19252 parsed declaration if it is an uninitialized single declarator not followed
19253 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19254 if present, will not be consumed. If returned, this declarator will be
19255 created with SD_INITIALIZED but will not call cp_finish_decl.
19257 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19258 and there is an initializer, the pointed location_t is set to the
19259 location of the '=' or `(', or '{' in C++11 token introducing the
19260 initializer. */
19262 static tree
19273 {
19277 tree prefix_attributes;
19279 tree asm_specification;
19280 tree initializer;
19282 tree scope;
19284 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19285 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19286 "(...)". */
19297 /* Gather the attributes that were provided with the
19298 decl-specifiers. */
19301 /* Assume that this is not the declarator for a function
19302 definition. */
19306 /* Default arguments are only permitted for function parameters. */
19310 /* Defer access checks while parsing the declarator; we cannot know
19311 what names are accessible until we know what is being
19312 declared. */
19317 /* Parse the declarator. */
19318 declarator
19323 /* Gather up the deferred checks. */
19328 /* If the DECLARATOR was erroneous, there's no need to go
19329 further. */
19333 /* Check that the number of template-parameter-lists is OK. */
19343 /* Figure out what scope the entity declared by the DECLARATOR is
19344 located in. `grokdeclarator' sometimes changes the scope, so
19345 we compute it now. */
19348 /* Perform any lookups in the declared type which were thought to be
19349 dependent, but are not in the scope of the declarator. */
19350 decl_specifiers->type
19353 /* If we're allowing GNU extensions, look for an
19354 asm-specification. */
19356 {
19357 /* Look for an asm-specification. */
19360 }
19361 else
19364 /* Look for attributes. */
19368 /* Peek at the next token. */
19374 {
19375 /* Handle C++17 deduction guides. */
19379 {
19387 {
19391 }
19392 }
19394 /* Check to see if the token indicates the start of a
19395 function-definition. */
19397 {
19399 {
19400 /* If a function-definition should not appear here, issue an
19401 error message. */
19405 }
19407 location_t func_brace_location
19410 /* Neither attributes nor an asm-specification are allowed
19411 on a function-definition. */
19414 "an asm-specification is not allowed "
19418 "attributes are not allowed "
19420 /* This is a function-definition. */
19423 /* Parse the function definition. */
19426 decl_specifiers,
19427 declarator,
19428 prefix_attributes);
19429 else
19430 decl =
19431 (cp_parser_function_definition_from_specifiers_and_declarator
19435 {
19436 /* This is where the prologue starts... */
19439 }
19442 }
19443 }
19445 {
19446 /* A non-template declaration involving a function parameter list
19447 containing an implicit template parameter will be made into a
19448 template. If the resulting declaration is not going to be an
19449 actual function then finish the template scope here to prevent it.
19450 An error message will be issued once we have a decl to talk about.
19452 FIXME probably we should do type deduction rather than create an
19453 implicit template, but the standard currently doesn't allow it. */
19456 }
19458 /* [dcl.dcl]
19460 Only in function declarations for constructors, destructors, type
19461 conversions, and deduction guides can the decl-specifier-seq be omitted.
19463 We explicitly postpone this check past the point where we handle
19464 function-definitions because we tolerate function-definitions
19465 that are missing their return types in some modes. */
19467 {
19471 }
19473 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19477 {
19488 {
19494 }
19495 }
19496 else
19497 {
19498 /* If the init-declarator isn't initialized and isn't followed by a
19499 `,' or `;', it's not a valid init-declarator. */
19502 {
19505 else
19506 {
19510 }
19511 }
19514 }
19516 /* Because start_decl has side-effects, we should only call it if we
19517 know we're going ahead. By this point, we know that we cannot
19518 possibly be looking at any other construct. */
19521 /* Enter the newly declared entry in the symbol table. If we're
19522 processing a declaration in a class-specifier, we wait until
19523 after processing the initializer. */
19525 {
19533 /* Adjust location of decl if declarator->id_loc is more appropriate:
19534 set, and decl wasn't merged with another decl, in which case its
19535 location would be different from input_location, and more accurate. */
19540 }
19542 /* Enter the SCOPE. That way unqualified names appearing in the
19543 initializer will be looked up in SCOPE. */
19546 /* Perform deferred access control checks, now that we know in which
19547 SCOPE the declared entity resides. */
19549 {
19552 /* If the entity being declared is a function, pretend that we
19553 are in its scope. If it is a `friend', it may have access to
19554 things that would not otherwise be accessible. */
19556 {
19559 }
19561 /* Perform access checks for template parameters. */
19564 /* Perform the access control checks for the declarator and the
19565 decl-specifiers. */
19568 /* Restore the saved value. */
19571 }
19573 /* Parse the initializer. */
19578 {
19580 {
19583 else
19584 {
19585 /* If the declaration was erroneous, we don't really
19586 know what the user intended, so just silently
19587 consume the initializer. */
19594 }
19595 }
19596 else
19597 {
19598 /* We want to record the extra mangling scope for in-class
19599 initializers of class members and initializers of static data
19600 member templates. The former involves deferring
19601 parsing of the initializer until end of class as with default
19602 arguments. So right here we only handle the latter. */
19612 }
19613 }
19615 /* The old parser allows attributes to appear after a parenthesized
19616 initializer. Mark Mitchell proposed removing this functionality
19617 on the GCC mailing lists on 2002-08-13. This parser accepts the
19618 attributes -- but ignores them. */
19625 /* And now complain about a non-function implicit template. */
19630 /* For an in-class declaration, use `grokfield' to create the
19631 declaration. */
19633 {
19635 {
19638 }
19647 }
19649 /* Finish processing the declaration. But, skip member
19650 declarations. */
19652 {
19655 asm_specification,
19656 /* If the initializer is in parentheses, then this is
19657 a direct-initialization, which means that an
19658 `explicit' constructor is OK. Otherwise, an
19659 `explicit' constructor cannot be used. */
19662 }
19665 /* Core issue #226 (C++0x only): A default template-argument
19666 shall not be specified in a friend class template
19667 declaration. */
19676 {
19679 else
19681 }
19688 }
19690 /* Parse a declarator.
19692 declarator:
19693 direct-declarator
19694 ptr-operator declarator
19696 abstract-declarator:
19697 ptr-operator abstract-declarator [opt]
19698 direct-abstract-declarator
19700 GNU Extensions:
19702 declarator:
19703 attributes [opt] direct-declarator
19704 attributes [opt] ptr-operator declarator
19706 abstract-declarator:
19707 attributes [opt] ptr-operator abstract-declarator [opt]
19708 attributes [opt] direct-abstract-declarator
19710 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19711 detect constructors, destructors, deduction guides, or conversion operators.
19712 It is set to -1 if the declarator is a name, and +1 if it is a
19713 function. Otherwise it is set to zero. Usually you just want to
19714 test for >0, but internally the negative value is used.
19716 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19717 a decl-specifier-seq unless it declares a constructor, destructor,
19718 or conversion. It might seem that we could check this condition in
19719 semantic analysis, rather than parsing, but that makes it difficult
19720 to handle something like `f()'. We want to notice that there are
19721 no decl-specifiers, and therefore realize that this is an
19722 expression, not a declaration.)
19724 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19725 the declarator is a direct-declarator of the form "(...)".
19727 MEMBER_P is true iff this declarator is a member-declarator.
19729 FRIEND_P is true iff this declarator is a friend. */
19733 cp_parser_declarator_kind dcl_kind,
19737 {
19740 cp_cv_quals cv_quals;
19741 tree class_type;
19744 /* Assume this is not a constructor, destructor, or type-conversion
19745 operator. */
19752 /* Check for the ptr-operator production. */
19754 /* Parse the ptr-operator. */
19760 /* If that worked, then we have a ptr-operator. */
19762 {
19763 /* If a ptr-operator was found, then this declarator was not
19764 parenthesized. */
19767 /* The dependent declarator is optional if we are parsing an
19768 abstract-declarator. */
19772 /* Parse the dependent declarator. */
19777 friend_p);
19779 /* If we are parsing an abstract-declarator, we must handle the
19780 case where the dependent declarator is absent. */
19785 declarator = cp_parser_make_indirect_declarator
19787 }
19788 /* Everything else is a direct-declarator. */
19789 else
19790 {
19793 CPP_OPEN_PAREN);
19795 ctor_dtor_or_conv_p,
19797 }
19802 }
19804 /* Parse a direct-declarator or direct-abstract-declarator.
19806 direct-declarator:
19807 declarator-id
19808 direct-declarator ( parameter-declaration-clause )
19809 cv-qualifier-seq [opt]
19810 ref-qualifier [opt]
19811 exception-specification [opt]
19812 direct-declarator [ constant-expression [opt] ]
19813 ( declarator )
19815 direct-abstract-declarator:
19816 direct-abstract-declarator [opt]
19817 ( parameter-declaration-clause )
19818 cv-qualifier-seq [opt]
19819 ref-qualifier [opt]
19820 exception-specification [opt]
19821 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19822 ( abstract-declarator )
19824 Returns a representation of the declarator. DCL_KIND is
19825 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19826 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19827 we are parsing a direct-declarator. It is
19828 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19829 of ambiguity we prefer an abstract declarator, as per
19830 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19831 as for cp_parser_declarator. */
19835 cp_parser_declarator_kind dcl_kind,
19838 {
19849 {
19850 /* Peek at the next token. */
19853 {
19854 /* This is either a parameter-declaration-clause, or a
19855 parenthesized declarator. When we know we are parsing a
19856 named declarator, it must be a parenthesized declarator
19857 if FIRST is true. For instance, `(int)' is a
19858 parameter-declaration-clause, with an omitted
19859 direct-abstract-declarator. But `((*))', is a
19860 parenthesized abstract declarator. Finally, when T is a
19861 template parameter `(T)' is a
19862 parameter-declaration-clause, and not a parenthesized
19863 named declarator.
19865 We first try and parse a parameter-declaration-clause,
19866 and then try a nested declarator (if FIRST is true).
19868 It is not an error for it not to be a
19869 parameter-declaration-clause, even when FIRST is
19870 false. Consider,
19872 int i (int);
19873 int i (3);
19875 The first is the declaration of a function while the
19876 second is the definition of a variable, including its
19877 initializer.
19879 Having seen only the parenthesis, we cannot know which of
19880 these two alternatives should be selected. Even more
19881 complex are examples like:
19883 int i (int (a));
19884 int i (int (3));
19886 The former is a function-declaration; the latter is a
19887 variable initialization.
19889 Thus again, we try a parameter-declaration-clause, and if
19890 that fails, we back out and return. */
19893 {
19894 tree params;
19899 /* In a member-declarator, the only valid interpretation
19900 of a parenthesis is the start of a
19901 parameter-declaration-clause. (It is invalid to
19902 initialize a static data member with a parenthesized
19903 initializer; only the "=" form of initialization is
19904 permitted.) */
19908 /* Consume the `('. */
19909 matching_parens parens;
19912 {
19913 /* If this is going to be an abstract declarator, we're
19914 in a declarator and we can't have default args. */
19917 }
19921 /* Parse the parameter-declaration-clause. */
19924 /* Consume the `)'. */
19927 /* If all went well, parse the cv-qualifier-seq,
19928 ref-qualifier and the exception-specification. */
19930 {
19931 cp_cv_quals cv_quals;
19932 cp_virt_specifiers virt_specifiers;
19933 cp_ref_qualifier ref_qual;
19934 tree exception_specification;
19935 tree late_return;
19936 tree attrs;
19946 /* Parse the cv-qualifier-seq. */
19948 /* Parse the ref-qualifier. */
19950 /* Parse the tx-qualifier. */
19952 /* And the exception-specification. */
19953 exception_specification
19958 /* In here, we handle cases where attribute is used after
19959 the function declaration. For example:
19960 void func (int x) __attribute__((vector(..))); */
19963 late_return = (cp_parser_late_return_type_opt
19967 /* Parse the virt-specifier-seq. */
19970 /* Create the function-declarator. */
19972 params,
19973 cv_quals,
19974 virt_specifiers,
19975 ref_qual,
19976 tx_qual,
19977 exception_specification,
19978 late_return,
19979 requires_clause);
19982 /* Any subsequent parameter lists are to do with
19983 return type, so are not those of the declared
19984 function. */
19986 }
19988 /* Remove the function parms from scope. */
19992 /* Repeat the main loop. */
19994 }
19996 /* If this is the first, we can try a parenthesized
19997 declarator. */
19999 {
20006 /* Consume the `('. */
20007 matching_parens parens;
20009 /* Parse the nested declarator. */
20012 declarator
20018 /* Expect a `)'. */
20026 }
20027 /* Otherwise, we must be done. */
20028 else
20030 }
20034 {
20035 /* Parse an array-declarator. */
20045 /* Consume the `['. */
20047 /* Peek at the next token. */
20049 /* If the next token is `]', then there is no
20050 constant-expression. */
20052 {
20054 bounds
20064 {
20065 /* Normally, the array bound must be an integral constant
20066 expression. However, as an extension, we allow VLAs
20067 in function scopes as long as they aren't part of a
20068 parameter declaration. */
20072 }
20075 {
20076 /* Remember this wasn't a constant-expression. */
20079 }
20080 }
20081 else
20083 /* Look for the closing `]'. */
20085 {
20088 }
20093 }
20095 {
20096 {
20097 tree qualifying_scope;
20098 tree unqualified_name;
20099 tree attrs;
20100 special_function_kind sfk;
20105 /* Parse a declarator-id */
20108 {
20111 /* If we see an ellipsis, we should be looking at a
20112 parameter pack. */
20114 {
20115 /* Consume the `...' */
20119 }
20120 }
20123 unqualified_name
20127 {
20131 {
20132 /* Check whether an error occurred. */
20135 /* We already consumed the ellipsis to mark a
20136 parameter pack, but we have no way to report it,
20137 so abort the tentative parse. We will be exiting
20138 immediately anyway. */
20140 }
20141 else
20147 && (qualifying_scope
20149 {
20152 }
20153 }
20158 {
20163 }
20169 {
20170 /* In the declaration of a member of a template class
20171 outside of the class itself, the SCOPE will sometimes
20172 be a TYPENAME_TYPE. For example, given:
20174 template <typename T>
20175 int S<T>::R::i = 3;
20177 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20178 this context, we must resolve S<T>::R to an ordinary
20179 type, rather than a typename type.
20181 The reason we normally avoid resolving TYPENAME_TYPEs
20182 is that a specialization of `S' might render
20183 `S<T>::R' not a type. However, if `S' is
20184 specialized, then this `i' will not be used, so there
20185 is no harm in resolving the types here. */
20186 tree type;
20188 /* Resolve the TYPENAME_TYPE. */
20191 /* If that failed, the declarator is invalid. */
20193 {
20196 "cannot define member of dependent typedef "
20198 else
20203 }
20205 }
20210 {
20211 tree class_type;
20216 else
20220 {
20224 {
20225 /* We do not attempt to print the declarator
20226 here because we do not have enough
20227 information about its original syntactic
20228 form. */
20232 }
20235 {
20239 "use %<%T::%D%> instead of %<%T::%D%> to "
20241 class_type,
20246 }
20248 }
20251 {
20258 for an unnamed type, even if the type
20259 got a name for linkage purposes. */
20261 /* Handle correctly (c++/19200):
20263 struct S {
20264 struct T{};
20265 friend void S(T);
20266 };
20268 and also:
20270 namespace N {
20271 void S();
20272 }
20274 struct S {
20275 friend void N::S();
20276 }; */
20279 class_type))
20288 }
20289 }
20291 unqualified_name,
20292 sfk);
20299 }
20301 handle_declarator:;
20304 {
20305 /* Any names that appear after the declarator-id for a
20306 member are looked up in the containing scope. */
20308 {
20309 /* But declarations with qualified-ids can't appear in a
20310 function. */
20314 }
20316 }
20320 /* Default args are only allowed on function
20321 declarations. */
20323 else
20327 }
20328 /* We're done. */
20329 else
20331 }
20333 /* For an abstract declarator, we might wind up with nothing at this
20334 point. That's an error; the declarator is not optional. */
20338 {
20339 /* Record overly parenthesized declarator so we can give a
20340 diagnostic about confusing decl/expr disambiguation. */
20342 {
20343 /* If the open and close parens are on different lines, this
20344 is probably a formatting thing, so ignore. */
20349 }
20352 }
20354 /* If we entered a scope, we must exit it now. */
20362 }
20364 /* Parse a ptr-operator.
20366 ptr-operator:
20367 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20368 * cv-qualifier-seq [opt]
20369 &
20370 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20371 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20373 GNU Extension:
20375 ptr-operator:
20376 & cv-qualifier-seq [opt]
20378 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20379 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20380 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20381 filled in with the TYPE containing the member. *CV_QUALS is
20382 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20383 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20384 Note that the tree codes returned by this function have nothing
20385 to do with the types of trees that will be eventually be created
20386 to represent the pointer or reference type being parsed. They are
20387 just constants with suggestive names. */
20388 static enum tree_code
20393 {
20398 /* Assume that it's not a pointer-to-member. */
20400 /* And that there are no cv-qualifiers. */
20403 /* Peek at the next token. */
20406 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20416 {
20417 /* Consume the `*', `&' or `&&'. */
20420 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20421 `&', if we are allowing GNU extensions. (The only qualifier
20422 that can legally appear after `&' is `restrict', but that is
20423 enforced during semantic analysis. */
20431 }
20432 else
20433 {
20434 /* Try the pointer-to-member case. */
20436 /* Look for the optional `::' operator. */
20439 /* Look for the nested-name specifier. */
20446 /* If we found it, and the next token is a `*', then we are
20447 indeed looking at a pointer-to-member operator. */
20450 {
20451 /* Indicate that the `*' operator was used. */
20459 else
20460 {
20461 /* The type of which the member is a member is given by the
20462 current SCOPE. */
20464 /* The next name will not be qualified. */
20468 /* Look for optional c++11 attributes. */
20472 /* Look for the optional cv-qualifier-seq. */
20474 }
20475 }
20476 /* If that didn't work we don't have a ptr-operator. */
20479 }
20482 }
20484 /* Parse an (optional) cv-qualifier-seq.
20486 cv-qualifier-seq:
20487 cv-qualifier cv-qualifier-seq [opt]
20489 cv-qualifier:
20490 const
20491 volatile
20493 GNU Extension:
20495 cv-qualifier:
20496 __restrict__
20498 Returns a bitmask representing the cv-qualifiers. */
20500 static cp_cv_quals
20502 {
20506 {
20508 cp_cv_quals cv_qualifier;
20510 /* Peek at the next token. */
20512 /* See if it's a cv-qualifier. */
20514 {
20530 }
20536 {
20541 }
20542 else
20543 {
20546 }
20547 }
20550 }
20552 /* Parse an (optional) ref-qualifier
20554 ref-qualifier:
20555 &
20556 &&
20558 Returns cp_ref_qualifier representing ref-qualifier. */
20560 static cp_ref_qualifier
20562 {
20565 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20570 {
20575 {
20587 }
20592 {
20595 }
20596 else
20597 {
20600 }
20601 }
20604 }
20606 /* Parse an optional tx-qualifier.
20608 tx-qualifier:
20609 transaction_safe
20610 transaction_safe_dynamic */
20612 static tree
20614 {
20617 {
20622 {
20626 {
20629 {
20632 }
20633 else
20635 }
20636 }
20637 }
20639 }
20641 /* Parse an (optional) virt-specifier-seq.
20643 virt-specifier-seq:
20644 virt-specifier virt-specifier-seq [opt]
20646 virt-specifier:
20647 override
20648 final
20650 Returns a bitmask representing the virt-specifiers. */
20652 static cp_virt_specifiers
20654 {
20658 {
20660 cp_virt_specifiers virt_specifier;
20662 /* Peek at the next token. */
20664 /* See if it's a virt-specifier-qualifier. */
20668 {
20671 }
20673 {
20676 }
20678 {
20680 }
20681 else
20685 {
20690 }
20691 else
20692 {
20695 }
20696 }
20698 }
20700 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20701 is in scope even though it isn't real. */
20703 void
20705 {
20706 tree this_parm;
20709 {
20710 /* We don't clear this between NSDMIs. Is it already what we want? */
20717 }
20720 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20722 current_class_ref
20725 }
20727 /* Return true iff our current scope is a non-static data member
20728 initializer. */
20730 bool
20732 {
20733 /* We recognize NSDMI context by the context-less 'this' pointer set up
20734 by the function above. */
20740 }
20742 /* Parse a late-specified return type, if any. This is not a separate
20743 non-terminal, but part of a function declarator, which looks like
20745 -> trailing-type-specifier-seq abstract-declarator(opt)
20747 Returns the type indicated by the type-id.
20749 In addition to this, parse any queued up #pragma omp declare simd
20750 clauses, and #pragma acc routine clauses.
20752 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20753 function. */
20755 static tree
20758 {
20762 && declarator
20766 && declarator
20769 /* Peek at the next token. */
20771 /* A late-specified return type is indicated by an initial '->'. */
20782 {
20783 /* DR 1207: 'this' is in scope in the trailing return type. */
20785 }
20788 {
20789 /* Consume the ->. */
20793 }
20795 /* Function declarations may be followed by a trailing
20796 requires-clause. */
20800 declarator->attributes
20804 declarator->attributes
20809 {
20812 }
20815 }
20817 /* Parse a declarator-id.
20819 declarator-id:
20820 id-expression
20821 :: [opt] nested-name-specifier [opt] type-name
20823 In the `id-expression' case, the value returned is as for
20824 cp_parser_id_expression if the id-expression was an unqualified-id.
20825 If the id-expression was a qualified-id, then a SCOPE_REF is
20826 returned. The first operand is the scope (either a NAMESPACE_DECL
20827 or TREE_TYPE), but the second is still just a representation of an
20828 unqualified-id. */
20830 static tree
20832 {
20833 tree id;
20834 /* The expression must be an id-expression. Assume that qualified
20835 names are the names of types so that:
20837 template <class T>
20838 int S<T>::R::i = 3;
20840 will work; we must treat `S<T>::R' as the name of a type.
20841 Similarly, assume that qualified names are templates, where
20842 required, so that:
20844 template <class T>
20845 int S<T>::R<T>::i = 3;
20847 will work, too. */
20853 optional_p);
20857 }
20859 /* Parse a type-id.
20861 type-id:
20862 type-specifier-seq abstract-declarator [opt]
20864 Returns the TYPE specified. */
20866 static tree
20869 {
20870 cp_decl_specifier_seq type_specifier_seq;
20873 /* Parse the type-specifier-seq. */
20875 is_trailing_return,
20880 /* A bare template name as a template argument is a template template
20881 argument, not a placeholder, so fail parsing it as a type argument. */
20882 {
20886 }
20890 /* There might or might not be an abstract declarator. */
20892 /* Look for the declarator. */
20893 abstract_declarator
20898 /* Check to see if there really was a declarator. */
20903 /* The concepts TS allows 'auto' as a type-id. */
20905 /* None of the valid uses of 'auto' in C++14 involve the type-id
20906 nonterminal, but it is valid in a trailing-return-type. */
20909 {
20910 /* A type-id with type 'auto' is only ok if the abstract declarator
20911 is a function declarator with a late-specified return type.
20913 A type-id with 'auto' is also valid in a trailing-return-type
20914 in a compound-requirement. */
20921 else
20922 {
20925 {
20927 auto_node);
20929 tmpl);
20930 }
20931 else
20934 }
20935 }
20938 is_template_arg);
20939 }
20941 static tree
20943 {
20945 }
20947 static tree
20949 {
20950 tree r;
20952 parser->type_definition_forbidden_message
20957 {
20960 }
20962 }
20964 static tree
20966 {
20968 }
20970 /* Parse a type-specifier-seq.
20972 type-specifier-seq:
20973 type-specifier type-specifier-seq [opt]
20975 GNU extension:
20977 type-specifier-seq:
20978 attributes type-specifier-seq [opt]
20980 If IS_DECLARATION is true, we are at the start of a "condition" or
20981 exception-declaration, so we might be followed by a declarator-id.
20983 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20984 i.e. we've just seen "->".
20986 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20988 static void
20993 {
20998 /* Clear the TYPE_SPECIFIER_SEQ. */
21001 /* In the context of a trailing return type, enum E { } is an
21002 elaborated-type-specifier followed by a function-body, not an
21003 enum-specifier. */
21007 /* Parse the type-specifiers and attributes. */
21009 {
21010 tree type_specifier;
21013 /* Check for attributes first. */
21015 {
21020 }
21022 /* record the token of the beginning of the type specifier seq,
21023 for error reporting purposes*/
21027 /* Look for the type-specifier. */
21029 flags,
21030 type_specifier_seq,
21032 NULL,
21035 {
21036 /* If the first type-specifier could not be found, this is not a
21037 type-specifier-seq at all. */
21039 {
21040 /* Set in_declarator_p to avoid skipping to the semicolon. */
21052 }
21053 /* If subsequent type-specifiers could not be found, the
21054 type-specifier-seq is complete. */
21056 }
21059 /* The standard says that a condition can be:
21061 type-specifier-seq declarator = assignment-expression
21063 However, given:
21065 struct S {};
21066 if (int S = ...)
21068 we should treat the "S" as a declarator, not as a
21069 type-specifier. The standard doesn't say that explicitly for
21070 type-specifier-seq, but it does say that for
21071 decl-specifier-seq in an ordinary declaration. Perhaps it
21072 would be clearer just to allow a decl-specifier-seq here, and
21073 then add a semantic restriction that if any decl-specifiers
21074 that are not type-specifiers appear, the program is invalid. */
21077 }
21078 }
21080 /* Return whether the function currently being declared has an associated
21081 template parameter list. */
21083 static bool
21085 {
21098 }
21100 /* Parse a parameter-declaration-clause.
21102 parameter-declaration-clause:
21103 parameter-declaration-list [opt] ... [opt]
21104 parameter-declaration-list , ...
21106 Returns a representation for the parameter declarations. A return
21107 value of NULL indicates a parameter-declaration-clause consisting
21108 only of an ellipsis. */
21110 static tree
21112 {
21113 tree parameters;
21122 parser->auto_is_implicit_function_template_parm_p
21124 }
21130 && !processing_template_parmlist
21136 /* Peek at the next token. */
21138 /* Check for trivial parameter-declaration-clauses. */
21140 {
21141 /* Consume the `...' token. */
21144 }
21146 /* There are no parameters. */
21147 {
21148 #ifndef NO_IMPLICIT_EXTERN_C
21153 else
21154 #endif
21156 }
21157 /* Check for `(void)', too, which is a special case. */
21161 {
21162 /* Consume the `void' token. */
21164 /* There are no parameters. */
21166 }
21168 /* Parse the parameter-declaration-list. */
21170 /* If a parse error occurred while parsing the
21171 parameter-declaration-list, then the entire
21172 parameter-declaration-clause is erroneous. */
21176 /* Peek at the next token. */
21178 /* If it's a `,', the clause should terminate with an ellipsis. */
21180 {
21181 /* Consume the `,'. */
21183 /* Expect an ellipsis. */
21184 ellipsis_p
21186 }
21187 /* It might also be `...' if the optional trailing `,' was
21188 omitted. */
21190 {
21191 /* Consume the `...' token. */
21193 /* And remember that we saw it. */
21195 }
21196 else
21199 /* Finish the parameter list. */
21204 }
21206 /* Parse a parameter-declaration-list.
21208 parameter-declaration-list:
21209 parameter-declaration
21210 parameter-declaration-list , parameter-declaration
21212 Returns a representation of the parameter-declaration-list, as for
21213 cp_parser_parameter_declaration_clause. However, the
21214 `void_list_node' is never appended to the list. Upon return,
21215 *IS_ERROR will be true iff an error occurred. */
21217 static tree
21219 {
21225 /* Assume all will go well. */
21227 /* The special considerations that apply to a function within an
21228 unbraced linkage specifications do not apply to the parameters
21229 to the function. */
21230 saved_in_unbraced_linkage_specification_p
21234 /* Look for more parameters. */
21236 {
21244 /* Parse the parameter. */
21245 parameter
21250 /* We don't know yet if the enclosing context is deprecated, so wait
21251 and warn in grokparms if appropriate. */
21255 {
21256 /* If a function parameter pack was specified and an implicit template
21257 parameter was introduced during cp_parser_parameter_declaration,
21258 change any implicit parameters introduced into packs. */
21262 {
21270 }
21274 PARM,
21279 }
21283 /* If a parse error occurred parsing the parameter declaration,
21284 then the entire parameter-declaration-list is erroneous. */
21286 {
21290 }
21300 {
21304 }
21306 /* Add the new parameter to the list. */
21310 /* Peek at the next token. */
21313 /* These are for Objective-C++ */
21316 /* The parameter-declaration-list is complete. */
21319 {
21322 /* Peek at the next token. */
21324 /* If it's an ellipsis, then the list is complete. */
21327 /* Otherwise, there must be more parameters. Consume the
21328 `,'. */
21330 /* When parsing something like:
21332 int i(float f, double d)
21334 we can tell after seeing the declaration for "f" that we
21335 are not looking at an initialization of a variable "i",
21336 but rather at the declaration of a function "i".
21338 Due to the fact that the parsing of template arguments
21339 (as specified to a template-id) requires backtracking we
21340 cannot use this technique when inside a template argument
21341 list. */
21345 /* However, a parameter-declaration of the form
21346 "float(f)" (which is a valid declaration of a
21347 parameter "f") can also be interpreted as an
21348 expression (the conversion of "f" to "float"). */
21351 }
21352 else
21353 {
21361 }
21362 }
21364 parser->in_unbraced_linkage_specification_p
21367 /* Reset implicit_template_scope if we are about to leave the function
21368 parameter list that introduced it. Note that for out-of-line member
21369 definitions, there will be one or more class scopes before we get to
21370 the template parameter scope. */
21374 {
21378 {
21381 }
21382 }
21385 }
21387 /* Parse a parameter declaration.
21389 parameter-declaration:
21390 decl-specifier-seq ... [opt] declarator
21391 decl-specifier-seq declarator = assignment-expression
21392 decl-specifier-seq ... [opt] abstract-declarator [opt]
21393 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21395 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21396 declares a template parameter. (In that case, a non-nested `>'
21397 token encountered during the parsing of the assignment-expression
21398 is not interpreted as a greater-than operator.)
21400 Returns a representation of the parameter, or NULL if an error
21401 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21402 true iff the declarator is of the form "(p)". */
21408 {
21410 cp_decl_specifier_seq decl_specifiers;
21412 tree default_argument;
21417 /* In a template parameter, `>' is not an operator.
21419 [temp.param]
21421 When parsing a default template-argument for a non-type
21422 template-parameter, the first non-nested `>' is taken as the end
21423 of the template parameter-list rather than a greater-than
21424 operator. */
21426 /* Type definitions may not appear in parameter types. */
21428 parser->type_definition_forbidden_message
21431 /* Parse the declaration-specifiers. */
21434 CP_PARSER_FLAGS_NONE,
21438 /* Complain about missing 'typename' or other invalid type names. */
21443 /* If an error occurred, there's no reason to attempt to parse the
21444 rest of the declaration. */
21446 {
21449 }
21451 /* Peek at the next token. */
21454 /* If the next token is a `)', `,', `=', `>', or `...', then there
21455 is no declarator. However, when variadic templates are enabled,
21456 there may be a declarator following `...'. */
21461 {
21465 }
21466 /* Otherwise, there should be a declarator. */
21467 else
21468 {
21472 /* After seeing a decl-specifier-seq, if the next token is not a
21473 "(", there is no possibility that the code is a valid
21474 expression. Therefore, if parsing tentatively, we commit at
21475 this point. */
21477 /* In an expression context, having seen:
21479 (int((char ...
21481 we cannot be sure whether we are looking at a
21482 function-type (taking a "char" as a parameter) or a cast
21483 of some object of type "char" to "int". */
21489 /* Parse the declarator. */
21492 CP_PARSER_DECLARATOR_EITHER,
21494 parenthesized_p,
21498 /* After the declarator, allow more attributes. */
21499 decl_specifiers.attributes
21503 /* If the declarator is a template parameter pack, remember that and
21504 clear the flag in the declarator itself so we don't get errors
21505 from grokdeclarator. */
21507 {
21510 }
21511 }
21513 /* If the next token is an ellipsis, and we have not seen a declarator
21514 name, and if either the type of the declarator contains parameter
21515 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21516 for, eg, abbreviated integral type names), then we actually have a
21517 parameter pack expansion expression. Otherwise, leave the ellipsis
21518 for a C-style variadic function. */
21521 {
21532 {
21533 /* Consume the `...'. */
21537 /* Build a pack expansion type */
21542 else
21544 }
21545 }
21547 /* The restriction on defining new types applies only to the type
21548 of the parameter, not to the default argument. */
21551 /* If the next token is `=', then process a default argument. */
21553 {
21556 /* If we are defining a class, then the tokens that make up the
21557 default argument must be saved and processed later. */
21563 // A constrained-type-specifier may declare a type template-parameter.
21565 default_argument
21568 // A constrained-type-specifier may declare a template-template-parameter.
21570 default_argument
21573 /* Outside of a class definition, we can just parse the
21574 assignment-expression. */
21575 else
21576 default_argument
21580 {
21582 "default arguments are only "
21584 }
21586 || template_parameter_pack_p
21589 {
21590 /* Find the name of the parameter pack. */
21597 template_parm_p
21603 else
21605 template_parm_p
21612 }
21613 }
21614 else
21617 /* Generate a location for the parameter, ranging from the start of the
21618 initial token to the end of the final token (using input_location for
21619 the latter, set up by cp_lexer_set_source_position_from_token when
21620 consuming tokens).
21622 If we have a identifier, then use it for the caret location, e.g.
21624 extern int callee (int one, int (*two)(int, int), float three);
21625 ~~~~~~^~~~~~~~~~~~~~
21627 otherwise, reuse the start location for the caret location e.g.:
21629 extern int callee (int one, int (*)(int, int), float three);
21630 ^~~~~~~~~~~~~~~~~
21632 */
21638 input_location);
21641 declarator,
21642 default_argument,
21643 param_loc,
21644 template_parameter_pack_p);
21645 }
21647 /* Parse a default argument and return it.
21649 TEMPLATE_PARM_P is true if this is a default argument for a
21650 non-type template parameter. */
21651 static tree
21653 {
21659 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21660 set correctly. */
21663 /* Local variable names (and the `this' keyword) may not
21664 appear in a default argument. */
21667 /* Parse the assignment-expression. */
21672 /* The "this" pointer is not valid in a default argument. */
21674 {
21679 }
21680 default_argument
21682 /* Restore the "this" pointer. */
21684 {
21687 }
21696 }
21698 /* Parse a function-body.
21700 function-body:
21701 compound_statement */
21703 static void
21705 {
21709 }
21711 /* Parse a ctor-initializer-opt followed by a function-body. Return
21712 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21713 is true we are parsing a function-try-block. */
21715 static void
21718 {
21725 /* Begin the function body. */
21727 /* Parse the optional ctor-initializer. */
21730 /* If we're parsing a constexpr constructor definition, we need
21731 to check that the constructor body is indeed empty. However,
21732 before we get to cp_parser_function_body lot of junk has been
21733 generated, so we can't just check that we have an empty block.
21734 Rather we take a snapshot of the outermost block, and check whether
21735 cp_parser_function_body changed its state. */
21737 {
21741 }
21742 /* Parse the function-body. */
21746 /* Finish the function body. */
21748 }
21750 /* Parse an initializer.
21752 initializer:
21753 = initializer-clause
21754 ( expression-list )
21756 Returns an expression representing the initializer. If no
21757 initializer is present, NULL_TREE is returned.
21759 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21760 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21761 set to TRUE if there is no initializer present. If there is an
21762 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21763 is set to true; otherwise it is set to false. */
21765 static tree
21768 {
21770 tree init;
21772 /* Peek at the next token. */
21775 /* Let our caller know whether or not this initializer was
21776 parenthesized. */
21778 /* Assume that the initializer is constant. */
21782 {
21783 /* Consume the `='. */
21785 /* Parse the initializer-clause. */
21787 }
21789 {
21794 non_constant_p);
21799 }
21801 {
21806 }
21807 else
21808 {
21809 /* Anything else is an error. */
21812 }
21818 }
21820 /* Parse an initializer-clause.
21822 initializer-clause:
21823 assignment-expression
21824 braced-init-list
21826 Returns an expression representing the initializer.
21828 If the `assignment-expression' production is used the value
21829 returned is simply a representation for the expression.
21831 Otherwise, calls cp_parser_braced_list. */
21833 static cp_expr
21835 {
21836 cp_expr initializer;
21838 /* Assume the expression is constant. */
21841 /* If it is not a `{', then we are looking at an
21842 assignment-expression. */
21844 {
21845 initializer
21848 non_constant_p);
21849 }
21850 else
21854 }
21856 /* Parse a brace-enclosed initializer list.
21858 braced-init-list:
21859 { initializer-list , [opt] }
21860 { designated-initializer-list , [opt] }
21861 { }
21863 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21864 the elements of the initializer-list (or NULL, if the last
21865 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21866 NULL_TREE. There is no way to detect whether or not the optional
21867 trailing `,' was provided. NON_CONSTANT_P is as for
21868 cp_parser_initializer. */
21870 static cp_expr
21872 {
21873 tree initializer;
21876 /* Consume the `{' token. */
21877 matching_braces braces;
21879 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21881 /* If it's not a `}', then there is a non-trivial initializer. */
21883 {
21884 /* Parse the initializer list. */
21887 /* A trailing `,' token is allowed. */
21890 }
21891 else
21893 /* Now, there should be a trailing `}'. */
21899 /* Build a location of the form:
21900 { ... }
21901 ^~~~~~~
21902 with caret==start at the open brace, finish at the close brace. */
21906 }
21908 /* Consume tokens up to, and including, the next non-nested closing `]'.
21909 Returns true iff we found a closing `]'. */
21911 static bool
21913 {
21917 {
21921 {
21924 /* If we've run out of tokens, then there is no closing `]'. */
21933 {
21936 }
21941 }
21943 /* Consume the token. */
21945 }
21946 }
21948 /* Return true if we are looking at an array-designator, false otherwise. */
21950 static bool
21952 {
21953 /* Consume the `['. */
21958 /* Skip tokens until the next token is a closing square bracket.
21959 If we find the closing `]', and the next token is a `=', then
21960 we are looking at an array designator. */
21961 bool array_designator_p
21965 /* Roll back the tokens we skipped. */
21969 }
21971 /* Parse an initializer-list.
21973 initializer-list:
21974 initializer-clause ... [opt]
21975 initializer-list , initializer-clause ... [opt]
21977 C++2A Extension:
21979 designated-initializer-list:
21980 designated-initializer-clause
21981 designated-initializer-list , designated-initializer-clause
21983 designated-initializer-clause:
21984 designator brace-or-equal-initializer
21986 designator:
21987 . identifier
21989 GNU Extension:
21991 initializer-list:
21992 designation initializer-clause ...[opt]
21993 initializer-list , designation initializer-clause ...[opt]
21995 designation:
21996 . identifier =
21997 identifier :
21998 [ constant-expression ] =
22000 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22001 for the initializer. If the INDEX of the elt is non-NULL, it is the
22002 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22003 as for cp_parser_initializer. */
22007 {
22012 /* Assume all of the expressions are constant. */
22015 /* Parse the rest of the list. */
22017 {
22019 tree designator;
22020 tree initializer;
22024 /* Handle the C++2A syntax, '. id ='. */
22032 {
22035 "C++ designated initializers only available with "
22037 /* Consume the `.'. */
22039 /* Consume the identifier. */
22042 /* Consume the `='. */
22044 }
22045 /* Also, if the next token is an identifier and the following one is a
22046 colon, we are looking at the GNU designated-initializer
22047 syntax. */
22052 {
22053 /* Warn the user that they are using an extension. */
22056 /* Consume the identifier. */
22058 /* Consume the `:'. */
22060 }
22061 /* Also handle C99 array designators, '[ const ] ='. */
22065 {
22066 /* In C++11, [ could start a lambda-introducer. */
22072 {
22075 }
22076 else
22077 {
22082 }
22089 /* Warn the user that they are using an extension. */
22092 }
22093 else
22097 {
22100 }
22104 {
22108 }
22112 /* Parse the initializer. */
22115 /* If any clause is non-constant, so is the entire initializer. */
22119 /* If we have an ellipsis, this is an initializer pack
22120 expansion. */
22122 {
22125 /* Consume the `...'. */
22132 /* Turn the initializer into an initializer expansion. */
22134 }
22136 /* Add it to the vector. */
22139 /* If the next token is not a comma, we have reached the end of
22140 the list. */
22144 /* Peek at the next token. */
22146 /* If the next token is a `}', then we're still done. An
22147 initializer-clause can have a trailing `,' after the
22148 initializer-list and before the closing `}'. */
22152 /* Consume the `,' token. */
22154 }
22156 /* The same identifier shall not appear in multiple designators
22157 of a designated-initializer-list. */
22159 {
22164 {
22166 {
22168 "%<.%s%> designator used multiple times in "
22172 }
22173 else
22175 }
22179 }
22182 }
22184 /* Classes [gram.class] */
22186 /* Parse a class-name.
22188 class-name:
22189 identifier
22190 template-id
22192 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22193 to indicate that names looked up in dependent types should be
22194 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22195 keyword has been used to indicate that the name that appears next
22196 is a template. TAG_TYPE indicates the explicit tag given before
22197 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22198 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22199 is the class being defined in a class-head. If ENUM_OK is TRUE,
22200 enum-names are also accepted.
22202 Returns the TYPE_DECL representing the class. */
22204 static tree
22213 {
22214 tree decl;
22215 tree scope;
22220 /* All class-names start with an identifier. */
22223 {
22226 }
22228 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22229 to a template-id, so we save it here. */
22234 /* Any name names a type if we're following the `typename' keyword
22235 in a qualified name where the enclosing scope is type-dependent. */
22238 /* Handle the common case (an identifier, but not a template-id)
22239 efficiently. */
22242 {
22246 /* Look for the identifier. */
22250 /* If the next token isn't an identifier, we are certainly not
22251 looking at a class-name. */
22254 /* If we know this is a type-name, there's no need to look it
22255 up. */
22258 else
22259 {
22260 tree ambiguous_decls;
22261 /* If we already know that this lookup is ambiguous, then
22262 we've already issued an error message; there's no reason
22263 to check again. */
22265 {
22268 }
22269 /* If the next token is a `::', then the name must be a type
22270 name.
22272 [basic.lookup.qual]
22274 During the lookup for a name preceding the :: scope
22275 resolution operator, object, function, and enumerator
22276 names are ignored. */
22279 /* Look up the name. */
22281 tag_type,
22284 check_dependency_p,
22288 {
22292 }
22293 }
22294 }
22295 else
22296 {
22297 /* Try a template-id. */
22299 check_dependency_p,
22300 tag_type,
22301 is_declaration);
22304 }
22308 /* If this is a typename, create a TYPENAME_TYPE. */
22310 {
22315 }
22319 /* Check to see that it is really the name of a class. */
22323 /* Situations like this:
22325 template <typename T> struct A {
22326 typename T::template X<int>::I i;
22327 };
22329 are problematic. Is `T::template X<int>' a class-name? The
22330 standard does not seem to be definitive, but there is no other
22331 valid interpretation of the following `::'. Therefore, those
22332 names are considered class-names. */
22333 {
22337 }
22342 /* In Objective-C 2.0, a classname followed by '.' starts a
22343 dot-syntax expression, and it's not a type-name. */
22355 }
22357 /* Parse a class-specifier.
22359 class-specifier:
22360 class-head { member-specification [opt] }
22362 Returns the TREE_TYPE representing the class. */
22364 static tree
22366 {
22367 tree type;
22381 /* Parse the class-head. */
22384 /* If the class-head was a semantic disaster, skip the entire body
22385 of the class. */
22387 {
22391 }
22393 /* Look for the `{'. */
22394 matching_braces braces;
22396 {
22399 }
22404 /* Issue an error message if type-definitions are forbidden here. */
22406 /* Remember that we are defining one more class. */
22408 /* Inside the class, surrounding template-parameter-lists do not
22409 apply. */
22410 saved_num_template_parameter_lists
22413 /* We are not in a function body. */
22416 /* Or in a loop. */
22419 /* Or in a switch. */
22422 /* We are not immediately inside an extern "lang" block. */
22423 saved_in_unbraced_linkage_specification_p
22427 // Associate constraints with the type.
22431 /* Start the class. */
22433 {
22436 }
22440 /* If the type is erroneous, skip the entire body of the class. */
22442 else
22443 /* Parse the member-specification. */
22446 /* Look for the trailing `}'. */
22448 /* Look for trailing attributes to apply to this class. */
22456 /* We've finished a type definition. Check for the common syntax
22457 error of forgetting a semicolon after the definition. We need to
22458 be careful, as we can't just check for not-a-semicolon and be done
22459 with it; the user might have typed:
22461 class X { } c = ...;
22462 class X { } *p = ...;
22464 and so forth. Instead, enumerate all the possible tokens that
22465 might follow this production; if we don't see one of them, then
22466 complain and silently insert the semicolon. */
22467 {
22472 /* Don't try to parse c++11 attributes here. As per the
22473 grammar, that should be a task for
22474 cp_parser_decl_specifier_seq. */
22478 {
22489 /* While it's legal for type qualifiers and storage class
22490 specifiers to follow type definitions in the grammar, only
22491 compiler testsuites contain code like that. Assume that if
22492 we see such code, then what we're really seeing is a case
22493 like:
22495 class X { }
22496 const <type> var = ...;
22498 or
22500 class Y { }
22501 static <type> func (...) ...
22503 i.e. the qualifier or specifier applies to the next
22504 declaration. To do so, however, we need to look ahead one
22505 more token to see if *that* token is a type specifier.
22507 This code could be improved to handle:
22509 class Z { }
22510 static const <type> var = ...; */
22513 {
22516 /* Handling user-defined types here would be nice, but very
22517 tricky. */
22518 want_semicolon
22521 }
22525 }
22527 /* If we don't have a type, then something is very wrong and we
22528 shouldn't try to do anything clever. Likewise for not seeing the
22529 closing brace. */
22531 {
22532 /* Locate the closing brace. */
22533 cp_token_position prev
22538 /* We want to suggest insertion of a ';' immediately *after* the
22539 closing brace, so, if we can, offset the location by 1 column. */
22546 /* If we successfully offset the location, suggest the fix-it. */
22559 else
22562 /* Unget one token and smash it to look as though we encountered
22563 a semicolon in the input stream. */
22568 }
22569 }
22571 /* If this class is not itself within the scope of another class,
22572 then we need to parse the bodies of all of the queued function
22573 definitions. Note that the queued functions defined in a class
22574 are not always processed immediately following the
22575 class-specifier for that class. Consider:
22577 struct A {
22578 struct B { void f() { sizeof (A); } };
22579 };
22581 If `f' were processed before the processing of `A' were
22582 completed, there would be no way to compute the size of `A'.
22583 Note that the nesting we are interested in here is lexical --
22584 not the semantic nesting given by TYPE_CONTEXT. In particular,
22585 for:
22587 struct A { struct B; };
22588 struct A::B { void f() { } };
22590 there is no need to delay the parsing of `A::B::f'. */
22592 {
22593 tree decl;
22600 /* In a first pass, parse default arguments to the functions.
22601 Then, in a second pass, parse the bodies of the functions.
22602 This two-phased approach handles cases like:
22604 struct S {
22605 void f() { g(); }
22606 void g(int i = 3);
22607 };
22609 */
22611 {
22613 /* If there are default arguments that have not yet been processed,
22614 take care of them now. */
22616 {
22621 }
22622 /* Make sure that any template parameters are in scope. */
22624 /* Parse the default argument expressions. */
22626 /* Remove any template parameters from the symbol table. */
22628 }
22630 /* Now parse any NSDMIs. */
22634 {
22636 {
22641 }
22644 }
22651 /* Now do some post-NSDMI bookkeeping. */
22657 /* Now parse the body of the functions. */
22659 {
22660 /* OpenMP UDRs need to be parsed before all other functions. */
22667 }
22668 else
22672 }
22673 else
22676 /* Put back any saved access checks. */
22679 /* Restore saved state. */
22683 parser->num_template_parameter_lists
22685 parser->in_unbraced_linkage_specification_p
22689 }
22691 static tree
22693 {
22694 tree ret;
22699 }
22701 /* Parse a class-head.
22703 class-head:
22704 class-key identifier [opt] base-clause [opt]
22705 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22706 class-key nested-name-specifier [opt] template-id
22707 base-clause [opt]
22709 class-virt-specifier:
22710 final
22712 GNU Extensions:
22713 class-key attributes identifier [opt] base-clause [opt]
22714 class-key attributes nested-name-specifier identifier base-clause [opt]
22715 class-key attributes nested-name-specifier [opt] template-id
22716 base-clause [opt]
22718 Upon return BASES is initialized to the list of base classes (or
22719 NULL, if there are none) in the same form returned by
22720 cp_parser_base_clause.
22722 Returns the TYPE of the indicated class. Sets
22723 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22724 involving a nested-name-specifier was used, and FALSE otherwise.
22726 Returns error_mark_node if this is not a class-head.
22728 Returns NULL_TREE if the class-head is syntactically valid, but
22729 semantically invalid in a way that means we should skip the entire
22730 body of the class. */
22732 static tree
22735 {
22736 tree nested_name_specifier;
22740 tree attributes;
22741 tree bases;
22751 /* Assume no nested-name-specifier will be present. */
22753 /* Assume no template parameter lists will be used in defining the
22754 type. */
22758 /* Look for the class-key. */
22765 /* Parse the attributes. */
22768 /* If the next token is `::', that is invalid -- but sometimes
22769 people do try to write:
22771 struct ::S {};
22773 Handle this gracefully by accepting the extra qualifier, and then
22774 issuing an error about it later if this really is a
22775 class-head. If it turns out just to be an elaborated type
22776 specifier, remain silent. */
22782 /* Determine the name of the class. Begin by looking for an
22783 optional nested-name-specifier. */
22785 nested_name_specifier
22791 /* If there was a nested-name-specifier, then there *must* be an
22792 identifier. */
22797 {
22799 /* Although the grammar says `identifier', it really means
22800 `class-name' or `template-name'. You are only allowed to
22801 define a class that has already been declared with this
22802 syntax.
22804 The proposed resolution for Core Issue 180 says that wherever
22805 you see `class T::X' you should treat `X' as a type-name.
22807 It is OK to define an inaccessible class; for example:
22809 class A { class B; };
22810 class A::B {};
22812 We do not know if we will see a class-name, or a
22813 template-name. We look for a class-name first, in case the
22814 class-name is a template-id; if we looked for the
22815 template-name first we would stop after the template-name. */
22822 class_type,
22826 /* If that didn't work, ignore the nested-name-specifier. */
22828 {
22834 }
22835 /* If we could not find a corresponding TYPE, treat this
22836 declaration like an unqualified declaration. */
22839 /* Otherwise, count the number of templates used in TYPE and its
22840 containing scopes. */
22841 else
22842 {
22843 tree scope;
22855 }
22856 }
22857 /* Otherwise, the identifier is optional. */
22858 else
22859 {
22860 /* We don't know whether what comes next is a template-id,
22861 an identifier, or nothing at all. */
22863 /* Check for a template-id. */
22868 class_key,
22870 /* If that didn't work, it could still be an identifier. */
22872 {
22874 {
22877 }
22878 else
22880 }
22881 else
22882 {
22885 }
22886 }
22891 {
22893 class_key,
22895 }
22898 /* If it's not a `:' or a `{' then we can't really be looking at a
22899 class-head, since a class-head only appears as part of a
22900 class-specifier. We have to detect this situation before calling
22901 xref_tag, since that has irreversible side-effects. */
22903 {
22907 }
22909 /* At this point, we're going ahead with the class-specifier, even
22910 if some other problem occurs. */
22913 {
22918 }
22919 /* Issue the error about the overly-qualified name now. */
22921 {
22926 }
22928 {
22933 }
22935 {
22936 tree scope;
22939 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22940 keyword template shall not appear at the top level. */
22944 /* Reject typedef-names in class heads. */
22946 {
22949 type);
22952 }
22954 /* Figure out in what scope the declaration is being placed. */
22956 /* If that scope does not contain the scope in which the
22957 class was originally declared, the program is invalid. */
22959 {
22962 "declaration of %qD in namespace %qD which does not "
22965 else
22971 }
22972 /* [dcl.meaning]
22974 A declarator-id shall not be qualified except for the
22975 definition of a ... nested class outside of its class
22976 ... [or] the definition or explicit instantiation of a
22977 class member of a namespace outside of its namespace. */
22979 {
22984 }
22985 }
22986 /* An explicit-specialization must be preceded by "template <>". If
22987 it is not, try to recover gracefully. */
22990 && !processing_template_parmlist
22992 {
22993 /* Build a location of this form:
22994 struct typename <ARGS>
22995 ^~~~~~~~~~~~~~~~~~~~~~
22996 with caret==start at the start token, and
22997 finishing at the end of the type. */
22998 location_t reported_loc
23000 class_head_start_location,
23006 "an explicit specialization must be preceded by"
23009 /* Take the same action that would have been taken by
23010 cp_parser_explicit_specialization. */
23013 }
23014 /* There must be no "return" statements between this point and the
23015 end of this function; set "type "to the correct return value and
23016 use "goto done;" to return. */
23017 /* Make sure that the right number of template parameters were
23018 present. */
23022 {
23023 /* If something went wrong, there is no point in even trying to
23024 process the class-definition. */
23027 }
23029 /* Look up the type. */
23031 {
23035 {
23039 }
23040 else
23041 {
23045 /* Check the scope while we still know whether or not we had a
23046 nested-name-specifier. */
23049 }
23052 }
23054 {
23055 tree class_type;
23057 /* Given:
23059 template <typename T> struct S { struct T };
23060 template <typename T> struct S<T>::T { };
23062 we will get a TYPENAME_TYPE when processing the definition of
23063 `S::T'. We need to resolve it to the actual type before we
23064 try to define it. */
23066 {
23071 else
23072 {
23075 }
23076 }
23080 {
23083 }
23086 /* Enter the scope indicated by the nested-name-specifier. */
23088 /* Get the canonical version of this type. */
23090 /* Call push_template_decl if it seems like we should be defining a
23091 template either from the template headers or the type we're
23092 defining, so that we diagnose both extra and missing headers. */
23096 {
23099 {
23102 }
23103 }
23107 }
23109 {
23110 /* If the class was unnamed, create a dummy name. */
23114 ? ts_within_enclosing_non_class
23118 }
23120 /* Indicate whether this class was declared as a `class' or as a
23121 `struct'. */
23126 /* If this type was already complete, and we see another definition,
23127 that's an error. */
23129 {
23131 type);
23133 type);
23136 }
23141 {
23142 /* Apply attributes now, before any use of the class as a template
23143 argument in its base list. */
23146 }
23148 /* We will have entered the scope containing the class; the names of
23149 base classes should be looked up in that context. For example:
23151 struct A { struct B {}; struct C; };
23152 struct A::C : B {};
23154 is valid. */
23156 /* Get the list of base-classes, if there is one. */
23158 {
23159 /* PR59482: enter the class scope so that base-specifiers are looked
23160 up correctly. */
23164 /* PR59482: get out of the previously pushed class scope so that the
23165 subsequent pops pop the right thing. */
23168 }
23169 else
23172 /* If we're really defining a class, process the base classes.
23173 If they're invalid, fail. */
23177 done:
23178 /* Leave the scope given by the nested-name-specifier. We will
23179 enter the class scope itself while processing the members. */
23184 {
23187 }
23193 out:
23196 }
23198 /* Parse a class-key.
23200 class-key:
23201 class
23202 struct
23203 union
23205 Returns the kind of class-key specified, or none_type to indicate
23206 error. */
23208 static enum tag_types
23210 {
23214 /* Look for the class-key. */
23219 /* Check to see if the TOKEN is a class-key. */
23224 }
23226 /* Parse a type-parameter-key.
23228 type-parameter-key:
23229 class
23230 typename
23231 */
23233 static void
23235 {
23236 /* Look for the type-parameter-key. */
23240 {
23243 /* typename is not allowed in a template template parameter
23244 by the standard until C++17. */
23246 "ISO C++ forbids typename key in template template parameter;"
23248 }
23249 else
23253 }
23255 /* Parse an (optional) member-specification.
23257 member-specification:
23258 member-declaration member-specification [opt]
23259 access-specifier : member-specification [opt] */
23261 static void
23263 {
23265 {
23269 /* Peek at the next token. */
23271 /* If it's a `}', or EOF then we've seen all the members. */
23277 /* See if this token is a keyword. */
23280 {
23284 /* Consume the access-specifier. */
23286 /* Remember which access-specifier is active. */
23288 /* Look for the `:'. */
23293 /* Accept #pragmas at class scope. */
23295 {
23298 }
23300 /* Otherwise, the next construction must be a
23301 member-declaration. */
23303 }
23304 }
23305 }
23307 /* Parse a member-declaration.
23309 member-declaration:
23310 decl-specifier-seq [opt] member-declarator-list [opt] ;
23311 function-definition ; [opt]
23312 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23313 using-declaration
23314 template-declaration
23315 alias-declaration
23317 member-declarator-list:
23318 member-declarator
23319 member-declarator-list , member-declarator
23321 member-declarator:
23322 declarator pure-specifier [opt]
23323 declarator constant-initializer [opt]
23324 identifier [opt] : constant-expression
23326 GNU Extensions:
23328 member-declaration:
23329 __extension__ member-declaration
23331 member-declarator:
23332 declarator attributes [opt] pure-specifier [opt]
23333 declarator attributes [opt] constant-initializer [opt]
23334 identifier [opt] attributes [opt] : constant-expression
23336 C++0x Extensions:
23338 member-declaration:
23339 static_assert-declaration */
23341 static void
23343 {
23344 cp_decl_specifier_seq decl_specifiers;
23345 tree prefix_attributes;
23346 tree decl;
23355 /* Check for the `__extension__' keyword. */
23357 {
23358 /* Recurse. */
23360 /* Restore the old value of the PEDANTIC flag. */
23364 }
23366 /* Check for a template-declaration. */
23368 {
23369 /* An explicit specialization here is an error condition, and we
23370 expect the specialization handler to detect and report this. */
23374 else
23378 }
23379 /* Check for a template introduction. */
23383 /* Check for a using-declaration. */
23385 {
23387 {
23388 /* Parse the using-declaration. */
23392 }
23393 else
23394 {
23395 tree decl;
23399 /* Note that if we actually see the '=' token after the
23400 identifier, cp_parser_alias_declaration commits the
23401 tentative parse. In that case, we really expect an
23402 alias-declaration. Otherwise, we expect a using
23403 declaration. */
23404 alias_decl_expected =
23410 else
23414 }
23415 }
23417 /* Check for @defs. */
23419 {
23424 {
23429 }
23431 }
23433 /* If the next token is `static_assert' we have a static assertion. */
23435 {
23438 }
23445 /* Parse the decl-specifier-seq. */
23448 CP_PARSER_FLAGS_OPTIONAL,
23451 /* Check for an invalid type-name. */
23455 /* If there is no declarator, then the decl-specifier-seq should
23456 specify a type. */
23458 {
23459 /* If there was no decl-specifier-seq, and the next token is a
23460 `;', then we have something like:
23462 struct S { ; };
23464 [class.mem]
23466 Each member-declaration shall declare at least one member
23467 name of the class. */
23469 {
23472 {
23476 }
23477 }
23478 else
23479 {
23480 tree type;
23482 /* See if this declaration is a friend. */
23484 /* If there were decl-specifiers, check to see if there was
23485 a class-declaration. */
23488 /* Nested classes have already been added to the class, but
23489 a `friend' needs to be explicitly registered. */
23491 {
23492 /* If the `friend' keyword was present, the friend must
23493 be introduced with a class-key. */
23496 "in C++03 a class-key must be used "
23498 /* In this case:
23500 template <typename T> struct A {
23501 friend struct A<T>::B;
23502 };
23504 A<T>::B will be represented by a TYPENAME_TYPE, and
23505 therefore not recognized by check_tag_decl. */
23507 {
23511 }
23514 "friend declaration does not name a class or "
23516 else
23519 }
23520 /* If there is no TYPE, an error message will already have
23521 been issued. */
23523 ;
23524 /* An anonymous aggregate has to be handled specially; such
23525 a declaration really declares a data member (with a
23526 particular type), as opposed to a nested class. */
23528 {
23529 /* C++11 9.5/6. */
23532 "a storage class on an anonymous aggregate "
23535 /* Remove constructors and such from TYPE, now that we
23536 know it is an anonymous aggregate. */
23538 /* And make the corresponding data member. */
23541 /* Add it to the class. */
23543 }
23544 else
23545 cp_parser_check_access_in_redeclaration
23548 }
23549 }
23550 else
23551 {
23554 /* Clear attributes from the decl_specifiers but keep them
23555 around as prefix attributes that apply them to the entity
23556 being declared. */
23560 /* See if these declarations will be friends. */
23563 /* Keep going until we hit the `;' at the end of the
23564 declaration. */
23566 {
23568 tree first_attribute;
23569 tree initializer;
23573 /* Peek at the next token. */
23576 /* The following code wants to know early if it is a bit-field
23577 or some other declaration. Attributes can appear before
23578 the `:' token, but are hopefully rare enough that the
23579 simplicity of the tentative lookup pays off. */
23584 {
23592 }
23594 /* Check for a bitfield declaration. */
23600 {
23601 tree identifier;
23602 tree width;
23607 else
23610 /* Look for attributes that apply to the bitfield. */
23613 /* Consume the `:' token. */
23616 /* Get the width of the bitfield. */
23620 /* In C++2A and as extension for C++11 and above we allow
23621 default member initializers for bit-fields. */
23626 CPP_OPEN_BRACE)))
23627 {
23628 location_t loc
23634 "default member initializers for bit-fields "
23635 "only available with -std=c++2a or "
23640 {
23644 }
23645 }
23646 else
23647 {
23648 /* Look for attributes that apply to the bitfield after
23649 the `:' token and width. This is where GCC used to
23650 parse attributes in the past, pedwarn if there is
23651 a std attribute. */
23654 "ISO C++ allows bit-field attributes only "
23658 }
23662 /* Remember which attributes are prefix attributes and
23663 which are not. */
23665 /* Combine the attributes. */
23668 /* Create the bitfield declaration. */
23671 identifier,
23672 sfk_none)
23676 attributes);
23677 }
23678 else
23679 {
23681 tree asm_specification;
23684 /* Parse the declarator. */
23685 declarator
23690 friend_p);
23692 /* If something went wrong parsing the declarator, make sure
23693 that we at least consume some tokens. */
23695 {
23696 /* Skip to the end of the statement. */
23698 /* If the next token is not a semicolon, that is
23699 probably because we just skipped over the body of
23700 a function. So, we consume a semicolon if
23701 present, but do not issue an error message if it
23702 is not present. */
23704 CPP_SEMICOLON))
23707 }
23710 cp_parser_check_for_definition_in_return_type
23714 /* Look for an asm-specification. */
23716 /* Look for attributes that apply to the declaration. */
23718 /* Remember which attributes are prefix attributes and
23719 which are not. */
23721 /* Combine the attributes. */
23724 /* If it's an `=', then we have a constant-initializer or a
23725 pure-specifier. It is not correct to parse the
23726 initializer before registering the member declaration
23727 since the member declaration should be in scope while
23728 its initializer is processed. However, the rest of the
23729 front end does not yet provide an interface that allows
23730 us to handle this correctly. */
23732 {
23733 /* In [class.mem]:
23735 A pure-specifier shall be used only in the declaration of
23736 a virtual function.
23738 A member-declarator can contain a constant-initializer
23739 only if it declares a static member of integral or
23740 enumeration type.
23742 Therefore, if the DECLARATOR is for a function, we look
23743 for a pure-specifier; otherwise, we look for a
23744 constant-initializer. When we call `grokfield', it will
23745 perform more stringent semantics checks. */
23757 {
23759 /* Don't require a constant rvalue in C++11, since we
23760 might want a reference constant. We'll enforce
23761 constancy later. */
23763 /* Parse the initializer. */
23766 }
23767 else
23768 /* Parse the initializer. */
23770 }
23773 {
23777 else
23779 }
23780 /* Otherwise, there is no initializer. */
23781 else
23784 /* See if we are probably looking at a function
23785 definition. We are certainly not looking at a
23786 member-declarator. Calling `grokfield' has
23787 side-effects, so we must not do it unless we are sure
23788 that we are looking at a member-declarator. */
23791 {
23792 /* The grammar does not allow a pure-specifier to be
23793 used when a member function is defined. (It is
23794 possible that this fact is an oversight in the
23795 standard, since a pure function may be defined
23796 outside of the class-specifier. */
23802 declarator,
23803 attributes);
23806 /* If the member was not a friend, declare it here. */
23809 /* Peek at the next token. */
23811 /* If the next token is a semicolon, consume it. */
23813 {
23814 location_t semicolon_loc
23819 "extra %<;%> after in-class "
23821 }
23823 }
23824 else
23827 /* Create the declaration. */
23832 {
23835 else
23837 }
23838 }
23843 /* Reset PREFIX_ATTRIBUTES. */
23849 /* If there is any qualification still in effect, clear it
23850 now; we will be starting fresh with the next declarator. */
23854 /* If it's a `,', then there are more declarators. */
23856 {
23859 {
23865 }
23866 }
23867 /* If the next token isn't a `;', then we have a parse error. */
23869 CPP_SEMICOLON))
23870 {
23871 /* The next token might be a ways away from where the
23872 actual semicolon is missing. Find the previous token
23873 and use that for our error position. */
23880 /* Assume that the user meant to provide a semicolon. If
23881 we were to cp_parser_skip_to_end_of_statement, we might
23882 skip to a semicolon inside a member function definition
23883 and issue nonsensical error messages. */
23885 }
23888 {
23889 /* Add DECL to the list of members. */
23891 /* Explicitly include, eg, NSDMIs, for better error
23892 recovery (c++/58650). */
23900 /* Add DECL to the queue of NSDMI to be parsed later. */
23902 }
23906 }
23907 }
23910 out:
23912 }
23914 /* Parse a pure-specifier.
23916 pure-specifier:
23917 = 0
23919 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23920 Otherwise, ERROR_MARK_NODE is returned. */
23922 static tree
23924 {
23927 /* Look for the `=' token. */
23930 /* Look for the `0' token. */
23939 /* Accept = default or = delete in c++0x mode. */
23942 {
23945 }
23947 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23949 {
23954 }
23956 {
23959 }
23962 }
23964 /* Parse a constant-initializer.
23966 constant-initializer:
23967 = constant-expression
23969 Returns a representation of the constant-expression. */
23971 static tree
23973 {
23974 /* Look for the `=' token. */
23978 /* It is invalid to write:
23980 struct S { static const int i = { 7 }; };
23982 */
23984 {
23987 /* Consume the opening brace. */
23988 matching_braces braces;
23990 /* Skip the initializer. */
23992 /* Look for the trailing `}'. */
23996 }
23999 }
24001 /* Derived classes [gram.class.derived] */
24003 /* Parse a base-clause.
24005 base-clause:
24006 : base-specifier-list
24008 base-specifier-list:
24009 base-specifier ... [opt]
24010 base-specifier-list , base-specifier ... [opt]
24012 Returns a TREE_LIST representing the base-classes, in the order in
24013 which they were declared. The representation of each node is as
24014 described by cp_parser_base_specifier.
24016 In the case that no bases are specified, this function will return
24017 NULL_TREE, not ERROR_MARK_NODE. */
24019 static tree
24021 {
24024 /* Look for the `:' that begins the list. */
24027 /* Scan the base-specifier-list. */
24029 {
24031 tree base;
24034 /* Look for the base-specifier. */
24036 /* Look for the (optional) ellipsis. */
24038 {
24039 /* Consume the `...'. */
24043 }
24045 /* Add BASE to the front of the list. */
24047 {
24049 /* Make this a pack expansion type. */
24053 {
24056 }
24057 }
24058 /* Peek at the next token. */
24060 /* If it's not a comma, then the list is complete. */
24063 /* Consume the `,'. */
24065 }
24067 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24068 base class had a qualified name. However, the next name that
24069 appears is certainly not qualified. */
24075 }
24077 /* Parse a base-specifier.
24079 base-specifier:
24080 :: [opt] nested-name-specifier [opt] class-name
24081 virtual access-specifier [opt] :: [opt] nested-name-specifier
24082 [opt] class-name
24083 access-specifier virtual [opt] :: [opt] nested-name-specifier
24084 [opt] class-name
24086 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24087 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24088 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24089 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24091 static tree
24093 {
24101 tree type;
24103 /* Process the optional `virtual' and `access-specifier'. */
24105 {
24106 /* Peek at the next token. */
24108 /* Process `virtual'. */
24110 {
24112 /* If `virtual' appears more than once, issue an error. */
24114 {
24118 }
24122 /* Consume the `virtual' token. */
24130 /* If more than one access specifier appears, issue an
24131 error. */
24134 {
24138 }
24142 /* Consume the access-specifier. */
24150 }
24151 }
24152 /* It is not uncommon to see programs mechanically, erroneously, use
24153 the 'typename' keyword to denote (dependent) qualified types
24154 as base classes. */
24156 {
24161 else
24163 "keyword %<typename%> not allowed in this context "
24166 }
24168 /* Look for the optional `::' operator. */
24170 /* Look for the nested-name-specifier. The simplest way to
24171 implement:
24173 [temp.res]
24175 The keyword `typename' is not permitted in a base-specifier or
24176 mem-initializer; in these contexts a qualified name that
24177 depends on a template-parameter is implicitly assumed to be a
24178 type name.
24180 is to pretend that we have seen the `typename' keyword at this
24181 point. */
24187 /* If the base class is given by a qualified name, assume that names
24188 we see are type names or templates, as appropriate. */
24194 /* DR 950 allows decltype as a base-specifier. */
24196 else
24197 {
24198 /* Otherwise, look for the class-name. */
24200 class_scope_p,
24201 template_p,
24202 typename_type,
24207 }
24213 }
24215 /* Exception handling [gram.exception] */
24217 /* Parse an (optional) noexcept-specification.
24219 noexcept-specification:
24220 noexcept ( constant-expression ) [opt]
24222 If no noexcept-specification is present, returns NULL_TREE.
24223 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24224 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24225 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24226 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24227 in which case a boolean condition is returned instead. */
24229 static tree
24234 {
24238 /* Peek at the next token. */
24241 /* Is it a noexcept-specification? */
24243 {
24244 tree expr;
24248 {
24249 matching_parens parens;
24253 {
24254 /* Types may not be defined in an exception-specification. */
24256 parser->type_definition_forbidden_message
24261 /* Restore the saved message. */
24263 }
24264 else
24265 {
24268 }
24271 }
24272 else
24273 {
24277 }
24279 /* We cannot build a noexcept-spec right away because this will check
24280 that expr is a constexpr. */
24283 else
24285 }
24286 else
24288 }
24290 /* Parse an (optional) exception-specification.
24292 exception-specification:
24293 throw ( type-id-list [opt] )
24295 Returns a TREE_LIST representing the exception-specification. The
24296 TREE_VALUE of each node is a type. */
24298 static tree
24300 {
24302 tree type_id_list;
24305 /* Peek at the next token. */
24308 /* Is it a noexcept-specification? */
24314 /* If it's not `throw', then there's no exception-specification. */
24320 /* Consume the `throw'. */
24323 /* Look for the `('. */
24324 matching_parens parens;
24327 /* Peek at the next token. */
24329 /* If it's not a `)', then there is a type-id-list. */
24331 {
24332 /* Types may not be defined in an exception-specification. */
24334 parser->type_definition_forbidden_message
24336 /* Parse the type-id-list. */
24338 /* Restore the saved message. */
24342 {
24346 }
24349 "dynamic exception specifications are deprecated in "
24351 }
24352 /* In C++17, throw() is equivalent to noexcept (true). throw()
24353 is deprecated in C++11 and above as well, but is still widely used,
24354 so don't warn about it yet. */
24357 else
24360 /* Look for the `)'. */
24364 }
24366 /* Parse an (optional) type-id-list.
24368 type-id-list:
24369 type-id ... [opt]
24370 type-id-list , type-id ... [opt]
24372 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24373 in the order that the types were presented. */
24375 static tree
24377 {
24381 {
24383 tree type;
24387 /* Get the next type-id. */
24389 /* Check for invalid 'auto'. */
24391 {
24395 }
24396 /* Parse the optional ellipsis. */
24398 {
24399 /* Consume the `...'. */
24402 /* Turn the type into a pack expansion expression. */
24404 }
24405 /* Add it to the list. */
24407 /* Peek at the next token. */
24409 /* If it is not a `,', we are done. */
24412 /* Consume the `,'. */
24414 }
24417 }
24419 /* Parse a try-block.
24421 try-block:
24422 try compound-statement handler-seq */
24424 static tree
24426 {
24427 tree try_block;
24441 }
24443 /* Parse a function-try-block.
24445 function-try-block:
24446 try ctor-initializer [opt] function-body handler-seq */
24448 static void
24450 {
24451 tree compound_stmt;
24452 tree try_block;
24454 /* Look for the `try' keyword. */
24457 /* Let the rest of the front end know where we are. */
24459 /* Parse the function-body. */
24460 cp_parser_ctor_initializer_opt_and_function_body
24462 /* We're done with the `try' part. */
24464 /* Parse the handlers. */
24466 /* We're done with the handlers. */
24468 }
24470 /* Parse a handler-seq.
24472 handler-seq:
24473 handler handler-seq [opt] */
24475 static void
24477 {
24479 {
24482 /* Parse the handler. */
24484 /* Peek at the next token. */
24486 /* If it's not `catch' then there are no more handlers. */
24489 }
24490 }
24492 /* Parse a handler.
24494 handler:
24495 catch ( exception-declaration ) compound-statement */
24497 static void
24499 {
24500 tree handler;
24501 tree declaration;
24505 matching_parens parens;
24512 }
24514 /* Parse an exception-declaration.
24516 exception-declaration:
24517 type-specifier-seq declarator
24518 type-specifier-seq abstract-declarator
24519 type-specifier-seq
24520 ...
24522 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24523 ellipsis variant is used. */
24525 static tree
24527 {
24528 cp_decl_specifier_seq type_specifiers;
24532 /* If it's an ellipsis, it's easy to handle. */
24534 {
24535 /* Consume the `...' token. */
24538 }
24540 /* Types may not be defined in exception-declarations. */
24542 parser->type_definition_forbidden_message
24545 /* Parse the type-specifier-seq. */
24549 /* If it's a `)', then there is no declarator. */
24552 else
24559 /* Restore the saved message. */
24566 }
24568 /* Parse a throw-expression.
24570 throw-expression:
24571 throw assignment-expression [opt]
24573 Returns a THROW_EXPR representing the throw-expression. */
24575 static tree
24577 {
24578 tree expression;
24583 /* Figure out whether or not there is an assignment-expression
24584 following the "throw" keyword. */
24592 else
24596 }
24598 /* GNU Extensions */
24600 /* Parse an (optional) asm-specification.
24602 asm-specification:
24603 asm ( string-literal )
24605 If the asm-specification is present, returns a STRING_CST
24606 corresponding to the string-literal. Otherwise, returns
24607 NULL_TREE. */
24609 static tree
24611 {
24613 tree asm_specification;
24615 /* Peek at the next token. */
24617 /* If the next token isn't the `asm' keyword, then there's no
24618 asm-specification. */
24622 /* Consume the `asm' token. */
24624 /* Look for the `('. */
24625 matching_parens parens;
24628 /* Look for the string-literal. */
24631 /* Look for the `)'. */
24635 }
24637 /* Parse an asm-operand-list.
24639 asm-operand-list:
24640 asm-operand
24641 asm-operand-list , asm-operand
24643 asm-operand:
24644 string-literal ( expression )
24645 [ string-literal ] string-literal ( expression )
24647 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24648 each node is the expression. The TREE_PURPOSE is itself a
24649 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24650 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24651 is a STRING_CST for the string literal before the parenthesis. Returns
24652 ERROR_MARK_NODE if any of the operands are invalid. */
24654 static tree
24656 {
24661 {
24662 tree string_literal;
24663 tree expression;
24664 tree name;
24667 {
24668 /* Consume the `[' token. */
24670 /* Read the operand name. */
24675 /* Look for the closing `]'. */
24677 }
24678 else
24680 /* Look for the string-literal. */
24683 /* Look for the `('. */
24684 matching_parens parens;
24686 /* Parse the expression. */
24688 /* Look for the `)'. */
24696 /* Add this operand to the list. */
24698 expression,
24699 asm_operands);
24700 /* If the next token is not a `,', there are no more
24701 operands. */
24704 /* Consume the `,'. */
24706 }
24709 }
24711 /* Parse an asm-clobber-list.
24713 asm-clobber-list:
24714 string-literal
24715 asm-clobber-list , string-literal
24717 Returns a TREE_LIST, indicating the clobbers in the order that they
24718 appeared. The TREE_VALUE of each node is a STRING_CST. */
24720 static tree
24722 {
24726 {
24727 tree string_literal;
24729 /* Look for the string literal. */
24731 /* Add it to the list. */
24733 /* If the next token is not a `,', then the list is
24734 complete. */
24737 /* Consume the `,' token. */
24739 }
24742 }
24744 /* Parse an asm-label-list.
24746 asm-label-list:
24747 identifier
24748 asm-label-list , identifier
24750 Returns a TREE_LIST, indicating the labels in the order that they
24751 appeared. The TREE_VALUE of each node is a label. */
24753 static tree
24755 {
24759 {
24762 /* Look for the identifier. */
24765 {
24768 {
24774 }
24775 }
24776 /* If the next token is not a `,', then the list is
24777 complete. */
24780 /* Consume the `,' token. */
24782 }
24785 }
24787 /* Return TRUE iff the next tokens in the stream are possibly the
24788 beginning of a GNU extension attribute. */
24790 static bool
24792 {
24794 }
24796 /* Return TRUE iff the next tokens in the stream are possibly the
24797 beginning of a standard C++-11 attribute specifier. */
24799 static bool
24801 {
24803 }
24805 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24806 beginning of a standard C++-11 attribute specifier. */
24808 static bool
24810 {
24818 }
24820 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24821 beginning of a GNU extension attribute. */
24823 static bool
24825 {
24829 }
24831 /* Return true iff the next tokens can be the beginning of either a
24832 GNU attribute list, or a standard C++11 attribute sequence. */
24834 static bool
24836 {
24839 }
24841 /* Return true iff the next Nth tokens can be the beginning of either
24842 a GNU attribute list, or a standard C++11 attribute sequence. */
24844 static bool
24846 {
24849 }
24851 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24852 of GNU attributes, or return NULL. */
24854 static tree
24856 {
24860 }
24862 /* Parse an (optional) series of attributes.
24864 attributes:
24865 attributes attribute
24867 attribute:
24868 __attribute__ (( attribute-list [opt] ))
24870 The return value is as for cp_parser_gnu_attribute_list. */
24872 static tree
24874 {
24878 {
24880 tree attribute_list;
24883 /* Peek at the next token. */
24885 /* If it's not `__attribute__', then we're done. */
24889 /* Consume the `__attribute__' keyword. */
24891 /* Look for the two `(' tokens. */
24892 matching_parens outer_parens;
24894 matching_parens inner_parens;
24897 /* Peek at the next token. */
24900 /* Parse the attribute-list. */
24902 else
24903 /* If the next token is a `)', then there is no attribute
24904 list. */
24907 /* Look for the two `)' tokens. */
24915 /* Add these new attributes to the list. */
24917 }
24920 }
24922 /* Parse a GNU attribute-list.
24924 attribute-list:
24925 attribute
24926 attribute-list , attribute
24928 attribute:
24929 identifier
24930 identifier ( identifier )
24931 identifier ( identifier , expression-list )
24932 identifier ( expression-list )
24934 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24935 to an attribute. The TREE_PURPOSE of each node is the identifier
24936 indicating which attribute is in use. The TREE_VALUE represents
24937 the arguments, if any. */
24939 static tree
24941 {
24947 {
24949 tree identifier;
24950 tree attribute;
24952 /* Look for the identifier. We also allow keywords here; for
24953 example `__attribute__ ((const))' is legal. */
24957 {
24960 /* Consume the token, but save it since we need it for the
24961 SIMD enabled function parsing. */
24964 /* Save away the identifier that indicates which attribute
24965 this is. */
24967 /* For keywords, use the canonical spelling, not the
24968 parsed identifier. */
24975 /* Peek at the next token. */
24977 /* If it's an `(', then parse the attribute arguments. */
24979 {
24983 vec = cp_parser_parenthesized_expression_list
24989 else
24990 {
24993 }
24994 /* Save the arguments away. */
24996 }
24999 {
25000 /* Add this attribute to the list. */
25003 }
25006 }
25007 /* Now, look for more attributes. If the next token isn't a
25008 `,', we're done. */
25012 /* Consume the comma and keep going. */
25014 }
25017 /* We built up the list in reverse order. */
25019 }
25021 /* Parse a standard C++11 attribute.
25023 The returned representation is a TREE_LIST which TREE_PURPOSE is
25024 the scoped name of the attribute, and the TREE_VALUE is its
25025 arguments list.
25027 Note that the scoped name of the attribute is itself a TREE_LIST
25028 which TREE_PURPOSE is the namespace of the attribute, and
25029 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25030 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25031 and which TREE_PURPOSE is directly the attribute name.
25033 Clients of the attribute code should use get_attribute_namespace
25034 and get_attribute_name to get the actual namespace and name of
25035 attributes, regardless of their being GNU or C++11 attributes.
25037 attribute:
25038 attribute-token attribute-argument-clause [opt]
25040 attribute-token:
25041 identifier
25042 attribute-scoped-token
25044 attribute-scoped-token:
25045 attribute-namespace :: identifier
25047 attribute-namespace:
25048 identifier
25050 attribute-argument-clause:
25051 ( balanced-token-seq )
25053 balanced-token-seq:
25054 balanced-token [opt]
25055 balanced-token-seq balanced-token
25057 balanced-token:
25058 ( balanced-token-seq )
25059 [ balanced-token-seq ]
25060 { balanced-token-seq }. */
25062 static tree
25064 {
25068 /* First, parse name of the attribute, a.k.a attribute-token. */
25085 {
25086 /* We are seeing a scoped attribute token. */
25101 else
25102 {
25106 }
25110 NULL_TREE);
25112 }
25115 NULL_TREE);
25116 else
25117 {
25120 NULL_TREE);
25121 /* C++11 noreturn attribute is equivalent to GNU's. */
25124 /* C++14 deprecated attribute is equivalent to GNU's. */
25127 /* C++17 fallthrough attribute is equivalent to GNU's. */
25130 /* Transactional Memory TS optimize_for_synchronized attribute is
25131 equivalent to GNU transaction_callable. */
25135 /* Transactional Memory attributes are GNU attributes. */
25138 }
25140 /* Now parse the optional argument clause of the attribute. */
25145 {
25151 /* A GNU attribute that takes an identifier in parameter. */
25154 vec = cp_parser_parenthesized_expression_list
25160 else
25161 {
25164 }
25168 else
25170 }
25173 }
25175 /* Check that the attribute ATTRIBUTE appears at most once in the
25176 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25177 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25178 isn't implemented yet in GCC. */
25180 static void
25182 {
25184 {
25194 }
25195 }
25197 /* Parse a list of standard C++-11 attributes.
25199 attribute-list:
25200 attribute [opt]
25201 attribute-list , attribute[opt]
25202 attribute ...
25203 attribute-list , attribute ...
25204 */
25206 static tree
25208 {
25213 {
25218 {
25222 }
25225 {
25230 else
25231 {
25236 }
25238 }
25242 }
25245 }
25247 /* Parse a standard C++-11 attribute specifier.
25249 attribute-specifier:
25250 [ [ attribute-using-prefix [opt] attribute-list ] ]
25251 alignment-specifier
25253 attribute-using-prefix:
25254 using attribute-namespace :
25256 alignment-specifier:
25257 alignas ( type-id ... [opt] )
25258 alignas ( alignment-expression ... [opt] ). */
25260 static tree
25262 {
25268 {
25275 {
25286 {
25290 "attribute using prefix only available "
25296 }
25297 else
25299 }
25306 else
25307 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25308 when we are sure that we have actually parsed them. */
25310 }
25311 else
25312 {
25313 tree alignas_expr;
25315 /* Look for an alignment-specifier. */
25326 matching_parens parens;
25328 {
25331 }
25337 {
25344 }
25349 /* Handle alignas (pack...). */
25351 {
25354 }
25356 /* Something went wrong, so don't build the attribute. */
25361 {
25364 }
25366 /* Build the C++-11 representation of an 'aligned'
25367 attribute. */
25368 attributes =
25371 alignas_expr);
25372 }
25375 }
25377 /* Parse a standard C++-11 attribute-specifier-seq.
25379 attribute-specifier-seq:
25380 attribute-specifier-seq [opt] attribute-specifier
25381 */
25383 static tree
25385 {
25390 {
25399 else
25402 }
25405 }
25407 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25408 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25409 current value of the PEDANTIC flag, regardless of whether or not
25410 the `__extension__' keyword is present. The caller is responsible
25411 for restoring the value of the PEDANTIC flag. */
25413 static bool
25415 {
25416 /* Save the old value of the PEDANTIC flag. */
25420 {
25421 /* Consume the `__extension__' token. */
25423 /* We're not being pedantic while the `__extension__' keyword is
25424 in effect. */
25428 }
25431 }
25433 /* Parse a label declaration.
25435 label-declaration:
25436 __label__ label-declarator-seq ;
25438 label-declarator-seq:
25439 identifier , label-declarator-seq
25440 identifier */
25442 static void
25444 {
25445 /* Look for the `__label__' keyword. */
25449 {
25450 tree identifier;
25452 /* Look for an identifier. */
25454 /* If we failed, stop. */
25457 /* Declare it as a label. */
25459 /* If the next token is a `;', stop. */
25462 /* Look for the `,' separating the label declarations. */
25464 }
25466 /* Look for the final `;'. */
25468 }
25470 // -------------------------------------------------------------------------- //
25471 // Requires Clause
25473 // Parse a requires clause.
25474 //
25475 // requires-clause:
25476 // 'requires' logical-or-expression
25477 //
25478 // The required logical-or-expression must be a constant expression. Note
25479 // that we don't check that the expression is constepxr here. We defer until
25480 // we analyze constraints and then, we only check atomic constraints.
25481 static tree
25483 {
25484 // Parse the requires clause so that it is not automatically folded.
25492 }
25494 // Optionally parse a requires clause:
25495 static tree
25497 {
25500 {
25503 {
25506 /* Parse and discard the requires-clause. */
25509 }
25511 }
25514 }
25517 /*---------------------------------------------------------------------------
25518 Requires expressions
25519 ---------------------------------------------------------------------------*/
25521 /* Parse a requires expression
25523 requirement-expression:
25524 'requires' requirement-parameter-list [opt] requirement-body */
25525 static tree
25527 {
25531 /* A requires-expression shall appear only within a concept
25532 definition or a requires-clause.
25534 TODO: Implement this diagnostic correctly. */
25536 {
25540 }
25543 {
25544 /* Local parameters are delared as variables within the scope
25545 of the expression. They are not visible past the end of
25546 the expression. Expressions within the requires-expression
25547 are unevaluated. */
25548 struct scope_sentinel
25549 {
25551 {
25554 }
25557 {
25560 }
25563 /* Parse the optional parameter list. */
25565 {
25569 }
25570 else
25573 /* Parse the requirement body. */
25577 }
25579 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25580 the parm chain. */
25583 }
25585 /* Parse a parameterized requirement.
25587 requirement-parameter-list:
25588 '(' parameter-declaration-clause ')' */
25589 static tree
25591 {
25592 matching_parens parens;
25602 }
25604 /* Parse the body of a requirement.
25606 requirement-body:
25607 '{' requirement-list '}' */
25608 static tree
25610 {
25611 matching_braces braces;
25621 }
25623 /* Parse a list of requirements.
25625 requirement-list:
25626 requirement
25627 requirement-list ';' requirement[opt] */
25628 static tree
25630 {
25633 {
25640 /* If we see a semi-colon, consume it. */
25644 /* Stop processing at the end of the list. */
25647 }
25649 /* Reverse the order of requirements so they are analyzed in
25650 declaration order. */
25652 }
25654 /* Parse a syntactic requirement or type requirement.
25656 requirement:
25657 simple-requirement
25658 compound-requirement
25659 type-requirement
25660 nested-requirement */
25661 static tree
25663 {
25670 else
25672 }
25674 /* Parse a simple requirement.
25676 simple-requirement:
25677 expression ';' */
25678 static tree
25680 {
25689 }
25691 /* Parse a type requirement
25693 type-requirement
25694 nested-name-specifier [opt] required-type-name ';'
25696 required-type-name:
25697 type-name
25698 'template' [opt] simple-template-id */
25699 static tree
25701 {
25704 // Save the scope before parsing name specifiers.
25715 tree type;
25717 {
25726 }
25727 else
25746 }
25748 /* Parse a compound requirement
25750 compound-requirement:
25751 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25752 static tree
25754 {
25755 /* Parse an expression enclosed in '{ }'s. */
25756 matching_braces braces;
25767 /* Parse the optional noexcept. */
25770 {
25773 }
25775 /* Parse the optional trailing return type. */
25778 {
25786 }
25789 }
25791 /* Parse a nested requirement. This is the same as a requires clause.
25793 nested-requirement:
25794 requires-clause */
25795 static tree
25797 {
25803 }
25805 /* Support Functions */
25807 /* Return the appropriate prefer_type argument for lookup_name_real based on
25808 tag_type and template_mem_access. */
25812 {
25813 /* DR 141: When looking in the current enclosing context for a template-name
25814 after -> or ., only consider class templates. */
25818 {
25822 }
25823 }
25825 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25826 NAME should have one of the representations used for an
25827 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25828 is returned. If PARSER->SCOPE is a dependent type, then a
25829 SCOPE_REF is returned.
25831 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25832 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25833 was formed. Abstractly, such entities should not be passed to this
25834 function, because they do not need to be looked up, but it is
25835 simpler to check for this special case here, rather than at the
25836 call-sites.
25838 In cases not explicitly covered above, this function returns a
25839 DECL, OVERLOAD, or baselink representing the result of the lookup.
25840 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25841 is returned.
25843 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25844 (e.g., "struct") that was used. In that case bindings that do not
25845 refer to types are ignored.
25847 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25848 ignored.
25850 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25851 are ignored.
25853 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25854 types.
25856 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25857 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25858 NULL_TREE otherwise. */
25860 static cp_expr
25867 location_t name_location)
25868 {
25869 tree decl;
25872 /* Assume that the lookup will be unambiguous. */
25876 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25877 no longer valid. Note that if we are parsing tentatively, and
25878 the parse fails, OBJECT_TYPE will be automatically restored. */
25884 /* A template-id has already been resolved; there is no lookup to
25885 do. */
25889 {
25893 }
25895 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25896 it should already have been checked to make sure that the name
25897 used matches the type being destroyed. */
25899 {
25900 tree type;
25902 /* Figure out to which type this destructor applies. */
25907 else
25909 /* If that's not a class type, there is no destructor. */
25920 }
25922 /* By this point, the NAME should be an ordinary identifier. If
25923 the id-expression was a qualified name, the qualifying scope is
25924 stored in PARSER->SCOPE at this point. */
25927 /* Perform the lookup. */
25929 {
25935 /* If the SCOPE is dependent, the lookup must be deferred until
25936 the template is instantiated -- unless we are explicitly
25937 looking up names in uninstantiated templates. Even then, we
25938 cannot look up the name if the scope is not a class type; it
25939 might, for example, be a template type parameter. */
25944 /* Defer lookup. */
25946 else
25947 {
25950 /* If PARSER->SCOPE is a dependent type, then it must be a
25951 class type, and we must not be checking dependencies;
25952 otherwise, we would have processed this lookup above. So
25953 that PARSER->SCOPE is not considered a dependent base by
25954 lookup_member, we must enter the scope here. */
25958 /* If the PARSER->SCOPE is a template specialization, it
25959 may be instantiated during name lookup. In that case,
25960 errors may be issued. Even if we rollback the current
25961 tentative parse, those errors are valid. */
25966 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25967 lookup result and the nested-name-specifier nominates a class C:
25968 * if the name specified after the nested-name-specifier, when
25969 looked up in C, is the injected-class-name of C (Clause 9), or
25970 * if the name specified after the nested-name-specifier is the
25971 same as the identifier or the simple-template-id's template-
25972 name in the last component of the nested-name-specifier,
25973 the name is instead considered to name the constructor of
25974 class C. [ Note: for example, the constructor is not an
25975 acceptable lookup result in an elaborated-type-specifier so
25976 the constructor would not be used in place of the
25977 injected-class-name. --end note ] Such a constructor name
25978 shall be used only in the declarator-id of a declaration that
25979 names a constructor or in a using-declaration. */
25987 /* If we have a single function from a using decl, pull it out. */
25994 }
25996 /* If the scope is a dependent type and either we deferred lookup or
25997 we did lookup but didn't find the name, rememeber the name. */
26000 {
26002 {
26003 tree type;
26005 /* The resolution to Core Issue 180 says that `struct
26006 A::B' should be considered a type-name, even if `A'
26007 is dependent. */
26012 }
26016 CPP_CLOSE_PAREN)))
26020 else
26023 is_template);
26024 }
26027 }
26029 {
26030 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26031 OBJECT_TYPE is not a class. */
26033 /* If the OBJECT_TYPE is a template specialization, it may
26034 be instantiated during name lookup. In that case, errors
26035 may be issued. Even if we rollback the current tentative
26036 parse, those errors are valid. */
26038 name,
26041 tf_warning_or_error);
26042 else
26046 /* Look it up in the enclosing context. DR 141: When looking for a
26047 template-name after -> or ., only consider class templates. */
26052 /* The object is type-dependent, so we can't look anything up; we used
26053 this to get the DR 141 behavior. */
26057 }
26058 else
26059 {
26065 }
26067 /* If the lookup failed, let our caller know. */
26071 /* Pull out the template from an injected-class-name (or multiple). */
26075 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26077 {
26080 /* The error message we have to print is too complicated for
26081 cp_parser_error, so we incorporate its actions directly. */
26083 {
26085 name);
26087 }
26089 }
26097 /* If we have resolved the name of a member declaration, check to
26098 see if the declaration is accessible. When the name resolves to
26099 set of overloaded functions, accessibility is checked when
26100 overload resolution is done.
26102 During an explicit instantiation, access is not checked at all,
26103 as per [temp.explicit]. */
26110 }
26112 /* Like cp_parser_lookup_name, but for use in the typical case where
26113 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26114 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26116 static tree
26118 {
26120 none_type,
26125 location);
26126 }
26128 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26129 the current context, return the TYPE_DECL. If TAG_NAME_P is
26130 true, the DECL indicates the class being defined in a class-head,
26131 or declared in an elaborated-type-specifier.
26133 Otherwise, return DECL. */
26135 static tree
26137 {
26138 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26139 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26141 struct A {
26142 template <typename T> struct B;
26143 };
26145 template <typename T> struct A::B {};
26147 Similarly, in an elaborated-type-specifier:
26149 namespace N { struct X{}; }
26151 struct A {
26152 template <typename T> friend struct N::X;
26153 };
26155 However, if the DECL refers to a class type, and we are in
26156 the scope of the class, then the name lookup automatically
26157 finds the TYPE_DECL created by build_self_reference rather
26158 than a TEMPLATE_DECL. For example, in:
26160 template <class T> struct S {
26161 S s;
26162 };
26164 there is no need to handle such case. */
26170 }
26172 /* If too many, or too few, template-parameter lists apply to the
26173 declarator, issue an error message. Returns TRUE if all went well,
26174 and FALSE otherwise. */
26176 static bool
26179 location_t declarator_location)
26180 {
26182 {
26184 {
26192 /* If the DECLARATOR has the form `X<y>' then it uses one
26193 additional level of template parameters. */
26196 return cp_parser_check_template_parameters
26198 }
26214 }
26216 }
26218 /* NUM_TEMPLATES were used in the current declaration. If that is
26219 invalid, return FALSE and issue an error messages. Otherwise,
26220 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26221 declarator and we can print more accurate diagnostics. */
26223 static bool
26226 location_t location,
26228 {
26229 /* If there are the same number of template classes and parameter
26230 lists, that's OK. */
26233 /* If there are more, but only one more, then we are referring to a
26234 member template. That's OK too. */
26237 /* If there are more template classes than parameter lists, we have
26238 something like:
26240 template <class T> void S<T>::R<T>::f (); */
26242 {
26252 else
26255 }
26256 /* Otherwise, there are too many template parameter lists. We have
26257 something like:
26259 template <class T> template <class U> void S::f(); */
26262 }
26264 /* Parse an optional `::' token indicating that the following name is
26265 from the global namespace. If so, PARSER->SCOPE is set to the
26266 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26267 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26268 Returns the new value of PARSER->SCOPE, if the `::' token is
26269 present, and NULL_TREE otherwise. */
26271 static tree
26273 {
26276 /* Peek at the next token. */
26278 /* If we're looking at a `::' token then we're starting from the
26279 global namespace, not our current location. */
26281 {
26282 /* Consume the `::' token. */
26284 /* Set the SCOPE so that we know where to start the lookup. */
26290 }
26292 {
26296 }
26299 }
26301 /* Returns TRUE if the upcoming token sequence is the start of a
26302 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26303 declarator is preceded by the `friend' specifier. */
26305 static bool
26307 {
26310 tree nested_name_specifier;
26313 /* The common case is that this is not a constructor declarator, so
26314 try to avoid doing lots of work if at all possible. It's not
26315 valid declare a constructor at function scope. */
26318 /* And only certain tokens can begin a constructor declarator. */
26326 /* Parse tentatively; we are going to roll back all of the tokens
26327 consumed here. */
26329 /* Assume that we are looking at a constructor declarator. */
26332 /* Look for the optional `::' operator. */
26335 /* Look for the nested-name-specifier. */
26336 nested_name_specifier
26347 /* Outside of a class-specifier, there must be a
26348 nested-name-specifier. Except in C++17 mode, where we
26349 might be declaring a guiding declaration. */
26356 /* If we have a class scope, this is easy; DR 147 says that S::S always
26357 names the constructor, and no other qualified name could. */
26360 {
26370 }
26371 /* If we still think that this might be a constructor-declarator,
26372 look for a class-name. */
26374 {
26375 /* If we have:
26377 template <typename T> struct S {
26378 S();
26379 };
26381 we must recognize that the nested `S' names a class. */
26385 tree type_decl;
26389 none_type,
26396 {
26402 none_type,
26407 else
26409 }
26411 /* If there was no class-name, then this is not a constructor.
26412 Otherwise, if we are in a class-specifier and we aren't
26413 handling a friend declaration, check that its type matches
26414 current_class_type (c++/38313). Note: error_mark_node
26415 is left alone for error recovery purposes. */
26417 && (outside_class_specifier_p
26423 /* If we're still considering a constructor, we have to see a `(',
26424 to begin the parameter-declaration-clause, followed by either a
26425 `)', an `...', or a decl-specifier. We need to check for a
26426 type-specifier to avoid being fooled into thinking that:
26428 S (f) (int);
26430 is a constructor. (It is actually a function named `f' that
26431 takes one parameter (of type `int') and returns a value of type
26432 `S'. */
26440 /* A parameter declaration begins with a decl-specifier,
26441 which is either the "attribute" keyword, a storage class
26442 specifier, or (usually) a type-specifier. */
26444 {
26445 tree type;
26449 /* Names appearing in the type-specifier should be looked up
26450 in the scope of the class. */
26454 {
26457 {
26461 {
26464 }
26465 }
26467 }
26469 /* Inside the constructor parameter list, surrounding
26470 template-parameter-lists do not apply. */
26471 saved_num_template_parameter_lists
26475 /* Look for the type-specifier. */
26477 CP_PARSER_FLAGS_NONE,
26483 parser->num_template_parameter_lists
26486 /* Leave the scope of the class. */
26491 }
26492 }
26494 /* We did not really want to consume any tokens. */
26498 }
26500 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26501 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26502 they must be performed once we are in the scope of the function.
26504 Returns the function defined. */
26506 static tree
26507 cp_parser_function_definition_from_specifiers_and_declarator
26510 tree attributes,
26512 {
26513 tree fn;
26516 /* Begin the function-definition. */
26519 /* The things we're about to see are not directly qualified by any
26520 template headers we've seen thus far. */
26523 /* If there were names looked up in the decl-specifier-seq that we
26524 did not check, check them now. We must wait until we are in the
26525 scope of the function to perform the checks, since the function
26526 might be a friend. */
26530 {
26535 }
26538 {
26539 /* Skip the entire function. */
26542 }
26544 {
26545 /* Seen already, skip it. An error message has already been output. */
26549 /* If this is a function from a class, pop the nested class. */
26552 }
26553 else
26554 {
26555 timevar_id_t tv;
26558 else
26564 }
26567 }
26569 /* Parse the part of a function-definition that follows the
26570 declarator. INLINE_P is TRUE iff this function is an inline
26571 function defined within a class-specifier.
26573 Returns the function defined. */
26575 static tree
26578 {
26579 tree fn;
26584 bool fully_implicit_function_template_p
26587 tree implicit_template_parms
26590 cp_binding_level* implicit_template_scope
26596 /* If the next token is `return', then the code may be trying to
26597 make use of the "named return value" extension that G++ used to
26598 support. */
26601 {
26602 /* Consume the `return' keyword. */
26604 /* Look for the identifier that indicates what value is to be
26605 returned. */
26607 /* Issue an error message. */
26610 /* Skip tokens until we reach the start of the function body. */
26612 {
26619 }
26620 }
26621 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26622 anything declared inside `f'. */
26623 saved_in_unbraced_linkage_specification_p
26626 /* Inside the function, surrounding template-parameter-lists do not
26627 apply. */
26628 saved_num_template_parameter_lists
26632 /* If the next token is `try', `__transaction_atomic', or
26633 `__transaction_relaxed`, then we are looking at either function-try-block
26634 or function-transaction-block. Note that all of these include the
26635 function-body. */
26639 RID_TRANSACTION_RELAXED))
26643 else
26644 cp_parser_ctor_initializer_opt_and_function_body
26647 /* Finish the function. */
26649 /* Generate code for it, if necessary. */
26651 /* Restore the saved values. */
26652 parser->in_unbraced_linkage_specification_p
26654 parser->num_template_parameter_lists
26658 parser->fully_implicit_function_template_p
26660 parser->implicit_template_parms
26662 parser->implicit_template_scope
26669 }
26671 /* Parse a template-declaration body (following argument list). */
26673 static void
26675 tree parameter_list,
26677 {
26681 /* We just processed one more parameter list. */
26684 /* Get the deferred access checks from the parameter list. These
26685 will be checked once we know what is being declared, as for a
26686 member template the checks must be performed in the scope of the
26687 class containing the member. */
26690 /* Tentatively parse for a new template parameter list, which can either be
26691 the template keyword or a template introduction. */
26697 else
26698 {
26699 /* There are no access checks when parsing a template, as we do not
26700 know if a specialization will be a friend. */
26704 checks,
26705 member_p,
26710 /* If this is a member template declaration, let the front
26711 end know. */
26713 {
26718 }
26723 }
26724 /* We are done with the current parameter list. */
26729 /* Finish up. */
26732 /* Check the template arguments for a literal operator template. */
26736 {
26740 else
26741 {
26744 {
26750 }
26752 {
26761 }
26762 else
26764 }
26766 {
26769 " Expected non-type template argument pack <char...>"
26771 decl);
26772 else
26775 decl);
26776 }
26777 }
26779 /* Register member declarations. */
26782 /* If DECL is a function template, we must return to parse it later.
26783 (Even though there is no definition, there might be default
26784 arguments that need handling.) */
26788 }
26790 /* Parse a template introduction header for a template-declaration. Returns
26791 false if tentative parse fails. */
26793 static bool
26795 {
26802 /* Look for the optional `::' operator. */
26805 /* Look for the nested-name-specifier. */
26815 /* Look up the concept for which we will be matching
26816 template parameters. */
26826 /* Look for opening brace for introduction. */
26827 matching_braces braces;
26835 /* Build vector of placeholder parameters and grab
26836 matching identifiers. */
26839 /* The introduction-list shall not be empty. */
26842 {
26845 }
26847 /* Look for closing brace for introduction. */
26852 {
26856 }
26858 /* Build and associate the constraint. */
26861 {
26863 member_p);
26865 }
26869 }
26871 /* Parse a normal template-declaration following the template keyword. */
26873 static void
26875 {
26876 tree parameter_list;
26880 /* Look for the `<' token. */
26884 {
26885 /* 14.5.2.2 [temp.mem]
26887 A local class shall not have member templates. */
26892 }
26893 /* [temp]
26895 A template ... shall not have C linkage. */
26897 {
26900 /* Give it C++ linkage to avoid confusing other parts of the
26901 front end. */
26904 }
26905 else
26908 /* We cannot perform access checks on the template parameter
26909 declarations until we know what is being declared, just as we
26910 cannot check the decl-specifier list. */
26913 /* If the next token is `>', then we have an invalid
26914 specialization. Rather than complain about an invalid template
26915 parameter, issue an error message here. */
26917 {
26921 }
26922 else
26923 {
26924 /* Parse the template parameters. */
26926 }
26928 /* Look for the `>'. */
26931 /* Manage template requirements */
26933 {
26938 }
26941 member_p);
26943 /* For the erroneous case of a template with C linkage, we pushed an
26944 implicit C++ linkage scope; exit that scope now. */
26947 }
26949 /* Parse a template-declaration, assuming that the `export' (and
26950 `extern') keywords, if present, has already been scanned. MEMBER_P
26951 is as for cp_parser_template_declaration. */
26953 static bool
26955 {
26957 {
26961 }
26966 }
26968 /* Perform the deferred access checks from a template-parameter-list.
26969 CHECKS is a TREE_LIST of access checks, as returned by
26970 get_deferred_access_checks. */
26972 static void
26973 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26974 {
26978 }
26980 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26981 `function-definition' sequence that follows a template header.
26982 If MEMBER_P is true, this declaration appears in a class scope.
26984 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26985 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26987 static tree
26993 {
26996 cp_decl_specifier_seq decl_specifiers;
27000 /* This function is only used when processing a template
27001 declaration. */
27005 /* Defer access checks until we know what is being declared. */
27008 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27009 alternative. */
27012 CP_PARSER_FLAGS_OPTIONAL,
27018 /* There are no template typedefs. */
27020 {
27024 }
27026 /* Gather up the access checks that occurred the
27027 decl-specifier-seq. */
27030 /* Check for the declaration of a template class. */
27032 {
27035 {
27036 // If this is a declaration, but not a definition, associate
27037 // any constraints with the type declaration. Constraints
27038 // are associated with definitions in cp_parser_class_specifier.
27044 /* In this case:
27046 struct C {
27047 friend template <typename T> struct A<T>::B;
27048 };
27050 A<T>::B will be represented by a TYPENAME_TYPE, and
27051 therefore not recognized by shadow_tag. */
27053 && !decl
27060 else
27063 /* Perform access checks for template parameters. */
27066 /* Give a helpful diagnostic for
27067 template <class T> struct A { } a;
27068 if we aren't already recovering from an error. */
27071 {
27073 "a class template declaration must not declare "
27077 }
27078 }
27079 }
27081 /* Complain about missing 'typename' or other invalid type names. */
27084 {
27085 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27086 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27087 the rest of this declaration. */
27090 }
27092 /* If it's not a template class, try for a template function. If
27093 the next token is a `;', then this declaration does not declare
27094 anything. But, if there were errors in the decl-specifiers, then
27095 the error might well have come from an attempted class-specifier.
27096 In that case, there's no need to warn about a missing declarator. */
27100 {
27103 checks,
27105 member_p,
27106 declares_class_or_enum,
27110 /* 7.1.1-1 [dcl.stc]
27112 A storage-class-specifier shall not be specified in an explicit
27113 specialization... */
27115 && explicit_specialization_p
27117 {
27121 }
27125 }
27127 /* Look for a trailing `;' after the declaration. */
27133 out:
27136 /* Clear any current qualification; whatever comes next is the start
27137 of something new. */
27143 }
27145 /* Parse a cast-expression that is not the operand of a unary "&". */
27147 static cp_expr
27149 {
27152 }
27154 /* Parse a functional cast to TYPE. Returns an expression
27155 representing the cast. */
27157 static cp_expr
27159 {
27161 tree expression_list;
27162 cp_expr cast;
27171 {
27181 /* Create a location of the form:
27182 type_name{i, f}
27183 ^~~~~~~~~~~~~~~
27184 with caret == start at the start of the type name,
27185 finishing at the closing brace. */
27186 location_t finish_loc
27189 finish_loc);
27192 }
27201 else
27202 {
27205 }
27208 tf_warning_or_error);
27209 /* [expr.const]/1: In an integral constant expression "only type
27210 conversions to integral or enumeration type can be used". */
27216 NIC_CONSTRUCTOR))
27219 /* Create a location of the form:
27220 float(i)
27221 ^~~~~~~~
27222 with caret == start at the start of the type name,
27223 finishing at the closing paren. */
27224 location_t finish_loc
27229 }
27231 /* Save the tokens that make up the body of a member function defined
27232 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27233 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27234 specifiers applied to the declaration. Returns the FUNCTION_DECL
27235 for the member function. */
27237 static tree
27241 tree attributes)
27242 {
27245 tree fn;
27248 /* Create the FUNCTION_DECL. */
27252 /* If something went badly wrong, bail out now. */
27254 {
27255 /* If there's a function-body, skip it. */
27260 }
27262 /* Remember it, if there default args to post process. */
27265 /* Save away the tokens that make up the body of the
27266 function. */
27272 RID_TRANSACTION_ATOMIC))
27273 {
27275 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27282 {
27288 }
27289 else
27292 {
27296 }
27297 }
27299 /* Handle function try blocks. */
27301 {
27304 }
27305 /* We can have braced-init-list mem-initializers before the fn body. */
27307 {
27310 {
27311 /* cache_group will stop after an un-nested { } pair, too. */
27315 /* variadic mem-inits have ... after the ')'. */
27318 }
27319 }
27321 /* Handle function try blocks. */
27327 /* Save away the inline definition; we will process it when the
27328 class is complete. */
27332 /* We need to know that this was defined in the class, so that
27333 friend templates are handled correctly. */
27336 /* Add FN to the queue of functions to be parsed later. */
27340 }
27342 /* Save the tokens that make up the in-class initializer for a non-static
27343 data member. Returns a DEFAULT_ARG. */
27345 static tree
27347 {
27349 }
27351 /* Parse a template-argument-list, as well as the trailing ">" (but
27352 not the opening "<"). See cp_parser_template_argument_list for the
27353 return value. */
27355 static tree
27357 {
27358 tree arguments;
27359 tree saved_scope;
27360 tree saved_qualifying_scope;
27361 tree saved_object_scope;
27366 /* [temp.names]
27368 When parsing a template-id, the first non-nested `>' is taken as
27369 the end of the template-argument-list rather than a greater-than
27370 operator. */
27371 saved_greater_than_is_operator_p
27374 /* Parsing the argument list may modify SCOPE, so we save it
27375 here. */
27379 /* We need to evaluate the template arguments, even though this
27380 template-id may be nested within a "sizeof". */
27385 /* Parse the template-argument-list itself. */
27389 else
27391 /* Look for the `>' that ends the template-argument-list. If we find
27392 a '>>' instead, it's probably just a typo. */
27394 {
27396 {
27397 /* In C++0x, a `>>' in a template argument list or cast
27398 expression is considered to be two separate `>'
27399 tokens. So, change the current token to a `>', but don't
27400 consume it: it will be consumed later when the outer
27401 template argument list (or cast expression) is parsed.
27402 Note that this replacement of `>' for `>>' is necessary
27403 even if we are parsing tentatively: in the tentative
27404 case, after calling
27405 cp_parser_enclosed_template_argument_list we will always
27406 throw away all of the template arguments and the first
27407 closing `>', either because the template argument list
27408 was erroneous or because we are replacing those tokens
27409 with a CPP_TEMPLATE_ID token. The second `>' (which will
27410 not have been thrown away) is needed either to close an
27411 outer template argument list or to complete a new-style
27412 cast. */
27415 }
27417 {
27418 /* If we're in a nested template argument list, the '>>' has
27419 to be a typo for '> >'. We emit the error message, but we
27420 continue parsing and we push a '>' as next token, so that
27421 the argument list will be parsed correctly. Note that the
27422 global source location is still on the token before the
27423 '>>', so we need to say explicitly where we want it. */
27431 }
27432 else
27433 {
27434 /* If this is not a nested template argument list, the '>>'
27435 is a typo for '>'. Emit an error message and continue.
27436 Same deal about the token location, but here we can get it
27437 right by consuming the '>>' before issuing the diagnostic. */
27440 "spurious %<>>%>, use %<>%> to terminate "
27442 }
27443 }
27444 else
27446 /* The `>' token might be a greater-than operator again now. */
27447 parser->greater_than_is_operator_p
27449 /* Restore the SAVED_SCOPE. */
27457 }
27459 /* MEMBER_FUNCTION is a member function, or a friend. If default
27460 arguments, or the body of the function have not yet been parsed,
27461 parse them now. */
27463 static void
27465 {
27467 /* If this member is a template, get the underlying
27468 FUNCTION_DECL. */
27472 /* There should not be any class definitions in progress at this
27473 point; the bodies of members are only parsed outside of all class
27474 definitions. */
27476 /* While we're parsing the member functions we might encounter more
27477 classes. We want to handle them right away, but we don't want
27478 them getting mixed up with functions that are currently in the
27479 queue. */
27482 /* Make sure that any template parameters are in scope. */
27485 /* If the body of the function has not yet been parsed, parse it
27486 now. */
27488 {
27489 tree function_scope;
27492 /* The function is no longer pending; we are processing it. */
27497 /* If this is a local class, enter the scope of the containing
27498 function. */
27503 /* Push the body of the function onto the lexer stack. */
27506 /* Let the front end know that we going to be defining this
27507 function. */
27511 /* Don't do access checking if it is a templated function. */
27515 /* #pragma omp declare reduction needs special parsing. */
27517 {
27522 }
27523 else
27524 /* Now, parse the body of the function. */
27531 /* Leave the scope of the containing function. */
27535 }
27537 /* Remove any template parameters from the symbol table. */
27540 /* Restore the queue. */
27543 }
27545 /* If DECL contains any default args, remember it on the unparsed
27546 functions queue. */
27548 static void
27550 {
27551 tree probe;
27554 probe;
27557 {
27561 }
27562 }
27564 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27565 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27566 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27567 from the parameter-type-list. */
27569 static tree
27572 {
27574 tree parsed_arg;
27580 /* Push the saved tokens for the default argument onto the parser's
27581 lexer stack. */
27587 /* Parse the default argument. */
27598 {
27599 /* In a non-template class, check conversions now. In a template,
27600 we'll wait and instantiate these as needed. */
27603 tf_warning_or_error);
27606 else
27608 }
27610 /* If the token stream has not been completely used up, then
27611 there was extra junk after the end of the default
27612 argument. */
27614 {
27617 else
27619 }
27621 /* Revert to the main lexer. */
27625 }
27627 /* FIELD is a non-static data member with an initializer which we saved for
27628 later; parse it now. */
27630 static void
27632 {
27633 tree def;
27640 NULL_TREE);
27646 }
27648 /* FN is a FUNCTION_DECL which may contains a parameter with an
27649 unparsed DEFAULT_ARG. Parse the default args now. This function
27650 assumes that the current scope is the scope in which the default
27651 argument should be processed. */
27653 static void
27655 {
27659 /* While we're parsing the default args, we might (due to the
27660 statement expression extension) encounter more classes. We want
27661 to handle them right away, but we don't want them getting mixed
27662 up with default args that are currently in the queue. */
27665 /* Local variable names (and the `this' keyword) may not appear
27666 in a default argument. */
27677 {
27679 tree parsed_arg;
27681 tree copy;
27688 /* This can happen for a friend declaration for a function
27689 already declared with default arguments. */
27692 parsed_arg
27694 default_arg,
27698 /* Update any instantiations we've already created. */
27702 }
27706 /* Make sure no default arg is missing. */
27709 /* Restore the state of local_variables_forbidden_p. */
27712 /* Restore the queue. */
27714 }
27716 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27718 sizeof ... ( identifier )
27720 where the 'sizeof' token has already been consumed. */
27722 static tree
27724 {
27725 /* Consume the `...'. */
27729 matching_parens parens;
27733 else
27741 /* The name is not qualified. */
27760 }
27762 /* Parse the operand of `sizeof' (or a similar operator). Returns
27763 either a TYPE or an expression, depending on the form of the
27764 input. The KEYWORD indicates which kind of expression we have
27765 encountered. */
27767 static tree
27769 {
27776 /* If it's a `...', then we are computing the length of a parameter
27777 pack. */
27782 /* Types cannot be defined in a `sizeof' expression. Save away the
27783 old message. */
27785 /* And create the new one. */
27791 /* The restrictions on constant-expressions do not apply inside
27792 sizeof expressions. */
27793 saved_integral_constant_expression_p
27795 saved_non_integral_constant_expression_p
27799 /* Do not actually evaluate the expression. */
27802 /* If it's a `(', then we might be looking at the type-id
27803 construction. */
27805 {
27808 /* We can't be sure yet whether we're looking at a type-id or an
27809 expression. */
27812 matching_parens parens;
27815 /* Note: as a GNU Extension, compound literals are considered
27816 postfix-expressions as they are in C99, so they are valid
27817 arguments to sizeof. See comment in cp_parser_cast_expression
27818 for details. */
27821 else
27822 {
27825 /* Look for the type-id. */
27827 /* Look for the closing `)'. */
27830 }
27832 /* If all went well, then we're done. */
27834 {
27835 cp_decl_specifier_seq decl_specs;
27837 /* Build a trivial decl-specifier-seq. */
27841 /* Call grokdeclarator to figure out what type this is. */
27844 TYPENAME,
27847 }
27848 }
27850 /* If the type-id production did not work out, then we must be
27851 looking at the unary-expression production. */
27855 /* Go back to evaluating expressions. */
27859 /* Free the message we created. */
27861 /* And restore the old one. */
27863 parser->integral_constant_expression_p
27865 parser->non_integral_constant_expression_p
27869 }
27871 /* If the current declaration has no declarator, return true. */
27873 static bool
27875 {
27876 /* If the next token is a `;' or a `,' then there is no
27877 declarator. */
27880 }
27882 /* Update the DECL_SPECS to reflect the storage class indicated by
27883 KEYWORD. */
27885 static void
27890 {
27891 cp_storage_class storage_class;
27894 {
27898 }
27900 {
27903 }
27908 {
27911 }
27914 {
27932 }
27936 /* A storage class specifier cannot be applied alongside a typedef
27937 specifier. If there is a typedef specifier present then set
27938 conflicting_specifiers_p which will trigger an error later
27939 on in grokdeclarator. */
27942 }
27944 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27945 is true, the type is a class or enum definition. */
27947 static void
27949 tree type_spec,
27952 {
27955 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27956 (with, for example, in "typedef int wchar_t;") we remember that
27957 this is what happened. In system headers, we ignore these
27958 declarations so that G++ can work with system headers that are not
27959 C++-safe. */
27961 && !type_definition_p
27971 {
27974 ds_redefined_builtin_type_spec,
27975 token);
27977 {
27981 }
27982 }
27985 else
27986 {
27991 }
27992 }
27994 /* True iff TOKEN is the GNU keyword __thread. */
27996 static bool
27998 {
28001 }
28003 /* Set the location for a declarator specifier and check if it is
28004 duplicated.
28006 DECL_SPECS is the sequence of declarator specifiers onto which to
28007 set the location.
28009 DS is the single declarator specifier to set which location is to
28010 be set onto the existing sequence of declarators.
28012 LOCATION is the location for the declarator specifier to
28013 consider. */
28015 static void
28018 {
28027 {
28031 }
28032 else
28033 {
28035 {
28039 else
28040 {
28043 OPT_Wlong_long,
28045 }
28046 }
28048 {
28053 else
28054 {
28058 }
28059 }
28060 else
28061 {
28077 "__complex"
28078 };
28082 }
28083 }
28084 }
28086 /* Return true iff the declarator specifier DS is present in the
28087 sequence of declarator specifiers DECL_SPECS. */
28089 bool
28091 cp_decl_spec ds)
28092 {
28099 }
28101 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28102 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28104 static bool
28106 {
28108 }
28110 /* Issue an error message indicating that TOKEN_DESC was expected.
28111 If KEYWORD is true, it indicated this function is called by
28112 cp_parser_require_keword and the required token can only be
28113 a indicated keyword.
28115 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28116 within any error as the location of an "opening" token matching
28117 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28118 RT_CLOSE_PAREN). */
28120 static void
28122 required_token token_desc,
28124 location_t matching_location)
28125 {
28131 {
28200 }
28203 {
28205 {
28283 }
28284 }
28288 }
28291 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28292 issue an error message indicating that TOKEN_DESC was expected.
28294 Returns the token consumed, if the token had the appropriate type.
28295 Otherwise, returns NULL.
28297 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28298 within any error as the location of an "opening" token matching
28299 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28300 RT_CLOSE_PAREN). */
28305 required_token token_desc,
28306 location_t matching_location)
28307 {
28310 else
28311 {
28312 /* Output the MESSAGE -- unless we're parsing tentatively. */
28315 matching_location);
28317 }
28318 }
28320 /* An error message is produced if the next token is not '>'.
28321 All further tokens are skipped until the desired token is
28322 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28324 static void
28326 {
28327 /* Current level of '< ... >'. */
28329 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28332 /* Are we ready, yet? If not, issue error message. */
28336 /* Skip tokens until the desired token is found. */
28338 {
28339 /* Peek at the next token. */
28341 {
28349 /* C++0x views the `>>' operator as two `>' tokens, but
28350 C++98 does not. */
28353 {
28354 /* We've hit a `>>' where the first `>' closes the
28355 template argument list, and the second `>' is
28356 spurious. Just consume the `>>' and stop; we've
28357 already produced at least one error. */
28360 }
28361 /* Fall through for C++0x, so we handle the second `>' in
28362 the `>>'. */
28367 {
28368 /* We've reached the token we want, consume it and stop. */
28371 }
28390 /* The '>' was probably forgotten, don't look further. */
28395 }
28397 /* Consume this token. */
28399 }
28400 }
28402 /* If the next token is the indicated keyword, consume it. Otherwise,
28403 issue an error message indicating that TOKEN_DESC was expected.
28405 Returns the token consumed, if the token had the appropriate type.
28406 Otherwise, returns NULL. */
28411 required_token token_desc)
28412 {
28416 {
28418 UNKNOWN_LOCATION);
28420 }
28423 }
28425 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28426 function-definition. */
28428 static bool
28430 {
28433 /* A ctor-initializer begins with a `:'. */
28435 /* A function-try-block begins with `try'. */
28437 /* A function-transaction-block begins with `__transaction_atomic'
28438 or `__transaction_relaxed'. */
28441 /* The named return value extension begins with `return'. */
28443 }
28445 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28446 definition. */
28448 static bool
28450 {
28457 }
28459 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28460 C++0x) ending a template-argument. */
28462 static bool
28464 {
28472 }
28474 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28475 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28477 static bool
28480 {
28486 /* Check for the sequence `<::' in the original code. It would be lexed as
28487 `[:', where `[' is a digraph, and there is no whitespace before
28488 `:'. */
28490 {
28495 }
28497 }
28499 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28500 or none_type otherwise. */
28502 static enum tag_types
28504 {
28506 {
28516 }
28517 }
28519 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28520 or none_type otherwise or if the token is null. */
28522 static enum tag_types
28524 {
28529 {
28537 }
28538 }
28540 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28542 static void
28544 {
28548 {
28552 type))
28555 }
28556 }
28558 /* Issue an error message if DECL is redeclared with different
28559 access than its original declaration [class.access.spec/3].
28560 This applies to nested classes, nested class templates and
28561 enumerations [class.mem/1]. */
28563 static void
28565 {
28576 }
28578 /* Look for the `template' keyword, as a syntactic disambiguator.
28579 Return TRUE iff it is present, in which case it will be
28580 consumed. */
28582 static bool
28584 {
28586 {
28587 /* In C++98 the `template' keyword can only be used within templates;
28588 outside templates the parser can always figure out what is a
28589 template and what is not. In C++11, per the resolution of DR 468,
28590 `template' is allowed in cases where it is not strictly necessary. */
28593 {
28596 "in C++98 %<template%> (as a disambiguator) is only "
28598 /* If this part of the token stream is rescanned, the same
28599 error message would be generated. So, we purge the token
28600 from the stream. */
28603 }
28604 else
28605 {
28606 /* Consume the `template' keyword. */
28609 }
28610 }
28612 }
28614 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28615 set PARSER->SCOPE, and perform other related actions. */
28617 static void
28619 {
28622 /* Get the stored value. */
28624 /* Set the scope from the stored value. */
28628 }
28630 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28631 encounter the end of a block before what we were looking for. */
28633 static bool
28637 {
28639 {
28642 /* Abort a parenthesized expression if we encounter a semicolon. */
28646 /* If we've reached the end of the file, stop. */
28652 /* We've hit the end of an enclosing block, so there's been some
28653 kind of syntax error. */
28656 /* Consume the token. */
28658 /* See if it starts a new group. */
28660 {
28662 /* In theory this should probably check end == '}', but
28663 cp_parser_save_member_function_body needs it to exit
28664 after either '}' or ')' when called with ')'. */
28667 }
28669 {
28673 }
28678 }
28679 }
28681 /* Like above, for caching a default argument or NSDMI. Both of these are
28682 terminated by a non-nested comma, but it can be unclear whether or not a
28683 comma is nested in a template argument list unless we do more parsing.
28684 In order to handle this ambiguity, when we encounter a ',' after a '<'
28685 we try to parse what follows as a parameter-declaration-list (in the
28686 case of a default argument) or a member-declarator (in the case of an
28687 NSDMI). If that succeeds, then we stop caching. */
28689 static tree
28691 {
28696 tree default_argument;
28698 /* Add tokens until we have processed the entire default
28699 argument. We add the range [first_token, token). */
28702 {
28703 /* For list-initialization, this is straightforward. */
28706 }
28708 {
28711 /* Peek at the next token. */
28713 /* What we do depends on what token we have. */
28715 {
28716 /* In valid code, a default argument must be
28717 immediately followed by a `,' `)', or `...'. */
28720 {
28721 /* If we've seen a '<', we might be in a
28722 template-argument-list. Until Core issue 325 is
28723 resolved, we don't know how this situation ought
28724 to be handled, so try to DTRT. We check whether
28725 what comes after the comma is a valid parameter
28726 declaration list. If it is, then the comma ends
28727 the default argument; otherwise the default
28728 argument continues. */
28732 /* Set ITALP so cp_parser_parameter_declaration_list
28733 doesn't decide to commit to this parse. */
28740 {
28741 /* Parse declarators until we reach a non-comma or
28742 somthing that cannot be an initializer.
28743 Just checking whether we're looking at a single
28744 declarator is insufficient. Consider:
28745 int var = tuple<T,U>::x;
28746 The template parameter 'U' looks exactly like a
28747 declarator. */
28748 do
28749 {
28760 }
28762 /* If we met an '=' or ';' then the original comma
28763 was the end of the NSDMI. Otherwise assume
28764 we're still in the NSDMI. */
28767 }
28768 else
28769 {
28774 }
28781 }
28782 /* FALLTHRU */
28785 /* If we run into a non-nested `;', `}', or `]',
28786 then the code is invalid -- but the default
28787 argument is certainly over. */
28792 /* Handle correctly int n = sizeof ... ( p ); */
28795 /* Update DEPTH, if necessary. */
28810 /* This might be the comparison operator, or it might
28811 start a template argument list. */
28818 /* Fall through for C++0x, which treats the `>>'
28819 operator like two `>' tokens in certain
28820 cases. */
28825 {
28826 /* This might be an operator, or it might close a
28827 template argument list. But if a previous '<'
28828 started a template argument list, this will have
28829 closed it, so we can't be in one anymore. */
28833 }
28836 /* If we run out of tokens, issue an error message. */
28844 /* In these cases, we should look for template-ids.
28845 For example, if the default argument is
28846 `X<int, double>()', we need to do name lookup to
28847 figure out whether or not `X' is a template; if
28848 so, the `,' does not end the default argument.
28850 That is not yet done. */
28855 }
28857 /* If we've reached the end, stop. */
28861 /* Add the token to the token block. */
28863 }
28865 /* Create a DEFAULT_ARG to represent the unparsed default
28866 argument. */
28873 }
28875 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28877 location_t
28879 {
28884 }
28886 /* Begin parsing tentatively. We always save tokens while parsing
28887 tentatively so that if the tentative parsing fails we can restore the
28888 tokens. */
28890 static void
28892 {
28893 /* Enter a new parsing context. */
28895 /* Begin saving tokens. */
28897 /* In order to avoid repetitive access control error messages,
28898 access checks are queued up until we are no longer parsing
28899 tentatively. */
28901 }
28903 /* Commit to the currently active tentative parse. */
28905 static void
28907 {
28911 /* Mark all of the levels as committed. */
28914 {
28921 }
28922 }
28924 /* Commit to the topmost currently active tentative parse.
28926 Note that this function shouldn't be called when there are
28927 irreversible side-effects while in a tentative state. For
28928 example, we shouldn't create a permanent entry in the symbol
28929 table, or issue an error message that might not apply if the
28930 tentative parse is aborted. */
28932 static void
28934 {
28939 {
28947 }
28948 }
28950 /* Abort the currently active tentative parse. All consumed tokens
28951 will be rolled back, and no diagnostics will be issued. */
28953 static void
28955 {
28959 /* Now, pretend that we want to see if the construct was
28960 successfully parsed. */
28962 }
28964 /* Stop parsing tentatively. If a parse error has occurred, restore the
28965 token stream. Otherwise, commit to the tokens we have consumed.
28966 Returns true if no error occurred; false otherwise. */
28968 static bool
28970 {
28974 /* Remember whether or not an error occurred, since we are about to
28975 destroy that information. */
28977 /* Remove the topmost context from the stack. */
28980 /* If no parse errors occurred, commit to the tentative parse. */
28982 {
28983 /* Commit to the tokens read tentatively, unless that was
28984 already done. */
28989 }
28990 /* Otherwise, if errors occurred, roll back our state so that things
28991 are just as they were before we began the tentative parse. */
28992 else
28993 {
28996 }
28997 /* Add the context to the front of the free list. */
29002 }
29004 /* Returns true if we are parsing tentatively and are not committed to
29005 this tentative parse. */
29007 static bool
29009 {
29012 }
29014 /* Returns nonzero iff an error has occurred during the most recent
29015 tentative parse. */
29017 static bool
29019 {
29022 }
29024 /* Returns nonzero if GNU extensions are allowed. */
29026 static bool
29028 {
29030 }
29031 \f
29032 /* Objective-C++ Productions */
29035 /* Parse an Objective-C expression, which feeds into a primary-expression
29036 above.
29038 objc-expression:
29039 objc-message-expression
29040 objc-string-literal
29041 objc-encode-expression
29042 objc-protocol-expression
29043 objc-selector-expression
29045 Returns a tree representation of the expression. */
29047 static cp_expr
29049 {
29050 /* Try to figure out what kind of declaration is present. */
29054 {
29064 {
29076 }
29077 /* FALLTHRU */
29083 }
29086 }
29088 /* Parse an Objective-C message expression.
29090 objc-message-expression:
29091 [ objc-message-receiver objc-message-args ]
29093 Returns a representation of an Objective-C message. */
29095 static tree
29097 {
29109 /* Construct a location e.g.
29110 [self func1:5]
29111 ^~~~~~~~~~~~~~
29112 ranging from the '[' to the ']', with the caret at the start. */
29117 }
29119 /* Parse an objc-message-receiver.
29121 objc-message-receiver:
29122 expression
29123 simple-type-specifier
29125 Returns a representation of the type or expression. */
29127 static tree
29129 {
29130 tree rcv;
29132 /* An Objective-C message receiver may be either (1) a type
29133 or (2) an expression. */
29137 /* If that worked out, fine. */
29144 CP_PARSER_FLAGS_NONE);
29151 }
29153 /* Parse the arguments and selectors comprising an Objective-C message.
29155 objc-message-args:
29156 objc-selector
29157 objc-selector-args
29158 objc-selector-args , objc-comma-args
29160 objc-selector-args:
29161 objc-selector [opt] : assignment-expression
29162 objc-selector-args objc-selector [opt] : assignment-expression
29164 objc-comma-args:
29165 assignment-expression
29166 objc-comma-args , assignment-expression
29168 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29169 selector arguments and TREE_VALUE containing a list of comma
29170 arguments. */
29172 static tree
29174 {
29180 {
29186 /* Detect if we have a unary selector. */
29195 sel_args
29200 }
29202 /* Handle non-selector arguments, if any. */
29204 {
29205 tree arg;
29210 addl_args
29215 }
29218 {
29221 }
29224 }
29226 /* Parse an Objective-C encode expression.
29228 objc-encode-expression:
29229 @encode objc-typename
29231 Returns an encoded representation of the type argument. */
29233 static cp_expr
29235 {
29236 tree type;
29241 matching_parens parens;
29248 {
29252 }
29254 /* This happens if we find @encode(T) (where T is a template
29255 typename or something dependent on a template typename) when
29256 parsing a template. In that case, we can't compile it
29257 immediately, but we rather create an AT_ENCODE_EXPR which will
29258 need to be instantiated when the template is used.
29259 */
29261 {
29265 }
29268 /* Build a location of the form:
29269 @encode(int)
29270 ^~~~~~~~~~~~
29271 with caret==start at the @ token, finishing at the close paren. */
29272 location_t combined_loc
29277 }
29279 /* Parse an Objective-C @defs expression. */
29281 static tree
29283 {
29284 tree name;
29287 matching_parens parens;
29293 }
29295 /* Parse an Objective-C protocol expression.
29297 objc-protocol-expression:
29298 @protocol ( identifier )
29300 Returns a representation of the protocol expression. */
29302 static tree
29304 {
29305 tree proto;
29309 matching_parens parens;
29314 /* Build a location of the form:
29315 @protocol(prot)
29316 ^~~~~~~~~~~~~~~
29317 with caret==start at the @ token, finishing at the close paren. */
29318 location_t combined_loc
29324 }
29326 /* Parse an Objective-C selector expression.
29328 objc-selector-expression:
29329 @selector ( objc-method-signature )
29331 objc-method-signature:
29332 objc-selector
29333 objc-selector-seq
29335 objc-selector-seq:
29336 objc-selector :
29337 objc-selector-seq objc-selector :
29339 Returns a representation of the method selector. */
29341 static tree
29343 {
29350 matching_parens parens;
29356 {
29365 {
29366 /* Detect if we have a unary selector. */
29368 {
29371 }
29372 else
29373 {
29375 }
29376 }
29381 {
29382 sel_seq
29385 sel_seq
29388 }
29389 else
29390 sel_seq
29395 }
29397 finish_selector:
29401 /* Build a location of the form:
29402 @selector(func)
29403 ^~~~~~~~~~~~~~~
29404 with caret==start at the @ token, finishing at the close paren. */
29405 location_t combined_loc
29409 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29412 }
29414 /* Parse a list of identifiers.
29416 objc-identifier-list:
29417 identifier
29418 objc-identifier-list , identifier
29420 Returns a TREE_LIST of identifier nodes. */
29422 static tree
29424 {
29425 tree identifier;
29426 tree list;
29437 {
29444 identifier));
29446 }
29449 }
29451 /* Parse an Objective-C alias declaration.
29453 objc-alias-declaration:
29454 @compatibility_alias identifier identifier ;
29456 This function registers the alias mapping with the Objective-C front end.
29457 It returns nothing. */
29459 static void
29461 {
29469 }
29471 /* Parse an Objective-C class forward-declaration.
29473 objc-class-declaration:
29474 @class objc-identifier-list ;
29476 The function registers the forward declarations with the Objective-C
29477 front end. It returns nothing. */
29479 static void
29481 {
29484 {
29485 tree id;
29495 else
29497 }
29499 }
29501 /* Parse a list of Objective-C protocol references.
29503 objc-protocol-refs-opt:
29504 objc-protocol-refs [opt]
29506 objc-protocol-refs:
29507 < objc-identifier-list >
29509 Returns a TREE_LIST of identifiers, if any. */
29511 static tree
29513 {
29517 {
29521 }
29524 }
29526 /* Parse a Objective-C visibility specification. */
29528 static void
29530 {
29534 {
29549 }
29551 /* Eat '@private'/'@protected'/'@public'. */
29553 }
29555 /* Parse an Objective-C method type. Return 'true' if it is a class
29556 (+) method, and 'false' if it is an instance (-) method. */
29560 {
29563 else
29565 }
29567 /* Parse an Objective-C protocol qualifier. */
29569 static tree
29571 {
29584 {
29589 }
29592 }
29594 /* Parse an Objective-C typename. */
29596 static tree
29598 {
29602 {
29605 matching_parens parens;
29609 /* An ObjC type name may consist of just protocol qualifiers, in which
29610 case the type shall default to 'id'. */
29612 {
29615 /* If the type could not be parsed, an error has already
29616 been produced. For error recovery, behave as if it had
29617 not been specified, which will use the default type
29618 'id'. */
29620 {
29622 /* We need to skip to the closing parenthesis as
29623 cp_parser_type_id() does not seem to do it for
29624 us. */
29629 }
29630 }
29634 }
29637 }
29639 /* Check to see if TYPE refers to an Objective-C selector name. */
29641 static bool
29643 {
29649 }
29651 /* Parse an Objective-C selector. */
29653 static tree
29655 {
29659 {
29662 }
29664 /* C++ operator names are allowed to appear in ObjC selectors. */
29666 {
29679 }
29680 }
29682 /* Parse an Objective-C params list. */
29684 static tree
29686 {
29692 {
29702 /* Detect if we have a unary selector. */
29705 {
29708 }
29712 {
29713 /* Something went quite wrong. There should be a colon
29714 here, but there is not. Stop parsing parameters. */
29716 }
29718 /* New ObjC allows attributes on parameters too. */
29723 params
29726 type_name,
29727 identifier,
29728 parm_attr));
29731 }
29734 {
29737 }
29739 /* We allow tail attributes for the method. */
29741 {
29749 }
29752 {
29755 }
29757 }
29759 /* Parse the non-keyword Objective-C params. */
29761 static tree
29764 {
29770 {
29772 tree parm;
29778 {
29783 }
29785 /* TODO: parse attributes for tail parameters. */
29794 }
29796 /* We allow tail attributes for the method. */
29798 {
29800 {
29805 }
29806 else
29807 /* We have an error, but parse the attributes, so that we can
29808 carry on. */
29814 }
29817 }
29819 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29821 static void
29823 {
29826 /* If the next token is `extern' and the following token is a string
29827 literal, then we have a linkage specification. */
29829 && cp_parser_is_pure_string_literal
29832 /* Handle #pragma, if any. */
29835 /* Allow stray semicolons. */
29838 /* Mark methods as optional or required, when building protocols. */
29840 {
29843 }
29845 {
29848 }
29851 /* Other stray characters must generate errors. */
29853 {
29857 }
29858 /* Finally, try to parse a block-declaration, or a function-definition. */
29859 else
29861 }
29863 /* Parse a method signature. */
29865 static tree
29867 {
29883 }
29885 static bool
29887 {
29888 tree tattr;
29893 /* If the attributes are followed by a method introducer, this is not allowed.
29894 Dump the attributes and flag the situation. */
29899 /* Otherwise, the attributes introduce some interstitial code, possibly so
29900 rewind to allow that check. */
29903 }
29905 /* Parse an Objective-C method prototype list. */
29907 static void
29909 {
29913 {
29915 {
29920 else
29924 {
29928 }
29931 }
29937 OPT_Wattributes,
29939 else
29940 /* Allow for interspersed non-ObjC++ code. */
29944 }
29948 else
29952 }
29954 /* Parse an Objective-C method definition list. */
29956 static void
29958 {
29962 {
29963 tree meth;
29966 {
29972 else
29977 {
29981 }
29983 NULL_TREE);
29985 /* For historical reasons, we accept an optional semicolon. */
29992 {
29999 }
30000 }
30001 /* The following case will be removed once @synthesize is
30002 completely implemented. */
30013 else
30014 /* Allow for interspersed non-ObjC++ code. */
30018 }
30022 else
30026 }
30028 /* Parse Objective-C ivars. */
30030 static void
30032 {
30043 {
30044 cp_decl_specifier_seq declspecs;
30046 tree prefix_attributes;
30054 CP_PARSER_FLAGS_OPTIONAL,
30058 /* auto, register, static, extern, mutable. */
30060 {
30063 }
30065 /* thread_local. */
30067 {
30070 }
30072 /* typedef. */
30074 {
30077 }
30082 /* Keep going until we hit the `;' at the end of the
30083 declaration. */
30085 {
30090 /* Check for a (possibly unnamed) bitfield declaration. */
30098 {
30099 /* Get the name of the bitfield. */
30102 sfk_none);
30104 eat_colon:
30106 /* Get the width of the bitfield. */
30107 width
30109 }
30110 else
30111 {
30112 /* Parse the declarator. */
30113 declarator
30119 }
30121 /* Look for attributes that apply to the ivar. */
30123 /* Remember which attributes are prefix attributes and
30124 which are not. */
30126 /* Combine the attributes. */
30130 /* Create the bitfield declaration. */
30133 else
30138 /* Add the instance variable. */
30142 /* Reset PREFIX_ATTRIBUTES. */
30151 {
30154 }
30156 }
30160 }
30165 /* Do not consume the RID_AT_END, so it will be read again as terminating
30166 the @interface of @implementation. */
30170 /* For historical reasons, we accept an optional semicolon. */
30173 }
30175 /* Parse an Objective-C protocol declaration. */
30177 static void
30179 {
30185 {
30190 }
30192 /* See if we have a forward declaration or a definition. */
30195 /* Try a forward declaration first. */
30197 {
30199 {
30200 tree id;
30210 else
30212 }
30214 }
30216 /* Ok, we got a full-fledged definition (or at least should). */
30217 else
30218 {
30223 }
30224 }
30226 /* Parse an Objective-C superclass or category. */
30228 static void
30233 {
30239 {
30242 }
30244 {
30245 matching_parens parens;
30248 /* If there is no category name, and this is an @interface, we
30249 have a class extension. */
30251 {
30254 }
30255 else
30259 }
30260 }
30262 /* Parse an Objective-C class interface. */
30264 static void
30266 {
30273 {
30274 /* It's hard to recover because even if valid @interface stuff
30275 is to follow, we can't compile it (or validate it) if we
30276 don't even know which class it refers to. Let's assume this
30277 was a stray '@interface' token in the stream and skip it.
30278 */
30280 }
30285 /* We have either a class or a category on our hands. */
30288 else
30289 {
30291 /* Handle instance variable declarations, if any. */
30294 }
30297 }
30299 /* Parse an Objective-C class implementation. */
30301 static void
30303 {
30310 {
30311 /* It's hard to recover because even if valid @implementation
30312 stuff is to follow, we can't compile it (or validate it) if
30313 we don't even know which class it refers to. Let's assume
30314 this was a stray '@implementation' token in the stream and
30315 skip it.
30316 */
30318 }
30322 /* We have either a class or a category on our hands. */
30325 else
30326 {
30328 /* Handle instance variable declarations, if any. */
30331 }
30334 }
30336 /* Consume the @end token and finish off the implementation. */
30338 static void
30340 {
30343 }
30345 /* Parse an Objective-C declaration. */
30347 static void
30349 {
30350 /* Try to figure out what kind of declaration is present. */
30355 {
30371 }
30374 {
30397 }
30398 }
30400 /* Parse an Objective-C try-catch-finally statement.
30402 objc-try-catch-finally-stmt:
30403 @try compound-statement objc-catch-clause-seq [opt]
30404 objc-finally-clause [opt]
30406 objc-catch-clause-seq:
30407 objc-catch-clause objc-catch-clause-seq [opt]
30409 objc-catch-clause:
30410 @catch ( objc-exception-declaration ) compound-statement
30412 objc-finally-clause:
30413 @finally compound-statement
30415 objc-exception-declaration:
30416 parameter-declaration
30417 '...'
30419 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30421 Returns NULL_TREE.
30423 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30424 for C. Keep them in sync. */
30426 static tree
30428 {
30429 location_t location;
30430 tree stmt;
30435 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30436 node, lest it get absorbed into the surrounding block. */
30442 {
30446 matching_parens parens;
30452 {
30453 /* We have "@catch (...)" (where the '...' are literally
30454 what is in the code). Skip the '...'.
30455 parameter_declaration is set to NULL_TREE, and
30456 objc_being_catch_clauses() knows that that means
30457 '...'. */
30460 }
30461 else
30462 {
30463 /* We have "@catch (NSException *exception)" or something
30464 like that. Parse the parameter declaration. */
30468 else
30473 }
30476 else
30477 {
30478 /* If there was no open parenthesis, we are recovering from
30479 an error, and we are trying to figure out what mistake
30480 the user has made. */
30482 /* If there is an immediate closing parenthesis, the user
30483 probably forgot the opening one (ie, they typed "@catch
30484 NSException *e)". Parse the closing parenthesis and keep
30485 going. */
30489 /* If these is no immediate closing parenthesis, the user
30490 probably doesn't know that parenthesis are required at
30491 all (ie, they typed "@catch NSException *e"). So, just
30492 forget about the closing parenthesis and keep going. */
30493 }
30497 }
30499 {
30502 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30503 node, lest it get absorbed into the surrounding block. */
30507 }
30510 }
30512 /* Parse an Objective-C synchronized statement.
30514 objc-synchronized-stmt:
30515 @synchronized ( expression ) compound-statement
30517 Returns NULL_TREE. */
30519 static tree
30521 {
30522 location_t location;
30529 matching_parens parens;
30534 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30535 node, lest it get absorbed into the surrounding block. */
30540 }
30542 /* Parse an Objective-C throw statement.
30544 objc-throw-stmt:
30545 @throw assignment-expression [opt] ;
30547 Returns a constructed '@throw' statement. */
30549 static tree
30551 {
30563 }
30565 /* Parse an Objective-C statement. */
30567 static tree
30569 {
30570 /* Try to figure out what kind of declaration is present. */
30574 {
30585 }
30588 }
30590 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30591 look ahead to see if an objc keyword follows the attributes. This
30592 is to detect the use of prefix attributes on ObjC @interface and
30593 @protocol. */
30595 static bool
30597 {
30602 {
30605 }
30608 }
30610 /* This routine is a minimal replacement for
30611 c_parser_struct_declaration () used when parsing the list of
30612 types/names or ObjC++ properties. For example, when parsing the
30613 code
30615 @property (readonly) int a, b, c;
30617 this function is responsible for parsing "int a, int b, int c" and
30618 returning the declarations as CHAIN of DECLs.
30620 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30621 similar parsing. */
30622 static tree
30624 {
30626 cp_decl_specifier_seq declspecs;
30628 tree prefix_attributes;
30631 CP_PARSER_FLAGS_NONE,
30638 /* auto, register, static, extern, mutable. */
30640 {
30643 }
30645 /* thread_local. */
30647 {
30650 }
30652 /* typedef. */
30654 {
30657 }
30662 /* Keep going until we hit the `;' at the end of the declaration. */
30664 {
30669 /* Parse the declarator. */
30673 /* Look for attributes that apply to the ivar. */
30675 /* Remember which attributes are prefix attributes and
30676 which are not. */
30678 /* Combine the attributes. */
30688 /* Reset PREFIX_ATTRIBUTES. */
30699 {
30702 }
30703 else
30705 }
30707 }
30709 /* Parse an Objective-C @property declaration. The syntax is:
30711 objc-property-declaration:
30712 '@property' objc-property-attributes[opt] struct-declaration ;
30714 objc-property-attributes:
30715 '(' objc-property-attribute-list ')'
30717 objc-property-attribute-list:
30718 objc-property-attribute
30719 objc-property-attribute-list, objc-property-attribute
30721 objc-property-attribute
30722 'getter' = identifier
30723 'setter' = identifier
30724 'readonly'
30725 'readwrite'
30726 'assign'
30727 'retain'
30728 'copy'
30729 'nonatomic'
30731 For example:
30732 @property NSString *name;
30733 @property (readonly) id object;
30734 @property (retain, nonatomic, getter=getTheName) id name;
30735 @property int a, b, c;
30737 PS: This function is identical to
30738 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30739 static void
30741 {
30742 /* The following variables hold the attributes of the properties as
30743 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30744 seen. When we see an attribute, we set them to 'true' (if they
30745 are boolean properties) or to the identifier (if they have an
30746 argument, ie, for getter and setter). Note that here we only
30747 parse the list of attributes, check the syntax and accumulate the
30748 attributes that we find. objc_add_property_declaration() will
30749 then process the information. */
30759 /* 'properties' is the list of properties that we read. Usually a
30760 single one, but maybe more (eg, in "@property int a, b, c;" there
30761 are three). */
30762 tree properties;
30763 location_t loc;
30769 /* Parse the optional attribute list... */
30771 {
30772 /* Eat the '('. */
30773 matching_parens parens;
30777 {
30783 {
30786 }
30790 {
30801 {
30805 else
30810 }
30813 {
30817 }
30819 {
30821 {
30824 }
30825 else
30829 else
30831 }
30832 else
30833 {
30835 {
30838 }
30839 else
30841 }
30847 }
30854 else
30856 }
30858 /* FIXME: "@property (setter, assign);" will generate a spurious
30859 "error: expected ‘)’ before ‘,’ token". This is because
30860 cp_parser_require, unlike the C counterpart, will produce an
30861 error even if we are in error recovery. */
30863 {
30868 }
30869 }
30871 /* ... and the property declaration(s). */
30875 {
30877 /* If the next token is now a `;', consume it. */
30881 }
30885 else
30886 {
30887 /* Comma-separated properties are chained together in
30888 reverse order; add them one by one. */
30897 }
30900 }
30902 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30904 objc-synthesize-declaration:
30905 @synthesize objc-synthesize-identifier-list ;
30907 objc-synthesize-identifier-list:
30908 objc-synthesize-identifier
30909 objc-synthesize-identifier-list, objc-synthesize-identifier
30911 objc-synthesize-identifier
30912 identifier
30913 identifier = identifier
30915 For example:
30916 @synthesize MyProperty;
30917 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30919 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30920 for C. Keep them in sync.
30921 */
30922 static void
30924 {
30926 location_t loc;
30931 {
30935 {
30938 }
30940 {
30944 {
30947 }
30948 }
30949 else
30954 else
30956 }
30959 }
30961 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30963 objc-dynamic-declaration:
30964 @dynamic identifier-list ;
30966 For example:
30967 @dynamic MyProperty;
30968 @dynamic MyProperty, AnotherProperty;
30970 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30971 for C. Keep them in sync.
30972 */
30973 static void
30975 {
30977 location_t loc;
30982 {
30983 tree property;
30986 {
30989 }
30993 else
30995 }
30998 }
31000 \f
31001 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31003 /* Returns name of the next clause.
31004 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31005 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31006 returned and the token is consumed. */
31008 static pragma_omp_clause
31010 {
31026 {
31031 {
31208 }
31209 }
31215 }
31217 /* Validate that a clause of the given type does not already exist. */
31219 static void
31222 {
31223 tree c;
31227 {
31230 }
31231 }
31233 /* OpenMP 2.5:
31234 variable-list:
31235 identifier
31236 variable-list , identifier
31238 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31239 colon). An opening parenthesis will have been consumed by the caller.
31241 If KIND is nonzero, create the appropriate node and install the decl
31242 in OMP_CLAUSE_DECL and add the node to the head of the list.
31244 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31245 return the list created.
31247 COLON can be NULL if only closing parenthesis should end the list,
31248 or pointer to bool which will receive false if the list is terminated
31249 by closing parenthesis or true if the list is terminated by colon. */
31251 static tree
31254 {
31258 {
31261 }
31263 {
31268 && current_class_ptr
31270 {
31276 }
31277 else
31278 {
31291 }
31293 ;
31295 {
31297 {
31299 /* The OpenACC cache directive explicitly only allows "array
31300 elements or subarrays". */
31302 {
31306 }
31307 /* FALLTHROUGH. */
31312 {
31313 location_t loc
31318 decl
31322 }
31323 /* FALLTHROUGH. */
31327 {
31335 parser->colon_corrects_to_scope_p
31339 else
31340 {
31341 /* Look for `:'. */
31345 CPP_CLOSE_SQUARE))
31347 }
31348 /* Look for the closing `]'. */
31350 RT_CLOSE_SQUARE))
31354 }
31358 }
31364 }
31365 else
31368 get_comma:
31372 }
31378 {
31382 }
31385 {
31388 /* Try to resync to an unnested comma. Copied from
31389 cp_parser_parenthesized_expression_list. */
31390 skip_comma:
31399 }
31402 }
31404 /* Similarly, but expect leading and trailing parenthesis. This is a very
31405 common case for omp clauses. */
31407 static tree
31409 {
31413 }
31415 /* OpenACC 2.0:
31416 copy ( variable-list )
31417 copyin ( variable-list )
31418 copyout ( variable-list )
31419 create ( variable-list )
31420 delete ( variable-list )
31421 present ( variable-list )
31422 present_or_copy ( variable-list )
31423 pcopy ( variable-list )
31424 present_or_copyin ( variable-list )
31425 pcopyin ( variable-list )
31426 present_or_copyout ( variable-list )
31427 pcopyout ( variable-list )
31428 present_or_create ( variable-list )
31429 pcreate ( variable-list ) */
31431 static tree
31433 tree list)
31434 {
31437 {
31483 }
31491 }
31493 /* OpenACC 2.0:
31494 deviceptr ( variable-list ) */
31496 static tree
31498 {
31502 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31503 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31504 variable-list must only allow for pointer variables. */
31507 {
31514 }
31517 }
31519 /* OpenACC 2.0:
31520 auto
31521 independent
31522 nohost
31523 seq */
31525 static tree
31529 {
31534 }
31536 /* OpenACC:
31537 num_gangs ( expression )
31538 num_workers ( expression )
31539 vector_length ( expression ) */
31541 static tree
31544 {
31547 matching_parens parens;
31555 {
31560 }
31568 }
31570 /* OpenACC:
31572 gang [( gang-arg-list )]
31573 worker [( [num:] int-expr )]
31574 vector [( [length:] int-expr )]
31576 where gang-arg is one of:
31578 [num:] int-expr
31579 static: size-expr
31581 and size-expr may be:
31583 *
31584 int-expr
31585 */
31587 static tree
31590 {
31600 {
31601 matching_parens parens;
31604 do
31605 {
31609 /* Gang static argument. */
31612 {
31620 {
31623 }
31625 /* Check for the '*' argument. */
31629 CPP_CLOSE_PAREN)))
31630 {
31635 {
31638 }
31640 }
31641 }
31642 /* Worker num: argument and vector length: arguments. */
31646 {
31649 }
31651 /* Now collect the actual argument. */
31653 {
31656 }
31668 {
31671 }
31673 }
31678 }
31692 cleanup_error:
31695 }
31697 /* OpenACC 2.0:
31698 tile ( size-expr-list ) */
31700 static tree
31702 {
31706 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31707 so, but the spec authors never considered such a case and have
31708 differing opinions on what it might mean, including 'not
31709 allowed'.) */
31712 clause_loc);
31717 do
31718 {
31725 {
31728 }
31729 else
31733 }
31736 /* Consume the trailing ')'. */
31744 }
31746 /* OpenACC 2.0
31747 Parse wait clause or directive parameters. */
31749 static tree
31751 {
31761 {
31766 }
31773 {
31777 {
31780 else
31781 {
31788 }
31789 }
31790 }
31793 }
31795 /* OpenACC:
31796 wait ( int-expr-list ) */
31798 static tree
31800 {
31809 }
31811 /* OpenMP 3.0:
31812 collapse ( constant-expression ) */
31814 static tree
31816 {
31818 location_t loc;
31819 HOST_WIDE_INT n;
31822 matching_parens parens;
31840 {
31843 }
31852 }
31854 /* OpenMP 2.5:
31855 default ( none | shared )
31857 OpenACC:
31858 default ( none | present ) */
31860 static tree
31863 {
31865 tree c;
31867 matching_parens parens;
31871 {
31876 {
31897 }
31900 }
31901 else
31902 {
31903 invalid_kind:
31906 else
31908 }
31925 }
31927 /* OpenMP 3.1:
31928 final ( expression ) */
31930 static tree
31932 {
31935 matching_parens parens;
31954 }
31956 /* OpenMP 2.5:
31957 if ( expression )
31959 OpenMP 4.5:
31960 if ( directive-name-modifier : expression )
31962 directive-name-modifier:
31963 parallel | task | taskloop | target data | target | target update
31964 | target enter data | target exit data */
31966 static tree
31969 {
31973 matching_parens parens;
31978 {
31990 {
31993 {
32006 else
32007 {
32008 location_t loc
32013 }
32016 {
32018 {
32023 }
32025 {
32026 location_t loc
32030 }
32031 }
32032 }
32033 }
32035 {
32037 {
32040 }
32041 else
32042 {
32044 {
32045 location_t loc
32048 }
32050 }
32051 }
32052 }
32064 {
32067 {
32070 {
32080 }
32082 p);
32084 }
32086 {
32089 else
32092 }
32095 {
32099 }
32100 }
32108 }
32110 /* OpenMP 3.1:
32111 mergeable */
32113 static tree
32116 {
32117 tree c;
32120 location);
32125 }
32127 /* OpenMP 2.5:
32128 nowait */
32130 static tree
32133 {
32134 tree c;
32141 }
32143 /* OpenMP 2.5:
32144 num_threads ( expression ) */
32146 static tree
32148 location_t location)
32149 {
32152 matching_parens parens;
32172 }
32174 /* OpenMP 4.5:
32175 num_tasks ( expression ) */
32177 static tree
32179 location_t location)
32180 {
32183 matching_parens parens;
32203 }
32205 /* OpenMP 4.5:
32206 grainsize ( expression ) */
32208 static tree
32210 location_t location)
32211 {
32214 matching_parens parens;
32234 }
32236 /* OpenMP 4.5:
32237 priority ( expression ) */
32239 static tree
32241 location_t location)
32242 {
32245 matching_parens parens;
32265 }
32267 /* OpenMP 4.5:
32268 hint ( expression ) */
32270 static tree
32272 location_t location)
32273 {
32276 matching_parens parens;
32295 }
32297 /* OpenMP 4.5:
32298 defaultmap ( tofrom : scalar ) */
32300 static tree
32302 location_t location)
32303 {
32307 matching_parens parens;
32312 {
32315 }
32319 {
32322 }
32328 {
32331 }
32335 {
32338 }
32344 location);
32350 out_err:
32355 }
32357 /* OpenMP 2.5:
32358 ordered
32360 OpenMP 4.5:
32361 ordered ( constant-expression ) */
32363 static tree
32366 {
32368 HOST_WIDE_INT n;
32374 {
32375 matching_parens parens;
32392 {
32394 "ordered argument needs positive constant integer "
32397 }
32398 }
32404 }
32406 /* OpenMP 2.5:
32407 reduction ( reduction-operator : variable-list )
32409 reduction-operator:
32410 One of: + * - & ^ | && ||
32412 OpenMP 3.1:
32414 reduction-operator:
32415 One of: + * - & ^ | && || min max
32417 OpenMP 4.0:
32419 reduction-operator:
32420 One of: + * - & ^ | && ||
32421 id-expression */
32423 static tree
32425 {
32433 {
32443 }
32447 else
32448 {
32459 {
32489 }
32490 else
32491 {
32493 resync_fail:
32498 }
32499 }
32505 NULL);
32507 {
32510 }
32513 }
32515 /* OpenMP 2.5:
32516 schedule ( schedule-kind )
32517 schedule ( schedule-kind , expression )
32519 schedule-kind:
32520 static | dynamic | guided | runtime | auto
32522 OpenMP 4.5:
32523 schedule ( schedule-modifier : schedule-kind )
32524 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32526 schedule-modifier:
32527 simd
32528 monotonic
32529 nonmonotonic */
32531 static tree
32533 {
32537 matching_parens parens;
32544 {
32553 else
32559 else
32560 {
32563 }
32564 }
32567 {
32572 {
32593 }
32594 }
32599 else
32605 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32607 {
32611 }
32614 {
32629 else
32634 }
32646 invalid_kind:
32648 resync_fail:
32653 }
32655 /* OpenMP 3.0:
32656 untied */
32658 static tree
32661 {
32662 tree c;
32669 }
32671 /* OpenMP 4.0:
32672 inbranch
32673 notinbranch */
32675 static tree
32678 {
32683 }
32685 /* OpenMP 4.0:
32686 parallel
32687 for
32688 sections
32689 taskgroup */
32691 static tree
32695 {
32699 }
32701 /* OpenMP 4.5:
32702 nogroup */
32704 static tree
32707 {
32712 }
32714 /* OpenMP 4.5:
32715 simd
32716 threads */
32718 static tree
32722 {
32727 }
32729 /* OpenMP 4.0:
32730 num_teams ( expression ) */
32732 static tree
32734 location_t location)
32735 {
32738 matching_parens parens;
32758 }
32760 /* OpenMP 4.0:
32761 thread_limit ( expression ) */
32763 static tree
32765 location_t location)
32766 {
32769 matching_parens parens;
32789 }
32791 /* OpenMP 4.0:
32792 aligned ( variable-list )
32793 aligned ( variable-list : constant-expression ) */
32795 static tree
32797 {
32801 matching_parens parens;
32809 {
32819 }
32825 }
32827 /* OpenMP 4.0:
32828 linear ( variable-list )
32829 linear ( variable-list : expression )
32831 OpenMP 4.5:
32832 linear ( modifier ( variable-list ) )
32833 linear ( modifier ( variable-list ) : expression ) */
32835 static tree
32838 {
32843 matching_parens parens;
32848 {
32860 else
32862 }
32867 else
32868 {
32877 }
32880 {
32885 {
32896 {
32899 }
32902 }
32913 }
32916 {
32919 }
32922 }
32924 /* OpenMP 4.0:
32925 safelen ( constant-expression ) */
32927 static tree
32929 location_t location)
32930 {
32933 matching_parens parens;
32952 }
32954 /* OpenMP 4.0:
32955 simdlen ( constant-expression ) */
32957 static tree
32959 location_t location)
32960 {
32963 matching_parens parens;
32982 }
32984 /* OpenMP 4.5:
32985 vec:
32986 identifier [+/- integer]
32987 vec , identifier [+/- integer]
32988 */
32990 static tree
32992 tree list)
32993 {
32997 {
33000 }
33003 {
33010 else
33011 {
33012 t = cp_parser_lookup_name_simple
33017 id_loc);
33018 }
33024 {
33027 }
33031 {
33034 }
33038 {
33041 }
33044 add_to_vector:
33046 {
33050 }
33056 }
33059 {
33065 }
33067 }
33069 /* OpenMP 4.0:
33070 depend ( depend-kind : variable-list )
33072 depend-kind:
33073 in | out | inout
33075 OpenMP 4.5:
33076 depend ( source )
33078 depend ( sink : vec ) */
33080 static tree
33082 {
33086 matching_parens parens;
33091 {
33105 else
33107 }
33108 else
33114 {
33124 }
33131 else
33132 {
33138 }
33141 invalid_kind:
33143 resync_fail:
33148 }
33150 /* OpenMP 4.0:
33151 map ( map-kind : variable-list )
33152 map ( variable-list )
33154 map-kind:
33155 alloc | to | from | tofrom
33157 OpenMP 4.5:
33158 map-kind:
33159 alloc | to | from | tofrom | release | delete
33161 map ( always [,] map-kind: variable-list ) */
33163 static tree
33165 {
33174 {
33179 {
33182 nth++;
33188 {
33193 }
33194 }
33195 }
33199 {
33213 else
33214 {
33220 }
33223 }
33226 {
33230 }
33233 NULL);
33239 }
33241 /* OpenMP 4.0:
33242 device ( expression ) */
33244 static tree
33246 location_t location)
33247 {
33250 matching_parens parens;
33270 }
33272 /* OpenMP 4.0:
33273 dist_schedule ( static )
33274 dist_schedule ( static , expression ) */
33276 static tree
33278 location_t location)
33279 {
33282 matching_parens parens;
33293 {
33304 }
33309 location);
33313 invalid_kind:
33315 resync_fail:
33320 }
33322 /* OpenMP 4.0:
33323 proc_bind ( proc-bind-kind )
33325 proc-bind-kind:
33326 master | close | spread */
33328 static tree
33330 location_t location)
33331 {
33332 tree c;
33339 {
33349 else
33351 }
33352 else
33361 location);
33366 invalid_kind:
33368 resync_fail:
33373 }
33375 /* OpenACC:
33376 async [( int-expr )] */
33378 static tree
33380 {
33387 {
33388 matching_parens parens;
33397 }
33407 }
33409 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33410 is a bitmask in MASK. Return the list of clauses found. */
33412 static tree
33416 {
33421 {
33422 location_t here;
33423 pragma_omp_clause c_kind;
33424 omp_clause_code code;
33435 {
33487 clauses);
33505 OMP_CLAUSE_INDEPENDENT,
33517 clauses);
33523 clauses);
33547 clauses);
33569 clauses);
33581 clauses);
33595 }
33600 {
33601 /* Remove the invalid clause(s) from the list to avoid
33602 confusing the rest of the compiler. */
33605 }
33606 }
33608 saw_error:
33615 }
33617 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33618 is a bitmask in MASK. Return the list of clauses found; the result
33619 of clause default goes in *pdefault. */
33621 static tree
33625 {
33631 {
33632 pragma_omp_clause c_kind;
33643 {
33655 clauses);
33669 clauses);
33689 clauses);
33694 clauses);
33704 clauses);
33738 clauses);
33752 clauses);
33767 OMP_CLAUSE_NOTINBRANCH,
33776 {
33777 clause_not_first:
33781 }
33811 clauses);
33812 else
33822 clauses);
33840 {
33845 }
33888 clauses
33894 clauses
33902 }
33907 {
33908 /* Remove the invalid clause(s) from the list to avoid
33909 confusing the rest of the compiler. */
33912 }
33913 }
33914 saw_error:
33917 {
33920 else
33922 }
33924 }
33926 /* OpenMP 2.5:
33927 structured-block:
33928 statement
33930 In practice, we're also interested in adding the statement to an
33931 outer node. So it is convenient if we work around the fact that
33932 cp_parser_statement calls add_stmt. */
33934 static unsigned
33936 {
33939 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33940 This preserves the "not within loop or switch" style error messages
33941 for nonsense cases like
33942 void foo() {
33943 #pragma omp single
33944 break;
33945 }
33946 */
33951 }
33953 static void
33955 {
33957 }
33959 static tree
33961 {
33969 }
33971 /* OpenMP 2.5:
33972 # pragma omp atomic new-line
33973 expression-stmt
33975 expression-stmt:
33976 x binop= expr | x++ | ++x | x-- | --x
33977 binop:
33978 +, *, -, /, &, ^, |, <<, >>
33980 where x is an lvalue expression with scalar type.
33982 OpenMP 3.1:
33983 # pragma omp atomic new-line
33984 update-stmt
33986 # pragma omp atomic read new-line
33987 read-stmt
33989 # pragma omp atomic write new-line
33990 write-stmt
33992 # pragma omp atomic update new-line
33993 update-stmt
33995 # pragma omp atomic capture new-line
33996 capture-stmt
33998 # pragma omp atomic capture new-line
33999 capture-block
34001 read-stmt:
34002 v = x
34003 write-stmt:
34004 x = expr
34005 update-stmt:
34006 expression-stmt | x = x binop expr
34007 capture-stmt:
34008 v = expression-stmt
34009 capture-block:
34010 { v = x; update-stmt; } | { update-stmt; v = x; }
34012 OpenMP 4.0:
34013 update-stmt:
34014 expression-stmt | x = x binop expr | x = expr binop x
34015 capture-stmt:
34016 v = update-stmt
34017 capture-block:
34018 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34020 where x and v are lvalue expressions with scalar type. */
34022 static void
34024 {
34032 {
34037 {
34043 }
34044 }
34046 {
34058 else
34062 }
34064 {
34070 {
34075 {
34078 }
34079 }
34080 }
34084 {
34094 else
34099 {
34100 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34101 opcode. */
34106 }
34110 {
34113 }
34114 else
34115 {
34121 }
34124 }
34126 restart:
34130 {
34137 /* FALLTHROUGH */
34147 /* FALLTHROUGH */
34162 /* Undo effects of boolean_increment for post {in,de}crement. */
34164 /* FALLTHRU */
34168 {
34169 /* Undo effects of boolean_increment. */
34171 {
34172 /* This is pre or post increment. */
34177 && !structured_block
34181 }
34182 }
34183 /* FALLTHRU */
34186 {
34221 {
34225 }
34228 {
34234 {
34239 }
34241 {
34253 {
34255 {
34260 }
34261 else
34263 }
34267 }
34270 {
34277 }
34281 }
34285 {
34288 {
34296 }
34298 {
34303 }
34338 }
34349 /* FALLTHROUGH */
34354 }
34361 }
34362 stmt_done:
34364 {
34375 }
34377 {
34380 }
34381 done:
34387 saw_error:
34390 {
34394 {
34398 }
34399 }
34400 }
34403 /* OpenMP 2.5:
34404 # pragma omp barrier new-line */
34406 static void
34408 {
34411 }
34413 /* OpenMP 2.5:
34414 # pragma omp critical [(name)] new-line
34415 structured-block
34417 OpenMP 4.5:
34418 # pragma omp critical [(name) [hint(expression)]] new-line
34419 structured-block */
34421 #define OMP_CRITICAL_CLAUSE_MASK \
34422 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34424 static tree
34426 {
34430 {
34431 matching_parens parens;
34445 OMP_CRITICAL_CLAUSE_MASK,
34447 }
34448 else
34453 }
34455 /* OpenMP 2.5:
34456 # pragma omp flush flush-vars[opt] new-line
34458 flush-vars:
34459 ( variable-list ) */
34461 static void
34463 {
34469 }
34471 /* Helper function, to parse omp for increment expression. */
34473 static tree
34475 {
34480 {
34483 }
34486 {
34493 /* Fall through: OpenMP disallows NE_EXPR. */
34497 }
34499 /* If decl is an iterator, preserve LHS and RHS of the relational
34500 expr until finish_omp_for. */
34511 }
34513 /* Helper function, to parse omp for increment expression. */
34515 static tree
34517 {
34521 cp_id_kind idk;
34525 {
34534 }
34543 {
34548 }
34555 {
34559 }
34572 do
34573 {
34580 {
34582 {
34585 else
34587 tf_warning_or_error);
34588 }
34589 else
34592 }
34593 }
34597 {
34603 }
34604 else
34608 }
34610 /* Parse the initialization statement of an OpenMP for loop.
34612 Return true if the resulting construct should have an
34613 OMP_CLAUSE_PRIVATE added to it. */
34615 static tree
34623 {
34629 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34631 init-expr:
34632 var = lb
34633 integer-type var = lb
34634 random-access-iterator-type var = lb
34635 pointer-type var = lb
34636 */
34637 cp_decl_specifier_seq type_specifiers;
34639 /* First, try to parse as an initialized declaration. See
34640 cp_parser_condition, from whence the bulk of this is copied. */
34647 {
34648 /* If parsing a type specifier seq succeeded, then this
34649 MUST be a initialized declaration. */
34654 CP_PARSER_DECLARATOR_NAMED,
34665 else
34666 {
34676 {
34678 CPP_OPEN_PAREN))
34681 else
34682 /* Trigger an error. */
34687 }
34691 {
34699 {
34702 auto_node);
34707 }
34710 asm_specification,
34711 LOOKUP_ONLYCONVERTING);
34714 {
34717 }
34718 else
34719 {
34722 {
34724 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34726 {
34730 {
34734 }
34736 }
34738 {
34743 }
34744 }
34745 }
34747 }
34748 else
34749 {
34750 /* Consume '='. */
34754 non_class:
34757 else
34760 asm_specification,
34761 LOOKUP_ONLYCONVERTING);
34762 }
34766 }
34767 }
34768 else
34769 {
34770 cp_id_kind idk;
34771 /* If parsing a type specifier sequence failed, then
34772 this MUST be a simple expression. */
34778 && decl
34781 {
34792 {
34797 }
34802 }
34804 && decl
34807 {
34808 tree rhs;
34816 rhs,
34817 tf_warning_or_error));
34820 }
34821 else
34822 {
34827 {
34831 }
34832 }
34833 }
34835 }
34837 /* Parse the restricted form of the for statement allowed by OpenMP. */
34839 static tree
34842 {
34846 location_t loc_first;
34857 {
34860 }
34863 {
34866 }
34869 {
34875 }
34877 {
34880 {
34882 "%<linear%> clause may not be specified together "
34885 }
34886 else
34888 }
34901 {
34904 location_t loc;
34907 {
34911 }
34914 matching_parens parens;
34921 add_private_clause
34927 {
34930 {
34936 }
34937 else
34939 }
34946 {
34951 {
34955 }
34958 {
34959 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34963 {
34966 }
34967 else
34968 {
34971 }
34973 }
34974 else
34975 {
34980 }
34981 }
34984 {
34985 tree c;
34987 {
34996 decl);
35000 decl);
35001 }
35003 {
35008 else
35013 {
35016 /* For linear, signal that we need to fill up
35017 the so far unknown linear step. */
35020 }
35021 }
35022 }
35031 {
35032 /* If decl is an iterator, preserve the operator on decl
35033 until finish_omp_for. */
35035 && ((processing_template_decl
35040 else
35044 }
35056 {
35059 }
35064 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35065 in between the collapsed for loops to be still considered perfectly
35066 nested. Hopefully the final version clarifies this.
35067 For now handle (multiple) {'s and empty statements. */
35070 {
35074 {
35076 bracecount++;
35077 }
35081 else
35082 {
35089 }
35090 }
35093 {
35096 }
35097 }
35102 /* Note that we saved the original contents of this flag when we entered
35103 the structured block, and so we don't need to re-save it here. */
35106 /* Note that the grammar doesn't call for a structured block here,
35107 though the loop as a whole is a structured block. */
35114 else
35119 {
35121 {
35123 nbraces--;
35124 }
35127 else
35128 {
35130 {
35133 }
35138 }
35139 }
35142 {
35146 else
35148 }
35152 }
35154 /* Helper function for OpenMP parsing, split clauses and call
35155 finish_omp_clauses on each of the set of clauses afterwards. */
35157 static void
35160 {
35166 }
35168 /* OpenMP 4.0:
35169 #pragma omp simd simd-clause[optseq] new-line
35170 for-loop */
35172 #define OMP_SIMD_CLAUSE_MASK \
35173 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35182 static tree
35186 {
35197 {
35201 OMP_CLAUSE_ORDERED);
35203 {
35205 "%<ordered%> clause with parameter may not be specified "
35208 }
35209 }
35220 }
35222 /* OpenMP 2.5:
35223 #pragma omp for for-clause[optseq] new-line
35224 for-loop
35226 OpenMP 4.0:
35227 #pragma omp for simd for-simd-clause[optseq] new-line
35228 for-loop */
35230 #define OMP_FOR_CLAUSE_MASK \
35231 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35241 static tree
35245 {
35252 /* parallel for{, simd} disallows nowait clause, but for
35253 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35256 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35261 {
35266 {
35290 }
35291 }
35293 {
35296 }
35298 /* Composite distribute parallel for disallows linear clause. */
35305 {
35308 }
35319 }
35321 /* OpenMP 2.5:
35322 # pragma omp master new-line
35323 structured-block */
35325 static tree
35327 {
35331 }
35333 /* OpenMP 2.5:
35334 # pragma omp ordered new-line
35335 structured-block
35337 OpenMP 4.5:
35338 # pragma omp ordered ordered-clauses new-line
35339 structured-block */
35341 #define OMP_ORDERED_CLAUSE_MASK \
35342 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35345 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35346 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35348 static bool
35351 {
35355 {
35360 {
35362 {
35365 }
35367 {
35369 "%<depend%> clause may only be used in compound "
35373 }
35374 tree clauses
35376 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35380 }
35381 }
35383 tree clauses
35394 }
35396 /* OpenMP 2.5:
35398 section-scope:
35399 { section-sequence }
35401 section-sequence:
35402 section-directive[opt] structured-block
35403 section-sequence section-directive structured-block */
35405 static tree
35407 {
35412 matching_braces braces;
35420 {
35424 }
35427 {
35435 {
35439 }
35441 {
35444 }
35449 }
35460 }
35462 /* OpenMP 2.5:
35463 # pragma omp sections sections-clause[optseq] newline
35464 sections-scope */
35466 #define OMP_SECTIONS_CLAUSE_MASK \
35467 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35473 static tree
35476 {
35488 {
35491 }
35498 }
35500 /* OpenMP 2.5:
35501 # pragma omp parallel parallel-clause[optseq] new-line
35502 structured-block
35503 # pragma omp parallel for parallel-for-clause[optseq] new-line
35504 structured-block
35505 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35506 structured-block
35508 OpenMP 4.0:
35509 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35510 structured-block */
35512 #define OMP_PARALLEL_CLAUSE_MASK \
35513 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35523 static tree
35527 {
35534 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35540 {
35548 if_p);
35552 if_p);
35555 block);
35560 }
35561 /* When combined with distribute, parallel has to be followed by for.
35562 #pragma omp target parallel is allowed though. */
35566 {
35570 }
35572 {
35575 }
35577 {
35581 {
35591 block);
35594 }
35595 }
35600 {
35603 }
35611 }
35613 /* OpenMP 2.5:
35614 # pragma omp single single-clause[optseq] new-line
35615 structured-block */
35617 #define OMP_SINGLE_CLAUSE_MASK \
35618 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35623 static tree
35625 {
35635 }
35637 /* OpenMP 3.0:
35638 # pragma omp task task-clause[optseq] new-line
35639 structured-block */
35641 #define OMP_TASK_CLAUSE_MASK \
35642 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35653 static tree
35655 {
35666 }
35668 /* OpenMP 3.0:
35669 # pragma omp taskwait new-line */
35671 static void
35673 {
35676 }
35678 /* OpenMP 3.1:
35679 # pragma omp taskyield new-line */
35681 static void
35683 {
35686 }
35688 /* OpenMP 4.0:
35689 # pragma omp taskgroup new-line
35690 structured-block */
35692 static tree
35694 {
35698 if_p));
35699 }
35702 /* OpenMP 2.5:
35703 # pragma omp threadprivate (variable-list) */
35705 static void
35707 {
35708 tree vars;
35714 }
35716 /* OpenMP 4.0:
35717 # pragma omp cancel cancel-clause[optseq] new-line */
35719 #define OMP_CANCEL_CLAUSE_MASK \
35720 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35726 static void
35728 {
35732 }
35734 /* OpenMP 4.0:
35735 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35737 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35738 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35743 static void
35746 {
35747 tree clauses;
35751 {
35756 {
35759 }
35760 }
35762 {
35766 }
35769 {
35774 else
35778 }
35781 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35783 pragma_tok);
35785 }
35787 /* OpenMP 4.0:
35788 #pragma omp distribute distribute-clause[optseq] new-line
35789 for-loop */
35791 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35798 static tree
35802 {
35811 {
35819 else
35822 {
35828 {
35832 else
35835 }
35841 else
35855 }
35856 }
35858 {
35861 }
35866 {
35869 }
35880 }
35882 /* OpenMP 4.0:
35883 # pragma omp teams teams-clause[optseq] new-line
35884 structured-block */
35886 #define OMP_TEAMS_CLAUSE_MASK \
35887 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35895 static tree
35899 {
35908 {
35912 {
35937 }
35938 }
35940 {
35943 }
35948 {
35951 }
35960 }
35962 /* OpenMP 4.0:
35963 # pragma omp target data target-data-clause[optseq] new-line
35964 structured-block */
35966 #define OMP_TARGET_DATA_CLAUSE_MASK \
35967 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35972 static tree
35974 {
35975 tree clauses
35980 {
35983 {
36000 "%<#pragma omp target data%> with map-type other "
36001 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36005 }
36007 }
36010 {
36013 "%<#pragma omp target data%> must contain at least "
36016 }
36027 }
36029 /* OpenMP 4.5:
36030 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36031 structured-block */
36033 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36040 static tree
36043 {
36046 {
36051 {
36054 }
36055 }
36057 {
36061 }
36064 {
36070 }
36072 tree clauses
36077 {
36080 {
36093 "%<#pragma omp target enter data%> with map-type other "
36097 }
36099 }
36102 {
36105 "%<#pragma omp target enter data%> must contain at least "
36108 }
36115 }
36117 /* OpenMP 4.5:
36118 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36119 structured-block */
36121 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36122 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36128 static tree
36131 {
36134 {
36139 {
36142 }
36143 }
36145 {
36149 }
36152 {
36158 }
36160 tree clauses
36165 {
36168 {
36182 "%<#pragma omp target exit data%> with map-type other "
36183 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36187 }
36189 }
36192 {
36195 "%<#pragma omp target exit data%> must contain at least "
36198 }
36205 }
36207 /* OpenMP 4.0:
36208 # pragma omp target update target-update-clause[optseq] new-line */
36210 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36211 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36218 static bool
36221 {
36223 {
36229 }
36231 tree clauses
36236 {
36238 "%<#pragma omp target update%> must contain at least one "
36241 }
36249 }
36251 /* OpenMP 4.0:
36252 # pragma omp target target-clause[optseq] new-line
36253 structured-block */
36255 #define OMP_TARGET_CLAUSE_MASK \
36256 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36266 static bool
36269 {
36273 {
36285 {
36293 {
36294 tree stmt;
36296 {
36299 OMP_TARGET_CLAUSE_MASK,
36304 OMP_TARGET_CLAUSE_MASK,
36309 OMP_TARGET_CLAUSE_MASK,
36314 }
36316 }
36321 {
36325 if_p);
36330 if_p);
36335 if_p);
36339 }
36345 {
36346 /* For combined target teams, ensure the num_teams and
36347 thread_limit clause expressions are evaluated on the host,
36348 before entering the target construct. */
36349 tree c;
36355 {
36364 OMP_CLAUSE_FIRSTPRIVATE);
36369 }
36370 }
36380 }
36382 {
36385 }
36387 {
36391 }
36393 {
36397 }
36399 {
36403 }
36405 {
36408 }
36409 }
36411 {
36414 }
36429 check_clauses:
36431 {
36434 {
36448 "%<#pragma omp target%> with map-type other "
36449 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36453 }
36455 }
36457 }
36459 /* OpenACC 2.0:
36460 # pragma acc cache (variable-list) new-line
36461 */
36463 static tree
36465 {
36480 }
36482 /* OpenACC 2.0:
36483 # pragma acc data oacc-data-clause[optseq] new-line
36484 structured-block */
36486 #define OACC_DATA_CLAUSE_MASK \
36487 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36499 static tree
36501 {
36514 }
36516 /* OpenACC 2.0:
36517 # pragma acc host_data <clauses> new-line
36518 structured-block */
36520 #define OACC_HOST_DATA_CLAUSE_MASK \
36521 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36523 static tree
36525 {
36538 }
36540 /* OpenACC 2.0:
36541 # pragma acc declare oacc-data-clause[optseq] new-line
36542 */
36544 #define OACC_DECLARE_CLAUSE_MASK \
36545 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36558 static tree
36560 {
36569 {
36573 }
36576 {
36580 {
36584 }
36587 {
36599 {
36601 "%qD must be a global variable in "
36603 decl);
36606 }
36611 {
36615 }
36617 {
36619 "invalid use of %<extern%> variable %qD "
36623 }
36625 {
36627 "invalid use of %<global%> variable %qD "
36631 }
36633 }
36638 {
36643 }
36646 {
36647 tree id;
36651 else
36657 {
36660 {
36663 {
36667 }
36668 }
36669 }
36670 }
36671 }
36684 }
36686 /* OpenACC 2.0:
36687 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36689 or
36691 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36693 LOC is the location of the #pragma token.
36694 */
36696 #define OACC_ENTER_DATA_CLAUSE_MASK \
36697 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36705 #define OACC_EXIT_DATA_CLAUSE_MASK \
36706 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36712 static tree
36715 {
36724 {
36729 }
36736 else
36741 {
36745 }
36753 }
36755 /* OpenACC 2.0:
36756 # pragma acc loop oacc-loop-clause[optseq] new-line
36757 structured-block */
36759 #define OACC_LOOP_CLAUSE_MASK \
36760 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36771 static tree
36774 {
36783 {
36789 }
36798 }
36800 /* OpenACC 2.0:
36801 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36802 structured-block
36804 or
36806 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36807 structured-block
36808 */
36810 #define OACC_KERNELS_CLAUSE_MASK \
36811 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36829 #define OACC_PARALLEL_CLAUSE_MASK \
36830 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36851 static tree
36854 {
36855 omp_clause_mask mask;
36858 {
36871 }
36874 {
36878 {
36881 tree clauses;
36883 if_p);
36885 }
36886 }
36895 }
36897 /* OpenACC 2.0:
36898 # pragma acc update oacc-update-clause[optseq] new-line
36899 */
36901 #define OACC_UPDATE_CLAUSE_MASK \
36902 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36909 static tree
36911 {
36918 {
36920 "%<#pragma acc update%> must contain at least one "
36923 }
36931 }
36933 /* OpenACC 2.0:
36934 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36936 LOC is the location of the #pragma token.
36937 */
36939 #define OACC_WAIT_CLAUSE_MASK \
36940 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36942 static tree
36944 {
36958 }
36960 /* OpenMP 4.0:
36961 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36963 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36964 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36971 static void
36974 {
36976 cp_omp_declare_simd_data data;
36978 {
36983 /* It is safe to take the address of a local variable; it will only be
36984 used while this scope is live. */
36986 }
36988 /* Store away all pragma tokens. */
37000 {
37004 {
37017 }
37022 "%<#pragma omp declare simd%> not immediately followed by "
37026 }
37027 }
37029 /* Finalize #pragma omp declare simd clauses after direct declarator has
37030 been parsed, and put that into "omp declare simd" attribute. */
37032 static tree
37034 {
37040 {
37044 }
37049 {
37067 }
37071 }
37074 /* OpenMP 4.0:
37075 # pragma omp declare target new-line
37076 declarations and definitions
37077 # pragma omp end declare target new-line
37079 OpenMP 4.5:
37080 # pragma omp declare target ( extended-list ) new-line
37082 # pragma omp declare target declare-target-clauses[seq] new-line */
37084 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37085 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37088 static void
37090 {
37093 clauses
37097 {
37099 clauses);
37102 }
37103 else
37104 {
37108 }
37111 "%<#pragma omp declare target%> with clauses in between "
37112 "%<#pragma omp declare target%> without clauses and "
37115 {
37121 {
37124 }
37125 else
37128 {
37130 "%qD specified both in declare target %<link%> and %<to%>"
37133 }
37135 {
37142 {
37145 {
37149 }
37150 }
37151 }
37152 }
37153 }
37155 static void
37157 {
37160 {
37163 }
37165 {
37169 {
37172 }
37175 else
37176 {
37180 }
37181 }
37182 else
37183 {
37187 }
37191 "%<#pragma omp end declare target%> without corresponding "
37193 else
37195 }
37197 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37198 expression and optional initializer clause of
37199 #pragma omp declare reduction. We store the expression(s) as
37200 either 3, 6 or 7 special statements inside of the artificial function's
37201 body. The first two statements are DECL_EXPRs for the artificial
37202 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37203 expression that uses those variables.
37204 If there was any INITIALIZER clause, this is followed by further statements,
37205 the fourth and fifth statements are DECL_EXPRs for the artificial
37206 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37207 constructor variant (first token after open paren is not omp_priv),
37208 then the sixth statement is a statement with the function call expression
37209 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37210 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37211 to initialize the OMP_PRIV artificial variable and there is seventh
37212 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37214 static bool
37216 {
37228 tree combiner;
37243 {
37246 }
37249 {
37251 matching_parens parens;
37257 {
37260 }
37276 {
37280 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37284 == CPP_CLOSE_PAREN
37287 {
37291 }
37296 }
37297 else
37298 {
37314 {
37319 }
37321 tree arg;
37334 }
37345 }
37349 UNKNOWN_LOCATION);
37352 }
37354 /* OpenMP 4.0
37355 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37356 initializer-clause[opt] new-line
37358 initializer-clause:
37359 initializer (omp_priv initializer)
37360 initializer (function-name (argument-list)) */
37362 static void
37365 {
37375 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37382 {
37414 }
37426 /* Types may not be defined in declare reduction type list. */
37429 parser->type_definition_forbidden_message
37435 saved_colon_doesnt_start_class_def_p
37440 {
37444 ;
37463 else
37468 else
37470 }
37472 /* Restore the saved message. */
37475 parser->colon_doesnt_start_class_def_p
37480 {
37481 fail:
37484 }
37490 {
37491 tree fntype
37494 NULL_TREE);
37514 {
37519 }
37521 {
37523 {
37532 }
37539 }
37540 else
37541 {
37544 }
37547 else
37550 {
37553 }
37555 {
37558 else
37563 }
37568 else
37569 {
37578 }
37585 }
37589 done:
37590 /* Free any declarators allocated. */
37592 }
37594 /* OpenMP 4.0
37595 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37596 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37597 initializer-clause[opt] new-line
37598 #pragma omp declare target new-line */
37600 static bool
37603 {
37605 {
37610 {
37613 context);
37615 }
37618 {
37621 context);
37623 }
37625 {
37628 }
37630 {
37634 }
37635 }
37640 }
37642 /* OpenMP 4.5:
37643 #pragma omp taskloop taskloop-clause[optseq] new-line
37644 for-loop
37646 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37647 for-loop */
37649 #define OMP_TASKLOOP_CLAUSE_MASK \
37650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37665 static tree
37669 {
37678 {
37683 {
37707 }
37708 }
37710 {
37713 }
37718 {
37721 }
37727 if_p);
37733 }
37736 /* OpenACC 2.0:
37737 # pragma acc routine oacc-routine-clause[optseq] new-line
37738 function-definition
37740 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37741 */
37743 #define OACC_ROUTINE_CLAUSE_MASK \
37744 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37750 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37751 component, which must resolve to a declared namespace-scope
37752 function. The clauses are either processed directly (for a named
37753 function), or defered until the immediatley following declaration
37754 is parsed. */
37756 static void
37759 {
37761 /* The checking for "another pragma following this one" in the "no optional
37762 '( name )'" case makes sure that we dont re-enter. */
37765 cp_oacc_routine_data data;
37771 /* It is safe to take the address of a local variable; it will only be
37772 used while this scope is live. */
37775 /* Look for optional '( name )'. */
37777 {
37778 matching_parens parens;
37781 /* We parse the name as an id-expression. If it resolves to
37782 anything other than a non-overloaded function at namespace
37783 scope, it's an error. */
37797 {
37801 }
37803 data.clauses
37811 {
37816 }
37818 /* Perhaps we should use the same rule as declarations in different
37819 namespaces? */
37821 {
37826 }
37829 {
37833 }
37837 }
37839 {
37840 /* Store away all pragma tokens. */
37851 /* Emit a helpful diagnostic if there's another pragma following this
37852 one. */
37854 {
37857 /* ..., and then just keep going. */
37859 }
37861 /* We only have to consider the pragma_external case here. */
37866 else
37869 }
37870 }
37872 /* Finalize #pragma acc routine clauses after direct declarator has
37873 been parsed. */
37875 static tree
37877 {
37882 {
37884 "%<#pragma acc routine%> not immediately followed by "
37887 }
37904 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37905 fndecl_seen. */
37908 }
37910 /* Apply any saved OpenACC routine clauses to a just-parsed
37911 declaration. */
37913 static void
37915 {
37917 {
37918 /* Keep going if we're in error reporting mode. */
37924 {
37926 "%<#pragma acc routine%> not immediately followed by"
37930 }
37932 {
37935 }
37938 {
37943 }
37946 {
37954 }
37956 /* Process the routine's dimension clauses. */
37960 /* Add an "omp declare target" attribute. */
37965 /* Don't unset parser->oacc_routine here: we may still need it to
37966 diagnose wrong usage. But, remember that we've used this "#pragma acc
37967 routine". */
37969 }
37970 }
37972 /* Main entry point to OpenMP statement pragmas. */
37974 static void
37976 {
37977 tree stmt;
37982 {
38005 if_p);
38010 if_p);
38027 if_p);
38032 if_p);
38040 if_p);
38049 if_p);
38063 if_p);
38068 if_p);
38072 }
38075 }
38076 \f
38077 /* Transactional Memory parsing routines. */
38079 /* Parse a transaction attribute.
38081 txn-attribute:
38082 attribute
38083 [ [ identifier ] ]
38085 We use this instead of cp_parser_attributes_opt for transactions to avoid
38086 the pedwarn in C++98 mode. */
38088 static tree
38090 {
38105 {
38109 /* For keywords, use the canonical spelling,
38110 not the parsed identifier. */
38114 }
38115 else
38119 error1:
38122 }
38124 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38126 transaction-statement:
38127 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38128 compound-statement
38129 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38130 */
38132 static tree
38134 {
38145 else
38146 {
38150 }
38152 /* Parse a noexcept specification. */
38156 {
38157 /* cancel-and-throw is unimplemented. */
38160 }
38161 else
38164 /* Keep track if we're in the lexical scope of an outer transaction. */
38176 }
38178 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38180 transaction-expression:
38181 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38182 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38183 */
38185 static tree
38187 {
38200 keyword == RID_TRANSACTION_RELAXED
38214 /* Set this early. This might mean that we allow transaction_cancel in
38215 an expression that we find out later actually has to be a constexpr.
38216 However, we expect that cxx_constant_value will be able to deal with
38217 this; also, if the noexcept has no constexpr, then what we parse next
38218 really is a transaction's body. */
38221 /* Parse a noexcept specification. */
38227 {
38228 matching_parens parens;
38235 }
38236 else
38237 {
38238 /* The only expression that is available got parsed for the noexcept
38239 already. noexcept is true then. */
38242 }
38251 }
38253 /* Parse a function-transaction-block.
38255 function-transaction-block:
38256 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38257 function-body
38258 __transaction_atomic txn-attribute[opt] function-try-block
38259 __transaction_relaxed ctor-initializer[opt] function-body
38260 __transaction_relaxed function-try-block
38261 */
38263 static void
38265 {
38280 else
38281 {
38285 }
38293 else
38294 cp_parser_ctor_initializer_opt_and_function_body
38300 }
38302 /* Parse a __transaction_cancel statement.
38304 cancel-statement:
38305 __transaction_cancel txn-attribute[opt] ;
38306 __transaction_cancel txn-attribute[opt] throw-expression ;
38308 ??? Cancel and throw is not yet implemented. */
38310 static tree
38312 {
38318 RT_TRANSACTION_CANCEL);
38325 /* ??? Parse cancel-and-throw here. */
38330 {
38334 }
38336 {
38340 }
38342 {
38345 {
38351 }
38352 }
38354 {
38358 }
38364 }
38365 \f
38366 /* The parser. */
38370 \f
38371 /* Special handling for the first token or line in the file. The first
38372 thing in the file might be #pragma GCC pch_preprocess, which loads a
38373 PCH file, which is a GC collection point. So we need to handle this
38374 first pragma without benefit of an existing lexer structure.
38376 Always returns one token to the caller in *FIRST_TOKEN. This is
38377 either the true first token of the file, or the first token after
38378 the initial pragma. */
38380 static void
38382 {
38391 {
38398 }
38399 else
38402 /* Skip to the end of the pragma. */
38406 /* Now actually load the PCH file. */
38410 /* Read one more token to return to our caller. We have to do this
38411 after reading the PCH file in, since its pointers have to be
38412 live. */
38414 }
38416 /* Normal parsing of a pragma token. Here we can (and must) use the
38417 regular lexer. */
38419 static bool
38421 {
38424 tree stmt;
38435 {
38443 {
38453 }
38458 {
38468 }
38473 {
38484 }
38489 {
38500 }
38505 {
38516 }
38536 {
38541 }
38549 {
38554 }
38562 {
38566 }
38572 {
38577 }
38585 {
38590 }
38645 "%<#pragma omp section%> may only be used in "
38650 {
38652 {
38656 }
38663 {
38666 }
38669 }
38676 bad_stmt:
38679 }
38683 }
38685 /* The interface the pragma parsers have to the lexer. */
38687 enum cpp_ttype
38689 {
38701 else
38702 {
38706 }
38709 }
38711 \f
38712 /* External interface. */
38714 /* Parse one entire translation unit. */
38716 void
38718 {
38731 }
38733 /* Create an identifier for a generic parameter type (a synthesized
38734 template parameter implied by `auto' or a concept identifier). */
38737 static tree
38739 {
38743 }
38745 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38746 (creating a new template parameter list if necessary). Returns the newly
38747 created template type parm. */
38749 static tree
38751 {
38754 /* Before committing to modifying any scope, if we're in an
38755 implicit template scope, and we're trying to synthesize a
38756 constrained parameter, try to find a previous parameter with
38757 the same name. This is the same-type rule for abbreviated
38758 function templates.
38760 NOTE: We can generate implicit parameters when tentatively
38761 parsing a nested name specifier, only to reject that parse
38762 later. However, matching the same template-id as part of a
38763 direct-declarator should generate an identical template
38764 parameter, so this rule will merge them. */
38766 {
38769 {
38771 {
38774 /* Return the TEMPLATE_PARM_INDEX. */
38777 }
38779 }
38780 }
38782 /* We are either continuing a function template that already contains implicit
38783 template parameters, creating a new fully-implicit function template, or
38784 extending an existing explicit function template with implicit template
38785 parameters. */
38793 {
38797 }
38798 else
38799 {
38800 /* Roll back to the existing template parameter scope (in the case of
38801 extending an explicit function template) or introduce a new template
38802 parameter scope ahead of the function parameter scope (or class scope
38803 in the case of out-of-line member definitions). The function scope is
38804 added back after template parameter synthesis below. */
38809 {
38812 }
38814 {
38815 /* If not defining a class, then any class scope is a scope level in
38816 an out-of-line member definition. In this case simply wind back
38817 beyond the first such scope to inject the template parameter list.
38818 Otherwise wind back to the class being defined. The latter can
38819 occur in class member friend declarations such as:
38821 class A {
38822 void foo (auto);
38823 };
38824 class B {
38825 friend void A::foo (auto);
38826 };
38828 The template parameter list synthesized for the friend declaration
38829 must be injected in the scope of 'B'. This can also occur in
38830 erroneous cases such as:
38832 struct A {
38833 struct B {
38834 void foo (auto);
38835 };
38836 void B::foo (auto) {}
38837 };
38839 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38840 but, nevertheless, the template parameter list synthesized for the
38841 declarator should be injected into the scope of 'A' as if the
38842 ill-formed template was specified explicitly. */
38845 {
38848 }
38849 }
38855 {
38856 /* Introduce a new template parameter list for implicit template
38857 parameters. */
38861 parser->implicit_template_scope
38868 }
38869 else
38870 {
38871 /* Synthesize implicit template parameters at the end of the explicit
38872 template parameter list. */
38879 parser->implicit_template_parms
38881 }
38882 }
38884 /* Synthesize a new template parameter and track the current template
38885 parameter chain with implicit_template_parms. */
38889 tree synth_tmpl_parm;
38893 synth_tmpl_parm
38896 synth_tmpl_parm
38898 else
38899 {
38903 }
38905 // Attach the constraint to the parm before processing.
38908 tree new_parm
38910 input_location,
38911 node,
38915 // Chain the new parameter to the list of implicit parameters.
38917 parser->implicit_template_parms
38919 else
38924 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38927 /* If creating a fully implicit function template, start the new implicit
38928 template parameter list with this synthesized type, otherwise grow the
38929 current template parameter list. */
38932 {
38939 }
38940 else
38941 {
38946 }
38948 // If the new parameter was constrained, we need to add that to the
38949 // constraints in the template parameter list.
38951 {
38955 }
38960 }
38962 /* Finish the declaration of a fully implicit function template. Such a
38963 template has no explicit template parameter list so has not been through the
38964 normal template head and tail processing. synthesize_implicit_template_parm
38965 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38966 provided if the declaration is a class member such that its template
38967 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38968 form is returned. Otherwise NULL_TREE is returned. */
38970 static tree
38972 {
38977 {
38981 }
38991 }
38993 /* Helper function for diagnostics that have complained about things
38994 being used with 'extern "C"' linkage.
38996 Attempt to issue a note showing where the 'extern "C"' linkage began. */
38998 void
39000 {
39004 }