| blob | 222db0cad3fa33e75764675e908be43be9d2f841 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2268 /* Classes [gram.class] */
2270 static tree cp_parser_class_name
2272 static tree cp_parser_class_specifier
2274 static tree cp_parser_class_head
2276 static enum tag_types cp_parser_class_key
2278 static void cp_parser_type_parameter_key
2280 static void cp_parser_member_specification_opt
2282 static void cp_parser_member_declaration
2284 static tree cp_parser_pure_specifier
2286 static tree cp_parser_constant_initializer
2289 /* Derived classes [gram.class.derived] */
2291 static tree cp_parser_base_clause
2293 static tree cp_parser_base_specifier
2296 /* Special member functions [gram.special] */
2298 static tree cp_parser_conversion_function_id
2300 static tree cp_parser_conversion_type_id
2304 static void cp_parser_ctor_initializer_opt
2306 static void cp_parser_mem_initializer_list
2308 static tree cp_parser_mem_initializer
2310 static tree cp_parser_mem_initializer_id
2313 /* Overloading [gram.over] */
2315 static cp_expr cp_parser_operator_function_id
2317 static cp_expr cp_parser_operator
2320 /* Templates [gram.temp] */
2322 static void cp_parser_template_declaration
2324 static tree cp_parser_template_parameter_list
2326 static tree cp_parser_template_parameter
2328 static tree cp_parser_type_parameter
2330 static tree cp_parser_template_id
2332 static tree cp_parser_template_name
2334 static tree cp_parser_template_argument_list
2336 static tree cp_parser_template_argument
2338 static void cp_parser_explicit_instantiation
2340 static void cp_parser_explicit_specialization
2343 /* Exception handling [gram.exception] */
2345 static tree cp_parser_try_block
2347 static void cp_parser_function_try_block
2349 static void cp_parser_handler_seq
2351 static void cp_parser_handler
2353 static tree cp_parser_exception_declaration
2355 static tree cp_parser_throw_expression
2357 static tree cp_parser_exception_specification_opt
2359 static tree cp_parser_type_id_list
2362 /* GNU Extensions */
2364 static tree cp_parser_asm_specification_opt
2366 static tree cp_parser_asm_operand_list
2368 static tree cp_parser_asm_clobber_list
2370 static tree cp_parser_asm_label_list
2372 static bool cp_next_tokens_can_be_attribute_p
2374 static bool cp_next_tokens_can_be_gnu_attribute_p
2376 static bool cp_next_tokens_can_be_std_attribute_p
2378 static bool cp_nth_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_gnu_attribute_p
2382 static bool cp_nth_tokens_can_be_attribute_p
2384 static tree cp_parser_attributes_opt
2386 static tree cp_parser_gnu_attributes_opt
2388 static tree cp_parser_gnu_attribute_list
2390 static tree cp_parser_std_attribute
2392 static tree cp_parser_std_attribute_spec
2394 static tree cp_parser_std_attribute_spec_seq
2396 static bool cp_parser_extension_opt
2398 static void cp_parser_label_declaration
2401 /* Concept Extensions */
2403 static tree cp_parser_requires_clause
2405 static tree cp_parser_requires_clause_opt
2407 static tree cp_parser_requires_expression
2409 static tree cp_parser_requirement_parameter_list
2411 static tree cp_parser_requirement_body
2413 static tree cp_parser_requirement_list
2415 static tree cp_parser_requirement
2417 static tree cp_parser_simple_requirement
2419 static tree cp_parser_compound_requirement
2421 static tree cp_parser_type_requirement
2423 static tree cp_parser_nested_requirement
2426 /* Transactional Memory Extensions */
2428 static tree cp_parser_transaction
2430 static tree cp_parser_transaction_expression
2432 static void cp_parser_function_transaction
2434 static tree cp_parser_transaction_cancel
2438 pragma_external,
2439 pragma_member,
2440 pragma_objc_icode,
2441 pragma_stmt,
2442 pragma_compound
2443 };
2444 static bool cp_parser_pragma
2447 /* Objective-C++ Productions */
2449 static tree cp_parser_objc_message_receiver
2451 static tree cp_parser_objc_message_args
2453 static tree cp_parser_objc_message_expression
2455 static cp_expr cp_parser_objc_encode_expression
2457 static tree cp_parser_objc_defs_expression
2459 static tree cp_parser_objc_protocol_expression
2461 static tree cp_parser_objc_selector_expression
2463 static cp_expr cp_parser_objc_expression
2465 static bool cp_parser_objc_selector_p
2467 static tree cp_parser_objc_selector
2469 static tree cp_parser_objc_protocol_refs_opt
2471 static void cp_parser_objc_declaration
2473 static tree cp_parser_objc_statement
2475 static bool cp_parser_objc_valid_prefix_attributes
2477 static void cp_parser_objc_at_property_declaration
2479 static void cp_parser_objc_at_synthesize_declaration
2481 static void cp_parser_objc_at_dynamic_declaration
2483 static tree cp_parser_objc_struct_declaration
2486 /* Utility Routines */
2488 static cp_expr cp_parser_lookup_name
2490 static tree cp_parser_lookup_name_simple
2492 static tree cp_parser_maybe_treat_template_as_class
2494 static bool cp_parser_check_declarator_template_parameters
2496 static bool cp_parser_check_template_parameters
2498 static cp_expr cp_parser_simple_cast_expression
2500 static tree cp_parser_global_scope_opt
2502 static bool cp_parser_constructor_declarator_p
2504 static tree cp_parser_function_definition_from_specifiers_and_declarator
2506 static tree cp_parser_function_definition_after_declarator
2508 static bool cp_parser_template_declaration_after_export
2510 static void cp_parser_perform_template_parameter_access_checks
2512 static tree cp_parser_single_declaration
2514 static cp_expr cp_parser_functional_cast
2516 static tree cp_parser_save_member_function_body
2518 static tree cp_parser_save_nsdmi
2520 static tree cp_parser_enclosed_template_argument_list
2522 static void cp_parser_save_default_args
2524 static void cp_parser_late_parsing_for_member
2526 static tree cp_parser_late_parse_one_default_arg
2528 static void cp_parser_late_parsing_nsdmi
2530 static void cp_parser_late_parsing_default_args
2532 static tree cp_parser_sizeof_operand
2534 static cp_expr cp_parser_trait_expr
2536 static bool cp_parser_declares_only_class_p
2538 static void cp_parser_set_storage_class
2540 static void cp_parser_set_decl_spec_type
2542 static void set_and_check_decl_spec_loc
2545 static bool cp_parser_friend_p
2547 static void cp_parser_required_error
2553 static bool cp_parser_token_starts_function_definition_p
2555 static bool cp_parser_next_token_starts_class_definition_p
2557 static bool cp_parser_next_token_ends_template_argument_p
2559 static bool cp_parser_nth_token_starts_template_argument_list_p
2561 static enum tag_types cp_parser_token_is_class_key
2563 static enum tag_types cp_parser_token_is_type_parameter_key
2565 static void cp_parser_check_class_key
2567 static void cp_parser_check_access_in_redeclaration
2569 static bool cp_parser_optional_template_keyword
2571 static void cp_parser_pre_parsed_nested_name_specifier
2573 static bool cp_parser_cache_group
2575 static tree cp_parser_cache_defarg
2577 static void cp_parser_parse_tentatively
2579 static void cp_parser_commit_to_tentative_parse
2581 static void cp_parser_commit_to_topmost_tentative_parse
2583 static void cp_parser_abort_tentative_parse
2585 static bool cp_parser_parse_definitely
2589 static bool cp_parser_uncommitted_to_tentative_parse_p
2591 static void cp_parser_error
2593 static void cp_parser_name_lookup_error
2595 static bool cp_parser_simulate_error
2597 static bool cp_parser_check_type_definition
2599 static void cp_parser_check_for_definition_in_return_type
2601 static void cp_parser_check_for_invalid_template_id
2603 static bool cp_parser_non_integral_constant_expression
2605 static void cp_parser_diagnose_invalid_type_name
2607 static bool cp_parser_parse_and_diagnose_invalid_type_name
2609 static int cp_parser_skip_to_closing_parenthesis
2611 static void cp_parser_skip_to_end_of_statement
2613 static void cp_parser_consume_semicolon_at_end_of_statement
2615 static void cp_parser_skip_to_end_of_block_or_statement
2617 static bool cp_parser_skip_to_closing_brace
2619 static void cp_parser_skip_to_end_of_template_parameter_list
2621 static void cp_parser_skip_to_pragma_eol
2623 static bool cp_parser_error_occurred
2625 static bool cp_parser_allow_gnu_extensions_p
2627 static bool cp_parser_is_pure_string_literal
2629 static bool cp_parser_is_string_literal
2631 static bool cp_parser_is_keyword
2633 static tree cp_parser_make_typename_type
2637 static bool cp_parser_compound_literal_p
2639 static bool cp_parser_array_designator_p
2641 static bool cp_parser_init_statement_p
2643 static bool cp_parser_skip_to_closing_square_bracket
2646 /* Concept-related syntactic transformations */
2651 // -------------------------------------------------------------------------- //
2652 // Unevaluated Operand Guard
2653 //
2654 // Implementation of an RAII helper for unevaluated operand parsing.
2656 {
2659 }
2662 {
2665 }
2667 // -------------------------------------------------------------------------- //
2668 // Tentative Parsing
2670 /* Returns nonzero if we are parsing tentatively. */
2674 {
2676 }
2678 /* Returns nonzero if TOKEN is a string literal. */
2680 static bool
2682 {
2688 }
2690 /* Returns nonzero if TOKEN is a string literal
2691 of a user-defined string literal. */
2693 static bool
2695 {
2702 }
2704 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2706 static bool
2708 {
2710 }
2712 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2713 PRAGMA_NONE. */
2715 static enum pragma_kind
2717 {
2720 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2722 }
2724 /* Helper function for cp_parser_error.
2725 Having peeked a token of kind TOK1_KIND that might signify
2726 a conflict marker, peek successor tokens to determine
2727 if we actually do have a conflict marker.
2728 Specifically, we consider a run of 7 '<', '=' or '>' characters
2729 at the start of a line as a conflict marker.
2730 These come through the lexer as three pairs and a single,
2731 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2732 If it returns true, *OUT_LOC is written to with the location/range
2733 of the marker. */
2735 static bool
2738 {
2749 /* It must be at the start of the line. */
2754 /* We have a conflict marker. Construct a location of the form:
2755 <<<<<<<
2756 ^~~~~~~
2757 with start == caret, finishing at the end of the marker. */
2762 }
2764 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2765 RT_CLOSE_PAREN. */
2769 {
2771 {
2779 }
2780 }
2782 /* Attempt to convert TOKEN_DESC from a required_token to an
2783 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2785 static enum cpp_ttype
2787 {
2789 {
2810 /* Use CPP_EOF as a "no completions possible" code. */
2812 }
2813 }
2816 /* Subroutine of cp_parser_error and cp_parser_required_error.
2818 Issue a diagnostic of the form
2819 FILE:LINE: MESSAGE before TOKEN
2820 where TOKEN is the next token in the input stream. MESSAGE
2821 (specified by the caller) is usually of the form "expected
2822 OTHER-TOKEN".
2824 This bypasses the check for tentative passing, and potentially
2825 adds material needed by cp_parser_required_error.
2827 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2828 suggesting insertion of the missing token.
2830 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2831 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2832 location. */
2834 static void
2836 required_token missing_token_desc,
2837 location_t matching_location)
2838 {
2840 /* This diagnostic makes more sense if it is tagged to the line
2841 of the token we just peeked at. */
2845 {
2850 }
2852 /* If this is actually a conflict marker, report it as such. */
2856 {
2857 location_t loc;
2859 {
2862 }
2863 }
2870 {
2871 /* Potentially supply a fix-it hint, suggesting to add the
2872 missing token immediately after the *previous* token.
2873 This may move the primary location within richloc. */
2875 location_t prev_token_loc
2879 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2880 Attempt to consolidate diagnostics by printing it as a
2881 secondary range within the main diagnostic. */
2883 added_matching_location
2885 }
2887 /* Actually emit the error. */
2889 /* Because c_parser_error does not understand
2890 CPP_KEYWORD, keywords are treated like
2891 identifiers. */
2896 {
2897 /* If we weren't able to consolidate matching_location, then
2898 print it as a secondary diagnostic. */
2903 }
2904 }
2906 /* If not parsing tentatively, issue a diagnostic of the form
2907 FILE:LINE: MESSAGE before TOKEN
2908 where TOKEN is the next token in the input stream. MESSAGE
2909 (specified by the caller) is usually of the form "expected
2910 OTHER-TOKEN". */
2912 static void
2914 {
2917 }
2919 /* Issue an error about name-lookup failing. NAME is the
2920 IDENTIFIER_NODE DECL is the result of
2921 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2922 the thing that we hoped to find. */
2924 static void
2926 tree name,
2927 tree decl,
2928 name_lookup_error desired,
2929 location_t location)
2930 {
2931 /* If name lookup completely failed, tell the user that NAME was not
2932 declared. */
2934 {
2947 else
2949 }
2951 {
2953 {
2970 }
2971 }
2973 {
2975 {
2985 name);
2989 }
2990 }
2991 else
2992 {
2994 {
3007 }
3008 }
3009 }
3011 /* If we are parsing tentatively, remember that an error has occurred
3012 during this tentative parse. Returns true if the error was
3013 simulated; false if a message should be issued by the caller. */
3015 static bool
3017 {
3019 {
3022 }
3024 }
3026 /* This function is called when a type is defined. If type
3027 definitions are forbidden at this point, an error message is
3028 issued. */
3030 static bool
3032 {
3033 /* If types are forbidden here, issue a message. */
3035 {
3036 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3037 in the message need to be interpreted. */
3040 }
3042 }
3044 /* This function is called when the DECLARATOR is processed. The TYPE
3045 was a type defined in the decl-specifiers. If it is invalid to
3046 define a type in the decl-specifiers for DECLARATOR, an error is
3047 issued. TYPE_LOCATION is the location of TYPE and is used
3048 for error reporting. */
3050 static void
3053 {
3054 /* [dcl.fct] forbids type definitions in return types.
3055 Unfortunately, it's not easy to know whether or not we are
3056 processing a return type until after the fact. */
3064 {
3069 type);
3070 }
3071 }
3073 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3074 "<" in any valid C++ program. If the next token is indeed "<",
3075 issue a message warning the user about what appears to be an
3076 invalid attempt to form a template-id. LOCATION is the location
3077 of the type-specifier (TYPE) */
3079 static void
3081 tree type,
3083 location_t location)
3084 {
3088 {
3094 {
3097 else
3099 }
3100 else
3102 /* Remember the location of the invalid "<". */
3105 /* Consume the "<". */
3107 /* Parse the template arguments. */
3109 /* Permanently remove the invalid template arguments so that
3110 this error message is not issued again. */
3113 }
3114 }
3116 /* If parsing an integral constant-expression, issue an error message
3117 about the fact that THING appeared and return true. Otherwise,
3118 return false. In either case, set
3119 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3121 static bool
3123 non_integral_constant thing)
3124 {
3127 {
3129 {
3132 {
3135 "ISO C++ forbids using a floating-point literal "
3140 "enumeration type cannot appear in a "
3231 }
3235 }
3236 }
3238 }
3240 /* Emit a diagnostic for an invalid type name. This function commits
3241 to the current active tentative parse, if any. (Otherwise, the
3242 problematic construct might be encountered again later, resulting
3243 in duplicate error messages.) LOCATION is the location of ID. */
3245 static void
3247 location_t location)
3248 {
3251 /* Try to lookup the identifier. */
3258 /* If the lookup was ambiguous, an error will already have
3259 been issued. */
3261 /* If the lookup found a template-name, it means that the user forgot
3262 to specify an argument list. Emit a useful error message. */
3264 {
3267 decl);
3272 }
3276 /* Something like 'unsigned A a;' */
3279 {
3280 /* Issue an error message. */
3281 name_hint hint;
3285 {
3291 }
3292 else
3294 /* If we're in a template class, it's possible that the user was
3295 referring to a type from a base class. For example:
3297 template <typename T> struct A { typedef T X; };
3298 template <typename T> struct B : public A<T> { X x; };
3300 The user should have said "typename A<T>::X". */
3316 {
3317 tree b;
3320 b;
3322 {
3326 {
3327 tree field;
3328 /* Go from a particular instantiation of the
3329 template (which will have an empty TYPE_FIELDs),
3330 to the main version. */
3333 field;
3337 {
3342 }
3345 }
3346 }
3347 }
3348 }
3349 /* Here we diagnose qualified-ids where the scope is actually correct,
3350 but the identifier does not resolve to a valid type name. */
3352 {
3354 {
3363 else
3372 }
3375 {
3376 /* A<T>::A<T>() */
3382 }
3385 {
3388 "need %<typename%> before %<%T::%D::%E%> because "
3392 id,
3395 else
3399 }
3401 {
3413 else
3419 }
3420 else
3422 }
3423 }
3425 /* Check for a common situation where a type-name should be present,
3426 but is not, and issue a sensible error message. Returns true if an
3427 invalid type-name was detected.
3429 The situation handled by this function are variable declarations of the
3430 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3431 Usually, `ID' should name a type, but if we got here it means that it
3432 does not. We try to emit the best possible error message depending on
3433 how exactly the id-expression looks like. */
3435 static bool
3437 {
3438 tree id;
3441 /* Avoid duplicate error about ambiguous lookup. */
3443 {
3447 }
3456 /* If the next token is a (, this is a function with no explicit return
3457 type, i.e. constructor, destructor or conversion op. */
3460 {
3463 }
3467 /* Emit a diagnostic for the invalid type. */
3469 out:
3470 /* If we aren't in the middle of a declarator (i.e. in a
3471 parameter-declaration-clause), skip to the end of the declaration;
3472 there's no point in trying to process it. */
3476 }
3478 /* Consume tokens up to, and including, the next non-nested closing `)'.
3479 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3480 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3481 found an unnested token of that type. */
3483 static int
3486 cpp_ttype or_ttype,
3488 {
3498 {
3501 /* Have we found what we're looking for before the closing paren? */
3507 {
3510 /* If we've run out of tokens, then there is no closing `)'. */
3513 /* This is good for lambda expression capture-lists. */
3523 /* This matches the processing in skip_to_end_of_statement. */
3543 {
3547 }
3552 }
3554 /* Consume the token. */
3556 }
3557 }
3559 /* Consume tokens up to, and including, the next non-nested closing `)'.
3560 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3561 are doing error recovery. Returns -1 if OR_COMMA is true and we
3562 found an unnested token of that type. */
3564 static int
3569 {
3573 }
3575 /* Consume tokens until we reach the end of the current statement.
3576 Normally, that will be just before consuming a `;'. However, if a
3577 non-nested `}' comes first, then we stop before consuming that. */
3579 static void
3581 {
3584 /* Unwind generic function template scope if necessary. */
3589 {
3593 {
3596 /* If we've run out of tokens, stop. */
3600 /* If the next token is a `;', we have reached the end of the
3601 statement. */
3607 /* If this is a non-nested '}', stop before consuming it.
3608 That way, when confronted with something like:
3610 { 3 + }
3612 we stop before consuming the closing '}', even though we
3613 have not yet reached a `;'. */
3617 /* If it is the closing '}' for a block that we have
3618 scanned, stop -- but only after consuming the token.
3619 That way given:
3621 void f g () { ... }
3622 typedef int I;
3624 we will stop after the body of the erroneously declared
3625 function, but before consuming the following `typedef'
3626 declaration. */
3628 {
3631 }
3640 }
3642 /* Consume the token. */
3644 }
3645 }
3647 /* This function is called at the end of a statement or declaration.
3648 If the next token is a semicolon, it is consumed; otherwise, error
3649 recovery is attempted. */
3651 static void
3653 {
3654 /* Look for the trailing `;'. */
3656 {
3657 /* If there is additional (erroneous) input, skip to the end of
3658 the statement. */
3660 /* If the next token is now a `;', consume it. */
3663 }
3664 }
3666 /* Skip tokens until we have consumed an entire block, or until we
3667 have consumed a non-nested `;'. */
3669 static void
3671 {
3674 /* Unwind generic function template scope if necessary. */
3679 {
3683 {
3686 /* If we've run out of tokens, stop. */
3690 /* Stop if this is an unnested ';'. */
3696 /* Stop if this is an unnested '}', or closes the outermost
3697 nesting level. */
3698 nesting_depth--;
3706 /* Nest. */
3707 nesting_depth++;
3712 }
3714 /* Consume the token. */
3716 }
3717 }
3719 /* Skip tokens until a non-nested closing curly brace is the next
3720 token, or there are no more tokens. Return true in the first case,
3721 false otherwise. */
3723 static bool
3725 {
3729 {
3733 {
3736 /* If we've run out of tokens, stop. */
3740 /* If the next token is a non-nested `}', then we have reached
3741 the end of the current block. */
3747 /* If it the next token is a `{', then we are entering a new
3748 block. Consume the entire block. */
3754 }
3756 /* Consume the token. */
3758 }
3759 }
3761 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3762 parameter is the PRAGMA token, allowing us to purge the entire pragma
3763 sequence. */
3765 static void
3767 {
3772 do
3776 /* Ensure that the pragma is not parsed again. */
3778 }
3780 /* Require pragma end of line, resyncing with it as necessary. The
3781 arguments are as for cp_parser_skip_to_pragma_eol. */
3783 static void
3785 {
3789 }
3791 /* This is a simple wrapper around make_typename_type. When the id is
3792 an unresolved identifier node, we can provide a superior diagnostic
3793 using cp_parser_diagnose_invalid_type_name. */
3795 static tree
3797 location_t id_location)
3798 {
3799 tree result;
3801 {
3807 }
3809 }
3811 /* This is a wrapper around the
3812 make_{pointer,ptrmem,reference}_declarator functions that decides
3813 which one to call based on the CODE and CLASS_TYPE arguments. The
3814 CODE argument should be one of the values returned by
3815 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3816 appertain to the pointer or reference. */
3820 cp_cv_quals cv_qualifiers,
3822 tree attributes)
3823 {
3830 else
3840 }
3842 /* Create a new C++ parser. */
3846 {
3851 /* cp_lexer_new_main is called before doing GC allocation because
3852 cp_lexer_new_main might load a PCH file. */
3855 /* Initialize the binops_by_token so that we can get the tree
3856 directly from the token. */
3864 /* For now, we always accept GNU extensions. */
3867 /* The `>' token is a greater-than operator, not the end of a
3868 template-id. */
3873 /* We are not parsing a constant-expression. */
3878 /* Local variable names are not forbidden. */
3881 /* We are not processing an `extern "C"' declaration. */
3884 /* We are not processing a declarator. */
3887 /* We are not processing a template-argument-list. */
3890 /* We are not in an iteration statement. */
3893 /* We are not in a switch statement. */
3896 /* We are not parsing a type-id inside an expression. */
3899 /* Declarations aren't implicitly extern "C". */
3902 /* String literals should be translated to the execution character set. */
3905 /* We are not parsing a function body. */
3908 /* We can correct until told otherwise. */
3911 /* The unparsed function queue is empty. */
3914 /* There are no classes being defined. */
3917 /* No template parameters apply. */
3920 /* Special parsing data structures. */
3924 /* Not declaring an implicit function template. */
3930 /* Allow constrained-type-specifiers. */
3933 /* We haven't yet seen an 'extern "C"'. */
3937 }
3939 /* Create a cp_lexer structure which will emit the tokens in CACHE
3940 and push it onto the parser's lexer stack. This is used for delayed
3941 parsing of in-class method bodies and default arguments, and should
3942 not be confused with tentative parsing. */
3943 static void
3945 {
3950 /* Move the current source position to that of the first token in the
3951 new lexer. */
3953 }
3955 /* Pop the top lexer off the parser stack. This is never used for the
3956 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3957 static void
3959 {
3964 /* Put the current source position back where it was before this
3965 lexer was pushed. */
3967 }
3969 /* Lexical conventions [gram.lex] */
3971 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3972 identifier. */
3974 static cp_expr
3976 {
3979 /* Look for the identifier. */
3981 /* Return the value. */
3984 else
3986 }
3988 /* Parse a sequence of adjacent string constants. Returns a
3989 TREE_STRING representing the combined, nul-terminated string
3990 constant. If TRANSLATE is true, translate the string to the
3991 execution character set. If WIDE_OK is true, a wide string is
3992 invalid here.
3994 C++98 [lex.string] says that if a narrow string literal token is
3995 adjacent to a wide string literal token, the behavior is undefined.
3996 However, C99 6.4.5p4 says that this results in a wide string literal.
3997 We follow C99 here, for consistency with the C front end.
3999 This code is largely lifted from lex_string() in c-lex.c.
4001 FUTURE: ObjC++ will need to handle @-strings here. */
4002 static cp_expr
4005 {
4006 tree value;
4013 tree string_tree;
4019 {
4022 }
4027 {
4031 }
4032 else
4033 {
4036 }
4039 /* Try to avoid the overhead of creating and destroying an obstack
4040 for the common case of just one string. */
4043 {
4051 {
4055 }
4056 else
4060 }
4061 else
4062 {
4067 do
4068 {
4070 count++;
4075 {
4078 {
4081 }
4084 {
4089 }
4091 }
4092 else
4096 {
4100 {
4104 "unsupported non-standard concatenation "
4106 }
4107 }
4115 {
4119 }
4120 else
4121 {
4125 }
4126 }
4129 /* A string literal built by concatenation has its caret=start at
4130 the start of the initial string, and its finish at the finish of
4131 the final string literal. */
4135 }
4138 {
4141 }
4145 {
4150 {
4165 }
4170 {
4175 else
4177 }
4178 }
4179 else
4180 /* cpp_interpret_string has issued an error. */
4187 }
4189 /* Look up a literal operator with the name and the exact arguments. */
4191 static tree
4193 {
4194 tree decl;
4200 {
4206 {
4209 {
4219 }
4222 /* May be this should be sufficient_parms_p instead,
4223 depending on how exactly should user-defined literals
4224 work in presence of default arguments on the literal
4225 operator parameters. */
4228 }
4229 }
4232 }
4234 /* Parse a user-defined char constant. Returns a call to a user-defined
4235 literal operator taking the character as an argument. */
4237 static cp_expr
4239 {
4247 /* Build up a call to the user-defined operator */
4248 /* Lookup the name we got back from the id-expression. */
4253 {
4258 }
4262 }
4264 /* A subroutine of cp_parser_userdef_numeric_literal to
4265 create a char... template parameter pack from a string node. */
4267 static tree
4269 {
4270 tree charvec;
4276 /* Fill in CHARVEC with all of the parameters. */
4281 /* Build the argument packs. */
4287 }
4289 /* A subroutine of cp_parser_userdef_numeric_literal to
4290 create a char... template parameter pack from a string node. */
4292 static tree
4294 {
4295 tree charvec;
4306 /* First template parm is character type. */
4309 /* Fill in CHARVEC with all of the parameters. */
4316 /* Build the argument packs. */
4322 }
4324 /* Parse a user-defined numeric constant. returns a call to a user-defined
4325 literal operator. */
4327 static cp_expr
4329 {
4340 /* Look for a literal operator taking the exact type of numeric argument
4341 as the literal value. */
4346 {
4348 tf_warning_or_error);
4351 {
4354 long_long_unsigned_type_node);
4355 }
4356 else
4357 {
4361 long_double_type_node);
4365 }
4369 }
4372 /* If the numeric argument didn't work, look for a raw literal
4373 operator taking a const char* argument consisting of the number
4374 in string format. */
4379 {
4381 tf_warning_or_error);
4384 }
4387 /* If the raw literal didn't work, look for a non-type template
4388 function with parameter pack char.... Call the function with
4389 template parameter characters representing the number. */
4393 {
4397 tf_warning_or_error);
4400 }
4404 /* In C++14 the standard library defines complex number suffixes that
4405 conflict with GNU extensions. Prefer them if <complex> is #included. */
4415 {
4420 {
4421 /* No <complex>, so pedwarn and use GNU semantics. */
4424 }
4425 }
4427 bool complained
4434 {
4436 "(from <complex>) to enable the C++14 user-defined literal "
4441 }
4448 else
4449 {
4450 /* Use the built-in semantics. */
4451 tree type;
4453 {
4456 else
4458 }
4467 }
4470 /* Avoid repeated diagnostics. */
4473 }
4475 /* Parse a user-defined string constant. Returns a call to a user-defined
4476 literal operator taking a character pointer and the length of the string
4477 as arguments. */
4479 static tree
4481 {
4490 /* Build up a call to the user-defined operator. */
4491 /* Lookup the name we got back from the id-expression. */
4498 {
4500 tf_warning_or_error);
4503 }
4506 /* Look for a template function with typename parameter CharT
4507 and parameter pack CharT... Call the function with
4508 template parameter characters representing the string. */
4512 {
4516 tf_warning_or_error);
4519 }
4525 }
4528 /* Basic concepts [gram.basic] */
4530 /* Parse a translation-unit.
4532 translation-unit:
4533 declaration-seq [opt]
4535 Returns TRUE if all went well. */
4537 static bool
4539 {
4540 /* The address of the first non-permanent object on the declarator
4541 obstack. */
4546 /* Create the declarator obstack, if necessary. */
4548 {
4550 /* Create the error declarator. */
4552 /* Create the empty parameter list. */
4554 UNKNOWN_LOCATION);
4555 /* Remember where the base of the declarator obstack lies. */
4557 }
4561 /* If there are no tokens left then all went well. */
4563 {
4564 /* Get rid of the token array; we don't need it any more. */
4568 /* This file might have been a context that's implicitly extern
4569 "C". If so, pop the lang context. (Only relevant for PCH.) */
4571 {
4574 }
4576 /* Finish up. */
4580 }
4581 else
4582 {
4585 }
4587 /* Make sure the declarator obstack was fully cleaned up. */
4591 /* All went well. */
4593 }
4595 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4596 decltype context. */
4600 {
4605 }
4607 /* We're about to parse a collection of statements. If we're currently
4608 parsing tentatively, set up a firewall so that any nested
4609 cp_parser_commit_to_tentative_parse won't affect the current context. */
4611 static cp_token_position
4613 {
4620 }
4622 /* We've finished parsing the collection of statements. Wrap up the
4623 firewall and replace the relevant tokens with the parsed form. */
4625 static void
4627 tree expr)
4628 {
4632 /* Finish the firewall level. */
4634 /* And remember the result of the parse for when we try again. */
4640 }
4642 /* Like the above functions, but let the user modify the tokens. Used by
4643 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4644 later parses, so it makes sense to localize the effects of
4645 cp_parser_commit_to_tentative_parse. */
4647 struct tentative_firewall
4648 {
4653 {
4654 /* If we're currently parsing tentatively, start a committed level as a
4655 firewall and then an inner tentative parse. */
4657 {
4661 }
4662 }
4665 {
4667 {
4668 /* Finish the inner tentative parse and the firewall, propagating any
4669 uncommitted error state to the outer tentative parse. */
4675 }
4676 }
4677 };
4679 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4680 This class is for tracking such a matching pair of symbols.
4681 In particular, it tracks the location of the first token,
4682 so that if the second token is missing, we can highlight the
4683 location of the first token when notifying the user about the
4684 problem. */
4687 class token_pair
4688 {
4690 /* token_pair's ctor. */
4693 /* If the next token is the opening symbol for this pair, consume it and
4694 return true.
4695 Otherwise, issue an error and return false.
4696 In either case, record the location of the opening token. */
4699 {
4703 }
4705 /* Consume the next token from PARSER, recording its location as
4706 that of the opening token within the pair. */
4709 {
4714 }
4716 /* If the next token is the closing symbol for this pair, consume it
4717 and return it.
4718 Otherwise, issue an error, highlighting the location of the
4719 corresponding opening token, and return NULL. */
4722 {
4725 m_open_loc);
4726 }
4729 location_t m_open_loc;
4730 };
4732 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4734 struct matching_paren_traits
4735 {
4740 };
4742 /* "matching_parens" is a token_pair<T> class for tracking matching
4743 pairs of parentheses. */
4747 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4749 struct matching_brace_traits
4750 {
4755 };
4757 /* "matching_braces" is a token_pair<T> class for tracking matching
4758 pairs of braces. */
4763 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4764 enclosing parentheses. */
4766 static cp_expr
4768 {
4771 /* Consume the '('. */
4773 matching_parens parens;
4775 /* Start the statement-expression. */
4777 /* Parse the compound-statement. */
4779 /* Finish up. */
4781 /* Consume the ')'. */
4789 }
4791 /* Expressions [gram.expr] */
4793 /* Parse a fold-operator.
4795 fold-operator:
4796 - * / % ^ & | = < > << >>
4797 = -= *= /= %= ^= &= |= <<= >>=
4798 == != <= >= && || , .* ->*
4800 This returns the tree code corresponding to the matched operator
4801 as an int. When the current token matches a compound assignment
4802 opertor, the resulting tree code is the negative value of the
4803 non-assignment operator. */
4805 static int
4807 {
4809 {
4849 }
4850 }
4852 /* Returns true if CODE indicates a binary expression, which is not allowed in
4853 the LHS of a fold-expression. More codes will need to be added to use this
4854 function in other contexts. */
4856 static bool
4858 {
4860 {
4893 }
4894 }
4896 /* If the next token is a suitable fold operator, consume it and return as
4897 the function above. */
4899 static int
4901 {
4907 }
4909 /* Parse a fold-expression.
4911 fold-expression:
4912 ( ... folding-operator cast-expression)
4913 ( cast-expression folding-operator ... )
4914 ( cast-expression folding operator ... folding-operator cast-expression)
4916 Note that the '(' and ')' are matched in primary expression. */
4918 static cp_expr
4920 {
4921 cp_id_kind pidk;
4923 // Left fold.
4925 {
4929 {
4932 }
4939 }
4944 {
4947 }
4950 {
4953 }
4956 /* The operands of a fold-expression are cast-expressions, so binary or
4957 conditional expressions are not allowed. We check this here to avoid
4958 tentative parsing. */
4968 // Right fold.
4973 {
4976 }
4979 // Binary left or right fold.
4984 }
4986 /* Parse a primary-expression.
4988 primary-expression:
4989 literal
4990 this
4991 ( expression )
4992 id-expression
4993 lambda-expression (C++11)
4995 GNU Extensions:
4997 primary-expression:
4998 ( compound-statement )
4999 __builtin_va_arg ( assignment-expression , type-id )
5000 __builtin_offsetof ( type-id , offsetof-expression )
5002 C++ Extensions:
5003 __has_nothrow_assign ( type-id )
5004 __has_nothrow_constructor ( type-id )
5005 __has_nothrow_copy ( type-id )
5006 __has_trivial_assign ( type-id )
5007 __has_trivial_constructor ( type-id )
5008 __has_trivial_copy ( type-id )
5009 __has_trivial_destructor ( type-id )
5010 __has_virtual_destructor ( type-id )
5011 __is_abstract ( type-id )
5012 __is_base_of ( type-id , type-id )
5013 __is_class ( type-id )
5014 __is_empty ( type-id )
5015 __is_enum ( type-id )
5016 __is_final ( type-id )
5017 __is_literal_type ( type-id )
5018 __is_pod ( type-id )
5019 __is_polymorphic ( type-id )
5020 __is_std_layout ( type-id )
5021 __is_trivial ( type-id )
5022 __is_union ( type-id )
5024 Objective-C++ Extension:
5026 primary-expression:
5027 objc-expression
5029 literal:
5030 __null
5032 ADDRESS_P is true iff this expression was immediately preceded by
5033 "&" and therefore might denote a pointer-to-member. CAST_P is true
5034 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5035 true iff this expression is a template argument.
5037 Returns a representation of the expression. Upon return, *IDK
5038 indicates what kind of id-expression (if any) was present. */
5040 static cp_expr
5047 {
5050 /* Assume the primary expression is not an id-expression. */
5053 /* Peek at the next token. */
5056 {
5057 /* literal:
5058 integer-literal
5059 character-literal
5060 floating-literal
5061 string-literal
5062 boolean-literal
5063 pointer-literal
5064 user-defined-literal */
5076 {
5080 }
5081 /* Floating-point literals are only allowed in an integral
5082 constant expression if they are cast to an integral or
5083 enumeration type. */
5087 {
5088 /* CAST_P will be set even in invalid code like "int(2.7 +
5089 ...)". Therefore, we have to check that the next token
5090 is sure to end the cast. */
5092 {
5097 enumerator-definition. */
5099 /* The curly brace at the end of an enum-specifier. */
5101 /* The end of a statement. */
5103 /* The end of the cast-expression. */
5105 /* The end of an array bound. */
5107 /* The closing ">" in a template-argument-list. */
5110 /* C++0x only: A ">>" treated like two ">" tokens,
5111 in a template-argument-list. */
5116 }
5118 /* If we are within a cast, then the constraint that the
5119 cast is to an integral or enumeration type will be
5120 checked at that point. If we are not within a cast, then
5121 this code is invalid. */
5124 }
5144 /* ??? Should wide strings be allowed when parser->translate_strings_p
5145 is false (i.e. in attributes)? If not, we can kill the third
5146 argument to cp_parser_string_literal. */
5152 /* If we see `( { ' then we are looking at the beginning of
5153 a GNU statement-expression. */
5156 {
5157 /* Statement-expressions are not allowed by the standard. */
5161 /* And they're not allowed outside of a function-body; you
5162 cannot, for example, write:
5164 int i = ({ int j = 3; j + 1; });
5166 at class or namespace scope. */
5169 {
5171 "statement-expressions are not allowed outside "
5177 }
5178 else
5180 }
5181 /* Otherwise it's a normal parenthesized expression. */
5182 {
5183 cp_expr expr;
5188 /* Consume the `('. */
5189 matching_parens parens;
5191 /* Within a parenthesized expression, a `>' token is always
5192 the greater-than operator. */
5193 saved_greater_than_is_operator_p
5198 /* Left fold expression. */
5200 else
5201 /* Parse the parenthesized expression. */
5206 {
5213 }
5214 else
5215 /* Let the front end know that this expression was
5216 enclosed in parentheses. This matters in case, for
5217 example, the expression is of the form `A::B', since
5218 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5219 not. */
5222 /* DR 705: Wrapping an unqualified name in parentheses
5223 suppresses arg-dependent lookup. We want to pass back
5224 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5225 (c++/37862), but none of the others. */
5229 /* The `>' token might be the end of a template-id or
5230 template-parameter-list now. */
5231 parser->greater_than_is_operator_p
5234 /* Consume the `)'. */
5243 }
5246 {
5248 {
5249 /* We might have an Objective-C++ message. */
5252 /* If that works out, we're done ... */
5255 /* ... else, fall though to see if it's a lambda. */
5256 }
5258 /* Don't warn about a failed tentative parse. */
5263 }
5267 /* We have an Objective-C++ string literal. */
5274 {
5275 /* These two are the boolean literals. */
5283 /* The `__null' literal. */
5288 /* The `nullptr' literal. */
5293 /* Recognize the `this' keyword. */
5297 {
5301 }
5302 /* Pointers cannot appear in constant-expressions. */
5307 /* The `operator' keyword can be the beginning of an
5308 id-expression. */
5315 {
5316 non_integral_constant name;
5318 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5319 __func__ are the names of variables -- but they are
5320 treated specially. Therefore, they are handled here,
5321 rather than relying on the generic id-expression logic
5322 below. Grammatically, these names are id-expressions.
5324 Consume the token. */
5328 {
5340 }
5345 /* Look up the name. */
5347 }
5350 {
5351 tree expression;
5352 tree type;
5353 source_location type_location;
5354 location_t start_loc
5356 /* The `__builtin_va_arg' construct is used to handle
5357 `va_arg'. Consume the `__builtin_va_arg' token. */
5359 /* Look for the opening `('. */
5360 matching_parens parens;
5362 /* Now, parse the assignment-expression. */
5364 /* Look for the `,'. */
5367 /* Parse the type-id. */
5368 {
5371 }
5372 /* Look for the closing `)'. */
5373 location_t finish_loc
5376 /* Using `va_arg' in a constant-expression is not
5377 allowed. */
5379 NIC_VA_ARG))
5381 /* Construct a location of the form:
5382 __builtin_va_arg (v, int)
5383 ~~~~~~~~~~~~~~~~~~~~~^~~~
5384 with the caret at the type, ranging from the start of the
5385 "__builtin_va_arg" token to the close paren. */
5386 location_t combined_loc
5389 }
5424 // C++ concepts
5428 /* Objective-C++ expressions. */
5438 {
5443 }
5444 /* FALLTHRU */
5448 }
5450 /* An id-expression can start with either an identifier, a
5451 `::' as the beginning of a qualified-id, or the "operator"
5452 keyword. */
5457 {
5458 id_expression:
5459 cp_expr id_expression;
5460 cp_expr decl;
5466 /* Parse the id-expression. */
5467 id_expression
5484 /* If we have a template-id, then no further lookup is
5485 required. If the template-id was for a template-class, we
5486 will sometimes have a TYPE_DECL at this point. */
5490 /* Look up the name. */
5491 else
5492 {
5493 tree ambiguous_decls;
5495 /* If we already know that this lookup is ambiguous, then
5496 we've already issued an error message; there's no reason
5497 to check again. */
5500 {
5503 }
5506 none_type,
5507 template_p,
5512 /* If the lookup was ambiguous, an error will already have
5513 been issued. */
5517 /* In Objective-C++, we may have an Objective-C 2.0
5518 dot-syntax for classes here. */
5523 {
5524 tree component;
5531 component);
5532 /* Build a location of the form:
5533 expr.component
5534 ~~~~~^~~~~~~~~
5535 with caret at the start of the component name (at
5536 input_location), ranging from the start of the id_expression
5537 to the end of the component name. */
5538 location_t combined_loc
5543 }
5545 /* In Objective-C++, an instance variable (ivar) may be preferred
5546 to whatever cp_parser_lookup_name() found.
5547 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5548 rest of c-family, we have to do a little extra work to preserve
5549 any location information in cp_expr "decl". Given that
5550 objc_lookup_ivar is implemented in "c-family" and "objc", we
5551 have a trip through the pure "tree" type, rather than cp_expr.
5552 Naively copying it back to "decl" would implicitly give the
5553 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5554 store an EXPR_LOCATION. Hence we only update "decl" (and
5555 hence its location_t) if we get back a different tree node. */
5557 id_expression);
5561 /* If name lookup gives us a SCOPE_REF, then the
5562 qualifying scope was dependent. */
5564 {
5565 /* At this point, we do not know if DECL is a valid
5566 integral constant expression. We assume that it is
5567 in fact such an expression, so that code like:
5569 template <int N> struct A {
5570 int a[B<N>::i];
5571 };
5573 is accepted. At template-instantiation time, we
5574 will check that B<N>::i is actually a constant. */
5576 }
5577 /* Check to see if DECL is a local variable in a context
5578 where that is forbidden. */
5581 {
5582 /* It might be that we only found DECL because we are
5583 trying to be generous with pre-ISO scoping rules.
5584 For example, consider:
5586 int i;
5587 void g() {
5588 for (int i = 0; i < 10; ++i) {}
5589 extern void f(int j = i);
5590 }
5592 Here, name look up will originally find the out
5593 of scope `i'. We need to issue a warning message,
5594 but then use the global `i'. */
5597 {
5602 }
5603 }
5604 }
5606 decl = (finish_id_expression
5608 idk,
5613 template_arg_p,
5620 }
5622 /* Anything else is an error. */
5626 }
5627 }
5635 {
5638 }
5640 /* Parse an id-expression.
5642 id-expression:
5643 unqualified-id
5644 qualified-id
5646 qualified-id:
5647 :: [opt] nested-name-specifier template [opt] unqualified-id
5648 :: identifier
5649 :: operator-function-id
5650 :: template-id
5652 Return a representation of the unqualified portion of the
5653 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5654 a `::' or nested-name-specifier.
5656 Often, if the id-expression was a qualified-id, the caller will
5657 want to make a SCOPE_REF to represent the qualified-id. This
5658 function does not do this in order to avoid wastefully creating
5659 SCOPE_REFs when they are not required.
5661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5662 `template' keyword.
5664 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5665 uninstantiated templates.
5667 If *TEMPLATE_P is non-NULL, it is set to true iff the
5668 `template' keyword is used to explicitly indicate that the entity
5669 named is a template.
5671 If DECLARATOR_P is true, the id-expression is appearing as part of
5672 a declarator, rather than as part of an expression. */
5674 static cp_expr
5681 {
5685 /* Assume the `template' keyword was not used. */
5689 /* Look for the optional `::' operator. */
5690 global_scope_p
5691 = (!template_keyword_p
5696 /* Look for the optional nested-name-specifier. */
5697 nested_name_specifier_p
5700 check_dependency_p,
5702 declarator_p,
5703 template_keyword_p)
5706 /* If there is a nested-name-specifier, then we are looking at
5707 the first qualified-id production. */
5709 {
5710 tree saved_scope;
5711 tree saved_object_scope;
5712 tree saved_qualifying_scope;
5713 cp_expr unqualified_id;
5716 /* See if the next token is the `template' keyword. */
5720 /* Name lookup we do during the processing of the
5721 unqualified-id might obliterate SCOPE. */
5725 /* Process the final unqualified-id. */
5727 check_dependency_p,
5728 declarator_p,
5730 /* Restore the SAVED_SCOPE for our caller. */
5736 }
5737 /* Otherwise, if we are in global scope, then we are looking at one
5738 of the other qualified-id productions. */
5740 {
5742 tree id;
5744 /* Peek at the next token. */
5747 /* If it's an identifier, and the next token is not a "<", then
5748 we can avoid the template-id case. This is an optimization
5749 for this common case. */
5751 && !cp_parser_nth_token_starts_template_argument_list_p
5756 /* Try a template-id. */
5760 none_type,
5761 declarator_p);
5762 /* If that worked, we're done. */
5766 /* Peek at the next token. (Changes in the token buffer may
5767 have invalidated the pointer obtained above.) */
5771 {
5778 /* Fall through. */
5783 }
5784 }
5785 else
5788 declarator_p,
5789 optional_p);
5790 }
5792 /* Parse an unqualified-id.
5794 unqualified-id:
5795 identifier
5796 operator-function-id
5797 conversion-function-id
5798 ~ class-name
5799 template-id
5801 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5802 keyword, in a construct like `A::template ...'.
5804 Returns a representation of unqualified-id. For the `identifier'
5805 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5806 production a BIT_NOT_EXPR is returned; the operand of the
5807 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5808 other productions, see the documentation accompanying the
5809 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5810 names are looked up in uninstantiated templates. If DECLARATOR_P
5811 is true, the unqualified-id is appearing as part of a declarator,
5812 rather than as part of an expression. */
5814 static cp_expr
5820 {
5823 /* Peek at the next token. */
5827 {
5829 {
5830 tree id;
5832 /* We don't know yet whether or not this will be a
5833 template-id. */
5835 /* Try a template-id. */
5837 check_dependency_p,
5838 none_type,
5839 declarator_p);
5840 /* If it worked, we're done. */
5843 /* Otherwise, it's an ordinary identifier. */
5845 }
5849 check_dependency_p,
5850 none_type,
5851 declarator_p);
5854 {
5855 tree type_decl;
5856 tree qualifying_scope;
5857 tree object_scope;
5858 tree scope;
5861 /* Consume the `~' token. */
5863 /* Parse the class-name. The standard, as written, seems to
5864 say that:
5866 template <typename T> struct S { ~S (); };
5867 template <typename T> S<T>::~S() {}
5869 is invalid, since `~' must be followed by a class-name, but
5870 `S<T>' is dependent, and so not known to be a class.
5871 That's not right; we need to look in uninstantiated
5872 templates. A further complication arises from:
5874 template <typename T> void f(T t) {
5875 t.T::~T();
5876 }
5878 Here, it is not possible to look up `T' in the scope of `T'
5879 itself. We must look in both the current scope, and the
5880 scope of the containing complete expression.
5882 Yet another issue is:
5884 struct S {
5885 int S;
5886 ~S();
5887 };
5889 S::~S() {}
5891 The standard does not seem to say that the `S' in `~S'
5892 should refer to the type `S' and not the data member
5893 `S::S'. */
5895 /* DR 244 says that we look up the name after the "~" in the
5896 same scope as we looked up the qualifying name. That idea
5897 isn't fully worked out; it's more complicated than that. */
5902 /* Check for invalid scopes. */
5904 {
5908 }
5910 {
5914 scope);
5919 }
5922 /* If the name is of the form "X::~X" it's OK even if X is a
5923 typedef. */
5932 {
5935 }
5937 /* ~auto means the destructor of whatever the object is. */
5939 {
5942 "%<~auto%> only available with "
5946 }
5948 /* If there was an explicit qualification (S::~T), first look
5949 in the scope given by the qualification (i.e., S).
5951 Note: in the calls to cp_parser_class_name below we pass
5952 typename_type so that lookup finds the injected-class-name
5953 rather than the constructor. */
5957 {
5962 typename_type,
5965 declarator_p);
5968 }
5969 /* In "N::S::~S", look in "N" as well. */
5971 {
5976 type_decl
5980 typename_type,
5983 declarator_p);
5986 }
5987 /* In "p->S::~T", look in the scope given by "*p" as well. */
5989 {
5994 type_decl
5998 typename_type,
6001 declarator_p);
6004 }
6005 /* Look in the surrounding context. */
6007 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 {
6024 /* We couldn't find a type with this name. If we're parsing
6025 tentatively, fail and try something else. */
6027 {
6030 }
6031 /* Otherwise, accept it and check for a match at instantiation
6032 time. */
6037 }
6038 }
6039 /* If an error occurred, assume that the name of the
6040 destructor is the same as the name of the qualifying
6041 class. That allows us to keep parsing after running
6042 into ill-formed destructor names. */
6048 /* Check that destructor name and scope match. */
6050 {
6057 }
6059 /* [class.dtor]
6061 A typedef-name that names a class shall not be used as the
6062 identifier in the declarator for a destructor declaration. */
6069 type_decl);
6072 }
6076 {
6077 cp_expr id;
6079 /* This could be a template-id, so we try that first. */
6081 /* Try a template-id. */
6084 none_type,
6085 declarator_p);
6086 /* If that worked, we're done. */
6089 /* We still don't know whether we're looking at an
6090 operator-function-id or a conversion-function-id. */
6092 /* Try an operator-function-id. */
6094 /* If that didn't work, try a conversion-function-id. */
6098 {
6099 /* 17.6.3.3.5 */
6104 "literal operator suffixes not preceded by %<_%>"
6106 }
6109 }
6110 /* Fall through. */
6117 }
6118 }
6120 /* Parse an (optional) nested-name-specifier.
6122 nested-name-specifier: [C++98]
6123 class-or-namespace-name :: nested-name-specifier [opt]
6124 class-or-namespace-name :: template nested-name-specifier [opt]
6126 nested-name-specifier: [C++0x]
6127 type-name ::
6128 namespace-name ::
6129 nested-name-specifier identifier ::
6130 nested-name-specifier template [opt] simple-template-id ::
6132 PARSER->SCOPE should be set appropriately before this function is
6133 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6134 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6135 in name lookups.
6137 Sets PARSER->SCOPE to the class (TYPE) or namespace
6138 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6139 it unchanged if there is no nested-name-specifier. Returns the new
6140 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6142 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6143 part of a declaration and/or decl-specifier. */
6145 static tree
6152 {
6157 /* Remember where the nested-name-specifier starts. */
6159 {
6162 }
6165 {
6166 tree new_scope;
6167 tree old_scope;
6168 tree saved_qualifying_scope;
6170 /* Spot cases that cannot be the beginning of a
6171 nested-name-specifier. */
6174 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6175 the already parsed nested-name-specifier. */
6177 {
6178 /* Grab the nested-name-specifier and continue the loop. */
6180 /* If we originally encountered this nested-name-specifier
6181 with IS_DECLARATION set to false, we will not have
6182 resolved TYPENAME_TYPEs, so we must do so here. */
6185 {
6190 }
6193 }
6195 /* Spot cases that cannot be the beginning of a
6196 nested-name-specifier. On the second and subsequent times
6197 through the loop, we look for the `template' keyword. */
6199 ;
6200 /* A template-id can start a nested-name-specifier. */
6202 ;
6203 /* DR 743: decltype can be used in a nested-name-specifier. */
6205 ;
6206 else
6207 {
6208 /* If the next token is not an identifier, then it is
6209 definitely not a type-name or namespace-name. */
6212 /* If the following token is neither a `<' (to begin a
6213 template-id), nor a `::', then we are not looking at a
6214 nested-name-specifier. */
6220 {
6224 "found %<:%> in nested-name-specifier, "
6227 }
6230 && !cp_parser_nth_token_starts_template_argument_list_p
6233 }
6235 /* The nested-name-specifier is optional, so we parse
6236 tentatively. */
6239 /* Look for the optional `template' keyword, if this isn't the
6240 first time through the loop. */
6244 /* Save the old scope since the name lookup we are about to do
6245 might destroy it. */
6248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6249 look up names in "X<T>::I" in order to determine that "Y" is
6250 a template. So, if we have a typename at this point, we make
6251 an effort to look through it. */
6253 && !typename_keyword_p
6258 /* Parse the qualifying entity. */
6259 new_scope
6261 typename_keyword_p,
6262 template_keyword_p,
6263 check_dependency_p,
6264 type_p,
6265 is_declaration);
6266 /* Look for the `::' token. */
6269 /* If we found what we wanted, we keep going; otherwise, we're
6270 done. */
6272 {
6275 /* Restore the OLD_SCOPE since it was valid before the
6276 failed attempt at finding the last
6277 class-or-namespace-name. */
6281 /* If the next token is a decltype, and the one after that is a
6282 `::', then the decltype has failed to resolve to a class or
6283 enumeration type. Give this error even when parsing
6284 tentatively since it can't possibly be valid--and we're going
6285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6286 won't get another chance.*/
6290 {
6297 /* As below. */
6300 }
6304 {
6305 /* If we have a non-type template-id followed by ::, it can't
6306 possibly be valid. */
6311 {
6314 {
6320 }
6321 else
6322 {
6323 /* Variable template. */
6328 }
6335 /* As below. */
6339 }
6340 }
6344 /* If the next token is an identifier, and the one after
6345 that is a `::', then any valid interpretation would have
6346 found a class-or-namespace-name. */
6352 {
6355 {
6357 {
6358 tree decl;
6359 tree ambiguous_decls;
6362 none_type,
6371 decl);
6373 {
6374 // cp_parser_lookup_name has the same diagnostic,
6375 // thus make sure to emit it at most once.
6378 {
6383 }
6385 }
6386 else
6387 {
6389 cp_parser_name_lookup_error
6392 else
6393 cp_parser_name_lookup_error
6396 }
6397 }
6400 /* Treat this as a successful nested-name-specifier
6401 due to:
6403 [basic.lookup.qual]
6405 If the name found is not a class-name (clause
6406 _class_) or namespace-name (_namespace.def_), the
6407 program is ill-formed. */
6409 }
6411 }
6413 }
6414 /* We've found one valid nested-name-specifier. */
6416 /* Name lookup always gives us a DECL. */
6419 /* Uses of "template" must be followed by actual templates. */
6431 new_scope);
6432 /* If it is a class scope, try to complete it; we are about to
6433 be looking up names inside the class. */
6435 /* Since checking types for dependency can be expensive,
6436 avoid doing it if the type is already complete. */
6438 /* Do not try to complete dependent types. */
6440 {
6442 /* If it is a typedef to current class, use the current
6443 class instead, as the typedef won't have any names inside
6444 it yet. */
6448 }
6449 /* Make sure we look in the right scope the next time through
6450 the loop. */
6452 }
6454 /* If parsing tentatively, replace the sequence of tokens that makes
6455 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6456 token. That way, should we re-parse the token stream, we will
6457 not have to repeat the effort required to do the parse, nor will
6458 we issue duplicate error messages. */
6460 {
6464 /* Reset the contents of the START token. */
6466 /* Retrieve any deferred checks. Do not pop this access checks yet
6467 so the memory will not be reclaimed during token replacing below. */
6475 /* Purge all subsequent tokens. */
6477 }
6483 }
6485 /* Parse a nested-name-specifier. See
6486 cp_parser_nested_name_specifier_opt for details. This function
6487 behaves identically, except that it will an issue an error if no
6488 nested-name-specifier is present. */
6490 static tree
6496 {
6497 tree scope;
6499 /* Look for the nested-name-specifier. */
6501 typename_keyword_p,
6502 check_dependency_p,
6503 type_p,
6504 is_declaration);
6505 /* If it was not present, issue an error message. */
6507 {
6510 }
6513 }
6515 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6516 this is either a class-name or a namespace-name (which corresponds
6517 to the class-or-namespace-name production in the grammar). For
6518 C++0x, it can also be a type-name that refers to an enumeration
6519 type or a simple-template-id.
6521 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6522 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6523 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6524 TYPE_P is TRUE iff the next name should be taken as a class-name,
6525 even the same name is declared to be another entity in the same
6526 scope.
6528 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6529 specified by the class-or-namespace-name. If neither is found the
6530 ERROR_MARK_NODE is returned. */
6532 static tree
6539 {
6540 tree saved_scope;
6541 tree saved_qualifying_scope;
6542 tree saved_object_scope;
6543 tree scope;
6547 /* DR 743: decltype can appear in a nested-name-specifier. */
6549 {
6553 {
6556 }
6560 }
6562 /* Before we try to parse the class-name, we must save away the
6563 current PARSER->SCOPE since cp_parser_class_name will destroy
6564 it. */
6568 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6569 there is no need to look for a namespace-name. */
6570 only_class_p = template_keyword_p
6575 typename_keyword_p,
6576 template_keyword_p,
6578 check_dependency_p,
6580 is_declaration,
6583 /* If that didn't work, try for a namespace-name. */
6585 {
6586 /* Restore the saved scope. */
6590 /* If we are not looking at an identifier followed by the scope
6591 resolution operator, then this is not part of a
6592 nested-name-specifier. (Note that this function is only used
6593 to parse the components of a nested-name-specifier.) */
6598 }
6601 }
6603 /* Return true if we are looking at a compound-literal, false otherwise. */
6605 static bool
6607 {
6610 /* Skip tokens until the next token is a closing parenthesis.
6611 If we find the closing `)', and the next token is a `{', then
6612 we are looking at a compound-literal. */
6613 bool compound_literal_p
6618 /* Roll back the tokens we skipped. */
6622 }
6624 /* Return true if EXPR is the integer constant zero or a complex constant
6625 of zero, without any folding, but ignoring location wrappers. */
6627 static bool
6629 {
6632 }
6634 /* Parse a postfix-expression.
6636 postfix-expression:
6637 primary-expression
6638 postfix-expression [ expression ]
6639 postfix-expression ( expression-list [opt] )
6640 simple-type-specifier ( expression-list [opt] )
6641 typename :: [opt] nested-name-specifier identifier
6642 ( expression-list [opt] )
6643 typename :: [opt] nested-name-specifier template [opt] template-id
6644 ( expression-list [opt] )
6645 postfix-expression . template [opt] id-expression
6646 postfix-expression -> template [opt] id-expression
6647 postfix-expression . pseudo-destructor-name
6648 postfix-expression -> pseudo-destructor-name
6649 postfix-expression ++
6650 postfix-expression --
6651 dynamic_cast < type-id > ( expression )
6652 static_cast < type-id > ( expression )
6653 reinterpret_cast < type-id > ( expression )
6654 const_cast < type-id > ( expression )
6655 typeid ( expression )
6656 typeid ( type-id )
6658 GNU Extension:
6660 postfix-expression:
6661 ( type-id ) { initializer-list , [opt] }
6663 This extension is a GNU version of the C99 compound-literal
6664 construct. (The C99 grammar uses `type-name' instead of `type-id',
6665 but they are essentially the same concept.)
6667 If ADDRESS_P is true, the postfix expression is the operand of the
6668 `&' operator. CAST_P is true if this expression is the target of a
6669 cast.
6671 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6672 class member access expressions [expr.ref].
6674 Returns a representation of the expression. */
6676 static cp_expr
6680 {
6682 location_t loc;
6688 /* Peek at the next token. */
6693 /* Some of the productions are determined by keywords. */
6696 {
6701 {
6702 tree type;
6703 cp_expr expression;
6707 /* All of these can be handled in the same way from the point
6708 of view of parsing. Begin by consuming the token
6709 identifying the cast. */
6712 /* New types cannot be defined in the cast. */
6714 parser->type_definition_forbidden_message
6717 /* Look for the opening `<'. */
6719 /* Parse the type to which we are casting. */
6724 /* Look for the closing `>'. */
6726 /* Restore the old message. */
6729 bool saved_greater_than_is_operator_p
6733 /* And the expression which is being cast. */
6734 matching_parens parens;
6738 RT_CLOSE_PAREN);
6742 parser->greater_than_is_operator_p
6745 /* Only type conversions to integral or enumeration types
6746 can be used in constant-expressions. */
6749 {
6752 }
6755 {
6757 postfix_expression
6761 postfix_expression
6765 postfix_expression
6767 tf_warning_or_error);
6770 postfix_expression
6775 }
6777 /* Construct a location e.g. :
6778 reinterpret_cast <int *> (expr)
6779 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6780 ranging from the start of the "*_cast" token to the final closing
6781 paren, with the caret at the start. */
6784 }
6788 {
6789 tree type;
6793 /* Consume the `typeid' token. */
6795 /* Look for the `(' token. */
6796 matching_parens parens;
6798 /* Types cannot be defined in a `typeid' expression. */
6800 parser->type_definition_forbidden_message
6802 /* We can't be sure yet whether we're looking at a type-id or an
6803 expression. */
6805 /* Try a type-id first. */
6810 /* Look for the `)' token. Otherwise, we can't be sure that
6811 we're not looking at an expression: consider `typeid (int
6812 (3))', for example. */
6814 /* If all went well, simply lookup the type-id. */
6817 /* Otherwise, fall back to the expression variant. */
6818 else
6819 {
6820 tree expression;
6822 /* Look for an expression. */
6824 /* Compute its typeid. */
6826 /* Look for the `)' token. */
6828 }
6829 /* Restore the saved message. */
6831 /* `typeid' may not appear in an integral constant expression. */
6835 /* Construct a location e.g. :
6836 typeid (expr)
6837 ^~~~~~~~~~~~~
6838 ranging from the start of the "typeid" token to the final closing
6839 paren, with the caret at the start. */
6841 {
6842 location_t typeid_loc
6846 }
6847 }
6851 {
6852 tree type;
6853 /* The syntax permitted here is the same permitted for an
6854 elaborated-type-specifier. */
6861 }
6867 {
6870 tree p;
6877 {
6880 }
6886 {
6889 postfix_expression
6891 else
6892 {
6896 }
6902 tf_warning_or_error);
6903 else
6904 {
6908 }
6913 postfix_expression
6917 postfix_expression
6920 else
6921 {
6925 }
6930 }
6932 }
6935 {
6936 tree type;
6938 /* If the next thing is a simple-type-specifier, we may be
6939 looking at a functional cast. We could also be looking at
6940 an id-expression. So, we try the functional cast, and if
6941 that doesn't work we fall back to the primary-expression. */
6943 /* Look for the simple-type-specifier. */
6947 CP_PARSER_FLAGS_NONE);
6949 /* Parse the cast itself. */
6951 postfix_expression
6953 /* If that worked, we're done. */
6957 /* If the functional-cast didn't work out, try a
6958 compound-literal. */
6961 {
6966 matching_parens parens;
6969 /* Avoid calling cp_parser_type_id pointlessly, see comment
6970 in cp_parser_cast_expression about c++/29234. */
6973 else
6974 {
6975 /* Parse the type. */
6981 }
6983 /* If things aren't going well, there's no need to
6984 keep going. */
6986 {
6988 /* Parse the brace-enclosed initializer list. */
6991 }
6992 /* If that worked, we're definitely looking at a
6993 compound-literal expression. */
6995 {
6996 /* Warn the user that a compound literal is not
6997 allowed in standard C++. */
7000 /* For simplicity, we disallow compound literals in
7001 constant-expressions. We could
7002 allow compound literals of integer type, whose
7003 initializer was a constant, in constant
7004 expressions. Permitting that usage, as a further
7005 extension, would not change the meaning of any
7006 currently accepted programs. (Of course, as
7007 compound literals are not part of ISO C++, the
7008 standard has nothing to say.) */
7010 NIC_NCC))
7011 {
7014 }
7015 /* Form the representation of the compound-literal. */
7016 postfix_expression
7021 }
7022 }
7024 /* It must be a primary-expression. */
7025 postfix_expression
7028 decltype_p,
7030 }
7032 }
7034 /* Note that we don't need to worry about calling build_cplus_new on a
7035 class-valued CALL_EXPR in decltype when it isn't the end of the
7036 postfix-expression; unary_complex_lvalue will take care of that for
7037 all these cases. */
7039 /* Keep looping until the postfix-expression is complete. */
7041 {
7045 /* It is not a Koenig lookup function call. */
7046 postfix_expression
7049 /* Peek at the next token. */
7053 {
7056 {
7058 "two consecutive %<[%> shall "
7061 }
7062 postfix_expression
7064 postfix_expression,
7066 decltype_p);
7075 /* postfix-expression ( expression-list [opt] ) */
7076 {
7087 is_builtin_constant_p
7090 {
7091 /* The whole point of __builtin_constant_p is to allow
7092 non-constant expressions to appear as arguments. */
7093 saved_integral_constant_expression_p
7095 saved_non_integral_constant_expression_p
7098 }
7099 args = (cp_parser_parenthesized_expression_list
7106 {
7107 parser->integral_constant_expression_p
7109 parser->non_integral_constant_expression_p
7111 }
7114 {
7117 }
7119 /* Function calls are not permitted in
7120 constant-expressions. */
7123 NIC_FUNC_CALL))
7124 {
7128 }
7133 {
7135 {
7137 {
7140 postfix_expression
7142 complain);
7143 }
7144 else
7145 postfix_expression
7147 }
7148 /* We do not perform argument-dependent lookup if
7149 normal lookup finds a non-function, in accordance
7150 with the expected resolution of DR 218. */
7153 {
7157 /* Do not do argument dependent lookup if regular
7158 lookup finds a member function or a block-scope
7159 function declaration. [basic.lookup.argdep]/3 */
7162 {
7165 postfix_expression
7167 complain);
7168 }
7169 }
7170 }
7176 {
7183 }
7186 {
7196 {
7198 postfix_expression
7202 }
7205 {
7206 postfix_expression
7207 = (build_new_method_call
7213 complain));
7214 }
7215 else
7216 postfix_expression
7220 complain);
7221 }
7225 postfix_expression = (build_offset_ref_call_from_tree
7227 complain));
7229 /* A call to a static class member, or a namespace-scope
7230 function. */
7231 postfix_expression
7234 koenig_p,
7235 complain);
7236 else
7237 /* All other function calls. */
7238 postfix_expression
7241 koenig_p,
7242 complain);
7245 {
7247 start_loc,
7248 close_paren_loc);
7250 }
7252 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7256 }
7261 /* postfix-expression . template [opt] id-expression
7262 postfix-expression . pseudo-destructor-name
7263 postfix-expression -> template [opt] id-expression
7264 postfix-expression -> pseudo-destructor-name */
7266 /* Consume the `.' or `->' operator. */
7269 postfix_expression
7271 postfix_expression,
7278 /* postfix-expression ++ */
7279 /* Consume the `++' token. */
7281 /* Generate a representation for the complete expression. */
7282 postfix_expression
7284 POSTINCREMENT_EXPR);
7285 /* Increments may not appear in constant-expressions. */
7293 /* postfix-expression -- */
7294 /* Consume the `--' token. */
7296 /* Generate a representation for the complete expression. */
7297 postfix_expression
7299 POSTDECREMENT_EXPR);
7300 /* Decrements may not appear in constant-expressions. */
7311 return is_member_access
7312 ? postfix_expression
7314 else
7316 }
7317 }
7319 /* We should never get here. */
7322 }
7324 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7325 by cp_parser_builtin_offsetof. We're looking for
7327 postfix-expression [ expression ]
7328 postfix-expression [ braced-init-list ] (C++11)
7330 FOR_OFFSETOF is set if we're being called in that context, which
7331 changes how we deal with integer constant expressions. */
7333 static tree
7335 tree postfix_expression,
7338 {
7343 /* Consume the `[' token. */
7349 /* Parse the index expression. */
7350 /* ??? For offsetof, there is a question of what to allow here. If
7351 offsetof is not being used in an integral constant expression context,
7352 then we *could* get the right answer by computing the value at runtime.
7353 If we are in an integral constant expression context, then we might
7354 could accept any constant expression; hard to say without analysis.
7355 Rather than open the barn door too wide right away, allow only integer
7356 constant expressions here. */
7359 else
7360 {
7362 {
7367 }
7368 else
7370 }
7374 /* Look for the closing `]'. */
7377 /* Build the ARRAY_REF. */
7381 /* When not doing offsetof, array references are not permitted in
7382 constant-expressions. */
7388 }
7390 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7391 by cp_parser_builtin_offsetof. We're looking for
7393 postfix-expression . template [opt] id-expression
7394 postfix-expression . pseudo-destructor-name
7395 postfix-expression -> template [opt] id-expression
7396 postfix-expression -> pseudo-destructor-name
7398 FOR_OFFSETOF is set if we're being called in that context. That sorta
7399 limits what of the above we'll actually accept, but nevermind.
7400 TOKEN_TYPE is the "." or "->" token, which will already have been
7401 removed from the stream. */
7403 static tree
7406 cp_expr postfix_expression,
7408 location_t location)
7409 {
7410 tree name;
7416 /* If this is a `->' operator, dereference the pointer. */
7419 tf_warning_or_error);
7420 /* Check to see whether or not the expression is type-dependent and
7421 not the current instantiation. */
7423 /* The identifier following the `->' or `.' is not qualified. */
7429 /* Enter the scope corresponding to the type of the object
7430 given by the POSTFIX_EXPRESSION. */
7432 {
7434 /* According to the standard, no expression should ever have
7435 reference type. Unfortunately, we do not currently match
7436 the standard in this respect in that our internal representation
7437 of an expression may have reference type even when the standard
7438 says it does not. Therefore, we have to manually obtain the
7439 underlying type here. */
7441 /* The type of the POSTFIX_EXPRESSION must be complete. */
7442 /* Unlike the object expression in other contexts, *this is not
7443 required to be of complete type for purposes of class member
7444 access (5.2.5) outside the member function body. */
7447 && !(processing_template_decl
7448 && current_class_type
7449 && (same_type_ignoring_top_level_qualifiers_p
7451 {
7454 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7456 {
7457 /* In a template, be permissive by treating an object expression
7458 of incomplete type as dependent (after a pedwarn). */
7459 diagnostic_t kind = (processing_template_decl
7461 ? DK_PEDWARN
7463 cxx_incomplete_type_diagnostic
7469 {
7472 }
7473 }
7474 }
7477 {
7478 /* Let the name lookup machinery know that we are processing a
7479 class member access expression. */
7481 /* If something went wrong, we want to be able to discern that case,
7482 as opposed to the case where there was no SCOPE due to the type
7483 of expression being dependent. */
7486 /* If the SCOPE was erroneous, make the various semantic analysis
7487 functions exit quickly -- and without issuing additional error
7488 messages. */
7491 }
7492 }
7495 /* Tell cp_parser_lookup_name that there was an object, even though it's
7496 type-dependent. */
7499 /* Assume this expression is not a pseudo-destructor access. */
7502 /* If the SCOPE is a scalar type, then, if this is a valid program,
7503 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7504 is type dependent, it can be pseudo-destructor-name or something else.
7505 Try to parse it as pseudo-destructor-name first. */
7507 {
7508 tree s;
7509 tree type;
7512 /* Parse the pseudo-destructor-name. */
7521 {
7523 postfix_expression
7526 }
7527 }
7530 {
7531 /* If the SCOPE is not a scalar type, we are looking at an
7532 ordinary class member access expression, rather than a
7533 pseudo-destructor-name. */
7536 /* Parse the id-expression. */
7537 name = (cp_parser_id_expression
7544 /* In general, build a SCOPE_REF if the member name is qualified.
7545 However, if the name was not dependent and has already been
7546 resolved; there is no need to build the SCOPE_REF. For example;
7548 struct X { void f(); };
7549 template <typename T> void f(T* t) { t->X::f(); }
7551 Even though "t" is dependent, "X::f" is not and has been resolved
7552 to a BASELINK; there is no need to include scope information. */
7554 /* But we do need to remember that there was an explicit scope for
7555 virtual function calls. */
7559 /* If the name is a template-id that names a type, we will get a
7560 TYPE_DECL here. That is invalid code. */
7562 {
7565 }
7566 else
7567 {
7569 {
7571 {
7575 }
7576 else
7579 name,
7580 template_p);
7584 }
7586 adjust_result_of_qualified_name_lookup
7588 postfix_expression
7590 template_p,
7591 tf_warning_or_error);
7592 /* Build a location e.g.:
7593 ptr->access_expr
7594 ~~~^~~~~~~~~~~~~
7595 where the caret is at the deref token, ranging from
7596 the start of postfix_expression to the end of the access expr. */
7597 location_t end_loc
7599 location_t combined_loc
7602 }
7603 }
7605 /* We no longer need to look up names in the scope of the object on
7606 the left-hand side of the `.' or `->' operator. */
7609 /* Outside of offsetof, these operators may not appear in
7610 constant-expressions. */
7612 && (cp_parser_non_integral_constant_expression
7617 }
7619 /* Parse a parenthesized expression-list.
7621 expression-list:
7622 assignment-expression
7623 expression-list, assignment-expression
7625 attribute-list:
7626 expression-list
7627 identifier
7628 identifier, expression-list
7630 CAST_P is true if this expression is the target of a cast.
7632 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7633 argument pack.
7635 WRAP_LOCATIONS_P is true if expressions within this list for which
7636 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7637 their source locations.
7639 Returns a vector of trees. Each element is a representation of an
7640 assignment-expression. NULL is returned if the ( and or ) are
7641 missing. An empty, but allocated, vector is returned on no
7642 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7643 if we are parsing an attribute list for an attribute that wants a
7644 plain identifier argument, normal_attr for an attribute that wants
7645 an expression, or non_attr if we aren't parsing an attribute list. If
7646 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7647 not all of the expressions in the list were constant.
7648 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7649 will be written to with the location of the closing parenthesis. If
7650 an error occurs, it may or may not be written to. */
7660 {
7666 /* Assume all the expressions will be constant. */
7670 matching_parens parens;
7676 /* Within a parenthesized expression, a `>' token is always
7677 the greater-than operator. */
7678 saved_greater_than_is_operator_p
7684 /* Consume expressions until there are no more. */
7687 {
7688 /* At the beginning of attribute lists, check to see if the
7689 next token is an identifier. */
7692 {
7695 /* Consume the identifier. */
7697 /* Save the identifier. */
7699 }
7700 else
7701 {
7704 /* Parse the next assignment-expression. */
7706 {
7707 /* A braced-init-list. */
7713 }
7715 {
7716 expr = (cp_parser_constant_expression
7721 }
7722 else
7724 cast_p);
7729 /* If we have an ellipsis, then this is an expression
7730 expansion. */
7733 {
7734 /* Consume the `...'. */
7737 /* Build the argument pack. */
7739 }
7744 /* Add it to the list. We add error_mark_node
7745 expressions to the list, so that we can still tell if
7746 the correct form for a parenthesized expression-list
7747 is found. That gives better errors. */
7752 }
7754 /* After the first item, attribute lists look the same as
7755 expression lists. */
7758 get_comma:;
7759 /* If the next token isn't a `,', then we are done. */
7763 /* Otherwise, consume the `,' and keep going. */
7765 }
7771 {
7774 skip_comma:;
7775 /* We try and resync to an unnested comma, as that will give the
7776 user better diagnostics. */
7784 {
7785 parser->greater_than_is_operator_p
7788 }
7789 }
7791 parser->greater_than_is_operator_p
7798 }
7800 /* Parse a pseudo-destructor-name.
7802 pseudo-destructor-name:
7803 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7804 :: [opt] nested-name-specifier template template-id :: ~ type-name
7805 :: [opt] nested-name-specifier [opt] ~ type-name
7807 If either of the first two productions is used, sets *SCOPE to the
7808 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7809 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7810 or ERROR_MARK_NODE if the parse fails. */
7812 static void
7814 tree object,
7817 {
7820 /* Handle ~auto. */
7824 {
7827 "%<~auto%> only available with "
7834 }
7836 /* Assume that things will not work out. */
7839 /* Look for the optional `::' operator. */
7841 /* Look for the optional nested-name-specifier. */
7842 nested_name_specifier_p
7849 /* Now, if we saw a nested-name-specifier, we might be doing the
7850 second production. */
7853 {
7854 /* Consume the `template' keyword. */
7856 /* Parse the template-id. */
7860 class_type,
7862 /* Look for the `::' token. */
7864 }
7865 /* If the next token is not a `~', then there might be some
7866 additional qualification. */
7868 {
7869 /* At this point, we're looking for "type-name :: ~". The type-name
7870 must not be a class-name, since this is a pseudo-destructor. So,
7871 it must be either an enum-name, or a typedef-name -- both of which
7872 are just identifiers. So, we peek ahead to check that the "::"
7873 and "~" tokens are present; if they are not, then we can avoid
7874 calling type_name. */
7878 {
7881 }
7883 /* Look for the type-name. */
7888 /* Look for the `::' token. */
7890 }
7891 else
7894 /* Look for the `~'. */
7897 /* Once we see the ~, this has to be a pseudo-destructor. */
7901 /* Look for the type-name again. We are not responsible for
7902 checking that it matches the first type-name. */
7904 }
7906 /* Parse a unary-expression.
7908 unary-expression:
7909 postfix-expression
7910 ++ cast-expression
7911 -- cast-expression
7912 unary-operator cast-expression
7913 sizeof unary-expression
7914 sizeof ( type-id )
7915 alignof ( type-id ) [C++0x]
7916 new-expression
7917 delete-expression
7919 GNU Extensions:
7921 unary-expression:
7922 __extension__ cast-expression
7923 __alignof__ unary-expression
7924 __alignof__ ( type-id )
7925 alignof unary-expression [C++0x]
7926 __real__ cast-expression
7927 __imag__ cast-expression
7928 && identifier
7929 sizeof ( type-id ) { initializer-list , [opt] }
7930 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7931 __alignof__ ( type-id ) { initializer-list , [opt] }
7933 ADDRESS_P is true iff the unary-expression is appearing as the
7934 operand of the `&' operator. CAST_P is true if this expression is
7935 the target of a cast.
7937 Returns a representation of the expression. */
7939 static cp_expr
7942 {
7946 /* Peek at the next token. */
7948 /* Some keywords give away the kind of expression. */
7950 {
7954 {
7957 {
7963 /* Consume the token. */
7965 /* Parse the operand. */
7970 else
7971 {
7972 /* ISO C++ defines alignof only with types, not with
7973 expressions. So pedwarn if alignof is used with a non-
7974 type expression. However, __alignof__ is ok. */
7977 "ISO C++ does not allow %<alignof%> "
7981 }
7982 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7983 SIZEOF_EXPR with the original operand. */
7985 {
7987 {
7989 {
7992 error_mark_node));
7994 }
7995 else
7999 }
8000 }
8002 /* Construct a location e.g. :
8003 alignof (expr)
8004 ^~~~~~~~~~~~~~
8005 with start == caret at the start of the "alignof"/"sizeof"
8006 token, with the endpoint at the final closing paren. */
8007 location_t finish_loc
8009 location_t compound_loc
8016 }
8025 {
8026 /* The saved value of the PEDANTIC flag. */
8028 tree expr;
8030 /* Save away the PEDANTIC flag. */
8032 /* Parse the cast-expression. */
8034 /* Restore the PEDANTIC flag. */
8038 }
8042 {
8043 tree expression;
8045 /* Consume the `__real__' or `__imag__' token. */
8047 /* Parse the cast-expression. */
8049 /* Create the complete representation. */
8053 expression,
8054 tf_warning_or_error);
8055 }
8063 {
8064 tree expr;
8073 matching_parens parens;
8077 parser->type_definition_forbidden_message
8080 saved_integral_constant_expression_p
8082 saved_non_integral_constant_expression_p
8086 saved_greater_than_is_operator_p
8098 parser->greater_than_is_operator_p
8101 parser->integral_constant_expression_p
8103 parser->non_integral_constant_expression_p
8108 location_t finish_loc
8112 /* Construct a location of the form:
8113 noexcept (expr)
8114 ^~~~~~~~~~~~~~~
8115 with start == caret, finishing at the close-paren. */
8116 location_t noexcept_loc
8120 noexcept_loc);
8121 }
8125 }
8126 }
8128 /* Look for the `:: new' and `:: delete', which also signal the
8129 beginning of a new-expression, or delete-expression,
8130 respectively. If the next token is `::', then it might be one of
8131 these. */
8133 {
8136 /* See if the token after the `::' is one of the keywords in
8137 which we're interested. */
8139 /* If it's `new', we have a new-expression. */
8142 /* Similarly, for `delete'. */
8145 }
8147 /* Look for a unary operator. */
8149 /* The `++' and `--' operators can be handled similarly, even though
8150 they are not technically unary-operators in the grammar. */
8152 {
8157 /* Handle the GNU address-of-label extension. */
8160 {
8161 tree identifier;
8162 tree expression;
8165 /* Consume the '&&' token. */
8167 /* Look for the identifier. */
8168 location_t finish_loc
8171 /* Construct a location of the form:
8172 &&label
8173 ^~~~~~~
8174 with caret==start at the "&&", finish at the end of the label. */
8175 location_t combined_loc
8177 /* Create an expression representing the address. */
8180 NIC_ADDR_LABEL))
8183 }
8184 }
8186 {
8187 cp_expr cast_expression;
8193 /* Consume the operator token. */
8197 /* Parse the cast-expression. */
8198 cast_expression
8203 pidk);
8205 /* Make a location:
8206 OP_TOKEN CAST_EXPRESSION
8207 ^~~~~~~~~~~~~~~~~~~~~~~~~
8208 with start==caret at the operator token, and
8209 extending to the end of the cast_expression. */
8212 /* Now, build an appropriate representation. */
8214 {
8218 RO_UNARY_STAR,
8219 complain);
8220 /* TODO: build_x_indirect_ref does not always honor the
8221 location, so ensure it is set. */
8227 /* Fall through. */
8230 cast_expression,
8231 complain);
8232 /* TODO: build_x_unary_op does not always honor the location,
8233 so ensure it is set. */
8241 /* Fall through. */
8243 /* Immediately fold negation of a constant, unless the constant is 0
8244 (since -0 == 0) or it would overflow. */
8249 {
8252 cast_expression);
8254 {
8257 }
8258 }
8259 /* Fall through. */
8268 }
8272 non_constant_p))
8276 }
8280 decltype_p,
8281 pidk);
8282 }
8284 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8285 unary-operator, the corresponding tree code is returned. */
8287 static enum tree_code
8289 {
8291 {
8312 }
8313 }
8315 /* Parse a new-expression.
8317 new-expression:
8318 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8319 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8321 Returns a representation of the expression. */
8323 static tree
8325 {
8328 tree type;
8331 tree ret;
8335 /* Look for the optional `::' operator. */
8336 global_scope_p
8340 /* Look for the `new' operator. */
8342 /* There's no easy way to tell a new-placement from the
8343 `( type-id )' construct. */
8345 /* Look for a new-placement. */
8347 /* If that didn't work out, there's no new-placement. */
8349 {
8353 }
8355 /* If the next token is a `(', then we have a parenthesized
8356 type-id. */
8358 {
8362 /* Consume the `('. */
8363 matching_parens parens;
8366 /* Parse the type-id. */
8367 parser->type_definition_forbidden_message
8369 {
8372 }
8375 /* Look for the closing `)'. */
8378 /* There should not be a direct-new-declarator in this production,
8379 but GCC used to allowed this, so we check and emit a sensible error
8380 message for this case. */
8382 {
8388 }
8389 }
8390 /* Otherwise, there must be a new-type-id. */
8391 else
8394 /* If the next token is a `(' or '{', then we have a new-initializer. */
8399 else
8402 /* A new-expression may not appear in an integral constant
8403 expression. */
8406 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8407 of a new-type-id or type-id of a new-expression, the new-expression shall
8408 contain a new-initializer of the form ( assignment-expression )".
8409 Additionally, consistently with the spirit of DR 1467, we want to accept
8410 'new auto { 2 }' too. */
8416 {
8418 "initialization of new-expression for type %<auto%> "
8421 }
8422 else
8423 {
8424 /* Construct a location e.g.:
8425 ptr = new int[100]
8426 ^~~~~~~~~~~~
8427 with caret == start at the start of the "new" token, and the end
8428 at the end of the final token we consumed. */
8433 /* Create a representation of the new-expression. */
8435 tf_warning_or_error);
8437 }
8445 }
8447 /* Parse a new-placement.
8449 new-placement:
8450 ( expression-list )
8452 Returns the same representation as for an expression-list. */
8456 {
8459 /* Parse the expression-list. */
8460 expression_list = (cp_parser_parenthesized_expression_list
8469 }
8471 /* Parse a new-type-id.
8473 new-type-id:
8474 type-specifier-seq new-declarator [opt]
8476 Returns the TYPE allocated. If the new-type-id indicates an array
8477 type, *NELTS is set to the number of elements in the last array
8478 bound; the TYPE will not include the last array bound. */
8480 static tree
8482 {
8483 cp_decl_specifier_seq type_specifier_seq;
8489 /* The type-specifier sequence must not contain type definitions.
8490 (It cannot contain declarations of new types either, but if they
8491 are not definitions we will catch that because they are not
8492 complete.) */
8494 parser->type_definition_forbidden_message
8496 /* Parse the type-specifier-seq. */
8500 /* Restore the old message. */
8506 /* Parse the new-declarator. */
8509 /* Determine the number of elements in the last array dimension, if
8510 any. */
8512 /* Skip down to the last array dimension. */
8517 {
8520 }
8525 {
8528 }
8531 {
8538 else
8540 }
8543 }
8545 /* Parse an (optional) new-declarator.
8547 new-declarator:
8548 ptr-operator new-declarator [opt]
8549 direct-new-declarator
8551 Returns the declarator. */
8555 {
8558 cp_cv_quals cv_quals;
8560 /* We don't know if there's a ptr-operator next, or not. */
8562 /* Look for a ptr-operator. */
8564 /* If that worked, look for more new-declarators. */
8566 {
8569 /* Parse another optional declarator. */
8572 declarator = cp_parser_make_indirect_declarator
8576 }
8578 /* If the next token is a `[', there is a direct-new-declarator. */
8583 }
8585 /* Parse a direct-new-declarator.
8587 direct-new-declarator:
8588 [ expression ]
8589 direct-new-declarator [constant-expression]
8591 */
8595 {
8599 {
8600 tree expression;
8603 /* Look for the opening `['. */
8608 /* The standard requires that the expression have integral
8609 type. DR 74 adds enumeration types. We believe that the
8610 real intent is that these expressions be handled like the
8611 expression in a `switch' condition, which also allows
8612 classes with a single conversion to integral or
8613 enumeration type. */
8615 {
8616 expression
8618 expression,
8621 {
8623 "expression in new-declarator must have integral "
8626 }
8627 }
8629 /* Look for the closing `]'. */
8632 /* Add this bound to the declarator. */
8635 /* If the next token is not a `[', then there are no more
8636 bounds. */
8639 }
8642 }
8644 /* Parse a new-initializer.
8646 new-initializer:
8647 ( expression-list [opt] )
8648 braced-init-list
8650 Returns a representation of the expression-list. */
8654 {
8658 {
8659 tree t;
8666 }
8667 else
8668 expression_list = (cp_parser_parenthesized_expression_list
8674 }
8676 /* Parse a delete-expression.
8678 delete-expression:
8679 :: [opt] delete cast-expression
8680 :: [opt] delete [ ] cast-expression
8682 Returns a representation of the expression. */
8684 static tree
8686 {
8689 tree expression;
8691 /* Look for the optional `::' operator. */
8692 global_scope_p
8696 /* Look for the `delete' keyword. */
8698 /* See if the array syntax is in use. */
8700 {
8701 /* Consume the `[' token. */
8703 /* Look for the `]' token. */
8705 /* Remember that this is the `[]' construct. */
8707 }
8708 else
8711 /* Parse the cast-expression. */
8714 /* A delete-expression may not appear in an integral constant
8715 expression. */
8720 tf_warning_or_error);
8721 }
8723 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8724 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8725 0 otherwise. */
8727 static int
8729 {
8732 {
8774 /* In ((type ()) () the last () isn't a valid cast-expression,
8775 so the whole must be parsed as postfix-expression. */
8780 /* '[' may start a primary-expression in obj-c++ and in C++11,
8781 as a lambda-expression, eg, '(void)[]{}'. */
8788 /* '++' and '--' may or may not start a cast-expression:
8790 struct T { void operator++(int); };
8791 void f() { (T())++; }
8793 vs
8795 int a;
8796 (int)++a; */
8801 }
8802 }
8804 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8805 in the order: const_cast, static_cast, reinterpret_cast.
8807 Don't suggest dynamic_cast.
8809 Return the first legal cast kind found, or NULL otherwise. */
8813 {
8814 tree trial;
8816 /* Reuse the parser logic by attempting to build the various kinds of
8817 cast, with "complain" disabled.
8818 Identify the first such cast that is valid. */
8820 /* Don't attempt to run such logic within template processing. */
8824 /* First try const_cast. */
8829 /* If that fails, try static_cast. */
8834 /* Finally, try reinterpret_cast. */
8839 /* No such cast possible. */
8841 }
8843 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8844 suggesting how to convert a C-style cast of the form:
8846 (DST_TYPE)ORIG_EXPR
8848 to a C++-style cast.
8850 The primary range of RICHLOC is asssumed to be that of the original
8851 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8852 of the parens in the C-style cast. */
8854 static void
8857 tree dst_type)
8858 {
8859 /* This function is non-trivial, so bail out now if the warning isn't
8860 going to be emitted. */
8864 /* Try to find a legal C++ cast, trying them in order:
8865 const_cast, static_cast, reinterpret_cast. */
8870 /* Replace the open paren with "CAST_SUGGESTION<". */
8871 pretty_printer pp;
8875 /* Replace the close paren with "> (". */
8878 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8880 }
8883 /* Parse a cast-expression.
8885 cast-expression:
8886 unary-expression
8887 ( type-id ) cast-expression
8889 ADDRESS_P is true iff the unary-expression is appearing as the
8890 operand of the `&' operator. CAST_P is true if this expression is
8891 the target of a cast.
8893 Returns a representation of the expression. */
8895 static cp_expr
8898 {
8899 /* If it's a `(', then we might be looking at a cast. */
8901 {
8907 /* There's no way to know yet whether or not this is a cast.
8908 For example, `(int (3))' is a unary-expression, while `(int)
8909 3' is a cast. So, we resort to parsing tentatively. */
8911 /* Types may not be defined in a cast. */
8913 parser->type_definition_forbidden_message
8915 /* Consume the `('. */
8916 matching_parens parens;
8921 /* A very tricky bit is that `(struct S) { 3 }' is a
8922 compound-literal (which we permit in C++ as an extension).
8923 But, that construct is not a cast-expression -- it is a
8924 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8925 is legal; if the compound-literal were a cast-expression,
8926 you'd need an extra set of parentheses.) But, if we parse
8927 the type-id, and it happens to be a class-specifier, then we
8928 will commit to the parse at that point, because we cannot
8929 undo the action that is done when creating a new class. So,
8930 then we cannot back up and do a postfix-expression.
8932 Another tricky case is the following (c++/29234):
8934 struct S { void operator () (); };
8936 void foo ()
8937 {
8938 ( S()() );
8939 }
8941 As a type-id we parse the parenthesized S()() as a function
8942 returning a function, groktypename complains and we cannot
8943 back up in this case either.
8945 Therefore, we scan ahead to the closing `)', and check to see
8946 if the tokens after the `)' can start a cast-expression. Otherwise
8947 we are dealing with an unary-expression, a postfix-expression
8948 or something else.
8950 Yet another tricky case, in C++11, is the following (c++/54891):
8952 (void)[]{};
8954 The issue is that usually, besides the case of lambda-expressions,
8955 the parenthesized type-id cannot be followed by '[', and, eg, we
8956 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8957 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8958 we don't commit, we try a cast-expression, then an unary-expression.
8960 Save tokens so that we can put them back. */
8963 /* We may be looking at a cast-expression. */
8966 cast_expression
8969 /* Roll back the tokens we skipped. */
8971 /* If we aren't looking at a cast-expression, simulate an error so
8972 that the call to cp_parser_error_occurred below returns true. */
8975 else
8976 {
8979 /* Look for the type-id. */
8981 /* Look for the closing `)'. */
8986 }
8988 /* Restore the saved message. */
8991 /* At this point this can only be either a cast or a
8992 parenthesized ctor such as `(T ())' that looks like a cast to
8993 function returning T. */
8995 {
8996 /* Only commit if the cast-expression doesn't start with
8997 '++', '--', or '[' in C++11. */
9005 pidk);
9008 {
9009 /* Warn about old-style casts, if so requested. */
9014 {
9020 }
9022 /* Only type conversions to integral or enumeration types
9023 can be used in constant-expressions. */
9026 NIC_CAST))
9029 /* Perform the cast. */
9030 /* Make a location:
9031 (TYPE) EXPR
9032 ^~~~~~~~~~~
9033 with start==caret at the open paren, extending to the
9034 end of "expr". */
9036 open_paren_loc,
9040 }
9041 }
9042 else
9044 }
9046 /* If we get here, then it's not a cast, so it must be a
9047 unary-expression. */
9050 }
9052 /* Parse a binary expression of the general form:
9054 pm-expression:
9055 cast-expression
9056 pm-expression .* cast-expression
9057 pm-expression ->* cast-expression
9059 multiplicative-expression:
9060 pm-expression
9061 multiplicative-expression * pm-expression
9062 multiplicative-expression / pm-expression
9063 multiplicative-expression % pm-expression
9065 additive-expression:
9066 multiplicative-expression
9067 additive-expression + multiplicative-expression
9068 additive-expression - multiplicative-expression
9070 shift-expression:
9071 additive-expression
9072 shift-expression << additive-expression
9073 shift-expression >> additive-expression
9075 relational-expression:
9076 shift-expression
9077 relational-expression < shift-expression
9078 relational-expression > shift-expression
9079 relational-expression <= shift-expression
9080 relational-expression >= shift-expression
9082 GNU Extension:
9084 relational-expression:
9085 relational-expression <? shift-expression
9086 relational-expression >? shift-expression
9088 equality-expression:
9089 relational-expression
9090 equality-expression == relational-expression
9091 equality-expression != relational-expression
9093 and-expression:
9094 equality-expression
9095 and-expression & equality-expression
9097 exclusive-or-expression:
9098 and-expression
9099 exclusive-or-expression ^ and-expression
9101 inclusive-or-expression:
9102 exclusive-or-expression
9103 inclusive-or-expression | exclusive-or-expression
9105 logical-and-expression:
9106 inclusive-or-expression
9107 logical-and-expression && inclusive-or-expression
9109 logical-or-expression:
9110 logical-and-expression
9111 logical-or-expression || logical-and-expression
9113 All these are implemented with a single function like:
9115 binary-expression:
9116 simple-cast-expression
9117 binary-expression <token> binary-expression
9119 CAST_P is true if this expression is the target of a cast.
9121 The binops_by_token map is used to get the tree codes for each <token> type.
9122 binary-expressions are associated according to a precedence table. */
9124 #define TOKEN_PRECEDENCE(token) \
9125 (((token->type == CPP_GREATER \
9126 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9127 && !parser->greater_than_is_operator_p) \
9128 ? PREC_NOT_OPERATOR \
9129 : binops_by_token[token->type].prec)
9131 static cp_expr
9137 {
9138 cp_parser_expression_stack stack;
9140 cp_parser_expression_stack_entry current;
9141 cp_expr rhs;
9145 tree overload;
9147 /* Parse the first expression. */
9158 {
9159 /* Get an operator token. */
9165 {
9167 "%<>>%> operator is treated"
9171 }
9176 /* This is a fold-expression; handle it later. */
9179 /* Popping an entry off the stack means we completed a subexpression:
9180 - either we found a token which is not an operator (`>' where it is not
9181 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9182 will happen repeatedly;
9183 - or, we found an operator which has lower priority. This is the case
9184 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9185 parsing `3 * 4'. */
9187 {
9190 else
9192 }
9194 get_rhs:
9198 /* We used the operator token. */
9201 /* For "false && x" or "true || x", x will never be executed;
9202 disable warnings while evaluating it. */
9204 c_inhibit_evaluation_warnings +=
9207 c_inhibit_evaluation_warnings +=
9210 /* Extract another operand. It may be the RHS of this expression
9211 or the LHS of a new, higher priority expression. */
9216 /* Get another operator token. Look up its precedence to avoid
9217 building a useless (immediately popped) stack entry for common
9218 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9225 {
9226 /* ... and prepare to parse the RHS of the new, higher priority
9227 expression. Since precedence levels on the stack are
9228 monotonically increasing, we do not have to care about
9229 stack overflows. */
9238 pop:
9240 /* If the stack is not empty, we have parsed into LHS the right side
9241 (`4' in the example above) of an expression we had suspended.
9242 We can use the information on the stack to recover the LHS (`3')
9243 from the stack together with the tree code (`MULT_EXPR'), and
9244 the precedence of the higher level subexpression
9245 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9246 which will be used to actually build the additive expression. */
9251 }
9253 /* Undo the disabling of warnings done above. */
9255 c_inhibit_evaluation_warnings -=
9258 c_inhibit_evaluation_warnings -=
9264 /* Avoid warning for !!x == y. */
9269 /* Avoid warning for !b == y where b is boolean. */
9273 /* Avoid warning for !!b == y where b is boolean. */
9286 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9287 ERROR_MARK for everything that is not a binary expression.
9288 This makes warn_about_parentheses miss some warnings that
9289 involve unary operators. For unary expressions we should
9290 pass the correct tree_code unless the unary expression was
9291 surrounded by parentheses.
9292 */
9299 == tcc_comparison
9302 else
9303 {
9308 /* TODO: build_x_binary_op doesn't always honor the location. */
9310 }
9313 /* If the binary operator required the use of an overloaded operator,
9314 then this expression cannot be an integral constant-expression.
9315 An overloaded operator can be used even if both operands are
9316 otherwise permissible in an integral constant-expression if at
9317 least one of the operands is of enumeration type. */
9321 NIC_OVERLOADED))
9323 }
9326 }
9328 static cp_expr
9333 {
9336 }
9338 /* Parse the `? expression : assignment-expression' part of a
9339 conditional-expression. The LOGICAL_OR_EXPR is the
9340 logical-or-expression that started the conditional-expression.
9341 Returns a representation of the entire conditional-expression.
9343 This routine is used by cp_parser_assignment_expression.
9345 ? expression : assignment-expression
9347 GNU Extensions:
9349 ? : assignment-expression */
9351 static tree
9353 {
9355 cp_expr assignment_expr;
9359 /* Consume the `?' token. */
9364 {
9367 /* Implicit true clause. */
9369 c_inhibit_evaluation_warnings +=
9372 }
9373 else
9374 {
9377 /* Parse the expression. */
9378 c_inhibit_evaluation_warnings +=
9381 c_inhibit_evaluation_warnings +=
9385 }
9387 /* The next token should be a `:'. */
9389 /* Parse the assignment-expression. */
9391 c_inhibit_evaluation_warnings -=
9394 /* Make a location:
9395 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9396 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9397 with the caret at the "?", ranging from the start of
9398 the logical_or_expr to the end of the assignment_expr. */
9403 /* Build the conditional-expression. */
9405 expr,
9406 assignment_expr,
9407 tf_warning_or_error);
9408 }
9410 /* Parse an assignment-expression.
9412 assignment-expression:
9413 conditional-expression
9414 logical-or-expression assignment-operator assignment_expression
9415 throw-expression
9417 CAST_P is true if this expression is the target of a cast.
9418 DECLTYPE_P is true if this expression is the operand of decltype.
9420 Returns a representation for the expression. */
9422 static cp_expr
9425 {
9426 cp_expr expr;
9428 /* If the next token is the `throw' keyword, then we're looking at
9429 a throw-expression. */
9432 /* Otherwise, it must be that we are looking at a
9433 logical-or-expression. */
9434 else
9435 {
9436 /* Parse the binary expressions (logical-or-expression). */
9438 decltype_p,
9440 /* If the next token is a `?' then we're actually looking at a
9441 conditional-expression. */
9444 else
9445 {
9448 /* If it's an assignment-operator, we're using the second
9449 production. */
9450 enum tree_code assignment_operator
9453 {
9456 /* Parse the right-hand side of the assignment. */
9463 /* An assignment may not appear in a
9464 constant-expression. */
9466 NIC_ASSIGNMENT))
9468 /* Build the assignment expression. Its default
9469 location:
9470 LHS = RHS
9471 ~~~~^~~~~
9472 is the location of the '=' token as the
9473 caret, ranging from the start of the lhs to the
9474 end of the rhs. */
9479 assignment_operator,
9480 rhs,
9482 /* TODO: build_x_modify_expr doesn't honor the location,
9483 so we must set it here. */
9485 }
9486 }
9487 }
9490 }
9492 /* Parse an (optional) assignment-operator.
9494 assignment-operator: one of
9495 = *= /= %= += -= >>= <<= &= ^= |=
9497 GNU Extension:
9499 assignment-operator: one of
9500 <?= >?=
9502 If the next token is an assignment operator, the corresponding tree
9503 code is returned, and the token is consumed. For example, for
9504 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9505 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9506 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9507 operator, ERROR_MARK is returned. */
9509 static enum tree_code
9511 {
9515 /* Peek at the next token. */
9519 {
9565 /* Nothing else is an assignment operator. */
9567 }
9569 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9574 /* If it was an assignment operator, consume it. */
9579 }
9581 /* Parse an expression.
9583 expression:
9584 assignment-expression
9585 expression , assignment-expression
9587 CAST_P is true if this expression is the target of a cast.
9588 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9589 except possibly parenthesized or on the RHS of a comma (N3276).
9591 Returns a representation of the expression. */
9593 static cp_expr
9596 {
9601 {
9602 cp_expr assignment_expression;
9604 /* Parse the next assignment-expression. */
9605 assignment_expression
9608 /* We don't create a temporary for a call that is the immediate operand
9609 of decltype or on the RHS of a comma. But when we see a comma, we
9610 need to create a temporary for a call on the LHS. */
9615 assignment_expression
9619 /* If this is the first assignment-expression, we can just
9620 save it away. */
9623 else
9624 {
9625 /* Create a location with caret at the comma, ranging
9626 from the start of the LHS to the end of the RHS. */
9631 assignment_expression,
9634 }
9635 /* If the next token is not a comma, or we're in a fold-expression, then
9636 we are done with the expression. */
9640 /* Consume the `,'. */
9643 /* A comma operator cannot appear in a constant-expression. */
9646 }
9649 }
9651 /* Parse a constant-expression.
9653 constant-expression:
9654 conditional-expression
9656 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9657 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9658 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9659 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9660 only parse a conditional-expression, otherwise parse an
9661 assignment-expression. See below for rationale. */
9663 static cp_expr
9668 {
9672 cp_expr expression;
9674 /* It might seem that we could simply parse the
9675 conditional-expression, and then check to see if it were
9676 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9677 one that the compiler can figure out is constant, possibly after
9678 doing some simplifications or optimizations. The standard has a
9679 precise definition of constant-expression, and we must honor
9680 that, even though it is somewhat more restrictive.
9682 For example:
9684 int i[(2, 3)];
9686 is not a legal declaration, because `(2, 3)' is not a
9687 constant-expression. The `,' operator is forbidden in a
9688 constant-expression. However, GCC's constant-folding machinery
9689 will fold this operation to an INTEGER_CST for `3'. */
9691 /* Save the old settings. */
9693 saved_allow_non_integral_constant_expression_p
9696 /* We are now parsing a constant-expression. */
9698 parser->allow_non_integral_constant_expression_p
9701 /* Although the grammar says "conditional-expression", when not STRICT_P,
9702 we parse an "assignment-expression", which also permits
9703 "throw-expression" and the use of assignment operators. In the case
9704 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9705 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9706 actually essential that we look for an assignment-expression.
9707 For example, cp_parser_initializer_clauses uses this function to
9708 determine whether a particular assignment-expression is in fact
9709 constant. */
9711 {
9712 /* Parse the binary expressions (logical-or-expression). */
9715 /* If the next token is a `?' then we're actually looking at
9716 a conditional-expression; otherwise we're done. */
9719 }
9720 else
9722 /* Restore the old settings. */
9723 parser->integral_constant_expression_p
9725 parser->allow_non_integral_constant_expression_p
9728 {
9729 /* Require an rvalue constant expression here; that's what our
9730 callers expect. Reference constant expressions are handled
9731 separately in e.g. cp_parser_template_argument. */
9740 }
9743 parser->non_integral_constant_expression_p
9747 }
9749 /* Parse __builtin_offsetof.
9751 offsetof-expression:
9752 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9754 offsetof-member-designator:
9755 id-expression
9756 | offsetof-member-designator "." id-expression
9757 | offsetof-member-designator "[" expression "]"
9758 | offsetof-member-designator "->" id-expression */
9760 static cp_expr
9762 {
9764 tree type;
9765 cp_expr expr;
9766 cp_id_kind dummy;
9768 location_t finish_loc;
9770 /* We're about to accept non-integral-constant things, but will
9771 definitely yield an integral constant expression. Save and
9772 restore these values around our local parsing. */
9778 /* Consume the "__builtin_offsetof" token. */
9780 /* Consume the opening `('. */
9781 matching_parens parens;
9783 /* Parse the type-id. */
9786 /* Look for the `,'. */
9790 /* Build the (type *)null that begins the traditional offsetof macro. */
9791 tree object_ptr
9793 tf_warning_or_error);
9795 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9799 {
9802 {
9804 /* offsetof-member-designator "[" expression "]" */
9810 /* offsetof-member-designator "->" identifier */
9813 /* FALLTHRU */
9816 /* offsetof-member-designator "." identifier */
9824 /* Consume the ")" token. */
9830 /* Error. We know the following require will fail, but
9831 that gives the proper error message. */
9836 }
9837 }
9839 success:
9840 /* Make a location of the form:
9841 __builtin_offsetof (struct s, f)
9842 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9843 with caret at the type-id, ranging from the start of the
9844 "_builtin_offsetof" token to the close paren. */
9846 /* The result will be an INTEGER_CST, so we need to explicitly
9847 preserve the location. */
9850 failure:
9856 }
9858 /* Parse a trait expression.
9860 Returns a representation of the expression, the underlying type
9861 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9863 static cp_expr
9865 {
9866 cp_trait_kind kind;
9872 {
9974 }
9976 /* Get location of initial token. */
9979 /* Consume the token. */
9982 matching_parens parens;
9985 {
9988 }
9994 {
9997 {
10000 }
10004 }
10006 {
10008 {
10012 {
10015 }
10019 }
10020 }
10025 /* Construct a location of the form:
10026 __is_trivially_copyable(_Tp)
10027 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10028 with start == caret, finishing at the close-paren. */
10031 /* Complete the trait expression, which may mean either processing
10032 the trait expr now or saving it for template instantiation. */
10034 {
10043 }
10044 }
10046 /* Parse a lambda expression.
10048 lambda-expression:
10049 lambda-introducer lambda-declarator [opt] compound-statement
10051 Returns a representation of the expression. */
10053 static cp_expr
10055 {
10057 tree type;
10065 {
10067 {
10071 }
10073 }
10075 {
10077 {
10080 }
10082 }
10084 /* We may be in the middle of deferred access check. Disable
10085 it now. */
10096 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10099 /* Now that we've started the type, add the capture fields for any
10100 explicit captures. */
10103 {
10104 /* Inside the class, surrounding template-parameter-lists do not apply. */
10105 unsigned int saved_num_template_parameter_lists
10109 bool fully_implicit_function_template_p
10113 bool auto_is_implicit_function_template_parm_p
10124 /* By virtue of defining a local class, a lambda expression has access to
10125 the private variables of enclosing classes. */
10133 {
10138 }
10140 {
10143 }
10145 /* The capture list was built up in reverse order; fix that now. */
10157 parser->fully_implicit_function_template_p
10161 parser->auto_is_implicit_function_template_parm_p
10163 }
10165 /* This field is only used during parsing of the lambda. */
10168 /* This lambda shouldn't have any proxies left at this point. */
10170 /* And now that we're done, push proxies for an enclosing lambda. */
10175 else
10183 }
10185 /* Parse the beginning of a lambda expression.
10187 lambda-introducer:
10188 [ lambda-capture [opt] ]
10190 LAMBDA_EXPR is the current representation of the lambda expression. */
10192 static void
10194 {
10195 /* Need commas after the first capture. */
10198 /* Eat the leading `['. */
10201 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10209 {
10212 }
10215 {
10217 tree capture_id;
10218 tree capture_init_expr;
10222 enum capture_kind_type
10223 {
10224 BY_COPY,
10225 BY_REFERENCE
10226 };
10230 {
10233 }
10237 else
10240 /* Possibly capture `this'. */
10242 {
10253 explicit_init_p);
10255 }
10257 /* Possibly capture `*this'. */
10260 {
10271 explicit_init_p);
10273 }
10275 /* Remember whether we want to capture as a reference or not. */
10277 {
10280 }
10282 /* Get the identifier. */
10287 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10288 delimiters, but I modified this to stop on unnested ']' as well. It
10289 was already changed to stop on unnested '}', so the
10290 "closing_parenthesis" name is no more misleading with my change. */
10291 {
10297 }
10299 /* Find the initializer for this capture. */
10303 {
10305 /* An explicit initializer exists. */
10308 "lambda capture initializers "
10314 {
10317 }
10318 }
10319 else
10320 {
10323 /* Turn the identifier into an id-expression. */
10324 capture_init_expr
10329 {
10332 }
10336 {
10339 capture_init_expr);
10343 }
10346 {
10349 capture_init_expr))
10353 }
10355 capture_init_expr
10356 = finish_id_expression
10358 capture_init_expr,
10372 {
10375 }
10376 else
10378 }
10382 {
10387 capture_id);
10391 "capture of %qD redundant with by-reference capture "
10393 }
10396 capture_id,
10397 capture_init_expr,
10399 explicit_init_p);
10400 }
10403 }
10405 /* Parse the (optional) middle of a lambda expression.
10407 lambda-declarator:
10408 < template-parameter-list [opt] >
10409 ( parameter-declaration-clause [opt] )
10410 attribute-specifier [opt]
10411 decl-specifier-seq [opt]
10412 exception-specification [opt]
10413 lambda-return-type-clause [opt]
10415 LAMBDA_EXPR is the current representation of the lambda expression. */
10417 static bool
10419 {
10420 /* 5.1.1.4 of the standard says:
10421 If a lambda-expression does not include a lambda-declarator, it is as if
10422 the lambda-declarator were ().
10423 This means an empty parameter list, no attributes, and no exception
10424 specification. */
10431 cp_decl_specifier_seq lambda_specs;
10434 /* The template-parameter-list is optional, but must begin with
10435 an opening angle if present. */
10437 {
10440 "lambda templates are only available with "
10444 "lambda templates are only available with "
10453 /* We just processed one more parameter list. */
10455 }
10457 /* The parameter-declaration-clause is optional (unless
10458 template-parameter-list was given), but must begin with an
10459 opening parenthesis if present. */
10461 {
10462 matching_parens parens;
10467 /* Parse parameters. */
10470 /* Default arguments shall not be specified in the
10471 parameter-declaration-clause of a lambda-declarator. */
10482 /* In the decl-specifier-seq of the lambda-declarator, each
10483 decl-specifier shall either be mutable or constexpr. */
10487 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10490 {
10495 }
10499 /* Parse optional exception specification. */
10502 /* Parse optional trailing return type. */
10504 {
10507 }
10509 /* The function parameters must be in scope all the way until after the
10510 trailing-return-type in case of decltype. */
10512 }
10516 /* Create the function call operator.
10518 Messing with declarators like this is no uglier than building up the
10519 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10520 other code. */
10521 {
10522 cp_decl_specifier_seq return_type_specs;
10524 tree fco;
10531 else
10532 /* Maybe we will deduce the return type later. */
10536 {
10540 else
10543 }
10552 VIRT_SPEC_UNSPECIFIED,
10553 REF_QUAL_NONE,
10554 tx_qual,
10555 exception_spec,
10561 declarator,
10562 attributes);
10564 {
10567 /* Give the object parameter a different name. */
10571 }
10573 {
10577 }
10586 }
10587 }
10589 /* Parse the body of a lambda expression, which is simply
10591 compound-statement
10593 but which requires special handling.
10594 LAMBDA_EXPR is the current representation of the lambda expression. */
10596 static void
10598 {
10605 else
10606 /* Still increment function_depth so that we don't GC in the
10607 middle of an expression. */
10612 /* Clear this in case we're in the middle of a default argument. */
10616 {
10620 matching_braces braces;
10623 {
10626 /* Originally C++11 required us to peek for 'return expr'; and
10627 process it specially here to deduce the return type. N3638
10628 removed the need for that. */
10636 }
10639 }
10646 else
10648 }
10650 /* Statements [gram.stmt.stmt] */
10652 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10654 static void
10656 {
10663 }
10665 /* Parse a statement.
10667 statement:
10668 labeled-statement
10669 expression-statement
10670 compound-statement
10671 selection-statement
10672 iteration-statement
10673 jump-statement
10674 declaration-statement
10675 try-block
10677 C++11:
10679 statement:
10680 labeled-statement
10681 attribute-specifier-seq (opt) expression-statement
10682 attribute-specifier-seq (opt) compound-statement
10683 attribute-specifier-seq (opt) selection-statement
10684 attribute-specifier-seq (opt) iteration-statement
10685 attribute-specifier-seq (opt) jump-statement
10686 declaration-statement
10687 attribute-specifier-seq (opt) try-block
10689 init-statement:
10690 expression-statement
10691 simple-declaration
10693 TM Extension:
10695 statement:
10696 atomic-statement
10698 IN_COMPOUND is true when the statement is nested inside a
10699 cp_parser_compound_statement; this matters for certain pragmas.
10701 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10702 is a (possibly labeled) if statement which is not enclosed in braces
10703 and has an else clause. This is used to implement -Wparentheses.
10705 CHAIN is a vector of if-else-if conditions. */
10707 static void
10711 {
10716 restart:
10719 /* There is no statement yet. */
10725 /* In obj-c++, seeing '[[' might be the either the beginning of
10726 c++11 attributes, or a nested objc-message-expression. So
10727 let's parse the c++11 attributes tentatively. */
10731 {
10734 }
10736 /* Peek at the next token. */
10738 /* Remember the location of the first token in the statement. */
10741 /* If this is a keyword, then that will often determine what kind of
10742 statement we have. */
10744 {
10748 {
10751 /* Looks like a labeled-statement with a case label.
10752 Parse the label, and then use tail recursion to parse
10753 the statement. */
10776 /* Objective-C++ exception-handling constructs. */
10790 /* This must be a namespace alias definition. */
10806 /* It might be a keyword like `int' that can start a
10807 declaration-statement. */
10809 }
10810 }
10812 {
10813 /* If the next token is a `:', then we are looking at a
10814 labeled-statement. */
10817 {
10818 /* Looks like a labeled-statement with an ordinary label.
10819 Parse the label, and then use tail recursion to parse
10820 the statement. */
10825 }
10826 }
10827 /* Anything that starts with a `{' must be a compound-statement. */
10830 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10831 a statement all its own. */
10833 {
10834 /* Only certain OpenMP pragmas are attached to statements, and thus
10835 are considered statements themselves. All others are not. In
10836 the context of a compound, accept the pragma as a "statement" and
10837 return so that we can check for a close brace. Otherwise we
10838 require a real statement and must go back and read one. */
10844 }
10846 {
10849 }
10851 /* Everything else must be a declaration-statement or an
10852 expression-statement. Try for the declaration-statement
10853 first, unless we are looking at a `;', in which case we know that
10854 we have an expression-statement. */
10856 {
10858 {
10860 {
10861 /* Attributes should be parsed as part of the the
10862 declaration, so let's un-parse them. */
10865 }
10868 /* Try to parse the declaration-statement. */
10870 /* If that worked, we're done. */
10873 }
10874 /* All preceding labels have been parsed at this point. */
10878 /* Look for an expression-statement instead. */
10881 /* Handle [[fallthrough]];. */
10883 {
10884 /* The next token after the fallthrough attribute is ';'. */
10886 {
10887 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10889 IFN_FALLTHROUGH,
10892 }
10893 else
10897 }
10898 }
10900 /* Set the line number for the statement. */
10904 /* Allow "[[fallthrough]];", but warn otherwise. */
10907 OPT_Wattributes,
10909 }
10911 /* Append ATTR to attribute list ATTRS. */
10913 static tree
10915 {
10921 }
10923 /* Parse the label for a labeled-statement, i.e.
10925 identifier :
10926 case constant-expression :
10927 default :
10929 GNU Extension:
10930 case constant-expression ... constant-expression : statement
10932 When a label is parsed without errors, the label is added to the
10933 parse tree by the finish_* functions, so this function doesn't
10934 have to return the label. */
10936 static void
10938 {
10943 /* The next token should be an identifier. */
10947 {
10950 }
10952 /* Remember whether this case or a user-defined label is allowed to fall
10953 through to. */
10958 {
10960 {
10964 /* Consume the `case' token. */
10966 /* Parse the constant-expression. */
10973 {
10974 /* Consume the `...' token. */
10980 /* We don't need to emit warnings here, as the common code
10981 will do this for us. */
10982 }
10983 else
10987 {
10991 }
10992 else
10995 expr);
10996 }
11000 /* Consume the `default' token. */
11004 {
11008 }
11009 else
11014 /* Anything else must be an ordinary label. */
11019 }
11021 /* Require the `:' token. */
11024 /* An ordinary label may optionally be followed by attributes.
11025 However, this is only permitted if the attributes are then
11026 followed by a semicolon. This is because, for backward
11027 compatibility, when parsing
11028 lab: __attribute__ ((unused)) int i;
11029 we want the attribute to attach to "i", not "lab". */
11032 {
11033 tree attrs;
11040 ;
11041 else
11043 }
11049 }
11051 /* Parse an expression-statement.
11053 expression-statement:
11054 expression [opt] ;
11056 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11057 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11058 indicates whether this expression-statement is part of an
11059 expression statement. */
11061 static tree
11063 {
11068 /* There might be attribute fallthrough. */
11071 /* If the next token is a ';', then there is no expression
11072 statement. */
11074 {
11078 {
11081 }
11082 }
11084 /* Handle [[fallthrough]];. */
11086 {
11087 /* The next token after the fallthrough attribute is ';'. */
11089 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11092 else
11096 }
11098 /* Allow "[[fallthrough]];", but warn otherwise. */
11103 /* Give a helpful message for "A<T>::type t;" and the like. */
11106 {
11113 {
11114 /* A::A a; */
11119 }
11120 }
11122 /* Consume the final `;'. */
11127 /* This is the final expression statement of a statement
11128 expression. */
11134 }
11136 /* Parse a compound-statement.
11138 compound-statement:
11139 { statement-seq [opt] }
11141 GNU extension:
11143 compound-statement:
11144 { label-declaration-seq [opt] statement-seq [opt] }
11146 label-declaration-seq:
11147 label-declaration
11148 label-declaration-seq label-declaration
11150 Returns a tree representing the statement. */
11152 static tree
11155 {
11156 tree compound_stmt;
11157 matching_braces braces;
11159 /* Consume the `{'. */
11166 /* Begin the compound-statement. */
11168 /* If the next keyword is `__label__' we have a label declaration. */
11171 /* Parse an (optional) statement-seq. */
11173 /* Finish the compound-statement. */
11175 /* Consume the `}'. */
11179 }
11181 /* Parse an (optional) statement-seq.
11183 statement-seq:
11184 statement
11185 statement-seq [opt] statement */
11187 static void
11189 {
11190 /* Scan statements until there aren't any more. */
11192 {
11195 /* If we are looking at a `}', then we have run out of
11196 statements; the same is true if we have reached the end
11197 of file, or have stumbled upon a stray '@end'. */
11204 /* If we are in a compound statement and find 'else' then
11205 something went wrong. */
11207 {
11210 else
11211 {
11214 }
11215 }
11217 /* Parse the statement. */
11219 }
11220 }
11222 /* Return true if we're looking at (init; cond), false otherwise. */
11224 static bool
11226 {
11227 /* Save tokens so that we can put them back. */
11230 /* Look for ';' that is not nested in () or {}. */
11233 CPP_SEMICOLON,
11236 /* Roll back the tokens we skipped. */
11240 }
11242 /* Parse a selection-statement.
11244 selection-statement:
11245 if ( init-statement [opt] condition ) statement
11246 if ( init-statement [opt] condition ) statement else statement
11247 switch ( init-statement [opt] condition ) statement
11249 Returns the new IF_STMT or SWITCH_STMT.
11251 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11252 is a (possibly labeled) if statement which is not enclosed in
11253 braces and has an else clause. This is used to implement
11254 -Wparentheses.
11256 CHAIN is a vector of if-else-if conditions. This is used to implement
11257 -Wduplicated-cond. */
11259 static tree
11262 {
11265 token_indent_info guard_tinfo;
11270 /* Peek at the next token. */
11274 /* See what kind of keyword it is. */
11277 {
11280 {
11281 tree statement;
11282 tree condition;
11287 RID_CONSTEXPR))
11288 {
11294 }
11296 /* Look for the `('. */
11297 matching_parens parens;
11299 {
11302 }
11304 /* Begin the selection-statement. */
11306 {
11309 }
11310 else
11313 /* Parse the optional init-statement. */
11315 {
11316 tree decl;
11319 "init-statement in selection statements only available "
11322 }
11324 /* Parse the condition. */
11326 /* Look for the `)'. */
11332 {
11336 /* Add the condition. */
11343 /* Parse the then-clause. */
11347 /* Outside a template, the non-selected branch of a constexpr
11348 if is a 'discarded statement', i.e. unevaluated. */
11353 {
11356 }
11359 guard_tinfo);
11366 {
11370 }
11372 /* If the next token is `else', parse the else-clause. */
11374 RID_ELSE))
11375 {
11379 {
11382 }
11384 guard_tinfo
11386 /* Consume the `else' keyword. */
11389 {
11391 RID_IF)
11393 {
11394 /* We've got "if (COND) else if (COND2)". Start
11395 the condition chain and add COND as the first
11396 element. */
11400 {
11401 /* Wrap it in a NOP_EXPR so that we can set the
11402 location of the condition. */
11404 condition);
11407 }
11408 }
11410 RID_IF))
11411 {
11412 /* This is if-else without subsequent if. Zap the
11413 condition chain; we would have already warned at
11414 this point. */
11417 }
11418 }
11420 /* Parse the else-clause. */
11426 /* If we are currently parsing a then-clause, then
11427 IF_P will not be NULL. We set it to true to
11428 indicate that this if statement has an else clause.
11429 This may trigger the Wparentheses warning below
11430 when we get back up to the parent if statement. */
11435 {
11439 }
11440 }
11441 else
11442 {
11443 /* This if statement does not have an else clause. If
11444 NESTED_IF is true, then the then-clause has an if
11445 statement which does have an else clause. We warn
11446 about the potential ambiguity. */
11449 "suggest explicit braces to avoid ambiguous"
11452 {
11453 /* We don't need the condition chain anymore. */
11456 }
11457 }
11459 /* Now we're all done with the if-statement. */
11461 }
11462 else
11463 {
11467 /* Add the condition. */
11470 /* Parse the body of the switch-statement. */
11476 guard_tinfo);
11480 /* Now we're all done with the switch-statement. */
11482 }
11485 }
11491 }
11492 }
11494 /* Parse a condition.
11496 condition:
11497 expression
11498 type-specifier-seq declarator = initializer-clause
11499 type-specifier-seq declarator braced-init-list
11501 GNU Extension:
11503 condition:
11504 type-specifier-seq declarator asm-specification [opt]
11505 attributes [opt] = assignment-expression
11507 Returns the expression that should be tested. */
11509 static tree
11511 {
11512 cp_decl_specifier_seq type_specifiers;
11516 /* Try the declaration first. */
11518 /* New types are not allowed in the type-specifier-seq for a
11519 condition. */
11521 parser->type_definition_forbidden_message
11523 /* Parse the type-specifier-seq. */
11525 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11528 /* Restore the saved message. */
11530 /* If all is well, we might be looking at a declaration. */
11532 {
11533 tree decl;
11534 tree asm_specification;
11535 tree attributes;
11539 /* Parse the declarator. */
11545 /* Parse the attributes. */
11547 /* Parse the asm-specification. */
11549 /* If the next token is not an `=' or '{', then we might still be
11550 looking at an expression. For example:
11552 if (A(a).x)
11554 looks like a decl-specifier-seq and a declarator -- but then
11555 there is no `=', so this is an expression. */
11560 /* If we did see an `=' or '{', then we are looking at a declaration
11561 for sure. */
11563 {
11564 tree pushed_scope;
11568 /* Create the declaration. */
11574 /* Parse the initializer. */
11576 {
11580 }
11581 else
11582 {
11583 /* Consume the `='. */
11586 }
11590 /* Process the initializer. */
11593 asm_specification,
11594 flags);
11600 }
11601 }
11602 /* If we didn't even get past the declarator successfully, we are
11603 definitely not looking at a declaration. */
11604 else
11607 /* Otherwise, we are looking at an expression. */
11609 }
11611 /* Parses a for-statement or range-for-statement until the closing ')',
11612 not included. */
11614 static tree
11616 {
11620 /* Begin the for-statement. */
11623 /* Parse the initialization. */
11628 else
11630 }
11632 static tree
11635 {
11636 /* Normal for loop */
11639 tree stmt;
11642 /* The init-statement has already been parsed in
11643 cp_parser_init_statement, so no work is needed here. */
11646 /* If there's a condition, process it. */
11650 {
11654 }
11656 {
11660 }
11662 /* Look for the `;'. */
11665 /* If there's an expression, process it. */
11671 }
11673 /* Tries to parse a range-based for-statement:
11675 range-based-for:
11676 decl-specifier-seq declarator : expression
11678 The decl-specifier-seq declarator and the `:' are already parsed by
11679 cp_parser_init_statement. If processing_template_decl it returns a
11680 newly created RANGE_FOR_STMT; if not, it is converted to a
11681 regular FOR_STMT. */
11683 static tree
11686 {
11693 /* Get the range declaration momentarily out of the way so that
11694 the range expression doesn't clash with it. */
11696 {
11698 {
11700 /* For decomposition declaration get all of the corresponding
11701 declarations out of the way. */
11705 {
11711 {
11717 }
11718 }
11719 }
11721 {
11726 }
11727 }
11730 {
11733 }
11734 else
11737 /* Put the range declaration(s) back into scope. */
11739 {
11743 }
11745 /* If in template, STMT is converted to a normal for-statement
11746 at instantiation. If not, it is done just ahead. */
11748 {
11758 /* do_auto_deduction doesn't mess with template init-lists. */
11761 }
11762 else
11763 {
11767 unroll);
11768 }
11770 }
11772 /* Subroutine of cp_convert_range_for: given the initializer expression,
11773 builds up the range temporary. */
11775 static tree
11777 {
11780 /* Find out the type deduced by the declaration
11781 `auto &&__range = range_expr'. */
11786 /* Create the __range variable. */
11793 }
11795 /* Used by cp_parser_range_for in template context: we aren't going to
11796 do a full conversion yet, but we still need to resolve auto in the
11797 type of the for-range-declaration if present. This is basically
11798 a shortcut version of cp_convert_range_for. */
11800 static void
11802 {
11805 {
11808 iter_type = (cp_parser_perform_range_for_lookup
11811 {
11813 iter_type);
11815 RO_UNARY_STAR,
11816 tf_warning_or_error);
11819 }
11820 }
11821 }
11823 /* Converts a range-based for-statement into a normal
11824 for-statement, as per the definition.
11826 for (RANGE_DECL : RANGE_EXPR)
11827 BLOCK
11829 should be equivalent to:
11831 {
11832 auto &&__range = RANGE_EXPR;
11833 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11834 __begin != __end;
11835 ++__begin)
11836 {
11837 RANGE_DECL = *__begin;
11838 BLOCK
11839 }
11840 }
11842 If RANGE_EXPR is an array:
11843 BEGIN_EXPR = __range
11844 END_EXPR = __range + ARRAY_SIZE(__range)
11845 Else if RANGE_EXPR has a member 'begin' or 'end':
11846 BEGIN_EXPR = __range.begin()
11847 END_EXPR = __range.end()
11848 Else:
11849 BEGIN_EXPR = begin(__range)
11850 END_EXPR = end(__range);
11852 If __range has a member 'begin' but not 'end', or vice versa, we must
11853 still use the second alternative (it will surely fail, however).
11854 When calling begin()/end() in the third alternative we must use
11855 argument dependent lookup, but always considering 'std' as an associated
11856 namespace. */
11858 tree
11862 {
11870 /* If an error happened previously do nothing or else a lot of
11871 unhelpful errors would be issued. */
11873 else
11874 {
11875 tree range_temp;
11879 /* Can't bind a reference to an array of runtime bound. */
11881 else
11882 {
11887 LOOKUP_ONLYCONVERTING);
11889 }
11892 }
11894 /* The new for initialization statement. */
11902 LOOKUP_ONLYCONVERTING);
11913 LOOKUP_ONLYCONVERTING);
11917 /* The new for condition. */
11924 /* The new increment expression. */
11927 tf_warning_or_error);
11933 /* The declaration is initialized with *__begin inside the loop body. */
11936 tf_warning_or_error),
11938 LOOKUP_ONLYCONVERTING);
11943 }
11945 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11946 We need to solve both at the same time because the method used
11947 depends on the existence of members begin or end.
11948 Returns the type deduced for the iterator expression. */
11950 static tree
11952 {
11954 {
11957 }
11960 {
11965 }
11967 {
11968 /* If RANGE is an array, we will use pointer arithmetic. */
11971 range,
11975 }
11976 else
11977 {
11978 /* If it is not an array, we must do a bit of magic. */
11988 tf_warning_or_error);
11991 tf_warning_or_error);
11994 {
11995 /* Use the member functions. */
11998 else
12004 else
12007 }
12008 else
12009 {
12010 /* Use global functions with ADL. */
12017 tf_warning_or_error);
12019 tf_warning_or_error);
12021 tf_warning_or_error);
12023 tf_warning_or_error);
12026 }
12028 /* Last common checks. */
12030 {
12031 /* If one of the expressions is an error do no more checks. */
12034 }
12037 /* Can happen, when, eg, in a template context, Koenig lookup
12038 can't resolve begin/end (c++/58503). */
12040 else
12041 {
12043 /* The unqualified type of the __begin and __end temporaries should
12044 be the same, as required by the multiple auto declaration. */
12046 {
12053 /* P0184R0 allows __begin and __end to have different types,
12054 but make sure they are comparable so we can give a better
12056 else
12060 }
12062 }
12063 }
12064 }
12066 /* Helper function for cp_parser_perform_range_for_lookup.
12067 Builds a tree for RANGE.IDENTIFIER(). */
12069 static tree
12071 {
12084 tf_warning_or_error);
12087 }
12089 /* Parse an iteration-statement.
12091 iteration-statement:
12092 while ( condition ) statement
12093 do statement while ( expression ) ;
12094 for ( init-statement condition [opt] ; expression [opt] )
12095 statement
12097 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12099 static tree
12102 {
12105 tree statement;
12107 token_indent_info guard_tinfo;
12109 /* Peek at the next token. */
12116 /* Remember whether or not we are already within an iteration
12117 statement. */
12120 /* See what kind of keyword it is. */
12123 {
12125 {
12126 tree condition;
12128 /* Begin the while-statement. */
12130 /* Look for the `('. */
12131 matching_parens parens;
12133 /* Parse the condition. */
12136 /* Look for the `)'. */
12138 /* Parse the dependent statement. */
12144 /* We're done with the while-statement. */
12146 }
12150 {
12151 tree expression;
12153 /* Begin the do-statement. */
12155 /* Parse the body of the do-statement. */
12162 /* Look for the `while' keyword. */
12164 /* Look for the `('. */
12165 matching_parens parens;
12167 /* Parse the expression. */
12169 /* We're done with the do-statement. */
12171 /* Look for the `)'. */
12173 /* Look for the `;'. */
12175 }
12179 {
12180 /* Look for the `('. */
12181 matching_parens parens;
12186 /* Look for the `)'. */
12189 /* Parse the body of the for-statement. */
12196 /* We're done with the for-statement. */
12198 }
12205 }
12208 }
12210 /* Parse a init-statement or the declarator of a range-based-for.
12211 Returns true if a range-based-for declaration is seen.
12213 init-statement:
12214 expression-statement
12215 simple-declaration */
12217 static bool
12219 {
12220 /* If the next token is a `;', then we have an empty
12221 expression-statement. Grammatically, this is also a
12222 simple-declaration, but an invalid one, because it does not
12223 declare anything. Therefore, if we did not handle this case
12224 specially, we would issue an error message about an invalid
12225 declaration. */
12227 {
12231 /* A colon is used in range-based for. */
12234 /* We're going to speculatively look for a declaration, falling back
12235 to an expression, if necessary. */
12237 /* Parse the declaration. */
12240 decl);
12243 {
12244 /* It is a range-for, consume the ':' */
12248 {
12250 "range-based %<for%> loops only available with "
12253 }
12254 }
12255 else
12256 /* The ';' is not consumed yet because we told
12257 cp_parser_simple_declaration not to. */
12262 /* If the tentative parse failed, then we shall need to look for an
12263 expression-statement. */
12264 }
12265 /* If we are here, it is an expression-statement. */
12268 }
12270 /* Parse a jump-statement.
12272 jump-statement:
12273 break ;
12274 continue ;
12275 return expression [opt] ;
12276 return braced-init-list ;
12277 goto identifier ;
12279 GNU extension:
12281 jump-statement:
12282 goto * expression ;
12284 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12286 static tree
12288 {
12294 /* Peek at the next token. */
12299 /* See what kind of keyword it is. */
12302 {
12306 {
12323 }
12329 {
12333 /* Fall through. */
12343 }
12348 {
12349 tree expr;
12353 {
12357 }
12360 else
12361 /* If the next token is a `;', then there is no
12362 expression. */
12364 /* Build the return-statement. */
12367 else
12369 /* Look for the final `;'. */
12371 }
12377 {
12380 }
12382 /* Create the goto-statement. */
12384 {
12385 /* Issue a warning about this use of a GNU extension. */
12387 /* Consume the '*' token. */
12389 /* Parse the dependent expression. */
12391 }
12392 else
12394 /* Look for the final `;'. */
12401 }
12404 }
12406 /* Parse a declaration-statement.
12408 declaration-statement:
12409 block-declaration */
12411 static void
12413 {
12416 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12419 /* Parse the block-declaration. */
12422 /* Free any declarators allocated. */
12424 }
12426 /* Some dependent statements (like `if (cond) statement'), are
12427 implicitly in their own scope. In other words, if the statement is
12428 a single statement (as opposed to a compound-statement), it is
12429 none-the-less treated as if it were enclosed in braces. Any
12430 declarations appearing in the dependent statement are out of scope
12431 after control passes that point. This function parses a statement,
12432 but ensures that is in its own scope, even if it is not a
12433 compound-statement.
12435 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12436 is a (possibly labeled) if statement which is not enclosed in
12437 braces and has an else clause. This is used to implement
12438 -Wparentheses.
12440 CHAIN is a vector of if-else-if conditions. This is used to implement
12441 -Wduplicated-cond.
12443 Returns the new statement. */
12445 static tree
12449 {
12450 tree statement;
12453 token_indent_info body_tinfo
12459 /* Mark if () ; with a special NOP_EXPR. */
12461 {
12472 }
12473 /* if a compound is opened, we simply parse the statement directly. */
12476 /* If the token is not a `{', then we must take special action. */
12477 else
12478 {
12479 /* Create a compound-statement. */
12481 /* Parse the dependent-statement. */
12484 /* Finish the dummy compound-statement. */
12486 }
12488 token_indent_info next_tinfo
12497 /* Return the statement. */
12499 }
12501 /* For some dependent statements (like `while (cond) statement'), we
12502 have already created a scope. Therefore, even if the dependent
12503 statement is a compound-statement, we do not want to create another
12504 scope. */
12506 static void
12509 {
12510 /* If the token is a `{', then we must take special action. */
12512 {
12513 token_indent_info body_tinfo
12519 token_indent_info next_tinfo
12528 }
12529 else
12530 {
12531 /* Avoid calling cp_parser_compound_statement, so that we
12532 don't create a new scope. Do everything else by hand. */
12533 matching_braces braces;
12535 /* If the next keyword is `__label__' we have a label declaration. */
12538 /* Parse an (optional) statement-seq. */
12541 }
12542 }
12544 /* Declarations [gram.dcl.dcl] */
12546 /* Parse an optional declaration-sequence.
12548 declaration-seq:
12549 declaration
12550 declaration-seq declaration */
12552 static void
12554 {
12556 {
12567 {
12568 /* A declaration consisting of a single semicolon is
12569 invalid. Allow it unless we're being pedantic. */
12574 }
12576 /* If we're entering or exiting a region that's implicitly
12577 extern "C", modify the lang context appropriately. */
12579 {
12582 }
12584 {
12587 }
12590 {
12591 /* A top-level declaration can consist solely of a #pragma.
12592 A nested declaration cannot, so this is done here and not
12593 in cp_parser_declaration. (A #pragma at block scope is
12594 handled in cp_parser_statement.) */
12597 }
12599 /* Parse the declaration itself. */
12601 }
12602 }
12604 /* Parse a declaration.
12606 declaration:
12607 block-declaration
12608 function-definition
12609 template-declaration
12610 explicit-instantiation
12611 explicit-specialization
12612 linkage-specification
12613 namespace-definition
12615 C++17:
12616 deduction-guide
12618 GNU extension:
12620 declaration:
12621 __extension__ declaration */
12623 static void
12625 {
12626 cp_token token1;
12627 cp_token token2;
12632 /* Check for the `__extension__' keyword. */
12634 {
12635 /* Parse the qualified declaration. */
12637 /* Restore the PEDANTIC flag. */
12641 }
12643 /* Try to figure out what kind of declaration is present. */
12648 else
12649 {
12652 }
12654 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12657 /* If the next token is `extern' and the following token is a string
12658 literal, then we have a linkage specification. */
12662 /* If the next token is `template', then we have either a template
12663 declaration, an explicit instantiation, or an explicit
12664 specialization. */
12666 {
12667 /* `template <>' indicates a template specialization. */
12671 /* `template <' indicates a template declaration. */
12674 /* Anything else must be an explicit instantiation. */
12675 else
12677 }
12678 /* If the next token is `export', then we have a template
12679 declaration. */
12682 /* If the next token is `extern', 'static' or 'inline' and the one
12683 after that is `template', we have a GNU extended explicit
12684 instantiation directive. */
12691 /* If the next token is `namespace', check for a named or unnamed
12692 namespace definition. */
12701 /* An unnamed namespace definition. */
12705 /* An inline (associated) namespace definition. */
12709 /* Objective-C++ declaration/definition. */
12716 /* At this point we may have a template declared by a concept
12717 introduction. */
12722 else
12723 /* Try to parse a block-declaration, or a function-definition. */
12726 /* Free any declarators allocated. */
12728 }
12730 /* Parse a block-declaration.
12732 block-declaration:
12733 simple-declaration
12734 asm-definition
12735 namespace-alias-definition
12736 using-declaration
12737 using-directive
12739 GNU Extension:
12741 block-declaration:
12742 __extension__ block-declaration
12744 C++0x Extension:
12746 block-declaration:
12747 static_assert-declaration
12749 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12750 part of a declaration-statement. */
12752 static void
12755 {
12759 /* Check for the `__extension__' keyword. */
12761 {
12762 /* Parse the qualified declaration. */
12764 /* Restore the PEDANTIC flag. */
12768 }
12770 /* Peek at the next token to figure out which kind of declaration is
12771 present. */
12774 /* If the next keyword is `asm', we have an asm-definition. */
12776 {
12780 }
12781 /* If the next keyword is `namespace', we have a
12782 namespace-alias-definition. */
12785 /* If the next keyword is `using', we have a
12786 using-declaration, a using-directive, or an alias-declaration. */
12788 {
12793 /* If the token after `using' is `namespace', then we have a
12794 using-directive. */
12798 /* If the second token after 'using' is '=', then we have an
12799 alias-declaration. */
12805 /* Otherwise, it's a using-declaration. */
12806 else
12809 }
12810 /* If the next keyword is `__label__' we have a misplaced label
12811 declaration. */
12813 {
12817 /* If the next token is now a `;', consume it. */
12820 }
12821 /* If the next token is `static_assert' we have a static assertion. */
12824 /* Anything else must be a simple-declaration. */
12825 else
12828 }
12830 /* Parse a simple-declaration.
12832 simple-declaration:
12833 decl-specifier-seq [opt] init-declarator-list [opt] ;
12834 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12835 brace-or-equal-initializer ;
12837 init-declarator-list:
12838 init-declarator
12839 init-declarator-list , init-declarator
12841 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12842 function-definition as a simple-declaration.
12844 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12845 parsed declaration if it is an uninitialized single declarator not followed
12846 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12847 if present, will not be consumed. */
12849 static void
12853 {
12854 cp_decl_specifier_seq decl_specifiers;
12863 /* Defer access checks until we know what is being declared; the
12864 checks for names appearing in the decl-specifier-seq should be
12865 done as if we were in the scope of the thing being declared. */
12868 /* Parse the decl-specifier-seq. We have to keep track of whether
12869 or not the decl-specifier-seq declares a named class or
12870 enumeration type, since that is the only case in which the
12871 init-declarator-list is allowed to be empty.
12873 [dcl.dcl]
12875 In a simple-declaration, the optional init-declarator-list can be
12876 omitted only when declaring a class or enumeration, that is when
12877 the decl-specifier-seq contains either a class-specifier, an
12878 elaborated-type-specifier, or an enum-specifier. */
12880 CP_PARSER_FLAGS_OPTIONAL,
12883 /* We no longer need to defer access checks. */
12886 /* In a block scope, a valid declaration must always have a
12887 decl-specifier-seq. By not trying to parse declarators, we can
12888 resolve the declaration/expression ambiguity more quickly. */
12891 {
12894 }
12896 /* If the next two tokens are both identifiers, the code is
12897 erroneous. The usual cause of this situation is code like:
12899 T t;
12901 where "T" should name a type -- but does not. */
12904 {
12905 /* If parsing tentatively, we should commit; we really are
12906 looking at a declaration. */
12908 /* Give up. */
12910 }
12912 /* If we have seen at least one decl-specifier, and the next token
12913 is not a parenthesis, then we must be looking at a declaration.
12914 (After "int (" we might be looking at a functional cast.) */
12921 /* Look for C++17 decomposition declaration. */
12929 {
12930 tree decl
12932 maybe_range_for_decl,
12935 /* The next token should be either a `,' or a `;'. */
12937 /* If it's a `;', we are done. */
12940 /* Anything else is an error. */
12941 else
12942 {
12943 /* If we have already issued an error message we don't need
12944 to issue another one. */
12949 /* Skip tokens until we reach the end of the statement. */
12951 /* If the next token is now a `;', consume it. */
12955 }
12956 }
12957 else
12960 tree last_type;
12962 /* NULL_TREE if both variable and function declaration are allowed,
12963 error_mark_node if function declaration are not allowed and
12964 a FUNCTION_DECL that should be diagnosed if it is followed by
12965 variable declarations. */
12966 tree auto_function_declaration;
12969 auto_specifier_p
12973 /* Keep going until we hit the `;' at the end of the simple
12974 declaration. */
12977 CPP_SEMICOLON))
12978 {
12981 tree decl;
12985 {
12986 /* If we are processing next declarator, comma is expected */
12991 {
12995 }
12996 }
12997 else
13000 /* Parse the init-declarator. */
13003 function_definition_allowed_p,
13005 declares_class_or_enum,
13007 maybe_range_for_decl,
13010 /* If an error occurred while parsing tentatively, exit quickly.
13011 (That usually happens when in the body of a function; each
13012 statement is treated as a declaration-statement until proven
13013 otherwise.) */
13018 {
13019 /* If the init-declarator-list contains more than one
13020 init-declarator, they shall all form declarations of
13021 variables. */
13023 auto_function_declaration
13027 {
13029 "non-variable %qD in declaration with more than one "
13034 }
13035 }
13039 {
13043 {
13044 /* If the list of declarators contains more than one declarator,
13045 the type of each declared variable is determined as described
13046 above. If the type deduced for the template parameter U is not
13047 the same in each deduction, the program is ill-formed. */
13052 }
13053 else
13055 }
13057 /* Handle function definitions specially. */
13059 {
13060 /* If the next token is a `,', then we are probably
13061 processing something like:
13063 void f() {}, *p;
13065 which is erroneous. */
13067 {
13070 "mixing"
13072 }
13073 /* Otherwise, we're done with the list of declarators. */
13074 else
13075 {
13078 }
13079 }
13082 /* The next token should be either a `,' or a `;'. */
13084 /* If it's a `,', there are more declarators to come. */
13087 /* If it's a `;', we are done. */
13091 {
13096 }
13097 /* Anything else is an error. */
13098 else
13099 {
13100 /* If we have already issued an error message we don't need
13101 to issue another one. */
13106 /* Skip tokens until we reach the end of the statement. */
13108 /* If the next token is now a `;', consume it. */
13112 }
13113 /* After the first time around, a function-definition is not
13114 allowed -- even if it was OK at first. For example:
13116 int i, f() {}
13118 is not valid. */
13120 }
13122 /* Issue an error message if no declarators are present, and the
13123 decl-specifier-seq does not itself declare a class or
13124 enumeration: [dcl.dcl]/3. */
13126 {
13128 {
13132 /* Ensure an error is issued anyway when finish_decltype_type,
13133 called via cp_parser_decl_specifier_seq, returns a class or
13134 an enumeration (c++/51786). */
13137 }
13138 /* Perform any deferred access checks. */
13140 }
13142 /* Consume the `;'. */
13143 finish:
13147 {
13153 }
13155 done:
13157 }
13159 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13160 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13161 initializer ; */
13163 static tree
13168 {
13173 /* Parse the identifier-list. */
13177 {
13185 }
13189 {
13195 else
13196 {
13199 }
13200 }
13206 tree pushed_scope;
13213 NULL_TREE);
13220 cp_expr e;
13221 cp_decl_specifier_seq decl_specs;
13226 {
13229 else
13232 tree elt_pushed_scope;
13238 {
13239 /* Ensure we've diagnosed redeclaration if we aren't creating
13240 a new VAR_DECL. */
13243 }
13244 else
13248 }
13251 {
13254 }
13258 {
13266 || (is_direct_init
13269 {
13273 }
13276 {
13281 }
13282 }
13284 {
13286 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13287 the underlying DECL. */
13289 }
13295 {
13298 }
13301 }
13303 /* Parse a decl-specifier-seq.
13305 decl-specifier-seq:
13306 decl-specifier-seq [opt] decl-specifier
13307 decl-specifier attribute-specifier-seq [opt] (C++11)
13309 decl-specifier:
13310 storage-class-specifier
13311 type-specifier
13312 function-specifier
13313 friend
13314 typedef
13316 GNU Extension:
13318 decl-specifier:
13319 attributes
13321 Concepts Extension:
13323 decl-specifier:
13324 concept
13326 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13328 The parser flags FLAGS is used to control type-specifier parsing.
13330 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13331 flags:
13333 1: one of the decl-specifiers is an elaborated-type-specifier
13334 (i.e., a type declaration)
13335 2: one of the decl-specifiers is an enum-specifier or a
13336 class-specifier (i.e., a type definition)
13338 */
13340 static void
13342 cp_parser_flags flags,
13345 {
13349 cp_decl_spec ds;
13351 /* Clear DECL_SPECS. */
13354 /* Assume no class or enumeration type is declared. */
13357 /* Keep reading specifiers until there are no more to read. */
13359 {
13364 /* Peek at the next token. */
13367 /* Save the first token of the decl spec list for error
13368 reporting. */
13371 /* Handle attributes. */
13373 {
13374 /* Parse the attributes. */
13377 /* In a sequence of declaration specifiers, c++11 attributes
13378 appertain to the type that precede them. In that case
13379 [dcl.spec]/1 says:
13381 The attribute-specifier-seq affects the type only for
13382 the declaration it appears in, not other declarations
13383 involving the same type.
13385 But for now let's force the user to position the
13386 attribute either at the beginning of the declaration or
13387 after the declarator-id, which would clearly mean that it
13388 applies to the declarator. */
13390 {
13392 /* The c++11 attribute is at the beginning of the
13393 declaration. It appertains to the entity being
13395 else
13396 {
13398 {
13399 /* This is an attribute following a
13400 class-specifier. */
13405 }
13406 else
13407 {
13408 decl_specs->std_attributes
13412 }
13414 }
13415 }
13417 decl_specs->attributes
13422 }
13423 /* Assume we will find a decl-specifier keyword. */
13425 /* If the next token is an appropriate keyword, we can simply
13426 add it to the list. */
13428 {
13429 /* decl-specifier:
13430 friend
13431 constexpr */
13434 {
13439 }
13440 else
13441 {
13443 /* Consume the token. */
13445 }
13458 /* function-specifier:
13459 inline
13460 virtual
13461 explicit */
13468 /* decl-specifier:
13469 typedef */
13472 /* Consume the token. */
13474 /* A constructor declarator cannot appear in a typedef. */
13476 /* The "typedef" keyword can only occur in a declaration; we
13477 may as well commit at this point. */
13484 /* storage-class-specifier:
13485 auto
13486 register
13487 static
13488 extern
13489 mutable
13491 GNU Extension:
13492 thread */
13495 {
13496 /* Consume the token. */
13499 /* Complain about `auto' as a storage specifier, if
13500 we're complaining about C++0x compatibility. */
13504 "%<auto%> changes meaning in C++11; "
13507 /* Set the storage class anyway. */
13509 token);
13510 }
13511 else
13512 /* C++0x auto type-specifier. */
13520 /* Consume the token. */
13523 token);
13526 /* Consume the token. */
13532 /* We did not yet find a decl-specifier yet. */
13535 }
13552 /* Constructors are a special case. The `S' in `S()' is not a
13553 decl-specifier; it is the beginning of the declarator. */
13554 constructor_p
13555 = (!found_decl_spec
13556 && constructor_possible_p
13557 && (cp_parser_constructor_declarator_p
13560 /* If we don't have a DECL_SPEC yet, then we must be looking at
13561 a type-specifier. */
13563 {
13566 tree type_spec;
13568 type_spec
13570 decl_specs,
13576 /* If this type-specifier referenced a user-defined type
13577 (a typedef, class-name, etc.), then we can't allow any
13578 more such type-specifiers henceforth.
13580 [dcl.spec]
13582 The longest sequence of decl-specifiers that could
13583 possibly be a type name is taken as the
13584 decl-specifier-seq of a declaration. The sequence shall
13585 be self-consistent as described below.
13587 [dcl.type]
13589 As a general rule, at most one type-specifier is allowed
13590 in the complete decl-specifier-seq of a declaration. The
13591 only exceptions are the following:
13593 -- const or volatile can be combined with any other
13594 type-specifier.
13596 -- signed or unsigned can be combined with char, long,
13597 short, or int.
13599 -- ..
13601 Example:
13603 typedef char* Pc;
13604 void g (const int Pc);
13606 Here, Pc is *not* part of the decl-specifier seq; it's
13607 the declarator. Therefore, once we see a type-specifier
13608 (other than a cv-qualifier), we forbid any additional
13609 user-defined types. We *do* still allow things like `int
13610 int' to be considered a decl-specifier-seq, and issue the
13611 error message later. */
13614 /* A constructor declarator cannot follow a type-specifier. */
13616 {
13621 }
13622 }
13624 /* If we still do not have a DECL_SPEC, then there are no more
13625 decl-specifiers. */
13630 /* After we see one decl-specifier, further decl-specifiers are
13631 always optional. */
13633 }
13635 /* Don't allow a friend specifier with a class definition. */
13640 }
13642 /* Parse an (optional) storage-class-specifier.
13644 storage-class-specifier:
13645 auto
13646 register
13647 static
13648 extern
13649 mutable
13651 GNU Extension:
13653 storage-class-specifier:
13654 thread
13656 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13658 static tree
13660 {
13662 {
13666 /* Fall through for C++98. */
13674 /* Consume the token. */
13679 }
13680 }
13682 /* Parse an (optional) function-specifier.
13684 function-specifier:
13685 inline
13686 virtual
13687 explicit
13689 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13690 Updates DECL_SPECS, if it is non-NULL. */
13692 static tree
13695 {
13698 {
13704 /* 14.5.2.3 [temp.mem]
13706 A member function template shall not be virtual. */
13710 else
13720 }
13722 /* Consume the token. */
13724 }
13726 /* Parse a linkage-specification.
13728 linkage-specification:
13729 extern string-literal { declaration-seq [opt] }
13730 extern string-literal declaration */
13732 static void
13734 {
13735 tree linkage;
13737 /* Look for the `extern' keyword. */
13738 cp_token *extern_token
13741 /* Look for the string-literal. */
13745 /* Transform the literal into an identifier. If the literal is a
13746 wide-character string, or contains embedded NULs, then we can't
13747 handle it as the user wants. */
13750 {
13752 /* Assume C++ linkage. */
13754 }
13755 else
13758 /* We're now using the new linkage. */
13761 /* Preserve the location of the the innermost linkage specification,
13762 tracking the locations of nested specifications via a local. */
13763 location_t saved_location
13765 /* Construct a location ranging from the start of the "extern" to
13766 the end of the string-literal, with the caret at the start, e.g.:
13767 extern "C" {
13768 ^~~~~~~~~~
13769 */
13770 parser->innermost_linkage_specification_location
13775 /* If the next token is a `{', then we're using the first
13776 production. */
13778 {
13782 /* Consume the `{' token. */
13783 matching_braces braces;
13785 /* Parse the declarations. */
13787 /* Look for the closing `}'. */
13789 }
13790 /* Otherwise, there's just one declaration. */
13791 else
13792 {
13795 saved_in_unbraced_linkage_specification_p
13799 parser->in_unbraced_linkage_specification_p
13801 }
13803 /* We're done with the linkage-specification. */
13806 /* Restore location of parent linkage specification, if any. */
13808 }
13810 /* Parse a static_assert-declaration.
13812 static_assert-declaration:
13813 static_assert ( constant-expression , string-literal ) ;
13814 static_assert ( constant-expression ) ; (C++17)
13816 If MEMBER_P, this static_assert is a class member. */
13818 static void
13820 {
13821 cp_expr condition;
13822 location_t token_loc;
13823 tree message;
13826 /* Peek at the `static_assert' token so we can keep track of exactly
13827 where the static assertion started. */
13830 /* Look for the `static_assert' keyword. */
13832 RT_STATIC_ASSERT))
13835 /* We know we are in a static assertion; commit to any tentative
13836 parse. */
13840 /* Parse the `(' starting the static assertion condition. */
13841 matching_parens parens;
13844 /* Parse the constant-expression. Allow a non-constant expression
13845 here in order to give better diagnostics in finish_static_assert. */
13846 condition =
13852 {
13855 "static_assert without a message "
13857 /* Eat the ')' */
13862 }
13863 else
13864 {
13865 /* Parse the separating `,'. */
13868 /* Parse the string-literal message. */
13873 /* A `)' completes the static assertion. */
13879 }
13881 /* A semicolon terminates the declaration. */
13884 /* Get the location for the static assertion. Use that of the
13885 condition if available, otherwise, use that of the "static_assert"
13886 token. */
13891 /* Complete the static assertion, which may mean either processing
13892 the static assert now or saving it for template instantiation. */
13894 }
13896 /* Parse the expression in decltype ( expression ). */
13898 static tree
13901 {
13903 tree expr;
13905 /* Since we're going to preserve any side-effects from this parse, set up a
13906 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13907 in the expression. */
13910 /* First, try parsing an id-expression. */
13921 {
13924 cp_id_kind idk;
13928 /* Lookup the name we got back from the id-expression. */
13938 {
13939 /* Complete lookup of the id-expression. */
13940 expr = (finish_id_expression
13953 /* We found an id-expression, but it was something that we
13954 should not have found. This is an error, not something
13955 we can recover from, so note that we found an
13956 id-expression and we'll recover as gracefully as
13957 possible. */
13959 }
13964 /* We have an id-expression. */
13966 }
13969 {
13970 /* Abort the id-expression parse. */
13973 /* Parsing tentatively, again. */
13976 /* Parse a class member access. */
13984 /* We have an id-expression. */
13986 }
13989 /* We have parsed the complete id-expression or member access. */
13991 else
13992 {
13993 /* Abort our attempt to parse an id-expression or member access
13994 expression. */
13997 /* Parse a full expression. */
14000 }
14003 }
14005 /* Parse a `decltype' type. Returns the type.
14007 simple-type-specifier:
14008 decltype ( expression )
14009 C++14 proposal:
14010 decltype ( auto ) */
14012 static tree
14014 {
14015 tree expr;
14024 {
14025 /* Already parsed. */
14028 }
14030 /* Look for the `decltype' token. */
14034 /* Parse the opening `('. */
14035 matching_parens parens;
14039 /* decltype (auto) */
14042 {
14049 }
14051 /* Types cannot be defined in a `decltype' expression. Save away the
14052 old message. */
14055 /* And create the new one. */
14056 parser->type_definition_forbidden_message
14059 /* The restrictions on constant-expressions do not apply inside
14060 decltype expressions. */
14061 saved_integral_constant_expression_p
14063 saved_non_integral_constant_expression_p
14067 /* Within a parenthesized expression, a `>' token is always
14068 the greater-than operator. */
14069 saved_greater_than_is_operator_p
14073 /* Do not actually evaluate the expression. */
14076 /* Do not warn about problems with the expression. */
14081 /* Go back to evaluating expressions. */
14085 /* The `>' token might be the end of a template-id or
14086 template-parameter-list now. */
14087 parser->greater_than_is_operator_p
14090 /* Restore the old message and the integral constant expression
14091 flags. */
14093 parser->integral_constant_expression_p
14095 parser->non_integral_constant_expression_p
14098 /* Parse to the closing `)'. */
14100 {
14104 }
14107 tf_warning_or_error);
14109 rewrite:
14110 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14111 it again. */
14120 }
14122 /* Special member functions [gram.special] */
14124 /* Parse a conversion-function-id.
14126 conversion-function-id:
14127 operator conversion-type-id
14129 Returns an IDENTIFIER_NODE representing the operator. */
14131 static tree
14133 {
14134 tree type;
14135 tree saved_scope;
14136 tree saved_qualifying_scope;
14137 tree saved_object_scope;
14140 /* Look for the `operator' token. */
14143 /* When we parse the conversion-type-id, the current scope will be
14144 reset. However, we need that information in able to look up the
14145 conversion function later, so we save it here. */
14149 /* We must enter the scope of the class so that the names of
14150 entities declared within the class are available in the
14151 conversion-type-id. For example, consider:
14153 struct S {
14154 typedef int I;
14155 operator I();
14156 };
14158 S::operator I() { ... }
14160 In order to see that `I' is a type-name in the definition, we
14161 must be in the scope of `S'. */
14164 /* Parse the conversion-type-id. */
14166 /* Leave the scope of the class, if any. */
14169 /* Restore the saved scope. */
14173 /* If the TYPE is invalid, indicate failure. */
14177 }
14179 /* Parse a conversion-type-id:
14181 conversion-type-id:
14182 type-specifier-seq conversion-declarator [opt]
14184 Returns the TYPE specified. */
14186 static tree
14188 {
14189 tree attributes;
14190 cp_decl_specifier_seq type_specifiers;
14192 tree type_specified;
14195 /* Parse the attributes. */
14199 parser->type_definition_forbidden_message
14202 /* Parse the type-specifiers. */
14209 /* If that didn't work, stop. */
14212 /* Parse the conversion-declarator. */
14220 /* Don't give this error when parsing tentatively. This happens to
14221 work because we always parse this definitively once. */
14224 {
14226 {
14229 }
14233 }
14236 }
14238 /* Parse an (optional) conversion-declarator.
14240 conversion-declarator:
14241 ptr-operator conversion-declarator [opt]
14243 */
14247 {
14250 cp_cv_quals cv_quals;
14252 /* We don't know if there's a ptr-operator next, or not. */
14254 /* Try the ptr-operator. */
14257 /* If it worked, look for more conversion-declarators. */
14259 {
14262 /* Parse another optional declarator. */
14265 declarator = cp_parser_make_indirect_declarator
14269 }
14272 }
14274 /* Parse an (optional) ctor-initializer.
14276 ctor-initializer:
14277 : mem-initializer-list */
14279 static void
14281 {
14282 /* If the next token is not a `:', then there is no
14283 ctor-initializer. */
14285 {
14286 /* Do default initialization of any bases and members. */
14290 }
14292 /* Consume the `:' token. */
14294 /* And the mem-initializer-list. */
14296 }
14298 /* Parse a mem-initializer-list.
14300 mem-initializer-list:
14301 mem-initializer ... [opt]
14302 mem-initializer ... [opt] , mem-initializer-list */
14304 static void
14306 {
14311 /* Let the semantic analysis code know that we are starting the
14312 mem-initializer-list. */
14317 /* Loop through the list. */
14319 {
14320 tree mem_initializer;
14323 /* Parse the mem-initializer. */
14325 /* If the next token is a `...', we're expanding member initializers. */
14327 {
14328 /* Consume the `...'. */
14331 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14332 can be expanded but members cannot. */
14335 {
14340 }
14342 /* Construct the pack expansion type. */
14345 }
14348 {
14352 }
14353 /* Look for a target constructor. */
14357 {
14360 {
14364 }
14366 }
14367 /* Add it to the list, unless it was erroneous. */
14369 {
14372 }
14373 /* If the next token is not a `,', we're done. */
14376 /* Consume the `,' token. */
14378 }
14380 /* Perform semantic analysis. */
14383 }
14385 /* Parse a mem-initializer.
14387 mem-initializer:
14388 mem-initializer-id ( expression-list [opt] )
14389 mem-initializer-id braced-init-list
14391 GNU extension:
14393 mem-initializer:
14394 ( expression-list [opt] )
14396 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14397 class) or FIELD_DECL (for a non-static data member) to initialize;
14398 the TREE_VALUE is the expression-list. An empty initialization
14399 list is represented by void_list_node. */
14401 static tree
14403 {
14404 tree mem_initializer_id;
14405 tree expression_list;
14406 tree member;
14409 /* Find out what is being initialized. */
14411 {
14415 }
14416 else
14417 {
14421 }
14427 {
14434 }
14435 else
14436 {
14446 }
14456 }
14458 /* Parse a mem-initializer-id.
14460 mem-initializer-id:
14461 :: [opt] nested-name-specifier [opt] class-name
14462 decltype-specifier (C++11)
14463 identifier
14465 Returns a TYPE indicating the class to be initialized for the first
14466 production (and the second in C++11). Returns an IDENTIFIER_NODE
14467 indicating the data member to be initialized for the last production. */
14469 static tree
14471 {
14475 tree id;
14479 /* `typename' is not allowed in this context ([temp.res]). */
14481 {
14483 "keyword %<typename%> not allowed in this context (a qualified "
14486 }
14487 /* Look for the optional `::' operator. */
14488 global_scope_p
14492 /* Look for the optional nested-name-specifier. The simplest way to
14493 implement:
14495 [temp.res]
14497 The keyword `typename' is not permitted in a base-specifier or
14498 mem-initializer; in these contexts a qualified name that
14499 depends on a template-parameter is implicitly assumed to be a
14500 type name.
14502 is to assume that we have seen the `typename' keyword at this
14503 point. */
14504 nested_name_specifier_p
14513 /* If there is a `::' operator or a nested-name-specifier, then we
14514 are definitely looking for a class-name. */
14519 typename_type,
14523 /* Otherwise, we could also be looking for an ordinary identifier. */
14526 /* Try a decltype-specifier. */
14528 else
14529 /* Otherwise, try a class-name. */
14533 none_type,
14537 /* If we found one, we're done. */
14540 /* Otherwise, look for an ordinary identifier. */
14542 }
14544 /* Overloading [gram.over] */
14546 /* Parse an operator-function-id.
14548 operator-function-id:
14549 operator operator
14551 Returns an IDENTIFIER_NODE for the operator which is a
14552 human-readable spelling of the identifier, e.g., `operator +'. */
14554 static cp_expr
14556 {
14557 /* Look for the `operator' keyword. */
14560 /* And then the name of the operator itself. */
14562 }
14564 /* Return an identifier node for a user-defined literal operator.
14565 The suffix identifier is chained to the operator name identifier. */
14567 tree
14569 {
14570 tree identifier;
14577 }
14579 /* Parse an operator.
14581 operator:
14582 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14583 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14584 || ++ -- , ->* -> () []
14586 GNU Extensions:
14588 operator:
14589 <? >? <?= >?=
14591 Returns an IDENTIFIER_NODE for the operator which is a
14592 human-readable spelling of the identifier, e.g., `operator +'. */
14594 static cp_expr
14596 {
14601 /* Peek at the next token. */
14606 /* Figure out which operator we have. */
14611 {
14613 {
14614 /* The keyword should be either `new' or `delete'. */
14619 else
14622 /* Consume the `new' or `delete' token. */
14625 /* Peek at the next token. */
14627 /* If it's a `[' token then this is the array variant of the
14628 operator. */
14630 {
14631 /* Consume the `[' token. */
14633 /* Look for the `]' token. */
14638 }
14642 }
14800 {
14801 /* Consume the `('. */
14802 matching_parens parens;
14804 /* Look for the matching `)'. */
14809 }
14812 /* Consume the `['. */
14814 /* Look for the matching `]'. */
14823 /* FALLTHRU */
14832 {
14839 /* Consume the string. */
14845 {
14848 }
14849 else
14850 {
14852 /* Look for the suffix identifier. */
14857 {
14861 }
14862 else
14863 {
14866 }
14867 }
14872 {
14875 }
14878 {
14881 }
14883 {
14886 }
14888 }
14891 /* Anything else is an error. */
14893 }
14895 /* If we have selected an identifier, we need to consume the
14896 operator token. */
14898 {
14902 }
14903 /* Otherwise, no valid operator name was present. */
14904 else
14905 {
14908 }
14911 }
14913 /* Parse a template-declaration.
14915 template-declaration:
14916 export [opt] template < template-parameter-list > declaration
14918 If MEMBER_P is TRUE, this template-declaration occurs within a
14919 class-specifier.
14921 The grammar rule given by the standard isn't correct. What
14922 is really meant is:
14924 template-declaration:
14925 export [opt] template-parameter-list-seq
14926 decl-specifier-seq [opt] init-declarator [opt] ;
14927 export [opt] template-parameter-list-seq
14928 function-definition
14930 template-parameter-list-seq:
14931 template-parameter-list-seq [opt]
14932 template < template-parameter-list >
14934 Concept Extensions:
14936 template-parameter-list-seq:
14937 template < template-parameter-list > requires-clause [opt]
14939 requires-clause:
14940 requires logical-or-expression */
14942 static void
14944 {
14945 /* Check for `export'. */
14947 {
14948 /* Consume the `export' token. */
14950 /* Warn that we do not support `export'. */
14952 }
14955 }
14957 /* Parse a template-parameter-list.
14959 template-parameter-list:
14960 template-parameter
14961 template-parameter-list , template-parameter
14963 Returns a TREE_LIST. Each node represents a template parameter.
14964 The nodes are connected via their TREE_CHAINs. */
14966 static tree
14968 {
14973 /* The loop below parses the template parms. We first need to know
14974 the total number of template parms to be able to compute proper
14975 canonical types of each dependent type. So after the loop, when
14976 we know the total number of template parms,
14977 end_template_parm_list computes the proper canonical types and
14978 fixes up the dependent types accordingly. */
14980 {
14981 tree parameter;
14984 location_t parm_loc;
14986 /* Parse the template-parameter. */
14991 /* Add it to the list. */
14994 parm_loc,
14995 parameter,
14996 is_non_type,
14997 is_parameter_pack);
14998 else
14999 {
15002 }
15004 /* If the next token is not a `,', we're done. */
15007 /* Otherwise, consume the `,' token. */
15009 }
15012 }
15014 /* Parse a introduction-list.
15016 introduction-list:
15017 introduced-parameter
15018 introduction-list , introduced-parameter
15020 introduced-parameter:
15021 ...[opt] identifier
15023 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15024 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15025 WILDCARD_DECL will also have DECL_NAME set and token location in
15026 DECL_SOURCE_LOCATION. */
15028 static tree
15030 {
15034 {
15039 /* Build placeholder. */
15047 /* If the next token is not a `,', we're done. */
15050 /* Otherwise, consume the `,' token. */
15052 }
15054 /* Convert the vec into a TREE_VEC. */
15057 tree parm;
15063 }
15065 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15066 is an abstract declarator. */
15070 {
15075 }
15077 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15078 is an abstract declarator. */
15082 {
15086 else
15088 }
15090 /* Returns true if DECL represents a constrained-parameter. */
15094 {
15099 }
15101 /* Returns true if PARM declares a constrained-parameter. */
15105 {
15107 }
15109 /* Check that the type parameter is only a declarator-id, and that its
15110 type is not cv-qualified. */
15112 bool
15115 {
15120 {
15123 }
15125 /* Don't allow cv-qualified type parameters. */
15128 {
15131 }
15134 }
15136 /* Finish parsing/processing a template type parameter and checking
15137 various restrictions. */
15141 tree id,
15143 {
15146 else
15148 }
15150 static tree
15152 {
15153 /* FIXME: This should probably be copied, and we may need to adjust
15154 the template parameter depths. */
15164 }
15166 /* Finish parsing/processing a template template parameter by borrowing
15167 the template parameter list from the prototype parameter. */
15169 static tree
15171 tree proto,
15172 tree id,
15174 {
15178 }
15180 /* Create a new non-type template parameter from the given PARM
15181 declarator. */
15183 static tree
15186 {
15192 }
15194 /* Build a constrained template parameter based on the PARMDECL
15195 declarator. The type of PARMDECL is the constrained type, which
15196 refers to the prototype template parameter that ultimately
15197 specifies the type of the declared parameter. */
15199 static tree
15204 {
15210 /* A template parameter constrained by a variadic concept shall also
15211 be declared as a template parameter pack. */
15216 /* Build the parameter. Return an error if the declarator was invalid. */
15217 tree parm;
15222 parmdecl);
15223 else
15228 /* Finish the parameter decl and create a node attaching the
15229 default argument and constraint. */
15234 }
15236 /* Returns true if the parsed type actually represents the declaration
15237 of a type template-parameter. */
15241 {
15244 }
15247 /* Returns true if the parsed type actually represents the declaration of
15248 a template template-parameter. */
15250 static bool
15252 {
15255 }
15257 /* Parse a default argument for a type template-parameter.
15258 Note that diagnostics are handled in cp_parser_template_parameter. */
15260 static tree
15262 {
15265 /* Consume the `=' token. */
15270 /* Parse the default-argument. */
15276 {
15280 }
15283 }
15285 /* Parse a default argument for a template template-parameter. */
15287 static tree
15289 {
15294 /* Consume the `='. */
15296 /* Parse the id-expression. */
15298 /* save token before parsing the id-expression, for error
15299 reporting */
15301 tree default_argument
15309 /* If the id-expression was a template-id that refers to
15310 a template-class, we already have the declaration here,
15311 so no further lookup is needed. */
15312 ;
15313 else
15314 /* Look up the name. */
15315 default_argument
15317 none_type,
15323 /* See if the default argument is valid. */
15327 }
15329 /* Parse a template-parameter.
15331 template-parameter:
15332 type-parameter
15333 parameter-declaration
15335 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15336 the parameter. The TREE_PURPOSE is the default value, if any.
15337 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15338 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15339 set to true iff this parameter is a parameter pack. */
15341 static tree
15344 {
15347 tree parm;
15349 /* Assume it is a type parameter or a template parameter. */
15351 /* Assume it not a parameter pack. */
15353 /* Peek at the next token. */
15355 /* If it is `template', we have a type-parameter. */
15358 /* If it is `class' or `typename' we do not know yet whether it is a
15359 type parameter or a non-type parameter. Consider:
15361 template <typename T, typename T::X X> ...
15363 or:
15365 template <class C, class D*> ...
15367 Here, the first parameter is a type parameter, and the second is
15368 a non-type parameter. We can tell by looking at the token after
15369 the identifier -- if it is a `,', `=', or `>' then we have a type
15370 parameter. */
15372 {
15373 /* Peek at the token after `class' or `typename'. */
15375 /* If it's an ellipsis, we have a template type parameter
15376 pack. */
15379 /* If it's an identifier, skip it. */
15382 /* Now, see if the token looks like the end of a template
15383 parameter. */
15388 }
15390 /* Otherwise, it is a non-type parameter or a constrained parameter.
15392 [temp.param]
15394 When parsing a default template-argument for a non-type
15395 template-parameter, the first non-nested `>' is taken as the end
15396 of the template parameter-list rather than a greater-than
15397 operator. */
15398 parameter_declarator
15405 /* If the parameter declaration is marked as a parameter pack, set
15406 *IS_PARAMETER_PACK to notify the caller. */
15411 {
15412 /* Can happen in some cases of erroneous input (c++/34892). */
15414 /* Consume the `...' for better error recovery. */
15416 }
15418 // The parameter may have been constrained.
15421 parameter_declarator,
15422 is_non_type,
15423 is_parameter_pack);
15425 // Now we're sure that the parameter is a non-type parameter.
15436 }
15438 /* Parse a type-parameter.
15440 type-parameter:
15441 class identifier [opt]
15442 class identifier [opt] = type-id
15443 typename identifier [opt]
15444 typename identifier [opt] = type-id
15445 template < template-parameter-list > class identifier [opt]
15446 template < template-parameter-list > class identifier [opt]
15447 = id-expression
15449 GNU Extension (variadic templates):
15451 type-parameter:
15452 class ... identifier [opt]
15453 typename ... identifier [opt]
15455 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15456 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15457 the declaration of the parameter.
15459 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15461 static tree
15463 {
15465 tree parameter;
15467 /* Look for a keyword to tell us what kind of parameter this is. */
15473 {
15476 {
15477 tree identifier;
15478 tree default_argument;
15480 /* If the next token is an ellipsis, we have a template
15481 argument pack. */
15483 {
15484 /* Consume the `...' token. */
15489 }
15491 /* If the next token is an identifier, then it names the
15492 parameter. */
15495 else
15498 /* Create the parameter. */
15501 /* If the next token is an `=', we have a default argument. */
15503 {
15504 default_argument
15507 /* Template parameter packs cannot have default
15508 arguments. */
15510 {
15513 "template parameter pack %qD cannot have a "
15515 else
15517 "template parameter packs cannot have "
15520 }
15523 }
15524 else
15527 /* Create the combined representation of the parameter and the
15528 default argument. */
15530 }
15534 {
15535 tree identifier;
15536 tree default_argument;
15538 /* Look for the `<'. */
15540 /* Parse the template-parameter-list. */
15542 /* Look for the `>'. */
15545 // If template requirements are present, parse them.
15547 {
15552 }
15554 /* Look for the `class' or 'typename' keywords. */
15556 /* If the next token is an ellipsis, we have a template
15557 argument pack. */
15559 {
15560 /* Consume the `...' token. */
15565 }
15566 /* If the next token is an `=', then there is a
15567 default-argument. If the next token is a `>', we are at
15568 the end of the parameter-list. If the next token is a `,',
15569 then we are at the end of this parameter. */
15573 {
15575 /* Treat invalid names as if the parameter were nameless. */
15578 }
15579 else
15582 /* Create the template parameter. */
15584 identifier);
15586 /* If the next token is an `=', then there is a
15587 default-argument. */
15589 {
15590 default_argument
15593 /* Template parameter packs cannot have default
15594 arguments. */
15596 {
15599 "template parameter pack %qD cannot "
15601 identifier);
15602 else
15606 }
15607 }
15608 else
15611 /* Create the combined representation of the parameter and the
15612 default argument. */
15614 }
15620 }
15623 }
15625 /* Parse a template-id.
15627 template-id:
15628 template-name < template-argument-list [opt] >
15630 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15631 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15632 returned. Otherwise, if the template-name names a function, or set
15633 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15634 names a class, returns a TYPE_DECL for the specialization.
15636 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15637 uninstantiated templates. */
15639 static tree
15645 {
15646 tree templ;
15647 tree arguments;
15648 tree template_id;
15653 /* If the next token corresponds to a template-id, there is no need
15654 to reparse it. */
15657 {
15660 }
15662 /* Avoid performing name lookup if there is no possibility of
15663 finding a template-id. */
15666 && !cp_parser_nth_token_starts_template_argument_list_p
15668 {
15671 }
15673 /* Remember where the template-id starts. */
15679 /* Parse the template-name. */
15682 check_dependency_p,
15683 is_declaration,
15684 tag_type,
15687 {
15690 }
15692 /* Since we're going to preserve any side-effects from this parse, set up a
15693 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15694 in the template arguments. */
15697 /* If we find the sequence `[:' after a template-name, it's probably
15698 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15699 parse correctly the argument list. */
15706 {
15708 /* Change `:' into `::'. */
15710 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15711 CPP_LESS. */
15714 /* Parse the arguments. */
15717 {
15718 /* If we couldn't parse an argument list, then we revert our changes
15719 and return simply an error. Maybe this is not a template-id
15720 after all. */
15725 }
15726 /* Otherwise, emit an error about the invalid digraph, but continue
15727 parsing because we got our argument list. */
15730 {
15733 "%<<:%> is an alternate spelling for %<[%>."
15736 {
15738 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15741 }
15742 }
15743 }
15744 else
15745 {
15746 /* Look for the `<' that starts the template-argument-list. */
15748 {
15751 }
15752 /* Parse the arguments. */
15754 }
15756 /* Set the location to be of the form:
15757 template-name < template-argument-list [opt] >
15758 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15759 with caret == start at the start of the template-name,
15760 ranging until the closing '>'. */
15761 location_t finish_loc
15763 location_t combined_loc
15766 /* Build a representation of the specialization. */
15769 TEMPLATE_ID_EXPR,
15773 {
15775 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15776 template (rather than some instantiation thereof) only if
15777 is not nested within some other construct. For example, in
15778 "template <typename T> void f(T) { A<T>::", A<T> is just an
15779 instantiation of A. */
15782 CPP_SCOPE));
15783 template_id
15785 }
15786 /* A template-like identifier may be a partial concept id. */
15792 {
15796 }
15797 else
15798 {
15799 /* If it's not a class-template or a template-template, it should be
15800 a function-template. */
15808 }
15810 /* If parsing tentatively, replace the sequence of tokens that makes
15811 up the template-id with a CPP_TEMPLATE_ID token. That way,
15812 should we re-parse the token stream, we will not have to repeat
15813 the effort required to do the parse, nor will we issue duplicate
15814 error messages about problems during instantiation of the
15815 template. */
15817 /* Don't do this if we had a parse error in a declarator; re-parsing
15818 might succeed if a name changes meaning (60361). */
15822 {
15823 /* Reset the contents of the START_OF_ID token. */
15827 /* We must mark the lookup as kept, so we don't throw it away on
15828 the first parse. */
15832 /* Retrieve any deferred checks. Do not pop this access checks yet
15833 so the memory will not be reclaimed during token replacing below. */
15839 /* Purge all subsequent tokens. */
15842 /* ??? Can we actually assume that, if template_id ==
15843 error_mark_node, we will have issued a diagnostic to the
15844 user, as opposed to simply marking the tentative parse as
15845 failed? */
15848 }
15852 }
15854 /* Parse a template-name.
15856 template-name:
15857 identifier
15859 The standard should actually say:
15861 template-name:
15862 identifier
15863 operator-function-id
15865 A defect report has been filed about this issue.
15867 A conversion-function-id cannot be a template name because they cannot
15868 be part of a template-id. In fact, looking at this code:
15870 a.operator K<int>()
15872 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15873 It is impossible to call a templated conversion-function-id with an
15874 explicit argument list, since the only allowed template parameter is
15875 the type to which it is converting.
15877 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15878 `template' keyword, in a construction like:
15880 T::template f<3>()
15882 In that case `f' is taken to be a template-name, even though there
15883 is no way of knowing for sure.
15885 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15886 name refers to a set of overloaded functions, at least one of which
15887 is a template, or an IDENTIFIER_NODE with the name of the template,
15888 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15889 names are looked up inside uninstantiated templates. */
15891 static tree
15898 {
15899 tree identifier;
15900 tree decl;
15903 /* If the next token is `operator', then we have either an
15904 operator-function-id or a conversion-function-id. */
15906 {
15907 /* We don't know whether we're looking at an
15908 operator-function-id or a conversion-function-id. */
15910 /* Try an operator-function-id. */
15912 /* If that didn't work, try a conversion-function-id. */
15914 {
15917 }
15918 }
15919 /* Look for the identifier. */
15920 else
15923 /* If we didn't find an identifier, we don't have a template-id. */
15927 /* If the name immediately followed the `template' keyword, then it
15928 is a template-name. However, if the next token is not `<', then
15929 we do not treat it as a template-name, since it is not being used
15930 as part of a template-id. This enables us to handle constructs
15931 like:
15933 template <typename T> struct S { S(); };
15934 template <typename T> S<T>::S();
15936 correctly. We would treat `S' as a template -- if it were `S<T>'
15937 -- but we do not if there is no `<'. */
15941 {
15942 /* In a declaration, in a dependent context, we pretend that the
15943 "template" keyword was present in order to improve error
15944 recovery. For example, given:
15946 template <typename T> void f(T::X<int>);
15948 we want to treat "X<int>" as a template-id. */
15950 && !template_keyword_p
15952 && check_dependency_p
15954 /* Do not do this for dtors (or ctors), since they never
15955 need the template keyword before their name. */
15957 {
15960 /* Explain what went wrong. */
15962 identifier);
15965 /* If parsing tentatively, find the location of the "<" token. */
15968 /* Parse the template arguments so that we can issue error
15969 messages about them. */
15972 /* Skip tokens until we find a good place from which to
15973 continue parsing. */
15978 /* If parsing tentatively, permanently remove the
15979 template argument list. That will prevent duplicate
15980 error messages from being issued about the missing
15981 "template" keyword. */
15988 }
15990 /* If the "template" keyword is present, then there is generally
15991 no point in doing name-lookup, so we just return IDENTIFIER.
15992 But, if the qualifying scope is non-dependent then we can
15993 (and must) do name-lookup normally. */
15995 {
16001 {
16002 /* We're optimizing away the call to cp_parser_lookup_name, but
16003 we still need to do this. */
16006 }
16007 }
16008 }
16010 /* Look up the name. */
16012 tag_type,
16015 check_dependency_p,
16021 /* If DECL is a template, then the name was a template-name. */
16023 {
16027 }
16028 else
16029 {
16030 /* The standard does not explicitly indicate whether a name that
16031 names a set of overloaded declarations, some of which are
16032 templates, is a template-name. However, such a name should
16033 be a template-name; otherwise, there is no way to form a
16034 template-id for the overloaded templates. */
16043 {
16044 /* The name does not name a template. */
16047 }
16048 }
16050 /* If DECL is dependent, and refers to a function, then just return
16051 its name; we will look it up again during template instantiation. */
16053 {
16057 }
16060 }
16062 /* Parse a template-argument-list.
16064 template-argument-list:
16065 template-argument ... [opt]
16066 template-argument-list , template-argument ... [opt]
16068 Returns a TREE_VEC containing the arguments. */
16070 static tree
16072 {
16077 tree vec;
16084 /* Even if the template-id appears in an integral
16085 constant-expression, the contents of the argument list do
16086 not. */
16092 /* Parse the arguments. */
16093 do
16094 {
16095 tree argument;
16098 /* Consume the comma. */
16101 /* Parse the template-argument. */
16104 /* If the next token is an ellipsis, we're expanding a template
16105 argument pack. */
16107 {
16109 {
16113 }
16114 /* Consume the `...' token. */
16117 /* Make the argument into a TYPE_PACK_EXPANSION or
16118 EXPR_PACK_EXPANSION. */
16120 }
16123 {
16127 {
16130 }
16131 else
16133 }
16135 }
16151 }
16153 /* Parse a template-argument.
16155 template-argument:
16156 assignment-expression
16157 type-id
16158 id-expression
16160 The representation is that of an assignment-expression, type-id, or
16161 id-expression -- except that the qualified id-expression is
16162 evaluated, so that the value returned is either a DECL or an
16163 OVERLOAD.
16165 Although the standard says "assignment-expression", it forbids
16166 throw-expressions or assignments in the template argument.
16167 Therefore, we use "conditional-expression" instead. */
16169 static tree
16171 {
16172 tree argument;
16178 cp_id_kind idk;
16180 /* There's really no way to know what we're looking at, so we just
16181 try each alternative in order.
16183 [temp.arg]
16185 In a template-argument, an ambiguity between a type-id and an
16186 expression is resolved to a type-id, regardless of the form of
16187 the corresponding template-parameter.
16189 Therefore, we try a type-id first. */
16192 /* If there was no error parsing the type-id but the next token is a
16193 '>>', our behavior depends on which dialect of C++ we're
16194 parsing. In C++98, we probably found a typo for '> >'. But there
16195 are type-id which are also valid expressions. For instance:
16197 struct X { int operator >> (int); };
16198 template <int V> struct Foo {};
16199 Foo<X () >> 5> r;
16201 Here 'X()' is a valid type-id of a function type, but the user just
16202 wanted to write the expression "X() >> 5". Thus, we remember that we
16203 found a valid type-id, but we still try to parse the argument as an
16204 expression to see what happens.
16206 In C++0x, the '>>' will be considered two separate '>'
16207 tokens. */
16211 {
16214 }
16215 else
16216 {
16217 /* If the next token isn't a `,' or a `>', then this argument wasn't
16218 really finished. This means that the argument is not a valid
16219 type-id. */
16222 /* If that worked, we're done. */
16225 }
16226 /* We're still not sure what the argument will be. */
16228 /* Try a template. */
16236 /* If the next token isn't a `,' or a `>', then this argument wasn't
16237 really finished. */
16241 {
16242 /* Figure out what is being referred to. If the id-expression
16243 was for a class template specialization, then we will have a
16244 TYPE_DECL at this point. There is no need to do name lookup
16245 at this point in that case. */
16248 none_type,
16254 /* Handle a constrained-type-specifier for a non-type template
16255 parameter. */
16261 }
16263 {
16267 }
16268 /* It must be a non-type argument. In C++17 any constant-expression is
16269 allowed. */
16273 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16275 -- an integral constant-expression of integral or enumeration
16276 type; or
16278 -- the name of a non-type template-parameter; or
16280 -- the name of an object or function with external linkage...
16282 -- the address of an object or function with external linkage...
16284 -- a pointer to member... */
16285 /* Look for a non-type template parameter. */
16287 {
16299 }
16301 /* If the next token is "&", the argument must be the address of an
16302 object or function with external linkage. */
16305 {
16308 }
16309 /* See if we might have an id-expression. */
16316 {
16319 address_p,
16326 else
16327 {
16328 tree probe;
16331 {
16332 /* Strip the dereference temporarily. */
16335 }
16337 /* If we're in a template, we represent a qualified-id referring
16338 to a static data member as a SCOPE_REF even if the scope isn't
16339 dependent so that we can check access control later. */
16344 {
16345 /* A variable without external linkage might still be a
16346 valid constant-expression, so no error is issued here
16347 if the external-linkage check fails. */
16350 }
16352 /* All overloaded functions are allowed; if the external
16353 linkage test does not pass, an error will be issued
16354 later. */
16355 ;
16359 /* A pointer-to-member. */
16360 ;
16362 ;
16363 else
16367 {
16370 tf_warning_or_error);
16371 else
16374 }
16375 }
16376 }
16377 /* If the argument started with "&", there are no other valid
16378 alternatives at this point. */
16380 {
16383 }
16385 general_expr:
16386 /* If the argument wasn't successfully parsed as a type-id followed
16387 by '>>', the argument can only be a constant expression now.
16388 Otherwise, we try parsing the constant-expression tentatively,
16389 because the argument could really be a type-id. */
16395 else
16396 {
16397 /* With C++17 generalized non-type template arguments we need to handle
16398 lvalue constant expressions, too. */
16401 }
16409 /* We did our best to parse the argument as a non type-id, but that
16410 was the only alternative that matched (albeit with a '>' after
16411 it). We can assume it's just a typo from the user, and a
16412 diagnostic will then be issued. */
16414 }
16416 /* Parse an explicit-instantiation.
16418 explicit-instantiation:
16419 template declaration
16421 Although the standard says `declaration', what it really means is:
16423 explicit-instantiation:
16424 template decl-specifier-seq [opt] declarator [opt] ;
16426 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16427 supposed to be allowed. A defect report has been filed about this
16428 issue.
16430 GNU Extension:
16432 explicit-instantiation:
16433 storage-class-specifier template
16434 decl-specifier-seq [opt] declarator [opt] ;
16435 function-specifier template
16436 decl-specifier-seq [opt] declarator [opt] ; */
16438 static void
16440 {
16442 cp_decl_specifier_seq decl_specifiers;
16447 /* Look for an (optional) storage-class-specifier or
16448 function-specifier. */
16450 {
16451 extension_specifier
16454 extension_specifier
16457 }
16459 /* Look for the `template' keyword. */
16461 /* Let the front end know that we are processing an explicit
16462 instantiation. */
16464 /* [temp.explicit] says that we are supposed to ignore access
16465 control while processing explicit instantiation directives. */
16467 /* Parse a decl-specifier-seq. */
16469 CP_PARSER_FLAGS_OPTIONAL,
16472 /* If there was exactly one decl-specifier, and it declared a class,
16473 and there's no declarator, then we have an explicit type
16474 instantiation. */
16476 {
16477 tree type;
16481 /* Turn access control back on for names used during
16482 template instantiation. */
16487 }
16488 else
16489 {
16491 tree decl;
16493 /* Parse the declarator. */
16494 declarator
16505 {
16508 "explicit instantiation shall not use"
16512 "explicit instantiation shall not use"
16517 /* Turn access control back on for names used during
16518 template instantiation. */
16520 /* Do the explicit instantiation. */
16522 }
16523 else
16524 {
16526 /* Skip the body of the explicit instantiation. */
16528 }
16529 }
16530 /* We're done with the instantiation. */
16536 }
16538 /* Parse an explicit-specialization.
16540 explicit-specialization:
16541 template < > declaration
16543 Although the standard says `declaration', what it really means is:
16545 explicit-specialization:
16546 template <> decl-specifier [opt] init-declarator [opt] ;
16547 template <> function-definition
16548 template <> explicit-specialization
16549 template <> template-declaration */
16551 static void
16553 {
16557 /* Look for the `template' keyword. */
16559 /* Look for the `<'. */
16561 /* Look for the `>'. */
16563 /* We have processed another parameter list. */
16565 /* [temp]
16567 A template ... explicit specialization ... shall not have C
16568 linkage. */
16570 {
16573 /* Give it C++ linkage to avoid confusing other parts of the
16574 front end. */
16577 }
16578 else
16580 /* Let the front end know that we are beginning a specialization. */
16582 {
16585 }
16587 /* If the next keyword is `template', we need to figure out whether
16588 or not we're looking a template-declaration. */
16590 {
16595 else
16597 }
16598 else
16599 /* Parse the dependent declaration. */
16605 /* We're done with the specialization. */
16607 /* For the erroneous case of a template with C linkage, we pushed an
16608 implicit C++ linkage scope; exit that scope now. */
16611 /* We're done with this parameter list. */
16613 }
16615 /* Parse a type-specifier.
16617 type-specifier:
16618 simple-type-specifier
16619 class-specifier
16620 enum-specifier
16621 elaborated-type-specifier
16622 cv-qualifier
16624 GNU Extension:
16626 type-specifier:
16627 __complex__
16629 Returns a representation of the type-specifier. For a
16630 class-specifier, enum-specifier, or elaborated-type-specifier, a
16631 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16633 The parser flags FLAGS is used to control type-specifier parsing.
16635 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16636 in a decl-specifier-seq.
16638 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16639 class-specifier, enum-specifier, or elaborated-type-specifier, then
16640 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16641 if a type is declared; 2 if it is defined. Otherwise, it is set to
16642 zero.
16644 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16645 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16646 is set to FALSE. */
16648 static tree
16650 cp_parser_flags flags,
16655 {
16661 /* Assume this type-specifier does not declare a new type. */
16664 /* And that it does not specify a cv-qualifier. */
16667 /* Peek at the next token. */
16670 /* If we're looking at a keyword, we can use that to guide the
16671 production we choose. */
16674 {
16679 /* Look for the enum-specifier. */
16681 /* If that worked, we're done. */
16683 {
16688 type_spec,
16689 token,
16692 }
16693 else
16696 /* Any of these indicate either a class-specifier, or an
16697 elaborated-type-specifier. */
16704 /* Parse tentatively so that we can back up if we don't find a
16705 class-specifier. */
16707 /* Look for the class-specifier. */
16710 /* If that worked, we're done. */
16712 {
16717 type_spec,
16718 token,
16721 }
16723 /* Fall through. */
16724 elaborated_type_specifier:
16725 /* We're declaring (not defining) a class or enum. */
16729 /* Fall through. */
16731 /* Look for an elaborated-type-specifier. */
16732 type_spec
16733 = (cp_parser_elaborated_type_specifier
16736 is_declaration));
16739 type_spec,
16740 token,
16763 /* The `__complex__' keyword is a GNU extension. */
16769 }
16771 /* Handle simple keywords. */
16773 {
16775 {
16778 }
16780 }
16782 /* If we do not already have a type-specifier, assume we are looking
16783 at a simple-type-specifier. */
16785 decl_specs,
16786 flags);
16788 /* If we didn't find a type-specifier, and a type-specifier was not
16789 optional in this context, issue an error message. */
16791 {
16794 }
16797 }
16799 /* Parse a simple-type-specifier.
16801 simple-type-specifier:
16802 :: [opt] nested-name-specifier [opt] type-name
16803 :: [opt] nested-name-specifier template template-id
16804 char
16805 wchar_t
16806 bool
16807 short
16808 int
16809 long
16810 signed
16811 unsigned
16812 float
16813 double
16814 void
16816 C++11 Extension:
16818 simple-type-specifier:
16819 auto
16820 decltype ( expression )
16821 char16_t
16822 char32_t
16823 __underlying_type ( type-id )
16825 C++17 extension:
16827 nested-name-specifier(opt) template-name
16829 GNU Extension:
16831 simple-type-specifier:
16832 __int128
16833 __typeof__ unary-expression
16834 __typeof__ ( type-id )
16835 __typeof__ ( type-id ) { initializer-list , [opt] }
16837 Concepts Extension:
16839 simple-type-specifier:
16840 constrained-type-specifier
16842 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16843 appropriately updated. */
16845 static tree
16848 cp_parser_flags flags)
16849 {
16854 /* Peek at the next token. */
16857 /* If we're looking at a keyword, things are easy. */
16859 {
16894 {
16897 }
16926 {
16927 /* The 'auto' might be the placeholder return type for a function decl
16928 with trailing return type. */
16937 {
16939 {
16946 }
16949 {
16952 }
16955 }
16959 {
16962 }
16965 {
16968 }
16969 else
16973 {
16976 "use of %<auto%> in lambda parameter declaration "
16977 "only available with "
16979 }
16982 "use of %<auto%> in parameter declaration "
16983 "only available with "
16987 "ISO C++ forbids use of %<auto%> in parameter "
16989 }
16990 else
16995 /* Since DR 743, decltype can either be a simple-type-specifier by
16996 itself or begin a nested-name-specifier. Parsing it will replace
16997 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16998 handling below decide what to do. */
17004 /* Consume the `typeof' token. */
17006 /* Parse the operand to `typeof'. */
17008 /* If it is not already a TYPE, take its type. */
17014 token,
17023 token,
17033 token,
17038 }
17040 /* If token is an already-parsed decltype not followed by ::,
17041 it's a simple-type-specifier. */
17044 {
17047 {
17049 token,
17051 /* Remember that we are handling a decltype in order to
17052 implement the resolution of DR 1510 when the argument
17053 isn't instantiation dependent. */
17055 }
17058 }
17060 /* If the type-specifier was for a built-in type, we're done. */
17062 {
17063 /* Record the type. */
17070 type,
17071 token,
17076 /* Consume the token. */
17082 /* There is no valid C++ program where a non-template type is
17083 followed by a "<". That usually indicates that the user thought
17084 that the type was a template. */
17089 }
17091 /* The type-specifier must be a user-defined type. */
17093 {
17097 /* Don't gobble tokens or issue error messages if this is an
17098 optional type-specifier. */
17104 /* Look for the optional `::' operator. */
17105 global_p
17109 /* Look for the nested-name specifier. */
17110 qualified_p
17117 /* If we have seen a nested-name-specifier, and the next token
17118 is `template', then we are using the template-id production. */
17121 {
17122 /* Look for the template-id. */
17126 none_type,
17128 /* If the template-id did not name a type, we are out of
17129 luck. */
17131 {
17134 }
17135 }
17136 /* Otherwise, look for a type-name. */
17137 else
17139 /* Keep track of all name-lookups performed in class scopes. */
17141 && !global_p
17142 && !qualified_p
17146 /* If it didn't work out, we don't have a TYPE. */
17151 {
17165 {
17167 none_type,
17177 else
17178 {
17183 }
17184 }
17185 else
17191 }
17194 token,
17196 }
17198 /* If we didn't get a type-name, issue an error message. */
17200 {
17203 }
17206 {
17207 /* See if TYPE is an Objective-C type, and if so, parse and
17208 accept any protocol references following it. Do this before
17209 the cp_parser_check_for_invalid_template_id() call, because
17210 Objective-C types can be followed by '<...>' which would
17211 enclose protocol names rather than template arguments, and so
17212 everything is fine. */
17215 {
17219 /* Clobber the "unqualified" type previously entered into
17220 DECL_SPECS with the new, improved protocol-qualified version. */
17225 }
17227 /* There is no valid C++ program where a non-template type is
17228 followed by a "<". That usually indicates that the user
17229 thought that the type was a template. */
17231 none_type,
17233 }
17236 }
17238 /* Parse a type-name.
17240 type-name:
17241 class-name
17242 enum-name
17243 typedef-name
17244 simple-template-id [in c++0x]
17246 enum-name:
17247 identifier
17249 typedef-name:
17250 identifier
17252 Concepts:
17254 type-name:
17255 concept-name
17256 partial-concept-id
17258 concept-name:
17259 identifier
17261 Returns a TYPE_DECL for the type. */
17263 static tree
17265 {
17267 }
17269 /* See above. */
17270 static tree
17272 {
17273 tree type_decl;
17275 /* We can't know yet whether it is a class-name or not. */
17277 /* Try a class-name. */
17279 typename_keyword_p,
17281 none_type,
17285 /* If it's not a class-name, keep looking. */
17287 {
17289 /* It must be a typedef-name or an enum-name. */
17293 /* It is either a simple-template-id representing an
17294 instantiation of an alias template... */
17298 none_type,
17300 /* Note that this must be an instantiation of an alias template
17301 because [temp.names]/6 says:
17303 A template-id that names an alias template specialization
17304 is a type-name.
17306 Whereas [temp.names]/7 says:
17308 A simple-template-id that names a class template
17309 specialization is a class-name.
17311 With concepts, this could also be a partial-concept-id that
17312 declares a non-type template parameter. */
17319 else
17323 /* ... Or a typedef-name or an enum-name. */
17325 }
17328 }
17330 /* Check if DECL and ARGS can form a constrained-type-specifier.
17331 If ARGS is non-null, we try to form a concept check of the
17332 form DECL<?, ARGS> where ? is a wildcard that matches any
17333 kind of template argument. If ARGS is NULL, then we try to
17334 form a concept check of the form DECL<?>. */
17336 static tree
17339 {
17342 /* If we a constrained-type-specifier cannot be deduced. */
17346 /* A constrained type specifier can only be found in an
17347 overload set or as a reference to a template declaration.
17349 FIXME: This might be masking a bug. It's possible that
17350 that the deduction below is causing template specializations
17351 to be formed with the wildcard as an argument. */
17355 /* Try to build a call expression that evaluates the
17356 concept. This can fail if the overload set refers
17357 only to non-templates. */
17363 /* Deduce the checked constraint and the prototype parameter.
17365 FIXME: In certain cases, failure to deduce should be a
17366 diagnosable error. */
17367 tree conc;
17368 tree proto;
17372 /* In template parameter scope, this results in a constrained
17373 parameter. Return a descriptor of that parm. */
17377 /* In a parameter-declaration-clause, constrained-type
17378 specifiers result in invented template parameters. */
17380 {
17383 }
17384 else
17385 {
17386 /* Otherwise, we're in a context where the constrained
17387 type name is deduced and the constraint applies
17388 after deduction. */
17390 }
17393 }
17395 /* If DECL refers to a concept, return a TYPE_DECL representing
17396 the result of using the constrained type specifier in the
17397 current context. DECL refers to a concept if
17399 - it is an overload set containing a function concept taking a single
17400 type argument, or
17402 - it is a variable concept taking a single type argument. */
17404 static tree
17406 {
17412 else
17414 }
17416 /* Check if DECL and ARGS form a partial-concept-id. If so,
17417 assign ID to the resulting constrained placeholder.
17419 Returns true if the partial-concept-id designates a placeholder
17420 and false otherwise. Note that *id is set to NULL_TREE in
17421 this case. */
17423 static tree
17425 {
17427 }
17429 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17430 or a concept-name.
17432 enum-name:
17433 identifier
17435 typedef-name:
17436 identifier
17438 concept-name:
17439 identifier
17441 Returns a TYPE_DECL for the type. */
17443 static tree
17445 {
17446 tree type_decl;
17447 tree identifier;
17454 /* Look up the type-name. */
17459 /* If we found an overload set, then it may refer to a concept-name. */
17465 {
17466 /* See if this is an Objective-C type. */
17471 }
17473 /* Issue an error if we did not find a type-name. */
17475 /* In Objective-C, we have the complication that class names are
17476 normally type names and start declarations (eg, the
17477 "NSObject" in "NSObject *object;"), but can be used in an
17478 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17479 is an expression. So, a classname followed by a dot is not a
17480 valid type-name. */
17483 {
17488 }
17489 /* Remember that the name was used in the definition of the
17490 current class so that we can check later to see if the
17491 meaning would have been different after the class was
17492 entirely defined. */
17498 }
17500 /* Parse an elaborated-type-specifier. Note that the grammar given
17501 here incorporates the resolution to DR68.
17503 elaborated-type-specifier:
17504 class-key :: [opt] nested-name-specifier [opt] identifier
17505 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17506 enum-key :: [opt] nested-name-specifier [opt] identifier
17507 typename :: [opt] nested-name-specifier identifier
17508 typename :: [opt] nested-name-specifier template [opt]
17509 template-id
17511 GNU extension:
17513 elaborated-type-specifier:
17514 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17515 class-key attributes :: [opt] nested-name-specifier [opt]
17516 template [opt] template-id
17517 enum attributes :: [opt] nested-name-specifier [opt] identifier
17519 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17520 declared `friend'. If IS_DECLARATION is TRUE, then this
17521 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17522 something is being declared.
17524 Returns the TYPE specified. */
17526 static tree
17530 {
17532 tree identifier;
17535 tree globalscope;
17538 /* See if we're looking at the `enum' keyword. */
17540 {
17541 /* Consume the `enum' token. */
17543 /* Remember that it's an enumeration type. */
17545 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17546 enums) is used here. */
17550 {
17557 /* Consume the `struct' or `class' and parse it anyway. */
17559 }
17560 /* Parse the attributes. */
17562 }
17563 /* Or, it might be `typename'. */
17565 RID_TYPENAME))
17566 {
17567 /* Consume the `typename' token. */
17569 /* Remember that it's a `typename' type. */
17571 }
17572 /* Otherwise it must be a class-key. */
17573 else
17574 {
17578 /* Parse the attributes. */
17580 }
17582 /* Look for the `::' operator. */
17585 /* Look for the nested-name-specifier. */
17586 tree nested_name_specifier;
17588 {
17589 nested_name_specifier
17594 is_declaration);
17597 }
17598 else
17599 /* Even though `typename' is not present, the proposed resolution
17600 to Core Issue 180 says that in `class A<T>::B', `B' should be
17601 considered a type-name, even if `A<T>' is dependent. */
17602 nested_name_specifier
17607 is_declaration);
17608 /* For everything but enumeration types, consider a template-id.
17609 For an enumeration type, consider only a plain identifier. */
17611 {
17613 tree decl;
17615 /* Allow the `template' keyword. */
17617 /* If we didn't see `template', we don't know if there's a
17618 template-id or not. */
17621 /* Parse the template-id. */
17625 tag_type,
17626 is_declaration);
17627 /* If we didn't find a template-id, look for an ordinary
17628 identifier. */
17630 ;
17631 /* We can get here when cp_parser_template_id, called by
17632 cp_parser_class_name with tag_type == none_type, succeeds
17633 and caches a BASELINK. Then, when called again here,
17634 instead of failing and returning an error_mark_node
17635 returns it (see template/typename17.C in C++11).
17636 ??? Could we diagnose this earlier? */
17638 {
17641 }
17642 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17643 in effect, then we must assume that, upon instantiation, the
17644 template will correspond to a class. */
17648 typename_type,
17650 /* If the `typename' keyword is in effect and DECL is not a type
17651 decl, then type is non existent. */
17653 ;
17655 {
17659 /* If the next token is a semicolon, this must be a specialization,
17660 instantiation, or friend declaration. Check the scope while we
17661 still know whether or not we had a nested-name-specifier. */
17666 }
17669 }
17672 {
17677 {
17680 }
17682 /* For a `typename', we needn't call xref_tag. */
17688 /* Template parameter lists apply only if we are not within a
17689 function parameter list. */
17690 bool template_parm_lists_apply
17699 /* Look up a qualified name in the usual way. */
17701 {
17702 tree decl;
17703 tree ambiguous_decls;
17706 tag_type,
17713 /* If the lookup was ambiguous, an error will already have been
17714 issued. */
17718 /* If we are parsing friend declaration, DECL may be a
17719 TEMPLATE_DECL tree node here. However, we need to check
17720 whether this TEMPLATE_DECL results in valid code. Consider
17721 the following example:
17723 namespace N {
17724 template <class T> class C {};
17725 }
17726 class X {
17727 template <class T> friend class N::C; // #1, valid code
17728 };
17729 template <class T> class Y {
17730 friend class N::C; // #2, invalid code
17731 };
17733 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17734 name lookup of `N::C'. We see that friend declaration must
17735 be template for the code to be valid. Note that
17736 processing_template_decl does not work here since it is
17737 always 1 for the above two cases. */
17739 decl = (cp_parser_maybe_treat_template_as_class
17744 {
17746 identifier,
17749 }
17752 {
17756 allow_template);
17760 }
17762 /* Forward declarations of nested types, such as
17764 class C1::C2;
17765 class C1::C2::C3;
17767 are invalid unless all components preceding the final '::'
17768 are complete. If all enclosing types are complete, these
17769 declarations become merely pointless.
17771 Invalid forward declarations of nested types are errors
17772 caught elsewhere in parsing. Those that are pointless arrive
17773 here. */
17780 }
17781 else
17782 {
17783 /* An elaborated-type-specifier sometimes introduces a new type and
17784 sometimes names an existing type. Normally, the rule is that it
17785 introduces a new type only if there is not an existing type of
17786 the same name already in scope. For example, given:
17788 struct S {};
17789 void f() { struct S s; }
17791 the `struct S' in the body of `f' is the same `struct S' as in
17792 the global scope; the existing definition is used. However, if
17793 there were no global declaration, this would introduce a new
17794 local class named `S'.
17796 An exception to this rule applies to the following code:
17798 namespace N { struct S; }
17800 Here, the elaborated-type-specifier names a new type
17801 unconditionally; even if there is already an `S' in the
17802 containing scope this declaration names a new type.
17803 This exception only applies if the elaborated-type-specifier
17804 forms the complete declaration:
17806 [class.name]
17808 A declaration consisting solely of `class-key identifier ;' is
17809 either a redeclaration of the name in the current scope or a
17810 forward declaration of the identifier as a class name. It
17811 introduces the name into the current scope.
17813 We are in this situation precisely when the next token is a `;'.
17815 An exception to the exception is that a `friend' declaration does
17816 *not* name a new type; i.e., given:
17818 struct S { friend struct T; };
17820 `T' is not a new type in the scope of `S'.
17822 Also, `new struct S' or `sizeof (struct S)' never results in the
17823 definition of a new type; a new type can only be declared in a
17824 declaration context. */
17826 tag_scope ts;
17830 /* Friends have special name lookup rules. */
17834 CPP_SEMICOLON))
17835 /* This is a `class-key identifier ;' */
17837 else
17840 template_p =
17841 (template_parm_lists_apply
17844 /* An unqualified name was used to reference this type, so
17845 there were no qualifying templates. */
17853 }
17854 }
17859 /* Allow attributes on forward declarations of classes. */
17861 {
17871 else
17874 }
17877 {
17878 /* Indicate whether this class was declared as a `class' or as a
17879 `struct'. */
17883 }
17885 /* A "<" cannot follow an elaborated type specifier. If that
17886 happens, the user was probably trying to form a template-id. */
17891 }
17893 /* Parse an enum-specifier.
17895 enum-specifier:
17896 enum-head { enumerator-list [opt] }
17897 enum-head { enumerator-list , } [C++0x]
17899 enum-head:
17900 enum-key identifier [opt] enum-base [opt]
17901 enum-key nested-name-specifier identifier enum-base [opt]
17903 enum-key:
17904 enum
17905 enum class [C++0x]
17906 enum struct [C++0x]
17908 enum-base: [C++0x]
17909 : type-specifier-seq
17911 opaque-enum-specifier:
17912 enum-key identifier enum-base [opt] ;
17914 GNU Extensions:
17915 enum-key attributes[opt] identifier [opt] enum-base [opt]
17916 { enumerator-list [opt] }attributes[opt]
17917 enum-key attributes[opt] identifier [opt] enum-base [opt]
17918 { enumerator-list, }attributes[opt] [C++0x]
17920 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17921 if the token stream isn't an enum-specifier after all. */
17923 static tree
17925 {
17926 tree identifier;
17928 tree prev_scope;
17930 tree attributes;
17943 /* Parse tentatively so that we can back up if we don't find a
17944 enum-specifier. */
17947 /* Caller guarantees that the current token is 'enum', an identifier
17948 possibly follows, and the token after that is an opening brace.
17949 If we don't have an identifier, fabricate an anonymous name for
17950 the enumeration being defined. */
17953 /* Parse the "class" or "struct", which indicates a scoped
17954 enumeration type in C++0x. */
17957 {
17961 /* Consume the `struct' or `class' token. */
17965 }
17969 /* Clear the qualification. */
17974 /* Figure out in what scope the declaration is being placed. */
17980 nested_name_specifier
17988 {
17989 tree name;
17993 enum_type,
17998 input_location);
18000 {
18003 {
18004 /* Are template enums allowed in ISO? */
18008 /* ignore a typename reference, for it will be solved by name
18009 in start_enum. */
18011 }
18012 }
18015 else
18016 {
18021 }
18022 }
18023 else
18024 {
18027 else
18028 {
18034 }
18035 }
18038 /* Check for the `:' that denotes a specified underlying type in C++0x.
18039 Note that a ':' could also indicate a bitfield width, however. */
18041 {
18042 cp_decl_specifier_seq type_specifiers;
18044 /* Consume the `:'. */
18047 /* Parse the type-specifier-seq. */
18052 /* At this point this is surely not elaborated type specifier. */
18061 /* If that didn't work, stop. */
18063 {
18069 }
18070 }
18072 /* Look for the `{' but don't consume it yet. */
18074 {
18076 {
18079 {
18082 }
18083 }
18084 /* An opaque-enum-specifier must have a ';' here. */
18087 {
18090 {
18093 }
18094 }
18095 }
18101 {
18103 {
18107 }
18109 {
18111 }
18112 }
18114 /* Issue an error message if type-definitions are forbidden here. */
18117 else
18118 /* Create the new type. We do this before consuming the opening
18119 brace so the enum will be recorded as being on the line of its
18120 tag (or the 'enum' keyword, if there is no tag). */
18124 /* If the next token is not '{' it is an opaque-enum-specifier or an
18125 elaborated-type-specifier. */
18127 {
18131 {
18132 /* The following catches invalid code such as:
18133 enum class S<int>::E { A, B, C }; */
18141 {
18145 nested_name_specifier);
18147 }
18150 {
18152 "%qT for enum declaration does not name a class "
18155 }
18156 /* If that scope does not contain the scope in which the
18157 class was originally declared, the program is invalid. */
18159 nested_name_specifier))
18160 {
18163 "declaration of %qD in namespace %qD which does not "
18166 else
18168 "declaration of %qD in %qD which does not "
18172 }
18173 /* If that scope is the scope where the declaration is being placed
18174 the program is invalid. */
18178 {
18182 }
18183 }
18188 /* Consume the opening brace. */
18189 matching_braces braces;
18196 {
18200 }
18201 else
18202 {
18208 }
18212 /* If the next token is not '}', then there are some enumerators. */
18214 {
18218 }
18219 else
18222 /* Consume the final '}'. */
18228 }
18229 else
18230 {
18231 /* If a ';' follows, then it is an opaque-enum-specifier
18232 and additional restrictions apply. */
18234 {
18241 }
18242 }
18244 /* Look for trailing attributes to apply to this enumeration, and
18245 apply them if appropriate. */
18247 {
18250 trailing_attr,
18252 }
18254 /* Finish up the enumeration. */
18256 {
18261 }
18264 {
18266 {
18269 }
18271 {
18273 }
18274 }
18275 out:
18278 }
18280 /* Parse an enumerator-list. The enumerators all have the indicated
18281 TYPE.
18283 enumerator-list:
18284 enumerator-definition
18285 enumerator-list , enumerator-definition */
18287 static void
18289 {
18291 {
18292 /* Parse an enumerator-definition. */
18295 /* If the next token is not a ',', we've reached the end of
18296 the list. */
18299 /* Otherwise, consume the `,' and keep going. */
18301 /* If the next token is a `}', there is a trailing comma. */
18303 {
18308 }
18309 }
18310 }
18312 /* Parse an enumerator-definition. The enumerator has the indicated
18313 TYPE.
18315 enumerator-definition:
18316 enumerator
18317 enumerator = constant-expression
18319 enumerator:
18320 identifier
18322 GNU Extensions:
18324 enumerator-definition:
18325 enumerator attributes [opt]
18326 enumerator attributes [opt] = constant-expression */
18328 static void
18330 {
18331 tree identifier;
18332 tree value;
18333 location_t loc;
18335 /* Save the input location because we are interested in the location
18336 of the identifier and not the location of the explicit value. */
18339 /* Look for the identifier. */
18344 /* Parse any specified attributes. */
18347 /* If the next token is an '=', then there is an explicit value. */
18349 {
18350 /* Consume the `=' token. */
18352 /* Parse the value. */
18354 }
18355 else
18358 /* If we are processing a template, make sure the initializer of the
18359 enumerator doesn't contain any bare template parameter pack. */
18363 /* Create the enumerator. */
18365 }
18367 /* Parse a namespace-name.
18369 namespace-name:
18370 original-namespace-name
18371 namespace-alias
18373 Returns the NAMESPACE_DECL for the namespace. */
18375 static tree
18377 {
18378 tree identifier;
18379 tree namespace_decl;
18383 /* Get the name of the namespace. */
18388 /* Look up the identifier in the currently active scope. Look only
18389 for namespaces, due to:
18391 [basic.lookup.udir]
18393 When looking up a namespace-name in a using-directive or alias
18394 definition, only namespace names are considered.
18396 And:
18398 [basic.lookup.qual]
18400 During the lookup of a name preceding the :: scope resolution
18401 operator, object, function, and enumerator names are ignored.
18403 (Note that cp_parser_qualifying_entity only calls this
18404 function if the token after the name is the scope resolution
18405 operator.) */
18407 none_type,
18413 /* If it's not a namespace, issue an error. */
18416 {
18418 {
18424 }
18427 }
18430 }
18432 /* Parse a namespace-definition.
18434 namespace-definition:
18435 named-namespace-definition
18436 unnamed-namespace-definition
18438 named-namespace-definition:
18439 original-namespace-definition
18440 extension-namespace-definition
18442 original-namespace-definition:
18443 namespace identifier { namespace-body }
18445 extension-namespace-definition:
18446 namespace original-namespace-name { namespace-body }
18448 unnamed-namespace-definition:
18449 namespace { namespace-body } */
18451 static void
18453 {
18454 tree identifier;
18463 {
18466 }
18468 /* Look for the `namespace' keyword. */
18469 cp_token* token
18472 /* Parse any specified attributes before the identifier. */
18476 {
18480 {
18483 /* Parse any attributes specified after the identifier. */
18485 }
18492 "nested namespace definitions only available with "
18495 /* Nested namespace names can create new namespaces (unlike
18496 other qualified-ids). */
18499 else
18502 }
18514 /* Start the namespace. */
18521 /* Look for the `{' to validate starting the namespace. */
18522 matching_braces braces;
18524 {
18525 /* Parse the body of the namespace. */
18528 /* Look for the final `}'. */
18530 }
18535 /* Pop the nested namespace definitions. */
18538 }
18540 /* Parse a namespace-body.
18542 namespace-body:
18543 declaration-seq [opt] */
18545 static void
18547 {
18549 }
18551 /* Parse a namespace-alias-definition.
18553 namespace-alias-definition:
18554 namespace identifier = qualified-namespace-specifier ; */
18556 static void
18558 {
18559 tree identifier;
18560 tree namespace_specifier;
18564 /* Look for the `namespace' keyword. */
18566 /* Look for the identifier. */
18570 /* Look for the `=' token. */
18573 {
18575 /* Skip the definition. */
18580 }
18582 /* Look for the qualified-namespace-specifier. */
18583 namespace_specifier
18585 /* Look for the `;' token. */
18588 /* Register the alias in the symbol table. */
18590 }
18592 /* Parse a qualified-namespace-specifier.
18594 qualified-namespace-specifier:
18595 :: [opt] nested-name-specifier [opt] namespace-name
18597 Returns a NAMESPACE_DECL corresponding to the specified
18598 namespace. */
18600 static tree
18602 {
18603 /* Look for the optional `::'. */
18607 /* Look for the optional nested-name-specifier. */
18615 }
18617 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18618 access declaration.
18620 using-declaration:
18621 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18622 using :: unqualified-id ;
18624 access-declaration:
18625 qualified-id ;
18627 */
18629 static bool
18632 {
18636 tree decl;
18637 tree identifier;
18638 tree qscope;
18643 {
18646 }
18647 else
18648 {
18649 /* Look for the `using' keyword. */
18652 again:
18653 /* Peek at the next token. */
18655 /* See if it's `typename'. */
18657 {
18658 /* Remember that we've seen it. */
18660 /* Consume the `typename' token. */
18662 }
18663 }
18665 /* Look for the optional global scope qualification. */
18666 global_scope_p
18671 /* If we saw `typename', or didn't see `::', then there must be a
18672 nested-name-specifier present. */
18674 {
18680 {
18683 }
18684 }
18685 /* Otherwise, we could be in either of the two productions. In that
18686 case, treat the nested-name-specifier as optional. */
18687 else
18699 /* Something has already gone wrong; there's no need to parse
18700 further. Since an error has occurred, the return value of
18701 cp_parser_parse_definitely will be false, as required. */
18705 /* Parse the unqualified-id. */
18713 {
18718 }
18720 {
18725 "pack expansion in using-declaration only available "
18728 }
18730 /* The function we call to handle a using-declaration is different
18731 depending on what scope we are in. */
18733 ;
18736 /* [namespace.udecl]
18738 A using declaration shall not name a template-id. */
18741 else
18742 {
18744 {
18745 /* Create the USING_DECL. */
18752 {
18755 }
18756 else
18757 /* Add it to the list of members in this class. */
18759 }
18760 else
18761 {
18763 identifier,
18770 {
18773 }
18776 else
18778 }
18779 }
18783 {
18787 "comma-separated list in using-declaration only available "
18790 }
18792 /* Look for the final `;'. */
18797 "access declarations are deprecated "
18798 "in favour of using-declarations; "
18802 }
18804 /* Parse an alias-declaration.
18806 alias-declaration:
18807 using identifier attribute-specifier-seq [opt] = type-id */
18809 static tree
18811 {
18813 location_t id_location;
18815 cp_decl_specifier_seq decl_specs;
18819 /* Look for the `using' keyword. */
18820 cp_token *using_token
18842 /* Now we are going to parse the type-id of the declaration. */
18844 /*
18845 [dcl.type]/3 says:
18847 "A type-specifier-seq shall not define a class or enumeration
18848 unless it appears in the type-id of an alias-declaration (7.1.3) that
18849 is not the declaration of a template-declaration."
18851 In other words, if we currently are in an alias template, the
18852 type-id should not define a type.
18854 So let's set parser->type_definition_forbidden_message in that
18855 case; cp_parser_check_type_definition (called by
18856 cp_parser_class_specifier) will then emit an error if a type is
18857 defined in the type-id. */
18859 {
18863 }
18867 /* Restore the error message if need be. */
18873 {
18876 }
18878 /* A typedef-name can also be introduced by an alias-declaration. The
18879 identifier following the using keyword becomes a typedef-name. It has
18880 the same semantics as if it were introduced by the typedef
18881 specifier. In particular, it does not define a new type and it shall
18882 not appear in the type-id. */
18887 {
18890 ds_attribute,
18891 attrs_token);
18892 }
18894 ds_typedef,
18895 using_token);
18897 ds_alias,
18898 using_token);
18907 else
18913 // Attach constraints to the alias declaration.
18915 {
18919 }
18926 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18927 added into the symbol table; otherwise, return the TYPE_DECL. */
18931 {
18935 }
18938 }
18940 /* Parse a using-directive.
18942 using-directive:
18943 using namespace :: [opt] nested-name-specifier [opt]
18944 namespace-name ; */
18946 static void
18948 {
18949 tree namespace_decl;
18950 tree attribs;
18952 /* Look for the `using' keyword. */
18954 /* And the `namespace' keyword. */
18956 /* Look for the optional `::' operator. */
18958 /* And the optional nested-name-specifier. */
18964 /* Get the namespace being used. */
18966 /* And any specified attributes. */
18969 /* Update the symbol table. */
18972 else
18975 /* Look for the final `;'. */
18977 }
18979 /* Parse an asm-definition.
18981 asm-definition:
18982 asm ( string-literal ) ;
18984 GNU Extension:
18986 asm-definition:
18987 asm volatile [opt] ( string-literal ) ;
18988 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18989 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18990 : asm-operand-list [opt] ) ;
18991 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18992 : asm-operand-list [opt]
18993 : asm-clobber-list [opt] ) ;
18994 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18995 : asm-clobber-list [opt]
18996 : asm-goto-list ) ; */
18998 static void
19000 {
19001 tree string;
19006 tree asm_stmt;
19014 /* Look for the `asm' keyword. */
19019 {
19022 }
19024 /* See if the next token is `volatile'. */
19027 {
19028 /* Remember that we saw the `volatile' keyword. */
19030 /* Consume the token. */
19032 }
19036 {
19037 /* Remember that we saw the `goto' keyword. */
19039 /* Consume the token. */
19041 }
19042 /* Look for the opening `('. */
19045 /* Look for the string. */
19048 {
19052 }
19054 /* If we're allowing GNU extensions, check for the extended assembly
19055 syntax. Unfortunately, the `:' tokens need not be separated by
19056 a space in C, and so, for compatibility, we tolerate that here
19057 too. Doing that means that we have to treat the `::' operator as
19058 two `:' tokens. */
19063 {
19068 /* The extended syntax was used. */
19071 /* Look for outputs. */
19073 {
19074 /* Consume the `:'. */
19076 /* Parse the output-operands. */
19078 CPP_COLON)
19080 CPP_SCOPE)
19082 CPP_CLOSE_PAREN)
19084 {
19088 }
19089 }
19090 /* If the next token is `::', there are no outputs, and the
19091 next token is the beginning of the inputs. */
19093 /* The inputs are coming next. */
19096 /* Look for inputs. */
19099 {
19100 /* Consume the `:' or `::'. */
19102 /* Parse the output-operands. */
19104 CPP_COLON)
19106 CPP_SCOPE)
19108 CPP_CLOSE_PAREN))
19109 {
19113 }
19114 }
19116 /* The clobbers are coming next. */
19119 /* Look for clobbers. */
19122 {
19124 /* Consume the `:' or `::'. */
19126 /* Parse the clobbers. */
19128 CPP_COLON)
19130 CPP_CLOSE_PAREN))
19132 }
19135 /* The labels are coming next. */
19138 /* Look for labels. */
19141 {
19143 /* Consume the `:' or `::'. */
19145 /* Parse the labels. */
19147 }
19151 }
19155 /* Look for the closing `)'. */
19163 {
19164 /* Create the ASM_EXPR. */
19166 {
19169 /* If the extended syntax was not used, mark the ASM_EXPR. */
19171 {
19177 }
19178 }
19179 else
19181 }
19182 }
19184 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19185 type that comes from the decl-specifier-seq. */
19187 static tree
19189 {
19192 {
19205 }
19208 }
19210 /* Declarators [gram.dcl.decl] */
19212 /* Parse an init-declarator.
19214 init-declarator:
19215 declarator initializer [opt]
19217 GNU Extension:
19219 init-declarator:
19220 declarator asm-specification [opt] attributes [opt] initializer [opt]
19222 function-definition:
19223 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19224 function-body
19225 decl-specifier-seq [opt] declarator function-try-block
19227 GNU Extension:
19229 function-definition:
19230 __extension__ function-definition
19232 TM Extension:
19234 function-definition:
19235 decl-specifier-seq [opt] declarator function-transaction-block
19237 The DECL_SPECIFIERS apply to this declarator. Returns a
19238 representation of the entity declared. If MEMBER_P is TRUE, then
19239 this declarator appears in a class scope. The new DECL created by
19240 this declarator is returned.
19242 The CHECKS are access checks that should be performed once we know
19243 what entity is being declared (and, therefore, what classes have
19244 befriended it).
19246 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19247 for a function-definition here as well. If the declarator is a
19248 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19249 be TRUE upon return. By that point, the function-definition will
19250 have been completely parsed.
19252 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19253 is FALSE.
19255 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19256 parsed declaration if it is an uninitialized single declarator not followed
19257 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19258 if present, will not be consumed. If returned, this declarator will be
19259 created with SD_INITIALIZED but will not call cp_finish_decl.
19261 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19262 and there is an initializer, the pointed location_t is set to the
19263 location of the '=' or `(', or '{' in C++11 token introducing the
19264 initializer. */
19266 static tree
19277 {
19281 tree prefix_attributes;
19283 tree asm_specification;
19284 tree initializer;
19286 tree scope;
19288 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19289 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19290 "(...)". */
19301 /* Gather the attributes that were provided with the
19302 decl-specifiers. */
19305 /* Assume that this is not the declarator for a function
19306 definition. */
19310 /* Default arguments are only permitted for function parameters. */
19314 /* Defer access checks while parsing the declarator; we cannot know
19315 what names are accessible until we know what is being
19316 declared. */
19321 /* Parse the declarator. */
19322 declarator
19327 /* Gather up the deferred checks. */
19332 /* If the DECLARATOR was erroneous, there's no need to go
19333 further. */
19337 /* Check that the number of template-parameter-lists is OK. */
19347 /* Figure out what scope the entity declared by the DECLARATOR is
19348 located in. `grokdeclarator' sometimes changes the scope, so
19349 we compute it now. */
19352 /* Perform any lookups in the declared type which were thought to be
19353 dependent, but are not in the scope of the declarator. */
19354 decl_specifiers->type
19357 /* If we're allowing GNU extensions, look for an
19358 asm-specification. */
19360 {
19361 /* Look for an asm-specification. */
19364 }
19365 else
19368 /* Look for attributes. */
19372 /* Peek at the next token. */
19378 {
19379 /* Handle C++17 deduction guides. */
19383 {
19391 {
19395 }
19396 }
19398 /* Check to see if the token indicates the start of a
19399 function-definition. */
19401 {
19403 {
19404 /* If a function-definition should not appear here, issue an
19405 error message. */
19409 }
19411 location_t func_brace_location
19414 /* Neither attributes nor an asm-specification are allowed
19415 on a function-definition. */
19418 "an asm-specification is not allowed "
19422 "attributes are not allowed "
19424 /* This is a function-definition. */
19427 /* Parse the function definition. */
19430 decl_specifiers,
19431 declarator,
19432 prefix_attributes);
19433 else
19434 decl =
19435 (cp_parser_function_definition_from_specifiers_and_declarator
19439 {
19440 /* This is where the prologue starts... */
19443 }
19446 }
19447 }
19449 {
19450 /* A non-template declaration involving a function parameter list
19451 containing an implicit template parameter will be made into a
19452 template. If the resulting declaration is not going to be an
19453 actual function then finish the template scope here to prevent it.
19454 An error message will be issued once we have a decl to talk about.
19456 FIXME probably we should do type deduction rather than create an
19457 implicit template, but the standard currently doesn't allow it. */
19460 }
19462 /* [dcl.dcl]
19464 Only in function declarations for constructors, destructors, type
19465 conversions, and deduction guides can the decl-specifier-seq be omitted.
19467 We explicitly postpone this check past the point where we handle
19468 function-definitions because we tolerate function-definitions
19469 that are missing their return types in some modes. */
19471 {
19475 }
19477 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19481 {
19492 {
19498 }
19499 }
19500 else
19501 {
19502 /* If the init-declarator isn't initialized and isn't followed by a
19503 `,' or `;', it's not a valid init-declarator. */
19506 {
19509 else
19510 {
19514 }
19515 }
19518 }
19520 /* Because start_decl has side-effects, we should only call it if we
19521 know we're going ahead. By this point, we know that we cannot
19522 possibly be looking at any other construct. */
19525 /* Enter the newly declared entry in the symbol table. If we're
19526 processing a declaration in a class-specifier, we wait until
19527 after processing the initializer. */
19529 {
19537 /* Adjust location of decl if declarator->id_loc is more appropriate:
19538 set, and decl wasn't merged with another decl, in which case its
19539 location would be different from input_location, and more accurate. */
19544 }
19546 /* Enter the SCOPE. That way unqualified names appearing in the
19547 initializer will be looked up in SCOPE. */
19550 /* Perform deferred access control checks, now that we know in which
19551 SCOPE the declared entity resides. */
19553 {
19556 /* If the entity being declared is a function, pretend that we
19557 are in its scope. If it is a `friend', it may have access to
19558 things that would not otherwise be accessible. */
19560 {
19563 }
19565 /* Perform access checks for template parameters. */
19568 /* Perform the access control checks for the declarator and the
19569 decl-specifiers. */
19572 /* Restore the saved value. */
19575 }
19577 /* Parse the initializer. */
19582 {
19584 {
19587 else
19588 {
19589 /* If the declaration was erroneous, we don't really
19590 know what the user intended, so just silently
19591 consume the initializer. */
19598 }
19599 }
19600 else
19601 {
19602 /* We want to record the extra mangling scope for in-class
19603 initializers of class members and initializers of static data
19604 member templates. The former involves deferring
19605 parsing of the initializer until end of class as with default
19606 arguments. So right here we only handle the latter. */
19616 }
19617 }
19619 /* The old parser allows attributes to appear after a parenthesized
19620 initializer. Mark Mitchell proposed removing this functionality
19621 on the GCC mailing lists on 2002-08-13. This parser accepts the
19622 attributes -- but ignores them. */
19629 /* And now complain about a non-function implicit template. */
19634 /* For an in-class declaration, use `grokfield' to create the
19635 declaration. */
19637 {
19639 {
19642 }
19651 }
19653 /* Finish processing the declaration. But, skip member
19654 declarations. */
19656 {
19659 asm_specification,
19660 /* If the initializer is in parentheses, then this is
19661 a direct-initialization, which means that an
19662 `explicit' constructor is OK. Otherwise, an
19663 `explicit' constructor cannot be used. */
19666 }
19669 /* Core issue #226 (C++0x only): A default template-argument
19670 shall not be specified in a friend class template
19671 declaration. */
19680 {
19683 else
19685 }
19692 }
19694 /* Parse a declarator.
19696 declarator:
19697 direct-declarator
19698 ptr-operator declarator
19700 abstract-declarator:
19701 ptr-operator abstract-declarator [opt]
19702 direct-abstract-declarator
19704 GNU Extensions:
19706 declarator:
19707 attributes [opt] direct-declarator
19708 attributes [opt] ptr-operator declarator
19710 abstract-declarator:
19711 attributes [opt] ptr-operator abstract-declarator [opt]
19712 attributes [opt] direct-abstract-declarator
19714 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19715 detect constructors, destructors, deduction guides, or conversion operators.
19716 It is set to -1 if the declarator is a name, and +1 if it is a
19717 function. Otherwise it is set to zero. Usually you just want to
19718 test for >0, but internally the negative value is used.
19720 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19721 a decl-specifier-seq unless it declares a constructor, destructor,
19722 or conversion. It might seem that we could check this condition in
19723 semantic analysis, rather than parsing, but that makes it difficult
19724 to handle something like `f()'. We want to notice that there are
19725 no decl-specifiers, and therefore realize that this is an
19726 expression, not a declaration.)
19728 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19729 the declarator is a direct-declarator of the form "(...)".
19731 MEMBER_P is true iff this declarator is a member-declarator.
19733 FRIEND_P is true iff this declarator is a friend. */
19737 cp_parser_declarator_kind dcl_kind,
19741 {
19744 cp_cv_quals cv_quals;
19745 tree class_type;
19748 /* Assume this is not a constructor, destructor, or type-conversion
19749 operator. */
19756 /* Check for the ptr-operator production. */
19758 /* Parse the ptr-operator. */
19764 /* If that worked, then we have a ptr-operator. */
19766 {
19767 /* If a ptr-operator was found, then this declarator was not
19768 parenthesized. */
19771 /* The dependent declarator is optional if we are parsing an
19772 abstract-declarator. */
19776 /* Parse the dependent declarator. */
19781 friend_p);
19783 /* If we are parsing an abstract-declarator, we must handle the
19784 case where the dependent declarator is absent. */
19789 declarator = cp_parser_make_indirect_declarator
19791 }
19792 /* Everything else is a direct-declarator. */
19793 else
19794 {
19797 CPP_OPEN_PAREN);
19799 ctor_dtor_or_conv_p,
19801 }
19806 }
19808 /* Parse a direct-declarator or direct-abstract-declarator.
19810 direct-declarator:
19811 declarator-id
19812 direct-declarator ( parameter-declaration-clause )
19813 cv-qualifier-seq [opt]
19814 ref-qualifier [opt]
19815 exception-specification [opt]
19816 direct-declarator [ constant-expression [opt] ]
19817 ( declarator )
19819 direct-abstract-declarator:
19820 direct-abstract-declarator [opt]
19821 ( parameter-declaration-clause )
19822 cv-qualifier-seq [opt]
19823 ref-qualifier [opt]
19824 exception-specification [opt]
19825 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19826 ( abstract-declarator )
19828 Returns a representation of the declarator. DCL_KIND is
19829 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19830 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19831 we are parsing a direct-declarator. It is
19832 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19833 of ambiguity we prefer an abstract declarator, as per
19834 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19835 as for cp_parser_declarator. */
19839 cp_parser_declarator_kind dcl_kind,
19842 {
19853 {
19854 /* Peek at the next token. */
19857 {
19858 /* This is either a parameter-declaration-clause, or a
19859 parenthesized declarator. When we know we are parsing a
19860 named declarator, it must be a parenthesized declarator
19861 if FIRST is true. For instance, `(int)' is a
19862 parameter-declaration-clause, with an omitted
19863 direct-abstract-declarator. But `((*))', is a
19864 parenthesized abstract declarator. Finally, when T is a
19865 template parameter `(T)' is a
19866 parameter-declaration-clause, and not a parenthesized
19867 named declarator.
19869 We first try and parse a parameter-declaration-clause,
19870 and then try a nested declarator (if FIRST is true).
19872 It is not an error for it not to be a
19873 parameter-declaration-clause, even when FIRST is
19874 false. Consider,
19876 int i (int);
19877 int i (3);
19879 The first is the declaration of a function while the
19880 second is the definition of a variable, including its
19881 initializer.
19883 Having seen only the parenthesis, we cannot know which of
19884 these two alternatives should be selected. Even more
19885 complex are examples like:
19887 int i (int (a));
19888 int i (int (3));
19890 The former is a function-declaration; the latter is a
19891 variable initialization.
19893 Thus again, we try a parameter-declaration-clause, and if
19894 that fails, we back out and return. */
19897 {
19898 tree params;
19903 /* In a member-declarator, the only valid interpretation
19904 of a parenthesis is the start of a
19905 parameter-declaration-clause. (It is invalid to
19906 initialize a static data member with a parenthesized
19907 initializer; only the "=" form of initialization is
19908 permitted.) */
19912 /* Consume the `('. */
19913 matching_parens parens;
19916 {
19917 /* If this is going to be an abstract declarator, we're
19918 in a declarator and we can't have default args. */
19921 }
19925 /* Parse the parameter-declaration-clause. */
19928 /* Consume the `)'. */
19931 /* If all went well, parse the cv-qualifier-seq,
19932 ref-qualifier and the exception-specification. */
19934 {
19935 cp_cv_quals cv_quals;
19936 cp_virt_specifiers virt_specifiers;
19937 cp_ref_qualifier ref_qual;
19938 tree exception_specification;
19939 tree late_return;
19940 tree attrs;
19950 /* Parse the cv-qualifier-seq. */
19952 /* Parse the ref-qualifier. */
19954 /* Parse the tx-qualifier. */
19956 /* And the exception-specification. */
19957 exception_specification
19962 /* In here, we handle cases where attribute is used after
19963 the function declaration. For example:
19964 void func (int x) __attribute__((vector(..))); */
19967 late_return = (cp_parser_late_return_type_opt
19971 /* Parse the virt-specifier-seq. */
19974 /* Create the function-declarator. */
19976 params,
19977 cv_quals,
19978 virt_specifiers,
19979 ref_qual,
19980 tx_qual,
19981 exception_specification,
19982 late_return,
19983 requires_clause);
19986 /* Any subsequent parameter lists are to do with
19987 return type, so are not those of the declared
19988 function. */
19990 }
19992 /* Remove the function parms from scope. */
19996 /* Repeat the main loop. */
19998 }
20000 /* If this is the first, we can try a parenthesized
20001 declarator. */
20003 {
20010 /* Consume the `('. */
20011 matching_parens parens;
20013 /* Parse the nested declarator. */
20016 declarator
20022 /* Expect a `)'. */
20030 }
20031 /* Otherwise, we must be done. */
20032 else
20034 }
20038 {
20039 /* Parse an array-declarator. */
20049 /* Consume the `['. */
20051 /* Peek at the next token. */
20053 /* If the next token is `]', then there is no
20054 constant-expression. */
20056 {
20058 bounds
20068 {
20069 /* Normally, the array bound must be an integral constant
20070 expression. However, as an extension, we allow VLAs
20071 in function scopes as long as they aren't part of a
20072 parameter declaration. */
20076 }
20079 {
20080 /* Remember this wasn't a constant-expression. */
20083 }
20084 }
20085 else
20087 /* Look for the closing `]'. */
20089 {
20092 }
20097 }
20099 {
20100 {
20101 tree qualifying_scope;
20102 tree unqualified_name;
20103 tree attrs;
20104 special_function_kind sfk;
20109 /* Parse a declarator-id */
20112 {
20115 /* If we see an ellipsis, we should be looking at a
20116 parameter pack. */
20118 {
20119 /* Consume the `...' */
20123 }
20124 }
20127 unqualified_name
20131 {
20135 {
20136 /* Check whether an error occurred. */
20139 /* We already consumed the ellipsis to mark a
20140 parameter pack, but we have no way to report it,
20141 so abort the tentative parse. We will be exiting
20142 immediately anyway. */
20144 }
20145 else
20151 && (qualifying_scope
20153 {
20156 }
20157 }
20162 {
20167 }
20173 {
20174 /* In the declaration of a member of a template class
20175 outside of the class itself, the SCOPE will sometimes
20176 be a TYPENAME_TYPE. For example, given:
20178 template <typename T>
20179 int S<T>::R::i = 3;
20181 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20182 this context, we must resolve S<T>::R to an ordinary
20183 type, rather than a typename type.
20185 The reason we normally avoid resolving TYPENAME_TYPEs
20186 is that a specialization of `S' might render
20187 `S<T>::R' not a type. However, if `S' is
20188 specialized, then this `i' will not be used, so there
20189 is no harm in resolving the types here. */
20190 tree type;
20192 /* Resolve the TYPENAME_TYPE. */
20195 /* If that failed, the declarator is invalid. */
20197 {
20200 "cannot define member of dependent typedef "
20202 else
20207 }
20209 }
20214 {
20215 tree class_type;
20220 else
20224 {
20228 {
20229 /* We do not attempt to print the declarator
20230 here because we do not have enough
20231 information about its original syntactic
20232 form. */
20236 }
20239 {
20243 "use %<%T::%D%> instead of %<%T::%D%> to "
20245 class_type,
20250 }
20252 }
20255 {
20262 for an unnamed type, even if the type
20263 got a name for linkage purposes. */
20265 /* Handle correctly (c++/19200):
20267 struct S {
20268 struct T{};
20269 friend void S(T);
20270 };
20272 and also:
20274 namespace N {
20275 void S();
20276 }
20278 struct S {
20279 friend void N::S();
20280 }; */
20283 class_type))
20292 }
20293 }
20295 unqualified_name,
20296 sfk);
20303 }
20305 handle_declarator:;
20308 {
20309 /* Any names that appear after the declarator-id for a
20310 member are looked up in the containing scope. */
20312 {
20313 /* But declarations with qualified-ids can't appear in a
20314 function. */
20318 }
20320 }
20324 /* Default args are only allowed on function
20325 declarations. */
20327 else
20331 }
20332 /* We're done. */
20333 else
20335 }
20337 /* For an abstract declarator, we might wind up with nothing at this
20338 point. That's an error; the declarator is not optional. */
20342 {
20343 /* Record overly parenthesized declarator so we can give a
20344 diagnostic about confusing decl/expr disambiguation. */
20346 {
20347 /* If the open and close parens are on different lines, this
20348 is probably a formatting thing, so ignore. */
20353 }
20356 }
20358 /* If we entered a scope, we must exit it now. */
20366 }
20368 /* Parse a ptr-operator.
20370 ptr-operator:
20371 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20372 * cv-qualifier-seq [opt]
20373 &
20374 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20375 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20377 GNU Extension:
20379 ptr-operator:
20380 & cv-qualifier-seq [opt]
20382 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20383 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20384 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20385 filled in with the TYPE containing the member. *CV_QUALS is
20386 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20387 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20388 Note that the tree codes returned by this function have nothing
20389 to do with the types of trees that will be eventually be created
20390 to represent the pointer or reference type being parsed. They are
20391 just constants with suggestive names. */
20392 static enum tree_code
20397 {
20402 /* Assume that it's not a pointer-to-member. */
20404 /* And that there are no cv-qualifiers. */
20407 /* Peek at the next token. */
20410 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20420 {
20421 /* Consume the `*', `&' or `&&'. */
20424 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20425 `&', if we are allowing GNU extensions. (The only qualifier
20426 that can legally appear after `&' is `restrict', but that is
20427 enforced during semantic analysis. */
20435 }
20436 else
20437 {
20438 /* Try the pointer-to-member case. */
20440 /* Look for the optional `::' operator. */
20443 /* Look for the nested-name specifier. */
20450 /* If we found it, and the next token is a `*', then we are
20451 indeed looking at a pointer-to-member operator. */
20454 {
20455 /* Indicate that the `*' operator was used. */
20463 else
20464 {
20465 /* The type of which the member is a member is given by the
20466 current SCOPE. */
20468 /* The next name will not be qualified. */
20472 /* Look for optional c++11 attributes. */
20476 /* Look for the optional cv-qualifier-seq. */
20478 }
20479 }
20480 /* If that didn't work we don't have a ptr-operator. */
20483 }
20486 }
20488 /* Parse an (optional) cv-qualifier-seq.
20490 cv-qualifier-seq:
20491 cv-qualifier cv-qualifier-seq [opt]
20493 cv-qualifier:
20494 const
20495 volatile
20497 GNU Extension:
20499 cv-qualifier:
20500 __restrict__
20502 Returns a bitmask representing the cv-qualifiers. */
20504 static cp_cv_quals
20506 {
20510 {
20512 cp_cv_quals cv_qualifier;
20514 /* Peek at the next token. */
20516 /* See if it's a cv-qualifier. */
20518 {
20534 }
20540 {
20545 }
20546 else
20547 {
20550 }
20551 }
20554 }
20556 /* Parse an (optional) ref-qualifier
20558 ref-qualifier:
20559 &
20560 &&
20562 Returns cp_ref_qualifier representing ref-qualifier. */
20564 static cp_ref_qualifier
20566 {
20569 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20574 {
20579 {
20591 }
20596 {
20599 }
20600 else
20601 {
20604 }
20605 }
20608 }
20610 /* Parse an optional tx-qualifier.
20612 tx-qualifier:
20613 transaction_safe
20614 transaction_safe_dynamic */
20616 static tree
20618 {
20621 {
20626 {
20630 {
20633 {
20636 }
20637 else
20639 }
20640 }
20641 }
20643 }
20645 /* Parse an (optional) virt-specifier-seq.
20647 virt-specifier-seq:
20648 virt-specifier virt-specifier-seq [opt]
20650 virt-specifier:
20651 override
20652 final
20654 Returns a bitmask representing the virt-specifiers. */
20656 static cp_virt_specifiers
20658 {
20662 {
20664 cp_virt_specifiers virt_specifier;
20666 /* Peek at the next token. */
20668 /* See if it's a virt-specifier-qualifier. */
20672 {
20675 }
20677 {
20680 }
20682 {
20684 }
20685 else
20689 {
20694 }
20695 else
20696 {
20699 }
20700 }
20702 }
20704 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20705 is in scope even though it isn't real. */
20707 void
20709 {
20710 tree this_parm;
20713 {
20714 /* We don't clear this between NSDMIs. Is it already what we want? */
20721 }
20724 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20726 current_class_ref
20729 }
20731 /* Return true iff our current scope is a non-static data member
20732 initializer. */
20734 bool
20736 {
20737 /* We recognize NSDMI context by the context-less 'this' pointer set up
20738 by the function above. */
20744 }
20746 /* Parse a late-specified return type, if any. This is not a separate
20747 non-terminal, but part of a function declarator, which looks like
20749 -> trailing-type-specifier-seq abstract-declarator(opt)
20751 Returns the type indicated by the type-id.
20753 In addition to this, parse any queued up #pragma omp declare simd
20754 clauses, and #pragma acc routine clauses.
20756 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20757 function. */
20759 static tree
20762 {
20766 && declarator
20770 && declarator
20773 /* Peek at the next token. */
20775 /* A late-specified return type is indicated by an initial '->'. */
20786 {
20787 /* DR 1207: 'this' is in scope in the trailing return type. */
20789 }
20792 {
20793 /* Consume the ->. */
20797 }
20799 /* Function declarations may be followed by a trailing
20800 requires-clause. */
20804 declarator->attributes
20808 declarator->attributes
20813 {
20816 }
20819 }
20821 /* Parse a declarator-id.
20823 declarator-id:
20824 id-expression
20825 :: [opt] nested-name-specifier [opt] type-name
20827 In the `id-expression' case, the value returned is as for
20828 cp_parser_id_expression if the id-expression was an unqualified-id.
20829 If the id-expression was a qualified-id, then a SCOPE_REF is
20830 returned. The first operand is the scope (either a NAMESPACE_DECL
20831 or TREE_TYPE), but the second is still just a representation of an
20832 unqualified-id. */
20834 static tree
20836 {
20837 tree id;
20838 /* The expression must be an id-expression. Assume that qualified
20839 names are the names of types so that:
20841 template <class T>
20842 int S<T>::R::i = 3;
20844 will work; we must treat `S<T>::R' as the name of a type.
20845 Similarly, assume that qualified names are templates, where
20846 required, so that:
20848 template <class T>
20849 int S<T>::R<T>::i = 3;
20851 will work, too. */
20857 optional_p);
20861 }
20863 /* Parse a type-id.
20865 type-id:
20866 type-specifier-seq abstract-declarator [opt]
20868 Returns the TYPE specified. */
20870 static tree
20873 {
20874 cp_decl_specifier_seq type_specifier_seq;
20877 /* Parse the type-specifier-seq. */
20879 is_trailing_return,
20884 /* A bare template name as a template argument is a template template
20885 argument, not a placeholder, so fail parsing it as a type argument. */
20886 {
20890 }
20894 /* There might or might not be an abstract declarator. */
20896 /* Look for the declarator. */
20897 abstract_declarator
20902 /* Check to see if there really was a declarator. */
20907 /* The concepts TS allows 'auto' as a type-id. */
20909 /* None of the valid uses of 'auto' in C++14 involve the type-id
20910 nonterminal, but it is valid in a trailing-return-type. */
20913 {
20914 /* A type-id with type 'auto' is only ok if the abstract declarator
20915 is a function declarator with a late-specified return type.
20917 A type-id with 'auto' is also valid in a trailing-return-type
20918 in a compound-requirement. */
20925 else
20926 {
20929 {
20931 auto_node);
20933 tmpl);
20934 }
20935 else
20938 }
20939 }
20942 is_template_arg);
20943 }
20945 static tree
20947 {
20949 }
20951 static tree
20953 {
20954 tree r;
20956 parser->type_definition_forbidden_message
20961 {
20964 }
20966 }
20968 static tree
20970 {
20972 }
20974 /* Parse a type-specifier-seq.
20976 type-specifier-seq:
20977 type-specifier type-specifier-seq [opt]
20979 GNU extension:
20981 type-specifier-seq:
20982 attributes type-specifier-seq [opt]
20984 If IS_DECLARATION is true, we are at the start of a "condition" or
20985 exception-declaration, so we might be followed by a declarator-id.
20987 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20988 i.e. we've just seen "->".
20990 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20992 static void
20997 {
21002 /* Clear the TYPE_SPECIFIER_SEQ. */
21005 /* In the context of a trailing return type, enum E { } is an
21006 elaborated-type-specifier followed by a function-body, not an
21007 enum-specifier. */
21011 /* Parse the type-specifiers and attributes. */
21013 {
21014 tree type_specifier;
21017 /* Check for attributes first. */
21019 {
21020 type_specifier_seq->attributes
21024 }
21026 /* record the token of the beginning of the type specifier seq,
21027 for error reporting purposes*/
21031 /* Look for the type-specifier. */
21033 flags,
21034 type_specifier_seq,
21036 NULL,
21039 {
21040 /* If the first type-specifier could not be found, this is not a
21041 type-specifier-seq at all. */
21043 {
21044 /* Set in_declarator_p to avoid skipping to the semicolon. */
21056 }
21057 /* If subsequent type-specifiers could not be found, the
21058 type-specifier-seq is complete. */
21060 }
21063 /* The standard says that a condition can be:
21065 type-specifier-seq declarator = assignment-expression
21067 However, given:
21069 struct S {};
21070 if (int S = ...)
21072 we should treat the "S" as a declarator, not as a
21073 type-specifier. The standard doesn't say that explicitly for
21074 type-specifier-seq, but it does say that for
21075 decl-specifier-seq in an ordinary declaration. Perhaps it
21076 would be clearer just to allow a decl-specifier-seq here, and
21077 then add a semantic restriction that if any decl-specifiers
21078 that are not type-specifiers appear, the program is invalid. */
21081 }
21082 }
21084 /* Return whether the function currently being declared has an associated
21085 template parameter list. */
21087 static bool
21089 {
21102 }
21104 /* Parse a parameter-declaration-clause.
21106 parameter-declaration-clause:
21107 parameter-declaration-list [opt] ... [opt]
21108 parameter-declaration-list , ...
21110 Returns a representation for the parameter declarations. A return
21111 value of NULL indicates a parameter-declaration-clause consisting
21112 only of an ellipsis. */
21114 static tree
21116 {
21117 tree parameters;
21126 parser->auto_is_implicit_function_template_parm_p
21128 }
21134 && !processing_template_parmlist
21140 /* Peek at the next token. */
21142 /* Check for trivial parameter-declaration-clauses. */
21144 {
21145 /* Consume the `...' token. */
21148 }
21150 /* There are no parameters. */
21151 {
21152 #ifndef NO_IMPLICIT_EXTERN_C
21157 else
21158 #endif
21160 }
21161 /* Check for `(void)', too, which is a special case. */
21165 {
21166 /* Consume the `void' token. */
21168 /* There are no parameters. */
21170 }
21172 /* Parse the parameter-declaration-list. */
21174 /* If a parse error occurred while parsing the
21175 parameter-declaration-list, then the entire
21176 parameter-declaration-clause is erroneous. */
21180 /* Peek at the next token. */
21182 /* If it's a `,', the clause should terminate with an ellipsis. */
21184 {
21185 /* Consume the `,'. */
21187 /* Expect an ellipsis. */
21188 ellipsis_p
21190 }
21191 /* It might also be `...' if the optional trailing `,' was
21192 omitted. */
21194 {
21195 /* Consume the `...' token. */
21197 /* And remember that we saw it. */
21199 }
21200 else
21203 /* Finish the parameter list. */
21208 }
21210 /* Parse a parameter-declaration-list.
21212 parameter-declaration-list:
21213 parameter-declaration
21214 parameter-declaration-list , parameter-declaration
21216 Returns a representation of the parameter-declaration-list, as for
21217 cp_parser_parameter_declaration_clause. However, the
21218 `void_list_node' is never appended to the list. Upon return,
21219 *IS_ERROR will be true iff an error occurred. */
21221 static tree
21223 {
21229 /* Assume all will go well. */
21231 /* The special considerations that apply to a function within an
21232 unbraced linkage specifications do not apply to the parameters
21233 to the function. */
21234 saved_in_unbraced_linkage_specification_p
21238 /* Look for more parameters. */
21240 {
21248 /* Parse the parameter. */
21249 parameter
21254 /* We don't know yet if the enclosing context is deprecated, so wait
21255 and warn in grokparms if appropriate. */
21259 {
21260 /* If a function parameter pack was specified and an implicit template
21261 parameter was introduced during cp_parser_parameter_declaration,
21262 change any implicit parameters introduced into packs. */
21266 {
21274 }
21278 PARM,
21283 }
21287 /* If a parse error occurred parsing the parameter declaration,
21288 then the entire parameter-declaration-list is erroneous. */
21290 {
21294 }
21304 {
21308 }
21310 /* Add the new parameter to the list. */
21314 /* Peek at the next token. */
21317 /* These are for Objective-C++ */
21320 /* The parameter-declaration-list is complete. */
21323 {
21326 /* Peek at the next token. */
21328 /* If it's an ellipsis, then the list is complete. */
21331 /* Otherwise, there must be more parameters. Consume the
21332 `,'. */
21334 /* When parsing something like:
21336 int i(float f, double d)
21338 we can tell after seeing the declaration for "f" that we
21339 are not looking at an initialization of a variable "i",
21340 but rather at the declaration of a function "i".
21342 Due to the fact that the parsing of template arguments
21343 (as specified to a template-id) requires backtracking we
21344 cannot use this technique when inside a template argument
21345 list. */
21349 /* However, a parameter-declaration of the form
21350 "float(f)" (which is a valid declaration of a
21351 parameter "f") can also be interpreted as an
21352 expression (the conversion of "f" to "float"). */
21355 }
21356 else
21357 {
21365 }
21366 }
21368 parser->in_unbraced_linkage_specification_p
21371 /* Reset implicit_template_scope if we are about to leave the function
21372 parameter list that introduced it. Note that for out-of-line member
21373 definitions, there will be one or more class scopes before we get to
21374 the template parameter scope. */
21378 {
21382 {
21385 }
21386 }
21389 }
21391 /* Parse a parameter declaration.
21393 parameter-declaration:
21394 decl-specifier-seq ... [opt] declarator
21395 decl-specifier-seq declarator = assignment-expression
21396 decl-specifier-seq ... [opt] abstract-declarator [opt]
21397 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21399 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21400 declares a template parameter. (In that case, a non-nested `>'
21401 token encountered during the parsing of the assignment-expression
21402 is not interpreted as a greater-than operator.)
21404 Returns a representation of the parameter, or NULL if an error
21405 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21406 true iff the declarator is of the form "(p)". */
21412 {
21414 cp_decl_specifier_seq decl_specifiers;
21416 tree default_argument;
21421 /* In a template parameter, `>' is not an operator.
21423 [temp.param]
21425 When parsing a default template-argument for a non-type
21426 template-parameter, the first non-nested `>' is taken as the end
21427 of the template parameter-list rather than a greater-than
21428 operator. */
21430 /* Type definitions may not appear in parameter types. */
21432 parser->type_definition_forbidden_message
21435 /* Parse the declaration-specifiers. */
21438 CP_PARSER_FLAGS_NONE,
21442 /* Complain about missing 'typename' or other invalid type names. */
21447 /* If an error occurred, there's no reason to attempt to parse the
21448 rest of the declaration. */
21450 {
21453 }
21455 /* Peek at the next token. */
21458 /* If the next token is a `)', `,', `=', `>', or `...', then there
21459 is no declarator. However, when variadic templates are enabled,
21460 there may be a declarator following `...'. */
21465 {
21469 }
21470 /* Otherwise, there should be a declarator. */
21471 else
21472 {
21476 /* After seeing a decl-specifier-seq, if the next token is not a
21477 "(", there is no possibility that the code is a valid
21478 expression. Therefore, if parsing tentatively, we commit at
21479 this point. */
21481 /* In an expression context, having seen:
21483 (int((char ...
21485 we cannot be sure whether we are looking at a
21486 function-type (taking a "char" as a parameter) or a cast
21487 of some object of type "char" to "int". */
21493 /* Parse the declarator. */
21496 CP_PARSER_DECLARATOR_EITHER,
21498 parenthesized_p,
21502 /* After the declarator, allow more attributes. */
21503 decl_specifiers.attributes
21507 /* If the declarator is a template parameter pack, remember that and
21508 clear the flag in the declarator itself so we don't get errors
21509 from grokdeclarator. */
21511 {
21514 }
21515 }
21517 /* If the next token is an ellipsis, and we have not seen a declarator
21518 name, and if either the type of the declarator contains parameter
21519 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21520 for, eg, abbreviated integral type names), then we actually have a
21521 parameter pack expansion expression. Otherwise, leave the ellipsis
21522 for a C-style variadic function. */
21525 {
21536 {
21537 /* Consume the `...'. */
21541 /* Build a pack expansion type */
21546 else
21548 }
21549 }
21551 /* The restriction on defining new types applies only to the type
21552 of the parameter, not to the default argument. */
21555 /* If the next token is `=', then process a default argument. */
21557 {
21560 /* If we are defining a class, then the tokens that make up the
21561 default argument must be saved and processed later. */
21567 // A constrained-type-specifier may declare a type template-parameter.
21569 default_argument
21572 // A constrained-type-specifier may declare a template-template-parameter.
21574 default_argument
21577 /* Outside of a class definition, we can just parse the
21578 assignment-expression. */
21579 else
21580 default_argument
21584 {
21586 "default arguments are only "
21588 }
21590 || template_parameter_pack_p
21593 {
21594 /* Find the name of the parameter pack. */
21601 template_parm_p
21607 else
21609 template_parm_p
21616 }
21617 }
21618 else
21621 /* Generate a location for the parameter, ranging from the start of the
21622 initial token to the end of the final token (using input_location for
21623 the latter, set up by cp_lexer_set_source_position_from_token when
21624 consuming tokens).
21626 If we have a identifier, then use it for the caret location, e.g.
21628 extern int callee (int one, int (*two)(int, int), float three);
21629 ~~~~~~^~~~~~~~~~~~~~
21631 otherwise, reuse the start location for the caret location e.g.:
21633 extern int callee (int one, int (*)(int, int), float three);
21634 ^~~~~~~~~~~~~~~~~
21636 */
21642 input_location);
21645 declarator,
21646 default_argument,
21647 param_loc,
21648 template_parameter_pack_p);
21649 }
21651 /* Parse a default argument and return it.
21653 TEMPLATE_PARM_P is true if this is a default argument for a
21654 non-type template parameter. */
21655 static tree
21657 {
21663 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21664 set correctly. */
21667 /* Local variable names (and the `this' keyword) may not
21668 appear in a default argument. */
21671 /* Parse the assignment-expression. */
21676 /* The "this" pointer is not valid in a default argument. */
21678 {
21683 }
21684 default_argument
21686 /* Restore the "this" pointer. */
21688 {
21691 }
21700 }
21702 /* Parse a function-body.
21704 function-body:
21705 compound_statement */
21707 static void
21709 {
21713 }
21715 /* Parse a ctor-initializer-opt followed by a function-body. Return
21716 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21717 is true we are parsing a function-try-block. */
21719 static void
21722 {
21729 /* Begin the function body. */
21731 /* Parse the optional ctor-initializer. */
21734 /* If we're parsing a constexpr constructor definition, we need
21735 to check that the constructor body is indeed empty. However,
21736 before we get to cp_parser_function_body lot of junk has been
21737 generated, so we can't just check that we have an empty block.
21738 Rather we take a snapshot of the outermost block, and check whether
21739 cp_parser_function_body changed its state. */
21741 {
21745 }
21746 /* Parse the function-body. */
21750 /* Finish the function body. */
21752 }
21754 /* Parse an initializer.
21756 initializer:
21757 = initializer-clause
21758 ( expression-list )
21760 Returns an expression representing the initializer. If no
21761 initializer is present, NULL_TREE is returned.
21763 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21764 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21765 set to TRUE if there is no initializer present. If there is an
21766 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21767 is set to true; otherwise it is set to false. */
21769 static tree
21772 {
21774 tree init;
21776 /* Peek at the next token. */
21779 /* Let our caller know whether or not this initializer was
21780 parenthesized. */
21782 /* Assume that the initializer is constant. */
21786 {
21787 /* Consume the `='. */
21789 /* Parse the initializer-clause. */
21791 }
21793 {
21798 non_constant_p);
21803 }
21805 {
21810 }
21811 else
21812 {
21813 /* Anything else is an error. */
21816 }
21822 }
21824 /* Parse an initializer-clause.
21826 initializer-clause:
21827 assignment-expression
21828 braced-init-list
21830 Returns an expression representing the initializer.
21832 If the `assignment-expression' production is used the value
21833 returned is simply a representation for the expression.
21835 Otherwise, calls cp_parser_braced_list. */
21837 static cp_expr
21839 {
21840 cp_expr initializer;
21842 /* Assume the expression is constant. */
21845 /* If it is not a `{', then we are looking at an
21846 assignment-expression. */
21848 {
21849 initializer
21852 non_constant_p);
21853 }
21854 else
21858 }
21860 /* Parse a brace-enclosed initializer list.
21862 braced-init-list:
21863 { initializer-list , [opt] }
21864 { designated-initializer-list , [opt] }
21865 { }
21867 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21868 the elements of the initializer-list (or NULL, if the last
21869 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21870 NULL_TREE. There is no way to detect whether or not the optional
21871 trailing `,' was provided. NON_CONSTANT_P is as for
21872 cp_parser_initializer. */
21874 static cp_expr
21876 {
21877 tree initializer;
21880 /* Consume the `{' token. */
21881 matching_braces braces;
21883 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21885 /* If it's not a `}', then there is a non-trivial initializer. */
21887 {
21888 /* Parse the initializer list. */
21891 /* A trailing `,' token is allowed. */
21894 }
21895 else
21897 /* Now, there should be a trailing `}'. */
21903 /* Build a location of the form:
21904 { ... }
21905 ^~~~~~~
21906 with caret==start at the open brace, finish at the close brace. */
21910 }
21912 /* Consume tokens up to, and including, the next non-nested closing `]'.
21913 Returns true iff we found a closing `]'. */
21915 static bool
21917 {
21921 {
21925 {
21928 /* If we've run out of tokens, then there is no closing `]'. */
21937 {
21940 }
21945 }
21947 /* Consume the token. */
21949 }
21950 }
21952 /* Return true if we are looking at an array-designator, false otherwise. */
21954 static bool
21956 {
21957 /* Consume the `['. */
21962 /* Skip tokens until the next token is a closing square bracket.
21963 If we find the closing `]', and the next token is a `=', then
21964 we are looking at an array designator. */
21965 bool array_designator_p
21969 /* Roll back the tokens we skipped. */
21973 }
21975 /* Parse an initializer-list.
21977 initializer-list:
21978 initializer-clause ... [opt]
21979 initializer-list , initializer-clause ... [opt]
21981 C++2A Extension:
21983 designated-initializer-list:
21984 designated-initializer-clause
21985 designated-initializer-list , designated-initializer-clause
21987 designated-initializer-clause:
21988 designator brace-or-equal-initializer
21990 designator:
21991 . identifier
21993 GNU Extension:
21995 initializer-list:
21996 designation initializer-clause ...[opt]
21997 initializer-list , designation initializer-clause ...[opt]
21999 designation:
22000 . identifier =
22001 identifier :
22002 [ constant-expression ] =
22004 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22005 for the initializer. If the INDEX of the elt is non-NULL, it is the
22006 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22007 as for cp_parser_initializer. */
22011 {
22016 /* Assume all of the expressions are constant. */
22019 /* Parse the rest of the list. */
22021 {
22023 tree designator;
22024 tree initializer;
22028 /* Handle the C++2A syntax, '. id ='. */
22036 {
22039 "C++ designated initializers only available with "
22041 /* Consume the `.'. */
22043 /* Consume the identifier. */
22046 /* Consume the `='. */
22048 }
22049 /* Also, if the next token is an identifier and the following one is a
22050 colon, we are looking at the GNU designated-initializer
22051 syntax. */
22056 {
22057 /* Warn the user that they are using an extension. */
22060 /* Consume the identifier. */
22062 /* Consume the `:'. */
22064 }
22065 /* Also handle C99 array designators, '[ const ] ='. */
22069 {
22070 /* In C++11, [ could start a lambda-introducer. */
22076 {
22079 }
22080 else
22081 {
22086 }
22091 && (!require_potential_rvalue_constant_expression
22095 /* Warn the user that they are using an extension. */
22098 }
22099 else
22103 {
22106 }
22110 {
22114 }
22118 /* Parse the initializer. */
22121 /* If any clause is non-constant, so is the entire initializer. */
22125 /* If we have an ellipsis, this is an initializer pack
22126 expansion. */
22128 {
22131 /* Consume the `...'. */
22138 /* Turn the initializer into an initializer expansion. */
22140 }
22142 /* Add it to the vector. */
22145 /* If the next token is not a comma, we have reached the end of
22146 the list. */
22150 /* Peek at the next token. */
22152 /* If the next token is a `}', then we're still done. An
22153 initializer-clause can have a trailing `,' after the
22154 initializer-list and before the closing `}'. */
22158 /* Consume the `,' token. */
22160 }
22162 /* The same identifier shall not appear in multiple designators
22163 of a designated-initializer-list. */
22165 {
22170 {
22172 {
22174 "%<.%s%> designator used multiple times in "
22178 }
22179 else
22181 }
22185 }
22188 }
22190 /* Classes [gram.class] */
22192 /* Parse a class-name.
22194 class-name:
22195 identifier
22196 template-id
22198 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22199 to indicate that names looked up in dependent types should be
22200 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22201 keyword has been used to indicate that the name that appears next
22202 is a template. TAG_TYPE indicates the explicit tag given before
22203 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22204 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22205 is the class being defined in a class-head. If ENUM_OK is TRUE,
22206 enum-names are also accepted.
22208 Returns the TYPE_DECL representing the class. */
22210 static tree
22219 {
22220 tree decl;
22221 tree scope;
22226 /* All class-names start with an identifier. */
22229 {
22232 }
22234 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22235 to a template-id, so we save it here. */
22240 /* Any name names a type if we're following the `typename' keyword
22241 in a qualified name where the enclosing scope is type-dependent. */
22244 /* Handle the common case (an identifier, but not a template-id)
22245 efficiently. */
22248 {
22252 /* Look for the identifier. */
22256 /* If the next token isn't an identifier, we are certainly not
22257 looking at a class-name. */
22260 /* If we know this is a type-name, there's no need to look it
22261 up. */
22264 else
22265 {
22266 tree ambiguous_decls;
22267 /* If we already know that this lookup is ambiguous, then
22268 we've already issued an error message; there's no reason
22269 to check again. */
22271 {
22274 }
22275 /* If the next token is a `::', then the name must be a type
22276 name.
22278 [basic.lookup.qual]
22280 During the lookup for a name preceding the :: scope
22281 resolution operator, object, function, and enumerator
22282 names are ignored. */
22285 /* Look up the name. */
22287 tag_type,
22290 check_dependency_p,
22294 {
22298 }
22299 }
22300 }
22301 else
22302 {
22303 /* Try a template-id. */
22305 check_dependency_p,
22306 tag_type,
22307 is_declaration);
22310 }
22314 /* If this is a typename, create a TYPENAME_TYPE. */
22316 {
22321 }
22325 /* Check to see that it is really the name of a class. */
22329 /* Situations like this:
22331 template <typename T> struct A {
22332 typename T::template X<int>::I i;
22333 };
22335 are problematic. Is `T::template X<int>' a class-name? The
22336 standard does not seem to be definitive, but there is no other
22337 valid interpretation of the following `::'. Therefore, those
22338 names are considered class-names. */
22339 {
22343 }
22348 /* In Objective-C 2.0, a classname followed by '.' starts a
22349 dot-syntax expression, and it's not a type-name. */
22361 }
22363 /* Parse a class-specifier.
22365 class-specifier:
22366 class-head { member-specification [opt] }
22368 Returns the TREE_TYPE representing the class. */
22370 static tree
22372 {
22373 tree type;
22387 /* Parse the class-head. */
22390 /* If the class-head was a semantic disaster, skip the entire body
22391 of the class. */
22393 {
22397 }
22399 /* Look for the `{'. */
22400 matching_braces braces;
22402 {
22405 }
22410 /* Issue an error message if type-definitions are forbidden here. */
22412 /* Remember that we are defining one more class. */
22414 /* Inside the class, surrounding template-parameter-lists do not
22415 apply. */
22416 saved_num_template_parameter_lists
22419 /* We are not in a function body. */
22422 /* Or in a loop. */
22425 /* Or in a switch. */
22428 /* We are not immediately inside an extern "lang" block. */
22429 saved_in_unbraced_linkage_specification_p
22433 // Associate constraints with the type.
22437 /* Start the class. */
22439 {
22442 }
22446 /* If the type is erroneous, skip the entire body of the class. */
22448 else
22449 /* Parse the member-specification. */
22452 /* Look for the trailing `}'. */
22454 /* Look for trailing attributes to apply to this class. */
22462 /* We've finished a type definition. Check for the common syntax
22463 error of forgetting a semicolon after the definition. We need to
22464 be careful, as we can't just check for not-a-semicolon and be done
22465 with it; the user might have typed:
22467 class X { } c = ...;
22468 class X { } *p = ...;
22470 and so forth. Instead, enumerate all the possible tokens that
22471 might follow this production; if we don't see one of them, then
22472 complain and silently insert the semicolon. */
22473 {
22478 /* Don't try to parse c++11 attributes here. As per the
22479 grammar, that should be a task for
22480 cp_parser_decl_specifier_seq. */
22484 {
22495 /* While it's legal for type qualifiers and storage class
22496 specifiers to follow type definitions in the grammar, only
22497 compiler testsuites contain code like that. Assume that if
22498 we see such code, then what we're really seeing is a case
22499 like:
22501 class X { }
22502 const <type> var = ...;
22504 or
22506 class Y { }
22507 static <type> func (...) ...
22509 i.e. the qualifier or specifier applies to the next
22510 declaration. To do so, however, we need to look ahead one
22511 more token to see if *that* token is a type specifier.
22513 This code could be improved to handle:
22515 class Z { }
22516 static const <type> var = ...; */
22519 {
22522 /* Handling user-defined types here would be nice, but very
22523 tricky. */
22524 want_semicolon
22527 }
22531 }
22533 /* If we don't have a type, then something is very wrong and we
22534 shouldn't try to do anything clever. Likewise for not seeing the
22535 closing brace. */
22537 {
22538 /* Locate the closing brace. */
22539 cp_token_position prev
22544 /* We want to suggest insertion of a ';' immediately *after* the
22545 closing brace, so, if we can, offset the location by 1 column. */
22552 /* If we successfully offset the location, suggest the fix-it. */
22565 else
22568 /* Unget one token and smash it to look as though we encountered
22569 a semicolon in the input stream. */
22574 }
22575 }
22577 /* If this class is not itself within the scope of another class,
22578 then we need to parse the bodies of all of the queued function
22579 definitions. Note that the queued functions defined in a class
22580 are not always processed immediately following the
22581 class-specifier for that class. Consider:
22583 struct A {
22584 struct B { void f() { sizeof (A); } };
22585 };
22587 If `f' were processed before the processing of `A' were
22588 completed, there would be no way to compute the size of `A'.
22589 Note that the nesting we are interested in here is lexical --
22590 not the semantic nesting given by TYPE_CONTEXT. In particular,
22591 for:
22593 struct A { struct B; };
22594 struct A::B { void f() { } };
22596 there is no need to delay the parsing of `A::B::f'. */
22598 {
22599 tree decl;
22606 /* In a first pass, parse default arguments to the functions.
22607 Then, in a second pass, parse the bodies of the functions.
22608 This two-phased approach handles cases like:
22610 struct S {
22611 void f() { g(); }
22612 void g(int i = 3);
22613 };
22615 */
22617 {
22619 /* If there are default arguments that have not yet been processed,
22620 take care of them now. */
22622 {
22627 }
22628 /* Make sure that any template parameters are in scope. */
22630 /* Parse the default argument expressions. */
22632 /* Remove any template parameters from the symbol table. */
22634 }
22636 /* Now parse any NSDMIs. */
22640 {
22642 {
22647 }
22650 }
22657 /* Now do some post-NSDMI bookkeeping. */
22663 /* Now parse the body of the functions. */
22665 {
22666 /* OpenMP UDRs need to be parsed before all other functions. */
22673 }
22674 else
22678 }
22679 else
22682 /* Put back any saved access checks. */
22685 /* Restore saved state. */
22689 parser->num_template_parameter_lists
22691 parser->in_unbraced_linkage_specification_p
22695 }
22697 static tree
22699 {
22700 tree ret;
22705 }
22707 /* Parse a class-head.
22709 class-head:
22710 class-key identifier [opt] base-clause [opt]
22711 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22712 class-key nested-name-specifier [opt] template-id
22713 base-clause [opt]
22715 class-virt-specifier:
22716 final
22718 GNU Extensions:
22719 class-key attributes identifier [opt] base-clause [opt]
22720 class-key attributes nested-name-specifier identifier base-clause [opt]
22721 class-key attributes nested-name-specifier [opt] template-id
22722 base-clause [opt]
22724 Upon return BASES is initialized to the list of base classes (or
22725 NULL, if there are none) in the same form returned by
22726 cp_parser_base_clause.
22728 Returns the TYPE of the indicated class. Sets
22729 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22730 involving a nested-name-specifier was used, and FALSE otherwise.
22732 Returns error_mark_node if this is not a class-head.
22734 Returns NULL_TREE if the class-head is syntactically valid, but
22735 semantically invalid in a way that means we should skip the entire
22736 body of the class. */
22738 static tree
22741 {
22742 tree nested_name_specifier;
22746 tree attributes;
22747 tree bases;
22757 /* Assume no nested-name-specifier will be present. */
22759 /* Assume no template parameter lists will be used in defining the
22760 type. */
22764 /* Look for the class-key. */
22771 /* Parse the attributes. */
22774 /* If the next token is `::', that is invalid -- but sometimes
22775 people do try to write:
22777 struct ::S {};
22779 Handle this gracefully by accepting the extra qualifier, and then
22780 issuing an error about it later if this really is a
22781 class-head. If it turns out just to be an elaborated type
22782 specifier, remain silent. */
22788 /* Determine the name of the class. Begin by looking for an
22789 optional nested-name-specifier. */
22791 nested_name_specifier
22797 /* If there was a nested-name-specifier, then there *must* be an
22798 identifier. */
22803 {
22805 /* Although the grammar says `identifier', it really means
22806 `class-name' or `template-name'. You are only allowed to
22807 define a class that has already been declared with this
22808 syntax.
22810 The proposed resolution for Core Issue 180 says that wherever
22811 you see `class T::X' you should treat `X' as a type-name.
22813 It is OK to define an inaccessible class; for example:
22815 class A { class B; };
22816 class A::B {};
22818 We do not know if we will see a class-name, or a
22819 template-name. We look for a class-name first, in case the
22820 class-name is a template-id; if we looked for the
22821 template-name first we would stop after the template-name. */
22828 class_type,
22832 /* If that didn't work, ignore the nested-name-specifier. */
22834 {
22840 }
22841 /* If we could not find a corresponding TYPE, treat this
22842 declaration like an unqualified declaration. */
22845 /* Otherwise, count the number of templates used in TYPE and its
22846 containing scopes. */
22847 else
22848 {
22849 tree scope;
22861 }
22862 }
22863 /* Otherwise, the identifier is optional. */
22864 else
22865 {
22866 /* We don't know whether what comes next is a template-id,
22867 an identifier, or nothing at all. */
22869 /* Check for a template-id. */
22874 class_key,
22876 /* If that didn't work, it could still be an identifier. */
22878 {
22880 {
22883 }
22884 else
22886 }
22887 else
22888 {
22891 }
22892 }
22897 {
22899 class_key,
22901 }
22904 /* If it's not a `:' or a `{' then we can't really be looking at a
22905 class-head, since a class-head only appears as part of a
22906 class-specifier. We have to detect this situation before calling
22907 xref_tag, since that has irreversible side-effects. */
22909 {
22913 }
22915 /* At this point, we're going ahead with the class-specifier, even
22916 if some other problem occurs. */
22919 {
22924 }
22925 /* Issue the error about the overly-qualified name now. */
22927 {
22932 }
22934 {
22939 }
22941 {
22942 tree scope;
22945 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22946 keyword template shall not appear at the top level. */
22950 /* Reject typedef-names in class heads. */
22952 {
22955 type);
22958 }
22960 /* Figure out in what scope the declaration is being placed. */
22962 /* If that scope does not contain the scope in which the
22963 class was originally declared, the program is invalid. */
22965 {
22968 "declaration of %qD in namespace %qD which does not "
22971 else
22977 }
22978 /* [dcl.meaning]
22980 A declarator-id shall not be qualified except for the
22981 definition of a ... nested class outside of its class
22982 ... [or] the definition or explicit instantiation of a
22983 class member of a namespace outside of its namespace. */
22985 {
22990 }
22991 }
22992 /* An explicit-specialization must be preceded by "template <>". If
22993 it is not, try to recover gracefully. */
22996 && !processing_template_parmlist
22998 {
22999 /* Build a location of this form:
23000 struct typename <ARGS>
23001 ^~~~~~~~~~~~~~~~~~~~~~
23002 with caret==start at the start token, and
23003 finishing at the end of the type. */
23004 location_t reported_loc
23006 class_head_start_location,
23012 "an explicit specialization must be preceded by"
23015 /* Take the same action that would have been taken by
23016 cp_parser_explicit_specialization. */
23019 }
23020 /* There must be no "return" statements between this point and the
23021 end of this function; set "type "to the correct return value and
23022 use "goto done;" to return. */
23023 /* Make sure that the right number of template parameters were
23024 present. */
23028 {
23029 /* If something went wrong, there is no point in even trying to
23030 process the class-definition. */
23033 }
23035 /* Look up the type. */
23037 {
23041 {
23045 }
23046 else
23047 {
23051 /* Check the scope while we still know whether or not we had a
23052 nested-name-specifier. */
23055 }
23058 }
23060 {
23061 tree class_type;
23063 /* Given:
23065 template <typename T> struct S { struct T };
23066 template <typename T> struct S<T>::T { };
23068 we will get a TYPENAME_TYPE when processing the definition of
23069 `S::T'. We need to resolve it to the actual type before we
23070 try to define it. */
23072 {
23077 else
23078 {
23081 }
23082 }
23086 {
23089 }
23092 /* Enter the scope indicated by the nested-name-specifier. */
23094 /* Get the canonical version of this type. */
23096 /* Call push_template_decl if it seems like we should be defining a
23097 template either from the template headers or the type we're
23098 defining, so that we diagnose both extra and missing headers. */
23102 {
23105 {
23108 }
23109 }
23113 }
23115 {
23116 /* If the class was unnamed, create a dummy name. */
23120 ? ts_within_enclosing_non_class
23124 }
23126 /* Indicate whether this class was declared as a `class' or as a
23127 `struct'. */
23132 /* If this type was already complete, and we see another definition,
23133 that's an error. */
23135 {
23137 type);
23139 type);
23142 }
23147 {
23148 /* Apply attributes now, before any use of the class as a template
23149 argument in its base list. */
23152 }
23154 /* We will have entered the scope containing the class; the names of
23155 base classes should be looked up in that context. For example:
23157 struct A { struct B {}; struct C; };
23158 struct A::C : B {};
23160 is valid. */
23162 /* Get the list of base-classes, if there is one. */
23164 {
23165 /* PR59482: enter the class scope so that base-specifiers are looked
23166 up correctly. */
23170 /* PR59482: get out of the previously pushed class scope so that the
23171 subsequent pops pop the right thing. */
23174 }
23175 else
23178 /* If we're really defining a class, process the base classes.
23179 If they're invalid, fail. */
23183 done:
23184 /* Leave the scope given by the nested-name-specifier. We will
23185 enter the class scope itself while processing the members. */
23190 {
23193 }
23199 out:
23202 }
23204 /* Parse a class-key.
23206 class-key:
23207 class
23208 struct
23209 union
23211 Returns the kind of class-key specified, or none_type to indicate
23212 error. */
23214 static enum tag_types
23216 {
23220 /* Look for the class-key. */
23225 /* Check to see if the TOKEN is a class-key. */
23230 }
23232 /* Parse a type-parameter-key.
23234 type-parameter-key:
23235 class
23236 typename
23237 */
23239 static void
23241 {
23242 /* Look for the type-parameter-key. */
23246 {
23249 /* typename is not allowed in a template template parameter
23250 by the standard until C++17. */
23252 "ISO C++ forbids typename key in template template parameter;"
23254 }
23255 else
23259 }
23261 /* Parse an (optional) member-specification.
23263 member-specification:
23264 member-declaration member-specification [opt]
23265 access-specifier : member-specification [opt] */
23267 static void
23269 {
23271 {
23275 /* Peek at the next token. */
23277 /* If it's a `}', or EOF then we've seen all the members. */
23283 /* See if this token is a keyword. */
23286 {
23290 /* Consume the access-specifier. */
23292 /* Remember which access-specifier is active. */
23294 /* Look for the `:'. */
23299 /* Accept #pragmas at class scope. */
23301 {
23304 }
23306 /* Otherwise, the next construction must be a
23307 member-declaration. */
23309 }
23310 }
23311 }
23313 /* Parse a member-declaration.
23315 member-declaration:
23316 decl-specifier-seq [opt] member-declarator-list [opt] ;
23317 function-definition ; [opt]
23318 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23319 using-declaration
23320 template-declaration
23321 alias-declaration
23323 member-declarator-list:
23324 member-declarator
23325 member-declarator-list , member-declarator
23327 member-declarator:
23328 declarator pure-specifier [opt]
23329 declarator constant-initializer [opt]
23330 identifier [opt] : constant-expression
23332 GNU Extensions:
23334 member-declaration:
23335 __extension__ member-declaration
23337 member-declarator:
23338 declarator attributes [opt] pure-specifier [opt]
23339 declarator attributes [opt] constant-initializer [opt]
23340 identifier [opt] attributes [opt] : constant-expression
23342 C++0x Extensions:
23344 member-declaration:
23345 static_assert-declaration */
23347 static void
23349 {
23350 cp_decl_specifier_seq decl_specifiers;
23351 tree prefix_attributes;
23352 tree decl;
23361 /* Check for the `__extension__' keyword. */
23363 {
23364 /* Recurse. */
23366 /* Restore the old value of the PEDANTIC flag. */
23370 }
23372 /* Check for a template-declaration. */
23374 {
23375 /* An explicit specialization here is an error condition, and we
23376 expect the specialization handler to detect and report this. */
23380 else
23384 }
23385 /* Check for a template introduction. */
23389 /* Check for a using-declaration. */
23391 {
23393 {
23394 /* Parse the using-declaration. */
23398 }
23399 else
23400 {
23401 tree decl;
23405 /* Note that if we actually see the '=' token after the
23406 identifier, cp_parser_alias_declaration commits the
23407 tentative parse. In that case, we really expect an
23408 alias-declaration. Otherwise, we expect a using
23409 declaration. */
23410 alias_decl_expected =
23416 else
23420 }
23421 }
23423 /* Check for @defs. */
23425 {
23430 {
23435 }
23437 }
23439 /* If the next token is `static_assert' we have a static assertion. */
23441 {
23444 }
23451 /* Parse the decl-specifier-seq. */
23454 CP_PARSER_FLAGS_OPTIONAL,
23457 /* Check for an invalid type-name. */
23461 /* If there is no declarator, then the decl-specifier-seq should
23462 specify a type. */
23464 {
23465 /* If there was no decl-specifier-seq, and the next token is a
23466 `;', then we have something like:
23468 struct S { ; };
23470 [class.mem]
23472 Each member-declaration shall declare at least one member
23473 name of the class. */
23475 {
23478 {
23482 }
23483 }
23484 else
23485 {
23486 tree type;
23488 /* See if this declaration is a friend. */
23490 /* If there were decl-specifiers, check to see if there was
23491 a class-declaration. */
23494 /* Nested classes have already been added to the class, but
23495 a `friend' needs to be explicitly registered. */
23497 {
23498 /* If the `friend' keyword was present, the friend must
23499 be introduced with a class-key. */
23502 "in C++03 a class-key must be used "
23504 /* In this case:
23506 template <typename T> struct A {
23507 friend struct A<T>::B;
23508 };
23510 A<T>::B will be represented by a TYPENAME_TYPE, and
23511 therefore not recognized by check_tag_decl. */
23513 {
23517 }
23520 "friend declaration does not name a class or "
23522 else
23525 }
23526 /* If there is no TYPE, an error message will already have
23527 been issued. */
23529 ;
23530 /* An anonymous aggregate has to be handled specially; such
23531 a declaration really declares a data member (with a
23532 particular type), as opposed to a nested class. */
23534 {
23535 /* C++11 9.5/6. */
23538 "a storage class on an anonymous aggregate "
23541 /* Remove constructors and such from TYPE, now that we
23542 know it is an anonymous aggregate. */
23544 /* And make the corresponding data member. */
23547 /* Add it to the class. */
23549 }
23550 else
23551 cp_parser_check_access_in_redeclaration
23554 }
23555 }
23556 else
23557 {
23560 /* Clear attributes from the decl_specifiers but keep them
23561 around as prefix attributes that apply them to the entity
23562 being declared. */
23566 /* See if these declarations will be friends. */
23569 /* Keep going until we hit the `;' at the end of the
23570 declaration. */
23572 {
23574 tree first_attribute;
23575 tree initializer;
23579 /* Peek at the next token. */
23582 /* The following code wants to know early if it is a bit-field
23583 or some other declaration. Attributes can appear before
23584 the `:' token, but are hopefully rare enough that the
23585 simplicity of the tentative lookup pays off. */
23590 {
23598 }
23600 /* Check for a bitfield declaration. */
23606 {
23607 tree identifier;
23608 tree width;
23613 else
23616 /* Look for attributes that apply to the bitfield. */
23619 /* Consume the `:' token. */
23622 /* Get the width of the bitfield. */
23626 /* In C++2A and as extension for C++11 and above we allow
23627 default member initializers for bit-fields. */
23632 CPP_OPEN_BRACE)))
23633 {
23634 location_t loc
23640 "default member initializers for bit-fields "
23641 "only available with -std=c++2a or "
23646 {
23650 }
23651 }
23652 else
23653 {
23654 /* Look for attributes that apply to the bitfield after
23655 the `:' token and width. This is where GCC used to
23656 parse attributes in the past, pedwarn if there is
23657 a std attribute. */
23660 "ISO C++ allows bit-field attributes only "
23664 }
23668 /* Remember which attributes are prefix attributes and
23669 which are not. */
23671 /* Combine the attributes. */
23674 /* Create the bitfield declaration. */
23677 identifier,
23678 sfk_none)
23682 attributes);
23683 }
23684 else
23685 {
23687 tree asm_specification;
23690 /* Parse the declarator. */
23691 declarator
23696 friend_p);
23698 /* If something went wrong parsing the declarator, make sure
23699 that we at least consume some tokens. */
23701 {
23702 /* Skip to the end of the statement. */
23704 /* If the next token is not a semicolon, that is
23705 probably because we just skipped over the body of
23706 a function. So, we consume a semicolon if
23707 present, but do not issue an error message if it
23708 is not present. */
23710 CPP_SEMICOLON))
23713 }
23716 cp_parser_check_for_definition_in_return_type
23720 /* Look for an asm-specification. */
23722 /* Look for attributes that apply to the declaration. */
23724 /* Remember which attributes are prefix attributes and
23725 which are not. */
23727 /* Combine the attributes. */
23730 /* If it's an `=', then we have a constant-initializer or a
23731 pure-specifier. It is not correct to parse the
23732 initializer before registering the member declaration
23733 since the member declaration should be in scope while
23734 its initializer is processed. However, the rest of the
23735 front end does not yet provide an interface that allows
23736 us to handle this correctly. */
23738 {
23739 /* In [class.mem]:
23741 A pure-specifier shall be used only in the declaration of
23742 a virtual function.
23744 A member-declarator can contain a constant-initializer
23745 only if it declares a static member of integral or
23746 enumeration type.
23748 Therefore, if the DECLARATOR is for a function, we look
23749 for a pure-specifier; otherwise, we look for a
23750 constant-initializer. When we call `grokfield', it will
23751 perform more stringent semantics checks. */
23763 {
23765 /* Don't require a constant rvalue in C++11, since we
23766 might want a reference constant. We'll enforce
23767 constancy later. */
23769 /* Parse the initializer. */
23772 }
23773 else
23774 /* Parse the initializer. */
23776 }
23779 {
23783 else
23785 }
23786 /* Otherwise, there is no initializer. */
23787 else
23790 /* See if we are probably looking at a function
23791 definition. We are certainly not looking at a
23792 member-declarator. Calling `grokfield' has
23793 side-effects, so we must not do it unless we are sure
23794 that we are looking at a member-declarator. */
23797 {
23798 /* The grammar does not allow a pure-specifier to be
23799 used when a member function is defined. (It is
23800 possible that this fact is an oversight in the
23801 standard, since a pure function may be defined
23802 outside of the class-specifier. */
23808 declarator,
23809 attributes);
23812 /* If the member was not a friend, declare it here. */
23815 /* Peek at the next token. */
23817 /* If the next token is a semicolon, consume it. */
23819 {
23820 location_t semicolon_loc
23825 "extra %<;%> after in-class "
23827 }
23829 }
23830 else
23833 /* Create the declaration. */
23838 {
23841 else
23843 }
23844 }
23849 /* Reset PREFIX_ATTRIBUTES. */
23851 {
23856 }
23858 /* If there is any qualification still in effect, clear it
23859 now; we will be starting fresh with the next declarator. */
23863 /* If it's a `,', then there are more declarators. */
23865 {
23868 {
23874 }
23875 }
23876 /* If the next token isn't a `;', then we have a parse error. */
23878 CPP_SEMICOLON))
23879 {
23880 /* The next token might be a ways away from where the
23881 actual semicolon is missing. Find the previous token
23882 and use that for our error position. */
23889 /* Assume that the user meant to provide a semicolon. If
23890 we were to cp_parser_skip_to_end_of_statement, we might
23891 skip to a semicolon inside a member function definition
23892 and issue nonsensical error messages. */
23894 }
23897 {
23898 /* Add DECL to the list of members. */
23900 /* Explicitly include, eg, NSDMIs, for better error
23901 recovery (c++/58650). */
23909 /* Add DECL to the queue of NSDMI to be parsed later. */
23911 }
23915 }
23916 }
23919 out:
23921 }
23923 /* Parse a pure-specifier.
23925 pure-specifier:
23926 = 0
23928 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23929 Otherwise, ERROR_MARK_NODE is returned. */
23931 static tree
23933 {
23936 /* Look for the `=' token. */
23939 /* Look for the `0' token. */
23948 /* Accept = default or = delete in c++0x mode. */
23951 {
23954 }
23956 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23958 {
23963 }
23965 {
23968 }
23971 }
23973 /* Parse a constant-initializer.
23975 constant-initializer:
23976 = constant-expression
23978 Returns a representation of the constant-expression. */
23980 static tree
23982 {
23983 /* Look for the `=' token. */
23987 /* It is invalid to write:
23989 struct S { static const int i = { 7 }; };
23991 */
23993 {
23996 /* Consume the opening brace. */
23997 matching_braces braces;
23999 /* Skip the initializer. */
24001 /* Look for the trailing `}'. */
24005 }
24008 }
24010 /* Derived classes [gram.class.derived] */
24012 /* Parse a base-clause.
24014 base-clause:
24015 : base-specifier-list
24017 base-specifier-list:
24018 base-specifier ... [opt]
24019 base-specifier-list , base-specifier ... [opt]
24021 Returns a TREE_LIST representing the base-classes, in the order in
24022 which they were declared. The representation of each node is as
24023 described by cp_parser_base_specifier.
24025 In the case that no bases are specified, this function will return
24026 NULL_TREE, not ERROR_MARK_NODE. */
24028 static tree
24030 {
24033 /* Look for the `:' that begins the list. */
24036 /* Scan the base-specifier-list. */
24038 {
24040 tree base;
24043 /* Look for the base-specifier. */
24045 /* Look for the (optional) ellipsis. */
24047 {
24048 /* Consume the `...'. */
24052 }
24054 /* Add BASE to the front of the list. */
24056 {
24058 /* Make this a pack expansion type. */
24062 {
24065 }
24066 }
24067 /* Peek at the next token. */
24069 /* If it's not a comma, then the list is complete. */
24072 /* Consume the `,'. */
24074 }
24076 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24077 base class had a qualified name. However, the next name that
24078 appears is certainly not qualified. */
24084 }
24086 /* Parse a base-specifier.
24088 base-specifier:
24089 :: [opt] nested-name-specifier [opt] class-name
24090 virtual access-specifier [opt] :: [opt] nested-name-specifier
24091 [opt] class-name
24092 access-specifier virtual [opt] :: [opt] nested-name-specifier
24093 [opt] class-name
24095 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24096 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24097 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24098 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24100 static tree
24102 {
24110 tree type;
24112 /* Process the optional `virtual' and `access-specifier'. */
24114 {
24115 /* Peek at the next token. */
24117 /* Process `virtual'. */
24119 {
24121 /* If `virtual' appears more than once, issue an error. */
24123 {
24127 }
24131 /* Consume the `virtual' token. */
24139 /* If more than one access specifier appears, issue an
24140 error. */
24143 {
24147 }
24151 /* Consume the access-specifier. */
24159 }
24160 }
24161 /* It is not uncommon to see programs mechanically, erroneously, use
24162 the 'typename' keyword to denote (dependent) qualified types
24163 as base classes. */
24165 {
24170 else
24172 "keyword %<typename%> not allowed in this context "
24175 }
24177 /* Look for the optional `::' operator. */
24179 /* Look for the nested-name-specifier. The simplest way to
24180 implement:
24182 [temp.res]
24184 The keyword `typename' is not permitted in a base-specifier or
24185 mem-initializer; in these contexts a qualified name that
24186 depends on a template-parameter is implicitly assumed to be a
24187 type name.
24189 is to pretend that we have seen the `typename' keyword at this
24190 point. */
24196 /* If the base class is given by a qualified name, assume that names
24197 we see are type names or templates, as appropriate. */
24203 /* DR 950 allows decltype as a base-specifier. */
24205 else
24206 {
24207 /* Otherwise, look for the class-name. */
24209 class_scope_p,
24210 template_p,
24211 typename_type,
24216 }
24222 }
24224 /* Exception handling [gram.exception] */
24226 /* Parse an (optional) noexcept-specification.
24228 noexcept-specification:
24229 noexcept ( constant-expression ) [opt]
24231 If no noexcept-specification is present, returns NULL_TREE.
24232 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24233 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24234 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24235 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24236 in which case a boolean condition is returned instead. */
24238 static tree
24243 {
24247 /* Peek at the next token. */
24250 /* Is it a noexcept-specification? */
24252 {
24253 tree expr;
24257 {
24258 matching_parens parens;
24262 {
24263 /* Types may not be defined in an exception-specification. */
24265 parser->type_definition_forbidden_message
24270 /* Restore the saved message. */
24272 }
24273 else
24274 {
24277 }
24280 }
24281 else
24282 {
24286 }
24288 /* We cannot build a noexcept-spec right away because this will check
24289 that expr is a constexpr. */
24292 else
24294 }
24295 else
24297 }
24299 /* Parse an (optional) exception-specification.
24301 exception-specification:
24302 throw ( type-id-list [opt] )
24304 Returns a TREE_LIST representing the exception-specification. The
24305 TREE_VALUE of each node is a type. */
24307 static tree
24309 {
24311 tree type_id_list;
24314 /* Peek at the next token. */
24317 /* Is it a noexcept-specification? */
24323 /* If it's not `throw', then there's no exception-specification. */
24329 /* Consume the `throw'. */
24332 /* Look for the `('. */
24333 matching_parens parens;
24336 /* Peek at the next token. */
24338 /* If it's not a `)', then there is a type-id-list. */
24340 {
24341 /* Types may not be defined in an exception-specification. */
24343 parser->type_definition_forbidden_message
24345 /* Parse the type-id-list. */
24347 /* Restore the saved message. */
24351 {
24355 }
24358 "dynamic exception specifications are deprecated in "
24360 }
24361 /* In C++17, throw() is equivalent to noexcept (true). throw()
24362 is deprecated in C++11 and above as well, but is still widely used,
24363 so don't warn about it yet. */
24366 else
24369 /* Look for the `)'. */
24373 }
24375 /* Parse an (optional) type-id-list.
24377 type-id-list:
24378 type-id ... [opt]
24379 type-id-list , type-id ... [opt]
24381 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24382 in the order that the types were presented. */
24384 static tree
24386 {
24390 {
24392 tree type;
24396 /* Get the next type-id. */
24398 /* Check for invalid 'auto'. */
24400 {
24404 }
24405 /* Parse the optional ellipsis. */
24407 {
24408 /* Consume the `...'. */
24411 /* Turn the type into a pack expansion expression. */
24413 }
24414 /* Add it to the list. */
24416 /* Peek at the next token. */
24418 /* If it is not a `,', we are done. */
24421 /* Consume the `,'. */
24423 }
24426 }
24428 /* Parse a try-block.
24430 try-block:
24431 try compound-statement handler-seq */
24433 static tree
24435 {
24436 tree try_block;
24450 }
24452 /* Parse a function-try-block.
24454 function-try-block:
24455 try ctor-initializer [opt] function-body handler-seq */
24457 static void
24459 {
24460 tree compound_stmt;
24461 tree try_block;
24463 /* Look for the `try' keyword. */
24466 /* Let the rest of the front end know where we are. */
24468 /* Parse the function-body. */
24469 cp_parser_ctor_initializer_opt_and_function_body
24471 /* We're done with the `try' part. */
24473 /* Parse the handlers. */
24475 /* We're done with the handlers. */
24477 }
24479 /* Parse a handler-seq.
24481 handler-seq:
24482 handler handler-seq [opt] */
24484 static void
24486 {
24488 {
24491 /* Parse the handler. */
24493 /* Peek at the next token. */
24495 /* If it's not `catch' then there are no more handlers. */
24498 }
24499 }
24501 /* Parse a handler.
24503 handler:
24504 catch ( exception-declaration ) compound-statement */
24506 static void
24508 {
24509 tree handler;
24510 tree declaration;
24514 matching_parens parens;
24521 }
24523 /* Parse an exception-declaration.
24525 exception-declaration:
24526 type-specifier-seq declarator
24527 type-specifier-seq abstract-declarator
24528 type-specifier-seq
24529 ...
24531 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24532 ellipsis variant is used. */
24534 static tree
24536 {
24537 cp_decl_specifier_seq type_specifiers;
24541 /* If it's an ellipsis, it's easy to handle. */
24543 {
24544 /* Consume the `...' token. */
24547 }
24549 /* Types may not be defined in exception-declarations. */
24551 parser->type_definition_forbidden_message
24554 /* Parse the type-specifier-seq. */
24558 /* If it's a `)', then there is no declarator. */
24561 else
24568 /* Restore the saved message. */
24575 }
24577 /* Parse a throw-expression.
24579 throw-expression:
24580 throw assignment-expression [opt]
24582 Returns a THROW_EXPR representing the throw-expression. */
24584 static tree
24586 {
24587 tree expression;
24592 /* Figure out whether or not there is an assignment-expression
24593 following the "throw" keyword. */
24601 else
24605 }
24607 /* GNU Extensions */
24609 /* Parse an (optional) asm-specification.
24611 asm-specification:
24612 asm ( string-literal )
24614 If the asm-specification is present, returns a STRING_CST
24615 corresponding to the string-literal. Otherwise, returns
24616 NULL_TREE. */
24618 static tree
24620 {
24622 tree asm_specification;
24624 /* Peek at the next token. */
24626 /* If the next token isn't the `asm' keyword, then there's no
24627 asm-specification. */
24631 /* Consume the `asm' token. */
24633 /* Look for the `('. */
24634 matching_parens parens;
24637 /* Look for the string-literal. */
24640 /* Look for the `)'. */
24644 }
24646 /* Parse an asm-operand-list.
24648 asm-operand-list:
24649 asm-operand
24650 asm-operand-list , asm-operand
24652 asm-operand:
24653 string-literal ( expression )
24654 [ string-literal ] string-literal ( expression )
24656 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24657 each node is the expression. The TREE_PURPOSE is itself a
24658 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24659 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24660 is a STRING_CST for the string literal before the parenthesis. Returns
24661 ERROR_MARK_NODE if any of the operands are invalid. */
24663 static tree
24665 {
24670 {
24671 tree string_literal;
24672 tree expression;
24673 tree name;
24676 {
24677 /* Consume the `[' token. */
24679 /* Read the operand name. */
24684 /* Look for the closing `]'. */
24686 }
24687 else
24689 /* Look for the string-literal. */
24692 /* Look for the `('. */
24693 matching_parens parens;
24695 /* Parse the expression. */
24697 /* Look for the `)'. */
24705 /* Add this operand to the list. */
24707 expression,
24708 asm_operands);
24709 /* If the next token is not a `,', there are no more
24710 operands. */
24713 /* Consume the `,'. */
24715 }
24718 }
24720 /* Parse an asm-clobber-list.
24722 asm-clobber-list:
24723 string-literal
24724 asm-clobber-list , string-literal
24726 Returns a TREE_LIST, indicating the clobbers in the order that they
24727 appeared. The TREE_VALUE of each node is a STRING_CST. */
24729 static tree
24731 {
24735 {
24736 tree string_literal;
24738 /* Look for the string literal. */
24740 /* Add it to the list. */
24742 /* If the next token is not a `,', then the list is
24743 complete. */
24746 /* Consume the `,' token. */
24748 }
24751 }
24753 /* Parse an asm-label-list.
24755 asm-label-list:
24756 identifier
24757 asm-label-list , identifier
24759 Returns a TREE_LIST, indicating the labels in the order that they
24760 appeared. The TREE_VALUE of each node is a label. */
24762 static tree
24764 {
24768 {
24771 /* Look for the identifier. */
24774 {
24777 {
24783 }
24784 }
24785 /* If the next token is not a `,', then the list is
24786 complete. */
24789 /* Consume the `,' token. */
24791 }
24794 }
24796 /* Return TRUE iff the next tokens in the stream are possibly the
24797 beginning of a GNU extension attribute. */
24799 static bool
24801 {
24803 }
24805 /* Return TRUE iff the next tokens in the stream are possibly the
24806 beginning of a standard C++-11 attribute specifier. */
24808 static bool
24810 {
24812 }
24814 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24815 beginning of a standard C++-11 attribute specifier. */
24817 static bool
24819 {
24827 }
24829 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24830 beginning of a GNU extension attribute. */
24832 static bool
24834 {
24838 }
24840 /* Return true iff the next tokens can be the beginning of either a
24841 GNU attribute list, or a standard C++11 attribute sequence. */
24843 static bool
24845 {
24848 }
24850 /* Return true iff the next Nth tokens can be the beginning of either
24851 a GNU attribute list, or a standard C++11 attribute sequence. */
24853 static bool
24855 {
24858 }
24860 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24861 of GNU attributes, or return NULL. */
24863 static tree
24865 {
24869 }
24871 /* Parse an (optional) series of attributes.
24873 attributes:
24874 attributes attribute
24876 attribute:
24877 __attribute__ (( attribute-list [opt] ))
24879 The return value is as for cp_parser_gnu_attribute_list. */
24881 static tree
24883 {
24887 {
24889 tree attribute_list;
24892 /* Peek at the next token. */
24894 /* If it's not `__attribute__', then we're done. */
24898 /* Consume the `__attribute__' keyword. */
24900 /* Look for the two `(' tokens. */
24901 matching_parens outer_parens;
24903 matching_parens inner_parens;
24906 /* Peek at the next token. */
24909 /* Parse the attribute-list. */
24911 else
24912 /* If the next token is a `)', then there is no attribute
24913 list. */
24916 /* Look for the two `)' tokens. */
24924 /* Add these new attributes to the list. */
24926 }
24929 }
24931 /* Parse a GNU attribute-list.
24933 attribute-list:
24934 attribute
24935 attribute-list , attribute
24937 attribute:
24938 identifier
24939 identifier ( identifier )
24940 identifier ( identifier , expression-list )
24941 identifier ( expression-list )
24943 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24944 to an attribute. The TREE_PURPOSE of each node is the identifier
24945 indicating which attribute is in use. The TREE_VALUE represents
24946 the arguments, if any. */
24948 static tree
24950 {
24956 {
24958 tree identifier;
24959 tree attribute;
24961 /* Look for the identifier. We also allow keywords here; for
24962 example `__attribute__ ((const))' is legal. */
24966 {
24969 /* Consume the token, but save it since we need it for the
24970 SIMD enabled function parsing. */
24973 /* Save away the identifier that indicates which attribute
24974 this is. */
24976 /* For keywords, use the canonical spelling, not the
24977 parsed identifier. */
24984 /* Peek at the next token. */
24986 /* If it's an `(', then parse the attribute arguments. */
24988 {
24992 vec = cp_parser_parenthesized_expression_list
24998 else
24999 {
25002 }
25003 /* Save the arguments away. */
25005 }
25008 {
25009 /* Add this attribute to the list. */
25012 }
25015 }
25016 /* Now, look for more attributes. If the next token isn't a
25017 `,', we're done. */
25021 /* Consume the comma and keep going. */
25023 }
25026 /* We built up the list in reverse order. */
25028 }
25030 /* Parse a standard C++11 attribute.
25032 The returned representation is a TREE_LIST which TREE_PURPOSE is
25033 the scoped name of the attribute, and the TREE_VALUE is its
25034 arguments list.
25036 Note that the scoped name of the attribute is itself a TREE_LIST
25037 which TREE_PURPOSE is the namespace of the attribute, and
25038 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25039 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25040 and which TREE_PURPOSE is directly the attribute name.
25042 Clients of the attribute code should use get_attribute_namespace
25043 and get_attribute_name to get the actual namespace and name of
25044 attributes, regardless of their being GNU or C++11 attributes.
25046 attribute:
25047 attribute-token attribute-argument-clause [opt]
25049 attribute-token:
25050 identifier
25051 attribute-scoped-token
25053 attribute-scoped-token:
25054 attribute-namespace :: identifier
25056 attribute-namespace:
25057 identifier
25059 attribute-argument-clause:
25060 ( balanced-token-seq )
25062 balanced-token-seq:
25063 balanced-token [opt]
25064 balanced-token-seq balanced-token
25066 balanced-token:
25067 ( balanced-token-seq )
25068 [ balanced-token-seq ]
25069 { balanced-token-seq }. */
25071 static tree
25073 {
25077 /* First, parse name of the attribute, a.k.a attribute-token. */
25094 {
25095 /* We are seeing a scoped attribute token. */
25110 else
25111 {
25115 }
25119 NULL_TREE);
25121 }
25124 NULL_TREE);
25125 else
25126 {
25129 NULL_TREE);
25130 /* C++11 noreturn attribute is equivalent to GNU's. */
25133 /* C++14 deprecated attribute is equivalent to GNU's. */
25136 /* C++17 fallthrough attribute is equivalent to GNU's. */
25139 /* Transactional Memory TS optimize_for_synchronized attribute is
25140 equivalent to GNU transaction_callable. */
25144 /* Transactional Memory attributes are GNU attributes. */
25147 }
25149 /* Now parse the optional argument clause of the attribute. */
25154 {
25160 /* A GNU attribute that takes an identifier in parameter. */
25163 vec = cp_parser_parenthesized_expression_list
25169 else
25170 {
25173 }
25177 else
25179 }
25182 }
25184 /* Check that the attribute ATTRIBUTE appears at most once in the
25185 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25186 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25187 isn't implemented yet in GCC. */
25189 static void
25191 {
25193 {
25203 }
25204 }
25206 /* Parse a list of standard C++-11 attributes.
25208 attribute-list:
25209 attribute [opt]
25210 attribute-list , attribute[opt]
25211 attribute ...
25212 attribute-list , attribute ...
25213 */
25215 static tree
25217 {
25222 {
25227 {
25231 }
25234 {
25239 else
25240 {
25245 }
25247 }
25251 }
25254 }
25256 /* Parse a standard C++-11 attribute specifier.
25258 attribute-specifier:
25259 [ [ attribute-using-prefix [opt] attribute-list ] ]
25260 alignment-specifier
25262 attribute-using-prefix:
25263 using attribute-namespace :
25265 alignment-specifier:
25266 alignas ( type-id ... [opt] )
25267 alignas ( alignment-expression ... [opt] ). */
25269 static tree
25271 {
25277 {
25284 {
25295 {
25299 "attribute using prefix only available "
25305 }
25306 else
25308 }
25315 else
25316 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25317 when we are sure that we have actually parsed them. */
25319 }
25320 else
25321 {
25322 tree alignas_expr;
25324 /* Look for an alignment-specifier. */
25335 matching_parens parens;
25343 {
25350 }
25355 /* Handle alignas (pack...). */
25357 {
25360 }
25362 /* Something went wrong, so don't build the attribute. */
25369 /* Build the C++-11 representation of an 'aligned'
25370 attribute. */
25371 attributes =
25374 alignas_expr);
25375 }
25378 }
25380 /* Parse a standard C++-11 attribute-specifier-seq.
25382 attribute-specifier-seq:
25383 attribute-specifier-seq [opt] attribute-specifier
25384 */
25386 static tree
25388 {
25393 {
25402 else
25405 }
25408 }
25410 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25411 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25412 current value of the PEDANTIC flag, regardless of whether or not
25413 the `__extension__' keyword is present. The caller is responsible
25414 for restoring the value of the PEDANTIC flag. */
25416 static bool
25418 {
25419 /* Save the old value of the PEDANTIC flag. */
25423 {
25424 /* Consume the `__extension__' token. */
25426 /* We're not being pedantic while the `__extension__' keyword is
25427 in effect. */
25431 }
25434 }
25436 /* Parse a label declaration.
25438 label-declaration:
25439 __label__ label-declarator-seq ;
25441 label-declarator-seq:
25442 identifier , label-declarator-seq
25443 identifier */
25445 static void
25447 {
25448 /* Look for the `__label__' keyword. */
25452 {
25453 tree identifier;
25455 /* Look for an identifier. */
25457 /* If we failed, stop. */
25460 /* Declare it as a label. */
25462 /* If the next token is a `;', stop. */
25465 /* Look for the `,' separating the label declarations. */
25467 }
25469 /* Look for the final `;'. */
25471 }
25473 // -------------------------------------------------------------------------- //
25474 // Requires Clause
25476 // Parse a requires clause.
25477 //
25478 // requires-clause:
25479 // 'requires' logical-or-expression
25480 //
25481 // The required logical-or-expression must be a constant expression. Note
25482 // that we don't check that the expression is constepxr here. We defer until
25483 // we analyze constraints and then, we only check atomic constraints.
25484 static tree
25486 {
25487 // Parse the requires clause so that it is not automatically folded.
25495 }
25497 // Optionally parse a requires clause:
25498 static tree
25500 {
25503 {
25506 {
25509 /* Parse and discard the requires-clause. */
25512 }
25514 }
25517 }
25520 /*---------------------------------------------------------------------------
25521 Requires expressions
25522 ---------------------------------------------------------------------------*/
25524 /* Parse a requires expression
25526 requirement-expression:
25527 'requires' requirement-parameter-list [opt] requirement-body */
25528 static tree
25530 {
25534 /* A requires-expression shall appear only within a concept
25535 definition or a requires-clause.
25537 TODO: Implement this diagnostic correctly. */
25539 {
25543 }
25546 {
25547 /* Local parameters are delared as variables within the scope
25548 of the expression. They are not visible past the end of
25549 the expression. Expressions within the requires-expression
25550 are unevaluated. */
25551 struct scope_sentinel
25552 {
25554 {
25557 }
25560 {
25563 }
25566 /* Parse the optional parameter list. */
25568 {
25572 }
25573 else
25576 /* Parse the requirement body. */
25580 }
25582 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25583 the parm chain. */
25586 }
25588 /* Parse a parameterized requirement.
25590 requirement-parameter-list:
25591 '(' parameter-declaration-clause ')' */
25592 static tree
25594 {
25595 matching_parens parens;
25605 }
25607 /* Parse the body of a requirement.
25609 requirement-body:
25610 '{' requirement-list '}' */
25611 static tree
25613 {
25614 matching_braces braces;
25624 }
25626 /* Parse a list of requirements.
25628 requirement-list:
25629 requirement
25630 requirement-list ';' requirement[opt] */
25631 static tree
25633 {
25636 {
25643 /* If we see a semi-colon, consume it. */
25647 /* Stop processing at the end of the list. */
25650 }
25652 /* Reverse the order of requirements so they are analyzed in
25653 declaration order. */
25655 }
25657 /* Parse a syntactic requirement or type requirement.
25659 requirement:
25660 simple-requirement
25661 compound-requirement
25662 type-requirement
25663 nested-requirement */
25664 static tree
25666 {
25673 else
25675 }
25677 /* Parse a simple requirement.
25679 simple-requirement:
25680 expression ';' */
25681 static tree
25683 {
25692 }
25694 /* Parse a type requirement
25696 type-requirement
25697 nested-name-specifier [opt] required-type-name ';'
25699 required-type-name:
25700 type-name
25701 'template' [opt] simple-template-id */
25702 static tree
25704 {
25707 // Save the scope before parsing name specifiers.
25718 tree type;
25720 {
25729 }
25730 else
25749 }
25751 /* Parse a compound requirement
25753 compound-requirement:
25754 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25755 static tree
25757 {
25758 /* Parse an expression enclosed in '{ }'s. */
25759 matching_braces braces;
25770 /* Parse the optional noexcept. */
25773 {
25776 }
25778 /* Parse the optional trailing return type. */
25781 {
25789 }
25792 }
25794 /* Parse a nested requirement. This is the same as a requires clause.
25796 nested-requirement:
25797 requires-clause */
25798 static tree
25800 {
25806 }
25808 /* Support Functions */
25810 /* Return the appropriate prefer_type argument for lookup_name_real based on
25811 tag_type and template_mem_access. */
25815 {
25816 /* DR 141: When looking in the current enclosing context for a template-name
25817 after -> or ., only consider class templates. */
25821 {
25825 }
25826 }
25828 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25829 NAME should have one of the representations used for an
25830 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25831 is returned. If PARSER->SCOPE is a dependent type, then a
25832 SCOPE_REF is returned.
25834 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25835 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25836 was formed. Abstractly, such entities should not be passed to this
25837 function, because they do not need to be looked up, but it is
25838 simpler to check for this special case here, rather than at the
25839 call-sites.
25841 In cases not explicitly covered above, this function returns a
25842 DECL, OVERLOAD, or baselink representing the result of the lookup.
25843 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25844 is returned.
25846 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25847 (e.g., "struct") that was used. In that case bindings that do not
25848 refer to types are ignored.
25850 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25851 ignored.
25853 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25854 are ignored.
25856 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25857 types.
25859 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25860 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25861 NULL_TREE otherwise. */
25863 static cp_expr
25870 location_t name_location)
25871 {
25872 tree decl;
25875 /* Assume that the lookup will be unambiguous. */
25879 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25880 no longer valid. Note that if we are parsing tentatively, and
25881 the parse fails, OBJECT_TYPE will be automatically restored. */
25887 /* A template-id has already been resolved; there is no lookup to
25888 do. */
25892 {
25896 }
25898 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25899 it should already have been checked to make sure that the name
25900 used matches the type being destroyed. */
25902 {
25903 tree type;
25905 /* Figure out to which type this destructor applies. */
25910 else
25912 /* If that's not a class type, there is no destructor. */
25923 }
25925 /* By this point, the NAME should be an ordinary identifier. If
25926 the id-expression was a qualified name, the qualifying scope is
25927 stored in PARSER->SCOPE at this point. */
25930 /* Perform the lookup. */
25932 {
25938 /* If the SCOPE is dependent, the lookup must be deferred until
25939 the template is instantiated -- unless we are explicitly
25940 looking up names in uninstantiated templates. Even then, we
25941 cannot look up the name if the scope is not a class type; it
25942 might, for example, be a template type parameter. */
25947 /* Defer lookup. */
25949 else
25950 {
25953 /* If PARSER->SCOPE is a dependent type, then it must be a
25954 class type, and we must not be checking dependencies;
25955 otherwise, we would have processed this lookup above. So
25956 that PARSER->SCOPE is not considered a dependent base by
25957 lookup_member, we must enter the scope here. */
25961 /* If the PARSER->SCOPE is a template specialization, it
25962 may be instantiated during name lookup. In that case,
25963 errors may be issued. Even if we rollback the current
25964 tentative parse, those errors are valid. */
25969 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25970 lookup result and the nested-name-specifier nominates a class C:
25971 * if the name specified after the nested-name-specifier, when
25972 looked up in C, is the injected-class-name of C (Clause 9), or
25973 * if the name specified after the nested-name-specifier is the
25974 same as the identifier or the simple-template-id's template-
25975 name in the last component of the nested-name-specifier,
25976 the name is instead considered to name the constructor of
25977 class C. [ Note: for example, the constructor is not an
25978 acceptable lookup result in an elaborated-type-specifier so
25979 the constructor would not be used in place of the
25980 injected-class-name. --end note ] Such a constructor name
25981 shall be used only in the declarator-id of a declaration that
25982 names a constructor or in a using-declaration. */
25990 /* If we have a single function from a using decl, pull it out. */
25997 }
25999 /* If the scope is a dependent type and either we deferred lookup or
26000 we did lookup but didn't find the name, rememeber the name. */
26003 {
26005 {
26006 tree type;
26008 /* The resolution to Core Issue 180 says that `struct
26009 A::B' should be considered a type-name, even if `A'
26010 is dependent. */
26015 }
26019 CPP_CLOSE_PAREN)))
26023 else
26026 is_template);
26027 }
26030 }
26032 {
26033 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26034 OBJECT_TYPE is not a class. */
26036 /* If the OBJECT_TYPE is a template specialization, it may
26037 be instantiated during name lookup. In that case, errors
26038 may be issued. Even if we rollback the current tentative
26039 parse, those errors are valid. */
26041 name,
26044 tf_warning_or_error);
26045 else
26049 /* Look it up in the enclosing context. DR 141: When looking for a
26050 template-name after -> or ., only consider class templates. */
26055 /* The object is type-dependent, so we can't look anything up; we used
26056 this to get the DR 141 behavior. */
26060 }
26061 else
26062 {
26068 }
26070 /* If the lookup failed, let our caller know. */
26074 /* Pull out the template from an injected-class-name (or multiple). */
26078 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26080 {
26083 /* The error message we have to print is too complicated for
26084 cp_parser_error, so we incorporate its actions directly. */
26086 {
26088 name);
26090 }
26092 }
26100 /* If we have resolved the name of a member declaration, check to
26101 see if the declaration is accessible. When the name resolves to
26102 set of overloaded functions, accessibility is checked when
26103 overload resolution is done.
26105 During an explicit instantiation, access is not checked at all,
26106 as per [temp.explicit]. */
26113 }
26115 /* Like cp_parser_lookup_name, but for use in the typical case where
26116 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26117 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26119 static tree
26121 {
26123 none_type,
26128 location);
26129 }
26131 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26132 the current context, return the TYPE_DECL. If TAG_NAME_P is
26133 true, the DECL indicates the class being defined in a class-head,
26134 or declared in an elaborated-type-specifier.
26136 Otherwise, return DECL. */
26138 static tree
26140 {
26141 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26142 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26144 struct A {
26145 template <typename T> struct B;
26146 };
26148 template <typename T> struct A::B {};
26150 Similarly, in an elaborated-type-specifier:
26152 namespace N { struct X{}; }
26154 struct A {
26155 template <typename T> friend struct N::X;
26156 };
26158 However, if the DECL refers to a class type, and we are in
26159 the scope of the class, then the name lookup automatically
26160 finds the TYPE_DECL created by build_self_reference rather
26161 than a TEMPLATE_DECL. For example, in:
26163 template <class T> struct S {
26164 S s;
26165 };
26167 there is no need to handle such case. */
26173 }
26175 /* If too many, or too few, template-parameter lists apply to the
26176 declarator, issue an error message. Returns TRUE if all went well,
26177 and FALSE otherwise. */
26179 static bool
26182 location_t declarator_location)
26183 {
26185 {
26187 {
26195 /* If the DECLARATOR has the form `X<y>' then it uses one
26196 additional level of template parameters. */
26199 return cp_parser_check_template_parameters
26201 }
26217 }
26219 }
26221 /* NUM_TEMPLATES were used in the current declaration. If that is
26222 invalid, return FALSE and issue an error messages. Otherwise,
26223 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26224 declarator and we can print more accurate diagnostics. */
26226 static bool
26229 location_t location,
26231 {
26232 /* If there are the same number of template classes and parameter
26233 lists, that's OK. */
26236 /* If there are more, but only one more, then we are referring to a
26237 member template. That's OK too. */
26240 /* If there are more template classes than parameter lists, we have
26241 something like:
26243 template <class T> void S<T>::R<T>::f (); */
26245 {
26255 else
26258 }
26259 /* Otherwise, there are too many template parameter lists. We have
26260 something like:
26262 template <class T> template <class U> void S::f(); */
26265 }
26267 /* Parse an optional `::' token indicating that the following name is
26268 from the global namespace. If so, PARSER->SCOPE is set to the
26269 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26270 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26271 Returns the new value of PARSER->SCOPE, if the `::' token is
26272 present, and NULL_TREE otherwise. */
26274 static tree
26276 {
26279 /* Peek at the next token. */
26281 /* If we're looking at a `::' token then we're starting from the
26282 global namespace, not our current location. */
26284 {
26285 /* Consume the `::' token. */
26287 /* Set the SCOPE so that we know where to start the lookup. */
26293 }
26295 {
26299 }
26302 }
26304 /* Returns TRUE if the upcoming token sequence is the start of a
26305 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26306 declarator is preceded by the `friend' specifier. */
26308 static bool
26310 {
26313 tree nested_name_specifier;
26316 /* The common case is that this is not a constructor declarator, so
26317 try to avoid doing lots of work if at all possible. It's not
26318 valid declare a constructor at function scope. */
26321 /* And only certain tokens can begin a constructor declarator. */
26329 /* Parse tentatively; we are going to roll back all of the tokens
26330 consumed here. */
26332 /* Assume that we are looking at a constructor declarator. */
26335 /* Look for the optional `::' operator. */
26338 /* Look for the nested-name-specifier. */
26339 nested_name_specifier
26350 /* Outside of a class-specifier, there must be a
26351 nested-name-specifier. Except in C++17 mode, where we
26352 might be declaring a guiding declaration. */
26359 /* If we have a class scope, this is easy; DR 147 says that S::S always
26360 names the constructor, and no other qualified name could. */
26363 {
26373 }
26374 /* If we still think that this might be a constructor-declarator,
26375 look for a class-name. */
26377 {
26378 /* If we have:
26380 template <typename T> struct S {
26381 S();
26382 };
26384 we must recognize that the nested `S' names a class. */
26388 tree type_decl;
26392 none_type,
26399 {
26405 none_type,
26410 else
26412 }
26414 /* If there was no class-name, then this is not a constructor.
26415 Otherwise, if we are in a class-specifier and we aren't
26416 handling a friend declaration, check that its type matches
26417 current_class_type (c++/38313). Note: error_mark_node
26418 is left alone for error recovery purposes. */
26420 && (outside_class_specifier_p
26426 /* If we're still considering a constructor, we have to see a `(',
26427 to begin the parameter-declaration-clause, followed by either a
26428 `)', an `...', or a decl-specifier. We need to check for a
26429 type-specifier to avoid being fooled into thinking that:
26431 S (f) (int);
26433 is a constructor. (It is actually a function named `f' that
26434 takes one parameter (of type `int') and returns a value of type
26435 `S'. */
26443 /* A parameter declaration begins with a decl-specifier,
26444 which is either the "attribute" keyword, a storage class
26445 specifier, or (usually) a type-specifier. */
26447 {
26448 tree type;
26452 /* Names appearing in the type-specifier should be looked up
26453 in the scope of the class. */
26457 {
26460 {
26464 {
26467 }
26468 }
26470 }
26472 /* Inside the constructor parameter list, surrounding
26473 template-parameter-lists do not apply. */
26474 saved_num_template_parameter_lists
26478 /* Look for the type-specifier. */
26480 CP_PARSER_FLAGS_NONE,
26486 parser->num_template_parameter_lists
26489 /* Leave the scope of the class. */
26494 }
26495 }
26497 /* We did not really want to consume any tokens. */
26501 }
26503 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26504 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26505 they must be performed once we are in the scope of the function.
26507 Returns the function defined. */
26509 static tree
26510 cp_parser_function_definition_from_specifiers_and_declarator
26513 tree attributes,
26515 {
26516 tree fn;
26519 /* Begin the function-definition. */
26522 /* The things we're about to see are not directly qualified by any
26523 template headers we've seen thus far. */
26526 /* If there were names looked up in the decl-specifier-seq that we
26527 did not check, check them now. We must wait until we are in the
26528 scope of the function to perform the checks, since the function
26529 might be a friend. */
26533 {
26538 }
26541 {
26542 /* Skip the entire function. */
26545 }
26547 {
26548 /* Seen already, skip it. An error message has already been output. */
26552 /* If this is a function from a class, pop the nested class. */
26555 }
26556 else
26557 {
26558 timevar_id_t tv;
26561 else
26567 }
26570 }
26572 /* Parse the part of a function-definition that follows the
26573 declarator. INLINE_P is TRUE iff this function is an inline
26574 function defined within a class-specifier.
26576 Returns the function defined. */
26578 static tree
26581 {
26582 tree fn;
26587 bool fully_implicit_function_template_p
26590 tree implicit_template_parms
26593 cp_binding_level* implicit_template_scope
26599 /* If the next token is `return', then the code may be trying to
26600 make use of the "named return value" extension that G++ used to
26601 support. */
26604 {
26605 /* Consume the `return' keyword. */
26607 /* Look for the identifier that indicates what value is to be
26608 returned. */
26610 /* Issue an error message. */
26613 /* Skip tokens until we reach the start of the function body. */
26615 {
26622 }
26623 }
26624 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26625 anything declared inside `f'. */
26626 saved_in_unbraced_linkage_specification_p
26629 /* Inside the function, surrounding template-parameter-lists do not
26630 apply. */
26631 saved_num_template_parameter_lists
26635 /* If the next token is `try', `__transaction_atomic', or
26636 `__transaction_relaxed`, then we are looking at either function-try-block
26637 or function-transaction-block. Note that all of these include the
26638 function-body. */
26642 RID_TRANSACTION_RELAXED))
26646 else
26647 cp_parser_ctor_initializer_opt_and_function_body
26650 /* Finish the function. */
26652 /* Generate code for it, if necessary. */
26654 /* Restore the saved values. */
26655 parser->in_unbraced_linkage_specification_p
26657 parser->num_template_parameter_lists
26661 parser->fully_implicit_function_template_p
26663 parser->implicit_template_parms
26665 parser->implicit_template_scope
26672 }
26674 /* Parse a template-declaration body (following argument list). */
26676 static void
26678 tree parameter_list,
26680 {
26684 /* We just processed one more parameter list. */
26687 /* Get the deferred access checks from the parameter list. These
26688 will be checked once we know what is being declared, as for a
26689 member template the checks must be performed in the scope of the
26690 class containing the member. */
26693 /* Tentatively parse for a new template parameter list, which can either be
26694 the template keyword or a template introduction. */
26700 else
26701 {
26702 /* There are no access checks when parsing a template, as we do not
26703 know if a specialization will be a friend. */
26707 checks,
26708 member_p,
26713 /* If this is a member template declaration, let the front
26714 end know. */
26716 {
26721 }
26726 }
26727 /* We are done with the current parameter list. */
26732 /* Finish up. */
26735 /* Check the template arguments for a literal operator template. */
26739 {
26743 else
26744 {
26747 {
26753 }
26755 {
26764 }
26765 else
26767 }
26769 {
26772 " Expected non-type template argument pack <char...>"
26774 decl);
26775 else
26778 decl);
26779 }
26780 }
26782 /* Register member declarations. */
26785 /* If DECL is a function template, we must return to parse it later.
26786 (Even though there is no definition, there might be default
26787 arguments that need handling.) */
26791 }
26793 /* Parse a template introduction header for a template-declaration. Returns
26794 false if tentative parse fails. */
26796 static bool
26798 {
26805 /* Look for the optional `::' operator. */
26808 /* Look for the nested-name-specifier. */
26818 /* Look up the concept for which we will be matching
26819 template parameters. */
26829 /* Look for opening brace for introduction. */
26830 matching_braces braces;
26838 /* Build vector of placeholder parameters and grab
26839 matching identifiers. */
26842 /* The introduction-list shall not be empty. */
26845 {
26848 }
26850 /* Look for closing brace for introduction. */
26855 {
26859 }
26861 /* Build and associate the constraint. */
26864 {
26866 member_p);
26868 }
26872 }
26874 /* Parse a normal template-declaration following the template keyword. */
26876 static void
26878 {
26879 tree parameter_list;
26883 /* Look for the `<' token. */
26887 {
26888 /* 14.5.2.2 [temp.mem]
26890 A local class shall not have member templates. */
26895 }
26896 /* [temp]
26898 A template ... shall not have C linkage. */
26900 {
26903 /* Give it C++ linkage to avoid confusing other parts of the
26904 front end. */
26907 }
26908 else
26911 /* We cannot perform access checks on the template parameter
26912 declarations until we know what is being declared, just as we
26913 cannot check the decl-specifier list. */
26916 /* If the next token is `>', then we have an invalid
26917 specialization. Rather than complain about an invalid template
26918 parameter, issue an error message here. */
26920 {
26924 }
26925 else
26926 {
26927 /* Parse the template parameters. */
26929 }
26931 /* Look for the `>'. */
26934 /* Manage template requirements */
26936 {
26941 }
26944 member_p);
26946 /* For the erroneous case of a template with C linkage, we pushed an
26947 implicit C++ linkage scope; exit that scope now. */
26950 }
26952 /* Parse a template-declaration, assuming that the `export' (and
26953 `extern') keywords, if present, has already been scanned. MEMBER_P
26954 is as for cp_parser_template_declaration. */
26956 static bool
26958 {
26960 {
26964 }
26969 }
26971 /* Perform the deferred access checks from a template-parameter-list.
26972 CHECKS is a TREE_LIST of access checks, as returned by
26973 get_deferred_access_checks. */
26975 static void
26976 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26977 {
26981 }
26983 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26984 `function-definition' sequence that follows a template header.
26985 If MEMBER_P is true, this declaration appears in a class scope.
26987 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26988 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26990 static tree
26996 {
26999 cp_decl_specifier_seq decl_specifiers;
27003 /* This function is only used when processing a template
27004 declaration. */
27008 /* Defer access checks until we know what is being declared. */
27011 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27012 alternative. */
27015 CP_PARSER_FLAGS_OPTIONAL,
27021 /* There are no template typedefs. */
27023 {
27027 }
27029 /* Gather up the access checks that occurred the
27030 decl-specifier-seq. */
27033 /* Check for the declaration of a template class. */
27035 {
27038 {
27039 // If this is a declaration, but not a definition, associate
27040 // any constraints with the type declaration. Constraints
27041 // are associated with definitions in cp_parser_class_specifier.
27047 /* In this case:
27049 struct C {
27050 friend template <typename T> struct A<T>::B;
27051 };
27053 A<T>::B will be represented by a TYPENAME_TYPE, and
27054 therefore not recognized by shadow_tag. */
27056 && !decl
27063 else
27066 /* Perform access checks for template parameters. */
27069 /* Give a helpful diagnostic for
27070 template <class T> struct A { } a;
27071 if we aren't already recovering from an error. */
27074 {
27076 "a class template declaration must not declare "
27080 }
27081 }
27082 }
27084 /* Complain about missing 'typename' or other invalid type names. */
27087 {
27088 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27089 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27090 the rest of this declaration. */
27093 }
27095 /* If it's not a template class, try for a template function. If
27096 the next token is a `;', then this declaration does not declare
27097 anything. But, if there were errors in the decl-specifiers, then
27098 the error might well have come from an attempted class-specifier.
27099 In that case, there's no need to warn about a missing declarator. */
27103 {
27106 checks,
27108 member_p,
27109 declares_class_or_enum,
27113 /* 7.1.1-1 [dcl.stc]
27115 A storage-class-specifier shall not be specified in an explicit
27116 specialization... */
27118 && explicit_specialization_p
27120 {
27124 }
27128 }
27130 /* Look for a trailing `;' after the declaration. */
27136 out:
27139 /* Clear any current qualification; whatever comes next is the start
27140 of something new. */
27146 }
27148 /* Parse a cast-expression that is not the operand of a unary "&". */
27150 static cp_expr
27152 {
27155 }
27157 /* Parse a functional cast to TYPE. Returns an expression
27158 representing the cast. */
27160 static cp_expr
27162 {
27164 tree expression_list;
27165 cp_expr cast;
27174 {
27184 /* Create a location of the form:
27185 type_name{i, f}
27186 ^~~~~~~~~~~~~~~
27187 with caret == start at the start of the type name,
27188 finishing at the closing brace. */
27189 location_t finish_loc
27192 finish_loc);
27195 }
27204 else
27205 {
27208 }
27211 tf_warning_or_error);
27212 /* [expr.const]/1: In an integral constant expression "only type
27213 conversions to integral or enumeration type can be used". */
27219 NIC_CONSTRUCTOR))
27222 /* Create a location of the form:
27223 float(i)
27224 ^~~~~~~~
27225 with caret == start at the start of the type name,
27226 finishing at the closing paren. */
27227 location_t finish_loc
27232 }
27234 /* Save the tokens that make up the body of a member function defined
27235 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27236 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27237 specifiers applied to the declaration. Returns the FUNCTION_DECL
27238 for the member function. */
27240 static tree
27244 tree attributes)
27245 {
27248 tree fn;
27251 /* Create the FUNCTION_DECL. */
27255 /* If something went badly wrong, bail out now. */
27257 {
27258 /* If there's a function-body, skip it. */
27263 }
27265 /* Remember it, if there default args to post process. */
27268 /* Save away the tokens that make up the body of the
27269 function. */
27275 RID_TRANSACTION_ATOMIC))
27276 {
27278 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27285 {
27291 }
27292 else
27295 {
27299 }
27300 }
27302 /* Handle function try blocks. */
27304 {
27307 }
27308 /* We can have braced-init-list mem-initializers before the fn body. */
27310 {
27313 {
27314 /* cache_group will stop after an un-nested { } pair, too. */
27318 /* variadic mem-inits have ... after the ')'. */
27321 }
27322 }
27324 /* Handle function try blocks. */
27330 /* Save away the inline definition; we will process it when the
27331 class is complete. */
27335 /* We need to know that this was defined in the class, so that
27336 friend templates are handled correctly. */
27339 /* Add FN to the queue of functions to be parsed later. */
27343 }
27345 /* Save the tokens that make up the in-class initializer for a non-static
27346 data member. Returns a DEFAULT_ARG. */
27348 static tree
27350 {
27352 }
27354 /* Parse a template-argument-list, as well as the trailing ">" (but
27355 not the opening "<"). See cp_parser_template_argument_list for the
27356 return value. */
27358 static tree
27360 {
27361 tree arguments;
27362 tree saved_scope;
27363 tree saved_qualifying_scope;
27364 tree saved_object_scope;
27369 /* [temp.names]
27371 When parsing a template-id, the first non-nested `>' is taken as
27372 the end of the template-argument-list rather than a greater-than
27373 operator. */
27374 saved_greater_than_is_operator_p
27377 /* Parsing the argument list may modify SCOPE, so we save it
27378 here. */
27382 /* We need to evaluate the template arguments, even though this
27383 template-id may be nested within a "sizeof". */
27388 /* Parse the template-argument-list itself. */
27392 else
27394 /* Look for the `>' that ends the template-argument-list. If we find
27395 a '>>' instead, it's probably just a typo. */
27397 {
27399 {
27400 /* In C++0x, a `>>' in a template argument list or cast
27401 expression is considered to be two separate `>'
27402 tokens. So, change the current token to a `>', but don't
27403 consume it: it will be consumed later when the outer
27404 template argument list (or cast expression) is parsed.
27405 Note that this replacement of `>' for `>>' is necessary
27406 even if we are parsing tentatively: in the tentative
27407 case, after calling
27408 cp_parser_enclosed_template_argument_list we will always
27409 throw away all of the template arguments and the first
27410 closing `>', either because the template argument list
27411 was erroneous or because we are replacing those tokens
27412 with a CPP_TEMPLATE_ID token. The second `>' (which will
27413 not have been thrown away) is needed either to close an
27414 outer template argument list or to complete a new-style
27415 cast. */
27418 }
27420 {
27421 /* If we're in a nested template argument list, the '>>' has
27422 to be a typo for '> >'. We emit the error message, but we
27423 continue parsing and we push a '>' as next token, so that
27424 the argument list will be parsed correctly. Note that the
27425 global source location is still on the token before the
27426 '>>', so we need to say explicitly where we want it. */
27434 }
27435 else
27436 {
27437 /* If this is not a nested template argument list, the '>>'
27438 is a typo for '>'. Emit an error message and continue.
27439 Same deal about the token location, but here we can get it
27440 right by consuming the '>>' before issuing the diagnostic. */
27443 "spurious %<>>%>, use %<>%> to terminate "
27445 }
27446 }
27447 else
27449 /* The `>' token might be a greater-than operator again now. */
27450 parser->greater_than_is_operator_p
27452 /* Restore the SAVED_SCOPE. */
27460 }
27462 /* MEMBER_FUNCTION is a member function, or a friend. If default
27463 arguments, or the body of the function have not yet been parsed,
27464 parse them now. */
27466 static void
27468 {
27470 /* If this member is a template, get the underlying
27471 FUNCTION_DECL. */
27475 /* There should not be any class definitions in progress at this
27476 point; the bodies of members are only parsed outside of all class
27477 definitions. */
27479 /* While we're parsing the member functions we might encounter more
27480 classes. We want to handle them right away, but we don't want
27481 them getting mixed up with functions that are currently in the
27482 queue. */
27485 /* Make sure that any template parameters are in scope. */
27488 /* If the body of the function has not yet been parsed, parse it
27489 now. */
27491 {
27492 tree function_scope;
27495 /* The function is no longer pending; we are processing it. */
27500 /* If this is a local class, enter the scope of the containing
27501 function. */
27506 /* Push the body of the function onto the lexer stack. */
27509 /* Let the front end know that we going to be defining this
27510 function. */
27514 /* Don't do access checking if it is a templated function. */
27518 /* #pragma omp declare reduction needs special parsing. */
27520 {
27525 }
27526 else
27527 /* Now, parse the body of the function. */
27534 /* Leave the scope of the containing function. */
27538 }
27540 /* Remove any template parameters from the symbol table. */
27543 /* Restore the queue. */
27546 }
27548 /* If DECL contains any default args, remember it on the unparsed
27549 functions queue. */
27551 static void
27553 {
27554 tree probe;
27557 probe;
27560 {
27564 }
27565 }
27567 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27568 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27569 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27570 from the parameter-type-list. */
27572 static tree
27575 {
27577 tree parsed_arg;
27583 /* Push the saved tokens for the default argument onto the parser's
27584 lexer stack. */
27590 /* Parse the default argument. */
27601 {
27602 /* In a non-template class, check conversions now. In a template,
27603 we'll wait and instantiate these as needed. */
27606 tf_warning_or_error);
27609 else
27611 }
27613 /* If the token stream has not been completely used up, then
27614 there was extra junk after the end of the default
27615 argument. */
27617 {
27620 else
27622 }
27624 /* Revert to the main lexer. */
27628 }
27630 /* FIELD is a non-static data member with an initializer which we saved for
27631 later; parse it now. */
27633 static void
27635 {
27636 tree def;
27643 NULL_TREE);
27649 }
27651 /* FN is a FUNCTION_DECL which may contains a parameter with an
27652 unparsed DEFAULT_ARG. Parse the default args now. This function
27653 assumes that the current scope is the scope in which the default
27654 argument should be processed. */
27656 static void
27658 {
27662 /* While we're parsing the default args, we might (due to the
27663 statement expression extension) encounter more classes. We want
27664 to handle them right away, but we don't want them getting mixed
27665 up with default args that are currently in the queue. */
27668 /* Local variable names (and the `this' keyword) may not appear
27669 in a default argument. */
27680 {
27682 tree parsed_arg;
27684 tree copy;
27691 /* This can happen for a friend declaration for a function
27692 already declared with default arguments. */
27695 parsed_arg
27697 default_arg,
27701 /* Update any instantiations we've already created. */
27705 }
27709 /* Make sure no default arg is missing. */
27712 /* Restore the state of local_variables_forbidden_p. */
27715 /* Restore the queue. */
27717 }
27719 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27721 sizeof ... ( identifier )
27723 where the 'sizeof' token has already been consumed. */
27725 static tree
27727 {
27728 /* Consume the `...'. */
27732 matching_parens parens;
27736 else
27744 /* The name is not qualified. */
27763 }
27765 /* Parse the operand of `sizeof' (or a similar operator). Returns
27766 either a TYPE or an expression, depending on the form of the
27767 input. The KEYWORD indicates which kind of expression we have
27768 encountered. */
27770 static tree
27772 {
27779 /* If it's a `...', then we are computing the length of a parameter
27780 pack. */
27785 /* Types cannot be defined in a `sizeof' expression. Save away the
27786 old message. */
27788 /* And create the new one. */
27794 /* The restrictions on constant-expressions do not apply inside
27795 sizeof expressions. */
27796 saved_integral_constant_expression_p
27798 saved_non_integral_constant_expression_p
27802 /* Do not actually evaluate the expression. */
27805 /* If it's a `(', then we might be looking at the type-id
27806 construction. */
27808 {
27811 /* We can't be sure yet whether we're looking at a type-id or an
27812 expression. */
27815 matching_parens parens;
27818 /* Note: as a GNU Extension, compound literals are considered
27819 postfix-expressions as they are in C99, so they are valid
27820 arguments to sizeof. See comment in cp_parser_cast_expression
27821 for details. */
27824 else
27825 {
27828 /* Look for the type-id. */
27830 /* Look for the closing `)'. */
27833 }
27835 /* If all went well, then we're done. */
27837 {
27838 cp_decl_specifier_seq decl_specs;
27840 /* Build a trivial decl-specifier-seq. */
27844 /* Call grokdeclarator to figure out what type this is. */
27847 TYPENAME,
27850 }
27851 }
27853 /* If the type-id production did not work out, then we must be
27854 looking at the unary-expression production. */
27858 /* Go back to evaluating expressions. */
27862 /* Free the message we created. */
27864 /* And restore the old one. */
27866 parser->integral_constant_expression_p
27868 parser->non_integral_constant_expression_p
27872 }
27874 /* If the current declaration has no declarator, return true. */
27876 static bool
27878 {
27879 /* If the next token is a `;' or a `,' then there is no
27880 declarator. */
27883 }
27885 /* Update the DECL_SPECS to reflect the storage class indicated by
27886 KEYWORD. */
27888 static void
27893 {
27894 cp_storage_class storage_class;
27897 {
27901 }
27903 {
27906 }
27911 {
27914 }
27917 {
27935 }
27939 /* A storage class specifier cannot be applied alongside a typedef
27940 specifier. If there is a typedef specifier present then set
27941 conflicting_specifiers_p which will trigger an error later
27942 on in grokdeclarator. */
27945 }
27947 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27948 is true, the type is a class or enum definition. */
27950 static void
27952 tree type_spec,
27955 {
27958 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27959 (with, for example, in "typedef int wchar_t;") we remember that
27960 this is what happened. In system headers, we ignore these
27961 declarations so that G++ can work with system headers that are not
27962 C++-safe. */
27964 && !type_definition_p
27974 {
27977 ds_redefined_builtin_type_spec,
27978 token);
27980 {
27984 }
27985 }
27988 else
27989 {
27994 }
27995 }
27997 /* True iff TOKEN is the GNU keyword __thread. */
27999 static bool
28001 {
28004 }
28006 /* Set the location for a declarator specifier and check if it is
28007 duplicated.
28009 DECL_SPECS is the sequence of declarator specifiers onto which to
28010 set the location.
28012 DS is the single declarator specifier to set which location is to
28013 be set onto the existing sequence of declarators.
28015 LOCATION is the location for the declarator specifier to
28016 consider. */
28018 static void
28021 {
28030 {
28034 }
28035 else
28036 {
28038 {
28042 else
28043 {
28046 OPT_Wlong_long,
28048 }
28049 }
28051 {
28056 else
28057 {
28061 }
28062 }
28063 else
28064 {
28080 "__complex"
28081 };
28085 }
28086 }
28087 }
28089 /* Return true iff the declarator specifier DS is present in the
28090 sequence of declarator specifiers DECL_SPECS. */
28092 bool
28094 cp_decl_spec ds)
28095 {
28102 }
28104 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28105 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28107 static bool
28109 {
28111 }
28113 /* Issue an error message indicating that TOKEN_DESC was expected.
28114 If KEYWORD is true, it indicated this function is called by
28115 cp_parser_require_keword and the required token can only be
28116 a indicated keyword.
28118 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28119 within any error as the location of an "opening" token matching
28120 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28121 RT_CLOSE_PAREN). */
28123 static void
28125 required_token token_desc,
28127 location_t matching_location)
28128 {
28134 {
28203 }
28206 {
28208 {
28286 }
28287 }
28291 }
28294 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28295 issue an error message indicating that TOKEN_DESC was expected.
28297 Returns the token consumed, if the token had the appropriate type.
28298 Otherwise, returns NULL.
28300 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28301 within any error as the location of an "opening" token matching
28302 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28303 RT_CLOSE_PAREN). */
28308 required_token token_desc,
28309 location_t matching_location)
28310 {
28313 else
28314 {
28315 /* Output the MESSAGE -- unless we're parsing tentatively. */
28318 matching_location);
28320 }
28321 }
28323 /* An error message is produced if the next token is not '>'.
28324 All further tokens are skipped until the desired token is
28325 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28327 static void
28329 {
28330 /* Current level of '< ... >'. */
28332 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28335 /* Are we ready, yet? If not, issue error message. */
28339 /* Skip tokens until the desired token is found. */
28341 {
28342 /* Peek at the next token. */
28344 {
28352 /* C++0x views the `>>' operator as two `>' tokens, but
28353 C++98 does not. */
28356 {
28357 /* We've hit a `>>' where the first `>' closes the
28358 template argument list, and the second `>' is
28359 spurious. Just consume the `>>' and stop; we've
28360 already produced at least one error. */
28363 }
28364 /* Fall through for C++0x, so we handle the second `>' in
28365 the `>>'. */
28370 {
28371 /* We've reached the token we want, consume it and stop. */
28374 }
28393 /* The '>' was probably forgotten, don't look further. */
28398 }
28400 /* Consume this token. */
28402 }
28403 }
28405 /* If the next token is the indicated keyword, consume it. Otherwise,
28406 issue an error message indicating that TOKEN_DESC was expected.
28408 Returns the token consumed, if the token had the appropriate type.
28409 Otherwise, returns NULL. */
28414 required_token token_desc)
28415 {
28419 {
28421 UNKNOWN_LOCATION);
28423 }
28426 }
28428 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28429 function-definition. */
28431 static bool
28433 {
28436 /* A ctor-initializer begins with a `:'. */
28438 /* A function-try-block begins with `try'. */
28440 /* A function-transaction-block begins with `__transaction_atomic'
28441 or `__transaction_relaxed'. */
28444 /* The named return value extension begins with `return'. */
28446 }
28448 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28449 definition. */
28451 static bool
28453 {
28460 }
28462 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28463 C++0x) ending a template-argument. */
28465 static bool
28467 {
28475 }
28477 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28478 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28480 static bool
28483 {
28489 /* Check for the sequence `<::' in the original code. It would be lexed as
28490 `[:', where `[' is a digraph, and there is no whitespace before
28491 `:'. */
28493 {
28498 }
28500 }
28502 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28503 or none_type otherwise. */
28505 static enum tag_types
28507 {
28509 {
28519 }
28520 }
28522 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28523 or none_type otherwise or if the token is null. */
28525 static enum tag_types
28527 {
28532 {
28540 }
28541 }
28543 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28545 static void
28547 {
28551 {
28555 type))
28558 }
28559 }
28561 /* Issue an error message if DECL is redeclared with different
28562 access than its original declaration [class.access.spec/3].
28563 This applies to nested classes, nested class templates and
28564 enumerations [class.mem/1]. */
28566 static void
28568 {
28579 }
28581 /* Look for the `template' keyword, as a syntactic disambiguator.
28582 Return TRUE iff it is present, in which case it will be
28583 consumed. */
28585 static bool
28587 {
28589 {
28590 /* In C++98 the `template' keyword can only be used within templates;
28591 outside templates the parser can always figure out what is a
28592 template and what is not. In C++11, per the resolution of DR 468,
28593 `template' is allowed in cases where it is not strictly necessary. */
28596 {
28599 "in C++98 %<template%> (as a disambiguator) is only "
28601 /* If this part of the token stream is rescanned, the same
28602 error message would be generated. So, we purge the token
28603 from the stream. */
28606 }
28607 else
28608 {
28609 /* Consume the `template' keyword. */
28612 }
28613 }
28615 }
28617 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28618 set PARSER->SCOPE, and perform other related actions. */
28620 static void
28622 {
28625 /* Get the stored value. */
28627 /* Set the scope from the stored value. */
28631 }
28633 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28634 encounter the end of a block before what we were looking for. */
28636 static bool
28640 {
28642 {
28645 /* Abort a parenthesized expression if we encounter a semicolon. */
28649 /* If we've reached the end of the file, stop. */
28655 /* We've hit the end of an enclosing block, so there's been some
28656 kind of syntax error. */
28659 /* Consume the token. */
28661 /* See if it starts a new group. */
28663 {
28665 /* In theory this should probably check end == '}', but
28666 cp_parser_save_member_function_body needs it to exit
28667 after either '}' or ')' when called with ')'. */
28670 }
28672 {
28676 }
28681 }
28682 }
28684 /* Like above, for caching a default argument or NSDMI. Both of these are
28685 terminated by a non-nested comma, but it can be unclear whether or not a
28686 comma is nested in a template argument list unless we do more parsing.
28687 In order to handle this ambiguity, when we encounter a ',' after a '<'
28688 we try to parse what follows as a parameter-declaration-list (in the
28689 case of a default argument) or a member-declarator (in the case of an
28690 NSDMI). If that succeeds, then we stop caching. */
28692 static tree
28694 {
28699 tree default_argument;
28701 /* Add tokens until we have processed the entire default
28702 argument. We add the range [first_token, token). */
28705 {
28706 /* For list-initialization, this is straightforward. */
28709 }
28711 {
28714 /* Peek at the next token. */
28716 /* What we do depends on what token we have. */
28718 {
28719 /* In valid code, a default argument must be
28720 immediately followed by a `,' `)', or `...'. */
28723 {
28724 /* If we've seen a '<', we might be in a
28725 template-argument-list. Until Core issue 325 is
28726 resolved, we don't know how this situation ought
28727 to be handled, so try to DTRT. We check whether
28728 what comes after the comma is a valid parameter
28729 declaration list. If it is, then the comma ends
28730 the default argument; otherwise the default
28731 argument continues. */
28735 /* Set ITALP so cp_parser_parameter_declaration_list
28736 doesn't decide to commit to this parse. */
28743 {
28744 /* Parse declarators until we reach a non-comma or
28745 somthing that cannot be an initializer.
28746 Just checking whether we're looking at a single
28747 declarator is insufficient. Consider:
28748 int var = tuple<T,U>::x;
28749 The template parameter 'U' looks exactly like a
28750 declarator. */
28751 do
28752 {
28763 }
28765 /* If we met an '=' or ';' then the original comma
28766 was the end of the NSDMI. Otherwise assume
28767 we're still in the NSDMI. */
28770 }
28771 else
28772 {
28777 }
28784 }
28785 /* FALLTHRU */
28788 /* If we run into a non-nested `;', `}', or `]',
28789 then the code is invalid -- but the default
28790 argument is certainly over. */
28795 /* Handle correctly int n = sizeof ... ( p ); */
28798 /* Update DEPTH, if necessary. */
28813 /* This might be the comparison operator, or it might
28814 start a template argument list. */
28821 /* Fall through for C++0x, which treats the `>>'
28822 operator like two `>' tokens in certain
28823 cases. */
28828 {
28829 /* This might be an operator, or it might close a
28830 template argument list. But if a previous '<'
28831 started a template argument list, this will have
28832 closed it, so we can't be in one anymore. */
28836 }
28839 /* If we run out of tokens, issue an error message. */
28847 /* In these cases, we should look for template-ids.
28848 For example, if the default argument is
28849 `X<int, double>()', we need to do name lookup to
28850 figure out whether or not `X' is a template; if
28851 so, the `,' does not end the default argument.
28853 That is not yet done. */
28858 }
28860 /* If we've reached the end, stop. */
28864 /* Add the token to the token block. */
28866 }
28868 /* Create a DEFAULT_ARG to represent the unparsed default
28869 argument. */
28876 }
28878 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28880 location_t
28882 {
28887 }
28889 /* Begin parsing tentatively. We always save tokens while parsing
28890 tentatively so that if the tentative parsing fails we can restore the
28891 tokens. */
28893 static void
28895 {
28896 /* Enter a new parsing context. */
28898 /* Begin saving tokens. */
28900 /* In order to avoid repetitive access control error messages,
28901 access checks are queued up until we are no longer parsing
28902 tentatively. */
28904 }
28906 /* Commit to the currently active tentative parse. */
28908 static void
28910 {
28914 /* Mark all of the levels as committed. */
28917 {
28924 }
28925 }
28927 /* Commit to the topmost currently active tentative parse.
28929 Note that this function shouldn't be called when there are
28930 irreversible side-effects while in a tentative state. For
28931 example, we shouldn't create a permanent entry in the symbol
28932 table, or issue an error message that might not apply if the
28933 tentative parse is aborted. */
28935 static void
28937 {
28942 {
28950 }
28951 }
28953 /* Abort the currently active tentative parse. All consumed tokens
28954 will be rolled back, and no diagnostics will be issued. */
28956 static void
28958 {
28962 /* Now, pretend that we want to see if the construct was
28963 successfully parsed. */
28965 }
28967 /* Stop parsing tentatively. If a parse error has occurred, restore the
28968 token stream. Otherwise, commit to the tokens we have consumed.
28969 Returns true if no error occurred; false otherwise. */
28971 static bool
28973 {
28977 /* Remember whether or not an error occurred, since we are about to
28978 destroy that information. */
28980 /* Remove the topmost context from the stack. */
28983 /* If no parse errors occurred, commit to the tentative parse. */
28985 {
28986 /* Commit to the tokens read tentatively, unless that was
28987 already done. */
28992 }
28993 /* Otherwise, if errors occurred, roll back our state so that things
28994 are just as they were before we began the tentative parse. */
28995 else
28996 {
28999 }
29000 /* Add the context to the front of the free list. */
29005 }
29007 /* Returns true if we are parsing tentatively and are not committed to
29008 this tentative parse. */
29010 static bool
29012 {
29015 }
29017 /* Returns nonzero iff an error has occurred during the most recent
29018 tentative parse. */
29020 static bool
29022 {
29025 }
29027 /* Returns nonzero if GNU extensions are allowed. */
29029 static bool
29031 {
29033 }
29034 \f
29035 /* Objective-C++ Productions */
29038 /* Parse an Objective-C expression, which feeds into a primary-expression
29039 above.
29041 objc-expression:
29042 objc-message-expression
29043 objc-string-literal
29044 objc-encode-expression
29045 objc-protocol-expression
29046 objc-selector-expression
29048 Returns a tree representation of the expression. */
29050 static cp_expr
29052 {
29053 /* Try to figure out what kind of declaration is present. */
29057 {
29067 {
29079 }
29080 /* FALLTHRU */
29086 }
29089 }
29091 /* Parse an Objective-C message expression.
29093 objc-message-expression:
29094 [ objc-message-receiver objc-message-args ]
29096 Returns a representation of an Objective-C message. */
29098 static tree
29100 {
29112 /* Construct a location e.g.
29113 [self func1:5]
29114 ^~~~~~~~~~~~~~
29115 ranging from the '[' to the ']', with the caret at the start. */
29120 }
29122 /* Parse an objc-message-receiver.
29124 objc-message-receiver:
29125 expression
29126 simple-type-specifier
29128 Returns a representation of the type or expression. */
29130 static tree
29132 {
29133 tree rcv;
29135 /* An Objective-C message receiver may be either (1) a type
29136 or (2) an expression. */
29140 /* If that worked out, fine. */
29147 CP_PARSER_FLAGS_NONE);
29154 }
29156 /* Parse the arguments and selectors comprising an Objective-C message.
29158 objc-message-args:
29159 objc-selector
29160 objc-selector-args
29161 objc-selector-args , objc-comma-args
29163 objc-selector-args:
29164 objc-selector [opt] : assignment-expression
29165 objc-selector-args objc-selector [opt] : assignment-expression
29167 objc-comma-args:
29168 assignment-expression
29169 objc-comma-args , assignment-expression
29171 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29172 selector arguments and TREE_VALUE containing a list of comma
29173 arguments. */
29175 static tree
29177 {
29183 {
29189 /* Detect if we have a unary selector. */
29198 sel_args
29203 }
29205 /* Handle non-selector arguments, if any. */
29207 {
29208 tree arg;
29213 addl_args
29218 }
29221 {
29224 }
29227 }
29229 /* Parse an Objective-C encode expression.
29231 objc-encode-expression:
29232 @encode objc-typename
29234 Returns an encoded representation of the type argument. */
29236 static cp_expr
29238 {
29239 tree type;
29244 matching_parens parens;
29251 {
29255 }
29257 /* This happens if we find @encode(T) (where T is a template
29258 typename or something dependent on a template typename) when
29259 parsing a template. In that case, we can't compile it
29260 immediately, but we rather create an AT_ENCODE_EXPR which will
29261 need to be instantiated when the template is used.
29262 */
29264 {
29268 }
29271 /* Build a location of the form:
29272 @encode(int)
29273 ^~~~~~~~~~~~
29274 with caret==start at the @ token, finishing at the close paren. */
29275 location_t combined_loc
29280 }
29282 /* Parse an Objective-C @defs expression. */
29284 static tree
29286 {
29287 tree name;
29290 matching_parens parens;
29296 }
29298 /* Parse an Objective-C protocol expression.
29300 objc-protocol-expression:
29301 @protocol ( identifier )
29303 Returns a representation of the protocol expression. */
29305 static tree
29307 {
29308 tree proto;
29312 matching_parens parens;
29317 /* Build a location of the form:
29318 @protocol(prot)
29319 ^~~~~~~~~~~~~~~
29320 with caret==start at the @ token, finishing at the close paren. */
29321 location_t combined_loc
29327 }
29329 /* Parse an Objective-C selector expression.
29331 objc-selector-expression:
29332 @selector ( objc-method-signature )
29334 objc-method-signature:
29335 objc-selector
29336 objc-selector-seq
29338 objc-selector-seq:
29339 objc-selector :
29340 objc-selector-seq objc-selector :
29342 Returns a representation of the method selector. */
29344 static tree
29346 {
29353 matching_parens parens;
29359 {
29368 {
29369 /* Detect if we have a unary selector. */
29371 {
29374 }
29375 else
29376 {
29378 }
29379 }
29384 {
29385 sel_seq
29388 sel_seq
29391 }
29392 else
29393 sel_seq
29398 }
29400 finish_selector:
29404 /* Build a location of the form:
29405 @selector(func)
29406 ^~~~~~~~~~~~~~~
29407 with caret==start at the @ token, finishing at the close paren. */
29408 location_t combined_loc
29412 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29415 }
29417 /* Parse a list of identifiers.
29419 objc-identifier-list:
29420 identifier
29421 objc-identifier-list , identifier
29423 Returns a TREE_LIST of identifier nodes. */
29425 static tree
29427 {
29428 tree identifier;
29429 tree list;
29440 {
29447 identifier));
29449 }
29452 }
29454 /* Parse an Objective-C alias declaration.
29456 objc-alias-declaration:
29457 @compatibility_alias identifier identifier ;
29459 This function registers the alias mapping with the Objective-C front end.
29460 It returns nothing. */
29462 static void
29464 {
29472 }
29474 /* Parse an Objective-C class forward-declaration.
29476 objc-class-declaration:
29477 @class objc-identifier-list ;
29479 The function registers the forward declarations with the Objective-C
29480 front end. It returns nothing. */
29482 static void
29484 {
29487 {
29488 tree id;
29498 else
29500 }
29502 }
29504 /* Parse a list of Objective-C protocol references.
29506 objc-protocol-refs-opt:
29507 objc-protocol-refs [opt]
29509 objc-protocol-refs:
29510 < objc-identifier-list >
29512 Returns a TREE_LIST of identifiers, if any. */
29514 static tree
29516 {
29520 {
29524 }
29527 }
29529 /* Parse a Objective-C visibility specification. */
29531 static void
29533 {
29537 {
29552 }
29554 /* Eat '@private'/'@protected'/'@public'. */
29556 }
29558 /* Parse an Objective-C method type. Return 'true' if it is a class
29559 (+) method, and 'false' if it is an instance (-) method. */
29563 {
29566 else
29568 }
29570 /* Parse an Objective-C protocol qualifier. */
29572 static tree
29574 {
29587 {
29592 }
29595 }
29597 /* Parse an Objective-C typename. */
29599 static tree
29601 {
29605 {
29608 matching_parens parens;
29612 /* An ObjC type name may consist of just protocol qualifiers, in which
29613 case the type shall default to 'id'. */
29615 {
29618 /* If the type could not be parsed, an error has already
29619 been produced. For error recovery, behave as if it had
29620 not been specified, which will use the default type
29621 'id'. */
29623 {
29625 /* We need to skip to the closing parenthesis as
29626 cp_parser_type_id() does not seem to do it for
29627 us. */
29632 }
29633 }
29637 }
29640 }
29642 /* Check to see if TYPE refers to an Objective-C selector name. */
29644 static bool
29646 {
29652 }
29654 /* Parse an Objective-C selector. */
29656 static tree
29658 {
29662 {
29665 }
29667 /* C++ operator names are allowed to appear in ObjC selectors. */
29669 {
29682 }
29683 }
29685 /* Parse an Objective-C params list. */
29687 static tree
29689 {
29695 {
29705 /* Detect if we have a unary selector. */
29708 {
29711 }
29715 {
29716 /* Something went quite wrong. There should be a colon
29717 here, but there is not. Stop parsing parameters. */
29719 }
29721 /* New ObjC allows attributes on parameters too. */
29726 params
29729 type_name,
29730 identifier,
29731 parm_attr));
29734 }
29737 {
29740 }
29742 /* We allow tail attributes for the method. */
29744 {
29752 }
29755 {
29758 }
29760 }
29762 /* Parse the non-keyword Objective-C params. */
29764 static tree
29767 {
29773 {
29775 tree parm;
29781 {
29786 }
29788 /* TODO: parse attributes for tail parameters. */
29797 }
29799 /* We allow tail attributes for the method. */
29801 {
29803 {
29808 }
29809 else
29810 /* We have an error, but parse the attributes, so that we can
29811 carry on. */
29817 }
29820 }
29822 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29824 static void
29826 {
29829 /* If the next token is `extern' and the following token is a string
29830 literal, then we have a linkage specification. */
29832 && cp_parser_is_pure_string_literal
29835 /* Handle #pragma, if any. */
29838 /* Allow stray semicolons. */
29841 /* Mark methods as optional or required, when building protocols. */
29843 {
29846 }
29848 {
29851 }
29854 /* Other stray characters must generate errors. */
29856 {
29860 }
29861 /* Finally, try to parse a block-declaration, or a function-definition. */
29862 else
29864 }
29866 /* Parse a method signature. */
29868 static tree
29870 {
29886 }
29888 static bool
29890 {
29891 tree tattr;
29896 /* If the attributes are followed by a method introducer, this is not allowed.
29897 Dump the attributes and flag the situation. */
29902 /* Otherwise, the attributes introduce some interstitial code, possibly so
29903 rewind to allow that check. */
29906 }
29908 /* Parse an Objective-C method prototype list. */
29910 static void
29912 {
29916 {
29918 {
29923 else
29927 {
29931 }
29934 }
29940 OPT_Wattributes,
29942 else
29943 /* Allow for interspersed non-ObjC++ code. */
29947 }
29951 else
29955 }
29957 /* Parse an Objective-C method definition list. */
29959 static void
29961 {
29965 {
29966 tree meth;
29969 {
29975 else
29980 {
29984 }
29986 NULL_TREE);
29988 /* For historical reasons, we accept an optional semicolon. */
29995 {
30002 }
30003 }
30004 /* The following case will be removed once @synthesize is
30005 completely implemented. */
30016 else
30017 /* Allow for interspersed non-ObjC++ code. */
30021 }
30025 else
30029 }
30031 /* Parse Objective-C ivars. */
30033 static void
30035 {
30046 {
30047 cp_decl_specifier_seq declspecs;
30049 tree prefix_attributes;
30057 CP_PARSER_FLAGS_OPTIONAL,
30061 /* auto, register, static, extern, mutable. */
30063 {
30066 }
30068 /* thread_local. */
30070 {
30073 }
30075 /* typedef. */
30077 {
30080 }
30085 /* Keep going until we hit the `;' at the end of the
30086 declaration. */
30088 {
30093 /* Check for a (possibly unnamed) bitfield declaration. */
30101 {
30102 /* Get the name of the bitfield. */
30105 sfk_none);
30107 eat_colon:
30109 /* Get the width of the bitfield. */
30110 width
30112 }
30113 else
30114 {
30115 /* Parse the declarator. */
30116 declarator
30122 }
30124 /* Look for attributes that apply to the ivar. */
30126 /* Remember which attributes are prefix attributes and
30127 which are not. */
30129 /* Combine the attributes. */
30133 /* Create the bitfield declaration. */
30136 else
30141 /* Add the instance variable. */
30145 /* Reset PREFIX_ATTRIBUTES. */
30147 {
30152 }
30157 {
30160 }
30162 }
30166 }
30171 /* Do not consume the RID_AT_END, so it will be read again as terminating
30172 the @interface of @implementation. */
30176 /* For historical reasons, we accept an optional semicolon. */
30179 }
30181 /* Parse an Objective-C protocol declaration. */
30183 static void
30185 {
30191 {
30196 }
30198 /* See if we have a forward declaration or a definition. */
30201 /* Try a forward declaration first. */
30203 {
30205 {
30206 tree id;
30216 else
30218 }
30220 }
30222 /* Ok, we got a full-fledged definition (or at least should). */
30223 else
30224 {
30229 }
30230 }
30232 /* Parse an Objective-C superclass or category. */
30234 static void
30239 {
30245 {
30248 }
30250 {
30251 matching_parens parens;
30254 /* If there is no category name, and this is an @interface, we
30255 have a class extension. */
30257 {
30260 }
30261 else
30265 }
30266 }
30268 /* Parse an Objective-C class interface. */
30270 static void
30272 {
30279 {
30280 /* It's hard to recover because even if valid @interface stuff
30281 is to follow, we can't compile it (or validate it) if we
30282 don't even know which class it refers to. Let's assume this
30283 was a stray '@interface' token in the stream and skip it.
30284 */
30286 }
30291 /* We have either a class or a category on our hands. */
30294 else
30295 {
30297 /* Handle instance variable declarations, if any. */
30300 }
30303 }
30305 /* Parse an Objective-C class implementation. */
30307 static void
30309 {
30316 {
30317 /* It's hard to recover because even if valid @implementation
30318 stuff is to follow, we can't compile it (or validate it) if
30319 we don't even know which class it refers to. Let's assume
30320 this was a stray '@implementation' token in the stream and
30321 skip it.
30322 */
30324 }
30328 /* We have either a class or a category on our hands. */
30331 else
30332 {
30334 /* Handle instance variable declarations, if any. */
30337 }
30340 }
30342 /* Consume the @end token and finish off the implementation. */
30344 static void
30346 {
30349 }
30351 /* Parse an Objective-C declaration. */
30353 static void
30355 {
30356 /* Try to figure out what kind of declaration is present. */
30361 {
30377 }
30380 {
30403 }
30404 }
30406 /* Parse an Objective-C try-catch-finally statement.
30408 objc-try-catch-finally-stmt:
30409 @try compound-statement objc-catch-clause-seq [opt]
30410 objc-finally-clause [opt]
30412 objc-catch-clause-seq:
30413 objc-catch-clause objc-catch-clause-seq [opt]
30415 objc-catch-clause:
30416 @catch ( objc-exception-declaration ) compound-statement
30418 objc-finally-clause:
30419 @finally compound-statement
30421 objc-exception-declaration:
30422 parameter-declaration
30423 '...'
30425 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30427 Returns NULL_TREE.
30429 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30430 for C. Keep them in sync. */
30432 static tree
30434 {
30435 location_t location;
30436 tree stmt;
30441 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30442 node, lest it get absorbed into the surrounding block. */
30448 {
30452 matching_parens parens;
30458 {
30459 /* We have "@catch (...)" (where the '...' are literally
30460 what is in the code). Skip the '...'.
30461 parameter_declaration is set to NULL_TREE, and
30462 objc_being_catch_clauses() knows that that means
30463 '...'. */
30466 }
30467 else
30468 {
30469 /* We have "@catch (NSException *exception)" or something
30470 like that. Parse the parameter declaration. */
30474 else
30479 }
30482 else
30483 {
30484 /* If there was no open parenthesis, we are recovering from
30485 an error, and we are trying to figure out what mistake
30486 the user has made. */
30488 /* If there is an immediate closing parenthesis, the user
30489 probably forgot the opening one (ie, they typed "@catch
30490 NSException *e)". Parse the closing parenthesis and keep
30491 going. */
30495 /* If these is no immediate closing parenthesis, the user
30496 probably doesn't know that parenthesis are required at
30497 all (ie, they typed "@catch NSException *e"). So, just
30498 forget about the closing parenthesis and keep going. */
30499 }
30503 }
30505 {
30508 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30509 node, lest it get absorbed into the surrounding block. */
30513 }
30516 }
30518 /* Parse an Objective-C synchronized statement.
30520 objc-synchronized-stmt:
30521 @synchronized ( expression ) compound-statement
30523 Returns NULL_TREE. */
30525 static tree
30527 {
30528 location_t location;
30535 matching_parens parens;
30540 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30541 node, lest it get absorbed into the surrounding block. */
30546 }
30548 /* Parse an Objective-C throw statement.
30550 objc-throw-stmt:
30551 @throw assignment-expression [opt] ;
30553 Returns a constructed '@throw' statement. */
30555 static tree
30557 {
30569 }
30571 /* Parse an Objective-C statement. */
30573 static tree
30575 {
30576 /* Try to figure out what kind of declaration is present. */
30580 {
30591 }
30594 }
30596 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30597 look ahead to see if an objc keyword follows the attributes. This
30598 is to detect the use of prefix attributes on ObjC @interface and
30599 @protocol. */
30601 static bool
30603 {
30608 {
30611 }
30614 }
30616 /* This routine is a minimal replacement for
30617 c_parser_struct_declaration () used when parsing the list of
30618 types/names or ObjC++ properties. For example, when parsing the
30619 code
30621 @property (readonly) int a, b, c;
30623 this function is responsible for parsing "int a, int b, int c" and
30624 returning the declarations as CHAIN of DECLs.
30626 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30627 similar parsing. */
30628 static tree
30630 {
30632 cp_decl_specifier_seq declspecs;
30634 tree prefix_attributes;
30637 CP_PARSER_FLAGS_NONE,
30644 /* auto, register, static, extern, mutable. */
30646 {
30649 }
30651 /* thread_local. */
30653 {
30656 }
30658 /* typedef. */
30660 {
30663 }
30668 /* Keep going until we hit the `;' at the end of the declaration. */
30670 {
30675 /* Parse the declarator. */
30679 /* Look for attributes that apply to the ivar. */
30681 /* Remember which attributes are prefix attributes and
30682 which are not. */
30684 /* Combine the attributes. */
30694 /* Reset PREFIX_ATTRIBUTES. */
30696 {
30701 }
30708 {
30711 }
30712 else
30714 }
30716 }
30718 /* Parse an Objective-C @property declaration. The syntax is:
30720 objc-property-declaration:
30721 '@property' objc-property-attributes[opt] struct-declaration ;
30723 objc-property-attributes:
30724 '(' objc-property-attribute-list ')'
30726 objc-property-attribute-list:
30727 objc-property-attribute
30728 objc-property-attribute-list, objc-property-attribute
30730 objc-property-attribute
30731 'getter' = identifier
30732 'setter' = identifier
30733 'readonly'
30734 'readwrite'
30735 'assign'
30736 'retain'
30737 'copy'
30738 'nonatomic'
30740 For example:
30741 @property NSString *name;
30742 @property (readonly) id object;
30743 @property (retain, nonatomic, getter=getTheName) id name;
30744 @property int a, b, c;
30746 PS: This function is identical to
30747 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30748 static void
30750 {
30751 /* The following variables hold the attributes of the properties as
30752 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30753 seen. When we see an attribute, we set them to 'true' (if they
30754 are boolean properties) or to the identifier (if they have an
30755 argument, ie, for getter and setter). Note that here we only
30756 parse the list of attributes, check the syntax and accumulate the
30757 attributes that we find. objc_add_property_declaration() will
30758 then process the information. */
30768 /* 'properties' is the list of properties that we read. Usually a
30769 single one, but maybe more (eg, in "@property int a, b, c;" there
30770 are three). */
30771 tree properties;
30772 location_t loc;
30778 /* Parse the optional attribute list... */
30780 {
30781 /* Eat the '('. */
30782 matching_parens parens;
30786 {
30792 {
30795 }
30799 {
30810 {
30814 else
30819 }
30822 {
30826 }
30828 {
30830 {
30833 }
30834 else
30838 else
30840 }
30841 else
30842 {
30844 {
30847 }
30848 else
30850 }
30856 }
30863 else
30865 }
30867 /* FIXME: "@property (setter, assign);" will generate a spurious
30868 "error: expected ‘)’ before ‘,’ token". This is because
30869 cp_parser_require, unlike the C counterpart, will produce an
30870 error even if we are in error recovery. */
30872 {
30877 }
30878 }
30880 /* ... and the property declaration(s). */
30884 {
30886 /* If the next token is now a `;', consume it. */
30890 }
30894 else
30895 {
30896 /* Comma-separated properties are chained together in
30897 reverse order; add them one by one. */
30906 }
30909 }
30911 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30913 objc-synthesize-declaration:
30914 @synthesize objc-synthesize-identifier-list ;
30916 objc-synthesize-identifier-list:
30917 objc-synthesize-identifier
30918 objc-synthesize-identifier-list, objc-synthesize-identifier
30920 objc-synthesize-identifier
30921 identifier
30922 identifier = identifier
30924 For example:
30925 @synthesize MyProperty;
30926 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30928 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30929 for C. Keep them in sync.
30930 */
30931 static void
30933 {
30935 location_t loc;
30940 {
30944 {
30947 }
30949 {
30953 {
30956 }
30957 }
30958 else
30963 else
30965 }
30968 }
30970 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30972 objc-dynamic-declaration:
30973 @dynamic identifier-list ;
30975 For example:
30976 @dynamic MyProperty;
30977 @dynamic MyProperty, AnotherProperty;
30979 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30980 for C. Keep them in sync.
30981 */
30982 static void
30984 {
30986 location_t loc;
30991 {
30992 tree property;
30995 {
30998 }
31002 else
31004 }
31007 }
31009 \f
31010 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31012 /* Returns name of the next clause.
31013 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31014 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31015 returned and the token is consumed. */
31017 static pragma_omp_clause
31019 {
31035 {
31040 {
31217 }
31218 }
31224 }
31226 /* Validate that a clause of the given type does not already exist. */
31228 static void
31231 {
31232 tree c;
31236 {
31239 }
31240 }
31242 /* OpenMP 2.5:
31243 variable-list:
31244 identifier
31245 variable-list , identifier
31247 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31248 colon). An opening parenthesis will have been consumed by the caller.
31250 If KIND is nonzero, create the appropriate node and install the decl
31251 in OMP_CLAUSE_DECL and add the node to the head of the list.
31253 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31254 return the list created.
31256 COLON can be NULL if only closing parenthesis should end the list,
31257 or pointer to bool which will receive false if the list is terminated
31258 by closing parenthesis or true if the list is terminated by colon. */
31260 static tree
31263 {
31267 {
31270 }
31272 {
31277 && current_class_ptr
31279 {
31285 }
31286 else
31287 {
31300 }
31302 ;
31304 {
31306 {
31308 /* The OpenACC cache directive explicitly only allows "array
31309 elements or subarrays". */
31311 {
31315 }
31316 /* FALLTHROUGH. */
31321 {
31322 location_t loc
31327 decl
31331 }
31332 /* FALLTHROUGH. */
31336 {
31344 parser->colon_corrects_to_scope_p
31348 else
31349 {
31350 /* Look for `:'. */
31354 CPP_CLOSE_SQUARE))
31356 }
31357 /* Look for the closing `]'. */
31359 RT_CLOSE_SQUARE))
31363 }
31367 }
31373 }
31374 else
31377 get_comma:
31381 }
31387 {
31391 }
31394 {
31397 /* Try to resync to an unnested comma. Copied from
31398 cp_parser_parenthesized_expression_list. */
31399 skip_comma:
31408 }
31411 }
31413 /* Similarly, but expect leading and trailing parenthesis. This is a very
31414 common case for omp clauses. */
31416 static tree
31418 {
31422 }
31424 /* OpenACC 2.0:
31425 copy ( variable-list )
31426 copyin ( variable-list )
31427 copyout ( variable-list )
31428 create ( variable-list )
31429 delete ( variable-list )
31430 present ( variable-list )
31431 present_or_copy ( variable-list )
31432 pcopy ( variable-list )
31433 present_or_copyin ( variable-list )
31434 pcopyin ( variable-list )
31435 present_or_copyout ( variable-list )
31436 pcopyout ( variable-list )
31437 present_or_create ( variable-list )
31438 pcreate ( variable-list ) */
31440 static tree
31442 tree list)
31443 {
31446 {
31492 }
31500 }
31502 /* OpenACC 2.0:
31503 deviceptr ( variable-list ) */
31505 static tree
31507 {
31511 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31512 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31513 variable-list must only allow for pointer variables. */
31516 {
31523 }
31526 }
31528 /* OpenACC 2.0:
31529 auto
31530 independent
31531 nohost
31532 seq */
31534 static tree
31538 {
31543 }
31545 /* OpenACC:
31546 num_gangs ( expression )
31547 num_workers ( expression )
31548 vector_length ( expression ) */
31550 static tree
31553 {
31556 matching_parens parens;
31564 {
31569 }
31577 }
31579 /* OpenACC:
31581 gang [( gang-arg-list )]
31582 worker [( [num:] int-expr )]
31583 vector [( [length:] int-expr )]
31585 where gang-arg is one of:
31587 [num:] int-expr
31588 static: size-expr
31590 and size-expr may be:
31592 *
31593 int-expr
31594 */
31596 static tree
31599 {
31609 {
31610 matching_parens parens;
31613 do
31614 {
31618 /* Gang static argument. */
31621 {
31629 {
31632 }
31634 /* Check for the '*' argument. */
31638 CPP_CLOSE_PAREN)))
31639 {
31644 {
31647 }
31649 }
31650 }
31651 /* Worker num: argument and vector length: arguments. */
31655 {
31658 }
31660 /* Now collect the actual argument. */
31662 {
31665 }
31677 {
31680 }
31682 }
31687 }
31701 cleanup_error:
31704 }
31706 /* OpenACC 2.0:
31707 tile ( size-expr-list ) */
31709 static tree
31711 {
31715 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31716 so, but the spec authors never considered such a case and have
31717 differing opinions on what it might mean, including 'not
31718 allowed'.) */
31721 clause_loc);
31726 do
31727 {
31734 {
31737 }
31738 else
31742 }
31745 /* Consume the trailing ')'. */
31753 }
31755 /* OpenACC 2.0
31756 Parse wait clause or directive parameters. */
31758 static tree
31760 {
31770 {
31775 }
31782 {
31786 {
31789 else
31790 {
31797 }
31798 }
31799 }
31802 }
31804 /* OpenACC:
31805 wait ( int-expr-list ) */
31807 static tree
31809 {
31818 }
31820 /* OpenMP 3.0:
31821 collapse ( constant-expression ) */
31823 static tree
31825 {
31827 location_t loc;
31828 HOST_WIDE_INT n;
31831 matching_parens parens;
31849 {
31852 }
31861 }
31863 /* OpenMP 2.5:
31864 default ( none | shared )
31866 OpenACC:
31867 default ( none | present ) */
31869 static tree
31872 {
31874 tree c;
31876 matching_parens parens;
31880 {
31885 {
31906 }
31909 }
31910 else
31911 {
31912 invalid_kind:
31915 else
31917 }
31934 }
31936 /* OpenMP 3.1:
31937 final ( expression ) */
31939 static tree
31941 {
31944 matching_parens parens;
31963 }
31965 /* OpenMP 2.5:
31966 if ( expression )
31968 OpenMP 4.5:
31969 if ( directive-name-modifier : expression )
31971 directive-name-modifier:
31972 parallel | task | taskloop | target data | target | target update
31973 | target enter data | target exit data */
31975 static tree
31978 {
31982 matching_parens parens;
31987 {
31999 {
32002 {
32015 else
32016 {
32017 location_t loc
32022 }
32025 {
32027 {
32032 }
32034 {
32035 location_t loc
32039 }
32040 }
32041 }
32042 }
32044 {
32046 {
32049 }
32050 else
32051 {
32053 {
32054 location_t loc
32057 }
32059 }
32060 }
32061 }
32073 {
32076 {
32079 {
32089 }
32091 p);
32093 }
32095 {
32098 else
32101 }
32104 {
32108 }
32109 }
32117 }
32119 /* OpenMP 3.1:
32120 mergeable */
32122 static tree
32125 {
32126 tree c;
32129 location);
32134 }
32136 /* OpenMP 2.5:
32137 nowait */
32139 static tree
32142 {
32143 tree c;
32150 }
32152 /* OpenMP 2.5:
32153 num_threads ( expression ) */
32155 static tree
32157 location_t location)
32158 {
32161 matching_parens parens;
32181 }
32183 /* OpenMP 4.5:
32184 num_tasks ( expression ) */
32186 static tree
32188 location_t location)
32189 {
32192 matching_parens parens;
32212 }
32214 /* OpenMP 4.5:
32215 grainsize ( expression ) */
32217 static tree
32219 location_t location)
32220 {
32223 matching_parens parens;
32243 }
32245 /* OpenMP 4.5:
32246 priority ( expression ) */
32248 static tree
32250 location_t location)
32251 {
32254 matching_parens parens;
32274 }
32276 /* OpenMP 4.5:
32277 hint ( expression ) */
32279 static tree
32281 location_t location)
32282 {
32285 matching_parens parens;
32304 }
32306 /* OpenMP 4.5:
32307 defaultmap ( tofrom : scalar ) */
32309 static tree
32311 location_t location)
32312 {
32316 matching_parens parens;
32321 {
32324 }
32328 {
32331 }
32337 {
32340 }
32344 {
32347 }
32353 location);
32359 out_err:
32364 }
32366 /* OpenMP 2.5:
32367 ordered
32369 OpenMP 4.5:
32370 ordered ( constant-expression ) */
32372 static tree
32375 {
32377 HOST_WIDE_INT n;
32383 {
32384 matching_parens parens;
32401 {
32403 "ordered argument needs positive constant integer "
32406 }
32407 }
32413 }
32415 /* OpenMP 2.5:
32416 reduction ( reduction-operator : variable-list )
32418 reduction-operator:
32419 One of: + * - & ^ | && ||
32421 OpenMP 3.1:
32423 reduction-operator:
32424 One of: + * - & ^ | && || min max
32426 OpenMP 4.0:
32428 reduction-operator:
32429 One of: + * - & ^ | && ||
32430 id-expression */
32432 static tree
32434 {
32442 {
32452 }
32456 else
32457 {
32468 {
32498 }
32499 else
32500 {
32502 resync_fail:
32507 }
32508 }
32514 NULL);
32516 {
32519 }
32522 }
32524 /* OpenMP 2.5:
32525 schedule ( schedule-kind )
32526 schedule ( schedule-kind , expression )
32528 schedule-kind:
32529 static | dynamic | guided | runtime | auto
32531 OpenMP 4.5:
32532 schedule ( schedule-modifier : schedule-kind )
32533 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32535 schedule-modifier:
32536 simd
32537 monotonic
32538 nonmonotonic */
32540 static tree
32542 {
32546 matching_parens parens;
32553 {
32562 else
32568 else
32569 {
32572 }
32573 }
32576 {
32581 {
32602 }
32603 }
32608 else
32614 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32616 {
32620 }
32623 {
32638 else
32643 }
32655 invalid_kind:
32657 resync_fail:
32662 }
32664 /* OpenMP 3.0:
32665 untied */
32667 static tree
32670 {
32671 tree c;
32678 }
32680 /* OpenMP 4.0:
32681 inbranch
32682 notinbranch */
32684 static tree
32687 {
32692 }
32694 /* OpenMP 4.0:
32695 parallel
32696 for
32697 sections
32698 taskgroup */
32700 static tree
32704 {
32708 }
32710 /* OpenMP 4.5:
32711 nogroup */
32713 static tree
32716 {
32721 }
32723 /* OpenMP 4.5:
32724 simd
32725 threads */
32727 static tree
32731 {
32736 }
32738 /* OpenMP 4.0:
32739 num_teams ( expression ) */
32741 static tree
32743 location_t location)
32744 {
32747 matching_parens parens;
32767 }
32769 /* OpenMP 4.0:
32770 thread_limit ( expression ) */
32772 static tree
32774 location_t location)
32775 {
32778 matching_parens parens;
32798 }
32800 /* OpenMP 4.0:
32801 aligned ( variable-list )
32802 aligned ( variable-list : constant-expression ) */
32804 static tree
32806 {
32810 matching_parens parens;
32818 {
32828 }
32834 }
32836 /* OpenMP 4.0:
32837 linear ( variable-list )
32838 linear ( variable-list : expression )
32840 OpenMP 4.5:
32841 linear ( modifier ( variable-list ) )
32842 linear ( modifier ( variable-list ) : expression ) */
32844 static tree
32847 {
32852 matching_parens parens;
32857 {
32869 else
32871 }
32876 else
32877 {
32886 }
32889 {
32894 {
32905 {
32908 }
32911 }
32922 }
32925 {
32928 }
32931 }
32933 /* OpenMP 4.0:
32934 safelen ( constant-expression ) */
32936 static tree
32938 location_t location)
32939 {
32942 matching_parens parens;
32961 }
32963 /* OpenMP 4.0:
32964 simdlen ( constant-expression ) */
32966 static tree
32968 location_t location)
32969 {
32972 matching_parens parens;
32991 }
32993 /* OpenMP 4.5:
32994 vec:
32995 identifier [+/- integer]
32996 vec , identifier [+/- integer]
32997 */
32999 static tree
33001 tree list)
33002 {
33006 {
33009 }
33012 {
33019 else
33020 {
33021 t = cp_parser_lookup_name_simple
33026 id_loc);
33027 }
33033 {
33036 }
33040 {
33043 }
33047 {
33050 }
33053 add_to_vector:
33055 {
33059 }
33065 }
33068 {
33074 }
33076 }
33078 /* OpenMP 4.0:
33079 depend ( depend-kind : variable-list )
33081 depend-kind:
33082 in | out | inout
33084 OpenMP 4.5:
33085 depend ( source )
33087 depend ( sink : vec ) */
33089 static tree
33091 {
33095 matching_parens parens;
33100 {
33114 else
33116 }
33117 else
33123 {
33133 }
33140 else
33141 {
33147 }
33150 invalid_kind:
33152 resync_fail:
33157 }
33159 /* OpenMP 4.0:
33160 map ( map-kind : variable-list )
33161 map ( variable-list )
33163 map-kind:
33164 alloc | to | from | tofrom
33166 OpenMP 4.5:
33167 map-kind:
33168 alloc | to | from | tofrom | release | delete
33170 map ( always [,] map-kind: variable-list ) */
33172 static tree
33174 {
33183 {
33188 {
33191 nth++;
33197 {
33202 }
33203 }
33204 }
33208 {
33222 else
33223 {
33229 }
33232 }
33235 {
33239 }
33242 NULL);
33248 }
33250 /* OpenMP 4.0:
33251 device ( expression ) */
33253 static tree
33255 location_t location)
33256 {
33259 matching_parens parens;
33279 }
33281 /* OpenMP 4.0:
33282 dist_schedule ( static )
33283 dist_schedule ( static , expression ) */
33285 static tree
33287 location_t location)
33288 {
33291 matching_parens parens;
33302 {
33313 }
33318 location);
33322 invalid_kind:
33324 resync_fail:
33329 }
33331 /* OpenMP 4.0:
33332 proc_bind ( proc-bind-kind )
33334 proc-bind-kind:
33335 master | close | spread */
33337 static tree
33339 location_t location)
33340 {
33341 tree c;
33348 {
33358 else
33360 }
33361 else
33370 location);
33375 invalid_kind:
33377 resync_fail:
33382 }
33384 /* OpenACC:
33385 async [( int-expr )] */
33387 static tree
33389 {
33396 {
33397 matching_parens parens;
33406 }
33416 }
33418 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33419 is a bitmask in MASK. Return the list of clauses found. */
33421 static tree
33425 {
33430 {
33431 location_t here;
33432 pragma_omp_clause c_kind;
33433 omp_clause_code code;
33444 {
33496 clauses);
33514 OMP_CLAUSE_INDEPENDENT,
33526 clauses);
33532 clauses);
33556 clauses);
33578 clauses);
33590 clauses);
33604 }
33609 {
33610 /* Remove the invalid clause(s) from the list to avoid
33611 confusing the rest of the compiler. */
33614 }
33615 }
33617 saw_error:
33624 }
33626 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33627 is a bitmask in MASK. Return the list of clauses found; the result
33628 of clause default goes in *pdefault. */
33630 static tree
33634 {
33640 {
33641 pragma_omp_clause c_kind;
33652 {
33664 clauses);
33678 clauses);
33698 clauses);
33703 clauses);
33713 clauses);
33747 clauses);
33761 clauses);
33776 OMP_CLAUSE_NOTINBRANCH,
33785 {
33786 clause_not_first:
33790 }
33820 clauses);
33821 else
33831 clauses);
33849 {
33854 }
33897 clauses
33903 clauses
33911 }
33916 {
33917 /* Remove the invalid clause(s) from the list to avoid
33918 confusing the rest of the compiler. */
33921 }
33922 }
33923 saw_error:
33926 {
33929 else
33931 }
33933 }
33935 /* OpenMP 2.5:
33936 structured-block:
33937 statement
33939 In practice, we're also interested in adding the statement to an
33940 outer node. So it is convenient if we work around the fact that
33941 cp_parser_statement calls add_stmt. */
33943 static unsigned
33945 {
33948 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33949 This preserves the "not within loop or switch" style error messages
33950 for nonsense cases like
33951 void foo() {
33952 #pragma omp single
33953 break;
33954 }
33955 */
33960 }
33962 static void
33964 {
33966 }
33968 static tree
33970 {
33978 }
33980 /* OpenMP 2.5:
33981 # pragma omp atomic new-line
33982 expression-stmt
33984 expression-stmt:
33985 x binop= expr | x++ | ++x | x-- | --x
33986 binop:
33987 +, *, -, /, &, ^, |, <<, >>
33989 where x is an lvalue expression with scalar type.
33991 OpenMP 3.1:
33992 # pragma omp atomic new-line
33993 update-stmt
33995 # pragma omp atomic read new-line
33996 read-stmt
33998 # pragma omp atomic write new-line
33999 write-stmt
34001 # pragma omp atomic update new-line
34002 update-stmt
34004 # pragma omp atomic capture new-line
34005 capture-stmt
34007 # pragma omp atomic capture new-line
34008 capture-block
34010 read-stmt:
34011 v = x
34012 write-stmt:
34013 x = expr
34014 update-stmt:
34015 expression-stmt | x = x binop expr
34016 capture-stmt:
34017 v = expression-stmt
34018 capture-block:
34019 { v = x; update-stmt; } | { update-stmt; v = x; }
34021 OpenMP 4.0:
34022 update-stmt:
34023 expression-stmt | x = x binop expr | x = expr binop x
34024 capture-stmt:
34025 v = update-stmt
34026 capture-block:
34027 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34029 where x and v are lvalue expressions with scalar type. */
34031 static void
34033 {
34041 {
34046 {
34052 }
34053 }
34055 {
34067 else
34071 }
34073 {
34079 {
34084 {
34087 }
34088 }
34089 }
34093 {
34103 else
34108 {
34109 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34110 opcode. */
34115 }
34119 {
34122 }
34123 else
34124 {
34130 }
34133 }
34135 restart:
34139 {
34146 /* FALLTHROUGH */
34156 /* FALLTHROUGH */
34171 /* Undo effects of boolean_increment for post {in,de}crement. */
34173 /* FALLTHRU */
34177 {
34178 /* Undo effects of boolean_increment. */
34180 {
34181 /* This is pre or post increment. */
34186 && !structured_block
34190 }
34191 }
34192 /* FALLTHRU */
34195 {
34230 {
34234 }
34237 {
34243 {
34248 }
34250 {
34262 {
34264 {
34269 }
34270 else
34272 }
34276 }
34279 {
34286 }
34290 }
34294 {
34297 {
34305 }
34307 {
34312 }
34347 }
34358 /* FALLTHROUGH */
34363 }
34370 }
34371 stmt_done:
34373 {
34384 }
34386 {
34389 }
34390 done:
34396 saw_error:
34399 {
34403 {
34407 }
34408 }
34409 }
34412 /* OpenMP 2.5:
34413 # pragma omp barrier new-line */
34415 static void
34417 {
34420 }
34422 /* OpenMP 2.5:
34423 # pragma omp critical [(name)] new-line
34424 structured-block
34426 OpenMP 4.5:
34427 # pragma omp critical [(name) [hint(expression)]] new-line
34428 structured-block */
34430 #define OMP_CRITICAL_CLAUSE_MASK \
34431 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34433 static tree
34435 {
34439 {
34440 matching_parens parens;
34454 OMP_CRITICAL_CLAUSE_MASK,
34456 }
34457 else
34462 }
34464 /* OpenMP 2.5:
34465 # pragma omp flush flush-vars[opt] new-line
34467 flush-vars:
34468 ( variable-list ) */
34470 static void
34472 {
34478 }
34480 /* Helper function, to parse omp for increment expression. */
34482 static tree
34484 {
34489 {
34492 }
34495 {
34502 /* Fall through: OpenMP disallows NE_EXPR. */
34506 }
34508 /* If decl is an iterator, preserve LHS and RHS of the relational
34509 expr until finish_omp_for. */
34520 }
34522 /* Helper function, to parse omp for increment expression. */
34524 static tree
34526 {
34530 cp_id_kind idk;
34534 {
34543 }
34552 {
34557 }
34564 {
34568 }
34581 do
34582 {
34589 {
34591 {
34594 else
34596 tf_warning_or_error);
34597 }
34598 else
34601 }
34602 }
34606 {
34612 }
34613 else
34617 }
34619 /* Parse the initialization statement of an OpenMP for loop.
34621 Return true if the resulting construct should have an
34622 OMP_CLAUSE_PRIVATE added to it. */
34624 static tree
34632 {
34638 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34640 init-expr:
34641 var = lb
34642 integer-type var = lb
34643 random-access-iterator-type var = lb
34644 pointer-type var = lb
34645 */
34646 cp_decl_specifier_seq type_specifiers;
34648 /* First, try to parse as an initialized declaration. See
34649 cp_parser_condition, from whence the bulk of this is copied. */
34656 {
34657 /* If parsing a type specifier seq succeeded, then this
34658 MUST be a initialized declaration. */
34663 CP_PARSER_DECLARATOR_NAMED,
34674 else
34675 {
34685 {
34687 CPP_OPEN_PAREN))
34690 else
34691 /* Trigger an error. */
34696 }
34700 {
34708 {
34711 auto_node);
34716 }
34719 asm_specification,
34720 LOOKUP_ONLYCONVERTING);
34723 {
34726 }
34727 else
34728 {
34731 {
34733 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34735 {
34739 {
34743 }
34745 }
34747 {
34752 }
34753 }
34754 }
34756 }
34757 else
34758 {
34759 /* Consume '='. */
34763 non_class:
34766 else
34769 asm_specification,
34770 LOOKUP_ONLYCONVERTING);
34771 }
34775 }
34776 }
34777 else
34778 {
34779 cp_id_kind idk;
34780 /* If parsing a type specifier sequence failed, then
34781 this MUST be a simple expression. */
34787 && decl
34790 {
34801 {
34806 }
34811 }
34813 && decl
34816 {
34817 tree rhs;
34825 rhs,
34826 tf_warning_or_error));
34829 }
34830 else
34831 {
34836 {
34840 }
34841 }
34842 }
34844 }
34846 /* Parse the restricted form of the for statement allowed by OpenMP. */
34848 static tree
34851 {
34855 location_t loc_first;
34866 {
34869 }
34872 {
34875 }
34878 {
34884 }
34886 {
34889 {
34891 "%<linear%> clause may not be specified together "
34894 }
34895 else
34897 }
34910 {
34913 location_t loc;
34916 {
34920 }
34923 matching_parens parens;
34930 add_private_clause
34936 {
34939 {
34945 }
34946 else
34948 }
34955 {
34960 {
34964 }
34967 {
34968 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34972 {
34975 }
34976 else
34977 {
34980 }
34982 }
34983 else
34984 {
34989 }
34990 }
34993 {
34994 tree c;
34996 {
35005 decl);
35009 decl);
35010 }
35012 {
35017 else
35022 {
35025 /* For linear, signal that we need to fill up
35026 the so far unknown linear step. */
35029 }
35030 }
35031 }
35040 {
35041 /* If decl is an iterator, preserve the operator on decl
35042 until finish_omp_for. */
35044 && ((processing_template_decl
35049 else
35053 }
35065 {
35068 }
35073 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35074 in between the collapsed for loops to be still considered perfectly
35075 nested. Hopefully the final version clarifies this.
35076 For now handle (multiple) {'s and empty statements. */
35079 {
35083 {
35085 bracecount++;
35086 }
35090 else
35091 {
35098 }
35099 }
35102 {
35105 }
35106 }
35111 /* Note that we saved the original contents of this flag when we entered
35112 the structured block, and so we don't need to re-save it here. */
35115 /* Note that the grammar doesn't call for a structured block here,
35116 though the loop as a whole is a structured block. */
35123 else
35128 {
35130 {
35132 nbraces--;
35133 }
35136 else
35137 {
35139 {
35142 }
35147 }
35148 }
35151 {
35155 else
35157 }
35161 }
35163 /* Helper function for OpenMP parsing, split clauses and call
35164 finish_omp_clauses on each of the set of clauses afterwards. */
35166 static void
35169 {
35175 }
35177 /* OpenMP 4.0:
35178 #pragma omp simd simd-clause[optseq] new-line
35179 for-loop */
35181 #define OMP_SIMD_CLAUSE_MASK \
35182 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35191 static tree
35195 {
35206 {
35210 OMP_CLAUSE_ORDERED);
35212 {
35214 "%<ordered%> clause with parameter may not be specified "
35217 }
35218 }
35229 }
35231 /* OpenMP 2.5:
35232 #pragma omp for for-clause[optseq] new-line
35233 for-loop
35235 OpenMP 4.0:
35236 #pragma omp for simd for-simd-clause[optseq] new-line
35237 for-loop */
35239 #define OMP_FOR_CLAUSE_MASK \
35240 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35250 static tree
35254 {
35261 /* parallel for{, simd} disallows nowait clause, but for
35262 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35265 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35270 {
35275 {
35299 }
35300 }
35302 {
35305 }
35307 /* Composite distribute parallel for disallows linear clause. */
35314 {
35317 }
35328 }
35330 /* OpenMP 2.5:
35331 # pragma omp master new-line
35332 structured-block */
35334 static tree
35336 {
35340 }
35342 /* OpenMP 2.5:
35343 # pragma omp ordered new-line
35344 structured-block
35346 OpenMP 4.5:
35347 # pragma omp ordered ordered-clauses new-line
35348 structured-block */
35350 #define OMP_ORDERED_CLAUSE_MASK \
35351 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35354 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35355 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35357 static bool
35360 {
35364 {
35369 {
35371 {
35374 }
35376 {
35378 "%<depend%> clause may only be used in compound "
35382 }
35383 tree clauses
35385 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35389 }
35390 }
35392 tree clauses
35403 }
35405 /* OpenMP 2.5:
35407 section-scope:
35408 { section-sequence }
35410 section-sequence:
35411 section-directive[opt] structured-block
35412 section-sequence section-directive structured-block */
35414 static tree
35416 {
35421 matching_braces braces;
35429 {
35433 }
35436 {
35444 {
35448 }
35450 {
35453 }
35458 }
35469 }
35471 /* OpenMP 2.5:
35472 # pragma omp sections sections-clause[optseq] newline
35473 sections-scope */
35475 #define OMP_SECTIONS_CLAUSE_MASK \
35476 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35482 static tree
35485 {
35497 {
35500 }
35507 }
35509 /* OpenMP 2.5:
35510 # pragma omp parallel parallel-clause[optseq] new-line
35511 structured-block
35512 # pragma omp parallel for parallel-for-clause[optseq] new-line
35513 structured-block
35514 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35515 structured-block
35517 OpenMP 4.0:
35518 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35519 structured-block */
35521 #define OMP_PARALLEL_CLAUSE_MASK \
35522 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35532 static tree
35536 {
35543 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35549 {
35557 if_p);
35561 if_p);
35564 block);
35569 }
35570 /* When combined with distribute, parallel has to be followed by for.
35571 #pragma omp target parallel is allowed though. */
35575 {
35579 }
35581 {
35584 }
35586 {
35590 {
35600 block);
35603 }
35604 }
35609 {
35612 }
35620 }
35622 /* OpenMP 2.5:
35623 # pragma omp single single-clause[optseq] new-line
35624 structured-block */
35626 #define OMP_SINGLE_CLAUSE_MASK \
35627 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35632 static tree
35634 {
35644 }
35646 /* OpenMP 3.0:
35647 # pragma omp task task-clause[optseq] new-line
35648 structured-block */
35650 #define OMP_TASK_CLAUSE_MASK \
35651 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35662 static tree
35664 {
35675 }
35677 /* OpenMP 3.0:
35678 # pragma omp taskwait new-line */
35680 static void
35682 {
35685 }
35687 /* OpenMP 3.1:
35688 # pragma omp taskyield new-line */
35690 static void
35692 {
35695 }
35697 /* OpenMP 4.0:
35698 # pragma omp taskgroup new-line
35699 structured-block */
35701 static tree
35703 {
35707 if_p));
35708 }
35711 /* OpenMP 2.5:
35712 # pragma omp threadprivate (variable-list) */
35714 static void
35716 {
35717 tree vars;
35723 }
35725 /* OpenMP 4.0:
35726 # pragma omp cancel cancel-clause[optseq] new-line */
35728 #define OMP_CANCEL_CLAUSE_MASK \
35729 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35735 static void
35737 {
35741 }
35743 /* OpenMP 4.0:
35744 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35746 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35747 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35752 static void
35755 {
35756 tree clauses;
35760 {
35765 {
35768 }
35769 }
35771 {
35775 }
35778 {
35783 else
35787 }
35790 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35792 pragma_tok);
35794 }
35796 /* OpenMP 4.0:
35797 #pragma omp distribute distribute-clause[optseq] new-line
35798 for-loop */
35800 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35801 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35807 static tree
35811 {
35820 {
35828 else
35831 {
35837 {
35841 else
35844 }
35850 else
35864 }
35865 }
35867 {
35870 }
35875 {
35878 }
35889 }
35891 /* OpenMP 4.0:
35892 # pragma omp teams teams-clause[optseq] new-line
35893 structured-block */
35895 #define OMP_TEAMS_CLAUSE_MASK \
35896 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35904 static tree
35908 {
35917 {
35921 {
35946 }
35947 }
35949 {
35952 }
35957 {
35960 }
35969 }
35971 /* OpenMP 4.0:
35972 # pragma omp target data target-data-clause[optseq] new-line
35973 structured-block */
35975 #define OMP_TARGET_DATA_CLAUSE_MASK \
35976 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35981 static tree
35983 {
35984 tree clauses
35989 {
35992 {
36009 "%<#pragma omp target data%> with map-type other "
36010 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36014 }
36016 }
36019 {
36022 "%<#pragma omp target data%> must contain at least "
36025 }
36036 }
36038 /* OpenMP 4.5:
36039 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36040 structured-block */
36042 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36043 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36049 static tree
36052 {
36055 {
36060 {
36063 }
36064 }
36066 {
36070 }
36073 {
36079 }
36081 tree clauses
36086 {
36089 {
36102 "%<#pragma omp target enter data%> with map-type other "
36106 }
36108 }
36111 {
36114 "%<#pragma omp target enter data%> must contain at least "
36117 }
36124 }
36126 /* OpenMP 4.5:
36127 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36128 structured-block */
36130 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36131 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36137 static tree
36140 {
36143 {
36148 {
36151 }
36152 }
36154 {
36158 }
36161 {
36167 }
36169 tree clauses
36174 {
36177 {
36191 "%<#pragma omp target exit data%> with map-type other "
36192 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36196 }
36198 }
36201 {
36204 "%<#pragma omp target exit data%> must contain at least "
36207 }
36214 }
36216 /* OpenMP 4.0:
36217 # pragma omp target update target-update-clause[optseq] new-line */
36219 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36220 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36227 static bool
36230 {
36232 {
36238 }
36240 tree clauses
36245 {
36247 "%<#pragma omp target update%> must contain at least one "
36250 }
36258 }
36260 /* OpenMP 4.0:
36261 # pragma omp target target-clause[optseq] new-line
36262 structured-block */
36264 #define OMP_TARGET_CLAUSE_MASK \
36265 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36275 static bool
36278 {
36282 {
36294 {
36302 {
36303 tree stmt;
36305 {
36308 OMP_TARGET_CLAUSE_MASK,
36313 OMP_TARGET_CLAUSE_MASK,
36318 OMP_TARGET_CLAUSE_MASK,
36323 }
36325 }
36330 {
36334 if_p);
36339 if_p);
36344 if_p);
36348 }
36354 {
36355 /* For combined target teams, ensure the num_teams and
36356 thread_limit clause expressions are evaluated on the host,
36357 before entering the target construct. */
36358 tree c;
36364 {
36373 OMP_CLAUSE_FIRSTPRIVATE);
36378 }
36379 }
36389 }
36391 {
36394 }
36396 {
36400 }
36402 {
36406 }
36408 {
36412 }
36414 {
36417 }
36418 }
36420 {
36423 }
36438 check_clauses:
36440 {
36443 {
36457 "%<#pragma omp target%> with map-type other "
36458 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36462 }
36464 }
36466 }
36468 /* OpenACC 2.0:
36469 # pragma acc cache (variable-list) new-line
36470 */
36472 static tree
36474 {
36489 }
36491 /* OpenACC 2.0:
36492 # pragma acc data oacc-data-clause[optseq] new-line
36493 structured-block */
36495 #define OACC_DATA_CLAUSE_MASK \
36496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36508 static tree
36510 {
36523 }
36525 /* OpenACC 2.0:
36526 # pragma acc host_data <clauses> new-line
36527 structured-block */
36529 #define OACC_HOST_DATA_CLAUSE_MASK \
36530 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36532 static tree
36534 {
36547 }
36549 /* OpenACC 2.0:
36550 # pragma acc declare oacc-data-clause[optseq] new-line
36551 */
36553 #define OACC_DECLARE_CLAUSE_MASK \
36554 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36567 static tree
36569 {
36578 {
36582 }
36585 {
36589 {
36593 }
36596 {
36608 {
36610 "%qD must be a global variable in "
36612 decl);
36615 }
36620 {
36624 }
36626 {
36628 "invalid use of %<extern%> variable %qD "
36632 }
36634 {
36636 "invalid use of %<global%> variable %qD "
36640 }
36642 }
36647 {
36652 }
36655 {
36656 tree id;
36660 else
36666 {
36669 {
36672 {
36676 }
36677 }
36678 }
36679 }
36680 }
36693 }
36695 /* OpenACC 2.0:
36696 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36698 or
36700 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36702 LOC is the location of the #pragma token.
36703 */
36705 #define OACC_ENTER_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_COPYIN) \
36709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36714 #define OACC_EXIT_DATA_CLAUSE_MASK \
36715 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36721 static tree
36724 {
36733 {
36738 }
36745 else
36750 {
36754 }
36762 }
36764 /* OpenACC 2.0:
36765 # pragma acc loop oacc-loop-clause[optseq] new-line
36766 structured-block */
36768 #define OACC_LOOP_CLAUSE_MASK \
36769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36780 static tree
36783 {
36792 {
36798 }
36807 }
36809 /* OpenACC 2.0:
36810 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36811 structured-block
36813 or
36815 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36816 structured-block
36817 */
36819 #define OACC_KERNELS_CLAUSE_MASK \
36820 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36838 #define OACC_PARALLEL_CLAUSE_MASK \
36839 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36860 static tree
36863 {
36864 omp_clause_mask mask;
36867 {
36880 }
36883 {
36887 {
36890 tree clauses;
36892 if_p);
36894 }
36895 }
36904 }
36906 /* OpenACC 2.0:
36907 # pragma acc update oacc-update-clause[optseq] new-line
36908 */
36910 #define OACC_UPDATE_CLAUSE_MASK \
36911 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36918 static tree
36920 {
36927 {
36929 "%<#pragma acc update%> must contain at least one "
36932 }
36940 }
36942 /* OpenACC 2.0:
36943 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36945 LOC is the location of the #pragma token.
36946 */
36948 #define OACC_WAIT_CLAUSE_MASK \
36949 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36951 static tree
36953 {
36967 }
36969 /* OpenMP 4.0:
36970 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36972 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36973 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36980 static void
36983 {
36985 cp_omp_declare_simd_data data;
36987 {
36992 /* It is safe to take the address of a local variable; it will only be
36993 used while this scope is live. */
36995 }
36997 /* Store away all pragma tokens. */
37009 {
37013 {
37026 }
37031 "%<#pragma omp declare simd%> not immediately followed by "
37035 }
37036 }
37038 /* Finalize #pragma omp declare simd clauses after direct declarator has
37039 been parsed, and put that into "omp declare simd" attribute. */
37041 static tree
37043 {
37049 {
37053 }
37058 {
37076 }
37080 }
37083 /* OpenMP 4.0:
37084 # pragma omp declare target new-line
37085 declarations and definitions
37086 # pragma omp end declare target new-line
37088 OpenMP 4.5:
37089 # pragma omp declare target ( extended-list ) new-line
37091 # pragma omp declare target declare-target-clauses[seq] new-line */
37093 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37094 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37097 static void
37099 {
37102 clauses
37106 {
37108 clauses);
37111 }
37112 else
37113 {
37117 }
37120 "%<#pragma omp declare target%> with clauses in between "
37121 "%<#pragma omp declare target%> without clauses and "
37124 {
37130 {
37133 }
37134 else
37137 {
37139 "%qD specified both in declare target %<link%> and %<to%>"
37142 }
37144 {
37151 {
37154 {
37158 }
37159 }
37160 }
37161 }
37162 }
37164 static void
37166 {
37169 {
37172 }
37174 {
37178 {
37181 }
37184 else
37185 {
37189 }
37190 }
37191 else
37192 {
37196 }
37200 "%<#pragma omp end declare target%> without corresponding "
37202 else
37204 }
37206 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37207 expression and optional initializer clause of
37208 #pragma omp declare reduction. We store the expression(s) as
37209 either 3, 6 or 7 special statements inside of the artificial function's
37210 body. The first two statements are DECL_EXPRs for the artificial
37211 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37212 expression that uses those variables.
37213 If there was any INITIALIZER clause, this is followed by further statements,
37214 the fourth and fifth statements are DECL_EXPRs for the artificial
37215 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37216 constructor variant (first token after open paren is not omp_priv),
37217 then the sixth statement is a statement with the function call expression
37218 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37219 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37220 to initialize the OMP_PRIV artificial variable and there is seventh
37221 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37223 static bool
37225 {
37237 tree combiner;
37252 {
37255 }
37258 {
37260 matching_parens parens;
37266 {
37269 }
37285 {
37289 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37293 == CPP_CLOSE_PAREN
37296 {
37300 }
37305 }
37306 else
37307 {
37323 {
37328 }
37330 tree arg;
37343 }
37354 }
37358 UNKNOWN_LOCATION);
37361 }
37363 /* OpenMP 4.0
37364 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37365 initializer-clause[opt] new-line
37367 initializer-clause:
37368 initializer (omp_priv initializer)
37369 initializer (function-name (argument-list)) */
37371 static void
37374 {
37384 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37391 {
37423 }
37435 /* Types may not be defined in declare reduction type list. */
37438 parser->type_definition_forbidden_message
37444 saved_colon_doesnt_start_class_def_p
37449 {
37453 ;
37472 else
37477 else
37479 }
37481 /* Restore the saved message. */
37484 parser->colon_doesnt_start_class_def_p
37489 {
37490 fail:
37493 }
37499 {
37500 tree fntype
37503 NULL_TREE);
37523 {
37528 }
37530 {
37532 {
37541 }
37548 }
37549 else
37550 {
37553 }
37556 else
37559 {
37562 }
37564 {
37567 else
37572 }
37577 else
37578 {
37587 }
37594 }
37598 done:
37599 /* Free any declarators allocated. */
37601 }
37603 /* OpenMP 4.0
37604 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37605 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37606 initializer-clause[opt] new-line
37607 #pragma omp declare target new-line */
37609 static bool
37612 {
37614 {
37619 {
37622 context);
37624 }
37627 {
37630 context);
37632 }
37634 {
37637 }
37639 {
37643 }
37644 }
37649 }
37651 /* OpenMP 4.5:
37652 #pragma omp taskloop taskloop-clause[optseq] new-line
37653 for-loop
37655 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37656 for-loop */
37658 #define OMP_TASKLOOP_CLAUSE_MASK \
37659 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37674 static tree
37678 {
37687 {
37692 {
37716 }
37717 }
37719 {
37722 }
37727 {
37730 }
37736 if_p);
37742 }
37745 /* OpenACC 2.0:
37746 # pragma acc routine oacc-routine-clause[optseq] new-line
37747 function-definition
37749 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37750 */
37752 #define OACC_ROUTINE_CLAUSE_MASK \
37753 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37759 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37760 component, which must resolve to a declared namespace-scope
37761 function. The clauses are either processed directly (for a named
37762 function), or defered until the immediatley following declaration
37763 is parsed. */
37765 static void
37768 {
37770 /* The checking for "another pragma following this one" in the "no optional
37771 '( name )'" case makes sure that we dont re-enter. */
37774 cp_oacc_routine_data data;
37780 /* It is safe to take the address of a local variable; it will only be
37781 used while this scope is live. */
37784 /* Look for optional '( name )'. */
37786 {
37787 matching_parens parens;
37790 /* We parse the name as an id-expression. If it resolves to
37791 anything other than a non-overloaded function at namespace
37792 scope, it's an error. */
37806 {
37810 }
37812 data.clauses
37820 {
37825 }
37827 /* Perhaps we should use the same rule as declarations in different
37828 namespaces? */
37830 {
37835 }
37838 {
37842 }
37846 }
37848 {
37849 /* Store away all pragma tokens. */
37860 /* Emit a helpful diagnostic if there's another pragma following this
37861 one. */
37863 {
37866 /* ..., and then just keep going. */
37868 }
37870 /* We only have to consider the pragma_external case here. */
37875 else
37878 }
37879 }
37881 /* Finalize #pragma acc routine clauses after direct declarator has
37882 been parsed. */
37884 static tree
37886 {
37891 {
37893 "%<#pragma acc routine%> not immediately followed by "
37896 }
37913 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37914 fndecl_seen. */
37917 }
37919 /* Apply any saved OpenACC routine clauses to a just-parsed
37920 declaration. */
37922 static void
37924 {
37926 {
37927 /* Keep going if we're in error reporting mode. */
37933 {
37935 "%<#pragma acc routine%> not immediately followed by"
37939 }
37941 {
37944 }
37947 {
37952 }
37955 {
37963 }
37965 /* Process the routine's dimension clauses. */
37969 /* Add an "omp declare target" attribute. */
37974 /* Don't unset parser->oacc_routine here: we may still need it to
37975 diagnose wrong usage. But, remember that we've used this "#pragma acc
37976 routine". */
37978 }
37979 }
37981 /* Main entry point to OpenMP statement pragmas. */
37983 static void
37985 {
37986 tree stmt;
37991 {
38014 if_p);
38019 if_p);
38036 if_p);
38041 if_p);
38049 if_p);
38058 if_p);
38072 if_p);
38077 if_p);
38081 }
38084 }
38085 \f
38086 /* Transactional Memory parsing routines. */
38088 /* Parse a transaction attribute.
38090 txn-attribute:
38091 attribute
38092 [ [ identifier ] ]
38094 We use this instead of cp_parser_attributes_opt for transactions to avoid
38095 the pedwarn in C++98 mode. */
38097 static tree
38099 {
38114 {
38118 /* For keywords, use the canonical spelling,
38119 not the parsed identifier. */
38123 }
38124 else
38128 error1:
38131 }
38133 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38135 transaction-statement:
38136 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38137 compound-statement
38138 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38139 */
38141 static tree
38143 {
38154 else
38155 {
38159 }
38161 /* Parse a noexcept specification. */
38165 {
38166 /* cancel-and-throw is unimplemented. */
38169 }
38170 else
38173 /* Keep track if we're in the lexical scope of an outer transaction. */
38185 }
38187 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38189 transaction-expression:
38190 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38191 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38192 */
38194 static tree
38196 {
38209 keyword == RID_TRANSACTION_RELAXED
38223 /* Set this early. This might mean that we allow transaction_cancel in
38224 an expression that we find out later actually has to be a constexpr.
38225 However, we expect that cxx_constant_value will be able to deal with
38226 this; also, if the noexcept has no constexpr, then what we parse next
38227 really is a transaction's body. */
38230 /* Parse a noexcept specification. */
38236 {
38237 matching_parens parens;
38244 }
38245 else
38246 {
38247 /* The only expression that is available got parsed for the noexcept
38248 already. noexcept is true then. */
38251 }
38260 }
38262 /* Parse a function-transaction-block.
38264 function-transaction-block:
38265 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38266 function-body
38267 __transaction_atomic txn-attribute[opt] function-try-block
38268 __transaction_relaxed ctor-initializer[opt] function-body
38269 __transaction_relaxed function-try-block
38270 */
38272 static void
38274 {
38289 else
38290 {
38294 }
38302 else
38303 cp_parser_ctor_initializer_opt_and_function_body
38309 }
38311 /* Parse a __transaction_cancel statement.
38313 cancel-statement:
38314 __transaction_cancel txn-attribute[opt] ;
38315 __transaction_cancel txn-attribute[opt] throw-expression ;
38317 ??? Cancel and throw is not yet implemented. */
38319 static tree
38321 {
38327 RT_TRANSACTION_CANCEL);
38334 /* ??? Parse cancel-and-throw here. */
38339 {
38343 }
38345 {
38349 }
38351 {
38354 {
38360 }
38361 }
38363 {
38367 }
38373 }
38374 \f
38375 /* The parser. */
38379 \f
38380 /* Special handling for the first token or line in the file. The first
38381 thing in the file might be #pragma GCC pch_preprocess, which loads a
38382 PCH file, which is a GC collection point. So we need to handle this
38383 first pragma without benefit of an existing lexer structure.
38385 Always returns one token to the caller in *FIRST_TOKEN. This is
38386 either the true first token of the file, or the first token after
38387 the initial pragma. */
38389 static void
38391 {
38400 {
38407 }
38408 else
38411 /* Skip to the end of the pragma. */
38415 /* Now actually load the PCH file. */
38419 /* Read one more token to return to our caller. We have to do this
38420 after reading the PCH file in, since its pointers have to be
38421 live. */
38423 }
38425 /* Parse a pragma GCC ivdep. */
38427 static bool
38429 {
38432 }
38434 /* Parse a pragma GCC unroll. */
38436 static unsigned short
38438 {
38448 {
38450 " assignment-expression that evaluates to a non-negative"
38453 }
38454 else
38455 {
38459 }
38462 }
38464 /* Normal parsing of a pragma token. Here we can (and must) use the
38465 regular lexer. */
38467 static bool
38469 {
38472 tree stmt;
38483 {
38491 {
38501 }
38506 {
38516 }
38521 {
38532 }
38537 {
38548 }
38553 {
38564 }
38584 {
38589 }
38597 {
38602 }
38610 {
38614 }
38620 {
38625 }
38633 {
38638 }
38693 "%<#pragma omp section%> may only be used in "
38698 {
38700 {
38704 }
38710 {
38714 }
38715 else
38721 {
38724 }
38727 }
38730 {
38732 {
38736 }
38737 const unsigned short unroll
38743 {
38747 }
38748 else
38754 {
38757 }
38760 }
38767 bad_stmt:
38770 }
38774 }
38776 /* The interface the pragma parsers have to the lexer. */
38778 enum cpp_ttype
38780 {
38792 else
38793 {
38797 }
38800 }
38802 \f
38803 /* External interface. */
38805 /* Parse one entire translation unit. */
38807 void
38809 {
38822 }
38824 /* Create an identifier for a generic parameter type (a synthesized
38825 template parameter implied by `auto' or a concept identifier). */
38828 static tree
38830 {
38834 }
38836 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38837 (creating a new template parameter list if necessary). Returns the newly
38838 created template type parm. */
38840 static tree
38842 {
38845 /* Before committing to modifying any scope, if we're in an
38846 implicit template scope, and we're trying to synthesize a
38847 constrained parameter, try to find a previous parameter with
38848 the same name. This is the same-type rule for abbreviated
38849 function templates.
38851 NOTE: We can generate implicit parameters when tentatively
38852 parsing a nested name specifier, only to reject that parse
38853 later. However, matching the same template-id as part of a
38854 direct-declarator should generate an identical template
38855 parameter, so this rule will merge them. */
38857 {
38860 {
38862 {
38865 /* Return the TEMPLATE_PARM_INDEX. */
38868 }
38870 }
38871 }
38873 /* We are either continuing a function template that already contains implicit
38874 template parameters, creating a new fully-implicit function template, or
38875 extending an existing explicit function template with implicit template
38876 parameters. */
38884 {
38888 }
38889 else
38890 {
38891 /* Roll back to the existing template parameter scope (in the case of
38892 extending an explicit function template) or introduce a new template
38893 parameter scope ahead of the function parameter scope (or class scope
38894 in the case of out-of-line member definitions). The function scope is
38895 added back after template parameter synthesis below. */
38900 {
38903 }
38905 {
38906 /* If not defining a class, then any class scope is a scope level in
38907 an out-of-line member definition. In this case simply wind back
38908 beyond the first such scope to inject the template parameter list.
38909 Otherwise wind back to the class being defined. The latter can
38910 occur in class member friend declarations such as:
38912 class A {
38913 void foo (auto);
38914 };
38915 class B {
38916 friend void A::foo (auto);
38917 };
38919 The template parameter list synthesized for the friend declaration
38920 must be injected in the scope of 'B'. This can also occur in
38921 erroneous cases such as:
38923 struct A {
38924 struct B {
38925 void foo (auto);
38926 };
38927 void B::foo (auto) {}
38928 };
38930 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38931 but, nevertheless, the template parameter list synthesized for the
38932 declarator should be injected into the scope of 'A' as if the
38933 ill-formed template was specified explicitly. */
38936 {
38939 }
38940 }
38946 {
38947 /* Introduce a new template parameter list for implicit template
38948 parameters. */
38952 parser->implicit_template_scope
38959 }
38960 else
38961 {
38962 /* Synthesize implicit template parameters at the end of the explicit
38963 template parameter list. */
38970 parser->implicit_template_parms
38972 }
38973 }
38975 /* Synthesize a new template parameter and track the current template
38976 parameter chain with implicit_template_parms. */
38980 tree synth_tmpl_parm;
38984 synth_tmpl_parm
38987 synth_tmpl_parm
38989 else
38990 {
38994 }
38996 // Attach the constraint to the parm before processing.
38999 tree new_parm
39001 input_location,
39002 node,
39006 // Chain the new parameter to the list of implicit parameters.
39008 parser->implicit_template_parms
39010 else
39015 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39018 /* If creating a fully implicit function template, start the new implicit
39019 template parameter list with this synthesized type, otherwise grow the
39020 current template parameter list. */
39023 {
39030 }
39031 else
39032 {
39037 }
39039 // If the new parameter was constrained, we need to add that to the
39040 // constraints in the template parameter list.
39042 {
39046 }
39051 }
39053 /* Finish the declaration of a fully implicit function template. Such a
39054 template has no explicit template parameter list so has not been through the
39055 normal template head and tail processing. synthesize_implicit_template_parm
39056 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39057 provided if the declaration is a class member such that its template
39058 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39059 form is returned. Otherwise NULL_TREE is returned. */
39061 static tree
39063 {
39068 {
39072 }
39082 }
39084 /* Helper function for diagnostics that have complained about things
39085 being used with 'extern "C"' linkage.
39087 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39089 void
39091 {
39095 }