| blob | 4ab0b6974d624a791c69ad33671ee5f5a0791612 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static tree cp_literal_operator_id
255 static void cp_parser_cilk_simd
257 static tree cp_parser_cilk_for
259 static bool cp_parser_omp_declare_reduction_exprs
261 static tree cp_parser_cilk_simd_vectorlength
263 static void cp_finalize_oacc_routine
266 /* Manifest constants. */
267 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
268 #define CP_SAVED_TOKEN_STACK 5
270 /* Variables. */
272 /* The stream to which debugging output should be written. */
275 /* Nonzero if we are parsing an unevaluated operand: an operand to
276 sizeof, typeof, or alignof. */
279 /* Dump up to NUM tokens in BUFFER to FILE starting with token
280 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
281 first token in BUFFER. If NUM is 0, dump all the tokens. If
282 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
283 highlighted by surrounding it in [[ ]]. */
285 static void
289 {
306 {
309 }
314 {
321 nprinted++;
331 {
341 }
342 }
345 {
348 }
351 }
354 /* Dump all tokens in BUFFER to stderr. */
356 void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
366 }
368 DEBUG_FUNCTION void
370 {
373 else
375 }
378 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
379 description for T. */
381 static void
383 {
385 {
388 }
389 }
392 /* Dump parser context C to FILE. */
394 static void
396 {
401 }
404 /* Print the stack of parsing contexts to FILE starting with FIRST. */
406 static void
408 {
414 {
417 }
418 }
421 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
423 static void
425 {
428 }
431 /* Print an unparsed function entry UF to FILE. */
433 static void
435 {
438 tree fn;
443 i++)
444 {
450 }
455 {
458 }
464 {
467 }
469 }
472 /* Print the stack of unparsed member functions S to FILE. */
474 static void
477 {
483 {
486 }
487 }
490 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
491 the given PARSER. If FILE is NULL, the output is printed on stderr. */
493 static void
495 {
507 next_token);
508 }
511 /* Dump debugging information for the given PARSER. If FILE is NULL,
512 the output is printed on stderr. */
514 void
516 {
519 expanded_location eloc;
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
714 be used. The point of this flag is to help the compiler to fold away calls
715 to cp_lexer_debugging_p within this source file at compile time, when the
716 lexer is not being debugged. */
718 #define LEXER_DEBUGGING_ENABLED_P false
720 /* Returns nonzero if debugging information should be output. */
724 {
729 }
734 {
738 }
742 {
744 }
748 {
750 }
754 {
757 else
759 }
763 {
766 /* Skip past purged tokens. */
768 {
770 tp--;
771 }
774 }
776 /* nonzero if we are presently saving tokens. */
780 {
782 }
784 /* Store the next token from the preprocessor in *TOKEN. Return true
785 if we reach EOF. If LEXER is NULL, assume we are handling an
786 initial #pragma pch_preprocess, and thus want the lexer to return
787 processed strings. */
789 static void
791 {
794 /* Get a new token from the preprocessor. */
795 token->type
802 /* On some systems, some header files are surrounded by an
803 implicit extern "C" block. Set a flag in the token if it
804 comes from such a header. */
809 /* Check to see if this token is a keyword. */
811 {
813 {
814 /* Mark this token as a keyword. */
816 /* Record which keyword. */
818 }
819 else
820 {
824 {
825 /* Warn about the C++0x keyword (but still treat it as
826 an identifier). */
831 /* Clear out the C_RID_CODE so we don't warn about this
832 particular identifier-turned-keyword again. */
834 }
837 }
838 }
840 {
841 /* This only happens in Objective-C++; it must be a keyword. */
844 {
845 /* Replace 'class' with '@class', 'private' with '@private',
846 etc. This prevents confusion with the C++ keyword
847 'class', and makes the tokens consistent with other
848 Objective-C 'AT' keywords. For example '@class' is
849 reported as RID_AT_CLASS which is consistent with
850 '@synchronized', which is reported as
851 RID_AT_SYNCHRONIZED.
852 */
862 }
863 }
864 }
866 /* Update the globals input_location and the input file stack from TOKEN. */
869 {
871 {
873 }
874 }
876 /* Update the globals input_location and the input file stack from LEXER. */
879 {
882 }
884 /* Return a pointer to the next token in the token stream, but do not
885 consume it. */
889 {
891 {
895 }
897 }
899 /* Return true if the next token has the indicated TYPE. */
903 {
905 }
907 /* Return true if the next token does not have the indicated TYPE. */
911 {
913 }
915 /* Return true if the next token is the indicated KEYWORD. */
919 {
921 }
925 {
927 }
931 {
933 }
935 /* Return true if the next token is not the indicated KEYWORD. */
939 {
941 }
943 /* Return true if KEYWORD can start a decl-specifier. */
945 bool
947 {
949 {
950 /* auto specifier: storage-class-specifier in C++,
951 simple-type-specifier in C++0x. */
953 /* Storage classes. */
959 /* Elaborated type specifiers. */
965 /* Simple type specifiers. */
979 /* GNU extensions. */
982 /* C++0x extensions. */
994 }
995 }
997 /* Return true if the next token is a keyword for a decl-specifier. */
999 static bool
1001 {
1006 }
1008 /* Returns TRUE iff the token T begins a decltype type. */
1010 static bool
1012 {
1015 }
1017 /* Returns TRUE iff the next token begins a decltype type. */
1019 static bool
1021 {
1024 }
1026 /* Called when processing a token with tree_check_value; perform or defer the
1027 associated checks and return the value. */
1029 static tree
1031 {
1032 /* Perform any access checks that were deferred. */
1037 {
1043 }
1044 /* Return the stored value. */
1046 }
1048 /* Return a pointer to the Nth token in the token stream. If N is 1,
1049 then this is precisely equivalent to cp_lexer_peek_token (except
1050 that it is not inline). One would like to disallow that case, but
1051 there is one case (cp_parser_nth_token_starts_template_id) where
1052 the caller passes a variable for N and it might be 1. */
1056 {
1059 /* N is 1-based, not zero-based. */
1070 {
1073 {
1076 }
1080 }
1083 {
1086 }
1089 }
1091 /* Return the next token, and advance the lexer's next_token pointer
1092 to point to the next non-purged token. */
1096 {
1102 do
1103 {
1106 {
1109 }
1111 }
1116 /* Provide debugging output. */
1118 {
1122 }
1125 }
1127 /* Permanently remove the next token from the token stream, and
1128 advance the next_token pointer to refer to the next non-purged
1129 token. */
1131 static void
1133 {
1142 do
1143 {
1144 tok++;
1146 {
1149 }
1150 }
1153 }
1155 /* Permanently remove all tokens after TOK, up to, but not
1156 including, the token that will be returned next by
1157 cp_lexer_peek_token. */
1159 static void
1161 {
1170 {
1175 }
1176 }
1178 /* Begin saving tokens. All tokens consumed after this point will be
1179 preserved. */
1181 static void
1183 {
1184 /* Provide debugging output. */
1189 }
1191 /* Commit to the portion of the token stream most recently saved. */
1193 static void
1195 {
1196 /* Provide debugging output. */
1201 }
1203 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1204 to the token stream. Stop saving tokens. */
1206 static void
1208 {
1209 /* Provide debugging output. */
1214 }
1216 /* RAII wrapper around the above functions, with sanity checking. Creating
1217 a variable saves tokens, which are committed when the variable is
1218 destroyed unless they are explicitly rolled back by calling the rollback
1219 member function. */
1221 struct saved_token_sentinel
1222 {
1227 {
1230 }
1232 {
1235 }
1237 {
1241 }
1242 };
1244 /* Print a representation of the TOKEN on the STREAM. */
1246 static void
1248 {
1249 /* We don't use cpp_type2name here because the parser defines
1250 a few tokens of its own. */
1252 /* cpplib-defined token types */
1253 #define OP(e, s) #e,
1254 #define TK(e, s) #e,
1255 TTYPE_TABLE
1256 #undef OP
1257 #undef TK
1258 /* C++ parser token types - see "Manifest constants", above. */
1262 };
1264 /* For some tokens, print the associated data. */
1266 {
1268 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1269 For example, `struct' is mapped to an INTEGER_CST. */
1272 /* fall through */
1290 /* If we have a name for the token, print it out. Otherwise, we
1291 simply give the numeric code. */
1294 else
1297 }
1298 }
1300 DEBUG_FUNCTION void
1302 {
1305 }
1307 DEBUG_FUNCTION void
1309 {
1312 else
1314 }
1317 /* Start emitting debugging information. */
1319 static void
1321 {
1328 }
1330 /* Stop emitting debugging information. */
1332 static void
1334 {
1341 }
1343 /* Create a new cp_token_cache, representing a range of tokens. */
1347 {
1352 }
1354 /* Diagnose if #pragma omp declare simd isn't followed immediately
1355 by function declaration or definition. */
1359 {
1361 {
1365 }
1366 }
1368 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1369 and put that into "omp declare simd" attribute. */
1373 {
1375 {
1377 {
1380 }
1382 {
1385 }
1386 }
1387 }
1389 /* Diagnose if #pragma acc routine isn't followed immediately by function
1390 declaration or definition. */
1394 {
1396 {
1398 "%<#pragma acc routine%> not immediately followed by "
1401 }
1402 }
1403 \f
1404 /* Decl-specifiers. */
1406 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1408 static void
1410 {
1412 }
1414 /* Declarators. */
1416 /* Nothing other than the parser should be creating declarators;
1417 declarators are a semi-syntactic representation of C++ entities.
1418 Other parts of the front end that need to create entities (like
1419 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1422 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1432 /* An erroneous declarator. */
1435 /* The obstack on which declarators and related data structures are
1436 allocated. */
1439 /* Alloc BYTES from the declarator memory pool. */
1443 {
1445 }
1447 /* Allocate a declarator of the indicated KIND. Clear fields that are
1448 common to all declarators. */
1452 {
1464 }
1466 /* Make a declarator for a generalized identifier. If
1467 QUALIFYING_SCOPE is non-NULL, the identifier is
1468 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1469 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1470 is, if any. */
1474 special_function_kind sfk)
1475 {
1478 /* It is valid to write:
1480 class C { void f(); };
1481 typedef C D;
1482 void D::f();
1484 The standard is not clear about whether `typedef const C D' is
1485 legal; as of 2002-09-15 the committee is considering that
1486 question. EDG 3.0 allows that syntax. Therefore, we do as
1487 well. */
1501 }
1503 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1504 of modifiers such as const or volatile to apply to the pointer
1505 type, represented as identifiers. ATTRIBUTES represent the attributes that
1506 appertain to the pointer or reference. */
1508 cp_declarator *
1510 tree attributes)
1511 {
1519 {
1523 }
1524 else
1530 }
1532 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1533 represent the attributes that appertain to the pointer or
1534 reference. */
1536 cp_declarator *
1539 {
1547 {
1551 }
1552 else
1558 }
1560 /* Like make_pointer_declarator -- but for a pointer to a non-static
1561 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1562 appertain to the pointer or reference. */
1564 cp_declarator *
1567 tree attributes)
1568 {
1577 {
1580 }
1581 else
1587 }
1589 /* Make a declarator for the function given by TARGET, with the
1590 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1591 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1592 indicates what exceptions can be thrown. */
1594 cp_declarator *
1596 tree parms,
1597 cp_cv_quals cv_qualifiers,
1598 cp_virt_specifiers virt_specifiers,
1599 cp_ref_qualifier ref_qualifier,
1600 tree tx_qualifier,
1601 tree exception_specification,
1602 tree late_return_type,
1603 tree requires_clause)
1604 {
1618 {
1622 }
1623 else
1627 }
1629 /* Make a declarator for an array of BOUNDS elements, each of which is
1630 defined by ELEMENT. */
1632 cp_declarator *
1634 {
1641 {
1645 }
1646 else
1650 }
1652 /* Determine whether the declarator we've seen so far can be a
1653 parameter pack, when followed by an ellipsis. */
1654 static bool
1656 {
1658 /* We already saw an ellipsis. */
1661 /* Search for a declarator name, or any other declarator that goes
1662 after the point where the ellipsis could appear in a parameter
1663 pack. If we find any of these, then this declarator can not be
1664 made into a parameter pack. */
1667 {
1669 {
1682 }
1683 }
1686 }
1690 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1691 DECLARATOR and DEFAULT_ARGUMENT. */
1693 cp_parameter_declarator *
1696 tree default_argument,
1698 {
1706 else
1713 }
1715 /* Returns true iff DECLARATOR is a declaration for a function. */
1717 static bool
1719 {
1721 {
1730 }
1732 }
1734 /* The parser. */
1736 /* Overview
1737 --------
1739 A cp_parser parses the token stream as specified by the C++
1740 grammar. Its job is purely parsing, not semantic analysis. For
1741 example, the parser breaks the token stream into declarators,
1742 expressions, statements, and other similar syntactic constructs.
1743 It does not check that the types of the expressions on either side
1744 of an assignment-statement are compatible, or that a function is
1745 not declared with a parameter of type `void'.
1747 The parser invokes routines elsewhere in the compiler to perform
1748 semantic analysis and to build up the abstract syntax tree for the
1749 code processed.
1751 The parser (and the template instantiation code, which is, in a
1752 way, a close relative of parsing) are the only parts of the
1753 compiler that should be calling push_scope and pop_scope, or
1754 related functions. The parser (and template instantiation code)
1755 keeps track of what scope is presently active; everything else
1756 should simply honor that. (The code that generates static
1757 initializers may also need to set the scope, in order to check
1758 access control correctly when emitting the initializers.)
1760 Methodology
1761 -----------
1763 The parser is of the standard recursive-descent variety. Upcoming
1764 tokens in the token stream are examined in order to determine which
1765 production to use when parsing a non-terminal. Some C++ constructs
1766 require arbitrary look ahead to disambiguate. For example, it is
1767 impossible, in the general case, to tell whether a statement is an
1768 expression or declaration without scanning the entire statement.
1769 Therefore, the parser is capable of "parsing tentatively." When the
1770 parser is not sure what construct comes next, it enters this mode.
1771 Then, while we attempt to parse the construct, the parser queues up
1772 error messages, rather than issuing them immediately, and saves the
1773 tokens it consumes. If the construct is parsed successfully, the
1774 parser "commits", i.e., it issues any queued error messages and
1775 the tokens that were being preserved are permanently discarded.
1776 If, however, the construct is not parsed successfully, the parser
1777 rolls back its state completely so that it can resume parsing using
1778 a different alternative.
1780 Future Improvements
1781 -------------------
1783 The performance of the parser could probably be improved substantially.
1784 We could often eliminate the need to parse tentatively by looking ahead
1785 a little bit. In some places, this approach might not entirely eliminate
1786 the need to parse tentatively, but it might still speed up the average
1787 case. */
1789 /* Flags that are passed to some parsing functions. These values can
1790 be bitwise-ored together. */
1792 enum
1793 {
1794 /* No flags. */
1796 /* The construct is optional. If it is not present, then no error
1797 should be issued. */
1799 /* When parsing a type-specifier, treat user-defined type-names
1800 as non-type identifiers. */
1802 /* When parsing a type-specifier, do not try to parse a class-specifier
1803 or enum-specifier. */
1805 /* When parsing a decl-specifier-seq, only allow type-specifier or
1806 constexpr. */
1808 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1810 };
1812 /* This type is used for parameters and variables which hold
1813 combinations of the above flags. */
1816 /* The different kinds of declarators we want to parse. */
1818 enum cp_parser_declarator_kind
1819 {
1820 /* We want an abstract declarator. */
1821 CP_PARSER_DECLARATOR_ABSTRACT,
1822 /* We want a named declarator. */
1823 CP_PARSER_DECLARATOR_NAMED,
1824 /* We don't mind, but the name must be an unqualified-id. */
1825 CP_PARSER_DECLARATOR_EITHER
1826 };
1828 /* The precedence values used to parse binary expressions. The minimum value
1829 of PREC must be 1, because zero is reserved to quickly discriminate
1830 binary operators from other tokens. */
1832 enum cp_parser_prec
1833 {
1834 PREC_NOT_OPERATOR,
1835 PREC_LOGICAL_OR_EXPRESSION,
1836 PREC_LOGICAL_AND_EXPRESSION,
1837 PREC_INCLUSIVE_OR_EXPRESSION,
1838 PREC_EXCLUSIVE_OR_EXPRESSION,
1839 PREC_AND_EXPRESSION,
1840 PREC_EQUALITY_EXPRESSION,
1841 PREC_RELATIONAL_EXPRESSION,
1842 PREC_SHIFT_EXPRESSION,
1843 PREC_ADDITIVE_EXPRESSION,
1844 PREC_MULTIPLICATIVE_EXPRESSION,
1845 PREC_PM_EXPRESSION,
1846 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1847 };
1849 /* A mapping from a token type to a corresponding tree node type, with a
1850 precedence value. */
1852 struct cp_parser_binary_operations_map_node
1853 {
1854 /* The token type. */
1856 /* The corresponding tree code. */
1858 /* The precedence of this operator. */
1860 };
1862 struct cp_parser_expression_stack_entry
1863 {
1864 /* Left hand side of the binary operation we are currently
1865 parsing. */
1866 cp_expr lhs;
1867 /* Original tree code for left hand side, if it was a binary
1868 expression itself (used for -Wparentheses). */
1870 /* Tree code for the binary operation we are parsing. */
1872 /* Precedence of the binary operation we are parsing. */
1874 /* Location of the binary operation we are parsing. */
1875 location_t loc;
1876 };
1878 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1879 entries because precedence levels on the stack are monotonically
1880 increasing. */
1884 /* Prototypes. */
1886 /* Constructors and destructors. */
1891 /* Class variables. */
1895 /* The operator-precedence table used by cp_parser_binary_expression.
1896 Transformed into an associative array (binops_by_token) by
1897 cp_parser_new. */
1930 };
1932 /* The same as binops, but initialized by cp_parser_new so that
1933 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1934 for speed. */
1937 /* Constructors and destructors. */
1939 /* Construct a new context. The context below this one on the stack
1940 is given by NEXT. */
1944 {
1947 /* Allocate the storage. */
1949 {
1950 /* Pull the first entry from the free list. */
1954 }
1955 else
1958 /* No errors have occurred yet in this context. */
1960 /* If this is not the bottommost context, copy information that we
1961 need from the previous context. */
1963 {
1964 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1965 expression, then we are parsing one in this context, too. */
1967 /* Thread the stack. */
1969 }
1972 }
1974 /* Managing the unparsed function queues. */
1976 #define unparsed_funs_with_default_args \
1977 parser->unparsed_queues->last ().funs_with_default_args
1978 #define unparsed_funs_with_definitions \
1979 parser->unparsed_queues->last ().funs_with_definitions
1980 #define unparsed_nsdmis \
1981 parser->unparsed_queues->last ().nsdmis
1982 #define unparsed_classes \
1983 parser->unparsed_queues->last ().classes
1985 static void
1987 {
1990 }
1992 static void
1994 {
1997 }
1999 /* Prototypes. */
2001 /* Constructors and destructors. */
2006 /* Routines to parse various constructs.
2008 Those that return `tree' will return the error_mark_node (rather
2009 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2010 Sometimes, they will return an ordinary node if error-recovery was
2011 attempted, even though a parse error occurred. So, to check
2012 whether or not a parse error occurred, you should always use
2013 cp_parser_error_occurred. If the construct is optional (indicated
2014 either by an `_opt' in the name of the function that does the
2015 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2016 the construct is not present. */
2018 /* Lexical conventions [gram.lex] */
2020 static cp_expr cp_parser_identifier
2022 static cp_expr cp_parser_string_literal
2024 static cp_expr cp_parser_userdef_char_literal
2026 static tree cp_parser_userdef_string_literal
2028 static cp_expr cp_parser_userdef_numeric_literal
2031 /* Basic concepts [gram.basic] */
2033 static bool cp_parser_translation_unit
2036 /* Expressions [gram.expr] */
2038 static cp_expr cp_parser_primary_expression
2040 static cp_expr cp_parser_id_expression
2042 static cp_expr cp_parser_unqualified_id
2044 static tree cp_parser_nested_name_specifier_opt
2046 static tree cp_parser_nested_name_specifier
2048 static tree cp_parser_qualifying_entity
2050 static cp_expr cp_parser_postfix_expression
2052 static tree cp_parser_postfix_open_square_expression
2054 static tree cp_parser_postfix_dot_deref_expression
2058 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2060 static void cp_parser_pseudo_destructor_name
2062 static cp_expr cp_parser_unary_expression
2064 static enum tree_code cp_parser_unary_operator
2066 static tree cp_parser_new_expression
2070 static tree cp_parser_new_type_id
2078 static tree cp_parser_delete_expression
2080 static cp_expr cp_parser_cast_expression
2082 static cp_expr cp_parser_binary_expression
2084 static tree cp_parser_question_colon_clause
2086 static cp_expr cp_parser_assignment_expression
2088 static enum tree_code cp_parser_assignment_operator_opt
2090 static cp_expr cp_parser_expression
2092 static cp_expr cp_parser_constant_expression
2094 static cp_expr cp_parser_builtin_offsetof
2096 static cp_expr cp_parser_lambda_expression
2098 static void cp_parser_lambda_introducer
2100 static bool cp_parser_lambda_declarator_opt
2102 static void cp_parser_lambda_body
2105 /* Statements [gram.stmt.stmt] */
2107 static void cp_parser_statement
2109 static void cp_parser_label_for_labeled_statement
2111 static tree cp_parser_expression_statement
2113 static tree cp_parser_compound_statement
2115 static void cp_parser_statement_seq_opt
2117 static tree cp_parser_selection_statement
2119 static tree cp_parser_condition
2121 static tree cp_parser_iteration_statement
2123 static bool cp_parser_init_statement
2125 static tree cp_parser_for
2127 static tree cp_parser_c_for
2129 static tree cp_parser_range_for
2131 static void do_range_for_auto_deduction
2133 static tree cp_parser_perform_range_for_lookup
2135 static tree cp_parser_range_for_member_function
2137 static tree cp_parser_jump_statement
2139 static void cp_parser_declaration_statement
2142 static tree cp_parser_implicitly_scoped_statement
2144 static void cp_parser_already_scoped_statement
2147 /* Declarations [gram.dcl.dcl] */
2149 static void cp_parser_declaration_seq_opt
2151 static void cp_parser_declaration
2153 static void cp_parser_block_declaration
2155 static void cp_parser_simple_declaration
2157 static void cp_parser_decl_specifier_seq
2159 static tree cp_parser_storage_class_specifier_opt
2161 static tree cp_parser_function_specifier_opt
2163 static tree cp_parser_type_specifier
2166 static tree cp_parser_simple_type_specifier
2168 static tree cp_parser_type_name
2170 static tree cp_parser_type_name
2172 static tree cp_parser_nonclass_name
2174 static tree cp_parser_elaborated_type_specifier
2176 static tree cp_parser_enum_specifier
2178 static void cp_parser_enumerator_list
2180 static void cp_parser_enumerator_definition
2182 static tree cp_parser_namespace_name
2184 static void cp_parser_namespace_definition
2186 static void cp_parser_namespace_body
2188 static tree cp_parser_qualified_namespace_specifier
2190 static void cp_parser_namespace_alias_definition
2192 static bool cp_parser_using_declaration
2194 static void cp_parser_using_directive
2196 static tree cp_parser_alias_declaration
2198 static void cp_parser_asm_definition
2200 static void cp_parser_linkage_specification
2202 static void cp_parser_static_assert
2204 static tree cp_parser_decltype
2206 static tree cp_parser_decomposition_declaration
2209 /* Declarators [gram.dcl.decl] */
2211 static tree cp_parser_init_declarator
2218 static enum tree_code cp_parser_ptr_operator
2220 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2222 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2224 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2226 static tree cp_parser_tx_qualifier_opt
2228 static tree cp_parser_late_return_type_opt
2230 static tree cp_parser_declarator_id
2232 static tree cp_parser_type_id
2234 static tree cp_parser_template_type_arg
2237 static tree cp_parser_type_id_1
2239 static void cp_parser_type_specifier_seq
2241 static tree cp_parser_parameter_declaration_clause
2243 static tree cp_parser_parameter_declaration_list
2247 static tree cp_parser_default_argument
2249 static void cp_parser_function_body
2251 static tree cp_parser_initializer
2253 static cp_expr cp_parser_initializer_clause
2255 static cp_expr cp_parser_braced_list
2260 static bool cp_parser_ctor_initializer_opt_and_function_body
2263 static tree cp_parser_late_parsing_omp_declare_simd
2266 static tree cp_parser_late_parsing_cilk_simd_fn_info
2269 static tree cp_parser_late_parsing_oacc_routine
2272 static tree synthesize_implicit_template_parm
2274 static tree finish_fully_implicit_template
2277 /* Classes [gram.class] */
2279 static tree cp_parser_class_name
2281 static tree cp_parser_class_specifier
2283 static tree cp_parser_class_head
2285 static enum tag_types cp_parser_class_key
2287 static void cp_parser_type_parameter_key
2289 static void cp_parser_member_specification_opt
2291 static void cp_parser_member_declaration
2293 static tree cp_parser_pure_specifier
2295 static tree cp_parser_constant_initializer
2298 /* Derived classes [gram.class.derived] */
2300 static tree cp_parser_base_clause
2302 static tree cp_parser_base_specifier
2305 /* Special member functions [gram.special] */
2307 static tree cp_parser_conversion_function_id
2309 static tree cp_parser_conversion_type_id
2313 static bool cp_parser_ctor_initializer_opt
2315 static void cp_parser_mem_initializer_list
2317 static tree cp_parser_mem_initializer
2319 static tree cp_parser_mem_initializer_id
2322 /* Overloading [gram.over] */
2324 static cp_expr cp_parser_operator_function_id
2326 static cp_expr cp_parser_operator
2329 /* Templates [gram.temp] */
2331 static void cp_parser_template_declaration
2333 static tree cp_parser_template_parameter_list
2335 static tree cp_parser_template_parameter
2337 static tree cp_parser_type_parameter
2339 static tree cp_parser_template_id
2341 static tree cp_parser_template_name
2343 static tree cp_parser_template_argument_list
2345 static tree cp_parser_template_argument
2347 static void cp_parser_explicit_instantiation
2349 static void cp_parser_explicit_specialization
2352 /* Exception handling [gram.exception] */
2354 static tree cp_parser_try_block
2356 static bool cp_parser_function_try_block
2358 static void cp_parser_handler_seq
2360 static void cp_parser_handler
2362 static tree cp_parser_exception_declaration
2364 static tree cp_parser_throw_expression
2366 static tree cp_parser_exception_specification_opt
2368 static tree cp_parser_type_id_list
2371 /* GNU Extensions */
2373 static tree cp_parser_asm_specification_opt
2375 static tree cp_parser_asm_operand_list
2377 static tree cp_parser_asm_clobber_list
2379 static tree cp_parser_asm_label_list
2381 static bool cp_next_tokens_can_be_attribute_p
2383 static bool cp_next_tokens_can_be_gnu_attribute_p
2385 static bool cp_next_tokens_can_be_std_attribute_p
2387 static bool cp_nth_tokens_can_be_std_attribute_p
2389 static bool cp_nth_tokens_can_be_gnu_attribute_p
2391 static bool cp_nth_tokens_can_be_attribute_p
2393 static tree cp_parser_attributes_opt
2395 static tree cp_parser_gnu_attributes_opt
2397 static tree cp_parser_gnu_attribute_list
2399 static tree cp_parser_std_attribute
2401 static tree cp_parser_std_attribute_spec
2403 static tree cp_parser_std_attribute_spec_seq
2405 static bool cp_parser_extension_opt
2407 static void cp_parser_label_declaration
2410 /* Concept Extensions */
2412 static tree cp_parser_requires_clause
2414 static tree cp_parser_requires_clause_opt
2416 static tree cp_parser_requires_expression
2418 static tree cp_parser_requirement_parameter_list
2420 static tree cp_parser_requirement_body
2422 static tree cp_parser_requirement_list
2424 static tree cp_parser_requirement
2426 static tree cp_parser_simple_requirement
2428 static tree cp_parser_compound_requirement
2430 static tree cp_parser_type_requirement
2432 static tree cp_parser_nested_requirement
2435 /* Transactional Memory Extensions */
2437 static tree cp_parser_transaction
2439 static tree cp_parser_transaction_expression
2441 static bool cp_parser_function_transaction
2443 static tree cp_parser_transaction_cancel
2447 pragma_external,
2448 pragma_member,
2449 pragma_objc_icode,
2450 pragma_stmt,
2451 pragma_compound
2452 };
2453 static bool cp_parser_pragma
2456 /* Objective-C++ Productions */
2458 static tree cp_parser_objc_message_receiver
2460 static tree cp_parser_objc_message_args
2462 static tree cp_parser_objc_message_expression
2464 static cp_expr cp_parser_objc_encode_expression
2466 static tree cp_parser_objc_defs_expression
2468 static tree cp_parser_objc_protocol_expression
2470 static tree cp_parser_objc_selector_expression
2472 static cp_expr cp_parser_objc_expression
2474 static bool cp_parser_objc_selector_p
2476 static tree cp_parser_objc_selector
2478 static tree cp_parser_objc_protocol_refs_opt
2480 static void cp_parser_objc_declaration
2482 static tree cp_parser_objc_statement
2484 static bool cp_parser_objc_valid_prefix_attributes
2486 static void cp_parser_objc_at_property_declaration
2488 static void cp_parser_objc_at_synthesize_declaration
2490 static void cp_parser_objc_at_dynamic_declaration
2492 static tree cp_parser_objc_struct_declaration
2495 /* Utility Routines */
2497 static cp_expr cp_parser_lookup_name
2499 static tree cp_parser_lookup_name_simple
2501 static tree cp_parser_maybe_treat_template_as_class
2503 static bool cp_parser_check_declarator_template_parameters
2505 static bool cp_parser_check_template_parameters
2507 static cp_expr cp_parser_simple_cast_expression
2509 static tree cp_parser_global_scope_opt
2511 static bool cp_parser_constructor_declarator_p
2513 static tree cp_parser_function_definition_from_specifiers_and_declarator
2515 static tree cp_parser_function_definition_after_declarator
2517 static bool cp_parser_template_declaration_after_export
2519 static void cp_parser_perform_template_parameter_access_checks
2521 static tree cp_parser_single_declaration
2523 static cp_expr cp_parser_functional_cast
2525 static tree cp_parser_save_member_function_body
2527 static tree cp_parser_save_nsdmi
2529 static tree cp_parser_enclosed_template_argument_list
2531 static void cp_parser_save_default_args
2533 static void cp_parser_late_parsing_for_member
2535 static tree cp_parser_late_parse_one_default_arg
2537 static void cp_parser_late_parsing_nsdmi
2539 static void cp_parser_late_parsing_default_args
2541 static tree cp_parser_sizeof_operand
2543 static tree cp_parser_trait_expr
2545 static bool cp_parser_declares_only_class_p
2547 static void cp_parser_set_storage_class
2549 static void cp_parser_set_decl_spec_type
2551 static void set_and_check_decl_spec_loc
2554 static bool cp_parser_friend_p
2556 static void cp_parser_required_error
2562 static bool cp_parser_token_starts_function_definition_p
2564 static bool cp_parser_next_token_starts_class_definition_p
2566 static bool cp_parser_next_token_ends_template_argument_p
2568 static bool cp_parser_nth_token_starts_template_argument_list_p
2570 static enum tag_types cp_parser_token_is_class_key
2572 static enum tag_types cp_parser_token_is_type_parameter_key
2574 static void cp_parser_check_class_key
2576 static void cp_parser_check_access_in_redeclaration
2578 static bool cp_parser_optional_template_keyword
2580 static void cp_parser_pre_parsed_nested_name_specifier
2582 static bool cp_parser_cache_group
2584 static tree cp_parser_cache_defarg
2586 static void cp_parser_parse_tentatively
2588 static void cp_parser_commit_to_tentative_parse
2590 static void cp_parser_commit_to_topmost_tentative_parse
2592 static void cp_parser_abort_tentative_parse
2594 static bool cp_parser_parse_definitely
2598 static bool cp_parser_uncommitted_to_tentative_parse_p
2600 static void cp_parser_error
2602 static void cp_parser_name_lookup_error
2604 static bool cp_parser_simulate_error
2606 static bool cp_parser_check_type_definition
2608 static void cp_parser_check_for_definition_in_return_type
2610 static void cp_parser_check_for_invalid_template_id
2612 static bool cp_parser_non_integral_constant_expression
2614 static void cp_parser_diagnose_invalid_type_name
2616 static bool cp_parser_parse_and_diagnose_invalid_type_name
2618 static int cp_parser_skip_to_closing_parenthesis
2620 static void cp_parser_skip_to_end_of_statement
2622 static void cp_parser_consume_semicolon_at_end_of_statement
2624 static void cp_parser_skip_to_end_of_block_or_statement
2626 static bool cp_parser_skip_to_closing_brace
2628 static void cp_parser_skip_to_end_of_template_parameter_list
2630 static void cp_parser_skip_to_pragma_eol
2632 static bool cp_parser_error_occurred
2634 static bool cp_parser_allow_gnu_extensions_p
2636 static bool cp_parser_is_pure_string_literal
2638 static bool cp_parser_is_string_literal
2640 static bool cp_parser_is_keyword
2642 static tree cp_parser_make_typename_type
2646 static bool cp_parser_compound_literal_p
2648 static bool cp_parser_array_designator_p
2650 static bool cp_parser_init_statement_p
2652 static bool cp_parser_skip_to_closing_square_bracket
2655 /* Concept-related syntactic transformations */
2660 // -------------------------------------------------------------------------- //
2661 // Unevaluated Operand Guard
2662 //
2663 // Implementation of an RAII helper for unevaluated operand parsing.
2665 {
2668 }
2671 {
2674 }
2676 // -------------------------------------------------------------------------- //
2677 // Tentative Parsing
2679 /* Returns nonzero if we are parsing tentatively. */
2683 {
2685 }
2687 /* Returns nonzero if TOKEN is a string literal. */
2689 static bool
2691 {
2697 }
2699 /* Returns nonzero if TOKEN is a string literal
2700 of a user-defined string literal. */
2702 static bool
2704 {
2711 }
2713 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2715 static bool
2717 {
2719 }
2721 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2722 PRAGMA_NONE. */
2724 static enum pragma_kind
2726 {
2729 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2731 }
2733 /* Helper function for cp_parser_error.
2734 Having peeked a token of kind TOK1_KIND that might signify
2735 a conflict marker, peek successor tokens to determine
2736 if we actually do have a conflict marker.
2737 Specifically, we consider a run of 7 '<', '=' or '>' characters
2738 at the start of a line as a conflict marker.
2739 These come through the lexer as three pairs and a single,
2740 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2741 If it returns true, *OUT_LOC is written to with the location/range
2742 of the marker. */
2744 static bool
2747 {
2758 /* It must be at the start of the line. */
2763 /* We have a conflict marker. Construct a location of the form:
2764 <<<<<<<
2765 ^~~~~~~
2766 with start == caret, finishing at the end of the marker. */
2771 }
2773 /* If not parsing tentatively, issue a diagnostic of the form
2774 FILE:LINE: MESSAGE before TOKEN
2775 where TOKEN is the next token in the input stream. MESSAGE
2776 (specified by the caller) is usually of the form "expected
2777 OTHER-TOKEN". */
2779 static void
2781 {
2783 {
2785 /* This diagnostic makes more sense if it is tagged to the line
2786 of the token we just peeked at. */
2790 {
2795 }
2797 /* If this is actually a conflict marker, report it as such. */
2801 {
2802 location_t loc;
2804 {
2807 }
2808 }
2811 /* Because c_parser_error does not understand
2812 CPP_KEYWORD, keywords are treated like
2813 identifiers. */
2816 }
2817 }
2819 /* Issue an error about name-lookup failing. NAME is the
2820 IDENTIFIER_NODE DECL is the result of
2821 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2822 the thing that we hoped to find. */
2824 static void
2826 tree name,
2827 tree decl,
2828 name_lookup_error desired,
2829 location_t location)
2830 {
2831 /* If name lookup completely failed, tell the user that NAME was not
2832 declared. */
2834 {
2847 else
2849 }
2851 {
2853 {
2870 }
2871 }
2873 {
2875 {
2885 name);
2889 }
2890 }
2891 else
2892 {
2894 {
2907 }
2908 }
2909 }
2911 /* If we are parsing tentatively, remember that an error has occurred
2912 during this tentative parse. Returns true if the error was
2913 simulated; false if a message should be issued by the caller. */
2915 static bool
2917 {
2919 {
2922 }
2924 }
2926 /* This function is called when a type is defined. If type
2927 definitions are forbidden at this point, an error message is
2928 issued. */
2930 static bool
2932 {
2933 /* If types are forbidden here, issue a message. */
2935 {
2936 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2937 in the message need to be interpreted. */
2940 }
2942 }
2944 /* This function is called when the DECLARATOR is processed. The TYPE
2945 was a type defined in the decl-specifiers. If it is invalid to
2946 define a type in the decl-specifiers for DECLARATOR, an error is
2947 issued. TYPE_LOCATION is the location of TYPE and is used
2948 for error reporting. */
2950 static void
2953 {
2954 /* [dcl.fct] forbids type definitions in return types.
2955 Unfortunately, it's not easy to know whether or not we are
2956 processing a return type until after the fact. */
2964 {
2969 type);
2970 }
2971 }
2973 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2974 "<" in any valid C++ program. If the next token is indeed "<",
2975 issue a message warning the user about what appears to be an
2976 invalid attempt to form a template-id. LOCATION is the location
2977 of the type-specifier (TYPE) */
2979 static void
2981 tree type,
2983 location_t location)
2984 {
2988 {
2992 {
2995 else
2997 }
2998 else
3000 /* Remember the location of the invalid "<". */
3003 /* Consume the "<". */
3005 /* Parse the template arguments. */
3007 /* Permanently remove the invalid template arguments so that
3008 this error message is not issued again. */
3011 }
3012 }
3014 /* If parsing an integral constant-expression, issue an error message
3015 about the fact that THING appeared and return true. Otherwise,
3016 return false. In either case, set
3017 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3019 static bool
3021 non_integral_constant thing)
3022 {
3025 {
3027 {
3030 {
3033 "ISO C++ forbids using a floating-point literal "
3038 "enumeration type cannot appear in a "
3129 }
3133 }
3134 }
3136 }
3138 /* Emit a diagnostic for an invalid type name. This function commits
3139 to the current active tentative parse, if any. (Otherwise, the
3140 problematic construct might be encountered again later, resulting
3141 in duplicate error messages.) LOCATION is the location of ID. */
3143 static void
3145 location_t location)
3146 {
3149 /* Try to lookup the identifier. */
3156 /* If the lookup was ambiguous, an error will already have
3157 been issued. */
3159 /* If the lookup found a template-name, it means that the user forgot
3160 to specify an argument list. Emit a useful error message. */
3162 {
3165 decl);
3170 }
3174 /* Something like 'unsigned A a;' */
3177 {
3178 /* Issue an error message. */
3183 {
3189 }
3190 else
3192 /* If we're in a template class, it's possible that the user was
3193 referring to a type from a base class. For example:
3195 template <typename T> struct A { typedef T X; };
3196 template <typename T> struct B : public A<T> { X x; };
3198 The user should have said "typename A<T>::X". */
3214 {
3215 tree b;
3218 b;
3220 {
3224 {
3225 tree field;
3226 /* Go from a particular instantiation of the
3227 template (which will have an empty TYPE_FIELDs),
3228 to the main version. */
3231 field;
3235 {
3240 }
3243 }
3244 }
3245 }
3246 }
3247 /* Here we diagnose qualified-ids where the scope is actually correct,
3248 but the identifier does not resolve to a valid type name. */
3250 {
3252 {
3257 else
3263 }
3266 {
3267 /* A<T>::A<T>() */
3273 }
3280 {
3288 else
3294 }
3295 else
3297 }
3298 }
3300 /* Check for a common situation where a type-name should be present,
3301 but is not, and issue a sensible error message. Returns true if an
3302 invalid type-name was detected.
3304 The situation handled by this function are variable declarations of the
3305 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3306 Usually, `ID' should name a type, but if we got here it means that it
3307 does not. We try to emit the best possible error message depending on
3308 how exactly the id-expression looks like. */
3310 static bool
3312 {
3313 tree id;
3316 /* Avoid duplicate error about ambiguous lookup. */
3318 {
3322 }
3331 /* If the next token is a (, this is a function with no explicit return
3332 type, i.e. constructor, destructor or conversion op. */
3335 {
3338 }
3342 /* Emit a diagnostic for the invalid type. */
3344 out:
3345 /* If we aren't in the middle of a declarator (i.e. in a
3346 parameter-declaration-clause), skip to the end of the declaration;
3347 there's no point in trying to process it. */
3351 }
3353 /* Consume tokens up to, and including, the next non-nested closing `)'.
3354 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3355 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3356 found an unnested token of that type. */
3358 static int
3361 cpp_ttype or_ttype,
3363 {
3373 {
3376 /* Have we found what we're looking for before the closing paren? */
3382 {
3385 /* If we've run out of tokens, then there is no closing `)'. */
3388 /* This is good for lambda expression capture-lists. */
3398 /* This matches the processing in skip_to_end_of_statement. */
3418 {
3422 }
3427 }
3429 /* Consume the token. */
3431 }
3432 }
3434 /* Consume tokens up to, and including, the next non-nested closing `)'.
3435 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3436 are doing error recovery. Returns -1 if OR_COMMA is true and we
3437 found an unnested token of that type. */
3439 static int
3444 {
3448 }
3450 /* Consume tokens until we reach the end of the current statement.
3451 Normally, that will be just before consuming a `;'. However, if a
3452 non-nested `}' comes first, then we stop before consuming that. */
3454 static void
3456 {
3459 /* Unwind generic function template scope if necessary. */
3464 {
3468 {
3471 /* If we've run out of tokens, stop. */
3475 /* If the next token is a `;', we have reached the end of the
3476 statement. */
3482 /* If this is a non-nested '}', stop before consuming it.
3483 That way, when confronted with something like:
3485 { 3 + }
3487 we stop before consuming the closing '}', even though we
3488 have not yet reached a `;'. */
3492 /* If it is the closing '}' for a block that we have
3493 scanned, stop -- but only after consuming the token.
3494 That way given:
3496 void f g () { ... }
3497 typedef int I;
3499 we will stop after the body of the erroneously declared
3500 function, but before consuming the following `typedef'
3501 declaration. */
3503 {
3506 }
3515 }
3517 /* Consume the token. */
3519 }
3520 }
3522 /* This function is called at the end of a statement or declaration.
3523 If the next token is a semicolon, it is consumed; otherwise, error
3524 recovery is attempted. */
3526 static void
3528 {
3529 /* Look for the trailing `;'. */
3531 {
3532 /* If there is additional (erroneous) input, skip to the end of
3533 the statement. */
3535 /* If the next token is now a `;', consume it. */
3538 }
3539 }
3541 /* Skip tokens until we have consumed an entire block, or until we
3542 have consumed a non-nested `;'. */
3544 static void
3546 {
3549 /* Unwind generic function template scope if necessary. */
3554 {
3558 {
3561 /* If we've run out of tokens, stop. */
3565 /* Stop if this is an unnested ';'. */
3571 /* Stop if this is an unnested '}', or closes the outermost
3572 nesting level. */
3573 nesting_depth--;
3581 /* Nest. */
3582 nesting_depth++;
3587 }
3589 /* Consume the token. */
3591 }
3592 }
3594 /* Skip tokens until a non-nested closing curly brace is the next
3595 token, or there are no more tokens. Return true in the first case,
3596 false otherwise. */
3598 static bool
3600 {
3604 {
3608 {
3611 /* If we've run out of tokens, stop. */
3615 /* If the next token is a non-nested `}', then we have reached
3616 the end of the current block. */
3622 /* If it the next token is a `{', then we are entering a new
3623 block. Consume the entire block. */
3629 }
3631 /* Consume the token. */
3633 }
3634 }
3636 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3637 parameter is the PRAGMA token, allowing us to purge the entire pragma
3638 sequence. */
3640 static void
3642 {
3647 do
3651 /* Ensure that the pragma is not parsed again. */
3653 }
3655 /* Require pragma end of line, resyncing with it as necessary. The
3656 arguments are as for cp_parser_skip_to_pragma_eol. */
3658 static void
3660 {
3664 }
3666 /* This is a simple wrapper around make_typename_type. When the id is
3667 an unresolved identifier node, we can provide a superior diagnostic
3668 using cp_parser_diagnose_invalid_type_name. */
3670 static tree
3672 location_t id_location)
3673 {
3674 tree result;
3676 {
3682 }
3684 }
3686 /* This is a wrapper around the
3687 make_{pointer,ptrmem,reference}_declarator functions that decides
3688 which one to call based on the CODE and CLASS_TYPE arguments. The
3689 CODE argument should be one of the values returned by
3690 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3691 appertain to the pointer or reference. */
3695 cp_cv_quals cv_qualifiers,
3697 tree attributes)
3698 {
3705 else
3715 }
3717 /* Create a new C++ parser. */
3721 {
3726 /* cp_lexer_new_main is called before doing GC allocation because
3727 cp_lexer_new_main might load a PCH file. */
3730 /* Initialize the binops_by_token so that we can get the tree
3731 directly from the token. */
3739 /* For now, we always accept GNU extensions. */
3742 /* The `>' token is a greater-than operator, not the end of a
3743 template-id. */
3748 /* We are not parsing a constant-expression. */
3753 /* Local variable names are not forbidden. */
3756 /* We are not processing an `extern "C"' declaration. */
3759 /* We are not processing a declarator. */
3762 /* We are not processing a template-argument-list. */
3765 /* We are not in an iteration statement. */
3768 /* We are not in a switch statement. */
3771 /* We are not parsing a type-id inside an expression. */
3774 /* Declarations aren't implicitly extern "C". */
3777 /* String literals should be translated to the execution character set. */
3780 /* We are not parsing a function body. */
3783 /* We can correct until told otherwise. */
3786 /* The unparsed function queue is empty. */
3789 /* There are no classes being defined. */
3792 /* No template parameters apply. */
3795 /* Special parsing data structures. */
3800 /* Not declaring an implicit function template. */
3806 /* Allow constrained-type-specifiers. */
3810 }
3812 /* Create a cp_lexer structure which will emit the tokens in CACHE
3813 and push it onto the parser's lexer stack. This is used for delayed
3814 parsing of in-class method bodies and default arguments, and should
3815 not be confused with tentative parsing. */
3816 static void
3818 {
3823 /* Move the current source position to that of the first token in the
3824 new lexer. */
3826 }
3828 /* Pop the top lexer off the parser stack. This is never used for the
3829 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3830 static void
3832 {
3837 /* Put the current source position back where it was before this
3838 lexer was pushed. */
3840 }
3842 /* Lexical conventions [gram.lex] */
3844 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3845 identifier. */
3847 static cp_expr
3849 {
3852 /* Look for the identifier. */
3854 /* Return the value. */
3857 else
3859 }
3861 /* Parse a sequence of adjacent string constants. Returns a
3862 TREE_STRING representing the combined, nul-terminated string
3863 constant. If TRANSLATE is true, translate the string to the
3864 execution character set. If WIDE_OK is true, a wide string is
3865 invalid here.
3867 C++98 [lex.string] says that if a narrow string literal token is
3868 adjacent to a wide string literal token, the behavior is undefined.
3869 However, C99 6.4.5p4 says that this results in a wide string literal.
3870 We follow C99 here, for consistency with the C front end.
3872 This code is largely lifted from lex_string() in c-lex.c.
3874 FUTURE: ObjC++ will need to handle @-strings here. */
3875 static cp_expr
3878 {
3879 tree value;
3886 tree string_tree;
3892 {
3895 }
3900 {
3904 }
3905 else
3906 {
3909 }
3912 /* Try to avoid the overhead of creating and destroying an obstack
3913 for the common case of just one string. */
3916 {
3924 {
3928 }
3929 else
3933 }
3934 else
3935 {
3940 do
3941 {
3943 count++;
3948 {
3951 {
3954 }
3957 {
3962 }
3964 }
3965 else
3969 {
3973 {
3977 "unsupported non-standard concatenation "
3979 }
3980 }
3988 {
3992 }
3993 else
3994 {
3998 }
3999 }
4002 /* A string literal built by concatenation has its caret=start at
4003 the start of the initial string, and its finish at the finish of
4004 the final string literal. */
4008 }
4011 {
4014 }
4018 {
4023 {
4038 }
4043 {
4048 else
4050 }
4051 }
4052 else
4053 /* cpp_interpret_string has issued an error. */
4060 }
4062 /* Look up a literal operator with the name and the exact arguments. */
4064 static tree
4066 {
4073 {
4079 {
4082 {
4092 }
4095 /* May be this should be sufficient_parms_p instead,
4096 depending on how exactly should user-defined literals
4097 work in presence of default arguments on the literal
4098 operator parameters. */
4101 }
4102 }
4105 }
4107 /* Parse a user-defined char constant. Returns a call to a user-defined
4108 literal operator taking the character as an argument. */
4110 static cp_expr
4112 {
4120 /* Build up a call to the user-defined operator */
4121 /* Lookup the name we got back from the id-expression. */
4126 {
4131 }
4135 }
4137 /* A subroutine of cp_parser_userdef_numeric_literal to
4138 create a char... template parameter pack from a string node. */
4140 static tree
4142 {
4143 tree charvec;
4149 /* Fill in CHARVEC with all of the parameters. */
4154 /* Build the argument packs. */
4161 }
4163 /* A subroutine of cp_parser_userdef_numeric_literal to
4164 create a char... template parameter pack from a string node. */
4166 static tree
4168 {
4169 tree charvec;
4180 /* First template parm is character type. */
4183 /* Fill in CHARVEC with all of the parameters. */
4190 /* Build the argument packs. */
4197 }
4199 /* Parse a user-defined numeric constant. returns a call to a user-defined
4200 literal operator. */
4202 static cp_expr
4204 {
4215 /* Look for a literal operator taking the exact type of numeric argument
4216 as the literal value. */
4221 {
4223 tf_warning_or_error);
4226 {
4229 long_long_unsigned_type_node);
4230 }
4231 else
4232 {
4236 long_double_type_node);
4240 }
4244 }
4247 /* If the numeric argument didn't work, look for a raw literal
4248 operator taking a const char* argument consisting of the number
4249 in string format. */
4254 {
4256 tf_warning_or_error);
4259 }
4262 /* If the raw literal didn't work, look for a non-type template
4263 function with parameter pack char.... Call the function with
4264 template parameter characters representing the number. */
4268 {
4272 tf_warning_or_error);
4275 }
4284 }
4286 /* Parse a user-defined string constant. Returns a call to a user-defined
4287 literal operator taking a character pointer and the length of the string
4288 as arguments. */
4290 static tree
4292 {
4301 /* Build up a call to the user-defined operator. */
4302 /* Lookup the name we got back from the id-expression. */
4309 {
4311 tf_warning_or_error);
4314 }
4317 /* Look for a template function with typename parameter CharT
4318 and parameter pack CharT... Call the function with
4319 template parameter characters representing the string. */
4323 {
4327 tf_warning_or_error);
4330 }
4336 }
4339 /* Basic concepts [gram.basic] */
4341 /* Parse a translation-unit.
4343 translation-unit:
4344 declaration-seq [opt]
4346 Returns TRUE if all went well. */
4348 static bool
4350 {
4351 /* The address of the first non-permanent object on the declarator
4352 obstack. */
4357 /* Create the declarator obstack, if necessary. */
4359 {
4361 /* Create the error declarator. */
4363 /* Create the empty parameter list. */
4365 /* Remember where the base of the declarator obstack lies. */
4367 }
4371 /* If there are no tokens left then all went well. */
4373 {
4374 /* Get rid of the token array; we don't need it any more. */
4378 /* This file might have been a context that's implicitly extern
4379 "C". If so, pop the lang context. (Only relevant for PCH.) */
4381 {
4384 }
4386 /* Finish up. */
4390 }
4391 else
4392 {
4395 }
4397 /* Make sure the declarator obstack was fully cleaned up. */
4401 /* All went well. */
4403 }
4405 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4406 decltype context. */
4410 {
4415 }
4417 /* We're about to parse a collection of statements. If we're currently
4418 parsing tentatively, set up a firewall so that any nested
4419 cp_parser_commit_to_tentative_parse won't affect the current context. */
4421 static cp_token_position
4423 {
4430 }
4432 /* We've finished parsing the collection of statements. Wrap up the
4433 firewall and replace the relevant tokens with the parsed form. */
4435 static void
4437 tree expr)
4438 {
4442 /* Finish the firewall level. */
4444 /* And remember the result of the parse for when we try again. */
4450 }
4452 /* Like the above functions, but let the user modify the tokens. Used by
4453 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4454 later parses, so it makes sense to localize the effects of
4455 cp_parser_commit_to_tentative_parse. */
4457 struct tentative_firewall
4458 {
4463 {
4464 /* If we're currently parsing tentatively, start a committed level as a
4465 firewall and then an inner tentative parse. */
4467 {
4471 }
4472 }
4475 {
4477 {
4478 /* Finish the inner tentative parse and the firewall, propagating any
4479 uncommitted error state to the outer tentative parse. */
4485 }
4486 }
4487 };
4489 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4490 enclosing parentheses. */
4492 static cp_expr
4494 {
4497 /* Consume the '('. */
4500 /* Start the statement-expression. */
4502 /* Parse the compound-statement. */
4504 /* Finish up. */
4506 /* Consume the ')'. */
4514 }
4516 /* Expressions [gram.expr] */
4518 /* Parse a fold-operator.
4520 fold-operator:
4521 - * / % ^ & | = < > << >>
4522 = -= *= /= %= ^= &= |= <<= >>=
4523 == != <= >= && || , .* ->*
4525 This returns the tree code corresponding to the matched operator
4526 as an int. When the current token matches a compound assignment
4527 opertor, the resulting tree code is the negative value of the
4528 non-assignment operator. */
4530 static int
4532 {
4534 {
4574 }
4575 }
4577 /* Returns true if CODE indicates a binary expression, which is not allowed in
4578 the LHS of a fold-expression. More codes will need to be added to use this
4579 function in other contexts. */
4581 static bool
4583 {
4585 {
4618 }
4619 }
4621 /* If the next token is a suitable fold operator, consume it and return as
4622 the function above. */
4624 static int
4626 {
4632 }
4634 /* Parse a fold-expression.
4636 fold-expression:
4637 ( ... folding-operator cast-expression)
4638 ( cast-expression folding-operator ... )
4639 ( cast-expression folding operator ... folding-operator cast-expression)
4641 Note that the '(' and ')' are matched in primary expression. */
4643 static cp_expr
4645 {
4646 cp_id_kind pidk;
4648 // Left fold.
4650 {
4654 {
4657 }
4664 }
4669 {
4672 }
4675 {
4678 }
4681 /* The operands of a fold-expression are cast-expressions, so binary or
4682 conditional expressions are not allowed. We check this here to avoid
4683 tentative parsing. */
4693 // Right fold.
4698 {
4701 }
4704 // Binary left or right fold.
4709 }
4711 /* Parse a primary-expression.
4713 primary-expression:
4714 literal
4715 this
4716 ( expression )
4717 id-expression
4718 lambda-expression (C++11)
4720 GNU Extensions:
4722 primary-expression:
4723 ( compound-statement )
4724 __builtin_va_arg ( assignment-expression , type-id )
4725 __builtin_offsetof ( type-id , offsetof-expression )
4727 C++ Extensions:
4728 __has_nothrow_assign ( type-id )
4729 __has_nothrow_constructor ( type-id )
4730 __has_nothrow_copy ( type-id )
4731 __has_trivial_assign ( type-id )
4732 __has_trivial_constructor ( type-id )
4733 __has_trivial_copy ( type-id )
4734 __has_trivial_destructor ( type-id )
4735 __has_virtual_destructor ( type-id )
4736 __is_abstract ( type-id )
4737 __is_base_of ( type-id , type-id )
4738 __is_class ( type-id )
4739 __is_empty ( type-id )
4740 __is_enum ( type-id )
4741 __is_final ( type-id )
4742 __is_literal_type ( type-id )
4743 __is_pod ( type-id )
4744 __is_polymorphic ( type-id )
4745 __is_std_layout ( type-id )
4746 __is_trivial ( type-id )
4747 __is_union ( type-id )
4749 Objective-C++ Extension:
4751 primary-expression:
4752 objc-expression
4754 literal:
4755 __null
4757 ADDRESS_P is true iff this expression was immediately preceded by
4758 "&" and therefore might denote a pointer-to-member. CAST_P is true
4759 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4760 true iff this expression is a template argument.
4762 Returns a representation of the expression. Upon return, *IDK
4763 indicates what kind of id-expression (if any) was present. */
4765 static cp_expr
4772 {
4775 /* Assume the primary expression is not an id-expression. */
4778 /* Peek at the next token. */
4781 {
4782 /* literal:
4783 integer-literal
4784 character-literal
4785 floating-literal
4786 string-literal
4787 boolean-literal
4788 pointer-literal
4789 user-defined-literal */
4801 {
4805 }
4806 /* Floating-point literals are only allowed in an integral
4807 constant expression if they are cast to an integral or
4808 enumeration type. */
4812 {
4813 /* CAST_P will be set even in invalid code like "int(2.7 +
4814 ...)". Therefore, we have to check that the next token
4815 is sure to end the cast. */
4817 {
4822 enumerator-definition. */
4824 /* The curly brace at the end of an enum-specifier. */
4826 /* The end of a statement. */
4828 /* The end of the cast-expression. */
4830 /* The end of an array bound. */
4832 /* The closing ">" in a template-argument-list. */
4835 /* C++0x only: A ">>" treated like two ">" tokens,
4836 in a template-argument-list. */
4841 }
4843 /* If we are within a cast, then the constraint that the
4844 cast is to an integral or enumeration type will be
4845 checked at that point. If we are not within a cast, then
4846 this code is invalid. */
4849 }
4869 /* ??? Should wide strings be allowed when parser->translate_strings_p
4870 is false (i.e. in attributes)? If not, we can kill the third
4871 argument to cp_parser_string_literal. */
4877 /* If we see `( { ' then we are looking at the beginning of
4878 a GNU statement-expression. */
4881 {
4882 /* Statement-expressions are not allowed by the standard. */
4886 /* And they're not allowed outside of a function-body; you
4887 cannot, for example, write:
4889 int i = ({ int j = 3; j + 1; });
4891 at class or namespace scope. */
4894 {
4896 "statement-expressions are not allowed outside "
4902 }
4903 else
4905 }
4906 /* Otherwise it's a normal parenthesized expression. */
4907 {
4908 cp_expr expr;
4913 /* Consume the `('. */
4915 /* Within a parenthesized expression, a `>' token is always
4916 the greater-than operator. */
4917 saved_greater_than_is_operator_p
4922 /* Left fold expression. */
4924 else
4925 /* Parse the parenthesized expression. */
4930 {
4937 }
4938 else
4939 /* Let the front end know that this expression was
4940 enclosed in parentheses. This matters in case, for
4941 example, the expression is of the form `A::B', since
4942 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4943 not. */
4946 /* DR 705: Wrapping an unqualified name in parentheses
4947 suppresses arg-dependent lookup. We want to pass back
4948 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4949 (c++/37862), but none of the others. */
4953 /* The `>' token might be the end of a template-id or
4954 template-parameter-list now. */
4955 parser->greater_than_is_operator_p
4958 /* Consume the `)'. */
4967 }
4970 {
4972 {
4973 /* We might have an Objective-C++ message. */
4976 /* If that works out, we're done ... */
4979 /* ... else, fall though to see if it's a lambda. */
4980 }
4982 /* Don't warn about a failed tentative parse. */
4987 }
4991 /* We have an Objective-C++ string literal. */
4998 {
4999 /* These two are the boolean literals. */
5007 /* The `__null' literal. */
5012 /* The `nullptr' literal. */
5017 /* Recognize the `this' keyword. */
5021 {
5025 }
5026 /* Pointers cannot appear in constant-expressions. */
5031 /* The `operator' keyword can be the beginning of an
5032 id-expression. */
5039 {
5040 non_integral_constant name;
5042 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5043 __func__ are the names of variables -- but they are
5044 treated specially. Therefore, they are handled here,
5045 rather than relying on the generic id-expression logic
5046 below. Grammatically, these names are id-expressions.
5048 Consume the token. */
5052 {
5064 }
5069 /* Look up the name. */
5071 }
5074 {
5075 tree expression;
5076 tree type;
5077 source_location type_location;
5078 location_t start_loc
5080 /* The `__builtin_va_arg' construct is used to handle
5081 `va_arg'. Consume the `__builtin_va_arg' token. */
5083 /* Look for the opening `('. */
5085 /* Now, parse the assignment-expression. */
5087 /* Look for the `,'. */
5090 /* Parse the type-id. */
5091 {
5094 }
5095 /* Look for the closing `)'. */
5096 location_t finish_loc
5099 /* Using `va_arg' in a constant-expression is not
5100 allowed. */
5102 NIC_VA_ARG))
5104 /* Construct a location of the form:
5105 __builtin_va_arg (v, int)
5106 ~~~~~~~~~~~~~~~~~~~~~^~~~
5107 with the caret at the type, ranging from the start of the
5108 "__builtin_va_arg" token to the close paren. */
5109 location_t combined_loc
5112 }
5144 // C++ concepts
5148 /* Objective-C++ expressions. */
5158 {
5163 }
5164 /* FALLTHRU */
5168 }
5170 /* An id-expression can start with either an identifier, a
5171 `::' as the beginning of a qualified-id, or the "operator"
5172 keyword. */
5177 {
5178 id_expression:
5179 cp_expr id_expression;
5180 cp_expr decl;
5186 /* Parse the id-expression. */
5187 id_expression
5204 /* If we have a template-id, then no further lookup is
5205 required. If the template-id was for a template-class, we
5206 will sometimes have a TYPE_DECL at this point. */
5210 /* Look up the name. */
5211 else
5212 {
5213 tree ambiguous_decls;
5215 /* If we already know that this lookup is ambiguous, then
5216 we've already issued an error message; there's no reason
5217 to check again. */
5220 {
5223 }
5226 none_type,
5227 template_p,
5232 /* If the lookup was ambiguous, an error will already have
5233 been issued. */
5237 /* In Objective-C++, we may have an Objective-C 2.0
5238 dot-syntax for classes here. */
5243 {
5244 tree component;
5251 component);
5252 /* Build a location of the form:
5253 expr.component
5254 ~~~~~^~~~~~~~~
5255 with caret at the start of the component name (at
5256 input_location), ranging from the start of the id_expression
5257 to the end of the component name. */
5258 location_t combined_loc
5263 }
5265 /* In Objective-C++, an instance variable (ivar) may be preferred
5266 to whatever cp_parser_lookup_name() found.
5267 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5268 rest of c-family, we have to do a little extra work to preserve
5269 any location information in cp_expr "decl". Given that
5270 objc_lookup_ivar is implemented in "c-family" and "objc", we
5271 have a trip through the pure "tree" type, rather than cp_expr.
5272 Naively copying it back to "decl" would implicitly give the
5273 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5274 store an EXPR_LOCATION. Hence we only update "decl" (and
5275 hence its location_t) if we get back a different tree node. */
5277 id_expression);
5281 /* If name lookup gives us a SCOPE_REF, then the
5282 qualifying scope was dependent. */
5284 {
5285 /* At this point, we do not know if DECL is a valid
5286 integral constant expression. We assume that it is
5287 in fact such an expression, so that code like:
5289 template <int N> struct A {
5290 int a[B<N>::i];
5291 };
5293 is accepted. At template-instantiation time, we
5294 will check that B<N>::i is actually a constant. */
5296 }
5297 /* Check to see if DECL is a local variable in a context
5298 where that is forbidden. */
5301 {
5302 /* It might be that we only found DECL because we are
5303 trying to be generous with pre-ISO scoping rules.
5304 For example, consider:
5306 int i;
5307 void g() {
5308 for (int i = 0; i < 10; ++i) {}
5309 extern void f(int j = i);
5310 }
5312 Here, name look up will originally find the out
5313 of scope `i'. We need to issue a warning message,
5314 but then use the global `i'. */
5317 {
5322 }
5323 }
5324 }
5326 decl = (finish_id_expression
5328 idk,
5333 template_arg_p,
5340 }
5342 /* Anything else is an error. */
5346 }
5347 }
5355 {
5358 }
5360 /* Parse an id-expression.
5362 id-expression:
5363 unqualified-id
5364 qualified-id
5366 qualified-id:
5367 :: [opt] nested-name-specifier template [opt] unqualified-id
5368 :: identifier
5369 :: operator-function-id
5370 :: template-id
5372 Return a representation of the unqualified portion of the
5373 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5374 a `::' or nested-name-specifier.
5376 Often, if the id-expression was a qualified-id, the caller will
5377 want to make a SCOPE_REF to represent the qualified-id. This
5378 function does not do this in order to avoid wastefully creating
5379 SCOPE_REFs when they are not required.
5381 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5382 `template' keyword.
5384 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5385 uninstantiated templates.
5387 If *TEMPLATE_P is non-NULL, it is set to true iff the
5388 `template' keyword is used to explicitly indicate that the entity
5389 named is a template.
5391 If DECLARATOR_P is true, the id-expression is appearing as part of
5392 a declarator, rather than as part of an expression. */
5394 static cp_expr
5401 {
5405 /* Assume the `template' keyword was not used. */
5409 /* Look for the optional `::' operator. */
5410 global_scope_p
5413 /* Look for the optional nested-name-specifier. */
5414 nested_name_specifier_p
5417 check_dependency_p,
5419 declarator_p)
5421 /* If there is a nested-name-specifier, then we are looking at
5422 the first qualified-id production. */
5424 {
5425 tree saved_scope;
5426 tree saved_object_scope;
5427 tree saved_qualifying_scope;
5428 cp_expr unqualified_id;
5431 /* See if the next token is the `template' keyword. */
5435 /* Name lookup we do during the processing of the
5436 unqualified-id might obliterate SCOPE. */
5440 /* Process the final unqualified-id. */
5442 check_dependency_p,
5443 declarator_p,
5445 /* Restore the SAVED_SCOPE for our caller. */
5451 }
5452 /* Otherwise, if we are in global scope, then we are looking at one
5453 of the other qualified-id productions. */
5455 {
5457 tree id;
5459 /* Peek at the next token. */
5462 /* If it's an identifier, and the next token is not a "<", then
5463 we can avoid the template-id case. This is an optimization
5464 for this common case. */
5466 && !cp_parser_nth_token_starts_template_argument_list_p
5471 /* Try a template-id. */
5475 none_type,
5476 declarator_p);
5477 /* If that worked, we're done. */
5481 /* Peek at the next token. (Changes in the token buffer may
5482 have invalidated the pointer obtained above.) */
5486 {
5493 /* Fall through. */
5498 }
5499 }
5500 else
5503 declarator_p,
5504 optional_p);
5505 }
5507 /* Parse an unqualified-id.
5509 unqualified-id:
5510 identifier
5511 operator-function-id
5512 conversion-function-id
5513 ~ class-name
5514 template-id
5516 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5517 keyword, in a construct like `A::template ...'.
5519 Returns a representation of unqualified-id. For the `identifier'
5520 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5521 production a BIT_NOT_EXPR is returned; the operand of the
5522 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5523 other productions, see the documentation accompanying the
5524 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5525 names are looked up in uninstantiated templates. If DECLARATOR_P
5526 is true, the unqualified-id is appearing as part of a declarator,
5527 rather than as part of an expression. */
5529 static cp_expr
5535 {
5538 /* Peek at the next token. */
5542 {
5544 {
5545 tree id;
5547 /* We don't know yet whether or not this will be a
5548 template-id. */
5550 /* Try a template-id. */
5552 check_dependency_p,
5553 none_type,
5554 declarator_p);
5555 /* If it worked, we're done. */
5558 /* Otherwise, it's an ordinary identifier. */
5560 }
5564 check_dependency_p,
5565 none_type,
5566 declarator_p);
5569 {
5570 tree type_decl;
5571 tree qualifying_scope;
5572 tree object_scope;
5573 tree scope;
5576 /* Consume the `~' token. */
5578 /* Parse the class-name. The standard, as written, seems to
5579 say that:
5581 template <typename T> struct S { ~S (); };
5582 template <typename T> S<T>::~S() {}
5584 is invalid, since `~' must be followed by a class-name, but
5585 `S<T>' is dependent, and so not known to be a class.
5586 That's not right; we need to look in uninstantiated
5587 templates. A further complication arises from:
5589 template <typename T> void f(T t) {
5590 t.T::~T();
5591 }
5593 Here, it is not possible to look up `T' in the scope of `T'
5594 itself. We must look in both the current scope, and the
5595 scope of the containing complete expression.
5597 Yet another issue is:
5599 struct S {
5600 int S;
5601 ~S();
5602 };
5604 S::~S() {}
5606 The standard does not seem to say that the `S' in `~S'
5607 should refer to the type `S' and not the data member
5608 `S::S'. */
5610 /* DR 244 says that we look up the name after the "~" in the
5611 same scope as we looked up the qualifying name. That idea
5612 isn't fully worked out; it's more complicated than that. */
5617 /* Check for invalid scopes. */
5619 {
5623 }
5625 {
5629 scope);
5634 }
5637 /* If the name is of the form "X::~X" it's OK even if X is a
5638 typedef. */
5647 {
5650 }
5652 /* ~auto means the destructor of whatever the object is. */
5654 {
5657 "%<~auto%> only available with "
5661 }
5663 /* If there was an explicit qualification (S::~T), first look
5664 in the scope given by the qualification (i.e., S).
5666 Note: in the calls to cp_parser_class_name below we pass
5667 typename_type so that lookup finds the injected-class-name
5668 rather than the constructor. */
5672 {
5677 typename_type,
5680 declarator_p);
5683 }
5684 /* In "N::S::~S", look in "N" as well. */
5686 {
5691 type_decl
5695 typename_type,
5698 declarator_p);
5701 }
5702 /* In "p->S::~T", look in the scope given by "*p" as well. */
5704 {
5709 type_decl
5713 typename_type,
5716 declarator_p);
5719 }
5720 /* Look in the surrounding context. */
5722 {
5728 type_decl
5732 typename_type,
5735 declarator_p);
5738 {
5739 /* We couldn't find a type with this name. If we're parsing
5740 tentatively, fail and try something else. */
5742 {
5745 }
5746 /* Otherwise, accept it and check for a match at instantiation
5747 time. */
5752 }
5753 }
5754 /* If an error occurred, assume that the name of the
5755 destructor is the same as the name of the qualifying
5756 class. That allows us to keep parsing after running
5757 into ill-formed destructor names. */
5763 /* Check that destructor name and scope match. */
5765 {
5772 }
5774 /* [class.dtor]
5776 A typedef-name that names a class shall not be used as the
5777 identifier in the declarator for a destructor declaration. */
5784 type_decl);
5787 }
5791 {
5792 cp_expr id;
5794 /* This could be a template-id, so we try that first. */
5796 /* Try a template-id. */
5799 none_type,
5800 declarator_p);
5801 /* If that worked, we're done. */
5804 /* We still don't know whether we're looking at an
5805 operator-function-id or a conversion-function-id. */
5807 /* Try an operator-function-id. */
5809 /* If that didn't work, try a conversion-function-id. */
5813 {
5814 /* 17.6.3.3.5 */
5820 }
5823 }
5824 /* Fall through. */
5831 }
5832 }
5834 /* Parse an (optional) nested-name-specifier.
5836 nested-name-specifier: [C++98]
5837 class-or-namespace-name :: nested-name-specifier [opt]
5838 class-or-namespace-name :: template nested-name-specifier [opt]
5840 nested-name-specifier: [C++0x]
5841 type-name ::
5842 namespace-name ::
5843 nested-name-specifier identifier ::
5844 nested-name-specifier template [opt] simple-template-id ::
5846 PARSER->SCOPE should be set appropriately before this function is
5847 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5848 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5849 in name lookups.
5851 Sets PARSER->SCOPE to the class (TYPE) or namespace
5852 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5853 it unchanged if there is no nested-name-specifier. Returns the new
5854 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5856 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5857 part of a declaration and/or decl-specifier. */
5859 static tree
5865 {
5870 /* Remember where the nested-name-specifier starts. */
5872 {
5875 }
5878 {
5879 tree new_scope;
5880 tree old_scope;
5881 tree saved_qualifying_scope;
5884 /* Spot cases that cannot be the beginning of a
5885 nested-name-specifier. */
5888 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5889 the already parsed nested-name-specifier. */
5891 {
5892 /* Grab the nested-name-specifier and continue the loop. */
5894 /* If we originally encountered this nested-name-specifier
5895 with IS_DECLARATION set to false, we will not have
5896 resolved TYPENAME_TYPEs, so we must do so here. */
5899 {
5904 }
5907 }
5909 /* Spot cases that cannot be the beginning of a
5910 nested-name-specifier. On the second and subsequent times
5911 through the loop, we look for the `template' keyword. */
5913 ;
5914 /* A template-id can start a nested-name-specifier. */
5916 ;
5917 /* DR 743: decltype can be used in a nested-name-specifier. */
5919 ;
5920 else
5921 {
5922 /* If the next token is not an identifier, then it is
5923 definitely not a type-name or namespace-name. */
5926 /* If the following token is neither a `<' (to begin a
5927 template-id), nor a `::', then we are not looking at a
5928 nested-name-specifier. */
5934 {
5938 }
5941 && !cp_parser_nth_token_starts_template_argument_list_p
5944 }
5946 /* The nested-name-specifier is optional, so we parse
5947 tentatively. */
5950 /* Look for the optional `template' keyword, if this isn't the
5951 first time through the loop. */
5954 else
5957 /* Save the old scope since the name lookup we are about to do
5958 might destroy it. */
5961 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5962 look up names in "X<T>::I" in order to determine that "Y" is
5963 a template. So, if we have a typename at this point, we make
5964 an effort to look through it. */
5966 && !typename_keyword_p
5971 /* Parse the qualifying entity. */
5972 new_scope
5974 typename_keyword_p,
5975 template_keyword_p,
5976 check_dependency_p,
5977 type_p,
5978 is_declaration);
5979 /* Look for the `::' token. */
5982 /* If we found what we wanted, we keep going; otherwise, we're
5983 done. */
5985 {
5988 /* Restore the OLD_SCOPE since it was valid before the
5989 failed attempt at finding the last
5990 class-or-namespace-name. */
5994 /* If the next token is a decltype, and the one after that is a
5995 `::', then the decltype has failed to resolve to a class or
5996 enumeration type. Give this error even when parsing
5997 tentatively since it can't possibly be valid--and we're going
5998 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5999 won't get another chance.*/
6003 {
6010 /* As below. */
6013 }
6017 {
6018 /* If we have a non-type template-id followed by ::, it can't
6019 possibly be valid. */
6024 {
6027 {
6033 }
6034 else
6035 {
6036 /* Variable template. */
6041 }
6048 /* As below. */
6052 }
6053 }
6057 /* If the next token is an identifier, and the one after
6058 that is a `::', then any valid interpretation would have
6059 found a class-or-namespace-name. */
6065 {
6068 {
6070 {
6071 tree decl;
6072 tree ambiguous_decls;
6075 none_type,
6084 decl);
6086 {
6087 // cp_parser_lookup_name has the same diagnostic,
6088 // thus make sure to emit it at most once.
6091 {
6096 }
6098 }
6099 else
6100 {
6102 cp_parser_name_lookup_error
6105 else
6106 cp_parser_name_lookup_error
6109 }
6110 }
6113 /* Treat this as a successful nested-name-specifier
6114 due to:
6116 [basic.lookup.qual]
6118 If the name found is not a class-name (clause
6119 _class_) or namespace-name (_namespace.def_), the
6120 program is ill-formed. */
6122 }
6124 }
6126 }
6127 /* We've found one valid nested-name-specifier. */
6129 /* Name lookup always gives us a DECL. */
6132 /* Uses of "template" must be followed by actual templates. */
6144 new_scope);
6145 /* If it is a class scope, try to complete it; we are about to
6146 be looking up names inside the class. */
6148 /* Since checking types for dependency can be expensive,
6149 avoid doing it if the type is already complete. */
6151 /* Do not try to complete dependent types. */
6153 {
6155 /* If it is a typedef to current class, use the current
6156 class instead, as the typedef won't have any names inside
6157 it yet. */
6161 }
6162 /* Make sure we look in the right scope the next time through
6163 the loop. */
6165 }
6167 /* If parsing tentatively, replace the sequence of tokens that makes
6168 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6169 token. That way, should we re-parse the token stream, we will
6170 not have to repeat the effort required to do the parse, nor will
6171 we issue duplicate error messages. */
6173 {
6177 /* Reset the contents of the START token. */
6179 /* Retrieve any deferred checks. Do not pop this access checks yet
6180 so the memory will not be reclaimed during token replacing below. */
6188 /* Purge all subsequent tokens. */
6190 }
6196 }
6198 /* Parse a nested-name-specifier. See
6199 cp_parser_nested_name_specifier_opt for details. This function
6200 behaves identically, except that it will an issue an error if no
6201 nested-name-specifier is present. */
6203 static tree
6209 {
6210 tree scope;
6212 /* Look for the nested-name-specifier. */
6214 typename_keyword_p,
6215 check_dependency_p,
6216 type_p,
6217 is_declaration);
6218 /* If it was not present, issue an error message. */
6220 {
6223 }
6226 }
6228 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6229 this is either a class-name or a namespace-name (which corresponds
6230 to the class-or-namespace-name production in the grammar). For
6231 C++0x, it can also be a type-name that refers to an enumeration
6232 type or a simple-template-id.
6234 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6235 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6236 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6237 TYPE_P is TRUE iff the next name should be taken as a class-name,
6238 even the same name is declared to be another entity in the same
6239 scope.
6241 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6242 specified by the class-or-namespace-name. If neither is found the
6243 ERROR_MARK_NODE is returned. */
6245 static tree
6252 {
6253 tree saved_scope;
6254 tree saved_qualifying_scope;
6255 tree saved_object_scope;
6256 tree scope;
6260 /* DR 743: decltype can appear in a nested-name-specifier. */
6262 {
6266 {
6269 }
6273 }
6275 /* Before we try to parse the class-name, we must save away the
6276 current PARSER->SCOPE since cp_parser_class_name will destroy
6277 it. */
6281 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6282 there is no need to look for a namespace-name. */
6283 only_class_p = template_keyword_p
6288 typename_keyword_p,
6289 template_keyword_p,
6291 check_dependency_p,
6293 is_declaration,
6296 /* If that didn't work, try for a namespace-name. */
6298 {
6299 /* Restore the saved scope. */
6303 /* If we are not looking at an identifier followed by the scope
6304 resolution operator, then this is not part of a
6305 nested-name-specifier. (Note that this function is only used
6306 to parse the components of a nested-name-specifier.) */
6311 }
6314 }
6316 /* Return true if we are looking at a compound-literal, false otherwise. */
6318 static bool
6320 {
6321 /* Consume the `('. */
6326 /* Skip tokens until the next token is a closing parenthesis.
6327 If we find the closing `)', and the next token is a `{', then
6328 we are looking at a compound-literal. */
6329 bool compound_literal_p
6334 /* Roll back the tokens we skipped. */
6338 }
6340 /* Parse a postfix-expression.
6342 postfix-expression:
6343 primary-expression
6344 postfix-expression [ expression ]
6345 postfix-expression ( expression-list [opt] )
6346 simple-type-specifier ( expression-list [opt] )
6347 typename :: [opt] nested-name-specifier identifier
6348 ( expression-list [opt] )
6349 typename :: [opt] nested-name-specifier template [opt] template-id
6350 ( expression-list [opt] )
6351 postfix-expression . template [opt] id-expression
6352 postfix-expression -> template [opt] id-expression
6353 postfix-expression . pseudo-destructor-name
6354 postfix-expression -> pseudo-destructor-name
6355 postfix-expression ++
6356 postfix-expression --
6357 dynamic_cast < type-id > ( expression )
6358 static_cast < type-id > ( expression )
6359 reinterpret_cast < type-id > ( expression )
6360 const_cast < type-id > ( expression )
6361 typeid ( expression )
6362 typeid ( type-id )
6364 GNU Extension:
6366 postfix-expression:
6367 ( type-id ) { initializer-list , [opt] }
6369 This extension is a GNU version of the C99 compound-literal
6370 construct. (The C99 grammar uses `type-name' instead of `type-id',
6371 but they are essentially the same concept.)
6373 If ADDRESS_P is true, the postfix expression is the operand of the
6374 `&' operator. CAST_P is true if this expression is the target of a
6375 cast.
6377 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6378 class member access expressions [expr.ref].
6380 Returns a representation of the expression. */
6382 static cp_expr
6386 {
6388 location_t loc;
6395 /* Peek at the next token. */
6400 /* Some of the productions are determined by keywords. */
6403 {
6408 {
6409 tree type;
6410 cp_expr expression;
6414 /* All of these can be handled in the same way from the point
6415 of view of parsing. Begin by consuming the token
6416 identifying the cast. */
6419 /* New types cannot be defined in the cast. */
6421 parser->type_definition_forbidden_message
6424 /* Look for the opening `<'. */
6426 /* Parse the type to which we are casting. */
6431 /* Look for the closing `>'. */
6433 /* Restore the old message. */
6436 bool saved_greater_than_is_operator_p
6440 /* And the expression which is being cast. */
6444 RT_CLOSE_PAREN);
6448 parser->greater_than_is_operator_p
6451 /* Only type conversions to integral or enumeration types
6452 can be used in constant-expressions. */
6455 {
6458 }
6461 {
6463 postfix_expression
6467 postfix_expression
6471 postfix_expression
6473 tf_warning_or_error);
6476 postfix_expression
6481 }
6483 /* Construct a location e.g. :
6484 reinterpret_cast <int *> (expr)
6485 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6486 ranging from the start of the "*_cast" token to the final closing
6487 paren, with the caret at the start. */
6490 }
6494 {
6495 tree type;
6499 /* Consume the `typeid' token. */
6501 /* Look for the `(' token. */
6503 /* Types cannot be defined in a `typeid' expression. */
6505 parser->type_definition_forbidden_message
6507 /* We can't be sure yet whether we're looking at a type-id or an
6508 expression. */
6510 /* Try a type-id first. */
6515 /* Look for the `)' token. Otherwise, we can't be sure that
6516 we're not looking at an expression: consider `typeid (int
6517 (3))', for example. */
6519 /* If all went well, simply lookup the type-id. */
6522 /* Otherwise, fall back to the expression variant. */
6523 else
6524 {
6525 tree expression;
6527 /* Look for an expression. */
6529 /* Compute its typeid. */
6531 /* Look for the `)' token. */
6533 }
6534 /* Restore the saved message. */
6536 /* `typeid' may not appear in an integral constant expression. */
6539 }
6543 {
6544 tree type;
6545 /* The syntax permitted here is the same permitted for an
6546 elaborated-type-specifier. */
6553 }
6557 {
6558 location_t cilk_spawn_loc
6563 {
6568 }
6570 {
6575 }
6576 else
6577 {
6578 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6581 }
6583 postfix_expression =
6587 {
6591 }
6593 {
6598 }
6599 else
6600 {
6603 postfix_expression);
6604 /* Build a location of the form:
6605 _Cilk_spawn expr
6606 ~~~~~~~~~~~~^~~~
6607 with caret at the expr, ranging from the start of the
6608 _Cilk_spawn token to the end of the expression. */
6609 location_t combined_loc =
6615 }
6617 }
6622 {
6625 tree p;
6632 {
6635 }
6641 {
6644 postfix_expression
6646 else
6647 {
6651 }
6657 tf_warning_or_error);
6658 else
6659 {
6663 }
6668 postfix_expression
6672 postfix_expression
6675 else
6676 {
6680 }
6685 }
6687 }
6690 {
6691 tree type;
6693 /* If the next thing is a simple-type-specifier, we may be
6694 looking at a functional cast. We could also be looking at
6695 an id-expression. So, we try the functional cast, and if
6696 that doesn't work we fall back to the primary-expression. */
6698 /* Look for the simple-type-specifier. */
6702 CP_PARSER_FLAGS_NONE);
6704 /* Parse the cast itself. */
6706 postfix_expression
6708 /* If that worked, we're done. */
6712 /* If the functional-cast didn't work out, try a
6713 compound-literal. */
6716 {
6721 /* Avoid calling cp_parser_type_id pointlessly, see comment
6722 in cp_parser_cast_expression about c++/29234. */
6725 else
6726 {
6727 /* Parse the type. */
6732 /* Look for the `)'. */
6734 }
6736 /* If things aren't going well, there's no need to
6737 keep going. */
6739 {
6741 /* Parse the brace-enclosed initializer list. */
6744 }
6745 /* If that worked, we're definitely looking at a
6746 compound-literal expression. */
6748 {
6749 /* Warn the user that a compound literal is not
6750 allowed in standard C++. */
6753 /* For simplicity, we disallow compound literals in
6754 constant-expressions. We could
6755 allow compound literals of integer type, whose
6756 initializer was a constant, in constant
6757 expressions. Permitting that usage, as a further
6758 extension, would not change the meaning of any
6759 currently accepted programs. (Of course, as
6760 compound literals are not part of ISO C++, the
6761 standard has nothing to say.) */
6763 NIC_NCC))
6764 {
6767 }
6768 /* Form the representation of the compound-literal. */
6769 postfix_expression
6771 tf_warning_or_error);
6774 }
6775 }
6777 /* It must be a primary-expression. */
6778 postfix_expression
6781 decltype_p,
6783 }
6785 }
6787 /* Note that we don't need to worry about calling build_cplus_new on a
6788 class-valued CALL_EXPR in decltype when it isn't the end of the
6789 postfix-expression; unary_complex_lvalue will take care of that for
6790 all these cases. */
6792 /* Keep looping until the postfix-expression is complete. */
6794 {
6798 /* It is not a Koenig lookup function call. */
6799 postfix_expression
6802 /* Peek at the next token. */
6806 {
6809 {
6811 "two consecutive %<[%> shall "
6814 }
6815 postfix_expression
6817 postfix_expression,
6819 decltype_p);
6828 /* postfix-expression ( expression-list [opt] ) */
6829 {
6840 is_builtin_constant_p
6843 {
6844 /* The whole point of __builtin_constant_p is to allow
6845 non-constant expressions to appear as arguments. */
6846 saved_integral_constant_expression_p
6848 saved_non_integral_constant_expression_p
6851 }
6852 args = (cp_parser_parenthesized_expression_list
6858 {
6859 parser->integral_constant_expression_p
6861 parser->non_integral_constant_expression_p
6863 }
6866 {
6869 }
6871 /* Function calls are not permitted in
6872 constant-expressions. */
6875 NIC_FUNC_CALL))
6876 {
6880 }
6885 {
6887 {
6889 {
6892 postfix_expression
6894 complain);
6895 }
6896 else
6897 postfix_expression
6899 }
6900 /* We do not perform argument-dependent lookup if
6901 normal lookup finds a non-function, in accordance
6902 with the expected resolution of DR 218. */
6905 {
6909 /* Do not do argument dependent lookup if regular
6910 lookup finds a member function or a block-scope
6911 function declaration. [basic.lookup.argdep]/3 */
6914 {
6917 postfix_expression
6919 complain);
6920 }
6921 }
6922 }
6928 {
6937 }
6941 {
6943 tree arg;
6951 {
6956 }
6960 }
6963 {
6973 {
6975 postfix_expression
6979 }
6982 {
6983 postfix_expression
6984 = (build_new_method_call
6990 complain));
6991 }
6992 else
6993 postfix_expression
6997 complain);
6998 }
7002 postfix_expression = (build_offset_ref_call_from_tree
7004 complain));
7006 /* A call to a static class member, or a namespace-scope
7007 function. */
7008 postfix_expression
7011 koenig_p,
7012 complain);
7013 else
7014 /* All other function calls. */
7015 postfix_expression
7018 koenig_p,
7019 complain);
7022 {
7024 start_loc,
7025 close_paren_loc);
7027 }
7029 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7033 }
7038 /* postfix-expression . template [opt] id-expression
7039 postfix-expression . pseudo-destructor-name
7040 postfix-expression -> template [opt] id-expression
7041 postfix-expression -> pseudo-destructor-name */
7043 /* Consume the `.' or `->' operator. */
7046 postfix_expression
7048 postfix_expression,
7055 /* postfix-expression ++ */
7056 /* Consume the `++' token. */
7058 /* Generate a representation for the complete expression. */
7059 postfix_expression
7061 POSTINCREMENT_EXPR);
7062 /* Increments may not appear in constant-expressions. */
7070 /* postfix-expression -- */
7071 /* Consume the `--' token. */
7073 /* Generate a representation for the complete expression. */
7074 postfix_expression
7076 POSTDECREMENT_EXPR);
7077 /* Decrements may not appear in constant-expressions. */
7088 return is_member_access
7089 ? postfix_expression
7091 else
7093 }
7094 }
7096 /* We should never get here. */
7099 }
7101 /* This function parses Cilk Plus array notations. If a normal array expr. is
7102 parsed then the array index is passed back to the caller through *INIT_INDEX
7103 and the function returns a NULL_TREE. If array notation expr. is parsed,
7104 then *INIT_INDEX is ignored by the caller and the function returns
7105 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7106 error_mark_node. */
7108 static tree
7110 tree array_value)
7111 {
7115 {
7118 }
7127 {
7130 }
7132 {
7133 /* Consume the ':'. */
7136 /* If we are here, then we have a case like this A[:]. */
7138 {
7142 }
7146 }
7147 else
7148 {
7149 /* If we are here, then there are three valid possibilities:
7150 1. ARRAY [ EXP ]
7151 2. ARRAY [ EXP : EXP ]
7152 3. ARRAY [ EXP : EXP : EXP ] */
7156 {
7157 /* This indicates that we have a normal array expression. */
7160 }
7162 /* Consume the ':'. */
7166 {
7169 }
7170 }
7175 {
7179 }
7185 }
7187 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7188 by cp_parser_builtin_offsetof. We're looking for
7190 postfix-expression [ expression ]
7191 postfix-expression [ braced-init-list ] (C++11)
7193 FOR_OFFSETOF is set if we're being called in that context, which
7194 changes how we deal with integer constant expressions. */
7196 static tree
7198 tree postfix_expression,
7201 {
7206 /* Consume the `[' token. */
7212 /* Parse the index expression. */
7213 /* ??? For offsetof, there is a question of what to allow here. If
7214 offsetof is not being used in an integral constant expression context,
7215 then we *could* get the right answer by computing the value at runtime.
7216 If we are in an integral constant expression context, then we might
7217 could accept any constant expression; hard to say without analysis.
7218 Rather than open the barn door too wide right away, allow only integer
7219 constant expressions here. */
7222 else
7223 {
7225 {
7232 {
7234 "braced list index is not allowed with array "
7238 }
7239 }
7241 {
7242 /* Here are have these two options:
7243 ARRAY[EXP : EXP] - Array notation expr with default
7244 stride of 1.
7245 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7246 stride. */
7248 postfix_expression);
7251 }
7252 else
7254 }
7258 /* Look for the closing `]'. */
7261 /* Build the ARRAY_REF. */
7265 /* When not doing offsetof, array references are not permitted in
7266 constant-expressions. */
7272 }
7274 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7275 by cp_parser_builtin_offsetof. We're looking for
7277 postfix-expression . template [opt] id-expression
7278 postfix-expression . pseudo-destructor-name
7279 postfix-expression -> template [opt] id-expression
7280 postfix-expression -> pseudo-destructor-name
7282 FOR_OFFSETOF is set if we're being called in that context. That sorta
7283 limits what of the above we'll actually accept, but nevermind.
7284 TOKEN_TYPE is the "." or "->" token, which will already have been
7285 removed from the stream. */
7287 static tree
7290 cp_expr postfix_expression,
7292 location_t location)
7293 {
7294 tree name;
7300 /* If this is a `->' operator, dereference the pointer. */
7303 tf_warning_or_error);
7304 /* Check to see whether or not the expression is type-dependent and
7305 not the current instantiation. */
7307 /* The identifier following the `->' or `.' is not qualified. */
7313 /* Enter the scope corresponding to the type of the object
7314 given by the POSTFIX_EXPRESSION. */
7316 {
7318 /* According to the standard, no expression should ever have
7319 reference type. Unfortunately, we do not currently match
7320 the standard in this respect in that our internal representation
7321 of an expression may have reference type even when the standard
7322 says it does not. Therefore, we have to manually obtain the
7323 underlying type here. */
7325 /* The type of the POSTFIX_EXPRESSION must be complete. */
7326 /* Unlike the object expression in other contexts, *this is not
7327 required to be of complete type for purposes of class member
7328 access (5.2.5) outside the member function body. */
7330 && !(processing_template_decl
7331 && current_class_type
7332 && (same_type_ignoring_top_level_qualifiers_p
7335 /* Let the name lookup machinery know that we are processing a
7336 class member access expression. */
7338 /* If something went wrong, we want to be able to discern that case,
7339 as opposed to the case where there was no SCOPE due to the type
7340 of expression being dependent. */
7343 /* If the SCOPE was erroneous, make the various semantic analysis
7344 functions exit quickly -- and without issuing additional error
7345 messages. */
7348 }
7349 else
7350 /* Tell cp_parser_lookup_name that there was an object, even though it's
7351 type-dependent. */
7354 /* Assume this expression is not a pseudo-destructor access. */
7357 /* If the SCOPE is a scalar type, then, if this is a valid program,
7358 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7359 is type dependent, it can be pseudo-destructor-name or something else.
7360 Try to parse it as pseudo-destructor-name first. */
7362 {
7363 tree s;
7364 tree type;
7367 /* Parse the pseudo-destructor-name. */
7376 {
7378 postfix_expression
7381 }
7382 }
7385 {
7386 /* If the SCOPE is not a scalar type, we are looking at an
7387 ordinary class member access expression, rather than a
7388 pseudo-destructor-name. */
7391 /* Parse the id-expression. */
7392 name = (cp_parser_id_expression
7399 /* In general, build a SCOPE_REF if the member name is qualified.
7400 However, if the name was not dependent and has already been
7401 resolved; there is no need to build the SCOPE_REF. For example;
7403 struct X { void f(); };
7404 template <typename T> void f(T* t) { t->X::f(); }
7406 Even though "t" is dependent, "X::f" is not and has been resolved
7407 to a BASELINK; there is no need to include scope information. */
7409 /* But we do need to remember that there was an explicit scope for
7410 virtual function calls. */
7414 /* If the name is a template-id that names a type, we will get a
7415 TYPE_DECL here. That is invalid code. */
7417 {
7420 }
7421 else
7422 {
7424 {
7426 {
7430 }
7431 else
7434 name,
7435 template_p);
7439 }
7441 adjust_result_of_qualified_name_lookup
7443 postfix_expression
7445 template_p,
7446 tf_warning_or_error);
7447 /* Build a location e.g.:
7448 ptr->access_expr
7449 ~~~^~~~~~~~~~~~~
7450 where the caret is at the deref token, ranging from
7451 the start of postfix_expression to the end of the access expr. */
7452 location_t end_loc
7454 location_t combined_loc
7457 }
7458 }
7460 /* We no longer need to look up names in the scope of the object on
7461 the left-hand side of the `.' or `->' operator. */
7464 /* Outside of offsetof, these operators may not appear in
7465 constant-expressions. */
7467 && (cp_parser_non_integral_constant_expression
7472 }
7474 /* Parse a parenthesized expression-list.
7476 expression-list:
7477 assignment-expression
7478 expression-list, assignment-expression
7480 attribute-list:
7481 expression-list
7482 identifier
7483 identifier, expression-list
7485 CAST_P is true if this expression is the target of a cast.
7487 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7488 argument pack.
7490 Returns a vector of trees. Each element is a representation of an
7491 assignment-expression. NULL is returned if the ( and or ) are
7492 missing. An empty, but allocated, vector is returned on no
7493 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7494 if we are parsing an attribute list for an attribute that wants a
7495 plain identifier argument, normal_attr for an attribute that wants
7496 an expression, or non_attr if we aren't parsing an attribute list. If
7497 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7498 not all of the expressions in the list were constant.
7499 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7500 will be written to with the location of the closing parenthesis. If
7501 an error occurs, it may or may not be written to. */
7510 {
7516 /* Assume all the expressions will be constant. */
7525 /* Within a parenthesized expression, a `>' token is always
7526 the greater-than operator. */
7527 saved_greater_than_is_operator_p
7531 /* Consume expressions until there are no more. */
7534 {
7535 tree expr;
7537 /* At the beginning of attribute lists, check to see if the
7538 next token is an identifier. */
7541 {
7544 /* Consume the identifier. */
7546 /* Save the identifier. */
7548 }
7549 else
7550 {
7553 /* Parse the next assignment-expression. */
7555 {
7556 /* A braced-init-list. */
7562 }
7564 {
7565 expr = (cp_parser_constant_expression
7570 }
7571 else
7573 cast_p);
7578 /* If we have an ellipsis, then this is an expression
7579 expansion. */
7582 {
7583 /* Consume the `...'. */
7586 /* Build the argument pack. */
7588 }
7590 /* Add it to the list. We add error_mark_node
7591 expressions to the list, so that we can still tell if
7592 the correct form for a parenthesized expression-list
7593 is found. That gives better errors. */
7598 }
7600 /* After the first item, attribute lists look the same as
7601 expression lists. */
7604 get_comma:;
7605 /* If the next token isn't a `,', then we are done. */
7609 /* Otherwise, consume the `,' and keep going. */
7611 }
7617 {
7620 skip_comma:;
7621 /* We try and resync to an unnested comma, as that will give the
7622 user better diagnostics. */
7630 {
7631 parser->greater_than_is_operator_p
7634 }
7635 }
7637 parser->greater_than_is_operator_p
7644 }
7646 /* Parse a pseudo-destructor-name.
7648 pseudo-destructor-name:
7649 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7650 :: [opt] nested-name-specifier template template-id :: ~ type-name
7651 :: [opt] nested-name-specifier [opt] ~ type-name
7653 If either of the first two productions is used, sets *SCOPE to the
7654 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7655 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7656 or ERROR_MARK_NODE if the parse fails. */
7658 static void
7660 tree object,
7663 {
7666 /* Handle ~auto. */
7670 {
7673 "%<~auto%> only available with "
7680 }
7682 /* Assume that things will not work out. */
7685 /* Look for the optional `::' operator. */
7687 /* Look for the optional nested-name-specifier. */
7688 nested_name_specifier_p
7695 /* Now, if we saw a nested-name-specifier, we might be doing the
7696 second production. */
7699 {
7700 /* Consume the `template' keyword. */
7702 /* Parse the template-id. */
7706 class_type,
7708 /* Look for the `::' token. */
7710 }
7711 /* If the next token is not a `~', then there might be some
7712 additional qualification. */
7714 {
7715 /* At this point, we're looking for "type-name :: ~". The type-name
7716 must not be a class-name, since this is a pseudo-destructor. So,
7717 it must be either an enum-name, or a typedef-name -- both of which
7718 are just identifiers. So, we peek ahead to check that the "::"
7719 and "~" tokens are present; if they are not, then we can avoid
7720 calling type_name. */
7724 {
7727 }
7729 /* Look for the type-name. */
7734 /* Look for the `::' token. */
7736 }
7737 else
7740 /* Look for the `~'. */
7743 /* Once we see the ~, this has to be a pseudo-destructor. */
7747 /* Look for the type-name again. We are not responsible for
7748 checking that it matches the first type-name. */
7750 }
7752 /* Parse a unary-expression.
7754 unary-expression:
7755 postfix-expression
7756 ++ cast-expression
7757 -- cast-expression
7758 unary-operator cast-expression
7759 sizeof unary-expression
7760 sizeof ( type-id )
7761 alignof ( type-id ) [C++0x]
7762 new-expression
7763 delete-expression
7765 GNU Extensions:
7767 unary-expression:
7768 __extension__ cast-expression
7769 __alignof__ unary-expression
7770 __alignof__ ( type-id )
7771 alignof unary-expression [C++0x]
7772 __real__ cast-expression
7773 __imag__ cast-expression
7774 && identifier
7775 sizeof ( type-id ) { initializer-list , [opt] }
7776 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7777 __alignof__ ( type-id ) { initializer-list , [opt] }
7779 ADDRESS_P is true iff the unary-expression is appearing as the
7780 operand of the `&' operator. CAST_P is true if this expression is
7781 the target of a cast.
7783 Returns a representation of the expression. */
7785 static cp_expr
7788 {
7792 /* Peek at the next token. */
7794 /* Some keywords give away the kind of expression. */
7796 {
7800 {
7803 {
7806 location_t first_loc;
7809 /* Consume the token. */
7812 /* Parse the operand. */
7817 else
7818 {
7819 /* ISO C++ defines alignof only with types, not with
7820 expressions. So pedwarn if alignof is used with a non-
7821 type expression. However, __alignof__ is ok. */
7824 "ISO C++ does not allow %<alignof%> "
7828 }
7829 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7830 SIZEOF_EXPR with the original operand. */
7832 {
7834 {
7836 {
7839 error_mark_node));
7841 }
7842 else
7846 }
7848 }
7850 }
7859 {
7860 /* The saved value of the PEDANTIC flag. */
7862 tree expr;
7864 /* Save away the PEDANTIC flag. */
7866 /* Parse the cast-expression. */
7868 /* Restore the PEDANTIC flag. */
7872 }
7876 {
7877 tree expression;
7879 /* Consume the `__real__' or `__imag__' token. */
7881 /* Parse the cast-expression. */
7883 /* Create the complete representation. */
7887 expression,
7888 tf_warning_or_error);
7889 }
7897 {
7898 tree expr;
7908 parser->type_definition_forbidden_message
7911 saved_integral_constant_expression_p
7913 saved_non_integral_constant_expression_p
7917 saved_greater_than_is_operator_p
7929 parser->greater_than_is_operator_p
7932 parser->integral_constant_expression_p
7934 parser->non_integral_constant_expression_p
7941 }
7945 }
7946 }
7948 /* Look for the `:: new' and `:: delete', which also signal the
7949 beginning of a new-expression, or delete-expression,
7950 respectively. If the next token is `::', then it might be one of
7951 these. */
7953 {
7956 /* See if the token after the `::' is one of the keywords in
7957 which we're interested. */
7959 /* If it's `new', we have a new-expression. */
7962 /* Similarly, for `delete'. */
7965 }
7967 /* Look for a unary operator. */
7969 /* The `++' and `--' operators can be handled similarly, even though
7970 they are not technically unary-operators in the grammar. */
7972 {
7977 /* Handle the GNU address-of-label extension. */
7980 {
7981 tree identifier;
7982 tree expression;
7985 /* Consume the '&&' token. */
7987 /* Look for the identifier. */
7988 location_t finish_loc
7991 /* Construct a location of the form:
7992 &&label
7993 ^~~~~~~
7994 with caret==start at the "&&", finish at the end of the label. */
7995 location_t combined_loc
7997 /* Create an expression representing the address. */
8000 NIC_ADDR_LABEL))
8003 }
8004 }
8006 {
8007 cp_expr cast_expression;
8013 /* Consume the operator token. */
8017 /* Parse the cast-expression. */
8018 cast_expression
8023 pidk);
8025 /* Make a location:
8026 OP_TOKEN CAST_EXPRESSION
8027 ^~~~~~~~~~~~~~~~~~~~~~~~~
8028 with start==caret at the operator token, and
8029 extending to the end of the cast_expression. */
8032 /* Now, build an appropriate representation. */
8034 {
8038 RO_UNARY_STAR,
8039 complain);
8040 /* TODO: build_x_indirect_ref does not always honor the
8041 location, so ensure it is set. */
8047 /* Fall through. */
8050 cast_expression,
8051 complain);
8052 /* TODO: build_x_unary_op does not always honor the location,
8053 so ensure it is set. */
8061 /* Fall through. */
8063 /* Immediately fold negation of a constant, unless the constant is 0
8064 (since -0 == 0) or it would overflow. */
8069 {
8072 cast_expression);
8074 {
8077 }
8078 }
8079 /* Fall through. */
8088 }
8092 non_constant_p))
8096 }
8100 decltype_p,
8101 pidk);
8102 }
8104 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8105 unary-operator, the corresponding tree code is returned. */
8107 static enum tree_code
8109 {
8111 {
8132 }
8133 }
8135 /* Parse a new-expression.
8137 new-expression:
8138 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8139 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8141 Returns a representation of the expression. */
8143 static tree
8145 {
8148 tree type;
8151 tree ret;
8155 /* Look for the optional `::' operator. */
8156 global_scope_p
8160 /* Look for the `new' operator. */
8162 /* There's no easy way to tell a new-placement from the
8163 `( type-id )' construct. */
8165 /* Look for a new-placement. */
8167 /* If that didn't work out, there's no new-placement. */
8169 {
8173 }
8175 /* If the next token is a `(', then we have a parenthesized
8176 type-id. */
8178 {
8182 /* Consume the `('. */
8185 /* Parse the type-id. */
8186 parser->type_definition_forbidden_message
8188 {
8191 }
8194 /* Look for the closing `)'. */
8197 /* There should not be a direct-new-declarator in this production,
8198 but GCC used to allowed this, so we check and emit a sensible error
8199 message for this case. */
8201 {
8207 }
8208 }
8209 /* Otherwise, there must be a new-type-id. */
8210 else
8213 /* If the next token is a `(' or '{', then we have a new-initializer. */
8218 else
8221 /* A new-expression may not appear in an integral constant
8222 expression. */
8225 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8226 of a new-type-id or type-id of a new-expression, the new-expression shall
8227 contain a new-initializer of the form ( assignment-expression )".
8228 Additionally, consistently with the spirit of DR 1467, we want to accept
8229 'new auto { 2 }' too. */
8234 {
8236 "initialization of new-expression for type %<auto%> "
8239 }
8240 else
8241 {
8242 /* Construct a location e.g.:
8243 ptr = new int[100]
8244 ^~~~~~~~~~~~
8245 with caret == start at the start of the "new" token, and the end
8246 at the end of the final token we consumed. */
8251 /* Create a representation of the new-expression. */
8253 tf_warning_or_error);
8255 }
8263 }
8265 /* Parse a new-placement.
8267 new-placement:
8268 ( expression-list )
8270 Returns the same representation as for an expression-list. */
8274 {
8277 /* Parse the expression-list. */
8278 expression_list = (cp_parser_parenthesized_expression_list
8287 }
8289 /* Parse a new-type-id.
8291 new-type-id:
8292 type-specifier-seq new-declarator [opt]
8294 Returns the TYPE allocated. If the new-type-id indicates an array
8295 type, *NELTS is set to the number of elements in the last array
8296 bound; the TYPE will not include the last array bound. */
8298 static tree
8300 {
8301 cp_decl_specifier_seq type_specifier_seq;
8307 /* The type-specifier sequence must not contain type definitions.
8308 (It cannot contain declarations of new types either, but if they
8309 are not definitions we will catch that because they are not
8310 complete.) */
8312 parser->type_definition_forbidden_message
8314 /* Parse the type-specifier-seq. */
8318 /* Restore the old message. */
8324 /* Parse the new-declarator. */
8327 /* Determine the number of elements in the last array dimension, if
8328 any. */
8330 /* Skip down to the last array dimension. */
8335 {
8338 }
8343 {
8346 }
8349 {
8356 else
8358 }
8361 }
8363 /* Parse an (optional) new-declarator.
8365 new-declarator:
8366 ptr-operator new-declarator [opt]
8367 direct-new-declarator
8369 Returns the declarator. */
8373 {
8376 cp_cv_quals cv_quals;
8378 /* We don't know if there's a ptr-operator next, or not. */
8380 /* Look for a ptr-operator. */
8382 /* If that worked, look for more new-declarators. */
8384 {
8387 /* Parse another optional declarator. */
8390 declarator = cp_parser_make_indirect_declarator
8394 }
8396 /* If the next token is a `[', there is a direct-new-declarator. */
8401 }
8403 /* Parse a direct-new-declarator.
8405 direct-new-declarator:
8406 [ expression ]
8407 direct-new-declarator [constant-expression]
8409 */
8413 {
8417 {
8418 tree expression;
8421 /* Look for the opening `['. */
8426 /* The standard requires that the expression have integral
8427 type. DR 74 adds enumeration types. We believe that the
8428 real intent is that these expressions be handled like the
8429 expression in a `switch' condition, which also allows
8430 classes with a single conversion to integral or
8431 enumeration type. */
8433 {
8434 expression
8436 expression,
8439 {
8441 "expression in new-declarator must have integral "
8444 }
8445 }
8447 /* Look for the closing `]'. */
8450 /* Add this bound to the declarator. */
8453 /* If the next token is not a `[', then there are no more
8454 bounds. */
8457 }
8460 }
8462 /* Parse a new-initializer.
8464 new-initializer:
8465 ( expression-list [opt] )
8466 braced-init-list
8468 Returns a representation of the expression-list. */
8472 {
8476 {
8477 tree t;
8484 }
8485 else
8486 expression_list = (cp_parser_parenthesized_expression_list
8492 }
8494 /* Parse a delete-expression.
8496 delete-expression:
8497 :: [opt] delete cast-expression
8498 :: [opt] delete [ ] cast-expression
8500 Returns a representation of the expression. */
8502 static tree
8504 {
8507 tree expression;
8509 /* Look for the optional `::' operator. */
8510 global_scope_p
8514 /* Look for the `delete' keyword. */
8516 /* See if the array syntax is in use. */
8518 {
8519 /* Consume the `[' token. */
8521 /* Look for the `]' token. */
8523 /* Remember that this is the `[]' construct. */
8525 }
8526 else
8529 /* Parse the cast-expression. */
8532 /* A delete-expression may not appear in an integral constant
8533 expression. */
8538 tf_warning_or_error);
8539 }
8541 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8542 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8543 0 otherwise. */
8545 static int
8547 {
8550 {
8592 /* In ((type ()) () the last () isn't a valid cast-expression,
8593 so the whole must be parsed as postfix-expression. */
8598 /* '[' may start a primary-expression in obj-c++ and in C++11,
8599 as a lambda-expression, eg, '(void)[]{}'. */
8606 /* '++' and '--' may or may not start a cast-expression:
8608 struct T { void operator++(int); };
8609 void f() { (T())++; }
8611 vs
8613 int a;
8614 (int)++a; */
8619 }
8620 }
8622 /* Parse a cast-expression.
8624 cast-expression:
8625 unary-expression
8626 ( type-id ) cast-expression
8628 ADDRESS_P is true iff the unary-expression is appearing as the
8629 operand of the `&' operator. CAST_P is true if this expression is
8630 the target of a cast.
8632 Returns a representation of the expression. */
8634 static cp_expr
8637 {
8638 /* If it's a `(', then we might be looking at a cast. */
8640 {
8646 /* There's no way to know yet whether or not this is a cast.
8647 For example, `(int (3))' is a unary-expression, while `(int)
8648 3' is a cast. So, we resort to parsing tentatively. */
8650 /* Types may not be defined in a cast. */
8652 parser->type_definition_forbidden_message
8654 /* Consume the `('. */
8658 /* A very tricky bit is that `(struct S) { 3 }' is a
8659 compound-literal (which we permit in C++ as an extension).
8660 But, that construct is not a cast-expression -- it is a
8661 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8662 is legal; if the compound-literal were a cast-expression,
8663 you'd need an extra set of parentheses.) But, if we parse
8664 the type-id, and it happens to be a class-specifier, then we
8665 will commit to the parse at that point, because we cannot
8666 undo the action that is done when creating a new class. So,
8667 then we cannot back up and do a postfix-expression.
8669 Another tricky case is the following (c++/29234):
8671 struct S { void operator () (); };
8673 void foo ()
8674 {
8675 ( S()() );
8676 }
8678 As a type-id we parse the parenthesized S()() as a function
8679 returning a function, groktypename complains and we cannot
8680 back up in this case either.
8682 Therefore, we scan ahead to the closing `)', and check to see
8683 if the tokens after the `)' can start a cast-expression. Otherwise
8684 we are dealing with an unary-expression, a postfix-expression
8685 or something else.
8687 Yet another tricky case, in C++11, is the following (c++/54891):
8689 (void)[]{};
8691 The issue is that usually, besides the case of lambda-expressions,
8692 the parenthesized type-id cannot be followed by '[', and, eg, we
8693 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8694 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8695 we don't commit, we try a cast-expression, then an unary-expression.
8697 Save tokens so that we can put them back. */
8700 /* We may be looking at a cast-expression. */
8703 cast_expression
8706 /* Roll back the tokens we skipped. */
8708 /* If we aren't looking at a cast-expression, simulate an error so
8709 that the call to cp_parser_error_occurred below returns true. */
8712 else
8713 {
8716 /* Look for the type-id. */
8718 /* Look for the closing `)'. */
8721 }
8723 /* Restore the saved message. */
8726 /* At this point this can only be either a cast or a
8727 parenthesized ctor such as `(T ())' that looks like a cast to
8728 function returning T. */
8730 {
8731 /* Only commit if the cast-expression doesn't start with
8732 '++', '--', or '[' in C++11. */
8740 pidk);
8743 {
8744 /* Warn about old-style casts, if so requested. */
8751 /* Only type conversions to integral or enumeration types
8752 can be used in constant-expressions. */
8755 NIC_CAST))
8758 /* Perform the cast. */
8759 /* Make a location:
8760 (TYPE) EXPR
8761 ^~~~~~~~~~~
8762 with start==caret at the open paren, extending to the
8763 end of "expr". */
8765 open_paren_loc,
8769 }
8770 }
8771 else
8773 }
8775 /* If we get here, then it's not a cast, so it must be a
8776 unary-expression. */
8779 }
8781 /* Parse a binary expression of the general form:
8783 pm-expression:
8784 cast-expression
8785 pm-expression .* cast-expression
8786 pm-expression ->* cast-expression
8788 multiplicative-expression:
8789 pm-expression
8790 multiplicative-expression * pm-expression
8791 multiplicative-expression / pm-expression
8792 multiplicative-expression % pm-expression
8794 additive-expression:
8795 multiplicative-expression
8796 additive-expression + multiplicative-expression
8797 additive-expression - multiplicative-expression
8799 shift-expression:
8800 additive-expression
8801 shift-expression << additive-expression
8802 shift-expression >> additive-expression
8804 relational-expression:
8805 shift-expression
8806 relational-expression < shift-expression
8807 relational-expression > shift-expression
8808 relational-expression <= shift-expression
8809 relational-expression >= shift-expression
8811 GNU Extension:
8813 relational-expression:
8814 relational-expression <? shift-expression
8815 relational-expression >? shift-expression
8817 equality-expression:
8818 relational-expression
8819 equality-expression == relational-expression
8820 equality-expression != relational-expression
8822 and-expression:
8823 equality-expression
8824 and-expression & equality-expression
8826 exclusive-or-expression:
8827 and-expression
8828 exclusive-or-expression ^ and-expression
8830 inclusive-or-expression:
8831 exclusive-or-expression
8832 inclusive-or-expression | exclusive-or-expression
8834 logical-and-expression:
8835 inclusive-or-expression
8836 logical-and-expression && inclusive-or-expression
8838 logical-or-expression:
8839 logical-and-expression
8840 logical-or-expression || logical-and-expression
8842 All these are implemented with a single function like:
8844 binary-expression:
8845 simple-cast-expression
8846 binary-expression <token> binary-expression
8848 CAST_P is true if this expression is the target of a cast.
8850 The binops_by_token map is used to get the tree codes for each <token> type.
8851 binary-expressions are associated according to a precedence table. */
8853 #define TOKEN_PRECEDENCE(token) \
8854 (((token->type == CPP_GREATER \
8855 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8856 && !parser->greater_than_is_operator_p) \
8857 ? PREC_NOT_OPERATOR \
8858 : binops_by_token[token->type].prec)
8860 static cp_expr
8866 {
8867 cp_parser_expression_stack stack;
8869 cp_parser_expression_stack_entry current;
8870 cp_expr rhs;
8874 tree overload;
8876 /* Parse the first expression. */
8887 {
8888 /* Get an operator token. */
8894 {
8896 "%<>>%> operator is treated"
8900 }
8905 /* This is a fold-expression; handle it later. */
8908 /* Popping an entry off the stack means we completed a subexpression:
8909 - either we found a token which is not an operator (`>' where it is not
8910 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8911 will happen repeatedly;
8912 - or, we found an operator which has lower priority. This is the case
8913 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8914 parsing `3 * 4'. */
8916 {
8919 else
8921 }
8923 get_rhs:
8927 /* We used the operator token. */
8930 /* For "false && x" or "true || x", x will never be executed;
8931 disable warnings while evaluating it. */
8933 c_inhibit_evaluation_warnings +=
8936 c_inhibit_evaluation_warnings +=
8939 /* Extract another operand. It may be the RHS of this expression
8940 or the LHS of a new, higher priority expression. */
8945 /* Get another operator token. Look up its precedence to avoid
8946 building a useless (immediately popped) stack entry for common
8947 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8954 {
8955 /* ... and prepare to parse the RHS of the new, higher priority
8956 expression. Since precedence levels on the stack are
8957 monotonically increasing, we do not have to care about
8958 stack overflows. */
8967 pop:
8969 /* If the stack is not empty, we have parsed into LHS the right side
8970 (`4' in the example above) of an expression we had suspended.
8971 We can use the information on the stack to recover the LHS (`3')
8972 from the stack together with the tree code (`MULT_EXPR'), and
8973 the precedence of the higher level subexpression
8974 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8975 which will be used to actually build the additive expression. */
8980 }
8982 /* Undo the disabling of warnings done above. */
8984 c_inhibit_evaluation_warnings -=
8987 c_inhibit_evaluation_warnings -=
8993 /* Avoid warning for !!x == y. */
8998 /* Avoid warning for !b == y where b is boolean. */
9002 /* Avoid warning for !!b == y where b is boolean. */
9015 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9016 ERROR_MARK for everything that is not a binary expression.
9017 This makes warn_about_parentheses miss some warnings that
9018 involve unary operators. For unary expressions we should
9019 pass the correct tree_code unless the unary expression was
9020 surrounded by parentheses.
9021 */
9028 == tcc_comparison
9031 else
9032 {
9037 /* TODO: build_x_binary_op doesn't always honor the location. */
9039 }
9042 /* If the binary operator required the use of an overloaded operator,
9043 then this expression cannot be an integral constant-expression.
9044 An overloaded operator can be used even if both operands are
9045 otherwise permissible in an integral constant-expression if at
9046 least one of the operands is of enumeration type. */
9050 NIC_OVERLOADED))
9052 }
9055 }
9057 static cp_expr
9062 {
9065 }
9067 /* Parse the `? expression : assignment-expression' part of a
9068 conditional-expression. The LOGICAL_OR_EXPR is the
9069 logical-or-expression that started the conditional-expression.
9070 Returns a representation of the entire conditional-expression.
9072 This routine is used by cp_parser_assignment_expression.
9074 ? expression : assignment-expression
9076 GNU Extensions:
9078 ? : assignment-expression */
9080 static tree
9082 {
9084 cp_expr assignment_expr;
9088 /* Consume the `?' token. */
9093 {
9096 /* Implicit true clause. */
9098 c_inhibit_evaluation_warnings +=
9101 }
9102 else
9103 {
9106 /* Parse the expression. */
9107 c_inhibit_evaluation_warnings +=
9110 c_inhibit_evaluation_warnings +=
9114 }
9116 /* The next token should be a `:'. */
9118 /* Parse the assignment-expression. */
9120 c_inhibit_evaluation_warnings -=
9123 /* Make a location:
9124 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9125 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9126 with the caret at the "?", ranging from the start of
9127 the logical_or_expr to the end of the assignment_expr. */
9132 /* Build the conditional-expression. */
9134 expr,
9135 assignment_expr,
9136 tf_warning_or_error);
9137 }
9139 /* Parse an assignment-expression.
9141 assignment-expression:
9142 conditional-expression
9143 logical-or-expression assignment-operator assignment_expression
9144 throw-expression
9146 CAST_P is true if this expression is the target of a cast.
9147 DECLTYPE_P is true if this expression is the operand of decltype.
9149 Returns a representation for the expression. */
9151 static cp_expr
9154 {
9155 cp_expr expr;
9157 /* If the next token is the `throw' keyword, then we're looking at
9158 a throw-expression. */
9161 /* Otherwise, it must be that we are looking at a
9162 logical-or-expression. */
9163 else
9164 {
9165 /* Parse the binary expressions (logical-or-expression). */
9167 decltype_p,
9169 /* If the next token is a `?' then we're actually looking at a
9170 conditional-expression. */
9173 else
9174 {
9177 /* If it's an assignment-operator, we're using the second
9178 production. */
9179 enum tree_code assignment_operator
9182 {
9185 /* Parse the right-hand side of the assignment. */
9192 /* An assignment may not appear in a
9193 constant-expression. */
9195 NIC_ASSIGNMENT))
9197 /* Build the assignment expression. Its default
9198 location:
9199 LHS = RHS
9200 ~~~~^~~~~
9201 is the location of the '=' token as the
9202 caret, ranging from the start of the lhs to the
9203 end of the rhs. */
9208 assignment_operator,
9209 rhs,
9211 /* TODO: build_x_modify_expr doesn't honor the location,
9212 so we must set it here. */
9214 }
9215 }
9216 }
9219 }
9221 /* Parse an (optional) assignment-operator.
9223 assignment-operator: one of
9224 = *= /= %= += -= >>= <<= &= ^= |=
9226 GNU Extension:
9228 assignment-operator: one of
9229 <?= >?=
9231 If the next token is an assignment operator, the corresponding tree
9232 code is returned, and the token is consumed. For example, for
9233 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9234 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9235 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9236 operator, ERROR_MARK is returned. */
9238 static enum tree_code
9240 {
9244 /* Peek at the next token. */
9248 {
9294 /* Nothing else is an assignment operator. */
9296 }
9298 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9303 /* If it was an assignment operator, consume it. */
9308 }
9310 /* Parse an expression.
9312 expression:
9313 assignment-expression
9314 expression , assignment-expression
9316 CAST_P is true if this expression is the target of a cast.
9317 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9318 except possibly parenthesized or on the RHS of a comma (N3276).
9320 Returns a representation of the expression. */
9322 static cp_expr
9325 {
9330 {
9331 cp_expr assignment_expression;
9333 /* Parse the next assignment-expression. */
9334 assignment_expression
9337 /* We don't create a temporary for a call that is the immediate operand
9338 of decltype or on the RHS of a comma. But when we see a comma, we
9339 need to create a temporary for a call on the LHS. */
9344 assignment_expression
9348 /* If this is the first assignment-expression, we can just
9349 save it away. */
9352 else
9353 {
9354 /* Create a location with caret at the comma, ranging
9355 from the start of the LHS to the end of the RHS. */
9360 assignment_expression,
9363 }
9364 /* If the next token is not a comma, or we're in a fold-expression, then
9365 we are done with the expression. */
9369 /* Consume the `,'. */
9372 /* A comma operator cannot appear in a constant-expression. */
9375 }
9378 }
9380 /* Parse a constant-expression.
9382 constant-expression:
9383 conditional-expression
9385 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9386 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9387 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9388 is false, NON_CONSTANT_P should be NULL. */
9390 static cp_expr
9394 {
9398 cp_expr expression;
9400 /* It might seem that we could simply parse the
9401 conditional-expression, and then check to see if it were
9402 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9403 one that the compiler can figure out is constant, possibly after
9404 doing some simplifications or optimizations. The standard has a
9405 precise definition of constant-expression, and we must honor
9406 that, even though it is somewhat more restrictive.
9408 For example:
9410 int i[(2, 3)];
9412 is not a legal declaration, because `(2, 3)' is not a
9413 constant-expression. The `,' operator is forbidden in a
9414 constant-expression. However, GCC's constant-folding machinery
9415 will fold this operation to an INTEGER_CST for `3'. */
9417 /* Save the old settings. */
9419 saved_allow_non_integral_constant_expression_p
9422 /* We are now parsing a constant-expression. */
9424 parser->allow_non_integral_constant_expression_p
9427 /* Although the grammar says "conditional-expression", we parse an
9428 "assignment-expression", which also permits "throw-expression"
9429 and the use of assignment operators. In the case that
9430 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9431 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9432 actually essential that we look for an assignment-expression.
9433 For example, cp_parser_initializer_clauses uses this function to
9434 determine whether a particular assignment-expression is in fact
9435 constant. */
9437 /* Restore the old settings. */
9438 parser->integral_constant_expression_p
9440 parser->allow_non_integral_constant_expression_p
9443 {
9444 /* Require an rvalue constant expression here; that's what our
9445 callers expect. Reference constant expressions are handled
9446 separately in e.g. cp_parser_template_argument. */
9451 }
9454 parser->non_integral_constant_expression_p
9458 }
9460 /* Parse __builtin_offsetof.
9462 offsetof-expression:
9463 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9465 offsetof-member-designator:
9466 id-expression
9467 | offsetof-member-designator "." id-expression
9468 | offsetof-member-designator "[" expression "]"
9469 | offsetof-member-designator "->" id-expression */
9471 static cp_expr
9473 {
9475 tree type;
9476 cp_expr expr;
9477 cp_id_kind dummy;
9479 location_t finish_loc;
9481 /* We're about to accept non-integral-constant things, but will
9482 definitely yield an integral constant expression. Save and
9483 restore these values around our local parsing. */
9489 /* Consume the "__builtin_offsetof" token. */
9491 /* Consume the opening `('. */
9493 /* Parse the type-id. */
9496 /* Look for the `,'. */
9500 /* Build the (type *)null that begins the traditional offsetof macro. */
9502 tf_warning_or_error);
9504 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9508 {
9511 {
9513 /* offsetof-member-designator "[" expression "]" */
9519 /* offsetof-member-designator "->" identifier */
9522 /* FALLTHRU */
9525 /* offsetof-member-designator "." identifier */
9533 /* Consume the ")" token. */
9539 /* Error. We know the following require will fail, but
9540 that gives the proper error message. */
9545 }
9546 }
9548 success:
9549 /* Make a location of the form:
9550 __builtin_offsetof (struct s, f)
9551 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9552 with caret at the type-id, ranging from the start of the
9553 "_builtin_offsetof" token to the close paren. */
9555 /* The result will be an INTEGER_CST, so we need to explicitly
9556 preserve the location. */
9559 failure:
9564 }
9566 /* Parse a trait expression.
9568 Returns a representation of the expression, the underlying type
9569 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9571 static tree
9573 {
9574 cp_trait_kind kind;
9580 {
9671 }
9673 /* Consume the token. */
9678 {
9681 }
9687 {
9690 {
9693 }
9697 }
9699 {
9701 {
9705 {
9708 }
9712 }
9713 }
9717 /* Complete the trait expression, which may mean either processing
9718 the trait expr now or saving it for template instantiation. */
9720 {
9729 }
9730 }
9732 /* Lambdas that appear in variable initializer or default argument scope
9733 get that in their mangling, so we need to record it. We might as well
9734 use the count for function and namespace scopes as well. */
9738 {
9739 tree t;
9741 };
9744 static void
9746 {
9747 tree_int ti;
9749 /* Once we're inside a function, we ignore other scopes and just push
9750 the function again so that popping works properly. */
9757 {
9758 /* Don't reset the count if we're still in the same function. */
9761 }
9762 }
9764 static void
9766 {
9769 }
9771 static void
9773 {
9776 {
9779 }
9781 }
9783 /* Parse a lambda expression.
9785 lambda-expression:
9786 lambda-introducer lambda-declarator [opt] compound-statement
9788 Returns a representation of the expression. */
9790 static cp_expr
9792 {
9794 tree type;
9802 {
9804 {
9808 }
9810 }
9812 {
9814 {
9817 }
9819 }
9821 /* We may be in the middle of deferred access check. Disable
9822 it now. */
9833 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9836 /* Now that we've started the type, add the capture fields for any
9837 explicit captures. */
9840 {
9841 /* Inside the class, surrounding template-parameter-lists do not apply. */
9842 unsigned int saved_num_template_parameter_lists
9846 bool fully_implicit_function_template_p
9850 bool auto_is_implicit_function_template_parm_p
9861 /* By virtue of defining a local class, a lambda expression has access to
9862 the private variables of enclosing classes. */
9870 {
9875 }
9877 {
9880 }
9882 /* The capture list was built up in reverse order; fix that now. */
9894 parser->fully_implicit_function_template_p
9898 parser->auto_is_implicit_function_template_parm_p
9900 }
9902 /* This field is only used during parsing of the lambda. */
9905 /* This lambda shouldn't have any proxies left at this point. */
9907 /* And now that we're done, push proxies for an enclosing lambda. */
9912 else
9920 }
9922 /* Parse the beginning of a lambda expression.
9924 lambda-introducer:
9925 [ lambda-capture [opt] ]
9927 LAMBDA_EXPR is the current representation of the lambda expression. */
9929 static void
9931 {
9932 /* Need commas after the first capture. */
9935 /* Eat the leading `['. */
9938 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9946 {
9949 }
9952 {
9954 tree capture_id;
9955 tree capture_init_expr;
9959 enum capture_kind_type
9960 {
9961 BY_COPY,
9962 BY_REFERENCE
9963 };
9967 {
9970 }
9974 else
9977 /* Possibly capture `this'. */
9979 {
9989 explicit_init_p);
9991 }
9993 /* Possibly capture `*this'. */
9996 {
10007 explicit_init_p);
10009 }
10011 /* Remember whether we want to capture as a reference or not. */
10013 {
10016 }
10018 /* Get the identifier. */
10023 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10024 delimiters, but I modified this to stop on unnested ']' as well. It
10025 was already changed to stop on unnested '}', so the
10026 "closing_parenthesis" name is no more misleading with my change. */
10027 {
10033 }
10035 /* Find the initializer for this capture. */
10039 {
10041 /* An explicit initializer exists. */
10044 "lambda capture initializers "
10050 {
10053 }
10054 }
10055 else
10056 {
10059 /* Turn the identifier into an id-expression. */
10060 capture_init_expr
10065 {
10068 }
10072 {
10075 capture_init_expr);
10079 }
10082 {
10085 capture_init_expr))
10089 }
10091 capture_init_expr
10092 = finish_id_expression
10094 capture_init_expr,
10108 {
10111 }
10112 else
10114 }
10118 {
10123 capture_id);
10127 "capture of %qD redundant with by-reference capture "
10129 }
10132 capture_id,
10133 capture_init_expr,
10135 explicit_init_p);
10136 }
10139 }
10141 /* Parse the (optional) middle of a lambda expression.
10143 lambda-declarator:
10144 < template-parameter-list [opt] >
10145 ( parameter-declaration-clause [opt] )
10146 attribute-specifier [opt]
10147 decl-specifier-seq [opt]
10148 exception-specification [opt]
10149 lambda-return-type-clause [opt]
10151 LAMBDA_EXPR is the current representation of the lambda expression. */
10153 static bool
10155 {
10156 /* 5.1.1.4 of the standard says:
10157 If a lambda-expression does not include a lambda-declarator, it is as if
10158 the lambda-declarator were ().
10159 This means an empty parameter list, no attributes, and no exception
10160 specification. */
10166 cp_decl_specifier_seq lambda_specs;
10169 /* The template-parameter-list is optional, but must begin with
10170 an opening angle if present. */
10172 {
10175 "lambda templates are only available with "
10184 /* We just processed one more parameter list. */
10186 }
10188 /* The parameter-declaration-clause is optional (unless
10189 template-parameter-list was given), but must begin with an
10190 opening parenthesis if present. */
10192 {
10197 /* Parse parameters. */
10200 /* Default arguments shall not be specified in the
10201 parameter-declaration-clause of a lambda-declarator. */
10212 /* In the decl-specifier-seq of the lambda-declarator, each
10213 decl-specifier shall either be mutable or constexpr. */
10217 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10220 {
10225 }
10229 /* Parse optional exception specification. */
10232 /* Parse optional trailing return type. */
10234 {
10238 }
10240 /* The function parameters must be in scope all the way until after the
10241 trailing-return-type in case of decltype. */
10243 }
10247 /* Create the function call operator.
10249 Messing with declarators like this is no uglier than building up the
10250 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10251 other code. */
10252 {
10253 cp_decl_specifier_seq return_type_specs;
10255 tree fco;
10262 else
10263 /* Maybe we will deduce the return type later. */
10267 {
10271 else
10274 }
10279 sfk_none);
10284 VIRT_SPEC_UNSPECIFIED,
10285 REF_QUAL_NONE,
10286 tx_qual,
10287 exception_spec,
10293 declarator,
10294 attributes);
10296 {
10299 /* Give the object parameter a different name. */
10303 }
10305 {
10309 }
10318 }
10319 }
10321 /* Parse the body of a lambda expression, which is simply
10323 compound-statement
10325 but which requires special handling.
10326 LAMBDA_EXPR is the current representation of the lambda expression. */
10328 static void
10330 {
10335 else
10336 /* Still increment function_depth so that we don't GC in the
10337 middle of an expression. */
10341 /* Clear this in case we're in the middle of a default argument. */
10344 /* Finish the function call operator
10345 - class_specifier
10346 + late_parsing_for_member
10347 + function_definition_after_declarator
10348 + ctor_initializer_opt_and_function_body */
10349 {
10351 tree body;
10353 tree compound_stmt;
10354 tree cap;
10356 /* Let the front end know that we are going to be defining this
10357 function. */
10359 NULL_TREE,
10368 /* Push the proxies for any explicit captures. */
10375 /* 5.1.1.4 of the standard says:
10376 If a lambda-expression does not include a trailing-return-type, it
10377 is as if the trailing-return-type denotes the following type:
10378 * if the compound-statement is of the form
10379 { return attribute-specifier [opt] expression ; }
10380 the type of the returned expression after lvalue-to-rvalue
10381 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10382 (_conv.array_ 4.2), and function-to-pointer conversion
10383 (_conv.func_ 4.3);
10384 * otherwise, void. */
10386 /* In a lambda that has neither a lambda-return-type-clause
10387 nor a deducible form, errors should be reported for return statements
10388 in the body. Since we used void as the placeholder return type, parsing
10389 the body as usual will give such desired behavior. */
10393 {
10397 /* Parse tentatively in case there's more after the initial return
10398 statement. */
10409 {
10411 {
10416 }
10418 /* Will get error here if type not deduced yet. */
10422 }
10423 }
10426 {
10431 }
10435 out:
10439 /* Finish the function and generate code for it if necessary. */
10442 /* Only expand if the call op is not a template. */
10445 }
10451 else
10453 }
10455 /* Statements [gram.stmt.stmt] */
10457 /* Parse a statement.
10459 statement:
10460 labeled-statement
10461 expression-statement
10462 compound-statement
10463 selection-statement
10464 iteration-statement
10465 jump-statement
10466 declaration-statement
10467 try-block
10469 C++11:
10471 statement:
10472 labeled-statement
10473 attribute-specifier-seq (opt) expression-statement
10474 attribute-specifier-seq (opt) compound-statement
10475 attribute-specifier-seq (opt) selection-statement
10476 attribute-specifier-seq (opt) iteration-statement
10477 attribute-specifier-seq (opt) jump-statement
10478 declaration-statement
10479 attribute-specifier-seq (opt) try-block
10481 init-statement:
10482 expression-statement
10483 simple-declaration
10485 TM Extension:
10487 statement:
10488 atomic-statement
10490 IN_COMPOUND is true when the statement is nested inside a
10491 cp_parser_compound_statement; this matters for certain pragmas.
10493 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10494 is a (possibly labeled) if statement which is not enclosed in braces
10495 and has an else clause. This is used to implement -Wparentheses.
10497 CHAIN is a vector of if-else-if conditions. */
10499 static void
10502 {
10507 restart:
10510 /* There is no statement yet. */
10516 /* In obj-c++, seeing '[[' might be the either the beginning of
10517 c++11 attributes, or a nested objc-message-expression. So
10518 let's parse the c++11 attributes tentatively. */
10522 {
10525 }
10527 /* Peek at the next token. */
10529 /* Remember the location of the first token in the statement. */
10531 /* If this is a keyword, then that will often determine what kind of
10532 statement we have. */
10534 {
10538 {
10541 /* Looks like a labeled-statement with a case label.
10542 Parse the label, and then use tail recursion to parse
10543 the statement. */
10561 {
10566 }
10567 else
10581 {
10586 }
10587 else
10588 {
10592 }
10596 /* Objective-C++ exception-handling constructs. */
10610 /* This must be a namespace alias definition. */
10626 /* It might be a keyword like `int' that can start a
10627 declaration-statement. */
10629 }
10630 }
10632 {
10633 /* If the next token is a `:', then we are looking at a
10634 labeled-statement. */
10637 {
10638 /* Looks like a labeled-statement with an ordinary label.
10639 Parse the label, and then use tail recursion to parse
10640 the statement. */
10645 }
10646 }
10647 /* Anything that starts with a `{' must be a compound-statement. */
10650 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10651 a statement all its own. */
10653 {
10654 /* Only certain OpenMP pragmas are attached to statements, and thus
10655 are considered statements themselves. All others are not. In
10656 the context of a compound, accept the pragma as a "statement" and
10657 return so that we can check for a close brace. Otherwise we
10658 require a real statement and must go back and read one. */
10664 }
10666 {
10669 }
10671 /* Everything else must be a declaration-statement or an
10672 expression-statement. Try for the declaration-statement
10673 first, unless we are looking at a `;', in which case we know that
10674 we have an expression-statement. */
10676 {
10678 {
10680 {
10681 /* Attributes should be parsed as part of the the
10682 declaration, so let's un-parse them. */
10685 }
10688 /* Try to parse the declaration-statement. */
10690 /* If that worked, we're done. */
10693 }
10694 /* Look for an expression-statement instead. */
10697 /* Handle [[fallthrough]];. */
10699 {
10700 /* The next token after the fallthrough attribute is ';'. */
10702 {
10703 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10705 IFN_FALLTHROUGH,
10708 }
10709 else
10713 }
10714 }
10716 /* Set the line number for the statement. */
10720 /* Allow "[[fallthrough]];", but warn otherwise. */
10723 OPT_Wattributes,
10725 }
10727 /* Parse the label for a labeled-statement, i.e.
10729 identifier :
10730 case constant-expression :
10731 default :
10733 GNU Extension:
10734 case constant-expression ... constant-expression : statement
10736 When a label is parsed without errors, the label is added to the
10737 parse tree by the finish_* functions, so this function doesn't
10738 have to return the label. */
10740 static void
10742 {
10747 /* The next token should be an identifier. */
10751 {
10754 }
10756 /* Remember whether this case or a user-defined label is allowed to fall
10757 through to. */
10762 {
10764 {
10768 /* Consume the `case' token. */
10770 /* Parse the constant-expression. */
10777 {
10778 /* Consume the `...' token. */
10784 /* We don't need to emit warnings here, as the common code
10785 will do this for us. */
10786 }
10787 else
10791 {
10795 }
10796 else
10799 expr);
10800 }
10804 /* Consume the `default' token. */
10808 {
10812 }
10813 else
10818 /* Anything else must be an ordinary label. */
10823 }
10825 /* Require the `:' token. */
10828 /* An ordinary label may optionally be followed by attributes.
10829 However, this is only permitted if the attributes are then
10830 followed by a semicolon. This is because, for backward
10831 compatibility, when parsing
10832 lab: __attribute__ ((unused)) int i;
10833 we want the attribute to attach to "i", not "lab". */
10836 {
10837 tree attrs;
10844 ;
10845 else
10847 }
10853 }
10855 /* Parse an expression-statement.
10857 expression-statement:
10858 expression [opt] ;
10860 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10861 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10862 indicates whether this expression-statement is part of an
10863 expression statement. */
10865 static tree
10867 {
10872 /* There might be attribute fallthrough. */
10875 /* If the next token is a ';', then there is no expression
10876 statement. */
10878 {
10882 {
10885 }
10886 }
10888 /* Handle [[fallthrough]];. */
10890 {
10891 /* The next token after the fallthrough attribute is ';'. */
10893 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10896 else
10900 }
10902 /* Allow "[[fallthrough]];", but warn otherwise. */
10907 /* Give a helpful message for "A<T>::type t;" and the like. */
10910 {
10917 {
10918 /* A::A a; */
10923 }
10924 }
10926 /* Consume the final `;'. */
10931 /* This is the final expression statement of a statement
10932 expression. */
10938 }
10940 /* Parse a compound-statement.
10942 compound-statement:
10943 { statement-seq [opt] }
10945 GNU extension:
10947 compound-statement:
10948 { label-declaration-seq [opt] statement-seq [opt] }
10950 label-declaration-seq:
10951 label-declaration
10952 label-declaration-seq label-declaration
10954 Returns a tree representing the statement. */
10956 static tree
10959 {
10960 tree compound_stmt;
10962 /* Consume the `{'. */
10969 /* Begin the compound-statement. */
10971 /* If the next keyword is `__label__' we have a label declaration. */
10974 /* Parse an (optional) statement-seq. */
10976 /* Finish the compound-statement. */
10978 /* Consume the `}'. */
10982 }
10984 /* Parse an (optional) statement-seq.
10986 statement-seq:
10987 statement
10988 statement-seq [opt] statement */
10990 static void
10992 {
10993 /* Scan statements until there aren't any more. */
10995 {
10998 /* If we are looking at a `}', then we have run out of
10999 statements; the same is true if we have reached the end
11000 of file, or have stumbled upon a stray '@end'. */
11007 /* If we are in a compound statement and find 'else' then
11008 something went wrong. */
11010 {
11013 else
11014 {
11017 }
11018 }
11020 /* Parse the statement. */
11022 }
11023 }
11025 /* Return true if we're looking at (init; cond), false otherwise. */
11027 static bool
11029 {
11030 /* Save tokens so that we can put them back. */
11033 /* Look for ';' that is not nested in () or {}. */
11036 CPP_SEMICOLON,
11039 /* Roll back the tokens we skipped. */
11043 }
11045 /* Parse a selection-statement.
11047 selection-statement:
11048 if ( init-statement [opt] condition ) statement
11049 if ( init-statement [opt] condition ) statement else statement
11050 switch ( init-statement [opt] condition ) statement
11052 Returns the new IF_STMT or SWITCH_STMT.
11054 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11055 is a (possibly labeled) if statement which is not enclosed in
11056 braces and has an else clause. This is used to implement
11057 -Wparentheses.
11059 CHAIN is a vector of if-else-if conditions. This is used to implement
11060 -Wduplicated-cond. */
11062 static tree
11065 {
11068 token_indent_info guard_tinfo;
11073 /* Peek at the next token. */
11077 /* See what kind of keyword it is. */
11080 {
11083 {
11084 tree statement;
11085 tree condition;
11090 RID_CONSTEXPR))
11091 {
11097 }
11099 /* Look for the `('. */
11101 {
11104 }
11106 /* Begin the selection-statement. */
11108 {
11111 }
11112 else
11115 /* Parse the optional init-statement. */
11117 {
11118 tree decl;
11121 "init-statement in selection statements only available "
11124 }
11126 /* Parse the condition. */
11128 /* Look for the `)'. */
11134 {
11138 /* Add the condition. */
11145 /* Parse the then-clause. */
11149 /* Outside a template, the non-selected branch of a constexpr
11150 if is a 'discarded statement', i.e. unevaluated. */
11155 {
11158 }
11161 guard_tinfo);
11168 {
11172 }
11174 /* If the next token is `else', parse the else-clause. */
11176 RID_ELSE))
11177 {
11181 {
11184 }
11186 guard_tinfo
11188 /* Consume the `else' keyword. */
11191 {
11193 RID_IF)
11195 {
11196 /* We've got "if (COND) else if (COND2)". Start
11197 the condition chain and add COND as the first
11198 element. */
11202 {
11203 /* Wrap it in a NOP_EXPR so that we can set the
11204 location of the condition. */
11206 condition);
11209 }
11210 }
11212 RID_IF))
11213 {
11214 /* This is if-else without subsequent if. Zap the
11215 condition chain; we would have already warned at
11216 this point. */
11219 }
11220 }
11222 /* Parse the else-clause. */
11228 /* If we are currently parsing a then-clause, then
11229 IF_P will not be NULL. We set it to true to
11230 indicate that this if statement has an else clause.
11231 This may trigger the Wparentheses warning below
11232 when we get back up to the parent if statement. */
11237 {
11241 }
11242 }
11243 else
11244 {
11245 /* This if statement does not have an else clause. If
11246 NESTED_IF is true, then the then-clause has an if
11247 statement which does have an else clause. We warn
11248 about the potential ambiguity. */
11251 "suggest explicit braces to avoid ambiguous"
11254 {
11255 /* We don't need the condition chain anymore. */
11258 }
11259 }
11261 /* Now we're all done with the if-statement. */
11263 }
11264 else
11265 {
11269 /* Add the condition. */
11272 /* Parse the body of the switch-statement. */
11278 guard_tinfo);
11282 /* Now we're all done with the switch-statement. */
11284 }
11287 }
11293 }
11294 }
11296 /* Parse a condition.
11298 condition:
11299 expression
11300 type-specifier-seq declarator = initializer-clause
11301 type-specifier-seq declarator braced-init-list
11303 GNU Extension:
11305 condition:
11306 type-specifier-seq declarator asm-specification [opt]
11307 attributes [opt] = assignment-expression
11309 Returns the expression that should be tested. */
11311 static tree
11313 {
11314 cp_decl_specifier_seq type_specifiers;
11318 /* Try the declaration first. */
11320 /* New types are not allowed in the type-specifier-seq for a
11321 condition. */
11323 parser->type_definition_forbidden_message
11325 /* Parse the type-specifier-seq. */
11327 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11330 /* Restore the saved message. */
11332 /* If all is well, we might be looking at a declaration. */
11334 {
11335 tree decl;
11336 tree asm_specification;
11337 tree attributes;
11341 /* Parse the declarator. */
11347 /* Parse the attributes. */
11349 /* Parse the asm-specification. */
11351 /* If the next token is not an `=' or '{', then we might still be
11352 looking at an expression. For example:
11354 if (A(a).x)
11356 looks like a decl-specifier-seq and a declarator -- but then
11357 there is no `=', so this is an expression. */
11362 /* If we did see an `=' or '{', then we are looking at a declaration
11363 for sure. */
11365 {
11366 tree pushed_scope;
11370 /* Create the declaration. */
11376 /* Parse the initializer. */
11378 {
11382 }
11383 else
11384 {
11385 /* Consume the `='. */
11388 }
11392 /* Process the initializer. */
11395 asm_specification,
11396 flags);
11402 }
11403 }
11404 /* If we didn't even get past the declarator successfully, we are
11405 definitely not looking at a declaration. */
11406 else
11409 /* Otherwise, we are looking at an expression. */
11411 }
11413 /* Parses a for-statement or range-for-statement until the closing ')',
11414 not included. */
11416 static tree
11418 {
11422 /* Begin the for-statement. */
11425 /* Parse the initialization. */
11430 else
11432 }
11434 static tree
11436 {
11437 /* Normal for loop */
11440 tree stmt;
11443 /* The init-statement has already been parsed in
11444 cp_parser_init_statement, so no work is needed here. */
11447 /* If there's a condition, process it. */
11451 {
11455 }
11457 /* Look for the `;'. */
11460 /* If there's an expression, process it. */
11466 }
11468 /* Tries to parse a range-based for-statement:
11470 range-based-for:
11471 decl-specifier-seq declarator : expression
11473 The decl-specifier-seq declarator and the `:' are already parsed by
11474 cp_parser_init_statement. If processing_template_decl it returns a
11475 newly created RANGE_FOR_STMT; if not, it is converted to a
11476 regular FOR_STMT. */
11478 static tree
11481 {
11488 /* Get the range declaration momentarily out of the way so that
11489 the range expression doesn't clash with it. */
11491 {
11493 {
11495 /* For decomposition declaration get all of the corresponding
11496 declarations out of the way. */
11500 {
11506 {
11512 }
11513 }
11514 }
11516 {
11521 }
11522 }
11525 {
11528 }
11529 else
11532 /* Put the range declaration(s) back into scope. */
11534 {
11538 }
11540 /* If in template, STMT is converted to a normal for-statement
11541 at instantiation. If not, it is done just ahead. */
11543 {
11551 /* do_auto_deduction doesn't mess with template init-lists. */
11554 }
11555 else
11556 {
11560 }
11562 }
11564 /* Subroutine of cp_convert_range_for: given the initializer expression,
11565 builds up the range temporary. */
11567 static tree
11569 {
11572 /* Find out the type deduced by the declaration
11573 `auto &&__range = range_expr'. */
11578 /* Create the __range variable. */
11585 }
11587 /* Used by cp_parser_range_for in template context: we aren't going to
11588 do a full conversion yet, but we still need to resolve auto in the
11589 type of the for-range-declaration if present. This is basically
11590 a shortcut version of cp_convert_range_for. */
11592 static void
11594 {
11597 {
11600 iter_type = (cp_parser_perform_range_for_lookup
11603 {
11605 iter_type);
11607 tf_warning_or_error);
11610 }
11611 }
11612 }
11614 /* Converts a range-based for-statement into a normal
11615 for-statement, as per the definition.
11617 for (RANGE_DECL : RANGE_EXPR)
11618 BLOCK
11620 should be equivalent to:
11622 {
11623 auto &&__range = RANGE_EXPR;
11624 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11625 __begin != __end;
11626 ++__begin)
11627 {
11628 RANGE_DECL = *__begin;
11629 BLOCK
11630 }
11631 }
11633 If RANGE_EXPR is an array:
11634 BEGIN_EXPR = __range
11635 END_EXPR = __range + ARRAY_SIZE(__range)
11636 Else if RANGE_EXPR has a member 'begin' or 'end':
11637 BEGIN_EXPR = __range.begin()
11638 END_EXPR = __range.end()
11639 Else:
11640 BEGIN_EXPR = begin(__range)
11641 END_EXPR = end(__range);
11643 If __range has a member 'begin' but not 'end', or vice versa, we must
11644 still use the second alternative (it will surely fail, however).
11645 When calling begin()/end() in the third alternative we must use
11646 argument dependent lookup, but always considering 'std' as an associated
11647 namespace. */
11649 tree
11653 {
11659 /* If an error happened previously do nothing or else a lot of
11660 unhelpful errors would be issued. */
11662 else
11663 {
11664 tree range_temp;
11668 /* Can't bind a reference to an array of runtime bound. */
11670 else
11671 {
11676 LOOKUP_ONLYCONVERTING);
11678 }
11681 }
11683 /* The new for initialization statement. */
11691 LOOKUP_ONLYCONVERTING);
11702 LOOKUP_ONLYCONVERTING);
11706 /* The new for condition. */
11713 /* The new increment expression. */
11716 tf_warning_or_error);
11719 /* The declaration is initialized with *__begin inside the loop body. */
11722 tf_warning_or_error),
11724 LOOKUP_ONLYCONVERTING);
11729 }
11731 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11732 We need to solve both at the same time because the method used
11733 depends on the existence of members begin or end.
11734 Returns the type deduced for the iterator expression. */
11736 static tree
11738 {
11740 {
11743 }
11746 {
11751 }
11753 {
11754 /* If RANGE is an array, we will use pointer arithmetic. */
11757 range,
11761 }
11762 else
11763 {
11764 /* If it is not an array, we must do a bit of magic. */
11774 tf_warning_or_error);
11777 tf_warning_or_error);
11780 {
11781 /* Use the member functions. */
11784 else
11790 else
11793 }
11794 else
11795 {
11796 /* Use global functions with ADL. */
11803 tf_warning_or_error);
11805 tf_warning_or_error);
11807 tf_warning_or_error);
11809 tf_warning_or_error);
11812 }
11814 /* Last common checks. */
11816 {
11817 /* If one of the expressions is an error do no more checks. */
11820 }
11823 /* Can happen, when, eg, in a template context, Koenig lookup
11824 can't resolve begin/end (c++/58503). */
11826 else
11827 {
11829 /* The unqualified type of the __begin and __end temporaries should
11830 be the same, as required by the multiple auto declaration. */
11832 {
11839 /* P0184R0 allows __begin and __end to have different types,
11840 but make sure they are comparable so we can give a better
11842 else
11846 }
11848 }
11849 }
11850 }
11852 /* Helper function for cp_parser_perform_range_for_lookup.
11853 Builds a tree for RANGE.IDENTIFIER(). */
11855 static tree
11857 {
11870 tf_warning_or_error);
11873 }
11875 /* Parse an iteration-statement.
11877 iteration-statement:
11878 while ( condition ) statement
11879 do statement while ( expression ) ;
11880 for ( init-statement condition [opt] ; expression [opt] )
11881 statement
11883 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11885 static tree
11887 {
11890 tree statement;
11892 token_indent_info guard_tinfo;
11894 /* Peek at the next token. */
11901 /* Remember whether or not we are already within an iteration
11902 statement. */
11905 /* See what kind of keyword it is. */
11908 {
11910 {
11911 tree condition;
11913 /* Begin the while-statement. */
11915 /* Look for the `('. */
11917 /* Parse the condition. */
11920 /* Look for the `)'. */
11922 /* Parse the dependent statement. */
11926 /* We're done with the while-statement. */
11928 }
11932 {
11933 tree expression;
11935 /* Begin the do-statement. */
11937 /* Parse the body of the do-statement. */
11942 /* Look for the `while' keyword. */
11944 /* Look for the `('. */
11946 /* Parse the expression. */
11948 /* We're done with the do-statement. */
11950 /* Look for the `)'. */
11952 /* Look for the `;'. */
11954 }
11958 {
11959 /* Look for the `('. */
11964 /* Look for the `)'. */
11967 /* Parse the body of the for-statement. */
11972 /* We're done with the for-statement. */
11974 }
11981 }
11984 }
11986 /* Parse a init-statement or the declarator of a range-based-for.
11987 Returns true if a range-based-for declaration is seen.
11989 init-statement:
11990 expression-statement
11991 simple-declaration */
11993 static bool
11995 {
11996 /* If the next token is a `;', then we have an empty
11997 expression-statement. Grammatically, this is also a
11998 simple-declaration, but an invalid one, because it does not
11999 declare anything. Therefore, if we did not handle this case
12000 specially, we would issue an error message about an invalid
12001 declaration. */
12003 {
12007 /* A colon is used in range-based for. */
12010 /* We're going to speculatively look for a declaration, falling back
12011 to an expression, if necessary. */
12013 /* Parse the declaration. */
12016 decl);
12019 {
12020 /* It is a range-for, consume the ':' */
12024 {
12026 "range-based %<for%> loops only available with "
12029 }
12030 }
12031 else
12032 /* The ';' is not consumed yet because we told
12033 cp_parser_simple_declaration not to. */
12038 /* If the tentative parse failed, then we shall need to look for an
12039 expression-statement. */
12040 }
12041 /* If we are here, it is an expression-statement. */
12044 }
12046 /* Parse a jump-statement.
12048 jump-statement:
12049 break ;
12050 continue ;
12051 return expression [opt] ;
12052 return braced-init-list ;
12053 goto identifier ;
12055 GNU extension:
12057 jump-statement:
12058 goto * expression ;
12060 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12062 static tree
12064 {
12070 /* Peek at the next token. */
12075 /* See what kind of keyword it is. */
12078 {
12082 {
12102 }
12108 {
12115 /* Fall through. */
12125 }
12130 {
12131 tree expr;
12135 {
12139 }
12142 else
12143 /* If the next token is a `;', then there is no
12144 expression. */
12146 /* Build the return-statement. */
12149 else
12151 /* Look for the final `;'. */
12153 }
12159 {
12162 }
12164 /* Create the goto-statement. */
12166 {
12167 /* Issue a warning about this use of a GNU extension. */
12169 /* Consume the '*' token. */
12171 /* Parse the dependent expression. */
12173 }
12174 else
12176 /* Look for the final `;'. */
12183 }
12186 }
12188 /* Parse a declaration-statement.
12190 declaration-statement:
12191 block-declaration */
12193 static void
12195 {
12198 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12201 /* Parse the block-declaration. */
12204 /* Free any declarators allocated. */
12206 }
12208 /* Some dependent statements (like `if (cond) statement'), are
12209 implicitly in their own scope. In other words, if the statement is
12210 a single statement (as opposed to a compound-statement), it is
12211 none-the-less treated as if it were enclosed in braces. Any
12212 declarations appearing in the dependent statement are out of scope
12213 after control passes that point. This function parses a statement,
12214 but ensures that is in its own scope, even if it is not a
12215 compound-statement.
12217 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12218 is a (possibly labeled) if statement which is not enclosed in
12219 braces and has an else clause. This is used to implement
12220 -Wparentheses.
12222 CHAIN is a vector of if-else-if conditions. This is used to implement
12223 -Wduplicated-cond.
12225 Returns the new statement. */
12227 static tree
12231 {
12232 tree statement;
12234 token_indent_info body_tinfo
12240 /* Mark if () ; with a special NOP_EXPR. */
12242 {
12253 }
12254 /* if a compound is opened, we simply parse the statement directly. */
12257 /* If the token is not a `{', then we must take special action. */
12258 else
12259 {
12260 /* Create a compound-statement. */
12262 /* Parse the dependent-statement. */
12264 /* Finish the dummy compound-statement. */
12266 }
12268 token_indent_info next_tinfo
12272 /* Return the statement. */
12274 }
12276 /* For some dependent statements (like `while (cond) statement'), we
12277 have already created a scope. Therefore, even if the dependent
12278 statement is a compound-statement, we do not want to create another
12279 scope. */
12281 static void
12284 {
12285 /* If the token is a `{', then we must take special action. */
12287 {
12288 token_indent_info body_tinfo
12292 token_indent_info next_tinfo
12295 }
12296 else
12297 {
12298 /* Avoid calling cp_parser_compound_statement, so that we
12299 don't create a new scope. Do everything else by hand. */
12301 /* If the next keyword is `__label__' we have a label declaration. */
12304 /* Parse an (optional) statement-seq. */
12307 }
12308 }
12310 /* Declarations [gram.dcl.dcl] */
12312 /* Parse an optional declaration-sequence.
12314 declaration-seq:
12315 declaration
12316 declaration-seq declaration */
12318 static void
12320 {
12322 {
12333 {
12334 /* A declaration consisting of a single semicolon is
12335 invalid. Allow it unless we're being pedantic. */
12340 }
12342 /* If we're entering or exiting a region that's implicitly
12343 extern "C", modify the lang context appropriately. */
12345 {
12348 }
12350 {
12353 }
12356 {
12357 /* A top-level declaration can consist solely of a #pragma.
12358 A nested declaration cannot, so this is done here and not
12359 in cp_parser_declaration. (A #pragma at block scope is
12360 handled in cp_parser_statement.) */
12363 }
12365 /* Parse the declaration itself. */
12367 }
12368 }
12370 /* Parse a declaration.
12372 declaration:
12373 block-declaration
12374 function-definition
12375 template-declaration
12376 explicit-instantiation
12377 explicit-specialization
12378 linkage-specification
12379 namespace-definition
12381 C++17:
12382 deduction-guide
12384 GNU extension:
12386 declaration:
12387 __extension__ declaration */
12389 static void
12391 {
12392 cp_token token1;
12393 cp_token token2;
12398 /* Check for the `__extension__' keyword. */
12400 {
12401 /* Parse the qualified declaration. */
12403 /* Restore the PEDANTIC flag. */
12407 }
12409 /* Try to figure out what kind of declaration is present. */
12414 else
12415 {
12418 }
12420 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12423 /* If the next token is `extern' and the following token is a string
12424 literal, then we have a linkage specification. */
12428 /* If the next token is `template', then we have either a template
12429 declaration, an explicit instantiation, or an explicit
12430 specialization. */
12432 {
12433 /* `template <>' indicates a template specialization. */
12437 /* `template <' indicates a template declaration. */
12440 /* Anything else must be an explicit instantiation. */
12441 else
12443 }
12444 /* If the next token is `export', then we have a template
12445 declaration. */
12448 /* If the next token is `extern', 'static' or 'inline' and the one
12449 after that is `template', we have a GNU extended explicit
12450 instantiation directive. */
12457 /* If the next token is `namespace', check for a named or unnamed
12458 namespace definition. */
12467 /* An unnamed namespace definition. */
12471 /* An inline (associated) namespace definition. */
12475 /* Objective-C++ declaration/definition. */
12482 /* At this point we may have a template declared by a concept
12483 introduction. */
12488 else
12489 /* Try to parse a block-declaration, or a function-definition. */
12492 /* Free any declarators allocated. */
12494 }
12496 /* Parse a block-declaration.
12498 block-declaration:
12499 simple-declaration
12500 asm-definition
12501 namespace-alias-definition
12502 using-declaration
12503 using-directive
12505 GNU Extension:
12507 block-declaration:
12508 __extension__ block-declaration
12510 C++0x Extension:
12512 block-declaration:
12513 static_assert-declaration
12515 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12516 part of a declaration-statement. */
12518 static void
12521 {
12525 /* Check for the `__extension__' keyword. */
12527 {
12528 /* Parse the qualified declaration. */
12530 /* Restore the PEDANTIC flag. */
12534 }
12536 /* Peek at the next token to figure out which kind of declaration is
12537 present. */
12540 /* If the next keyword is `asm', we have an asm-definition. */
12542 {
12546 }
12547 /* If the next keyword is `namespace', we have a
12548 namespace-alias-definition. */
12551 /* If the next keyword is `using', we have a
12552 using-declaration, a using-directive, or an alias-declaration. */
12554 {
12559 /* If the token after `using' is `namespace', then we have a
12560 using-directive. */
12564 /* If the second token after 'using' is '=', then we have an
12565 alias-declaration. */
12571 /* Otherwise, it's a using-declaration. */
12572 else
12575 }
12576 /* If the next keyword is `__label__' we have a misplaced label
12577 declaration. */
12579 {
12583 /* If the next token is now a `;', consume it. */
12586 }
12587 /* If the next token is `static_assert' we have a static assertion. */
12590 /* Anything else must be a simple-declaration. */
12591 else
12594 }
12596 /* Parse a simple-declaration.
12598 simple-declaration:
12599 decl-specifier-seq [opt] init-declarator-list [opt] ;
12600 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12601 brace-or-equal-initializer ;
12603 init-declarator-list:
12604 init-declarator
12605 init-declarator-list , init-declarator
12607 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12608 function-definition as a simple-declaration.
12610 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12611 parsed declaration if it is an uninitialized single declarator not followed
12612 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12613 if present, will not be consumed. */
12615 static void
12619 {
12620 cp_decl_specifier_seq decl_specifiers;
12629 /* Defer access checks until we know what is being declared; the
12630 checks for names appearing in the decl-specifier-seq should be
12631 done as if we were in the scope of the thing being declared. */
12634 /* Parse the decl-specifier-seq. We have to keep track of whether
12635 or not the decl-specifier-seq declares a named class or
12636 enumeration type, since that is the only case in which the
12637 init-declarator-list is allowed to be empty.
12639 [dcl.dcl]
12641 In a simple-declaration, the optional init-declarator-list can be
12642 omitted only when declaring a class or enumeration, that is when
12643 the decl-specifier-seq contains either a class-specifier, an
12644 elaborated-type-specifier, or an enum-specifier. */
12646 CP_PARSER_FLAGS_OPTIONAL,
12649 /* We no longer need to defer access checks. */
12652 /* In a block scope, a valid declaration must always have a
12653 decl-specifier-seq. By not trying to parse declarators, we can
12654 resolve the declaration/expression ambiguity more quickly. */
12657 {
12660 }
12662 /* If the next two tokens are both identifiers, the code is
12663 erroneous. The usual cause of this situation is code like:
12665 T t;
12667 where "T" should name a type -- but does not. */
12670 {
12671 /* If parsing tentatively, we should commit; we really are
12672 looking at a declaration. */
12674 /* Give up. */
12676 }
12678 /* If we have seen at least one decl-specifier, and the next token
12679 is not a parenthesis, then we must be looking at a declaration.
12680 (After "int (" we might be looking at a functional cast.) */
12687 /* Look for C++17 decomposition declaration. */
12695 {
12696 tree decl
12698 maybe_range_for_decl,
12701 /* The next token should be either a `,' or a `;'. */
12703 /* If it's a `;', we are done. */
12706 /* Anything else is an error. */
12707 else
12708 {
12709 /* If we have already issued an error message we don't need
12710 to issue another one. */
12715 /* Skip tokens until we reach the end of the statement. */
12717 /* If the next token is now a `;', consume it. */
12721 }
12722 }
12723 else
12726 tree last_type;
12728 /* NULL_TREE if both variable and function declaration are allowed,
12729 error_mark_node if function declaration are not allowed and
12730 a FUNCTION_DECL that should be diagnosed if it is followed by
12731 variable declarations. */
12732 tree auto_function_declaration;
12735 auto_specifier_p
12739 /* Keep going until we hit the `;' at the end of the simple
12740 declaration. */
12743 CPP_SEMICOLON))
12744 {
12747 tree decl;
12751 {
12752 /* If we are processing next declarator, comma is expected */
12757 {
12761 }
12762 }
12763 else
12766 /* Parse the init-declarator. */
12769 function_definition_allowed_p,
12771 declares_class_or_enum,
12773 maybe_range_for_decl,
12776 /* If an error occurred while parsing tentatively, exit quickly.
12777 (That usually happens when in the body of a function; each
12778 statement is treated as a declaration-statement until proven
12779 otherwise.) */
12784 {
12785 /* If the init-declarator-list contains more than one
12786 init-declarator, they shall all form declarations of
12787 variables. */
12789 auto_function_declaration
12793 {
12795 "non-variable %qD in declaration with more than one "
12800 }
12801 }
12805 {
12809 {
12810 /* If the list of declarators contains more than one declarator,
12811 the type of each declared variable is determined as described
12812 above. If the type deduced for the template parameter U is not
12813 the same in each deduction, the program is ill-formed. */
12818 }
12819 else
12821 }
12823 /* Handle function definitions specially. */
12825 {
12826 /* If the next token is a `,', then we are probably
12827 processing something like:
12829 void f() {}, *p;
12831 which is erroneous. */
12833 {
12836 "mixing"
12838 }
12839 /* Otherwise, we're done with the list of declarators. */
12840 else
12841 {
12844 }
12845 }
12848 /* The next token should be either a `,' or a `;'. */
12850 /* If it's a `,', there are more declarators to come. */
12853 /* If it's a `;', we are done. */
12857 {
12862 }
12863 /* Anything else is an error. */
12864 else
12865 {
12866 /* If we have already issued an error message we don't need
12867 to issue another one. */
12872 /* Skip tokens until we reach the end of the statement. */
12874 /* If the next token is now a `;', consume it. */
12878 }
12879 /* After the first time around, a function-definition is not
12880 allowed -- even if it was OK at first. For example:
12882 int i, f() {}
12884 is not valid. */
12886 }
12888 /* Issue an error message if no declarators are present, and the
12889 decl-specifier-seq does not itself declare a class or
12890 enumeration: [dcl.dcl]/3. */
12892 {
12894 {
12898 /* Ensure an error is issued anyway when finish_decltype_type,
12899 called via cp_parser_decl_specifier_seq, returns a class or
12900 an enumeration (c++/51786). */
12903 }
12904 /* Perform any deferred access checks. */
12906 }
12908 /* Consume the `;'. */
12909 finish:
12913 {
12919 }
12921 done:
12923 }
12925 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12926 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12927 initializer ; */
12929 static tree
12934 {
12939 /* Parse the identifier-list. */
12943 {
12951 }
12955 {
12961 else
12962 {
12965 }
12966 }
12972 tree pushed_scope;
12979 NULL_TREE);
12986 cp_expr e;
12987 cp_decl_specifier_seq decl_specs;
12992 {
12995 else
12998 tree elt_pushed_scope;
13004 {
13005 /* Ensure we've diagnosed redeclaration if we aren't creating
13006 a new VAR_DECL. */
13009 }
13010 else
13014 }
13017 {
13020 }
13024 {
13031 {
13035 }
13036 }
13038 {
13040 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13041 the underlying DECL. */
13043 }
13049 {
13052 }
13055 }
13057 /* Parse a decl-specifier-seq.
13059 decl-specifier-seq:
13060 decl-specifier-seq [opt] decl-specifier
13061 decl-specifier attribute-specifier-seq [opt] (C++11)
13063 decl-specifier:
13064 storage-class-specifier
13065 type-specifier
13066 function-specifier
13067 friend
13068 typedef
13070 GNU Extension:
13072 decl-specifier:
13073 attributes
13075 Concepts Extension:
13077 decl-specifier:
13078 concept
13080 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13082 The parser flags FLAGS is used to control type-specifier parsing.
13084 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13085 flags:
13087 1: one of the decl-specifiers is an elaborated-type-specifier
13088 (i.e., a type declaration)
13089 2: one of the decl-specifiers is an enum-specifier or a
13090 class-specifier (i.e., a type definition)
13092 */
13094 static void
13096 cp_parser_flags flags,
13099 {
13103 cp_decl_spec ds;
13105 /* Clear DECL_SPECS. */
13108 /* Assume no class or enumeration type is declared. */
13111 /* Keep reading specifiers until there are no more to read. */
13113 {
13118 /* Peek at the next token. */
13121 /* Save the first token of the decl spec list for error
13122 reporting. */
13125 /* Handle attributes. */
13127 {
13128 /* Parse the attributes. */
13131 /* In a sequence of declaration specifiers, c++11 attributes
13132 appertain to the type that precede them. In that case
13133 [dcl.spec]/1 says:
13135 The attribute-specifier-seq affects the type only for
13136 the declaration it appears in, not other declarations
13137 involving the same type.
13139 But for now let's force the user to position the
13140 attribute either at the beginning of the declaration or
13141 after the declarator-id, which would clearly mean that it
13142 applies to the declarator. */
13144 {
13146 /* The c++11 attribute is at the beginning of the
13147 declaration. It appertains to the entity being
13149 else
13150 {
13152 {
13153 /* This is an attribute following a
13154 class-specifier. */
13159 }
13160 else
13161 {
13162 decl_specs->std_attributes
13164 attrs);
13167 }
13169 }
13170 }
13172 decl_specs->attributes
13174 attrs);
13178 }
13179 /* Assume we will find a decl-specifier keyword. */
13181 /* If the next token is an appropriate keyword, we can simply
13182 add it to the list. */
13184 {
13185 /* decl-specifier:
13186 friend
13187 constexpr */
13190 {
13193 }
13194 else
13195 {
13197 /* Consume the token. */
13199 }
13212 /* function-specifier:
13213 inline
13214 virtual
13215 explicit */
13222 /* decl-specifier:
13223 typedef */
13226 /* Consume the token. */
13228 /* A constructor declarator cannot appear in a typedef. */
13230 /* The "typedef" keyword can only occur in a declaration; we
13231 may as well commit at this point. */
13238 /* storage-class-specifier:
13239 auto
13240 register
13241 static
13242 extern
13243 mutable
13245 GNU Extension:
13246 thread */
13249 {
13250 /* Consume the token. */
13253 /* Complain about `auto' as a storage specifier, if
13254 we're complaining about C++0x compatibility. */
13258 /* Set the storage class anyway. */
13260 token);
13261 }
13262 else
13263 /* C++0x auto type-specifier. */
13271 /* Consume the token. */
13274 token);
13277 /* Consume the token. */
13283 /* We did not yet find a decl-specifier yet. */
13286 }
13303 /* Constructors are a special case. The `S' in `S()' is not a
13304 decl-specifier; it is the beginning of the declarator. */
13305 constructor_p
13306 = (!found_decl_spec
13307 && constructor_possible_p
13308 && (cp_parser_constructor_declarator_p
13311 /* If we don't have a DECL_SPEC yet, then we must be looking at
13312 a type-specifier. */
13314 {
13317 tree type_spec;
13319 type_spec
13321 decl_specs,
13327 /* If this type-specifier referenced a user-defined type
13328 (a typedef, class-name, etc.), then we can't allow any
13329 more such type-specifiers henceforth.
13331 [dcl.spec]
13333 The longest sequence of decl-specifiers that could
13334 possibly be a type name is taken as the
13335 decl-specifier-seq of a declaration. The sequence shall
13336 be self-consistent as described below.
13338 [dcl.type]
13340 As a general rule, at most one type-specifier is allowed
13341 in the complete decl-specifier-seq of a declaration. The
13342 only exceptions are the following:
13344 -- const or volatile can be combined with any other
13345 type-specifier.
13347 -- signed or unsigned can be combined with char, long,
13348 short, or int.
13350 -- ..
13352 Example:
13354 typedef char* Pc;
13355 void g (const int Pc);
13357 Here, Pc is *not* part of the decl-specifier seq; it's
13358 the declarator. Therefore, once we see a type-specifier
13359 (other than a cv-qualifier), we forbid any additional
13360 user-defined types. We *do* still allow things like `int
13361 int' to be considered a decl-specifier-seq, and issue the
13362 error message later. */
13365 /* A constructor declarator cannot follow a type-specifier. */
13367 {
13372 }
13373 }
13375 /* If we still do not have a DECL_SPEC, then there are no more
13376 decl-specifiers. */
13381 /* After we see one decl-specifier, further decl-specifiers are
13382 always optional. */
13384 }
13386 /* Don't allow a friend specifier with a class definition. */
13391 }
13393 /* Parse an (optional) storage-class-specifier.
13395 storage-class-specifier:
13396 auto
13397 register
13398 static
13399 extern
13400 mutable
13402 GNU Extension:
13404 storage-class-specifier:
13405 thread
13407 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13409 static tree
13411 {
13413 {
13417 /* Fall through for C++98. */
13425 /* Consume the token. */
13430 }
13431 }
13433 /* Parse an (optional) function-specifier.
13435 function-specifier:
13436 inline
13437 virtual
13438 explicit
13440 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13441 Updates DECL_SPECS, if it is non-NULL. */
13443 static tree
13446 {
13449 {
13455 /* 14.5.2.3 [temp.mem]
13457 A member function template shall not be virtual. */
13461 else
13471 }
13473 /* Consume the token. */
13475 }
13477 /* Parse a linkage-specification.
13479 linkage-specification:
13480 extern string-literal { declaration-seq [opt] }
13481 extern string-literal declaration */
13483 static void
13485 {
13486 tree linkage;
13488 /* Look for the `extern' keyword. */
13491 /* Look for the string-literal. */
13494 /* Transform the literal into an identifier. If the literal is a
13495 wide-character string, or contains embedded NULs, then we can't
13496 handle it as the user wants. */
13499 {
13501 /* Assume C++ linkage. */
13503 }
13504 else
13507 /* We're now using the new linkage. */
13510 /* If the next token is a `{', then we're using the first
13511 production. */
13513 {
13517 /* Consume the `{' token. */
13519 /* Parse the declarations. */
13521 /* Look for the closing `}'. */
13523 }
13524 /* Otherwise, there's just one declaration. */
13525 else
13526 {
13529 saved_in_unbraced_linkage_specification_p
13533 parser->in_unbraced_linkage_specification_p
13535 }
13537 /* We're done with the linkage-specification. */
13539 }
13541 /* Parse a static_assert-declaration.
13543 static_assert-declaration:
13544 static_assert ( constant-expression , string-literal ) ;
13545 static_assert ( constant-expression ) ; (C++1Z)
13547 If MEMBER_P, this static_assert is a class member. */
13549 static void
13551 {
13552 tree condition;
13553 tree message;
13555 location_t saved_loc;
13558 /* Peek at the `static_assert' token so we can keep track of exactly
13559 where the static assertion started. */
13563 /* Look for the `static_assert' keyword. */
13565 RT_STATIC_ASSERT))
13568 /* We know we are in a static assertion; commit to any tentative
13569 parse. */
13573 /* Parse the `(' starting the static assertion condition. */
13576 /* Parse the constant-expression. Allow a non-constant expression
13577 here in order to give better diagnostics in finish_static_assert. */
13578 condition =
13584 {
13587 "static_assert without a message "
13589 /* Eat the ')' */
13594 }
13595 else
13596 {
13597 /* Parse the separating `,'. */
13600 /* Parse the string-literal message. */
13605 /* A `)' completes the static assertion. */
13611 }
13613 /* A semicolon terminates the declaration. */
13616 /* Complete the static assertion, which may mean either processing
13617 the static assert now or saving it for template instantiation. */
13619 }
13621 /* Parse the expression in decltype ( expression ). */
13623 static tree
13626 {
13628 tree expr;
13630 /* Since we're going to preserve any side-effects from this parse, set up a
13631 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13632 in the expression. */
13635 /* First, try parsing an id-expression. */
13646 {
13649 cp_id_kind idk;
13653 /* Lookup the name we got back from the id-expression. */
13663 {
13664 /* Complete lookup of the id-expression. */
13665 expr = (finish_id_expression
13678 /* We found an id-expression, but it was something that we
13679 should not have found. This is an error, not something
13680 we can recover from, so note that we found an
13681 id-expression and we'll recover as gracefully as
13682 possible. */
13684 }
13689 /* We have an id-expression. */
13691 }
13694 {
13695 /* Abort the id-expression parse. */
13698 /* Parsing tentatively, again. */
13701 /* Parse a class member access. */
13709 /* We have an id-expression. */
13711 }
13714 /* We have parsed the complete id-expression or member access. */
13716 else
13717 {
13718 /* Abort our attempt to parse an id-expression or member access
13719 expression. */
13722 /* Parse a full expression. */
13725 }
13728 }
13730 /* Parse a `decltype' type. Returns the type.
13732 simple-type-specifier:
13733 decltype ( expression )
13734 C++14 proposal:
13735 decltype ( auto ) */
13737 static tree
13739 {
13740 tree expr;
13749 {
13750 /* Already parsed. */
13753 }
13755 /* Look for the `decltype' token. */
13759 /* Parse the opening `('. */
13763 /* decltype (auto) */
13766 {
13773 }
13775 /* Types cannot be defined in a `decltype' expression. Save away the
13776 old message. */
13779 /* And create the new one. */
13780 parser->type_definition_forbidden_message
13783 /* The restrictions on constant-expressions do not apply inside
13784 decltype expressions. */
13785 saved_integral_constant_expression_p
13787 saved_non_integral_constant_expression_p
13791 /* Within a parenthesized expression, a `>' token is always
13792 the greater-than operator. */
13793 saved_greater_than_is_operator_p
13797 /* Do not actually evaluate the expression. */
13800 /* Do not warn about problems with the expression. */
13805 /* Go back to evaluating expressions. */
13809 /* The `>' token might be the end of a template-id or
13810 template-parameter-list now. */
13811 parser->greater_than_is_operator_p
13814 /* Restore the old message and the integral constant expression
13815 flags. */
13817 parser->integral_constant_expression_p
13819 parser->non_integral_constant_expression_p
13822 /* Parse to the closing `)'. */
13824 {
13828 }
13831 tf_warning_or_error);
13833 rewrite:
13834 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13835 it again. */
13844 }
13846 /* Special member functions [gram.special] */
13848 /* Parse a conversion-function-id.
13850 conversion-function-id:
13851 operator conversion-type-id
13853 Returns an IDENTIFIER_NODE representing the operator. */
13855 static tree
13857 {
13858 tree type;
13859 tree saved_scope;
13860 tree saved_qualifying_scope;
13861 tree saved_object_scope;
13864 /* Look for the `operator' token. */
13867 /* When we parse the conversion-type-id, the current scope will be
13868 reset. However, we need that information in able to look up the
13869 conversion function later, so we save it here. */
13873 /* We must enter the scope of the class so that the names of
13874 entities declared within the class are available in the
13875 conversion-type-id. For example, consider:
13877 struct S {
13878 typedef int I;
13879 operator I();
13880 };
13882 S::operator I() { ... }
13884 In order to see that `I' is a type-name in the definition, we
13885 must be in the scope of `S'. */
13888 /* Parse the conversion-type-id. */
13890 /* Leave the scope of the class, if any. */
13893 /* Restore the saved scope. */
13897 /* If the TYPE is invalid, indicate failure. */
13901 }
13903 /* Parse a conversion-type-id:
13905 conversion-type-id:
13906 type-specifier-seq conversion-declarator [opt]
13908 Returns the TYPE specified. */
13910 static tree
13912 {
13913 tree attributes;
13914 cp_decl_specifier_seq type_specifiers;
13916 tree type_specified;
13919 /* Parse the attributes. */
13923 parser->type_definition_forbidden_message
13926 /* Parse the type-specifiers. */
13933 /* If that didn't work, stop. */
13936 /* Parse the conversion-declarator. */
13944 /* Don't give this error when parsing tentatively. This happens to
13945 work because we always parse this definitively once. */
13948 {
13950 {
13953 }
13957 }
13960 }
13962 /* Parse an (optional) conversion-declarator.
13964 conversion-declarator:
13965 ptr-operator conversion-declarator [opt]
13967 */
13971 {
13974 cp_cv_quals cv_quals;
13976 /* We don't know if there's a ptr-operator next, or not. */
13978 /* Try the ptr-operator. */
13981 /* If it worked, look for more conversion-declarators. */
13983 {
13986 /* Parse another optional declarator. */
13989 declarator = cp_parser_make_indirect_declarator
13993 }
13996 }
13998 /* Parse an (optional) ctor-initializer.
14000 ctor-initializer:
14001 : mem-initializer-list
14003 Returns TRUE iff the ctor-initializer was actually present. */
14005 static bool
14007 {
14008 /* If the next token is not a `:', then there is no
14009 ctor-initializer. */
14011 {
14012 /* Do default initialization of any bases and members. */
14017 }
14019 /* Consume the `:' token. */
14021 /* And the mem-initializer-list. */
14025 }
14027 /* Parse a mem-initializer-list.
14029 mem-initializer-list:
14030 mem-initializer ... [opt]
14031 mem-initializer ... [opt] , mem-initializer-list */
14033 static void
14035 {
14040 /* Let the semantic analysis code know that we are starting the
14041 mem-initializer-list. */
14046 /* Loop through the list. */
14048 {
14049 tree mem_initializer;
14052 /* Parse the mem-initializer. */
14054 /* If the next token is a `...', we're expanding member initializers. */
14056 {
14057 /* Consume the `...'. */
14060 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14061 can be expanded but members cannot. */
14064 {
14069 }
14071 /* Construct the pack expansion type. */
14074 }
14077 {
14081 }
14082 /* Look for a target constructor. */
14086 {
14089 {
14093 }
14095 }
14096 /* Add it to the list, unless it was erroneous. */
14098 {
14101 }
14102 /* If the next token is not a `,', we're done. */
14105 /* Consume the `,' token. */
14107 }
14109 /* Perform semantic analysis. */
14112 }
14114 /* Parse a mem-initializer.
14116 mem-initializer:
14117 mem-initializer-id ( expression-list [opt] )
14118 mem-initializer-id braced-init-list
14120 GNU extension:
14122 mem-initializer:
14123 ( expression-list [opt] )
14125 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14126 class) or FIELD_DECL (for a non-static data member) to initialize;
14127 the TREE_VALUE is the expression-list. An empty initialization
14128 list is represented by void_list_node. */
14130 static tree
14132 {
14133 tree mem_initializer_id;
14134 tree expression_list;
14135 tree member;
14138 /* Find out what is being initialized. */
14140 {
14144 }
14145 else
14146 {
14150 }
14156 {
14163 }
14164 else
14165 {
14175 }
14185 }
14187 /* Parse a mem-initializer-id.
14189 mem-initializer-id:
14190 :: [opt] nested-name-specifier [opt] class-name
14191 decltype-specifier (C++11)
14192 identifier
14194 Returns a TYPE indicating the class to be initialized for the first
14195 production (and the second in C++11). Returns an IDENTIFIER_NODE
14196 indicating the data member to be initialized for the last production. */
14198 static tree
14200 {
14204 tree id;
14208 /* `typename' is not allowed in this context ([temp.res]). */
14210 {
14212 "keyword %<typename%> not allowed in this context (a qualified "
14215 }
14216 /* Look for the optional `::' operator. */
14217 global_scope_p
14221 /* Look for the optional nested-name-specifier. The simplest way to
14222 implement:
14224 [temp.res]
14226 The keyword `typename' is not permitted in a base-specifier or
14227 mem-initializer; in these contexts a qualified name that
14228 depends on a template-parameter is implicitly assumed to be a
14229 type name.
14231 is to assume that we have seen the `typename' keyword at this
14232 point. */
14233 nested_name_specifier_p
14242 /* If there is a `::' operator or a nested-name-specifier, then we
14243 are definitely looking for a class-name. */
14248 typename_type,
14252 /* Otherwise, we could also be looking for an ordinary identifier. */
14255 /* Try a decltype-specifier. */
14257 else
14258 /* Otherwise, try a class-name. */
14262 none_type,
14266 /* If we found one, we're done. */
14269 /* Otherwise, look for an ordinary identifier. */
14271 }
14273 /* Overloading [gram.over] */
14275 /* Parse an operator-function-id.
14277 operator-function-id:
14278 operator operator
14280 Returns an IDENTIFIER_NODE for the operator which is a
14281 human-readable spelling of the identifier, e.g., `operator +'. */
14283 static cp_expr
14285 {
14286 /* Look for the `operator' keyword. */
14289 /* And then the name of the operator itself. */
14291 }
14293 /* Return an identifier node for a user-defined literal operator.
14294 The suffix identifier is chained to the operator name identifier. */
14296 static tree
14298 {
14299 tree identifier;
14306 }
14308 /* Parse an operator.
14310 operator:
14311 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14312 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14313 || ++ -- , ->* -> () []
14315 GNU Extensions:
14317 operator:
14318 <? >? <?= >?=
14320 Returns an IDENTIFIER_NODE for the operator which is a
14321 human-readable spelling of the identifier, e.g., `operator +'. */
14323 static cp_expr
14325 {
14330 /* Peek at the next token. */
14335 /* Figure out which operator we have. */
14337 {
14339 {
14342 /* The keyword should be either `new' or `delete'. */
14347 else
14350 /* Consume the `new' or `delete' token. */
14353 /* Peek at the next token. */
14355 /* If it's a `[' token then this is the array variant of the
14356 operator. */
14358 {
14359 /* Consume the `[' token. */
14361 /* Look for the `]' token. */
14367 }
14368 /* Otherwise, we have the non-array variant. */
14369 else
14375 }
14522 /* Consume the `('. */
14524 /* Look for the matching `)'. */
14529 /* Consume the `['. */
14531 /* Look for the matching `]'. */
14538 /* FALLTHRU */
14547 {
14554 /* Consume the string. */
14560 {
14563 }
14564 else
14565 {
14567 /* Look for the suffix identifier. */
14572 {
14576 }
14577 else
14578 {
14581 }
14582 }
14587 {
14590 }
14593 {
14596 }
14598 {
14601 }
14603 }
14606 /* Anything else is an error. */
14608 }
14610 /* If we have selected an identifier, we need to consume the
14611 operator token. */
14614 /* Otherwise, no valid operator name was present. */
14615 else
14616 {
14619 }
14622 }
14624 /* Parse a template-declaration.
14626 template-declaration:
14627 export [opt] template < template-parameter-list > declaration
14629 If MEMBER_P is TRUE, this template-declaration occurs within a
14630 class-specifier.
14632 The grammar rule given by the standard isn't correct. What
14633 is really meant is:
14635 template-declaration:
14636 export [opt] template-parameter-list-seq
14637 decl-specifier-seq [opt] init-declarator [opt] ;
14638 export [opt] template-parameter-list-seq
14639 function-definition
14641 template-parameter-list-seq:
14642 template-parameter-list-seq [opt]
14643 template < template-parameter-list >
14645 Concept Extensions:
14647 template-parameter-list-seq:
14648 template < template-parameter-list > requires-clause [opt]
14650 requires-clause:
14651 requires logical-or-expression */
14653 static void
14655 {
14656 /* Check for `export'. */
14658 {
14659 /* Consume the `export' token. */
14661 /* Warn that we do not support `export'. */
14663 }
14666 }
14668 /* Parse a template-parameter-list.
14670 template-parameter-list:
14671 template-parameter
14672 template-parameter-list , template-parameter
14674 Returns a TREE_LIST. Each node represents a template parameter.
14675 The nodes are connected via their TREE_CHAINs. */
14677 static tree
14679 {
14684 /* The loop below parses the template parms. We first need to know
14685 the total number of template parms to be able to compute proper
14686 canonical types of each dependent type. So after the loop, when
14687 we know the total number of template parms,
14688 end_template_parm_list computes the proper canonical types and
14689 fixes up the dependent types accordingly. */
14691 {
14692 tree parameter;
14695 location_t parm_loc;
14697 /* Parse the template-parameter. */
14702 /* Add it to the list. */
14705 parm_loc,
14706 parameter,
14707 is_non_type,
14708 is_parameter_pack);
14709 else
14710 {
14713 }
14715 /* If the next token is not a `,', we're done. */
14718 /* Otherwise, consume the `,' token. */
14720 }
14723 }
14725 /* Parse a introduction-list.
14727 introduction-list:
14728 introduced-parameter
14729 introduction-list , introduced-parameter
14731 introduced-parameter:
14732 ...[opt] identifier
14734 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14735 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14736 WILDCARD_DECL will also have DECL_NAME set and token location in
14737 DECL_SOURCE_LOCATION. */
14739 static tree
14741 {
14745 {
14750 /* Build placeholder. */
14758 /* If the next token is not a `,', we're done. */
14761 /* Otherwise, consume the `,' token. */
14763 }
14765 /* Convert the vec into a TREE_VEC. */
14768 tree parm;
14774 }
14776 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14777 is an abstract declarator. */
14781 {
14786 }
14788 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14789 is an abstract declarator. */
14793 {
14797 else
14799 }
14801 /* Returns true if DECL represents a constrained-parameter. */
14805 {
14810 }
14812 /* Returns true if PARM declares a constrained-parameter. */
14816 {
14818 }
14820 /* Check that the type parameter is only a declarator-id, and that its
14821 type is not cv-qualified. */
14823 bool
14826 {
14831 {
14834 }
14836 /* Don't allow cv-qualified type parameters. */
14839 {
14842 }
14845 }
14847 /* Finish parsing/processing a template type parameter and checking
14848 various restrictions. */
14852 tree id,
14854 {
14857 else
14859 }
14861 static tree
14863 {
14864 /* FIXME: This should probably be copied, and we may need to adjust
14865 the template parameter depths. */
14875 }
14877 /* Finish parsing/processing a template template parameter by borrowing
14878 the template parameter list from the prototype parameter. */
14880 static tree
14882 tree proto,
14883 tree id,
14885 {
14889 }
14891 /* Create a new non-type template parameter from the given PARM
14892 declarator. */
14894 static tree
14897 {
14903 }
14905 /* Build a constrained template parameter based on the PARMDECL
14906 declarator. The type of PARMDECL is the constrained type, which
14907 refers to the prototype template parameter that ultimately
14908 specifies the type of the declared parameter. */
14910 static tree
14915 {
14921 /* A template parameter constrained by a variadic concept shall also
14922 be declared as a template parameter pack. */
14927 /* Build the parameter. Return an error if the declarator was invalid. */
14928 tree parm;
14933 parmdecl);
14934 else
14939 /* Finish the parameter decl and create a node attaching the
14940 default argument and constraint. */
14945 }
14947 /* Returns true if the parsed type actually represents the declaration
14948 of a type template-parameter. */
14952 {
14955 }
14958 /* Returns true if the parsed type actually represents the declaration of
14959 a template template-parameter. */
14961 static bool
14963 {
14966 }
14968 /* Parse a default argument for a type template-parameter.
14969 Note that diagnostics are handled in cp_parser_template_parameter. */
14971 static tree
14973 {
14976 /* Consume the `=' token. */
14981 /* Parse the default-argument. */
14987 {
14991 }
14994 }
14996 /* Parse a default argument for a template template-parameter. */
14998 static tree
15000 {
15005 /* Consume the `='. */
15007 /* Parse the id-expression. */
15009 /* save token before parsing the id-expression, for error
15010 reporting */
15012 tree default_argument
15020 /* If the id-expression was a template-id that refers to
15021 a template-class, we already have the declaration here,
15022 so no further lookup is needed. */
15023 ;
15024 else
15025 /* Look up the name. */
15026 default_argument
15028 none_type,
15034 /* See if the default argument is valid. */
15038 }
15040 /* Parse a template-parameter.
15042 template-parameter:
15043 type-parameter
15044 parameter-declaration
15046 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15047 the parameter. The TREE_PURPOSE is the default value, if any.
15048 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15049 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15050 set to true iff this parameter is a parameter pack. */
15052 static tree
15055 {
15058 tree parm;
15060 /* Assume it is a type parameter or a template parameter. */
15062 /* Assume it not a parameter pack. */
15064 /* Peek at the next token. */
15066 /* If it is `class' or `template', we have a type-parameter. */
15069 /* If it is `class' or `typename' we do not know yet whether it is a
15070 type parameter or a non-type parameter. Consider:
15072 template <typename T, typename T::X X> ...
15074 or:
15076 template <class C, class D*> ...
15078 Here, the first parameter is a type parameter, and the second is
15079 a non-type parameter. We can tell by looking at the token after
15080 the identifier -- if it is a `,', `=', or `>' then we have a type
15081 parameter. */
15083 {
15084 /* Peek at the token after `class' or `typename'. */
15086 /* If it's an ellipsis, we have a template type parameter
15087 pack. */
15090 /* If it's an identifier, skip it. */
15093 /* Now, see if the token looks like the end of a template
15094 parameter. */
15099 }
15101 /* Otherwise, it is a non-type parameter or a constrained parameter.
15103 [temp.param]
15105 When parsing a default template-argument for a non-type
15106 template-parameter, the first non-nested `>' is taken as the end
15107 of the template parameter-list rather than a greater-than
15108 operator. */
15109 parameter_declarator
15116 /* If the parameter declaration is marked as a parameter pack, set
15117 *IS_PARAMETER_PACK to notify the caller. */
15122 {
15123 /* Can happen in some cases of erroneous input (c++/34892). */
15125 /* Consume the `...' for better error recovery. */
15127 }
15129 // The parameter may have been constrained.
15132 parameter_declarator,
15133 is_non_type,
15134 is_parameter_pack);
15136 // Now we're sure that the parameter is a non-type parameter.
15147 }
15149 /* Parse a type-parameter.
15151 type-parameter:
15152 class identifier [opt]
15153 class identifier [opt] = type-id
15154 typename identifier [opt]
15155 typename identifier [opt] = type-id
15156 template < template-parameter-list > class identifier [opt]
15157 template < template-parameter-list > class identifier [opt]
15158 = id-expression
15160 GNU Extension (variadic templates):
15162 type-parameter:
15163 class ... identifier [opt]
15164 typename ... identifier [opt]
15166 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15167 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15168 the declaration of the parameter.
15170 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15172 static tree
15174 {
15176 tree parameter;
15178 /* Look for a keyword to tell us what kind of parameter this is. */
15184 {
15187 {
15188 tree identifier;
15189 tree default_argument;
15191 /* If the next token is an ellipsis, we have a template
15192 argument pack. */
15194 {
15195 /* Consume the `...' token. */
15200 }
15202 /* If the next token is an identifier, then it names the
15203 parameter. */
15206 else
15209 /* Create the parameter. */
15212 /* If the next token is an `=', we have a default argument. */
15214 {
15215 default_argument
15218 /* Template parameter packs cannot have default
15219 arguments. */
15221 {
15224 "template parameter pack %qD cannot have a "
15226 else
15228 "template parameter packs cannot have "
15231 }
15234 }
15235 else
15238 /* Create the combined representation of the parameter and the
15239 default argument. */
15241 }
15245 {
15246 tree identifier;
15247 tree default_argument;
15249 /* Look for the `<'. */
15251 /* Parse the template-parameter-list. */
15253 /* Look for the `>'. */
15256 // If template requirements are present, parse them.
15258 {
15263 }
15265 /* Look for the `class' or 'typename' keywords. */
15267 /* If the next token is an ellipsis, we have a template
15268 argument pack. */
15270 {
15271 /* Consume the `...' token. */
15276 }
15277 /* If the next token is an `=', then there is a
15278 default-argument. If the next token is a `>', we are at
15279 the end of the parameter-list. If the next token is a `,',
15280 then we are at the end of this parameter. */
15284 {
15286 /* Treat invalid names as if the parameter were nameless. */
15289 }
15290 else
15293 /* Create the template parameter. */
15295 identifier);
15297 /* If the next token is an `=', then there is a
15298 default-argument. */
15300 {
15301 default_argument
15304 /* Template parameter packs cannot have default
15305 arguments. */
15307 {
15310 "template parameter pack %qD cannot "
15312 identifier);
15313 else
15317 }
15318 }
15319 else
15322 /* Create the combined representation of the parameter and the
15323 default argument. */
15325 }
15331 }
15334 }
15336 /* Parse a template-id.
15338 template-id:
15339 template-name < template-argument-list [opt] >
15341 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15342 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15343 returned. Otherwise, if the template-name names a function, or set
15344 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15345 names a class, returns a TYPE_DECL for the specialization.
15347 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15348 uninstantiated templates. */
15350 static tree
15356 {
15357 tree templ;
15358 tree arguments;
15359 tree template_id;
15364 /* If the next token corresponds to a template-id, there is no need
15365 to reparse it. */
15368 {
15371 }
15373 /* Avoid performing name lookup if there is no possibility of
15374 finding a template-id. */
15377 && !cp_parser_nth_token_starts_template_argument_list_p
15379 {
15382 }
15384 /* Remember where the template-id starts. */
15390 /* Parse the template-name. */
15393 check_dependency_p,
15394 is_declaration,
15395 tag_type,
15398 {
15401 }
15403 /* Since we're going to preserve any side-effects from this parse, set up a
15404 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15405 in the template arguments. */
15408 /* If we find the sequence `[:' after a template-name, it's probably
15409 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15410 parse correctly the argument list. */
15417 {
15419 /* Change `:' into `::'. */
15421 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15422 CPP_LESS. */
15425 /* Parse the arguments. */
15428 {
15429 /* If we couldn't parse an argument list, then we revert our changes
15430 and return simply an error. Maybe this is not a template-id
15431 after all. */
15436 }
15437 /* Otherwise, emit an error about the invalid digraph, but continue
15438 parsing because we got our argument list. */
15441 {
15444 "%<<:%> is an alternate spelling for %<[%>."
15447 {
15449 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15452 }
15453 }
15454 }
15455 else
15456 {
15457 /* Look for the `<' that starts the template-argument-list. */
15459 {
15462 }
15463 /* Parse the arguments. */
15465 }
15467 /* Build a representation of the specialization. */
15470 TEMPLATE_ID_EXPR,
15474 {
15476 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15477 template (rather than some instantiation thereof) only if
15478 is not nested within some other construct. For example, in
15479 "template <typename T> void f(T) { A<T>::", A<T> is just an
15480 instantiation of A. */
15483 CPP_SCOPE));
15484 template_id
15486 }
15487 /* A template-like identifier may be a partial concept id. */
15493 {
15497 }
15498 else
15499 {
15500 /* If it's not a class-template or a template-template, it should be
15501 a function-template. */
15509 }
15511 /* If parsing tentatively, replace the sequence of tokens that makes
15512 up the template-id with a CPP_TEMPLATE_ID token. That way,
15513 should we re-parse the token stream, we will not have to repeat
15514 the effort required to do the parse, nor will we issue duplicate
15515 error messages about problems during instantiation of the
15516 template. */
15518 /* Don't do this if we had a parse error in a declarator; re-parsing
15519 might succeed if a name changes meaning (60361). */
15523 {
15526 /* Reset the contents of the START_OF_ID token. */
15529 /* Update the location to be of the form:
15530 template-name < template-argument-list [opt] >
15531 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15532 with caret == start at the start of the template-name,
15533 ranging until the closing '>'. */
15534 location_t finish_loc
15536 location_t combined_loc
15540 /* Retrieve any deferred checks. Do not pop this access checks yet
15541 so the memory will not be reclaimed during token replacing below. */
15547 /* Purge all subsequent tokens. */
15550 /* ??? Can we actually assume that, if template_id ==
15551 error_mark_node, we will have issued a diagnostic to the
15552 user, as opposed to simply marking the tentative parse as
15553 failed? */
15556 }
15560 }
15562 /* Parse a template-name.
15564 template-name:
15565 identifier
15567 The standard should actually say:
15569 template-name:
15570 identifier
15571 operator-function-id
15573 A defect report has been filed about this issue.
15575 A conversion-function-id cannot be a template name because they cannot
15576 be part of a template-id. In fact, looking at this code:
15578 a.operator K<int>()
15580 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15581 It is impossible to call a templated conversion-function-id with an
15582 explicit argument list, since the only allowed template parameter is
15583 the type to which it is converting.
15585 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15586 `template' keyword, in a construction like:
15588 T::template f<3>()
15590 In that case `f' is taken to be a template-name, even though there
15591 is no way of knowing for sure.
15593 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15594 name refers to a set of overloaded functions, at least one of which
15595 is a template, or an IDENTIFIER_NODE with the name of the template,
15596 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15597 names are looked up inside uninstantiated templates. */
15599 static tree
15606 {
15607 tree identifier;
15608 tree decl;
15609 tree fns;
15612 /* If the next token is `operator', then we have either an
15613 operator-function-id or a conversion-function-id. */
15615 {
15616 /* We don't know whether we're looking at an
15617 operator-function-id or a conversion-function-id. */
15619 /* Try an operator-function-id. */
15621 /* If that didn't work, try a conversion-function-id. */
15623 {
15626 }
15627 }
15628 /* Look for the identifier. */
15629 else
15632 /* If we didn't find an identifier, we don't have a template-id. */
15636 /* If the name immediately followed the `template' keyword, then it
15637 is a template-name. However, if the next token is not `<', then
15638 we do not treat it as a template-name, since it is not being used
15639 as part of a template-id. This enables us to handle constructs
15640 like:
15642 template <typename T> struct S { S(); };
15643 template <typename T> S<T>::S();
15645 correctly. We would treat `S' as a template -- if it were `S<T>'
15646 -- but we do not if there is no `<'. */
15650 {
15651 /* In a declaration, in a dependent context, we pretend that the
15652 "template" keyword was present in order to improve error
15653 recovery. For example, given:
15655 template <typename T> void f(T::X<int>);
15657 we want to treat "X<int>" as a template-id. */
15659 && !template_keyword_p
15661 && check_dependency_p
15663 /* Do not do this for dtors (or ctors), since they never
15664 need the template keyword before their name. */
15666 {
15669 /* Explain what went wrong. */
15671 identifier);
15674 /* If parsing tentatively, find the location of the "<" token. */
15677 /* Parse the template arguments so that we can issue error
15678 messages about them. */
15681 /* Skip tokens until we find a good place from which to
15682 continue parsing. */
15687 /* If parsing tentatively, permanently remove the
15688 template argument list. That will prevent duplicate
15689 error messages from being issued about the missing
15690 "template" keyword. */
15696 }
15698 /* If the "template" keyword is present, then there is generally
15699 no point in doing name-lookup, so we just return IDENTIFIER.
15700 But, if the qualifying scope is non-dependent then we can
15701 (and must) do name-lookup normally. */
15707 }
15709 /* Look up the name. */
15711 tag_type,
15714 check_dependency_p,
15720 /* If DECL is a template, then the name was a template-name. */
15722 {
15726 }
15727 else
15728 {
15731 /* The standard does not explicitly indicate whether a name that
15732 names a set of overloaded declarations, some of which are
15733 templates, is a template-name. However, such a name should
15734 be a template-name; otherwise, there is no way to form a
15735 template-id for the overloaded templates. */
15743 {
15744 /* The name does not name a template. */
15747 }
15748 }
15750 /* If DECL is dependent, and refers to a function, then just return
15751 its name; we will look it up again during template instantiation. */
15753 {
15757 }
15760 }
15762 /* Parse a template-argument-list.
15764 template-argument-list:
15765 template-argument ... [opt]
15766 template-argument-list , template-argument ... [opt]
15768 Returns a TREE_VEC containing the arguments. */
15770 static tree
15772 {
15777 tree vec;
15784 /* Even if the template-id appears in an integral
15785 constant-expression, the contents of the argument list do
15786 not. */
15792 /* Parse the arguments. */
15793 do
15794 {
15795 tree argument;
15798 /* Consume the comma. */
15801 /* Parse the template-argument. */
15804 /* If the next token is an ellipsis, we're expanding a template
15805 argument pack. */
15807 {
15809 {
15813 }
15814 /* Consume the `...' token. */
15817 /* Make the argument into a TYPE_PACK_EXPANSION or
15818 EXPR_PACK_EXPANSION. */
15820 }
15823 {
15827 {
15830 }
15831 else
15833 }
15835 }
15851 }
15853 /* Parse a template-argument.
15855 template-argument:
15856 assignment-expression
15857 type-id
15858 id-expression
15860 The representation is that of an assignment-expression, type-id, or
15861 id-expression -- except that the qualified id-expression is
15862 evaluated, so that the value returned is either a DECL or an
15863 OVERLOAD.
15865 Although the standard says "assignment-expression", it forbids
15866 throw-expressions or assignments in the template argument.
15867 Therefore, we use "conditional-expression" instead. */
15869 static tree
15871 {
15872 tree argument;
15878 cp_id_kind idk;
15880 /* There's really no way to know what we're looking at, so we just
15881 try each alternative in order.
15883 [temp.arg]
15885 In a template-argument, an ambiguity between a type-id and an
15886 expression is resolved to a type-id, regardless of the form of
15887 the corresponding template-parameter.
15889 Therefore, we try a type-id first. */
15892 /* If there was no error parsing the type-id but the next token is a
15893 '>>', our behavior depends on which dialect of C++ we're
15894 parsing. In C++98, we probably found a typo for '> >'. But there
15895 are type-id which are also valid expressions. For instance:
15897 struct X { int operator >> (int); };
15898 template <int V> struct Foo {};
15899 Foo<X () >> 5> r;
15901 Here 'X()' is a valid type-id of a function type, but the user just
15902 wanted to write the expression "X() >> 5". Thus, we remember that we
15903 found a valid type-id, but we still try to parse the argument as an
15904 expression to see what happens.
15906 In C++0x, the '>>' will be considered two separate '>'
15907 tokens. */
15911 {
15914 }
15915 else
15916 {
15917 /* If the next token isn't a `,' or a `>', then this argument wasn't
15918 really finished. This means that the argument is not a valid
15919 type-id. */
15922 /* If that worked, we're done. */
15925 }
15926 /* We're still not sure what the argument will be. */
15928 /* Try a template. */
15936 /* If the next token isn't a `,' or a `>', then this argument wasn't
15937 really finished. */
15941 {
15942 /* Figure out what is being referred to. If the id-expression
15943 was for a class template specialization, then we will have a
15944 TYPE_DECL at this point. There is no need to do name lookup
15945 at this point in that case. */
15948 none_type,
15954 /* Handle a constrained-type-specifier for a non-type template
15955 parameter. */
15961 }
15963 {
15967 }
15968 /* It must be a non-type argument. In C++17 any constant-expression is
15969 allowed. */
15973 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15975 -- an integral constant-expression of integral or enumeration
15976 type; or
15978 -- the name of a non-type template-parameter; or
15980 -- the name of an object or function with external linkage...
15982 -- the address of an object or function with external linkage...
15984 -- a pointer to member... */
15985 /* Look for a non-type template parameter. */
15987 {
15999 }
16001 /* If the next token is "&", the argument must be the address of an
16002 object or function with external linkage. */
16005 {
16008 }
16009 /* See if we might have an id-expression. */
16016 {
16019 address_p,
16026 else
16027 {
16028 tree probe;
16031 {
16032 /* Strip the dereference temporarily. */
16035 }
16037 /* If we're in a template, we represent a qualified-id referring
16038 to a static data member as a SCOPE_REF even if the scope isn't
16039 dependent so that we can check access control later. */
16044 {
16045 /* A variable without external linkage might still be a
16046 valid constant-expression, so no error is issued here
16047 if the external-linkage check fails. */
16050 }
16052 /* All overloaded functions are allowed; if the external
16053 linkage test does not pass, an error will be issued
16054 later. */
16055 ;
16059 /* A pointer-to-member. */
16060 ;
16062 ;
16063 else
16067 {
16070 tf_warning_or_error);
16071 else
16074 }
16075 }
16076 }
16077 /* If the argument started with "&", there are no other valid
16078 alternatives at this point. */
16080 {
16083 }
16085 general_expr:
16086 /* If the argument wasn't successfully parsed as a type-id followed
16087 by '>>', the argument can only be a constant expression now.
16088 Otherwise, we try parsing the constant-expression tentatively,
16089 because the argument could really be a type-id. */
16095 else
16096 {
16097 /* With C++17 generalized non-type template arguments we need to handle
16098 lvalue constant expressions, too. */
16101 }
16109 /* We did our best to parse the argument as a non type-id, but that
16110 was the only alternative that matched (albeit with a '>' after
16111 it). We can assume it's just a typo from the user, and a
16112 diagnostic will then be issued. */
16114 }
16116 /* Parse an explicit-instantiation.
16118 explicit-instantiation:
16119 template declaration
16121 Although the standard says `declaration', what it really means is:
16123 explicit-instantiation:
16124 template decl-specifier-seq [opt] declarator [opt] ;
16126 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16127 supposed to be allowed. A defect report has been filed about this
16128 issue.
16130 GNU Extension:
16132 explicit-instantiation:
16133 storage-class-specifier template
16134 decl-specifier-seq [opt] declarator [opt] ;
16135 function-specifier template
16136 decl-specifier-seq [opt] declarator [opt] ; */
16138 static void
16140 {
16142 cp_decl_specifier_seq decl_specifiers;
16147 /* Look for an (optional) storage-class-specifier or
16148 function-specifier. */
16150 {
16151 extension_specifier
16154 extension_specifier
16157 }
16159 /* Look for the `template' keyword. */
16161 /* Let the front end know that we are processing an explicit
16162 instantiation. */
16164 /* [temp.explicit] says that we are supposed to ignore access
16165 control while processing explicit instantiation directives. */
16167 /* Parse a decl-specifier-seq. */
16169 CP_PARSER_FLAGS_OPTIONAL,
16172 /* If there was exactly one decl-specifier, and it declared a class,
16173 and there's no declarator, then we have an explicit type
16174 instantiation. */
16176 {
16177 tree type;
16181 /* Turn access control back on for names used during
16182 template instantiation. */
16187 }
16188 else
16189 {
16191 tree decl;
16193 /* Parse the declarator. */
16194 declarator
16205 {
16208 "explicit instantiation shall not use"
16212 "explicit instantiation shall not use"
16217 /* Turn access control back on for names used during
16218 template instantiation. */
16220 /* Do the explicit instantiation. */
16222 }
16223 else
16224 {
16226 /* Skip the body of the explicit instantiation. */
16228 }
16229 }
16230 /* We're done with the instantiation. */
16236 }
16238 /* Parse an explicit-specialization.
16240 explicit-specialization:
16241 template < > declaration
16243 Although the standard says `declaration', what it really means is:
16245 explicit-specialization:
16246 template <> decl-specifier [opt] init-declarator [opt] ;
16247 template <> function-definition
16248 template <> explicit-specialization
16249 template <> template-declaration */
16251 static void
16253 {
16257 /* Look for the `template' keyword. */
16259 /* Look for the `<'. */
16261 /* Look for the `>'. */
16263 /* We have processed another parameter list. */
16265 /* [temp]
16267 A template ... explicit specialization ... shall not have C
16268 linkage. */
16270 {
16272 /* Give it C++ linkage to avoid confusing other parts of the
16273 front end. */
16276 }
16277 else
16279 /* Let the front end know that we are beginning a specialization. */
16281 {
16284 }
16286 /* If the next keyword is `template', we need to figure out whether
16287 or not we're looking a template-declaration. */
16289 {
16294 else
16296 }
16297 else
16298 /* Parse the dependent declaration. */
16304 /* We're done with the specialization. */
16306 /* For the erroneous case of a template with C linkage, we pushed an
16307 implicit C++ linkage scope; exit that scope now. */
16310 /* We're done with this parameter list. */
16312 }
16314 /* Parse a type-specifier.
16316 type-specifier:
16317 simple-type-specifier
16318 class-specifier
16319 enum-specifier
16320 elaborated-type-specifier
16321 cv-qualifier
16323 GNU Extension:
16325 type-specifier:
16326 __complex__
16328 Returns a representation of the type-specifier. For a
16329 class-specifier, enum-specifier, or elaborated-type-specifier, a
16330 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16332 The parser flags FLAGS is used to control type-specifier parsing.
16334 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16335 in a decl-specifier-seq.
16337 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16338 class-specifier, enum-specifier, or elaborated-type-specifier, then
16339 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16340 if a type is declared; 2 if it is defined. Otherwise, it is set to
16341 zero.
16343 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16344 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16345 is set to FALSE. */
16347 static tree
16349 cp_parser_flags flags,
16354 {
16360 /* Assume this type-specifier does not declare a new type. */
16363 /* And that it does not specify a cv-qualifier. */
16366 /* Peek at the next token. */
16369 /* If we're looking at a keyword, we can use that to guide the
16370 production we choose. */
16373 {
16378 /* Look for the enum-specifier. */
16380 /* If that worked, we're done. */
16382 {
16387 type_spec,
16388 token,
16391 }
16392 else
16395 /* Any of these indicate either a class-specifier, or an
16396 elaborated-type-specifier. */
16403 /* Parse tentatively so that we can back up if we don't find a
16404 class-specifier. */
16406 /* Look for the class-specifier. */
16409 /* If that worked, we're done. */
16411 {
16416 type_spec,
16417 token,
16420 }
16422 /* Fall through. */
16423 elaborated_type_specifier:
16424 /* We're declaring (not defining) a class or enum. */
16428 /* Fall through. */
16430 /* Look for an elaborated-type-specifier. */
16431 type_spec
16432 = (cp_parser_elaborated_type_specifier
16435 is_declaration));
16438 type_spec,
16439 token,
16462 /* The `__complex__' keyword is a GNU extension. */
16468 }
16470 /* Handle simple keywords. */
16472 {
16474 {
16477 }
16479 }
16481 /* If we do not already have a type-specifier, assume we are looking
16482 at a simple-type-specifier. */
16484 decl_specs,
16485 flags);
16487 /* If we didn't find a type-specifier, and a type-specifier was not
16488 optional in this context, issue an error message. */
16490 {
16493 }
16496 }
16498 /* Parse a simple-type-specifier.
16500 simple-type-specifier:
16501 :: [opt] nested-name-specifier [opt] type-name
16502 :: [opt] nested-name-specifier template template-id
16503 char
16504 wchar_t
16505 bool
16506 short
16507 int
16508 long
16509 signed
16510 unsigned
16511 float
16512 double
16513 void
16515 C++11 Extension:
16517 simple-type-specifier:
16518 auto
16519 decltype ( expression )
16520 char16_t
16521 char32_t
16522 __underlying_type ( type-id )
16524 C++17 extension:
16526 nested-name-specifier(opt) template-name
16528 GNU Extension:
16530 simple-type-specifier:
16531 __int128
16532 __typeof__ unary-expression
16533 __typeof__ ( type-id )
16534 __typeof__ ( type-id ) { initializer-list , [opt] }
16536 Concepts Extension:
16538 simple-type-specifier:
16539 constrained-type-specifier
16541 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16542 appropriately updated. */
16544 static tree
16547 cp_parser_flags flags)
16548 {
16553 /* Peek at the next token. */
16556 /* If we're looking at a keyword, things are easy. */
16558 {
16593 {
16596 }
16625 {
16626 /* The 'auto' might be the placeholder return type for a function decl
16627 with trailing return type. */
16636 {
16638 {
16645 }
16648 {
16651 }
16654 }
16658 {
16661 }
16664 {
16667 }
16668 else
16672 {
16675 "use of %<auto%> in lambda parameter declaration "
16676 "only available with "
16678 }
16681 "use of %<auto%> in parameter declaration "
16682 "only available with "
16686 "ISO C++ forbids use of %<auto%> in parameter "
16688 }
16689 else
16694 /* Since DR 743, decltype can either be a simple-type-specifier by
16695 itself or begin a nested-name-specifier. Parsing it will replace
16696 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16697 handling below decide what to do. */
16703 /* Consume the `typeof' token. */
16705 /* Parse the operand to `typeof'. */
16707 /* If it is not already a TYPE, take its type. */
16713 token,
16722 token,
16732 token,
16737 }
16739 /* If token is an already-parsed decltype not followed by ::,
16740 it's a simple-type-specifier. */
16743 {
16746 {
16748 token,
16750 /* Remember that we are handling a decltype in order to
16751 implement the resolution of DR 1510 when the argument
16752 isn't instantiation dependent. */
16754 }
16757 }
16759 /* If the type-specifier was for a built-in type, we're done. */
16761 {
16762 /* Record the type. */
16769 type,
16770 token,
16775 /* Consume the token. */
16781 /* There is no valid C++ program where a non-template type is
16782 followed by a "<". That usually indicates that the user thought
16783 that the type was a template. */
16788 }
16790 /* The type-specifier must be a user-defined type. */
16792 {
16796 /* Don't gobble tokens or issue error messages if this is an
16797 optional type-specifier. */
16803 /* Look for the optional `::' operator. */
16804 global_p
16808 /* Look for the nested-name specifier. */
16809 qualified_p
16816 /* If we have seen a nested-name-specifier, and the next token
16817 is `template', then we are using the template-id production. */
16820 {
16821 /* Look for the template-id. */
16825 none_type,
16827 /* If the template-id did not name a type, we are out of
16828 luck. */
16830 {
16833 }
16834 }
16835 /* Otherwise, look for a type-name. */
16836 else
16838 /* Keep track of all name-lookups performed in class scopes. */
16840 && !global_p
16841 && !qualified_p
16845 /* If it didn't work out, we don't have a TYPE. */
16850 {
16864 {
16866 none_type,
16876 else
16877 {
16882 }
16883 }
16884 else
16890 }
16893 token,
16895 }
16897 /* If we didn't get a type-name, issue an error message. */
16899 {
16902 }
16905 {
16906 /* See if TYPE is an Objective-C type, and if so, parse and
16907 accept any protocol references following it. Do this before
16908 the cp_parser_check_for_invalid_template_id() call, because
16909 Objective-C types can be followed by '<...>' which would
16910 enclose protocol names rather than template arguments, and so
16911 everything is fine. */
16914 {
16918 /* Clobber the "unqualified" type previously entered into
16919 DECL_SPECS with the new, improved protocol-qualified version. */
16924 }
16926 /* There is no valid C++ program where a non-template type is
16927 followed by a "<". That usually indicates that the user
16928 thought that the type was a template. */
16930 none_type,
16932 }
16935 }
16937 /* Parse a type-name.
16939 type-name:
16940 class-name
16941 enum-name
16942 typedef-name
16943 simple-template-id [in c++0x]
16945 enum-name:
16946 identifier
16948 typedef-name:
16949 identifier
16951 Concepts:
16953 type-name:
16954 concept-name
16955 partial-concept-id
16957 concept-name:
16958 identifier
16960 Returns a TYPE_DECL for the type. */
16962 static tree
16964 {
16966 }
16968 /* See above. */
16969 static tree
16971 {
16972 tree type_decl;
16974 /* We can't know yet whether it is a class-name or not. */
16976 /* Try a class-name. */
16978 typename_keyword_p,
16980 none_type,
16984 /* If it's not a class-name, keep looking. */
16986 {
16988 /* It must be a typedef-name or an enum-name. */
16992 /* It is either a simple-template-id representing an
16993 instantiation of an alias template... */
16997 none_type,
16999 /* Note that this must be an instantiation of an alias template
17000 because [temp.names]/6 says:
17002 A template-id that names an alias template specialization
17003 is a type-name.
17005 Whereas [temp.names]/7 says:
17007 A simple-template-id that names a class template
17008 specialization is a class-name.
17010 With concepts, this could also be a partial-concept-id that
17011 declares a non-type template parameter. */
17018 else
17022 /* ... Or a typedef-name or an enum-name. */
17024 }
17027 }
17029 /* Check if DECL and ARGS can form a constrained-type-specifier.
17030 If ARGS is non-null, we try to form a concept check of the
17031 form DECL<?, ARGS> where ? is a wildcard that matches any
17032 kind of template argument. If ARGS is NULL, then we try to
17033 form a concept check of the form DECL<?>. */
17035 static tree
17038 {
17041 /* If we a constrained-type-specifier cannot be deduced. */
17045 /* A constrained type specifier can only be found in an
17046 overload set or as a reference to a template declaration.
17048 FIXME: This might be masking a bug. It's possible that
17049 that the deduction below is causing template specializations
17050 to be formed with the wildcard as an argument. */
17054 /* Try to build a call expression that evaluates the
17055 concept. This can fail if the overload set refers
17056 only to non-templates. */
17062 /* Deduce the checked constraint and the prototype parameter.
17064 FIXME: In certain cases, failure to deduce should be a
17065 diagnosable error. */
17066 tree conc;
17067 tree proto;
17071 /* In template parameter scope, this results in a constrained
17072 parameter. Return a descriptor of that parm. */
17076 /* In a parameter-declaration-clause, constrained-type
17077 specifiers result in invented template parameters. */
17079 {
17082 }
17083 else
17084 {
17085 /* Otherwise, we're in a context where the constrained
17086 type name is deduced and the constraint applies
17087 after deduction. */
17089 }
17092 }
17094 /* If DECL refers to a concept, return a TYPE_DECL representing
17095 the result of using the constrained type specifier in the
17096 current context. DECL refers to a concept if
17098 - it is an overload set containing a function concept taking a single
17099 type argument, or
17101 - it is a variable concept taking a single type argument. */
17103 static tree
17105 {
17111 else
17113 }
17115 /* Check if DECL and ARGS form a partial-concept-id. If so,
17116 assign ID to the resulting constrained placeholder.
17118 Returns true if the partial-concept-id designates a placeholder
17119 and false otherwise. Note that *id is set to NULL_TREE in
17120 this case. */
17122 static tree
17124 {
17126 }
17128 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17129 or a concept-name.
17131 enum-name:
17132 identifier
17134 typedef-name:
17135 identifier
17137 concept-name:
17138 identifier
17140 Returns a TYPE_DECL for the type. */
17142 static tree
17144 {
17145 tree type_decl;
17146 tree identifier;
17153 /* Look up the type-name. */
17158 /* If we found an overload set, then it may refer to a concept-name. */
17164 {
17165 /* See if this is an Objective-C type. */
17170 }
17172 /* Issue an error if we did not find a type-name. */
17174 /* In Objective-C, we have the complication that class names are
17175 normally type names and start declarations (eg, the
17176 "NSObject" in "NSObject *object;"), but can be used in an
17177 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17178 is an expression. So, a classname followed by a dot is not a
17179 valid type-name. */
17182 {
17187 }
17188 /* Remember that the name was used in the definition of the
17189 current class so that we can check later to see if the
17190 meaning would have been different after the class was
17191 entirely defined. */
17197 }
17199 /* Parse an elaborated-type-specifier. Note that the grammar given
17200 here incorporates the resolution to DR68.
17202 elaborated-type-specifier:
17203 class-key :: [opt] nested-name-specifier [opt] identifier
17204 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17205 enum-key :: [opt] nested-name-specifier [opt] identifier
17206 typename :: [opt] nested-name-specifier identifier
17207 typename :: [opt] nested-name-specifier template [opt]
17208 template-id
17210 GNU extension:
17212 elaborated-type-specifier:
17213 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17214 class-key attributes :: [opt] nested-name-specifier [opt]
17215 template [opt] template-id
17216 enum attributes :: [opt] nested-name-specifier [opt] identifier
17218 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17219 declared `friend'. If IS_DECLARATION is TRUE, then this
17220 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17221 something is being declared.
17223 Returns the TYPE specified. */
17225 static tree
17229 {
17231 tree identifier;
17234 tree globalscope;
17237 /* See if we're looking at the `enum' keyword. */
17239 {
17240 /* Consume the `enum' token. */
17242 /* Remember that it's an enumeration type. */
17244 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17245 enums) is used here. */
17248 {
17252 /* Consume the `struct' or `class' and parse it anyway. */
17254 }
17255 /* Parse the attributes. */
17257 }
17258 /* Or, it might be `typename'. */
17260 RID_TYPENAME))
17261 {
17262 /* Consume the `typename' token. */
17264 /* Remember that it's a `typename' type. */
17266 }
17267 /* Otherwise it must be a class-key. */
17268 else
17269 {
17273 /* Parse the attributes. */
17275 }
17277 /* Look for the `::' operator. */
17280 /* Look for the nested-name-specifier. */
17281 tree nested_name_specifier;
17283 {
17284 nested_name_specifier
17289 is_declaration);
17292 }
17293 else
17294 /* Even though `typename' is not present, the proposed resolution
17295 to Core Issue 180 says that in `class A<T>::B', `B' should be
17296 considered a type-name, even if `A<T>' is dependent. */
17297 nested_name_specifier
17302 is_declaration);
17303 /* For everything but enumeration types, consider a template-id.
17304 For an enumeration type, consider only a plain identifier. */
17306 {
17308 tree decl;
17310 /* Allow the `template' keyword. */
17312 /* If we didn't see `template', we don't know if there's a
17313 template-id or not. */
17316 /* Parse the template-id. */
17320 tag_type,
17321 is_declaration);
17322 /* If we didn't find a template-id, look for an ordinary
17323 identifier. */
17325 ;
17326 /* We can get here when cp_parser_template_id, called by
17327 cp_parser_class_name with tag_type == none_type, succeeds
17328 and caches a BASELINK. Then, when called again here,
17329 instead of failing and returning an error_mark_node
17330 returns it (see template/typename17.C in C++11).
17331 ??? Could we diagnose this earlier? */
17333 {
17336 }
17337 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17338 in effect, then we must assume that, upon instantiation, the
17339 template will correspond to a class. */
17343 typename_type,
17345 /* If the `typename' keyword is in effect and DECL is not a type
17346 decl, then type is non existent. */
17348 ;
17350 {
17354 /* If the next token is a semicolon, this must be a specialization,
17355 instantiation, or friend declaration. Check the scope while we
17356 still know whether or not we had a nested-name-specifier. */
17361 }
17364 }
17367 {
17372 {
17375 }
17377 /* For a `typename', we needn't call xref_tag. */
17383 /* Template parameter lists apply only if we are not within a
17384 function parameter list. */
17385 bool template_parm_lists_apply
17394 /* Look up a qualified name in the usual way. */
17396 {
17397 tree decl;
17398 tree ambiguous_decls;
17401 tag_type,
17408 /* If the lookup was ambiguous, an error will already have been
17409 issued. */
17413 /* If we are parsing friend declaration, DECL may be a
17414 TEMPLATE_DECL tree node here. However, we need to check
17415 whether this TEMPLATE_DECL results in valid code. Consider
17416 the following example:
17418 namespace N {
17419 template <class T> class C {};
17420 }
17421 class X {
17422 template <class T> friend class N::C; // #1, valid code
17423 };
17424 template <class T> class Y {
17425 friend class N::C; // #2, invalid code
17426 };
17428 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17429 name lookup of `N::C'. We see that friend declaration must
17430 be template for the code to be valid. Note that
17431 processing_template_decl does not work here since it is
17432 always 1 for the above two cases. */
17434 decl = (cp_parser_maybe_treat_template_as_class
17439 {
17441 identifier,
17444 }
17447 {
17451 allow_template);
17455 }
17457 /* Forward declarations of nested types, such as
17459 class C1::C2;
17460 class C1::C2::C3;
17462 are invalid unless all components preceding the final '::'
17463 are complete. If all enclosing types are complete, these
17464 declarations become merely pointless.
17466 Invalid forward declarations of nested types are errors
17467 caught elsewhere in parsing. Those that are pointless arrive
17468 here. */
17475 }
17476 else
17477 {
17478 /* An elaborated-type-specifier sometimes introduces a new type and
17479 sometimes names an existing type. Normally, the rule is that it
17480 introduces a new type only if there is not an existing type of
17481 the same name already in scope. For example, given:
17483 struct S {};
17484 void f() { struct S s; }
17486 the `struct S' in the body of `f' is the same `struct S' as in
17487 the global scope; the existing definition is used. However, if
17488 there were no global declaration, this would introduce a new
17489 local class named `S'.
17491 An exception to this rule applies to the following code:
17493 namespace N { struct S; }
17495 Here, the elaborated-type-specifier names a new type
17496 unconditionally; even if there is already an `S' in the
17497 containing scope this declaration names a new type.
17498 This exception only applies if the elaborated-type-specifier
17499 forms the complete declaration:
17501 [class.name]
17503 A declaration consisting solely of `class-key identifier ;' is
17504 either a redeclaration of the name in the current scope or a
17505 forward declaration of the identifier as a class name. It
17506 introduces the name into the current scope.
17508 We are in this situation precisely when the next token is a `;'.
17510 An exception to the exception is that a `friend' declaration does
17511 *not* name a new type; i.e., given:
17513 struct S { friend struct T; };
17515 `T' is not a new type in the scope of `S'.
17517 Also, `new struct S' or `sizeof (struct S)' never results in the
17518 definition of a new type; a new type can only be declared in a
17519 declaration context. */
17521 tag_scope ts;
17525 /* Friends have special name lookup rules. */
17529 CPP_SEMICOLON))
17530 /* This is a `class-key identifier ;' */
17532 else
17535 template_p =
17536 (template_parm_lists_apply
17539 /* An unqualified name was used to reference this type, so
17540 there were no qualifying templates. */
17548 }
17549 }
17554 /* Allow attributes on forward declarations of classes. */
17556 {
17566 else
17569 }
17572 {
17573 /* Indicate whether this class was declared as a `class' or as a
17574 `struct'. */
17578 }
17580 /* A "<" cannot follow an elaborated type specifier. If that
17581 happens, the user was probably trying to form a template-id. */
17586 }
17588 /* Parse an enum-specifier.
17590 enum-specifier:
17591 enum-head { enumerator-list [opt] }
17592 enum-head { enumerator-list , } [C++0x]
17594 enum-head:
17595 enum-key identifier [opt] enum-base [opt]
17596 enum-key nested-name-specifier identifier enum-base [opt]
17598 enum-key:
17599 enum
17600 enum class [C++0x]
17601 enum struct [C++0x]
17603 enum-base: [C++0x]
17604 : type-specifier-seq
17606 opaque-enum-specifier:
17607 enum-key identifier enum-base [opt] ;
17609 GNU Extensions:
17610 enum-key attributes[opt] identifier [opt] enum-base [opt]
17611 { enumerator-list [opt] }attributes[opt]
17612 enum-key attributes[opt] identifier [opt] enum-base [opt]
17613 { enumerator-list, }attributes[opt] [C++0x]
17615 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17616 if the token stream isn't an enum-specifier after all. */
17618 static tree
17620 {
17621 tree identifier;
17623 tree prev_scope;
17625 tree attributes;
17638 /* Parse tentatively so that we can back up if we don't find a
17639 enum-specifier. */
17642 /* Caller guarantees that the current token is 'enum', an identifier
17643 possibly follows, and the token after that is an opening brace.
17644 If we don't have an identifier, fabricate an anonymous name for
17645 the enumeration being defined. */
17648 /* Parse the "class" or "struct", which indicates a scoped
17649 enumeration type in C++0x. */
17652 {
17656 /* Consume the `struct' or `class' token. */
17660 }
17664 /* Clear the qualification. */
17669 /* Figure out in what scope the declaration is being placed. */
17675 nested_name_specifier
17683 {
17684 tree name;
17688 enum_type,
17693 input_location);
17695 {
17698 {
17699 /* Are template enums allowed in ISO? */
17703 /* ignore a typename reference, for it will be solved by name
17704 in start_enum. */
17706 }
17707 }
17710 else
17711 {
17716 }
17717 }
17718 else
17719 {
17722 else
17723 {
17729 }
17730 }
17733 /* Check for the `:' that denotes a specified underlying type in C++0x.
17734 Note that a ':' could also indicate a bitfield width, however. */
17736 {
17737 cp_decl_specifier_seq type_specifiers;
17739 /* Consume the `:'. */
17742 /* Parse the type-specifier-seq. */
17747 /* At this point this is surely not elaborated type specifier. */
17756 /* If that didn't work, stop. */
17758 {
17764 }
17765 }
17767 /* Look for the `{' but don't consume it yet. */
17769 {
17771 {
17774 {
17777 }
17778 }
17779 /* An opaque-enum-specifier must have a ';' here. */
17782 {
17785 {
17788 }
17789 }
17790 }
17796 {
17798 {
17802 }
17804 {
17806 }
17807 }
17809 /* Issue an error message if type-definitions are forbidden here. */
17812 else
17813 /* Create the new type. We do this before consuming the opening
17814 brace so the enum will be recorded as being on the line of its
17815 tag (or the 'enum' keyword, if there is no tag). */
17819 /* If the next token is not '{' it is an opaque-enum-specifier or an
17820 elaborated-type-specifier. */
17822 {
17826 {
17827 /* The following catches invalid code such as:
17828 enum class S<int>::E { A, B, C }; */
17836 {
17840 nested_name_specifier);
17842 }
17845 {
17847 "%qT for enum declaration does not name a class "
17850 }
17851 /* If that scope does not contain the scope in which the
17852 class was originally declared, the program is invalid. */
17854 nested_name_specifier))
17855 {
17858 "declaration of %qD in namespace %qD which does not "
17861 else
17863 "declaration of %qD in %qD which does not "
17867 }
17868 /* If that scope is the scope where the declaration is being placed
17869 the program is invalid. */
17873 {
17877 }
17878 }
17883 /* Consume the opening brace. */
17890 {
17894 }
17895 else
17896 {
17902 }
17906 /* If the next token is not '}', then there are some enumerators. */
17908 {
17912 }
17913 else
17916 /* Consume the final '}'. */
17922 }
17923 else
17924 {
17925 /* If a ';' follows, then it is an opaque-enum-specifier
17926 and additional restrictions apply. */
17928 {
17935 }
17936 }
17938 /* Look for trailing attributes to apply to this enumeration, and
17939 apply them if appropriate. */
17941 {
17944 trailing_attr,
17946 }
17948 /* Finish up the enumeration. */
17950 {
17955 }
17958 {
17960 {
17963 }
17965 {
17967 }
17968 }
17969 out:
17972 }
17974 /* Parse an enumerator-list. The enumerators all have the indicated
17975 TYPE.
17977 enumerator-list:
17978 enumerator-definition
17979 enumerator-list , enumerator-definition */
17981 static void
17983 {
17985 {
17986 /* Parse an enumerator-definition. */
17989 /* If the next token is not a ',', we've reached the end of
17990 the list. */
17993 /* Otherwise, consume the `,' and keep going. */
17995 /* If the next token is a `}', there is a trailing comma. */
17997 {
18002 }
18003 }
18004 }
18006 /* Parse an enumerator-definition. The enumerator has the indicated
18007 TYPE.
18009 enumerator-definition:
18010 enumerator
18011 enumerator = constant-expression
18013 enumerator:
18014 identifier
18016 GNU Extensions:
18018 enumerator-definition:
18019 enumerator attributes [opt]
18020 enumerator attributes [opt] = constant-expression */
18022 static void
18024 {
18025 tree identifier;
18026 tree value;
18027 location_t loc;
18029 /* Save the input location because we are interested in the location
18030 of the identifier and not the location of the explicit value. */
18033 /* Look for the identifier. */
18038 /* Parse any specified attributes. */
18041 /* If the next token is an '=', then there is an explicit value. */
18043 {
18044 /* Consume the `=' token. */
18046 /* Parse the value. */
18048 }
18049 else
18052 /* If we are processing a template, make sure the initializer of the
18053 enumerator doesn't contain any bare template parameter pack. */
18057 /* Create the enumerator. */
18059 }
18061 /* Parse a namespace-name.
18063 namespace-name:
18064 original-namespace-name
18065 namespace-alias
18067 Returns the NAMESPACE_DECL for the namespace. */
18069 static tree
18071 {
18072 tree identifier;
18073 tree namespace_decl;
18077 /* Get the name of the namespace. */
18082 /* Look up the identifier in the currently active scope. Look only
18083 for namespaces, due to:
18085 [basic.lookup.udir]
18087 When looking up a namespace-name in a using-directive or alias
18088 definition, only namespace names are considered.
18090 And:
18092 [basic.lookup.qual]
18094 During the lookup of a name preceding the :: scope resolution
18095 operator, object, function, and enumerator names are ignored.
18097 (Note that cp_parser_qualifying_entity only calls this
18098 function if the token after the name is the scope resolution
18099 operator.) */
18101 none_type,
18107 /* If it's not a namespace, issue an error. */
18110 {
18115 }
18118 }
18120 /* Parse a namespace-definition.
18122 namespace-definition:
18123 named-namespace-definition
18124 unnamed-namespace-definition
18126 named-namespace-definition:
18127 original-namespace-definition
18128 extension-namespace-definition
18130 original-namespace-definition:
18131 namespace identifier { namespace-body }
18133 extension-namespace-definition:
18134 namespace original-namespace-name { namespace-body }
18136 unnamed-namespace-definition:
18137 namespace { namespace-body } */
18139 static void
18141 {
18151 {
18155 }
18156 else
18159 /* Look for the `namespace' keyword. */
18162 /* Parse any specified attributes before the identifier. */
18165 /* Get the name of the namespace. We do not attempt to distinguish
18166 between an original-namespace-definition and an
18167 extension-namespace-definition at this point. The semantic
18168 analysis routines are responsible for that. */
18171 else
18174 /* Parse any specified attributes after the identifier. */
18177 {
18180 else
18182 }
18184 /* Start the namespace. */
18187 /* Parse any nested namespace definition. */
18189 {
18194 "nested namespace definitions only available with "
18199 {
18203 else
18204 {
18207 }
18210 }
18211 }
18213 /* Look for the `{' to validate starting the namespace. */
18216 /* "inline namespace" is equivalent to a stub namespace definition
18217 followed by a strong using directive. */
18219 {
18221 /* Set up namespace association. */
18225 /* Import the contents of the inline namespace. */
18229 }
18235 /* Parse the body of the namespace. */
18241 /* Finish the nested namespace definitions. */
18245 /* Finish the namespace. */
18248 /* Look for the final `}'. */
18250 }
18252 /* Parse a namespace-body.
18254 namespace-body:
18255 declaration-seq [opt] */
18257 static void
18259 {
18261 }
18263 /* Parse a namespace-alias-definition.
18265 namespace-alias-definition:
18266 namespace identifier = qualified-namespace-specifier ; */
18268 static void
18270 {
18271 tree identifier;
18272 tree namespace_specifier;
18276 /* Look for the `namespace' keyword. */
18278 /* Look for the identifier. */
18282 /* Look for the `=' token. */
18285 {
18287 /* Skip the definition. */
18292 }
18294 /* Look for the qualified-namespace-specifier. */
18295 namespace_specifier
18297 /* Look for the `;' token. */
18300 /* Register the alias in the symbol table. */
18302 }
18304 /* Parse a qualified-namespace-specifier.
18306 qualified-namespace-specifier:
18307 :: [opt] nested-name-specifier [opt] namespace-name
18309 Returns a NAMESPACE_DECL corresponding to the specified
18310 namespace. */
18312 static tree
18314 {
18315 /* Look for the optional `::'. */
18319 /* Look for the optional nested-name-specifier. */
18327 }
18329 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18330 access declaration.
18332 using-declaration:
18333 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18334 using :: unqualified-id ;
18336 access-declaration:
18337 qualified-id ;
18339 */
18341 static bool
18344 {
18348 tree decl;
18349 tree identifier;
18350 tree qscope;
18355 {
18358 }
18359 else
18360 {
18361 /* Look for the `using' keyword. */
18364 again:
18365 /* Peek at the next token. */
18367 /* See if it's `typename'. */
18369 {
18370 /* Remember that we've seen it. */
18372 /* Consume the `typename' token. */
18374 }
18375 }
18377 /* Look for the optional global scope qualification. */
18378 global_scope_p
18383 /* If we saw `typename', or didn't see `::', then there must be a
18384 nested-name-specifier present. */
18386 {
18392 {
18395 }
18396 }
18397 /* Otherwise, we could be in either of the two productions. In that
18398 case, treat the nested-name-specifier as optional. */
18399 else
18411 /* Something has already gone wrong; there's no need to parse
18412 further. Since an error has occurred, the return value of
18413 cp_parser_parse_definitely will be false, as required. */
18417 /* Parse the unqualified-id. */
18425 {
18430 }
18432 {
18437 "pack expansion in using-declaration only available "
18440 }
18442 /* The function we call to handle a using-declaration is different
18443 depending on what scope we are in. */
18445 ;
18448 /* [namespace.udecl]
18450 A using declaration shall not name a template-id. */
18453 else
18454 {
18456 {
18457 /* Create the USING_DECL. */
18464 {
18467 }
18468 else
18469 /* Add it to the list of members in this class. */
18471 }
18472 else
18473 {
18475 identifier,
18482 {
18485 }
18488 else
18490 }
18491 }
18495 {
18499 "comma-separated list in using-declaration only available "
18502 }
18504 /* Look for the final `;'. */
18509 "access declarations are deprecated "
18510 "in favour of using-declarations; "
18514 }
18516 /* Parse an alias-declaration.
18518 alias-declaration:
18519 using identifier attribute-specifier-seq [opt] = type-id */
18521 static tree
18523 {
18525 location_t id_location;
18527 cp_decl_specifier_seq decl_specs;
18531 /* Look for the `using' keyword. */
18532 cp_token *using_token
18554 /* Now we are going to parse the type-id of the declaration. */
18556 /*
18557 [dcl.type]/3 says:
18559 "A type-specifier-seq shall not define a class or enumeration
18560 unless it appears in the type-id of an alias-declaration (7.1.3) that
18561 is not the declaration of a template-declaration."
18563 In other words, if we currently are in an alias template, the
18564 type-id should not define a type.
18566 So let's set parser->type_definition_forbidden_message in that
18567 case; cp_parser_check_type_definition (called by
18568 cp_parser_class_specifier) will then emit an error if a type is
18569 defined in the type-id. */
18571 {
18575 }
18579 /* Restore the error message if need be. */
18585 {
18588 }
18590 /* A typedef-name can also be introduced by an alias-declaration. The
18591 identifier following the using keyword becomes a typedef-name. It has
18592 the same semantics as if it were introduced by the typedef
18593 specifier. In particular, it does not define a new type and it shall
18594 not appear in the type-id. */
18599 {
18602 ds_attribute,
18603 attrs_token);
18604 }
18606 ds_typedef,
18607 using_token);
18609 ds_alias,
18610 using_token);
18619 else
18625 // Attach constraints to the alias declaration.
18627 {
18631 }
18638 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18639 added into the symbol table; otherwise, return the TYPE_DECL. */
18643 {
18647 }
18650 }
18652 /* Parse a using-directive.
18654 using-directive:
18655 using namespace :: [opt] nested-name-specifier [opt]
18656 namespace-name ; */
18658 static void
18660 {
18661 tree namespace_decl;
18662 tree attribs;
18664 /* Look for the `using' keyword. */
18666 /* And the `namespace' keyword. */
18668 /* Look for the optional `::' operator. */
18670 /* And the optional nested-name-specifier. */
18676 /* Get the namespace being used. */
18678 /* And any specified attributes. */
18680 /* Update the symbol table. */
18682 /* Look for the final `;'. */
18684 }
18686 /* Parse an asm-definition.
18688 asm-definition:
18689 asm ( string-literal ) ;
18691 GNU Extension:
18693 asm-definition:
18694 asm volatile [opt] ( string-literal ) ;
18695 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18696 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18697 : asm-operand-list [opt] ) ;
18698 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18699 : asm-operand-list [opt]
18700 : asm-clobber-list [opt] ) ;
18701 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18702 : asm-clobber-list [opt]
18703 : asm-goto-list ) ; */
18705 static void
18707 {
18708 tree string;
18713 tree asm_stmt;
18721 /* Look for the `asm' keyword. */
18726 {
18729 }
18731 /* See if the next token is `volatile'. */
18734 {
18735 /* Remember that we saw the `volatile' keyword. */
18737 /* Consume the token. */
18739 }
18743 {
18744 /* Remember that we saw the `goto' keyword. */
18746 /* Consume the token. */
18748 }
18749 /* Look for the opening `('. */
18752 /* Look for the string. */
18755 {
18759 }
18761 /* If we're allowing GNU extensions, check for the extended assembly
18762 syntax. Unfortunately, the `:' tokens need not be separated by
18763 a space in C, and so, for compatibility, we tolerate that here
18764 too. Doing that means that we have to treat the `::' operator as
18765 two `:' tokens. */
18770 {
18775 /* The extended syntax was used. */
18778 /* Look for outputs. */
18780 {
18781 /* Consume the `:'. */
18783 /* Parse the output-operands. */
18785 CPP_COLON)
18787 CPP_SCOPE)
18789 CPP_CLOSE_PAREN)
18791 {
18795 }
18796 }
18797 /* If the next token is `::', there are no outputs, and the
18798 next token is the beginning of the inputs. */
18800 /* The inputs are coming next. */
18803 /* Look for inputs. */
18806 {
18807 /* Consume the `:' or `::'. */
18809 /* Parse the output-operands. */
18811 CPP_COLON)
18813 CPP_SCOPE)
18815 CPP_CLOSE_PAREN))
18816 {
18820 }
18821 }
18823 /* The clobbers are coming next. */
18826 /* Look for clobbers. */
18829 {
18831 /* Consume the `:' or `::'. */
18833 /* Parse the clobbers. */
18835 CPP_COLON)
18837 CPP_CLOSE_PAREN))
18839 }
18842 /* The labels are coming next. */
18845 /* Look for labels. */
18848 {
18850 /* Consume the `:' or `::'. */
18852 /* Parse the labels. */
18854 }
18858 }
18862 /* Look for the closing `)'. */
18870 {
18871 /* Create the ASM_EXPR. */
18873 {
18876 /* If the extended syntax was not used, mark the ASM_EXPR. */
18878 {
18884 }
18885 }
18886 else
18888 }
18889 }
18891 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18892 type that comes from the decl-specifier-seq. */
18894 static tree
18896 {
18899 {
18912 }
18915 }
18917 /* Declarators [gram.dcl.decl] */
18919 /* Parse an init-declarator.
18921 init-declarator:
18922 declarator initializer [opt]
18924 GNU Extension:
18926 init-declarator:
18927 declarator asm-specification [opt] attributes [opt] initializer [opt]
18929 function-definition:
18930 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18931 function-body
18932 decl-specifier-seq [opt] declarator function-try-block
18934 GNU Extension:
18936 function-definition:
18937 __extension__ function-definition
18939 TM Extension:
18941 function-definition:
18942 decl-specifier-seq [opt] declarator function-transaction-block
18944 The DECL_SPECIFIERS apply to this declarator. Returns a
18945 representation of the entity declared. If MEMBER_P is TRUE, then
18946 this declarator appears in a class scope. The new DECL created by
18947 this declarator is returned.
18949 The CHECKS are access checks that should be performed once we know
18950 what entity is being declared (and, therefore, what classes have
18951 befriended it).
18953 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18954 for a function-definition here as well. If the declarator is a
18955 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18956 be TRUE upon return. By that point, the function-definition will
18957 have been completely parsed.
18959 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18960 is FALSE.
18962 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18963 parsed declaration if it is an uninitialized single declarator not followed
18964 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18965 if present, will not be consumed. If returned, this declarator will be
18966 created with SD_INITIALIZED but will not call cp_finish_decl.
18968 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18969 and there is an initializer, the pointed location_t is set to the
18970 location of the '=' or `(', or '{' in C++11 token introducing the
18971 initializer. */
18973 static tree
18984 {
18988 tree prefix_attributes;
18990 tree asm_specification;
18991 tree initializer;
18993 tree scope;
18995 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18996 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18997 "(...)". */
19008 /* Gather the attributes that were provided with the
19009 decl-specifiers. */
19012 /* Assume that this is not the declarator for a function
19013 definition. */
19017 /* Default arguments are only permitted for function parameters. */
19021 /* Defer access checks while parsing the declarator; we cannot know
19022 what names are accessible until we know what is being
19023 declared. */
19033 {
19034 // C++17 deduction guide.
19043 }
19045 /* Parse the declarator. */
19046 declarator
19051 /* Gather up the deferred checks. */
19056 /* If the DECLARATOR was erroneous, there's no need to go
19057 further. */
19062 {
19067 sfk_none);
19070 }
19072 /* Check that the number of template-parameter-lists is OK. */
19082 /* Figure out what scope the entity declared by the DECLARATOR is
19083 located in. `grokdeclarator' sometimes changes the scope, so
19084 we compute it now. */
19087 /* Perform any lookups in the declared type which were thought to be
19088 dependent, but are not in the scope of the declarator. */
19089 decl_specifiers->type
19092 /* If we're allowing GNU extensions, look for an
19093 asm-specification. */
19095 {
19096 /* Look for an asm-specification. */
19099 }
19100 else
19103 /* Look for attributes. */
19107 /* Peek at the next token. */
19113 {
19114 /* Check to see if the token indicates the start of a
19115 function-definition. */
19117 {
19119 {
19120 /* If a function-definition should not appear here, issue an
19121 error message. */
19125 }
19127 location_t func_brace_location
19130 /* Neither attributes nor an asm-specification are allowed
19131 on a function-definition. */
19134 "an asm-specification is not allowed "
19138 "attributes are not allowed "
19140 /* This is a function-definition. */
19143 /* Parse the function definition. */
19146 decl_specifiers,
19147 declarator,
19148 prefix_attributes);
19149 else
19150 decl =
19151 (cp_parser_function_definition_from_specifiers_and_declarator
19155 {
19156 /* This is where the prologue starts... */
19159 }
19162 }
19163 }
19165 {
19166 /* A non-template declaration involving a function parameter list
19167 containing an implicit template parameter will be made into a
19168 template. If the resulting declaration is not going to be an
19169 actual function then finish the template scope here to prevent it.
19170 An error message will be issued once we have a decl to talk about.
19172 FIXME probably we should do type deduction rather than create an
19173 implicit template, but the standard currently doesn't allow it. */
19176 }
19178 /* [dcl.dcl]
19180 Only in function declarations for constructors, destructors, and
19181 type conversions can the decl-specifier-seq be omitted.
19183 We explicitly postpone this check past the point where we handle
19184 function-definitions because we tolerate function-definitions
19185 that are missing their return types in some modes. */
19187 {
19191 }
19193 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19197 {
19208 {
19214 }
19215 }
19216 else
19217 {
19218 /* If the init-declarator isn't initialized and isn't followed by a
19219 `,' or `;', it's not a valid init-declarator. */
19222 {
19225 else
19226 {
19230 }
19231 }
19234 }
19236 /* Because start_decl has side-effects, we should only call it if we
19237 know we're going ahead. By this point, we know that we cannot
19238 possibly be looking at any other construct. */
19241 /* Enter the newly declared entry in the symbol table. If we're
19242 processing a declaration in a class-specifier, we wait until
19243 after processing the initializer. */
19245 {
19253 /* Adjust location of decl if declarator->id_loc is more appropriate:
19254 set, and decl wasn't merged with another decl, in which case its
19255 location would be different from input_location, and more accurate. */
19260 }
19262 /* Enter the SCOPE. That way unqualified names appearing in the
19263 initializer will be looked up in SCOPE. */
19266 /* Perform deferred access control checks, now that we know in which
19267 SCOPE the declared entity resides. */
19269 {
19272 /* If the entity being declared is a function, pretend that we
19273 are in its scope. If it is a `friend', it may have access to
19274 things that would not otherwise be accessible. */
19276 {
19279 }
19281 /* Perform access checks for template parameters. */
19284 /* Perform the access control checks for the declarator and the
19285 decl-specifiers. */
19288 /* Restore the saved value. */
19291 }
19293 /* Parse the initializer. */
19298 {
19300 {
19303 else
19304 {
19305 /* If the declaration was erroneous, we don't really
19306 know what the user intended, so just silently
19307 consume the initializer. */
19314 }
19315 }
19316 else
19317 {
19318 /* We want to record the extra mangling scope for in-class
19319 initializers of class members and initializers of static data
19320 member templates. The former involves deferring
19321 parsing of the initializer until end of class as with default
19322 arguments. So right here we only handle the latter. */
19332 }
19333 }
19335 /* The old parser allows attributes to appear after a parenthesized
19336 initializer. Mark Mitchell proposed removing this functionality
19337 on the GCC mailing lists on 2002-08-13. This parser accepts the
19338 attributes -- but ignores them. */
19345 /* And now complain about a non-function implicit template. */
19350 /* For an in-class declaration, use `grokfield' to create the
19351 declaration. */
19353 {
19355 {
19358 }
19367 }
19369 /* Finish processing the declaration. But, skip member
19370 declarations. */
19372 {
19375 asm_specification,
19376 /* If the initializer is in parentheses, then this is
19377 a direct-initialization, which means that an
19378 `explicit' constructor is OK. Otherwise, an
19379 `explicit' constructor cannot be used. */
19382 }
19385 /* Core issue #226 (C++0x only): A default template-argument
19386 shall not be specified in a friend class template
19387 declaration. */
19396 {
19399 else
19401 }
19408 }
19410 /* Parse a declarator.
19412 declarator:
19413 direct-declarator
19414 ptr-operator declarator
19416 abstract-declarator:
19417 ptr-operator abstract-declarator [opt]
19418 direct-abstract-declarator
19420 GNU Extensions:
19422 declarator:
19423 attributes [opt] direct-declarator
19424 attributes [opt] ptr-operator declarator
19426 abstract-declarator:
19427 attributes [opt] ptr-operator abstract-declarator [opt]
19428 attributes [opt] direct-abstract-declarator
19430 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19431 detect constructor, destructor or conversion operators. It is set
19432 to -1 if the declarator is a name, and +1 if it is a
19433 function. Otherwise it is set to zero. Usually you just want to
19434 test for >0, but internally the negative value is used.
19436 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19437 a decl-specifier-seq unless it declares a constructor, destructor,
19438 or conversion. It might seem that we could check this condition in
19439 semantic analysis, rather than parsing, but that makes it difficult
19440 to handle something like `f()'. We want to notice that there are
19441 no decl-specifiers, and therefore realize that this is an
19442 expression, not a declaration.)
19444 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19445 the declarator is a direct-declarator of the form "(...)".
19447 MEMBER_P is true iff this declarator is a member-declarator.
19449 FRIEND_P is true iff this declarator is a friend. */
19453 cp_parser_declarator_kind dcl_kind,
19457 {
19460 cp_cv_quals cv_quals;
19461 tree class_type;
19464 /* Assume this is not a constructor, destructor, or type-conversion
19465 operator. */
19472 /* Check for the ptr-operator production. */
19474 /* Parse the ptr-operator. */
19480 /* If that worked, then we have a ptr-operator. */
19482 {
19483 /* If a ptr-operator was found, then this declarator was not
19484 parenthesized. */
19487 /* The dependent declarator is optional if we are parsing an
19488 abstract-declarator. */
19492 /* Parse the dependent declarator. */
19497 friend_p);
19499 /* If we are parsing an abstract-declarator, we must handle the
19500 case where the dependent declarator is absent. */
19505 declarator = cp_parser_make_indirect_declarator
19507 }
19508 /* Everything else is a direct-declarator. */
19509 else
19510 {
19513 CPP_OPEN_PAREN);
19515 ctor_dtor_or_conv_p,
19517 }
19522 }
19524 /* Parse a direct-declarator or direct-abstract-declarator.
19526 direct-declarator:
19527 declarator-id
19528 direct-declarator ( parameter-declaration-clause )
19529 cv-qualifier-seq [opt]
19530 ref-qualifier [opt]
19531 exception-specification [opt]
19532 direct-declarator [ constant-expression [opt] ]
19533 ( declarator )
19535 direct-abstract-declarator:
19536 direct-abstract-declarator [opt]
19537 ( parameter-declaration-clause )
19538 cv-qualifier-seq [opt]
19539 ref-qualifier [opt]
19540 exception-specification [opt]
19541 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19542 ( abstract-declarator )
19544 Returns a representation of the declarator. DCL_KIND is
19545 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19546 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19547 we are parsing a direct-declarator. It is
19548 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19549 of ambiguity we prefer an abstract declarator, as per
19550 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19551 as for cp_parser_declarator. */
19555 cp_parser_declarator_kind dcl_kind,
19558 {
19568 {
19569 /* Peek at the next token. */
19572 {
19573 /* This is either a parameter-declaration-clause, or a
19574 parenthesized declarator. When we know we are parsing a
19575 named declarator, it must be a parenthesized declarator
19576 if FIRST is true. For instance, `(int)' is a
19577 parameter-declaration-clause, with an omitted
19578 direct-abstract-declarator. But `((*))', is a
19579 parenthesized abstract declarator. Finally, when T is a
19580 template parameter `(T)' is a
19581 parameter-declaration-clause, and not a parenthesized
19582 named declarator.
19584 We first try and parse a parameter-declaration-clause,
19585 and then try a nested declarator (if FIRST is true).
19587 It is not an error for it not to be a
19588 parameter-declaration-clause, even when FIRST is
19589 false. Consider,
19591 int i (int);
19592 int i (3);
19594 The first is the declaration of a function while the
19595 second is the definition of a variable, including its
19596 initializer.
19598 Having seen only the parenthesis, we cannot know which of
19599 these two alternatives should be selected. Even more
19600 complex are examples like:
19602 int i (int (a));
19603 int i (int (3));
19605 The former is a function-declaration; the latter is a
19606 variable initialization.
19608 Thus again, we try a parameter-declaration-clause, and if
19609 that fails, we back out and return. */
19612 {
19613 tree params;
19616 /* In a member-declarator, the only valid interpretation
19617 of a parenthesis is the start of a
19618 parameter-declaration-clause. (It is invalid to
19619 initialize a static data member with a parenthesized
19620 initializer; only the "=" form of initialization is
19621 permitted.) */
19625 /* Consume the `('. */
19628 {
19629 /* If this is going to be an abstract declarator, we're
19630 in a declarator and we can't have default args. */
19633 }
19637 /* Parse the parameter-declaration-clause. */
19640 /* Consume the `)'. */
19643 /* If all went well, parse the cv-qualifier-seq,
19644 ref-qualifier and the exception-specification. */
19646 {
19647 cp_cv_quals cv_quals;
19648 cp_virt_specifiers virt_specifiers;
19649 cp_ref_qualifier ref_qual;
19650 tree exception_specification;
19651 tree late_return;
19652 tree attrs;
19662 /* Parse the cv-qualifier-seq. */
19664 /* Parse the ref-qualifier. */
19666 /* Parse the tx-qualifier. */
19668 /* And the exception-specification. */
19669 exception_specification
19674 /* In here, we handle cases where attribute is used after
19675 the function declaration. For example:
19676 void func (int x) __attribute__((vector(..))); */
19680 {
19684 CPP_SEMICOLON)
19686 CPP_OPEN_BRACE))
19689 ;
19690 else
19692 }
19694 late_return = (cp_parser_late_return_type_opt
19698 /* Parse the virt-specifier-seq. */
19701 /* Create the function-declarator. */
19703 params,
19704 cv_quals,
19705 virt_specifiers,
19706 ref_qual,
19707 tx_qual,
19708 exception_specification,
19709 late_return,
19710 requires_clause);
19713 /* Any subsequent parameter lists are to do with
19714 return type, so are not those of the declared
19715 function. */
19717 }
19719 /* Remove the function parms from scope. */
19723 /* Repeat the main loop. */
19725 }
19727 /* If this is the first, we can try a parenthesized
19728 declarator. */
19730 {
19736 /* Consume the `('. */
19738 /* Parse the nested declarator. */
19741 declarator
19747 /* Expect a `)'. */
19754 }
19755 /* Otherwise, we must be done. */
19756 else
19758 }
19762 {
19763 /* Parse an array-declarator. */
19772 /* Consume the `['. */
19774 /* Peek at the next token. */
19776 /* If the next token is `]', then there is no
19777 constant-expression. */
19779 {
19781 bounds
19791 {
19792 /* Normally, the array bound must be an integral constant
19793 expression. However, as an extension, we allow VLAs
19794 in function scopes as long as they aren't part of a
19795 parameter declaration. */
19799 }
19802 {
19803 /* Remember this wasn't a constant-expression. */
19806 }
19807 }
19808 else
19810 /* Look for the closing `]'. */
19812 {
19815 }
19820 }
19822 {
19823 {
19824 tree qualifying_scope;
19825 tree unqualified_name;
19826 tree attrs;
19827 special_function_kind sfk;
19832 /* Parse a declarator-id */
19835 {
19838 /* If we see an ellipsis, we should be looking at a
19839 parameter pack. */
19841 {
19842 /* Consume the `...' */
19846 }
19847 }
19850 unqualified_name
19854 {
19858 {
19859 /* Check whether an error occurred. */
19862 /* We already consumed the ellipsis to mark a
19863 parameter pack, but we have no way to report it,
19864 so abort the tentative parse. We will be exiting
19865 immediately anyway. */
19867 }
19868 else
19874 && (qualifying_scope
19876 {
19879 }
19880 }
19885 {
19890 }
19896 {
19897 /* In the declaration of a member of a template class
19898 outside of the class itself, the SCOPE will sometimes
19899 be a TYPENAME_TYPE. For example, given:
19901 template <typename T>
19902 int S<T>::R::i = 3;
19904 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19905 this context, we must resolve S<T>::R to an ordinary
19906 type, rather than a typename type.
19908 The reason we normally avoid resolving TYPENAME_TYPEs
19909 is that a specialization of `S' might render
19910 `S<T>::R' not a type. However, if `S' is
19911 specialized, then this `i' will not be used, so there
19912 is no harm in resolving the types here. */
19913 tree type;
19915 /* Resolve the TYPENAME_TYPE. */
19918 /* If that failed, the declarator is invalid. */
19920 {
19923 "cannot define member of dependent typedef "
19925 else
19930 }
19932 }
19937 {
19938 tree class_type;
19943 else
19947 {
19950 {
19953 {
19957 "use %<%T::%D%> instead of %<%T::%D%> to "
19959 class_type,
19964 }
19965 else
19967 }
19968 else
19969 {
19970 /* We do not attempt to print the declarator
19971 here because we do not have enough
19972 information about its original syntactic
19973 form. */
19977 }
19978 }
19981 {
19987 for an unnamed type, even if the type
19988 got a name for linkage purposes. */
19990 /* Handle correctly (c++/19200):
19992 struct S {
19993 struct T{};
19994 friend void S(T);
19995 };
19997 and also:
19999 namespace N {
20000 void S();
20001 }
20003 struct S {
20004 friend void N::S();
20005 }; */
20006 && !(friend_p
20009 class_type))
20010 {
20013 }
20021 }
20022 }
20024 unqualified_name,
20025 sfk);
20032 }
20034 handle_declarator:;
20037 {
20038 /* Any names that appear after the declarator-id for a
20039 member are looked up in the containing scope. */
20041 {
20042 /* But declarations with qualified-ids can't appear in a
20043 function. */
20047 }
20049 }
20053 /* Default args are only allowed on function
20054 declarations. */
20056 else
20060 }
20061 /* We're done. */
20062 else
20064 }
20066 /* For an abstract declarator, we might wind up with nothing at this
20067 point. That's an error; the declarator is not optional. */
20071 /* If we entered a scope, we must exit it now. */
20079 }
20081 /* Parse a ptr-operator.
20083 ptr-operator:
20084 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20085 * cv-qualifier-seq [opt]
20086 &
20087 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20088 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20090 GNU Extension:
20092 ptr-operator:
20093 & cv-qualifier-seq [opt]
20095 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20096 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20097 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20098 filled in with the TYPE containing the member. *CV_QUALS is
20099 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20100 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20101 Note that the tree codes returned by this function have nothing
20102 to do with the types of trees that will be eventually be created
20103 to represent the pointer or reference type being parsed. They are
20104 just constants with suggestive names. */
20105 static enum tree_code
20110 {
20115 /* Assume that it's not a pointer-to-member. */
20117 /* And that there are no cv-qualifiers. */
20120 /* Peek at the next token. */
20123 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20133 {
20134 /* Consume the `*', `&' or `&&'. */
20137 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20138 `&', if we are allowing GNU extensions. (The only qualifier
20139 that can legally appear after `&' is `restrict', but that is
20140 enforced during semantic analysis. */
20148 }
20149 else
20150 {
20151 /* Try the pointer-to-member case. */
20153 /* Look for the optional `::' operator. */
20156 /* Look for the nested-name specifier. */
20163 /* If we found it, and the next token is a `*', then we are
20164 indeed looking at a pointer-to-member operator. */
20167 {
20168 /* Indicate that the `*' operator was used. */
20176 else
20177 {
20178 /* The type of which the member is a member is given by the
20179 current SCOPE. */
20181 /* The next name will not be qualified. */
20185 /* Look for optional c++11 attributes. */
20189 /* Look for the optional cv-qualifier-seq. */
20191 }
20192 }
20193 /* If that didn't work we don't have a ptr-operator. */
20196 }
20199 }
20201 /* Parse an (optional) cv-qualifier-seq.
20203 cv-qualifier-seq:
20204 cv-qualifier cv-qualifier-seq [opt]
20206 cv-qualifier:
20207 const
20208 volatile
20210 GNU Extension:
20212 cv-qualifier:
20213 __restrict__
20215 Returns a bitmask representing the cv-qualifiers. */
20217 static cp_cv_quals
20219 {
20223 {
20225 cp_cv_quals cv_qualifier;
20227 /* Peek at the next token. */
20229 /* See if it's a cv-qualifier. */
20231 {
20247 }
20253 {
20256 }
20257 else
20258 {
20261 }
20262 }
20265 }
20267 /* Parse an (optional) ref-qualifier
20269 ref-qualifier:
20270 &
20271 &&
20273 Returns cp_ref_qualifier representing ref-qualifier. */
20275 static cp_ref_qualifier
20277 {
20280 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20285 {
20290 {
20302 }
20307 {
20310 }
20311 else
20312 {
20315 }
20316 }
20319 }
20321 /* Parse an optional tx-qualifier.
20323 tx-qualifier:
20324 transaction_safe
20325 transaction_safe_dynamic */
20327 static tree
20329 {
20332 {
20337 {
20341 {
20344 {
20347 }
20348 else
20350 }
20351 }
20352 }
20354 }
20356 /* Parse an (optional) virt-specifier-seq.
20358 virt-specifier-seq:
20359 virt-specifier virt-specifier-seq [opt]
20361 virt-specifier:
20362 override
20363 final
20365 Returns a bitmask representing the virt-specifiers. */
20367 static cp_virt_specifiers
20369 {
20373 {
20375 cp_virt_specifiers virt_specifier;
20377 /* Peek at the next token. */
20379 /* See if it's a virt-specifier-qualifier. */
20383 {
20386 }
20388 {
20391 }
20393 {
20395 }
20396 else
20400 {
20403 }
20404 else
20405 {
20408 }
20409 }
20411 }
20413 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20414 is in scope even though it isn't real. */
20416 void
20418 {
20419 tree this_parm;
20422 {
20423 /* We don't clear this between NSDMIs. Is it already what we want? */
20428 }
20431 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20433 current_class_ref
20436 }
20438 /* Return true iff our current scope is a non-static data member
20439 initializer. */
20441 bool
20443 {
20444 /* We recognize NSDMI context by the context-less 'this' pointer set up
20445 by the function above. */
20451 }
20453 /* Parse a late-specified return type, if any. This is not a separate
20454 non-terminal, but part of a function declarator, which looks like
20456 -> trailing-type-specifier-seq abstract-declarator(opt)
20458 Returns the type indicated by the type-id.
20460 In addition to this, parse any queued up #pragma omp declare simd
20461 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20462 #pragma acc routine clauses.
20464 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20465 function. */
20467 static tree
20470 {
20474 && declarator
20481 && declarator
20484 /* Peek at the next token. */
20486 /* A late-specified return type is indicated by an initial '->'. */
20497 {
20498 /* DR 1207: 'this' is in scope in the trailing return type. */
20500 }
20503 {
20504 /* Consume the ->. */
20508 }
20510 /* Function declarations may be followed by a trailing
20511 requires-clause. */
20515 declarator->attributes
20519 declarator->attributes
20523 declarator->attributes
20528 {
20531 }
20534 }
20536 /* Parse a declarator-id.
20538 declarator-id:
20539 id-expression
20540 :: [opt] nested-name-specifier [opt] type-name
20542 In the `id-expression' case, the value returned is as for
20543 cp_parser_id_expression if the id-expression was an unqualified-id.
20544 If the id-expression was a qualified-id, then a SCOPE_REF is
20545 returned. The first operand is the scope (either a NAMESPACE_DECL
20546 or TREE_TYPE), but the second is still just a representation of an
20547 unqualified-id. */
20549 static tree
20551 {
20552 tree id;
20553 /* The expression must be an id-expression. Assume that qualified
20554 names are the names of types so that:
20556 template <class T>
20557 int S<T>::R::i = 3;
20559 will work; we must treat `S<T>::R' as the name of a type.
20560 Similarly, assume that qualified names are templates, where
20561 required, so that:
20563 template <class T>
20564 int S<T>::R<T>::i = 3;
20566 will work, too. */
20572 optional_p);
20576 }
20578 /* Parse a type-id.
20580 type-id:
20581 type-specifier-seq abstract-declarator [opt]
20583 Returns the TYPE specified. */
20585 static tree
20588 {
20589 cp_decl_specifier_seq type_specifier_seq;
20592 /* Parse the type-specifier-seq. */
20594 is_trailing_return,
20599 /* A bare template name as a template argument is a template template
20600 argument, not a placeholder, so fail parsing it as a type argument. */
20601 {
20605 }
20609 /* There might or might not be an abstract declarator. */
20611 /* Look for the declarator. */
20612 abstract_declarator
20617 /* Check to see if there really was a declarator. */
20622 /* The concepts TS allows 'auto' as a type-id. */
20624 /* None of the valid uses of 'auto' in C++14 involve the type-id
20625 nonterminal, but it is valid in a trailing-return-type. */
20628 {
20629 /* A type-id with type 'auto' is only ok if the abstract declarator
20630 is a function declarator with a late-specified return type.
20632 A type-id with 'auto' is also valid in a trailing-return-type
20633 in a compound-requirement. */
20640 else
20641 {
20644 {
20646 auto_node);
20648 tmpl);
20649 }
20650 else
20653 }
20654 }
20657 is_template_arg);
20658 }
20660 static tree
20662 {
20664 }
20666 static tree
20668 {
20669 tree r;
20671 parser->type_definition_forbidden_message
20676 {
20679 }
20681 }
20683 static tree
20685 {
20687 }
20689 /* Parse a type-specifier-seq.
20691 type-specifier-seq:
20692 type-specifier type-specifier-seq [opt]
20694 GNU extension:
20696 type-specifier-seq:
20697 attributes type-specifier-seq [opt]
20699 If IS_DECLARATION is true, we are at the start of a "condition" or
20700 exception-declaration, so we might be followed by a declarator-id.
20702 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20703 i.e. we've just seen "->".
20705 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20707 static void
20712 {
20717 /* Clear the TYPE_SPECIFIER_SEQ. */
20720 /* In the context of a trailing return type, enum E { } is an
20721 elaborated-type-specifier followed by a function-body, not an
20722 enum-specifier. */
20726 /* Parse the type-specifiers and attributes. */
20728 {
20729 tree type_specifier;
20732 /* Check for attributes first. */
20734 {
20739 }
20741 /* record the token of the beginning of the type specifier seq,
20742 for error reporting purposes*/
20746 /* Look for the type-specifier. */
20748 flags,
20749 type_specifier_seq,
20751 NULL,
20754 {
20755 /* If the first type-specifier could not be found, this is not a
20756 type-specifier-seq at all. */
20758 {
20759 /* Set in_declarator_p to avoid skipping to the semicolon. */
20771 }
20772 /* If subsequent type-specifiers could not be found, the
20773 type-specifier-seq is complete. */
20775 }
20778 /* The standard says that a condition can be:
20780 type-specifier-seq declarator = assignment-expression
20782 However, given:
20784 struct S {};
20785 if (int S = ...)
20787 we should treat the "S" as a declarator, not as a
20788 type-specifier. The standard doesn't say that explicitly for
20789 type-specifier-seq, but it does say that for
20790 decl-specifier-seq in an ordinary declaration. Perhaps it
20791 would be clearer just to allow a decl-specifier-seq here, and
20792 then add a semantic restriction that if any decl-specifiers
20793 that are not type-specifiers appear, the program is invalid. */
20796 }
20797 }
20799 /* Return whether the function currently being declared has an associated
20800 template parameter list. */
20802 static bool
20804 {
20817 }
20819 /* Parse a parameter-declaration-clause.
20821 parameter-declaration-clause:
20822 parameter-declaration-list [opt] ... [opt]
20823 parameter-declaration-list , ...
20825 Returns a representation for the parameter declarations. A return
20826 value of NULL indicates a parameter-declaration-clause consisting
20827 only of an ellipsis. */
20829 static tree
20831 {
20832 tree parameters;
20841 parser->auto_is_implicit_function_template_parm_p
20843 }
20849 && !processing_template_parmlist
20855 /* Peek at the next token. */
20857 /* Check for trivial parameter-declaration-clauses. */
20859 {
20860 /* Consume the `...' token. */
20863 }
20865 /* There are no parameters. */
20866 {
20867 #ifndef NO_IMPLICIT_EXTERN_C
20872 else
20873 #endif
20875 }
20876 /* Check for `(void)', too, which is a special case. */
20880 {
20881 /* Consume the `void' token. */
20883 /* There are no parameters. */
20885 }
20887 /* Parse the parameter-declaration-list. */
20889 /* If a parse error occurred while parsing the
20890 parameter-declaration-list, then the entire
20891 parameter-declaration-clause is erroneous. */
20895 /* Peek at the next token. */
20897 /* If it's a `,', the clause should terminate with an ellipsis. */
20899 {
20900 /* Consume the `,'. */
20902 /* Expect an ellipsis. */
20903 ellipsis_p
20905 }
20906 /* It might also be `...' if the optional trailing `,' was
20907 omitted. */
20909 {
20910 /* Consume the `...' token. */
20912 /* And remember that we saw it. */
20914 }
20915 else
20918 /* Finish the parameter list. */
20923 }
20925 /* Parse a parameter-declaration-list.
20927 parameter-declaration-list:
20928 parameter-declaration
20929 parameter-declaration-list , parameter-declaration
20931 Returns a representation of the parameter-declaration-list, as for
20932 cp_parser_parameter_declaration_clause. However, the
20933 `void_list_node' is never appended to the list. Upon return,
20934 *IS_ERROR will be true iff an error occurred. */
20936 static tree
20938 {
20944 /* Assume all will go well. */
20946 /* The special considerations that apply to a function within an
20947 unbraced linkage specifications do not apply to the parameters
20948 to the function. */
20949 saved_in_unbraced_linkage_specification_p
20953 /* Look for more parameters. */
20955 {
20963 /* Parse the parameter. */
20964 parameter
20969 /* We don't know yet if the enclosing context is deprecated, so wait
20970 and warn in grokparms if appropriate. */
20974 {
20975 /* If a function parameter pack was specified and an implicit template
20976 parameter was introduced during cp_parser_parameter_declaration,
20977 change any implicit parameters introduced into packs. */
20981 {
20989 }
20993 PARM,
20996 }
21000 /* If a parse error occurred parsing the parameter declaration,
21001 then the entire parameter-declaration-list is erroneous. */
21003 {
21007 }
21017 {
21021 }
21023 /* Add the new parameter to the list. */
21027 /* Peek at the next token. */
21030 /* These are for Objective-C++ */
21033 /* The parameter-declaration-list is complete. */
21036 {
21039 /* Peek at the next token. */
21041 /* If it's an ellipsis, then the list is complete. */
21044 /* Otherwise, there must be more parameters. Consume the
21045 `,'. */
21047 /* When parsing something like:
21049 int i(float f, double d)
21051 we can tell after seeing the declaration for "f" that we
21052 are not looking at an initialization of a variable "i",
21053 but rather at the declaration of a function "i".
21055 Due to the fact that the parsing of template arguments
21056 (as specified to a template-id) requires backtracking we
21057 cannot use this technique when inside a template argument
21058 list. */
21062 /* However, a parameter-declaration of the form
21063 "float(f)" (which is a valid declaration of a
21064 parameter "f") can also be interpreted as an
21065 expression (the conversion of "f" to "float"). */
21068 }
21069 else
21070 {
21078 }
21079 }
21081 parser->in_unbraced_linkage_specification_p
21084 /* Reset implicit_template_scope if we are about to leave the function
21085 parameter list that introduced it. Note that for out-of-line member
21086 definitions, there will be one or more class scopes before we get to
21087 the template parameter scope. */
21091 {
21095 {
21098 }
21099 }
21102 }
21104 /* Parse a parameter declaration.
21106 parameter-declaration:
21107 decl-specifier-seq ... [opt] declarator
21108 decl-specifier-seq declarator = assignment-expression
21109 decl-specifier-seq ... [opt] abstract-declarator [opt]
21110 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21112 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21113 declares a template parameter. (In that case, a non-nested `>'
21114 token encountered during the parsing of the assignment-expression
21115 is not interpreted as a greater-than operator.)
21117 Returns a representation of the parameter, or NULL if an error
21118 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21119 true iff the declarator is of the form "(p)". */
21125 {
21127 cp_decl_specifier_seq decl_specifiers;
21129 tree default_argument;
21134 /* In a template parameter, `>' is not an operator.
21136 [temp.param]
21138 When parsing a default template-argument for a non-type
21139 template-parameter, the first non-nested `>' is taken as the end
21140 of the template parameter-list rather than a greater-than
21141 operator. */
21143 /* Type definitions may not appear in parameter types. */
21145 parser->type_definition_forbidden_message
21148 /* Parse the declaration-specifiers. */
21150 CP_PARSER_FLAGS_NONE,
21154 /* Complain about missing 'typename' or other invalid type names. */
21159 /* If an error occurred, there's no reason to attempt to parse the
21160 rest of the declaration. */
21162 {
21165 }
21167 /* Peek at the next token. */
21170 /* If the next token is a `)', `,', `=', `>', or `...', then there
21171 is no declarator. However, when variadic templates are enabled,
21172 there may be a declarator following `...'. */
21177 {
21181 }
21182 /* Otherwise, there should be a declarator. */
21183 else
21184 {
21188 /* After seeing a decl-specifier-seq, if the next token is not a
21189 "(", there is no possibility that the code is a valid
21190 expression. Therefore, if parsing tentatively, we commit at
21191 this point. */
21193 /* In an expression context, having seen:
21195 (int((char ...
21197 we cannot be sure whether we are looking at a
21198 function-type (taking a "char" as a parameter) or a cast
21199 of some object of type "char" to "int". */
21205 /* Parse the declarator. */
21208 CP_PARSER_DECLARATOR_EITHER,
21210 parenthesized_p,
21214 /* After the declarator, allow more attributes. */
21215 decl_specifiers.attributes
21219 /* If the declarator is a template parameter pack, remember that and
21220 clear the flag in the declarator itself so we don't get errors
21221 from grokdeclarator. */
21223 {
21226 }
21227 }
21229 /* If the next token is an ellipsis, and we have not seen a declarator
21230 name, and if either the type of the declarator contains parameter
21231 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21232 for, eg, abbreviated integral type names), then we actually have a
21233 parameter pack expansion expression. Otherwise, leave the ellipsis
21234 for a C-style variadic function. */
21237 {
21248 {
21249 /* Consume the `...'. */
21253 /* Build a pack expansion type */
21258 else
21260 }
21261 }
21263 /* The restriction on defining new types applies only to the type
21264 of the parameter, not to the default argument. */
21267 /* If the next token is `=', then process a default argument. */
21269 {
21272 /* If we are defining a class, then the tokens that make up the
21273 default argument must be saved and processed later. */
21279 // A constrained-type-specifier may declare a type template-parameter.
21281 default_argument
21284 // A constrained-type-specifier may declare a template-template-parameter.
21286 default_argument
21289 /* Outside of a class definition, we can just parse the
21290 assignment-expression. */
21291 else
21292 default_argument
21296 {
21298 "default arguments are only "
21300 }
21302 || template_parameter_pack_p
21305 {
21306 /* Find the name of the parameter pack. */
21313 template_parm_p
21319 else
21321 template_parm_p
21328 }
21329 }
21330 else
21334 declarator,
21335 default_argument,
21336 template_parameter_pack_p);
21337 }
21339 /* Parse a default argument and return it.
21341 TEMPLATE_PARM_P is true if this is a default argument for a
21342 non-type template parameter. */
21343 static tree
21345 {
21351 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21352 set correctly. */
21355 /* Local variable names (and the `this' keyword) may not
21356 appear in a default argument. */
21359 /* Parse the assignment-expression. */
21364 /* The "this" pointer is not valid in a default argument. */
21366 {
21371 }
21372 default_argument
21374 /* Restore the "this" pointer. */
21376 {
21379 }
21388 }
21390 /* Parse a function-body.
21392 function-body:
21393 compound_statement */
21395 static void
21397 {
21401 }
21403 /* Parse a ctor-initializer-opt followed by a function-body. Return
21404 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21405 is true we are parsing a function-try-block. */
21407 static bool
21410 {
21418 /* Begin the function body. */
21420 /* Parse the optional ctor-initializer. */
21423 /* If we're parsing a constexpr constructor definition, we need
21424 to check that the constructor body is indeed empty. However,
21425 before we get to cp_parser_function_body lot of junk has been
21426 generated, so we can't just check that we have an empty block.
21427 Rather we take a snapshot of the outermost block, and check whether
21428 cp_parser_function_body changed its state. */
21430 {
21434 }
21435 /* Parse the function-body. */
21439 /* Finish the function body. */
21443 }
21445 /* Parse an initializer.
21447 initializer:
21448 = initializer-clause
21449 ( expression-list )
21451 Returns an expression representing the initializer. If no
21452 initializer is present, NULL_TREE is returned.
21454 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21455 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21456 set to TRUE if there is no initializer present. If there is an
21457 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21458 is set to true; otherwise it is set to false. */
21460 static tree
21463 {
21465 tree init;
21467 /* Peek at the next token. */
21470 /* Let our caller know whether or not this initializer was
21471 parenthesized. */
21473 /* Assume that the initializer is constant. */
21477 {
21478 /* Consume the `='. */
21480 /* Parse the initializer-clause. */
21482 }
21484 {
21489 non_constant_p);
21494 }
21496 {
21501 }
21502 else
21503 {
21504 /* Anything else is an error. */
21507 }
21513 }
21515 /* Parse an initializer-clause.
21517 initializer-clause:
21518 assignment-expression
21519 braced-init-list
21521 Returns an expression representing the initializer.
21523 If the `assignment-expression' production is used the value
21524 returned is simply a representation for the expression.
21526 Otherwise, calls cp_parser_braced_list. */
21528 static cp_expr
21530 {
21531 cp_expr initializer;
21533 /* Assume the expression is constant. */
21536 /* If it is not a `{', then we are looking at an
21537 assignment-expression. */
21539 {
21540 initializer
21543 non_constant_p);
21544 }
21545 else
21549 }
21551 /* Parse a brace-enclosed initializer list.
21553 braced-init-list:
21554 { initializer-list , [opt] }
21555 { }
21557 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21558 the elements of the initializer-list (or NULL, if the last
21559 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21560 NULL_TREE. There is no way to detect whether or not the optional
21561 trailing `,' was provided. NON_CONSTANT_P is as for
21562 cp_parser_initializer. */
21564 static cp_expr
21566 {
21567 tree initializer;
21570 /* Consume the `{' token. */
21572 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21574 /* If it's not a `}', then there is a non-trivial initializer. */
21576 {
21577 /* Parse the initializer list. */
21580 /* A trailing `,' token is allowed. */
21583 }
21584 else
21586 /* Now, there should be a trailing `}'. */
21592 /* Build a location of the form:
21593 { ... }
21594 ^~~~~~~
21595 with caret==start at the open brace, finish at the close brace. */
21599 }
21601 /* Consume tokens up to, and including, the next non-nested closing `]'.
21602 Returns true iff we found a closing `]'. */
21604 static bool
21606 {
21610 {
21614 {
21617 /* If we've run out of tokens, then there is no closing `]'. */
21626 {
21629 }
21634 }
21636 /* Consume the token. */
21638 }
21639 }
21641 /* Return true if we are looking at an array-designator, false otherwise. */
21643 static bool
21645 {
21646 /* Consume the `['. */
21651 /* Skip tokens until the next token is a closing square bracket.
21652 If we find the closing `]', and the next token is a `=', then
21653 we are looking at an array designator. */
21654 bool array_designator_p
21658 /* Roll back the tokens we skipped. */
21662 }
21664 /* Parse an initializer-list.
21666 initializer-list:
21667 initializer-clause ... [opt]
21668 initializer-list , initializer-clause ... [opt]
21670 GNU Extension:
21672 initializer-list:
21673 designation initializer-clause ...[opt]
21674 initializer-list , designation initializer-clause ...[opt]
21676 designation:
21677 . identifier =
21678 identifier :
21679 [ constant-expression ] =
21681 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21682 for the initializer. If the INDEX of the elt is non-NULL, it is the
21683 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21684 as for cp_parser_initializer. */
21688 {
21691 /* Assume all of the expressions are constant. */
21694 /* Parse the rest of the list. */
21696 {
21698 tree designator;
21699 tree initializer;
21702 /* If the next token is an identifier and the following one is a
21703 colon, we are looking at the GNU designated-initializer
21704 syntax. */
21708 {
21709 /* Warn the user that they are using an extension. */
21712 /* Consume the identifier. */
21714 /* Consume the `:'. */
21716 }
21717 /* Also handle the C99 syntax, '. id ='. */
21722 {
21723 /* Warn the user that they are using an extension. */
21726 /* Consume the `.'. */
21728 /* Consume the identifier. */
21730 /* Consume the `='. */
21732 }
21733 /* Also handle C99 array designators, '[ const ] ='. */
21737 {
21738 /* In C++11, [ could start a lambda-introducer. */
21744 {
21747 }
21748 else
21749 {
21754 }
21760 }
21761 else
21764 /* Parse the initializer. */
21767 /* If any clause is non-constant, so is the entire initializer. */
21771 /* If we have an ellipsis, this is an initializer pack
21772 expansion. */
21774 {
21775 /* Consume the `...'. */
21778 /* Turn the initializer into an initializer expansion. */
21780 }
21782 /* Add it to the vector. */
21785 /* If the next token is not a comma, we have reached the end of
21786 the list. */
21790 /* Peek at the next token. */
21792 /* If the next token is a `}', then we're still done. An
21793 initializer-clause can have a trailing `,' after the
21794 initializer-list and before the closing `}'. */
21798 /* Consume the `,' token. */
21800 }
21803 }
21805 /* Classes [gram.class] */
21807 /* Parse a class-name.
21809 class-name:
21810 identifier
21811 template-id
21813 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21814 to indicate that names looked up in dependent types should be
21815 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21816 keyword has been used to indicate that the name that appears next
21817 is a template. TAG_TYPE indicates the explicit tag given before
21818 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21819 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21820 is the class being defined in a class-head. If ENUM_OK is TRUE,
21821 enum-names are also accepted.
21823 Returns the TYPE_DECL representing the class. */
21825 static tree
21834 {
21835 tree decl;
21836 tree scope;
21841 /* All class-names start with an identifier. */
21844 {
21847 }
21849 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21850 to a template-id, so we save it here. */
21855 /* Any name names a type if we're following the `typename' keyword
21856 in a qualified name where the enclosing scope is type-dependent. */
21859 /* Handle the common case (an identifier, but not a template-id)
21860 efficiently. */
21863 {
21867 /* Look for the identifier. */
21871 /* If the next token isn't an identifier, we are certainly not
21872 looking at a class-name. */
21875 /* If we know this is a type-name, there's no need to look it
21876 up. */
21879 else
21880 {
21881 tree ambiguous_decls;
21882 /* If we already know that this lookup is ambiguous, then
21883 we've already issued an error message; there's no reason
21884 to check again. */
21886 {
21889 }
21890 /* If the next token is a `::', then the name must be a type
21891 name.
21893 [basic.lookup.qual]
21895 During the lookup for a name preceding the :: scope
21896 resolution operator, object, function, and enumerator
21897 names are ignored. */
21900 /* Look up the name. */
21902 tag_type,
21905 check_dependency_p,
21909 {
21913 }
21914 }
21915 }
21916 else
21917 {
21918 /* Try a template-id. */
21920 check_dependency_p,
21921 tag_type,
21922 is_declaration);
21925 }
21929 /* If this is a typename, create a TYPENAME_TYPE. */
21931 {
21936 }
21940 /* Check to see that it is really the name of a class. */
21944 /* Situations like this:
21946 template <typename T> struct A {
21947 typename T::template X<int>::I i;
21948 };
21950 are problematic. Is `T::template X<int>' a class-name? The
21951 standard does not seem to be definitive, but there is no other
21952 valid interpretation of the following `::'. Therefore, those
21953 names are considered class-names. */
21954 {
21958 }
21963 /* In Objective-C 2.0, a classname followed by '.' starts a
21964 dot-syntax expression, and it's not a type-name. */
21976 }
21978 /* Parse a class-specifier.
21980 class-specifier:
21981 class-head { member-specification [opt] }
21983 Returns the TREE_TYPE representing the class. */
21985 static tree
21987 {
21988 tree type;
22002 /* Parse the class-head. */
22005 /* If the class-head was a semantic disaster, skip the entire body
22006 of the class. */
22008 {
22012 }
22014 /* Look for the `{'. */
22016 {
22019 }
22024 /* Issue an error message if type-definitions are forbidden here. */
22026 /* Remember that we are defining one more class. */
22028 /* Inside the class, surrounding template-parameter-lists do not
22029 apply. */
22030 saved_num_template_parameter_lists
22033 /* We are not in a function body. */
22036 /* Or in a loop. */
22039 /* Or in a switch. */
22042 /* We are not immediately inside an extern "lang" block. */
22043 saved_in_unbraced_linkage_specification_p
22047 // Associate constraints with the type.
22051 /* Start the class. */
22053 {
22056 }
22060 /* If the type is erroneous, skip the entire body of the class. */
22062 else
22063 /* Parse the member-specification. */
22066 /* Look for the trailing `}'. */
22068 /* Look for trailing attributes to apply to this class. */
22076 /* We've finished a type definition. Check for the common syntax
22077 error of forgetting a semicolon after the definition. We need to
22078 be careful, as we can't just check for not-a-semicolon and be done
22079 with it; the user might have typed:
22081 class X { } c = ...;
22082 class X { } *p = ...;
22084 and so forth. Instead, enumerate all the possible tokens that
22085 might follow this production; if we don't see one of them, then
22086 complain and silently insert the semicolon. */
22087 {
22092 /* Don't try to parse c++11 attributes here. As per the
22093 grammar, that should be a task for
22094 cp_parser_decl_specifier_seq. */
22098 {
22109 /* While it's legal for type qualifiers and storage class
22110 specifiers to follow type definitions in the grammar, only
22111 compiler testsuites contain code like that. Assume that if
22112 we see such code, then what we're really seeing is a case
22113 like:
22115 class X { }
22116 const <type> var = ...;
22118 or
22120 class Y { }
22121 static <type> func (...) ...
22123 i.e. the qualifier or specifier applies to the next
22124 declaration. To do so, however, we need to look ahead one
22125 more token to see if *that* token is a type specifier.
22127 This code could be improved to handle:
22129 class Z { }
22130 static const <type> var = ...; */
22133 {
22136 /* Handling user-defined types here would be nice, but very
22137 tricky. */
22138 want_semicolon
22141 }
22145 }
22147 /* If we don't have a type, then something is very wrong and we
22148 shouldn't try to do anything clever. Likewise for not seeing the
22149 closing brace. */
22151 {
22152 /* Locate the closing brace. */
22153 cp_token_position prev
22158 /* We want to suggest insertion of a ';' immediately *after* the
22159 closing brace, so, if we can, offset the location by 1 column. */
22166 /* If we successfully offset the location, suggest the fix-it. */
22179 else
22182 /* Unget one token and smash it to look as though we encountered
22183 a semicolon in the input stream. */
22188 }
22189 }
22191 /* If this class is not itself within the scope of another class,
22192 then we need to parse the bodies of all of the queued function
22193 definitions. Note that the queued functions defined in a class
22194 are not always processed immediately following the
22195 class-specifier for that class. Consider:
22197 struct A {
22198 struct B { void f() { sizeof (A); } };
22199 };
22201 If `f' were processed before the processing of `A' were
22202 completed, there would be no way to compute the size of `A'.
22203 Note that the nesting we are interested in here is lexical --
22204 not the semantic nesting given by TYPE_CONTEXT. In particular,
22205 for:
22207 struct A { struct B; };
22208 struct A::B { void f() { } };
22210 there is no need to delay the parsing of `A::B::f'. */
22212 {
22213 tree decl;
22220 /* In a first pass, parse default arguments to the functions.
22221 Then, in a second pass, parse the bodies of the functions.
22222 This two-phased approach handles cases like:
22224 struct S {
22225 void f() { g(); }
22226 void g(int i = 3);
22227 };
22229 */
22231 {
22233 /* If there are default arguments that have not yet been processed,
22234 take care of them now. */
22236 {
22241 }
22242 /* Make sure that any template parameters are in scope. */
22244 /* Parse the default argument expressions. */
22246 /* Remove any template parameters from the symbol table. */
22248 }
22250 /* Now parse any NSDMIs. */
22254 {
22256 {
22261 }
22264 }
22271 /* Now do some post-NSDMI bookkeeping. */
22277 /* Now parse the body of the functions. */
22279 {
22280 /* OpenMP UDRs need to be parsed before all other functions. */
22287 }
22288 else
22292 }
22293 else
22296 /* Put back any saved access checks. */
22299 /* Restore saved state. */
22303 parser->num_template_parameter_lists
22305 parser->in_unbraced_linkage_specification_p
22309 }
22311 static tree
22313 {
22314 tree ret;
22319 }
22321 /* Parse a class-head.
22323 class-head:
22324 class-key identifier [opt] base-clause [opt]
22325 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22326 class-key nested-name-specifier [opt] template-id
22327 base-clause [opt]
22329 class-virt-specifier:
22330 final
22332 GNU Extensions:
22333 class-key attributes identifier [opt] base-clause [opt]
22334 class-key attributes nested-name-specifier identifier base-clause [opt]
22335 class-key attributes nested-name-specifier [opt] template-id
22336 base-clause [opt]
22338 Upon return BASES is initialized to the list of base classes (or
22339 NULL, if there are none) in the same form returned by
22340 cp_parser_base_clause.
22342 Returns the TYPE of the indicated class. Sets
22343 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22344 involving a nested-name-specifier was used, and FALSE otherwise.
22346 Returns error_mark_node if this is not a class-head.
22348 Returns NULL_TREE if the class-head is syntactically valid, but
22349 semantically invalid in a way that means we should skip the entire
22350 body of the class. */
22352 static tree
22355 {
22356 tree nested_name_specifier;
22360 tree attributes;
22361 tree bases;
22371 /* Assume no nested-name-specifier will be present. */
22373 /* Assume no template parameter lists will be used in defining the
22374 type. */
22378 /* Look for the class-key. */
22385 /* Parse the attributes. */
22388 /* If the next token is `::', that is invalid -- but sometimes
22389 people do try to write:
22391 struct ::S {};
22393 Handle this gracefully by accepting the extra qualifier, and then
22394 issuing an error about it later if this really is a
22395 class-head. If it turns out just to be an elaborated type
22396 specifier, remain silent. */
22402 /* Determine the name of the class. Begin by looking for an
22403 optional nested-name-specifier. */
22405 nested_name_specifier
22411 /* If there was a nested-name-specifier, then there *must* be an
22412 identifier. */
22414 {
22416 /* Although the grammar says `identifier', it really means
22417 `class-name' or `template-name'. You are only allowed to
22418 define a class that has already been declared with this
22419 syntax.
22421 The proposed resolution for Core Issue 180 says that wherever
22422 you see `class T::X' you should treat `X' as a type-name.
22424 It is OK to define an inaccessible class; for example:
22426 class A { class B; };
22427 class A::B {};
22429 We do not know if we will see a class-name, or a
22430 template-name. We look for a class-name first, in case the
22431 class-name is a template-id; if we looked for the
22432 template-name first we would stop after the template-name. */
22437 class_type,
22441 /* If that didn't work, ignore the nested-name-specifier. */
22443 {
22449 }
22450 /* If we could not find a corresponding TYPE, treat this
22451 declaration like an unqualified declaration. */
22454 /* Otherwise, count the number of templates used in TYPE and its
22455 containing scopes. */
22456 else
22457 {
22458 tree scope;
22470 }
22471 }
22472 /* Otherwise, the identifier is optional. */
22473 else
22474 {
22475 /* We don't know whether what comes next is a template-id,
22476 an identifier, or nothing at all. */
22478 /* Check for a template-id. */
22483 class_key,
22485 /* If that didn't work, it could still be an identifier. */
22487 {
22489 {
22492 }
22493 else
22495 }
22496 else
22497 {
22500 }
22501 }
22506 {
22508 class_key,
22510 }
22513 /* If it's not a `:' or a `{' then we can't really be looking at a
22514 class-head, since a class-head only appears as part of a
22515 class-specifier. We have to detect this situation before calling
22516 xref_tag, since that has irreversible side-effects. */
22518 {
22522 }
22524 /* At this point, we're going ahead with the class-specifier, even
22525 if some other problem occurs. */
22528 {
22533 }
22534 /* Issue the error about the overly-qualified name now. */
22536 {
22541 }
22543 {
22548 }
22550 {
22551 tree scope;
22553 /* Reject typedef-names in class heads. */
22555 {
22558 type);
22561 }
22563 /* Figure out in what scope the declaration is being placed. */
22565 /* If that scope does not contain the scope in which the
22566 class was originally declared, the program is invalid. */
22568 {
22571 "declaration of %qD in namespace %qD which does not "
22574 else
22580 }
22581 /* [dcl.meaning]
22583 A declarator-id shall not be qualified except for the
22584 definition of a ... nested class outside of its class
22585 ... [or] the definition or explicit instantiation of a
22586 class member of a namespace outside of its namespace. */
22588 {
22593 }
22594 }
22595 /* An explicit-specialization must be preceded by "template <>". If
22596 it is not, try to recover gracefully. */
22599 && !processing_template_parmlist
22601 {
22602 /* Build a location of this form:
22603 struct typename <ARGS>
22604 ^~~~~~~~~~~~~~~~~~~~~~
22605 with caret==start at the start token, and
22606 finishing at the end of the type. */
22607 location_t reported_loc
22609 class_head_start_location,
22614 error_at_rich_loc
22618 /* Take the same action that would have been taken by
22619 cp_parser_explicit_specialization. */
22622 }
22623 /* There must be no "return" statements between this point and the
22624 end of this function; set "type "to the correct return value and
22625 use "goto done;" to return. */
22626 /* Make sure that the right number of template parameters were
22627 present. */
22631 {
22632 /* If something went wrong, there is no point in even trying to
22633 process the class-definition. */
22636 }
22638 /* Look up the type. */
22640 {
22644 {
22648 }
22649 else
22650 {
22654 /* Check the scope while we still know whether or not we had a
22655 nested-name-specifier. */
22658 }
22661 }
22663 {
22664 tree class_type;
22666 /* Given:
22668 template <typename T> struct S { struct T };
22669 template <typename T> struct S<T>::T { };
22671 we will get a TYPENAME_TYPE when processing the definition of
22672 `S::T'. We need to resolve it to the actual type before we
22673 try to define it. */
22675 {
22680 else
22681 {
22684 }
22685 }
22689 {
22692 }
22695 /* Enter the scope indicated by the nested-name-specifier. */
22697 /* Get the canonical version of this type. */
22699 /* Call push_template_decl if it seems like we should be defining a
22700 template either from the template headers or the type we're
22701 defining, so that we diagnose both extra and missing headers. */
22705 {
22708 {
22711 }
22712 }
22716 }
22718 {
22719 /* If the class was unnamed, create a dummy name. */
22724 }
22726 /* Indicate whether this class was declared as a `class' or as a
22727 `struct'. */
22732 /* If this type was already complete, and we see another definition,
22733 that's an error. */
22735 {
22737 type);
22739 type);
22742 }
22747 {
22748 /* Apply attributes now, before any use of the class as a template
22749 argument in its base list. */
22752 }
22754 /* We will have entered the scope containing the class; the names of
22755 base classes should be looked up in that context. For example:
22757 struct A { struct B {}; struct C; };
22758 struct A::C : B {};
22760 is valid. */
22762 /* Get the list of base-classes, if there is one. */
22764 {
22765 /* PR59482: enter the class scope so that base-specifiers are looked
22766 up correctly. */
22770 /* PR59482: get out of the previously pushed class scope so that the
22771 subsequent pops pop the right thing. */
22774 }
22775 else
22778 /* If we're really defining a class, process the base classes.
22779 If they're invalid, fail. */
22783 done:
22784 /* Leave the scope given by the nested-name-specifier. We will
22785 enter the class scope itself while processing the members. */
22790 {
22793 }
22799 out:
22802 }
22804 /* Parse a class-key.
22806 class-key:
22807 class
22808 struct
22809 union
22811 Returns the kind of class-key specified, or none_type to indicate
22812 error. */
22814 static enum tag_types
22816 {
22820 /* Look for the class-key. */
22825 /* Check to see if the TOKEN is a class-key. */
22830 }
22832 /* Parse a type-parameter-key.
22834 type-parameter-key:
22835 class
22836 typename
22837 */
22839 static void
22841 {
22842 /* Look for the type-parameter-key. */
22846 {
22849 /* typename is not allowed in a template template parameter
22850 by the standard until C++1Z. */
22852 "ISO C++ forbids typename key in template template parameter;"
22854 }
22855 else
22859 }
22861 /* Parse an (optional) member-specification.
22863 member-specification:
22864 member-declaration member-specification [opt]
22865 access-specifier : member-specification [opt] */
22867 static void
22869 {
22871 {
22875 /* Peek at the next token. */
22877 /* If it's a `}', or EOF then we've seen all the members. */
22883 /* See if this token is a keyword. */
22886 {
22890 /* Consume the access-specifier. */
22892 /* Remember which access-specifier is active. */
22894 /* Look for the `:'. */
22899 /* Accept #pragmas at class scope. */
22901 {
22904 }
22906 /* Otherwise, the next construction must be a
22907 member-declaration. */
22909 }
22910 }
22911 }
22913 /* Parse a member-declaration.
22915 member-declaration:
22916 decl-specifier-seq [opt] member-declarator-list [opt] ;
22917 function-definition ; [opt]
22918 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22919 using-declaration
22920 template-declaration
22921 alias-declaration
22923 member-declarator-list:
22924 member-declarator
22925 member-declarator-list , member-declarator
22927 member-declarator:
22928 declarator pure-specifier [opt]
22929 declarator constant-initializer [opt]
22930 identifier [opt] : constant-expression
22932 GNU Extensions:
22934 member-declaration:
22935 __extension__ member-declaration
22937 member-declarator:
22938 declarator attributes [opt] pure-specifier [opt]
22939 declarator attributes [opt] constant-initializer [opt]
22940 identifier [opt] attributes [opt] : constant-expression
22942 C++0x Extensions:
22944 member-declaration:
22945 static_assert-declaration */
22947 static void
22949 {
22950 cp_decl_specifier_seq decl_specifiers;
22951 tree prefix_attributes;
22952 tree decl;
22961 /* Check for the `__extension__' keyword. */
22963 {
22964 /* Recurse. */
22966 /* Restore the old value of the PEDANTIC flag. */
22970 }
22972 /* Check for a template-declaration. */
22974 {
22975 /* An explicit specialization here is an error condition, and we
22976 expect the specialization handler to detect and report this. */
22980 else
22984 }
22985 /* Check for a template introduction. */
22989 /* Check for a using-declaration. */
22991 {
22993 {
22994 /* Parse the using-declaration. */
22998 }
22999 else
23000 {
23001 tree decl;
23005 /* Note that if we actually see the '=' token after the
23006 identifier, cp_parser_alias_declaration commits the
23007 tentative parse. In that case, we really expect an
23008 alias-declaration. Otherwise, we expect a using
23009 declaration. */
23010 alias_decl_expected =
23016 else
23020 }
23021 }
23023 /* Check for @defs. */
23025 {
23030 {
23035 }
23037 }
23039 /* If the next token is `static_assert' we have a static assertion. */
23041 {
23044 }
23051 /* Parse the decl-specifier-seq. */
23054 CP_PARSER_FLAGS_OPTIONAL,
23057 /* Check for an invalid type-name. */
23061 /* If there is no declarator, then the decl-specifier-seq should
23062 specify a type. */
23064 {
23065 /* If there was no decl-specifier-seq, and the next token is a
23066 `;', then we have something like:
23068 struct S { ; };
23070 [class.mem]
23072 Each member-declaration shall declare at least one member
23073 name of the class. */
23075 {
23079 }
23080 else
23081 {
23082 tree type;
23084 /* See if this declaration is a friend. */
23086 /* If there were decl-specifiers, check to see if there was
23087 a class-declaration. */
23090 /* Nested classes have already been added to the class, but
23091 a `friend' needs to be explicitly registered. */
23093 {
23094 /* If the `friend' keyword was present, the friend must
23095 be introduced with a class-key. */
23098 "in C++03 a class-key must be used "
23100 /* In this case:
23102 template <typename T> struct A {
23103 friend struct A<T>::B;
23104 };
23106 A<T>::B will be represented by a TYPENAME_TYPE, and
23107 therefore not recognized by check_tag_decl. */
23109 {
23113 }
23116 "friend declaration does not name a class or "
23118 else
23121 }
23122 /* If there is no TYPE, an error message will already have
23123 been issued. */
23125 ;
23126 /* An anonymous aggregate has to be handled specially; such
23127 a declaration really declares a data member (with a
23128 particular type), as opposed to a nested class. */
23130 {
23131 /* C++11 9.5/6. */
23134 "a storage class on an anonymous aggregate "
23137 /* Remove constructors and such from TYPE, now that we
23138 know it is an anonymous aggregate. */
23140 /* And make the corresponding data member. */
23143 /* Add it to the class. */
23145 }
23146 else
23147 cp_parser_check_access_in_redeclaration
23150 }
23151 }
23152 else
23153 {
23156 /* Clear attributes from the decl_specifiers but keep them
23157 around as prefix attributes that apply them to the entity
23158 being declared. */
23162 /* See if these declarations will be friends. */
23165 /* Keep going until we hit the `;' at the end of the
23166 declaration. */
23168 {
23170 tree first_attribute;
23172 /* Peek at the next token. */
23175 /* Check for a bitfield declaration. */
23180 {
23181 tree identifier;
23182 tree width;
23184 /* Get the name of the bitfield. Note that we cannot just
23185 check TOKEN here because it may have been invalidated by
23186 the call to cp_lexer_peek_nth_token above. */
23189 else
23192 /* Consume the `:' token. */
23194 /* Get the width of the bitfield. */
23195 width
23198 /* Look for attributes that apply to the bitfield. */
23200 /* Remember which attributes are prefix attributes and
23201 which are not. */
23203 /* Combine the attributes. */
23206 /* Create the bitfield declaration. */
23209 identifier,
23210 sfk_none)
23213 width,
23214 attributes);
23215 }
23216 else
23217 {
23219 tree initializer;
23220 tree asm_specification;
23223 /* Parse the declarator. */
23224 declarator
23229 friend_p);
23231 /* If something went wrong parsing the declarator, make sure
23232 that we at least consume some tokens. */
23234 {
23235 /* Skip to the end of the statement. */
23237 /* If the next token is not a semicolon, that is
23238 probably because we just skipped over the body of
23239 a function. So, we consume a semicolon if
23240 present, but do not issue an error message if it
23241 is not present. */
23243 CPP_SEMICOLON))
23246 }
23249 cp_parser_check_for_definition_in_return_type
23253 /* Look for an asm-specification. */
23255 /* Look for attributes that apply to the declaration. */
23257 /* Remember which attributes are prefix attributes and
23258 which are not. */
23260 /* Combine the attributes. */
23263 /* If it's an `=', then we have a constant-initializer or a
23264 pure-specifier. It is not correct to parse the
23265 initializer before registering the member declaration
23266 since the member declaration should be in scope while
23267 its initializer is processed. However, the rest of the
23268 front end does not yet provide an interface that allows
23269 us to handle this correctly. */
23271 {
23272 /* In [class.mem]:
23274 A pure-specifier shall be used only in the declaration of
23275 a virtual function.
23277 A member-declarator can contain a constant-initializer
23278 only if it declares a static member of integral or
23279 enumeration type.
23281 Therefore, if the DECLARATOR is for a function, we look
23282 for a pure-specifier; otherwise, we look for a
23283 constant-initializer. When we call `grokfield', it will
23284 perform more stringent semantics checks. */
23296 {
23298 /* Don't require a constant rvalue in C++11, since we
23299 might want a reference constant. We'll enforce
23300 constancy later. */
23302 /* Parse the initializer. */
23305 }
23306 else
23307 /* Parse the initializer. */
23309 }
23312 {
23316 else
23318 }
23319 /* Otherwise, there is no initializer. */
23320 else
23323 /* See if we are probably looking at a function
23324 definition. We are certainly not looking at a
23325 member-declarator. Calling `grokfield' has
23326 side-effects, so we must not do it unless we are sure
23327 that we are looking at a member-declarator. */
23330 {
23331 /* The grammar does not allow a pure-specifier to be
23332 used when a member function is defined. (It is
23333 possible that this fact is an oversight in the
23334 standard, since a pure function may be defined
23335 outside of the class-specifier. */
23341 declarator,
23342 attributes);
23345 /* If the member was not a friend, declare it here. */
23348 /* Peek at the next token. */
23350 /* If the next token is a semicolon, consume it. */
23354 }
23355 else
23358 /* Create the declaration. */
23363 {
23366 else
23368 }
23369 }
23374 /* Reset PREFIX_ATTRIBUTES. */
23380 /* If there is any qualification still in effect, clear it
23381 now; we will be starting fresh with the next declarator. */
23385 /* If it's a `,', then there are more declarators. */
23387 {
23390 {
23394 }
23395 }
23396 /* If the next token isn't a `;', then we have a parse error. */
23398 CPP_SEMICOLON))
23399 {
23400 /* The next token might be a ways away from where the
23401 actual semicolon is missing. Find the previous token
23402 and use that for our error position. */
23407 /* Assume that the user meant to provide a semicolon. If
23408 we were to cp_parser_skip_to_end_of_statement, we might
23409 skip to a semicolon inside a member function definition
23410 and issue nonsensical error messages. */
23412 }
23415 {
23416 /* Add DECL to the list of members. */
23418 /* Explicitly include, eg, NSDMIs, for better error
23419 recovery (c++/58650). */
23428 /* Add DECL to the queue of NSDMI to be parsed later. */
23430 }
23434 }
23435 }
23438 out:
23440 }
23442 /* Parse a pure-specifier.
23444 pure-specifier:
23445 = 0
23447 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23448 Otherwise, ERROR_MARK_NODE is returned. */
23450 static tree
23452 {
23455 /* Look for the `=' token. */
23458 /* Look for the `0' token. */
23467 /* Accept = default or = delete in c++0x mode. */
23470 {
23473 }
23475 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23477 {
23482 }
23484 {
23487 }
23490 }
23492 /* Parse a constant-initializer.
23494 constant-initializer:
23495 = constant-expression
23497 Returns a representation of the constant-expression. */
23499 static tree
23501 {
23502 /* Look for the `=' token. */
23506 /* It is invalid to write:
23508 struct S { static const int i = { 7 }; };
23510 */
23512 {
23515 /* Consume the opening brace. */
23517 /* Skip the initializer. */
23519 /* Look for the trailing `}'. */
23523 }
23526 }
23528 /* Derived classes [gram.class.derived] */
23530 /* Parse a base-clause.
23532 base-clause:
23533 : base-specifier-list
23535 base-specifier-list:
23536 base-specifier ... [opt]
23537 base-specifier-list , base-specifier ... [opt]
23539 Returns a TREE_LIST representing the base-classes, in the order in
23540 which they were declared. The representation of each node is as
23541 described by cp_parser_base_specifier.
23543 In the case that no bases are specified, this function will return
23544 NULL_TREE, not ERROR_MARK_NODE. */
23546 static tree
23548 {
23551 /* Look for the `:' that begins the list. */
23554 /* Scan the base-specifier-list. */
23556 {
23558 tree base;
23561 /* Look for the base-specifier. */
23563 /* Look for the (optional) ellipsis. */
23565 {
23566 /* Consume the `...'. */
23570 }
23572 /* Add BASE to the front of the list. */
23574 {
23576 /* Make this a pack expansion type. */
23580 {
23583 }
23584 }
23585 /* Peek at the next token. */
23587 /* If it's not a comma, then the list is complete. */
23590 /* Consume the `,'. */
23592 }
23594 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23595 base class had a qualified name. However, the next name that
23596 appears is certainly not qualified. */
23602 }
23604 /* Parse a base-specifier.
23606 base-specifier:
23607 :: [opt] nested-name-specifier [opt] class-name
23608 virtual access-specifier [opt] :: [opt] nested-name-specifier
23609 [opt] class-name
23610 access-specifier virtual [opt] :: [opt] nested-name-specifier
23611 [opt] class-name
23613 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23614 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23615 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23616 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23618 static tree
23620 {
23628 tree type;
23630 /* Process the optional `virtual' and `access-specifier'. */
23632 {
23633 /* Peek at the next token. */
23635 /* Process `virtual'. */
23637 {
23639 /* If `virtual' appears more than once, issue an error. */
23641 {
23645 }
23649 /* Consume the `virtual' token. */
23657 /* If more than one access specifier appears, issue an
23658 error. */
23661 {
23665 }
23669 /* Consume the access-specifier. */
23677 }
23678 }
23679 /* It is not uncommon to see programs mechanically, erroneously, use
23680 the 'typename' keyword to denote (dependent) qualified types
23681 as base classes. */
23683 {
23688 else
23690 "keyword %<typename%> not allowed in this context "
23693 }
23695 /* Look for the optional `::' operator. */
23697 /* Look for the nested-name-specifier. The simplest way to
23698 implement:
23700 [temp.res]
23702 The keyword `typename' is not permitted in a base-specifier or
23703 mem-initializer; in these contexts a qualified name that
23704 depends on a template-parameter is implicitly assumed to be a
23705 type name.
23707 is to pretend that we have seen the `typename' keyword at this
23708 point. */
23714 /* If the base class is given by a qualified name, assume that names
23715 we see are type names or templates, as appropriate. */
23721 /* DR 950 allows decltype as a base-specifier. */
23723 else
23724 {
23725 /* Otherwise, look for the class-name. */
23727 class_scope_p,
23728 template_p,
23729 typename_type,
23734 }
23740 }
23742 /* Exception handling [gram.exception] */
23744 /* Parse an (optional) noexcept-specification.
23746 noexcept-specification:
23747 noexcept ( constant-expression ) [opt]
23749 If no noexcept-specification is present, returns NULL_TREE.
23750 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23751 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23752 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23753 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23754 in which case a boolean condition is returned instead. */
23756 static tree
23761 {
23765 /* Peek at the next token. */
23768 /* Is it a noexcept-specification? */
23770 {
23771 tree expr;
23775 {
23779 {
23780 /* Types may not be defined in an exception-specification. */
23782 parser->type_definition_forbidden_message
23787 /* Restore the saved message. */
23789 }
23790 else
23791 {
23794 }
23797 }
23798 else
23799 {
23803 }
23805 /* We cannot build a noexcept-spec right away because this will check
23806 that expr is a constexpr. */
23809 else
23811 }
23812 else
23814 }
23816 /* Parse an (optional) exception-specification.
23818 exception-specification:
23819 throw ( type-id-list [opt] )
23821 Returns a TREE_LIST representing the exception-specification. The
23822 TREE_VALUE of each node is a type. */
23824 static tree
23826 {
23828 tree type_id_list;
23831 /* Peek at the next token. */
23834 /* Is it a noexcept-specification? */
23840 /* If it's not `throw', then there's no exception-specification. */
23846 /* Consume the `throw'. */
23849 /* Look for the `('. */
23852 /* Peek at the next token. */
23854 /* If it's not a `)', then there is a type-id-list. */
23856 {
23857 /* Types may not be defined in an exception-specification. */
23859 parser->type_definition_forbidden_message
23861 /* Parse the type-id-list. */
23863 /* Restore the saved message. */
23867 {
23871 }
23874 "dynamic exception specifications are deprecated in C++11;"
23876 }
23877 /* In C++17, throw() is equivalent to noexcept (true). throw()
23878 is deprecated in C++11 and above as well, but is still widely used,
23879 so don't warn about it yet. */
23882 else
23885 /* Look for the `)'. */
23889 }
23891 /* Parse an (optional) type-id-list.
23893 type-id-list:
23894 type-id ... [opt]
23895 type-id-list , type-id ... [opt]
23897 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23898 in the order that the types were presented. */
23900 static tree
23902 {
23906 {
23908 tree type;
23912 /* Get the next type-id. */
23914 /* Check for invalid 'auto'. */
23916 {
23920 }
23921 /* Parse the optional ellipsis. */
23923 {
23924 /* Consume the `...'. */
23927 /* Turn the type into a pack expansion expression. */
23929 }
23930 /* Add it to the list. */
23932 /* Peek at the next token. */
23934 /* If it is not a `,', we are done. */
23937 /* Consume the `,'. */
23939 }
23942 }
23944 /* Parse a try-block.
23946 try-block:
23947 try compound-statement handler-seq */
23949 static tree
23951 {
23952 tree try_block;
23966 }
23968 /* Parse a function-try-block.
23970 function-try-block:
23971 try ctor-initializer [opt] function-body handler-seq */
23973 static bool
23975 {
23976 tree compound_stmt;
23977 tree try_block;
23980 /* Look for the `try' keyword. */
23983 /* Let the rest of the front end know where we are. */
23985 /* Parse the function-body. */
23986 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23988 /* We're done with the `try' part. */
23990 /* Parse the handlers. */
23992 /* We're done with the handlers. */
23996 }
23998 /* Parse a handler-seq.
24000 handler-seq:
24001 handler handler-seq [opt] */
24003 static void
24005 {
24007 {
24010 /* Parse the handler. */
24012 /* Peek at the next token. */
24014 /* If it's not `catch' then there are no more handlers. */
24017 }
24018 }
24020 /* Parse a handler.
24022 handler:
24023 catch ( exception-declaration ) compound-statement */
24025 static void
24027 {
24028 tree handler;
24029 tree declaration;
24039 }
24041 /* Parse an exception-declaration.
24043 exception-declaration:
24044 type-specifier-seq declarator
24045 type-specifier-seq abstract-declarator
24046 type-specifier-seq
24047 ...
24049 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24050 ellipsis variant is used. */
24052 static tree
24054 {
24055 cp_decl_specifier_seq type_specifiers;
24059 /* If it's an ellipsis, it's easy to handle. */
24061 {
24062 /* Consume the `...' token. */
24065 }
24067 /* Types may not be defined in exception-declarations. */
24069 parser->type_definition_forbidden_message
24072 /* Parse the type-specifier-seq. */
24076 /* If it's a `)', then there is no declarator. */
24079 else
24086 /* Restore the saved message. */
24093 }
24095 /* Parse a throw-expression.
24097 throw-expression:
24098 throw assignment-expression [opt]
24100 Returns a THROW_EXPR representing the throw-expression. */
24102 static tree
24104 {
24105 tree expression;
24110 /* Figure out whether or not there is an assignment-expression
24111 following the "throw" keyword. */
24119 else
24123 }
24125 /* GNU Extensions */
24127 /* Parse an (optional) asm-specification.
24129 asm-specification:
24130 asm ( string-literal )
24132 If the asm-specification is present, returns a STRING_CST
24133 corresponding to the string-literal. Otherwise, returns
24134 NULL_TREE. */
24136 static tree
24138 {
24140 tree asm_specification;
24142 /* Peek at the next token. */
24144 /* If the next token isn't the `asm' keyword, then there's no
24145 asm-specification. */
24149 /* Consume the `asm' token. */
24151 /* Look for the `('. */
24154 /* Look for the string-literal. */
24157 /* Look for the `)'. */
24161 }
24163 /* Parse an asm-operand-list.
24165 asm-operand-list:
24166 asm-operand
24167 asm-operand-list , asm-operand
24169 asm-operand:
24170 string-literal ( expression )
24171 [ string-literal ] string-literal ( expression )
24173 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24174 each node is the expression. The TREE_PURPOSE is itself a
24175 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24176 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24177 is a STRING_CST for the string literal before the parenthesis. Returns
24178 ERROR_MARK_NODE if any of the operands are invalid. */
24180 static tree
24182 {
24187 {
24188 tree string_literal;
24189 tree expression;
24190 tree name;
24193 {
24194 /* Consume the `[' token. */
24196 /* Read the operand name. */
24201 /* Look for the closing `]'. */
24203 }
24204 else
24206 /* Look for the string-literal. */
24209 /* Look for the `('. */
24211 /* Parse the expression. */
24213 /* Look for the `)'. */
24221 /* Add this operand to the list. */
24223 expression,
24224 asm_operands);
24225 /* If the next token is not a `,', there are no more
24226 operands. */
24229 /* Consume the `,'. */
24231 }
24234 }
24236 /* Parse an asm-clobber-list.
24238 asm-clobber-list:
24239 string-literal
24240 asm-clobber-list , string-literal
24242 Returns a TREE_LIST, indicating the clobbers in the order that they
24243 appeared. The TREE_VALUE of each node is a STRING_CST. */
24245 static tree
24247 {
24251 {
24252 tree string_literal;
24254 /* Look for the string literal. */
24256 /* Add it to the list. */
24258 /* If the next token is not a `,', then the list is
24259 complete. */
24262 /* Consume the `,' token. */
24264 }
24267 }
24269 /* Parse an asm-label-list.
24271 asm-label-list:
24272 identifier
24273 asm-label-list , identifier
24275 Returns a TREE_LIST, indicating the labels in the order that they
24276 appeared. The TREE_VALUE of each node is a label. */
24278 static tree
24280 {
24284 {
24287 /* Look for the identifier. */
24290 {
24293 {
24299 }
24300 }
24301 /* If the next token is not a `,', then the list is
24302 complete. */
24305 /* Consume the `,' token. */
24307 }
24310 }
24312 /* Return TRUE iff the next tokens in the stream are possibly the
24313 beginning of a GNU extension attribute. */
24315 static bool
24317 {
24319 }
24321 /* Return TRUE iff the next tokens in the stream are possibly the
24322 beginning of a standard C++-11 attribute specifier. */
24324 static bool
24326 {
24328 }
24330 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24331 beginning of a standard C++-11 attribute specifier. */
24333 static bool
24335 {
24343 }
24345 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24346 beginning of a GNU extension attribute. */
24348 static bool
24350 {
24354 }
24356 /* Return true iff the next tokens can be the beginning of either a
24357 GNU attribute list, or a standard C++11 attribute sequence. */
24359 static bool
24361 {
24364 }
24366 /* Return true iff the next Nth tokens can be the beginning of either
24367 a GNU attribute list, or a standard C++11 attribute sequence. */
24369 static bool
24371 {
24374 }
24376 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24377 of GNU attributes, or return NULL. */
24379 static tree
24381 {
24385 }
24387 #define CILK_SIMD_FN_CLAUSE_MASK \
24388 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24389 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24390 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24391 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24392 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24394 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24395 vector [(<clauses>)] */
24397 static void
24399 {
24403 {
24409 }
24412 {
24415 paren_scope++;
24416 }
24418 {
24421 paren_scope++;
24423 paren_scope--;
24424 /* Do not push the last ')' */
24427 }
24436 }
24438 /* Parse an (optional) series of attributes.
24440 attributes:
24441 attributes attribute
24443 attribute:
24444 __attribute__ (( attribute-list [opt] ))
24446 The return value is as for cp_parser_gnu_attribute_list. */
24448 static tree
24450 {
24454 {
24456 tree attribute_list;
24459 /* Peek at the next token. */
24461 /* If it's not `__attribute__', then we're done. */
24465 /* Consume the `__attribute__' keyword. */
24467 /* Look for the two `(' tokens. */
24471 /* Peek at the next token. */
24474 /* Parse the attribute-list. */
24476 else
24477 /* If the next token is a `)', then there is no attribute
24478 list. */
24481 /* Look for the two `)' tokens. */
24489 /* Add these new attributes to the list. */
24491 }
24494 }
24496 /* Parse a GNU attribute-list.
24498 attribute-list:
24499 attribute
24500 attribute-list , attribute
24502 attribute:
24503 identifier
24504 identifier ( identifier )
24505 identifier ( identifier , expression-list )
24506 identifier ( expression-list )
24508 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24509 to an attribute. The TREE_PURPOSE of each node is the identifier
24510 indicating which attribute is in use. The TREE_VALUE represents
24511 the arguments, if any. */
24513 static tree
24515 {
24521 {
24523 tree identifier;
24524 tree attribute;
24526 /* Look for the identifier. We also allow keywords here; for
24527 example `__attribute__ ((const))' is legal. */
24531 {
24534 /* Consume the token, but save it since we need it for the
24535 SIMD enabled function parsing. */
24538 /* Save away the identifier that indicates which attribute
24539 this is. */
24541 /* For keywords, use the canonical spelling, not the
24542 parsed identifier. */
24548 /* Peek at the next token. */
24550 /* If it's an `(', then parse the attribute arguments. */
24552 {
24557 {
24560 }
24561 else
24562 vec = cp_parser_parenthesized_expression_list
24568 else
24569 {
24572 }
24573 /* Save the arguments away. */
24575 }
24577 {
24580 }
24583 {
24584 /* Add this attribute to the list. */
24587 }
24590 }
24591 /* Now, look for more attributes. If the next token isn't a
24592 `,', we're done. */
24596 /* Consume the comma and keep going. */
24598 }
24601 /* We built up the list in reverse order. */
24603 }
24605 /* Parse a standard C++11 attribute.
24607 The returned representation is a TREE_LIST which TREE_PURPOSE is
24608 the scoped name of the attribute, and the TREE_VALUE is its
24609 arguments list.
24611 Note that the scoped name of the attribute is itself a TREE_LIST
24612 which TREE_PURPOSE is the namespace of the attribute, and
24613 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24614 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24615 and which TREE_PURPOSE is directly the attribute name.
24617 Clients of the attribute code should use get_attribute_namespace
24618 and get_attribute_name to get the actual namespace and name of
24619 attributes, regardless of their being GNU or C++11 attributes.
24621 attribute:
24622 attribute-token attribute-argument-clause [opt]
24624 attribute-token:
24625 identifier
24626 attribute-scoped-token
24628 attribute-scoped-token:
24629 attribute-namespace :: identifier
24631 attribute-namespace:
24632 identifier
24634 attribute-argument-clause:
24635 ( balanced-token-seq )
24637 balanced-token-seq:
24638 balanced-token [opt]
24639 balanced-token-seq balanced-token
24641 balanced-token:
24642 ( balanced-token-seq )
24643 [ balanced-token-seq ]
24644 { balanced-token-seq }. */
24646 static tree
24648 {
24652 /* First, parse name of the attribute, a.k.a attribute-token. */
24669 {
24670 /* We are seeing a scoped attribute token. */
24685 else
24686 {
24690 }
24692 NULL_TREE);
24694 }
24697 NULL_TREE);
24698 else
24699 {
24701 NULL_TREE);
24702 /* C++11 noreturn attribute is equivalent to GNU's. */
24705 /* C++14 deprecated attribute is equivalent to GNU's. */
24707 {
24710 "%<deprecated%> is a C++14 feature;"
24713 }
24714 /* C++17 fallthrough attribute is equivalent to GNU's. */
24716 {
24719 "%<fallthrough%> is a C++17 feature;"
24722 }
24723 /* Transactional Memory TS optimize_for_synchronized attribute is
24724 equivalent to GNU transaction_callable. */
24728 /* Transactional Memory attributes are GNU attributes. */
24731 }
24733 /* Now parse the optional argument clause of the attribute. */
24738 {
24744 /* A GNU attribute that takes an identifier in parameter. */
24747 vec = cp_parser_parenthesized_expression_list
24753 else
24754 {
24757 }
24761 else
24763 }
24766 }
24768 /* Check that the attribute ATTRIBUTE appears at most once in the
24769 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24770 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24771 isn't implemented yet in GCC. */
24773 static void
24775 {
24777 {
24787 }
24788 }
24790 /* Parse a list of standard C++-11 attributes.
24792 attribute-list:
24793 attribute [opt]
24794 attribute-list , attribute[opt]
24795 attribute ...
24796 attribute-list , attribute ...
24797 */
24799 static tree
24801 {
24806 {
24811 {
24815 }
24818 {
24823 else
24827 }
24831 }
24834 }
24836 /* Parse a standard C++-11 attribute specifier.
24838 attribute-specifier:
24839 [ [ attribute-using-prefix [opt] attribute-list ] ]
24840 alignment-specifier
24842 attribute-using-prefix:
24843 using attribute-namespace :
24845 alignment-specifier:
24846 alignas ( type-id ... [opt] )
24847 alignas ( alignment-expression ... [opt] ). */
24849 static tree
24851 {
24857 {
24864 {
24875 {
24879 "attribute using prefix only available "
24885 }
24886 else
24888 }
24895 else
24896 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24897 when we are sure that we have actually parsed them. */
24899 }
24900 else
24901 {
24902 tree alignas_expr;
24904 /* Look for an alignment-specifier. */
24916 {
24919 }
24925 {
24932 }
24938 {
24941 }
24944 {
24947 }
24949 /* Build the C++-11 representation of an 'aligned'
24950 attribute. */
24951 attributes =
24954 alignas_expr);
24955 }
24958 }
24960 /* Parse a standard C++-11 attribute-specifier-seq.
24962 attribute-specifier-seq:
24963 attribute-specifier-seq [opt] attribute-specifier
24964 */
24966 static tree
24968 {
24973 {
24982 else
24985 }
24988 }
24990 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24991 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24992 current value of the PEDANTIC flag, regardless of whether or not
24993 the `__extension__' keyword is present. The caller is responsible
24994 for restoring the value of the PEDANTIC flag. */
24996 static bool
24998 {
24999 /* Save the old value of the PEDANTIC flag. */
25003 {
25004 /* Consume the `__extension__' token. */
25006 /* We're not being pedantic while the `__extension__' keyword is
25007 in effect. */
25011 }
25014 }
25016 /* Parse a label declaration.
25018 label-declaration:
25019 __label__ label-declarator-seq ;
25021 label-declarator-seq:
25022 identifier , label-declarator-seq
25023 identifier */
25025 static void
25027 {
25028 /* Look for the `__label__' keyword. */
25032 {
25033 tree identifier;
25035 /* Look for an identifier. */
25037 /* If we failed, stop. */
25040 /* Declare it as a label. */
25042 /* If the next token is a `;', stop. */
25045 /* Look for the `,' separating the label declarations. */
25047 }
25049 /* Look for the final `;'. */
25051 }
25053 // -------------------------------------------------------------------------- //
25054 // Requires Clause
25056 // Parse a requires clause.
25057 //
25058 // requires-clause:
25059 // 'requires' logical-or-expression
25060 //
25061 // The required logical-or-expression must be a constant expression. Note
25062 // that we don't check that the expression is constepxr here. We defer until
25063 // we analyze constraints and then, we only check atomic constraints.
25064 static tree
25066 {
25067 // Parse the requires clause so that it is not automatically folded.
25075 }
25077 // Optionally parse a requires clause:
25078 static tree
25080 {
25083 {
25086 {
25089 /* Parse and discard the requires-clause. */
25092 }
25094 }
25097 }
25100 /*---------------------------------------------------------------------------
25101 Requires expressions
25102 ---------------------------------------------------------------------------*/
25104 /* Parse a requires expression
25106 requirement-expression:
25107 'requires' requirement-parameter-list [opt] requirement-body */
25108 static tree
25110 {
25114 /* A requires-expression shall appear only within a concept
25115 definition or a requires-clause.
25117 TODO: Implement this diagnostic correctly. */
25119 {
25123 }
25126 {
25127 /* Local parameters are delared as variables within the scope
25128 of the expression. They are not visible past the end of
25129 the expression. Expressions within the requires-expression
25130 are unevaluated. */
25131 struct scope_sentinel
25132 {
25134 {
25137 }
25140 {
25143 }
25146 /* Parse the optional parameter list. */
25148 {
25152 }
25153 else
25156 /* Parse the requirement body. */
25160 }
25162 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25163 the parm chain. */
25166 }
25168 /* Parse a parameterized requirement.
25170 requirement-parameter-list:
25171 '(' parameter-declaration-clause ')' */
25172 static tree
25174 {
25184 }
25186 /* Parse the body of a requirement.
25188 requirement-body:
25189 '{' requirement-list '}' */
25190 static tree
25192 {
25202 }
25204 /* Parse a list of requirements.
25206 requirement-list:
25207 requirement
25208 requirement-list ';' requirement[opt] */
25209 static tree
25211 {
25214 {
25221 /* If we see a semi-colon, consume it. */
25225 /* Stop processing at the end of the list. */
25228 }
25230 /* Reverse the order of requirements so they are analyzed in
25231 declaration order. */
25233 }
25235 /* Parse a syntactic requirement or type requirement.
25237 requirement:
25238 simple-requirement
25239 compound-requirement
25240 type-requirement
25241 nested-requirement */
25242 static tree
25244 {
25251 else
25253 }
25255 /* Parse a simple requirement.
25257 simple-requirement:
25258 expression ';' */
25259 static tree
25261 {
25270 }
25272 /* Parse a type requirement
25274 type-requirement
25275 nested-name-specifier [opt] required-type-name ';'
25277 required-type-name:
25278 type-name
25279 'template' [opt] simple-template-id */
25280 static tree
25282 {
25285 // Save the scope before parsing name specifiers.
25296 tree type;
25298 {
25307 }
25308 else
25327 }
25329 /* Parse a compound requirement
25331 compound-requirement:
25332 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25333 static tree
25335 {
25336 /* Parse an expression enclosed in '{ }'s. */
25347 /* Parse the optional noexcept. */
25350 {
25353 }
25355 /* Parse the optional trailing return type. */
25358 {
25366 }
25369 }
25371 /* Parse a nested requirement. This is the same as a requires clause.
25373 nested-requirement:
25374 requires-clause */
25375 static tree
25377 {
25383 }
25385 /* Support Functions */
25387 /* Return the appropriate prefer_type argument for lookup_name_real based on
25388 tag_type and template_mem_access. */
25392 {
25393 /* DR 141: When looking in the current enclosing context for a template-name
25394 after -> or ., only consider class templates. */
25398 {
25402 }
25403 }
25405 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25406 NAME should have one of the representations used for an
25407 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25408 is returned. If PARSER->SCOPE is a dependent type, then a
25409 SCOPE_REF is returned.
25411 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25412 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25413 was formed. Abstractly, such entities should not be passed to this
25414 function, because they do not need to be looked up, but it is
25415 simpler to check for this special case here, rather than at the
25416 call-sites.
25418 In cases not explicitly covered above, this function returns a
25419 DECL, OVERLOAD, or baselink representing the result of the lookup.
25420 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25421 is returned.
25423 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25424 (e.g., "struct") that was used. In that case bindings that do not
25425 refer to types are ignored.
25427 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25428 ignored.
25430 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25431 are ignored.
25433 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25434 types.
25436 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25437 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25438 NULL_TREE otherwise. */
25440 static cp_expr
25447 location_t name_location)
25448 {
25449 tree decl;
25452 /* Assume that the lookup will be unambiguous. */
25456 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25457 no longer valid. Note that if we are parsing tentatively, and
25458 the parse fails, OBJECT_TYPE will be automatically restored. */
25464 /* A template-id has already been resolved; there is no lookup to
25465 do. */
25469 {
25473 }
25475 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25476 it should already have been checked to make sure that the name
25477 used matches the type being destroyed. */
25479 {
25480 tree type;
25482 /* Figure out to which type this destructor applies. */
25487 else
25489 /* If that's not a class type, there is no destructor. */
25496 /* If it was a class type, return the destructor. */
25498 }
25500 /* By this point, the NAME should be an ordinary identifier. If
25501 the id-expression was a qualified name, the qualifying scope is
25502 stored in PARSER->SCOPE at this point. */
25505 /* Perform the lookup. */
25507 {
25513 /* If the SCOPE is dependent, the lookup must be deferred until
25514 the template is instantiated -- unless we are explicitly
25515 looking up names in uninstantiated templates. Even then, we
25516 cannot look up the name if the scope is not a class type; it
25517 might, for example, be a template type parameter. */
25522 /* Defer lookup. */
25524 else
25525 {
25528 /* If PARSER->SCOPE is a dependent type, then it must be a
25529 class type, and we must not be checking dependencies;
25530 otherwise, we would have processed this lookup above. So
25531 that PARSER->SCOPE is not considered a dependent base by
25532 lookup_member, we must enter the scope here. */
25536 /* If the PARSER->SCOPE is a template specialization, it
25537 may be instantiated during name lookup. In that case,
25538 errors may be issued. Even if we rollback the current
25539 tentative parse, those errors are valid. */
25544 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25545 lookup result and the nested-name-specifier nominates a class C:
25546 * if the name specified after the nested-name-specifier, when
25547 looked up in C, is the injected-class-name of C (Clause 9), or
25548 * if the name specified after the nested-name-specifier is the
25549 same as the identifier or the simple-template-id's template-
25550 name in the last component of the nested-name-specifier,
25551 the name is instead considered to name the constructor of
25552 class C. [ Note: for example, the constructor is not an
25553 acceptable lookup result in an elaborated-type-specifier so
25554 the constructor would not be used in place of the
25555 injected-class-name. --end note ] Such a constructor name
25556 shall be used only in the declarator-id of a declaration that
25557 names a constructor or in a using-declaration. */
25565 /* If we have a single function from a using decl, pull it out. */
25572 }
25574 /* If the scope is a dependent type and either we deferred lookup or
25575 we did lookup but didn't find the name, rememeber the name. */
25578 {
25580 {
25581 tree type;
25583 /* The resolution to Core Issue 180 says that `struct
25584 A::B' should be considered a type-name, even if `A'
25585 is dependent. */
25590 }
25594 CPP_CLOSE_PAREN)))
25598 else
25601 is_template);
25602 }
25605 }
25607 {
25608 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25609 OBJECT_TYPE is not a class. */
25611 /* If the OBJECT_TYPE is a template specialization, it may
25612 be instantiated during name lookup. In that case, errors
25613 may be issued. Even if we rollback the current tentative
25614 parse, those errors are valid. */
25616 name,
25619 tf_warning_or_error);
25620 else
25624 /* Look it up in the enclosing context. DR 141: When looking for a
25625 template-name after -> or ., only consider class templates. */
25630 /* The object is type-dependent, so we can't look anything up; we used
25631 this to get the DR 141 behavior. */
25635 }
25636 else
25637 {
25643 }
25645 /* If the lookup failed, let our caller know. */
25649 /* Pull out the template from an injected-class-name (or multiple). */
25653 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25655 {
25658 /* The error message we have to print is too complicated for
25659 cp_parser_error, so we incorporate its actions directly. */
25661 {
25663 name);
25665 }
25667 }
25675 /* If we have resolved the name of a member declaration, check to
25676 see if the declaration is accessible. When the name resolves to
25677 set of overloaded functions, accessibility is checked when
25678 overload resolution is done.
25680 During an explicit instantiation, access is not checked at all,
25681 as per [temp.explicit]. */
25688 }
25690 /* Like cp_parser_lookup_name, but for use in the typical case where
25691 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25692 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25694 static tree
25696 {
25698 none_type,
25703 location);
25704 }
25706 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25707 the current context, return the TYPE_DECL. If TAG_NAME_P is
25708 true, the DECL indicates the class being defined in a class-head,
25709 or declared in an elaborated-type-specifier.
25711 Otherwise, return DECL. */
25713 static tree
25715 {
25716 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25717 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25719 struct A {
25720 template <typename T> struct B;
25721 };
25723 template <typename T> struct A::B {};
25725 Similarly, in an elaborated-type-specifier:
25727 namespace N { struct X{}; }
25729 struct A {
25730 template <typename T> friend struct N::X;
25731 };
25733 However, if the DECL refers to a class type, and we are in
25734 the scope of the class, then the name lookup automatically
25735 finds the TYPE_DECL created by build_self_reference rather
25736 than a TEMPLATE_DECL. For example, in:
25738 template <class T> struct S {
25739 S s;
25740 };
25742 there is no need to handle such case. */
25748 }
25750 /* If too many, or too few, template-parameter lists apply to the
25751 declarator, issue an error message. Returns TRUE if all went well,
25752 and FALSE otherwise. */
25754 static bool
25757 location_t declarator_location)
25758 {
25760 {
25762 {
25770 /* If the DECLARATOR has the form `X<y>' then it uses one
25771 additional level of template parameters. */
25774 return cp_parser_check_template_parameters
25776 }
25792 }
25794 }
25796 /* NUM_TEMPLATES were used in the current declaration. If that is
25797 invalid, return FALSE and issue an error messages. Otherwise,
25798 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25799 declarator and we can print more accurate diagnostics. */
25801 static bool
25804 location_t location,
25806 {
25807 /* If there are the same number of template classes and parameter
25808 lists, that's OK. */
25811 /* If there are more, but only one more, then we are referring to a
25812 member template. That's OK too. */
25815 /* If there are more template classes than parameter lists, we have
25816 something like:
25818 template <class T> void S<T>::R<T>::f (); */
25820 {
25830 else
25833 }
25834 /* Otherwise, there are too many template parameter lists. We have
25835 something like:
25837 template <class T> template <class U> void S::f(); */
25840 }
25842 /* Parse an optional `::' token indicating that the following name is
25843 from the global namespace. If so, PARSER->SCOPE is set to the
25844 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25845 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25846 Returns the new value of PARSER->SCOPE, if the `::' token is
25847 present, and NULL_TREE otherwise. */
25849 static tree
25851 {
25854 /* Peek at the next token. */
25856 /* If we're looking at a `::' token then we're starting from the
25857 global namespace, not our current location. */
25859 {
25860 /* Consume the `::' token. */
25862 /* Set the SCOPE so that we know where to start the lookup. */
25868 }
25870 {
25874 }
25877 }
25879 /* Returns TRUE if the upcoming token sequence is the start of a
25880 constructor declarator. If FRIEND_P is true, the declarator is
25881 preceded by the `friend' specifier. */
25883 static bool
25885 {
25888 tree nested_name_specifier;
25891 /* The common case is that this is not a constructor declarator, so
25892 try to avoid doing lots of work if at all possible. It's not
25893 valid declare a constructor at function scope. */
25896 /* And only certain tokens can begin a constructor declarator. */
25904 /* Parse tentatively; we are going to roll back all of the tokens
25905 consumed here. */
25907 /* Assume that we are looking at a constructor declarator. */
25910 /* Look for the optional `::' operator. */
25913 /* Look for the nested-name-specifier. */
25914 nested_name_specifier
25925 /* Outside of a class-specifier, there must be a
25926 nested-name-specifier. */
25932 /* If we have a class scope, this is easy; DR 147 says that S::S always
25933 names the constructor, and no other qualified name could. */
25936 {
25946 }
25947 /* If we still think that this might be a constructor-declarator,
25948 look for a class-name. */
25950 {
25951 /* If we have:
25953 template <typename T> struct S {
25954 S();
25955 };
25957 we must recognize that the nested `S' names a class. */
25958 tree type_decl;
25962 none_type,
25966 /* If there was no class-name, then this is not a constructor.
25967 Otherwise, if we are in a class-specifier and we aren't
25968 handling a friend declaration, check that its type matches
25969 current_class_type (c++/38313). Note: error_mark_node
25970 is left alone for error recovery purposes. */
25972 && (outside_class_specifier_p
25977 /* If we're still considering a constructor, we have to see a `(',
25978 to begin the parameter-declaration-clause, followed by either a
25979 `)', an `...', or a decl-specifier. We need to check for a
25980 type-specifier to avoid being fooled into thinking that:
25982 S (f) (int);
25984 is a constructor. (It is actually a function named `f' that
25985 takes one parameter (of type `int') and returns a value of type
25986 `S'. */
25994 /* A parameter declaration begins with a decl-specifier,
25995 which is either the "attribute" keyword, a storage class
25996 specifier, or (usually) a type-specifier. */
25998 {
25999 tree type;
26003 /* Names appearing in the type-specifier should be looked up
26004 in the scope of the class. */
26007 else
26008 {
26011 {
26015 {
26018 }
26019 }
26021 }
26023 /* Inside the constructor parameter list, surrounding
26024 template-parameter-lists do not apply. */
26025 saved_num_template_parameter_lists
26029 /* Look for the type-specifier. */
26031 CP_PARSER_FLAGS_NONE,
26037 parser->num_template_parameter_lists
26040 /* Leave the scope of the class. */
26045 }
26046 }
26048 /* We did not really want to consume any tokens. */
26052 }
26054 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26055 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26056 they must be performed once we are in the scope of the function.
26058 Returns the function defined. */
26060 static tree
26061 cp_parser_function_definition_from_specifiers_and_declarator
26064 tree attributes,
26066 {
26067 tree fn;
26070 /* Begin the function-definition. */
26073 /* The things we're about to see are not directly qualified by any
26074 template headers we've seen thus far. */
26077 /* If there were names looked up in the decl-specifier-seq that we
26078 did not check, check them now. We must wait until we are in the
26079 scope of the function to perform the checks, since the function
26080 might be a friend. */
26084 {
26089 }
26092 {
26093 /* Skip the entire function. */
26096 }
26098 {
26099 /* Seen already, skip it. An error message has already been output. */
26103 /* If this is a function from a class, pop the nested class. */
26106 }
26107 else
26108 {
26109 timevar_id_t tv;
26112 else
26118 }
26121 }
26123 /* Parse the part of a function-definition that follows the
26124 declarator. INLINE_P is TRUE iff this function is an inline
26125 function defined within a class-specifier.
26127 Returns the function defined. */
26129 static tree
26132 {
26133 tree fn;
26139 bool fully_implicit_function_template_p
26142 tree implicit_template_parms
26145 cp_binding_level* implicit_template_scope
26151 /* If the next token is `return', then the code may be trying to
26152 make use of the "named return value" extension that G++ used to
26153 support. */
26156 {
26157 /* Consume the `return' keyword. */
26159 /* Look for the identifier that indicates what value is to be
26160 returned. */
26162 /* Issue an error message. */
26165 /* Skip tokens until we reach the start of the function body. */
26167 {
26174 }
26175 }
26176 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26177 anything declared inside `f'. */
26178 saved_in_unbraced_linkage_specification_p
26181 /* Inside the function, surrounding template-parameter-lists do not
26182 apply. */
26183 saved_num_template_parameter_lists
26189 /* If the next token is `try', `__transaction_atomic', or
26190 `__transaction_relaxed`, then we are looking at either function-try-block
26191 or function-transaction-block. Note that all of these include the
26192 function-body. */
26195 RID_TRANSACTION_ATOMIC);
26197 RID_TRANSACTION_RELAXED))
26199 RID_TRANSACTION_RELAXED);
26202 else
26203 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26208 /* Finish the function. */
26211 /* Generate code for it, if necessary. */
26213 /* Restore the saved values. */
26214 parser->in_unbraced_linkage_specification_p
26216 parser->num_template_parameter_lists
26220 parser->fully_implicit_function_template_p
26222 parser->implicit_template_parms
26224 parser->implicit_template_scope
26231 }
26233 /* Parse a template-declaration body (following argument list). */
26235 static void
26237 tree parameter_list,
26239 {
26243 /* We just processed one more parameter list. */
26246 /* Get the deferred access checks from the parameter list. These
26247 will be checked once we know what is being declared, as for a
26248 member template the checks must be performed in the scope of the
26249 class containing the member. */
26252 /* Tentatively parse for a new template parameter list, which can either be
26253 the template keyword or a template introduction. */
26259 else
26260 {
26261 /* There are no access checks when parsing a template, as we do not
26262 know if a specialization will be a friend. */
26266 checks,
26267 member_p,
26272 /* If this is a member template declaration, let the front
26273 end know. */
26275 {
26280 }
26285 }
26286 /* We are done with the current parameter list. */
26291 /* Finish up. */
26294 /* Check the template arguments for a literal operator template. */
26298 {
26302 else
26303 {
26306 {
26312 }
26314 {
26323 }
26324 else
26326 }
26328 {
26331 " Expected non-type template argument pack <char...>"
26333 decl);
26334 else
26337 decl);
26338 }
26339 }
26341 /* Register member declarations. */
26344 /* If DECL is a function template, we must return to parse it later.
26345 (Even though there is no definition, there might be default
26346 arguments that need handling.) */
26350 }
26352 /* Parse a template introduction header for a template-declaration. Returns
26353 false if tentative parse fails. */
26355 static bool
26357 {
26364 /* Look for the optional `::' operator. */
26367 /* Look for the nested-name-specifier. */
26377 /* Look up the concept for which we will be matching
26378 template parameters. */
26388 /* Look for opening brace for introduction. */
26396 /* Build vector of placeholder parameters and grab
26397 matching identifiers. */
26400 /* The introduction-list shall not be empty. */
26403 {
26406 }
26408 /* Look for closing brace for introduction. */
26413 {
26417 }
26419 /* Build and associate the constraint. */
26422 {
26424 member_p);
26426 }
26430 }
26432 /* Parse a normal template-declaration following the template keyword. */
26434 static void
26436 {
26437 tree parameter_list;
26441 /* Look for the `<' token. */
26445 {
26446 /* 14.5.2.2 [temp.mem]
26448 A local class shall not have member templates. */
26453 }
26454 /* [temp]
26456 A template ... shall not have C linkage. */
26458 {
26460 /* Give it C++ linkage to avoid confusing other parts of the
26461 front end. */
26464 }
26465 else
26468 /* We cannot perform access checks on the template parameter
26469 declarations until we know what is being declared, just as we
26470 cannot check the decl-specifier list. */
26473 /* If the next token is `>', then we have an invalid
26474 specialization. Rather than complain about an invalid template
26475 parameter, issue an error message here. */
26477 {
26481 }
26482 else
26483 {
26484 /* Parse the template parameters. */
26486 }
26488 /* Look for the `>'. */
26491 /* Manage template requirements */
26493 {
26498 }
26501 member_p);
26503 /* For the erroneous case of a template with C linkage, we pushed an
26504 implicit C++ linkage scope; exit that scope now. */
26507 }
26509 /* Parse a template-declaration, assuming that the `export' (and
26510 `extern') keywords, if present, has already been scanned. MEMBER_P
26511 is as for cp_parser_template_declaration. */
26513 static bool
26515 {
26517 {
26521 }
26526 }
26528 /* Perform the deferred access checks from a template-parameter-list.
26529 CHECKS is a TREE_LIST of access checks, as returned by
26530 get_deferred_access_checks. */
26532 static void
26533 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26534 {
26538 }
26540 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26541 `function-definition' sequence that follows a template header.
26542 If MEMBER_P is true, this declaration appears in a class scope.
26544 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26545 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26547 static tree
26553 {
26556 cp_decl_specifier_seq decl_specifiers;
26560 /* This function is only used when processing a template
26561 declaration. */
26565 /* Defer access checks until we know what is being declared. */
26568 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26569 alternative. */
26572 CP_PARSER_FLAGS_OPTIONAL,
26578 /* There are no template typedefs. */
26580 {
26584 }
26586 /* Gather up the access checks that occurred the
26587 decl-specifier-seq. */
26590 /* Check for the declaration of a template class. */
26592 {
26595 {
26596 // If this is a declaration, but not a definition, associate
26597 // any constraints with the type declaration. Constraints
26598 // are associated with definitions in cp_parser_class_specifier.
26604 /* In this case:
26606 struct C {
26607 friend template <typename T> struct A<T>::B;
26608 };
26610 A<T>::B will be represented by a TYPENAME_TYPE, and
26611 therefore not recognized by shadow_tag. */
26613 && !decl
26620 else
26623 /* Perform access checks for template parameters. */
26626 /* Give a helpful diagnostic for
26627 template <class T> struct A { } a;
26628 if we aren't already recovering from an error. */
26631 {
26633 "a class template declaration must not declare "
26637 }
26638 }
26639 }
26641 /* Complain about missing 'typename' or other invalid type names. */
26644 {
26645 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26646 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26647 the rest of this declaration. */
26650 }
26652 /* If it's not a template class, try for a template function. If
26653 the next token is a `;', then this declaration does not declare
26654 anything. But, if there were errors in the decl-specifiers, then
26655 the error might well have come from an attempted class-specifier.
26656 In that case, there's no need to warn about a missing declarator. */
26660 {
26663 checks,
26665 member_p,
26666 declares_class_or_enum,
26670 /* 7.1.1-1 [dcl.stc]
26672 A storage-class-specifier shall not be specified in an explicit
26673 specialization... */
26675 && explicit_specialization_p
26677 {
26681 }
26685 }
26687 /* Look for a trailing `;' after the declaration. */
26693 out:
26696 /* Clear any current qualification; whatever comes next is the start
26697 of something new. */
26703 }
26705 /* Parse a cast-expression that is not the operand of a unary "&". */
26707 static cp_expr
26709 {
26712 }
26714 /* Parse a functional cast to TYPE. Returns an expression
26715 representing the cast. */
26717 static cp_expr
26719 {
26721 tree expression_list;
26722 cp_expr cast;
26731 {
26740 tf_warning_or_error);
26741 /* Create a location of the form:
26742 type_name{i, f}
26743 ^~~~~~~~~~~~~~~
26744 with caret == start at the start of the type name,
26745 finishing at the closing brace. */
26746 location_t finish_loc
26749 finish_loc);
26752 }
26761 else
26762 {
26765 }
26768 tf_warning_or_error);
26769 /* [expr.const]/1: In an integral constant expression "only type
26770 conversions to integral or enumeration type can be used". */
26776 NIC_CONSTRUCTOR))
26779 /* Create a location of the form:
26780 float(i)
26781 ^~~~~~~~
26782 with caret == start at the start of the type name,
26783 finishing at the closing paren. */
26784 location_t finish_loc
26789 }
26791 /* Save the tokens that make up the body of a member function defined
26792 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26793 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26794 specifiers applied to the declaration. Returns the FUNCTION_DECL
26795 for the member function. */
26797 static tree
26801 tree attributes)
26802 {
26805 tree fn;
26808 /* Create the FUNCTION_DECL. */
26812 /* If something went badly wrong, bail out now. */
26814 {
26815 /* If there's a function-body, skip it. */
26820 }
26822 /* Remember it, if there default args to post process. */
26825 /* Save away the tokens that make up the body of the
26826 function. */
26832 RID_TRANSACTION_ATOMIC))
26833 {
26835 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26842 {
26848 }
26849 else
26852 {
26856 }
26857 }
26859 /* Handle function try blocks. */
26861 {
26864 }
26865 /* We can have braced-init-list mem-initializers before the fn body. */
26867 {
26870 {
26871 /* cache_group will stop after an un-nested { } pair, too. */
26875 /* variadic mem-inits have ... after the ')'. */
26878 }
26879 }
26881 /* Handle function try blocks. */
26887 /* Save away the inline definition; we will process it when the
26888 class is complete. */
26892 /* We need to know that this was defined in the class, so that
26893 friend templates are handled correctly. */
26896 /* Add FN to the queue of functions to be parsed later. */
26900 }
26902 /* Save the tokens that make up the in-class initializer for a non-static
26903 data member. Returns a DEFAULT_ARG. */
26905 static tree
26907 {
26909 }
26911 /* Parse a template-argument-list, as well as the trailing ">" (but
26912 not the opening "<"). See cp_parser_template_argument_list for the
26913 return value. */
26915 static tree
26917 {
26918 tree arguments;
26919 tree saved_scope;
26920 tree saved_qualifying_scope;
26921 tree saved_object_scope;
26926 /* [temp.names]
26928 When parsing a template-id, the first non-nested `>' is taken as
26929 the end of the template-argument-list rather than a greater-than
26930 operator. */
26931 saved_greater_than_is_operator_p
26934 /* Parsing the argument list may modify SCOPE, so we save it
26935 here. */
26939 /* We need to evaluate the template arguments, even though this
26940 template-id may be nested within a "sizeof". */
26945 /* Parse the template-argument-list itself. */
26949 else
26951 /* Look for the `>' that ends the template-argument-list. If we find
26952 a '>>' instead, it's probably just a typo. */
26954 {
26956 {
26957 /* In C++0x, a `>>' in a template argument list or cast
26958 expression is considered to be two separate `>'
26959 tokens. So, change the current token to a `>', but don't
26960 consume it: it will be consumed later when the outer
26961 template argument list (or cast expression) is parsed.
26962 Note that this replacement of `>' for `>>' is necessary
26963 even if we are parsing tentatively: in the tentative
26964 case, after calling
26965 cp_parser_enclosed_template_argument_list we will always
26966 throw away all of the template arguments and the first
26967 closing `>', either because the template argument list
26968 was erroneous or because we are replacing those tokens
26969 with a CPP_TEMPLATE_ID token. The second `>' (which will
26970 not have been thrown away) is needed either to close an
26971 outer template argument list or to complete a new-style
26972 cast. */
26975 }
26977 {
26978 /* If we're in a nested template argument list, the '>>' has
26979 to be a typo for '> >'. We emit the error message, but we
26980 continue parsing and we push a '>' as next token, so that
26981 the argument list will be parsed correctly. Note that the
26982 global source location is still on the token before the
26983 '>>', so we need to say explicitly where we want it. */
26991 }
26992 else
26993 {
26994 /* If this is not a nested template argument list, the '>>'
26995 is a typo for '>'. Emit an error message and continue.
26996 Same deal about the token location, but here we can get it
26997 right by consuming the '>>' before issuing the diagnostic. */
27000 "spurious %<>>%>, use %<>%> to terminate "
27002 }
27003 }
27004 else
27006 /* The `>' token might be a greater-than operator again now. */
27007 parser->greater_than_is_operator_p
27009 /* Restore the SAVED_SCOPE. */
27017 }
27019 /* MEMBER_FUNCTION is a member function, or a friend. If default
27020 arguments, or the body of the function have not yet been parsed,
27021 parse them now. */
27023 static void
27025 {
27027 /* If this member is a template, get the underlying
27028 FUNCTION_DECL. */
27032 /* There should not be any class definitions in progress at this
27033 point; the bodies of members are only parsed outside of all class
27034 definitions. */
27036 /* While we're parsing the member functions we might encounter more
27037 classes. We want to handle them right away, but we don't want
27038 them getting mixed up with functions that are currently in the
27039 queue. */
27042 /* Make sure that any template parameters are in scope. */
27045 /* If the body of the function has not yet been parsed, parse it
27046 now. */
27048 {
27049 tree function_scope;
27052 /* The function is no longer pending; we are processing it. */
27057 /* If this is a local class, enter the scope of the containing
27058 function. */
27063 /* Push the body of the function onto the lexer stack. */
27066 /* Let the front end know that we going to be defining this
27067 function. */
27071 /* Don't do access checking if it is a templated function. */
27075 /* #pragma omp declare reduction needs special parsing. */
27077 {
27082 }
27083 else
27084 /* Now, parse the body of the function. */
27091 /* Leave the scope of the containing function. */
27095 }
27097 /* Remove any template parameters from the symbol table. */
27100 /* Restore the queue. */
27103 }
27105 /* If DECL contains any default args, remember it on the unparsed
27106 functions queue. */
27108 static void
27110 {
27111 tree probe;
27114 probe;
27117 {
27121 }
27122 }
27124 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27125 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27126 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27127 from the parameter-type-list. */
27129 static tree
27132 {
27134 tree parsed_arg;
27140 /* Push the saved tokens for the default argument onto the parser's
27141 lexer stack. */
27147 /* Parse the default argument. */
27158 {
27159 /* In a non-template class, check conversions now. In a template,
27160 we'll wait and instantiate these as needed. */
27163 tf_warning_or_error);
27164 else
27166 }
27168 /* If the token stream has not been completely used up, then
27169 there was extra junk after the end of the default
27170 argument. */
27172 {
27175 else
27177 }
27179 /* Revert to the main lexer. */
27183 }
27185 /* FIELD is a non-static data member with an initializer which we saved for
27186 later; parse it now. */
27188 static void
27190 {
27191 tree def;
27198 NULL_TREE);
27204 }
27206 /* FN is a FUNCTION_DECL which may contains a parameter with an
27207 unparsed DEFAULT_ARG. Parse the default args now. This function
27208 assumes that the current scope is the scope in which the default
27209 argument should be processed. */
27211 static void
27213 {
27217 /* While we're parsing the default args, we might (due to the
27218 statement expression extension) encounter more classes. We want
27219 to handle them right away, but we don't want them getting mixed
27220 up with default args that are currently in the queue. */
27223 /* Local variable names (and the `this' keyword) may not appear
27224 in a default argument. */
27235 {
27237 tree parsed_arg;
27239 tree copy;
27246 /* This can happen for a friend declaration for a function
27247 already declared with default arguments. */
27250 parsed_arg
27252 default_arg,
27255 {
27257 }
27261 /* Update any instantiations we've already created. */
27265 }
27269 /* Make sure no default arg is missing. */
27272 /* Restore the state of local_variables_forbidden_p. */
27275 /* Restore the queue. */
27277 }
27279 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27281 sizeof ... ( identifier )
27283 where the 'sizeof' token has already been consumed. */
27285 static tree
27287 {
27288 /* Consume the `...'. */
27295 else
27303 /* The name is not qualified. */
27322 }
27324 /* Parse the operand of `sizeof' (or a similar operator). Returns
27325 either a TYPE or an expression, depending on the form of the
27326 input. The KEYWORD indicates which kind of expression we have
27327 encountered. */
27329 static tree
27331 {
27338 /* If it's a `...', then we are computing the length of a parameter
27339 pack. */
27344 /* Types cannot be defined in a `sizeof' expression. Save away the
27345 old message. */
27347 /* And create the new one. */
27353 /* The restrictions on constant-expressions do not apply inside
27354 sizeof expressions. */
27355 saved_integral_constant_expression_p
27357 saved_non_integral_constant_expression_p
27361 /* Do not actually evaluate the expression. */
27364 /* If it's a `(', then we might be looking at the type-id
27365 construction. */
27367 {
27370 /* We can't be sure yet whether we're looking at a type-id or an
27371 expression. */
27373 /* Note: as a GNU Extension, compound literals are considered
27374 postfix-expressions as they are in C99, so they are valid
27375 arguments to sizeof. See comment in cp_parser_cast_expression
27376 for details. */
27379 else
27380 {
27383 /* Look for the type-id. */
27385 /* Look for the closing `)'. */
27388 }
27390 /* If all went well, then we're done. */
27392 {
27393 cp_decl_specifier_seq decl_specs;
27395 /* Build a trivial decl-specifier-seq. */
27399 /* Call grokdeclarator to figure out what type this is. */
27402 TYPENAME,
27405 }
27406 }
27408 /* If the type-id production did not work out, then we must be
27409 looking at the unary-expression production. */
27413 /* Go back to evaluating expressions. */
27417 /* Free the message we created. */
27419 /* And restore the old one. */
27421 parser->integral_constant_expression_p
27423 parser->non_integral_constant_expression_p
27427 }
27429 /* If the current declaration has no declarator, return true. */
27431 static bool
27433 {
27434 /* If the next token is a `;' or a `,' then there is no
27435 declarator. */
27438 }
27440 /* Update the DECL_SPECS to reflect the storage class indicated by
27441 KEYWORD. */
27443 static void
27448 {
27449 cp_storage_class storage_class;
27452 {
27456 }
27458 {
27461 }
27466 {
27469 }
27472 {
27490 }
27494 /* A storage class specifier cannot be applied alongside a typedef
27495 specifier. If there is a typedef specifier present then set
27496 conflicting_specifiers_p which will trigger an error later
27497 on in grokdeclarator. */
27500 }
27502 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27503 is true, the type is a class or enum definition. */
27505 static void
27507 tree type_spec,
27510 {
27513 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27514 (with, for example, in "typedef int wchar_t;") we remember that
27515 this is what happened. In system headers, we ignore these
27516 declarations so that G++ can work with system headers that are not
27517 C++-safe. */
27519 && !type_definition_p
27529 {
27532 ds_redefined_builtin_type_spec,
27533 token);
27535 {
27539 }
27540 }
27543 else
27544 {
27549 }
27550 }
27552 /* True iff TOKEN is the GNU keyword __thread. */
27554 static bool
27556 {
27559 }
27561 /* Set the location for a declarator specifier and check if it is
27562 duplicated.
27564 DECL_SPECS is the sequence of declarator specifiers onto which to
27565 set the location.
27567 DS is the single declarator specifier to set which location is to
27568 be set onto the existing sequence of declarators.
27570 LOCATION is the location for the declarator specifier to
27571 consider. */
27573 static void
27576 {
27585 {
27589 }
27590 else
27591 {
27593 {
27597 else
27598 {
27601 OPT_Wlong_long,
27603 }
27604 }
27606 {
27611 else
27613 }
27614 else
27615 {
27631 "__complex"
27632 };
27635 }
27636 }
27637 }
27639 /* Return true iff the declarator specifier DS is present in the
27640 sequence of declarator specifiers DECL_SPECS. */
27642 bool
27644 cp_decl_spec ds)
27645 {
27652 }
27654 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27655 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27657 static bool
27659 {
27661 }
27663 /* Issue an error message indicating that TOKEN_DESC was expected.
27664 If KEYWORD is true, it indicated this function is called by
27665 cp_parser_require_keword and the required token can only be
27666 a indicated keyword. */
27668 static void
27670 required_token token_desc,
27672 {
27674 {
27743 }
27745 {
27747 {
27826 }
27827 }
27828 else
27830 }
27834 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27835 issue an error message indicating that TOKEN_DESC was expected.
27837 Returns the token consumed, if the token had the appropriate type.
27838 Otherwise, returns NULL. */
27843 required_token token_desc)
27844 {
27847 else
27848 {
27849 /* Output the MESSAGE -- unless we're parsing tentatively. */
27853 }
27854 }
27856 /* An error message is produced if the next token is not '>'.
27857 All further tokens are skipped until the desired token is
27858 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27860 static void
27862 {
27863 /* Current level of '< ... >'. */
27865 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27868 /* Are we ready, yet? If not, issue error message. */
27872 /* Skip tokens until the desired token is found. */
27874 {
27875 /* Peek at the next token. */
27877 {
27885 /* C++0x views the `>>' operator as two `>' tokens, but
27886 C++98 does not. */
27889 {
27890 /* We've hit a `>>' where the first `>' closes the
27891 template argument list, and the second `>' is
27892 spurious. Just consume the `>>' and stop; we've
27893 already produced at least one error. */
27896 }
27897 /* Fall through for C++0x, so we handle the second `>' in
27898 the `>>'. */
27903 {
27904 /* We've reached the token we want, consume it and stop. */
27907 }
27926 /* The '>' was probably forgotten, don't look further. */
27931 }
27933 /* Consume this token. */
27935 }
27936 }
27938 /* If the next token is the indicated keyword, consume it. Otherwise,
27939 issue an error message indicating that TOKEN_DESC was expected.
27941 Returns the token consumed, if the token had the appropriate type.
27942 Otherwise, returns NULL. */
27947 required_token token_desc)
27948 {
27952 {
27955 }
27958 }
27960 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27961 function-definition. */
27963 static bool
27965 {
27968 /* A ctor-initializer begins with a `:'. */
27970 /* A function-try-block begins with `try'. */
27972 /* A function-transaction-block begins with `__transaction_atomic'
27973 or `__transaction_relaxed'. */
27976 /* The named return value extension begins with `return'. */
27978 }
27980 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27981 definition. */
27983 static bool
27985 {
27992 }
27994 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27995 C++0x) ending a template-argument. */
27997 static bool
27999 {
28007 }
28009 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28010 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28012 static bool
28015 {
28021 /* Check for the sequence `<::' in the original code. It would be lexed as
28022 `[:', where `[' is a digraph, and there is no whitespace before
28023 `:'. */
28025 {
28030 }
28032 }
28034 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28035 or none_type otherwise. */
28037 static enum tag_types
28039 {
28041 {
28051 }
28052 }
28054 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28055 or none_type otherwise or if the token is null. */
28057 static enum tag_types
28059 {
28064 {
28072 }
28073 }
28075 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28077 static void
28079 {
28083 {
28087 type))
28090 }
28091 }
28093 /* Issue an error message if DECL is redeclared with different
28094 access than its original declaration [class.access.spec/3].
28095 This applies to nested classes, nested class templates and
28096 enumerations [class.mem/1]. */
28098 static void
28100 {
28111 }
28113 /* Look for the `template' keyword, as a syntactic disambiguator.
28114 Return TRUE iff it is present, in which case it will be
28115 consumed. */
28117 static bool
28119 {
28121 {
28122 /* In C++98 the `template' keyword can only be used within templates;
28123 outside templates the parser can always figure out what is a
28124 template and what is not. In C++11, per the resolution of DR 468,
28125 `template' is allowed in cases where it is not strictly necessary. */
28128 {
28131 "in C++98 %<template%> (as a disambiguator) is only "
28133 /* If this part of the token stream is rescanned, the same
28134 error message would be generated. So, we purge the token
28135 from the stream. */
28138 }
28139 else
28140 {
28141 /* Consume the `template' keyword. */
28144 }
28145 }
28147 }
28149 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28150 set PARSER->SCOPE, and perform other related actions. */
28152 static void
28154 {
28157 /* Get the stored value. */
28159 /* Set the scope from the stored value. */
28163 }
28165 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28166 encounter the end of a block before what we were looking for. */
28168 static bool
28172 {
28174 {
28177 /* Abort a parenthesized expression if we encounter a semicolon. */
28181 /* If we've reached the end of the file, stop. */
28187 /* We've hit the end of an enclosing block, so there's been some
28188 kind of syntax error. */
28191 /* Consume the token. */
28193 /* See if it starts a new group. */
28195 {
28197 /* In theory this should probably check end == '}', but
28198 cp_parser_save_member_function_body needs it to exit
28199 after either '}' or ')' when called with ')'. */
28202 }
28204 {
28208 }
28213 }
28214 }
28216 /* Like above, for caching a default argument or NSDMI. Both of these are
28217 terminated by a non-nested comma, but it can be unclear whether or not a
28218 comma is nested in a template argument list unless we do more parsing.
28219 In order to handle this ambiguity, when we encounter a ',' after a '<'
28220 we try to parse what follows as a parameter-declaration-list (in the
28221 case of a default argument) or a member-declarator (in the case of an
28222 NSDMI). If that succeeds, then we stop caching. */
28224 static tree
28226 {
28231 tree default_argument;
28233 /* Add tokens until we have processed the entire default
28234 argument. We add the range [first_token, token). */
28237 {
28238 /* For list-initialization, this is straightforward. */
28241 }
28243 {
28246 /* Peek at the next token. */
28248 /* What we do depends on what token we have. */
28250 {
28251 /* In valid code, a default argument must be
28252 immediately followed by a `,' `)', or `...'. */
28255 {
28256 /* If we've seen a '<', we might be in a
28257 template-argument-list. Until Core issue 325 is
28258 resolved, we don't know how this situation ought
28259 to be handled, so try to DTRT. We check whether
28260 what comes after the comma is a valid parameter
28261 declaration list. If it is, then the comma ends
28262 the default argument; otherwise the default
28263 argument continues. */
28267 /* Set ITALP so cp_parser_parameter_declaration_list
28268 doesn't decide to commit to this parse. */
28275 {
28276 /* Parse declarators until we reach a non-comma or
28277 somthing that cannot be an initializer.
28278 Just checking whether we're looking at a single
28279 declarator is insufficient. Consider:
28280 int var = tuple<T,U>::x;
28281 The template parameter 'U' looks exactly like a
28282 declarator. */
28283 do
28284 {
28295 }
28297 /* If we met an '=' or ';' then the original comma
28298 was the end of the NSDMI. Otherwise assume
28299 we're still in the NSDMI. */
28302 }
28303 else
28304 {
28309 }
28316 }
28317 /* FALLTHRU */
28320 /* If we run into a non-nested `;', `}', or `]',
28321 then the code is invalid -- but the default
28322 argument is certainly over. */
28327 /* Handle correctly int n = sizeof ... ( p ); */
28330 /* Update DEPTH, if necessary. */
28345 /* This might be the comparison operator, or it might
28346 start a template argument list. */
28353 /* Fall through for C++0x, which treats the `>>'
28354 operator like two `>' tokens in certain
28355 cases. */
28360 {
28361 /* This might be an operator, or it might close a
28362 template argument list. But if a previous '<'
28363 started a template argument list, this will have
28364 closed it, so we can't be in one anymore. */
28368 }
28371 /* If we run out of tokens, issue an error message. */
28379 /* In these cases, we should look for template-ids.
28380 For example, if the default argument is
28381 `X<int, double>()', we need to do name lookup to
28382 figure out whether or not `X' is a template; if
28383 so, the `,' does not end the default argument.
28385 That is not yet done. */
28390 }
28392 /* If we've reached the end, stop. */
28396 /* Add the token to the token block. */
28398 }
28400 /* Create a DEFAULT_ARG to represent the unparsed default
28401 argument. */
28408 }
28410 /* Begin parsing tentatively. We always save tokens while parsing
28411 tentatively so that if the tentative parsing fails we can restore the
28412 tokens. */
28414 static void
28416 {
28417 /* Enter a new parsing context. */
28419 /* Begin saving tokens. */
28421 /* In order to avoid repetitive access control error messages,
28422 access checks are queued up until we are no longer parsing
28423 tentatively. */
28425 }
28427 /* Commit to the currently active tentative parse. */
28429 static void
28431 {
28435 /* Mark all of the levels as committed. */
28438 {
28445 }
28446 }
28448 /* Commit to the topmost currently active tentative parse.
28450 Note that this function shouldn't be called when there are
28451 irreversible side-effects while in a tentative state. For
28452 example, we shouldn't create a permanent entry in the symbol
28453 table, or issue an error message that might not apply if the
28454 tentative parse is aborted. */
28456 static void
28458 {
28463 {
28471 }
28472 }
28474 /* Abort the currently active tentative parse. All consumed tokens
28475 will be rolled back, and no diagnostics will be issued. */
28477 static void
28479 {
28483 /* Now, pretend that we want to see if the construct was
28484 successfully parsed. */
28486 }
28488 /* Stop parsing tentatively. If a parse error has occurred, restore the
28489 token stream. Otherwise, commit to the tokens we have consumed.
28490 Returns true if no error occurred; false otherwise. */
28492 static bool
28494 {
28498 /* Remember whether or not an error occurred, since we are about to
28499 destroy that information. */
28501 /* Remove the topmost context from the stack. */
28504 /* If no parse errors occurred, commit to the tentative parse. */
28506 {
28507 /* Commit to the tokens read tentatively, unless that was
28508 already done. */
28513 }
28514 /* Otherwise, if errors occurred, roll back our state so that things
28515 are just as they were before we began the tentative parse. */
28516 else
28517 {
28520 }
28521 /* Add the context to the front of the free list. */
28526 }
28528 /* Returns true if we are parsing tentatively and are not committed to
28529 this tentative parse. */
28531 static bool
28533 {
28536 }
28538 /* Returns nonzero iff an error has occurred during the most recent
28539 tentative parse. */
28541 static bool
28543 {
28546 }
28548 /* Returns nonzero if GNU extensions are allowed. */
28550 static bool
28552 {
28554 }
28555 \f
28556 /* Objective-C++ Productions */
28559 /* Parse an Objective-C expression, which feeds into a primary-expression
28560 above.
28562 objc-expression:
28563 objc-message-expression
28564 objc-string-literal
28565 objc-encode-expression
28566 objc-protocol-expression
28567 objc-selector-expression
28569 Returns a tree representation of the expression. */
28571 static cp_expr
28573 {
28574 /* Try to figure out what kind of declaration is present. */
28578 {
28588 {
28600 }
28606 }
28609 }
28611 /* Parse an Objective-C message expression.
28613 objc-message-expression:
28614 [ objc-message-receiver objc-message-args ]
28616 Returns a representation of an Objective-C message. */
28618 static tree
28620 {
28632 /* Construct a location e.g.
28633 [self func1:5]
28634 ^~~~~~~~~~~~~~
28635 ranging from the '[' to the ']', with the caret at the start. */
28640 }
28642 /* Parse an objc-message-receiver.
28644 objc-message-receiver:
28645 expression
28646 simple-type-specifier
28648 Returns a representation of the type or expression. */
28650 static tree
28652 {
28653 tree rcv;
28655 /* An Objective-C message receiver may be either (1) a type
28656 or (2) an expression. */
28660 /* If that worked out, fine. */
28667 CP_PARSER_FLAGS_NONE);
28674 }
28676 /* Parse the arguments and selectors comprising an Objective-C message.
28678 objc-message-args:
28679 objc-selector
28680 objc-selector-args
28681 objc-selector-args , objc-comma-args
28683 objc-selector-args:
28684 objc-selector [opt] : assignment-expression
28685 objc-selector-args objc-selector [opt] : assignment-expression
28687 objc-comma-args:
28688 assignment-expression
28689 objc-comma-args , assignment-expression
28691 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28692 selector arguments and TREE_VALUE containing a list of comma
28693 arguments. */
28695 static tree
28697 {
28703 {
28709 /* Detect if we have a unary selector. */
28718 sel_args
28723 }
28725 /* Handle non-selector arguments, if any. */
28727 {
28728 tree arg;
28733 addl_args
28738 }
28741 {
28744 }
28747 }
28749 /* Parse an Objective-C encode expression.
28751 objc-encode-expression:
28752 @encode objc-typename
28754 Returns an encoded representation of the type argument. */
28756 static cp_expr
28758 {
28759 tree type;
28770 {
28774 }
28776 /* This happens if we find @encode(T) (where T is a template
28777 typename or something dependent on a template typename) when
28778 parsing a template. In that case, we can't compile it
28779 immediately, but we rather create an AT_ENCODE_EXPR which will
28780 need to be instantiated when the template is used.
28781 */
28783 {
28787 }
28790 /* Build a location of the form:
28791 @encode(int)
28792 ^~~~~~~~~~~~
28793 with caret==start at the @ token, finishing at the close paren. */
28794 location_t combined_loc
28799 }
28801 /* Parse an Objective-C @defs expression. */
28803 static tree
28805 {
28806 tree name;
28814 }
28816 /* Parse an Objective-C protocol expression.
28818 objc-protocol-expression:
28819 @protocol ( identifier )
28821 Returns a representation of the protocol expression. */
28823 static tree
28825 {
28826 tree proto;
28834 /* Build a location of the form:
28835 @protocol(prot)
28836 ^~~~~~~~~~~~~~~
28837 with caret==start at the @ token, finishing at the close paren. */
28838 location_t combined_loc
28844 }
28846 /* Parse an Objective-C selector expression.
28848 objc-selector-expression:
28849 @selector ( objc-method-signature )
28851 objc-method-signature:
28852 objc-selector
28853 objc-selector-seq
28855 objc-selector-seq:
28856 objc-selector :
28857 objc-selector-seq objc-selector :
28859 Returns a representation of the method selector. */
28861 static tree
28863 {
28875 {
28884 {
28885 /* Detect if we have a unary selector. */
28887 {
28890 }
28891 else
28892 {
28894 }
28895 }
28900 {
28901 sel_seq
28904 sel_seq
28907 }
28908 else
28909 sel_seq
28914 }
28916 finish_selector:
28920 /* Build a location of the form:
28921 @selector(func)
28922 ^~~~~~~~~~~~~~~
28923 with caret==start at the @ token, finishing at the close paren. */
28924 location_t combined_loc
28928 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28931 }
28933 /* Parse a list of identifiers.
28935 objc-identifier-list:
28936 identifier
28937 objc-identifier-list , identifier
28939 Returns a TREE_LIST of identifier nodes. */
28941 static tree
28943 {
28944 tree identifier;
28945 tree list;
28956 {
28963 identifier));
28965 }
28968 }
28970 /* Parse an Objective-C alias declaration.
28972 objc-alias-declaration:
28973 @compatibility_alias identifier identifier ;
28975 This function registers the alias mapping with the Objective-C front end.
28976 It returns nothing. */
28978 static void
28980 {
28988 }
28990 /* Parse an Objective-C class forward-declaration.
28992 objc-class-declaration:
28993 @class objc-identifier-list ;
28995 The function registers the forward declarations with the Objective-C
28996 front end. It returns nothing. */
28998 static void
29000 {
29003 {
29004 tree id;
29014 else
29016 }
29018 }
29020 /* Parse a list of Objective-C protocol references.
29022 objc-protocol-refs-opt:
29023 objc-protocol-refs [opt]
29025 objc-protocol-refs:
29026 < objc-identifier-list >
29028 Returns a TREE_LIST of identifiers, if any. */
29030 static tree
29032 {
29036 {
29040 }
29043 }
29045 /* Parse a Objective-C visibility specification. */
29047 static void
29049 {
29053 {
29068 }
29070 /* Eat '@private'/'@protected'/'@public'. */
29072 }
29074 /* Parse an Objective-C method type. Return 'true' if it is a class
29075 (+) method, and 'false' if it is an instance (-) method. */
29079 {
29082 else
29084 }
29086 /* Parse an Objective-C protocol qualifier. */
29088 static tree
29090 {
29103 {
29108 }
29111 }
29113 /* Parse an Objective-C typename. */
29115 static tree
29117 {
29121 {
29127 /* An ObjC type name may consist of just protocol qualifiers, in which
29128 case the type shall default to 'id'. */
29130 {
29133 /* If the type could not be parsed, an error has already
29134 been produced. For error recovery, behave as if it had
29135 not been specified, which will use the default type
29136 'id'. */
29138 {
29140 /* We need to skip to the closing parenthesis as
29141 cp_parser_type_id() does not seem to do it for
29142 us. */
29147 }
29148 }
29152 }
29155 }
29157 /* Check to see if TYPE refers to an Objective-C selector name. */
29159 static bool
29161 {
29167 }
29169 /* Parse an Objective-C selector. */
29171 static tree
29173 {
29177 {
29180 }
29182 /* C++ operator names are allowed to appear in ObjC selectors. */
29184 {
29197 }
29198 }
29200 /* Parse an Objective-C params list. */
29202 static tree
29204 {
29210 {
29220 /* Detect if we have a unary selector. */
29223 {
29226 }
29230 {
29231 /* Something went quite wrong. There should be a colon
29232 here, but there is not. Stop parsing parameters. */
29234 }
29236 /* New ObjC allows attributes on parameters too. */
29241 params
29244 type_name,
29245 identifier,
29246 parm_attr));
29249 }
29252 {
29255 }
29257 /* We allow tail attributes for the method. */
29259 {
29267 }
29270 {
29273 }
29275 }
29277 /* Parse the non-keyword Objective-C params. */
29279 static tree
29282 {
29288 {
29290 tree parm;
29296 {
29301 }
29303 /* TODO: parse attributes for tail parameters. */
29312 }
29314 /* We allow tail attributes for the method. */
29316 {
29318 {
29323 }
29324 else
29325 /* We have an error, but parse the attributes, so that we can
29326 carry on. */
29332 }
29335 }
29337 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29339 static void
29341 {
29344 /* If the next token is `extern' and the following token is a string
29345 literal, then we have a linkage specification. */
29347 && cp_parser_is_pure_string_literal
29350 /* Handle #pragma, if any. */
29353 /* Allow stray semicolons. */
29356 /* Mark methods as optional or required, when building protocols. */
29358 {
29361 }
29363 {
29366 }
29369 /* Other stray characters must generate errors. */
29371 {
29375 }
29376 /* Finally, try to parse a block-declaration, or a function-definition. */
29377 else
29379 }
29381 /* Parse a method signature. */
29383 static tree
29385 {
29401 }
29403 static bool
29405 {
29406 tree tattr;
29411 /* If the attributes are followed by a method introducer, this is not allowed.
29412 Dump the attributes and flag the situation. */
29417 /* Otherwise, the attributes introduce some interstitial code, possibly so
29418 rewind to allow that check. */
29421 }
29423 /* Parse an Objective-C method prototype list. */
29425 static void
29427 {
29431 {
29433 {
29438 else
29442 {
29446 }
29449 }
29455 OPT_Wattributes,
29457 else
29458 /* Allow for interspersed non-ObjC++ code. */
29462 }
29466 else
29470 }
29472 /* Parse an Objective-C method definition list. */
29474 static void
29476 {
29480 {
29481 tree meth;
29484 {
29490 else
29495 {
29499 }
29501 NULL_TREE);
29503 /* For historical reasons, we accept an optional semicolon. */
29510 {
29517 }
29518 }
29519 /* The following case will be removed once @synthesize is
29520 completely implemented. */
29531 else
29532 /* Allow for interspersed non-ObjC++ code. */
29536 }
29540 else
29544 }
29546 /* Parse Objective-C ivars. */
29548 static void
29550 {
29561 {
29562 cp_decl_specifier_seq declspecs;
29564 tree prefix_attributes;
29572 CP_PARSER_FLAGS_OPTIONAL,
29576 /* auto, register, static, extern, mutable. */
29578 {
29581 }
29583 /* thread_local. */
29585 {
29588 }
29590 /* typedef. */
29592 {
29595 }
29600 /* Keep going until we hit the `;' at the end of the
29601 declaration. */
29603 {
29608 /* Check for a (possibly unnamed) bitfield declaration. */
29616 {
29617 /* Get the name of the bitfield. */
29620 sfk_none);
29622 eat_colon:
29624 /* Get the width of the bitfield. */
29625 width
29627 }
29628 else
29629 {
29630 /* Parse the declarator. */
29631 declarator
29637 }
29639 /* Look for attributes that apply to the ivar. */
29641 /* Remember which attributes are prefix attributes and
29642 which are not. */
29644 /* Combine the attributes. */
29648 /* Create the bitfield declaration. */
29650 width,
29651 attributes);
29652 else
29657 /* Add the instance variable. */
29661 /* Reset PREFIX_ATTRIBUTES. */
29670 {
29673 }
29675 }
29679 }
29684 /* Do not consume the RID_AT_END, so it will be read again as terminating
29685 the @interface of @implementation. */
29689 /* For historical reasons, we accept an optional semicolon. */
29692 }
29694 /* Parse an Objective-C protocol declaration. */
29696 static void
29698 {
29704 {
29709 }
29711 /* See if we have a forward declaration or a definition. */
29714 /* Try a forward declaration first. */
29716 {
29718 {
29719 tree id;
29729 else
29731 }
29733 }
29735 /* Ok, we got a full-fledged definition (or at least should). */
29736 else
29737 {
29742 }
29743 }
29745 /* Parse an Objective-C superclass or category. */
29747 static void
29752 {
29758 {
29761 }
29763 {
29766 /* If there is no category name, and this is an @interface, we
29767 have a class extension. */
29769 {
29772 }
29773 else
29777 }
29778 }
29780 /* Parse an Objective-C class interface. */
29782 static void
29784 {
29791 {
29792 /* It's hard to recover because even if valid @interface stuff
29793 is to follow, we can't compile it (or validate it) if we
29794 don't even know which class it refers to. Let's assume this
29795 was a stray '@interface' token in the stream and skip it.
29796 */
29798 }
29803 /* We have either a class or a category on our hands. */
29806 else
29807 {
29809 /* Handle instance variable declarations, if any. */
29812 }
29815 }
29817 /* Parse an Objective-C class implementation. */
29819 static void
29821 {
29828 {
29829 /* It's hard to recover because even if valid @implementation
29830 stuff is to follow, we can't compile it (or validate it) if
29831 we don't even know which class it refers to. Let's assume
29832 this was a stray '@implementation' token in the stream and
29833 skip it.
29834 */
29836 }
29840 /* We have either a class or a category on our hands. */
29843 else
29844 {
29846 /* Handle instance variable declarations, if any. */
29849 }
29852 }
29854 /* Consume the @end token and finish off the implementation. */
29856 static void
29858 {
29861 }
29863 /* Parse an Objective-C declaration. */
29865 static void
29867 {
29868 /* Try to figure out what kind of declaration is present. */
29873 {
29889 }
29892 {
29915 }
29916 }
29918 /* Parse an Objective-C try-catch-finally statement.
29920 objc-try-catch-finally-stmt:
29921 @try compound-statement objc-catch-clause-seq [opt]
29922 objc-finally-clause [opt]
29924 objc-catch-clause-seq:
29925 objc-catch-clause objc-catch-clause-seq [opt]
29927 objc-catch-clause:
29928 @catch ( objc-exception-declaration ) compound-statement
29930 objc-finally-clause:
29931 @finally compound-statement
29933 objc-exception-declaration:
29934 parameter-declaration
29935 '...'
29937 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29939 Returns NULL_TREE.
29941 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29942 for C. Keep them in sync. */
29944 static tree
29946 {
29947 location_t location;
29948 tree stmt;
29953 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29954 node, lest it get absorbed into the surrounding block. */
29960 {
29969 {
29970 /* We have "@catch (...)" (where the '...' are literally
29971 what is in the code). Skip the '...'.
29972 parameter_declaration is set to NULL_TREE, and
29973 objc_being_catch_clauses() knows that that means
29974 '...'. */
29977 }
29978 else
29979 {
29980 /* We have "@catch (NSException *exception)" or something
29981 like that. Parse the parameter declaration. */
29985 else
29990 }
29993 else
29994 {
29995 /* If there was no open parenthesis, we are recovering from
29996 an error, and we are trying to figure out what mistake
29997 the user has made. */
29999 /* If there is an immediate closing parenthesis, the user
30000 probably forgot the opening one (ie, they typed "@catch
30001 NSException *e)". Parse the closing parenthesis and keep
30002 going. */
30006 /* If these is no immediate closing parenthesis, the user
30007 probably doesn't know that parenthesis are required at
30008 all (ie, they typed "@catch NSException *e"). So, just
30009 forget about the closing parenthesis and keep going. */
30010 }
30014 }
30016 {
30019 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30020 node, lest it get absorbed into the surrounding block. */
30024 }
30027 }
30029 /* Parse an Objective-C synchronized statement.
30031 objc-synchronized-stmt:
30032 @synchronized ( expression ) compound-statement
30034 Returns NULL_TREE. */
30036 static tree
30038 {
30039 location_t location;
30050 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30051 node, lest it get absorbed into the surrounding block. */
30056 }
30058 /* Parse an Objective-C throw statement.
30060 objc-throw-stmt:
30061 @throw assignment-expression [opt] ;
30063 Returns a constructed '@throw' statement. */
30065 static tree
30067 {
30079 }
30081 /* Parse an Objective-C statement. */
30083 static tree
30085 {
30086 /* Try to figure out what kind of declaration is present. */
30090 {
30101 }
30104 }
30106 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30107 look ahead to see if an objc keyword follows the attributes. This
30108 is to detect the use of prefix attributes on ObjC @interface and
30109 @protocol. */
30111 static bool
30113 {
30118 {
30121 }
30124 }
30126 /* This routine is a minimal replacement for
30127 c_parser_struct_declaration () used when parsing the list of
30128 types/names or ObjC++ properties. For example, when parsing the
30129 code
30131 @property (readonly) int a, b, c;
30133 this function is responsible for parsing "int a, int b, int c" and
30134 returning the declarations as CHAIN of DECLs.
30136 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30137 similar parsing. */
30138 static tree
30140 {
30142 cp_decl_specifier_seq declspecs;
30144 tree prefix_attributes;
30147 CP_PARSER_FLAGS_NONE,
30154 /* auto, register, static, extern, mutable. */
30156 {
30159 }
30161 /* thread_local. */
30163 {
30166 }
30168 /* typedef. */
30170 {
30173 }
30178 /* Keep going until we hit the `;' at the end of the declaration. */
30180 {
30185 /* Parse the declarator. */
30189 /* Look for attributes that apply to the ivar. */
30191 /* Remember which attributes are prefix attributes and
30192 which are not. */
30194 /* Combine the attributes. */
30204 /* Reset PREFIX_ATTRIBUTES. */
30215 {
30218 }
30219 else
30221 }
30223 }
30225 /* Parse an Objective-C @property declaration. The syntax is:
30227 objc-property-declaration:
30228 '@property' objc-property-attributes[opt] struct-declaration ;
30230 objc-property-attributes:
30231 '(' objc-property-attribute-list ')'
30233 objc-property-attribute-list:
30234 objc-property-attribute
30235 objc-property-attribute-list, objc-property-attribute
30237 objc-property-attribute
30238 'getter' = identifier
30239 'setter' = identifier
30240 'readonly'
30241 'readwrite'
30242 'assign'
30243 'retain'
30244 'copy'
30245 'nonatomic'
30247 For example:
30248 @property NSString *name;
30249 @property (readonly) id object;
30250 @property (retain, nonatomic, getter=getTheName) id name;
30251 @property int a, b, c;
30253 PS: This function is identical to
30254 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30255 static void
30257 {
30258 /* The following variables hold the attributes of the properties as
30259 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30260 seen. When we see an attribute, we set them to 'true' (if they
30261 are boolean properties) or to the identifier (if they have an
30262 argument, ie, for getter and setter). Note that here we only
30263 parse the list of attributes, check the syntax and accumulate the
30264 attributes that we find. objc_add_property_declaration() will
30265 then process the information. */
30275 /* 'properties' is the list of properties that we read. Usually a
30276 single one, but maybe more (eg, in "@property int a, b, c;" there
30277 are three). */
30278 tree properties;
30279 location_t loc;
30285 /* Parse the optional attribute list... */
30287 {
30288 /* Eat the '('. */
30292 {
30298 {
30301 }
30305 {
30316 {
30320 else
30325 }
30328 {
30332 }
30334 {
30336 {
30339 }
30340 else
30344 else
30346 }
30347 else
30348 {
30350 {
30353 }
30354 else
30356 }
30362 }
30369 else
30371 }
30373 /* FIXME: "@property (setter, assign);" will generate a spurious
30374 "error: expected ‘)’ before ‘,’ token". This is because
30375 cp_parser_require, unlike the C counterpart, will produce an
30376 error even if we are in error recovery. */
30378 {
30383 }
30384 }
30386 /* ... and the property declaration(s). */
30390 {
30392 /* If the next token is now a `;', consume it. */
30396 }
30400 else
30401 {
30402 /* Comma-separated properties are chained together in
30403 reverse order; add them one by one. */
30412 }
30415 }
30417 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30419 objc-synthesize-declaration:
30420 @synthesize objc-synthesize-identifier-list ;
30422 objc-synthesize-identifier-list:
30423 objc-synthesize-identifier
30424 objc-synthesize-identifier-list, objc-synthesize-identifier
30426 objc-synthesize-identifier
30427 identifier
30428 identifier = identifier
30430 For example:
30431 @synthesize MyProperty;
30432 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30434 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30435 for C. Keep them in sync.
30436 */
30437 static void
30439 {
30441 location_t loc;
30446 {
30450 {
30453 }
30455 {
30459 {
30462 }
30463 }
30464 else
30469 else
30471 }
30474 }
30476 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30478 objc-dynamic-declaration:
30479 @dynamic identifier-list ;
30481 For example:
30482 @dynamic MyProperty;
30483 @dynamic MyProperty, AnotherProperty;
30485 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30486 for C. Keep them in sync.
30487 */
30488 static void
30490 {
30492 location_t loc;
30497 {
30498 tree property;
30501 {
30504 }
30508 else
30510 }
30513 }
30515 \f
30516 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30518 /* Returns name of the next clause.
30519 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30520 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30521 returned and the token is consumed. */
30523 static pragma_omp_clause
30525 {
30541 {
30546 {
30729 }
30730 }
30736 }
30738 /* Validate that a clause of the given type does not already exist. */
30740 static void
30743 {
30744 tree c;
30748 {
30751 }
30752 }
30754 /* OpenMP 2.5:
30755 variable-list:
30756 identifier
30757 variable-list , identifier
30759 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30760 colon). An opening parenthesis will have been consumed by the caller.
30762 If KIND is nonzero, create the appropriate node and install the decl
30763 in OMP_CLAUSE_DECL and add the node to the head of the list.
30765 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30766 return the list created.
30768 COLON can be NULL if only closing parenthesis should end the list,
30769 or pointer to bool which will receive false if the list is terminated
30770 by closing parenthesis or true if the list is terminated by colon. */
30772 static tree
30775 {
30779 {
30782 }
30784 {
30789 && current_class_ptr
30791 {
30797 }
30798 else
30799 {
30812 }
30814 ;
30816 {
30818 {
30820 /* The OpenACC cache directive explicitly only allows "array
30821 elements or subarrays". */
30823 {
30827 }
30828 /* FALLTHROUGH. */
30833 {
30834 location_t loc
30839 decl
30843 }
30844 /* FALLTHROUGH. */
30848 {
30856 parser->colon_corrects_to_scope_p
30860 else
30861 {
30862 /* Look for `:'. */
30866 CPP_CLOSE_SQUARE))
30868 }
30869 /* Look for the closing `]'. */
30871 RT_CLOSE_SQUARE))
30875 }
30879 }
30885 }
30886 else
30889 get_comma:
30893 }
30899 {
30903 }
30906 {
30909 /* Try to resync to an unnested comma. Copied from
30910 cp_parser_parenthesized_expression_list. */
30911 skip_comma:
30920 }
30923 }
30925 /* Similarly, but expect leading and trailing parenthesis. This is a very
30926 common case for omp clauses. */
30928 static tree
30930 {
30934 }
30936 /* OpenACC 2.0:
30937 copy ( variable-list )
30938 copyin ( variable-list )
30939 copyout ( variable-list )
30940 create ( variable-list )
30941 delete ( variable-list )
30942 present ( variable-list )
30943 present_or_copy ( variable-list )
30944 pcopy ( variable-list )
30945 present_or_copyin ( variable-list )
30946 pcopyin ( variable-list )
30947 present_or_copyout ( variable-list )
30948 pcopyout ( variable-list )
30949 present_or_create ( variable-list )
30950 pcreate ( variable-list ) */
30952 static tree
30954 tree list)
30955 {
30958 {
31004 }
31012 }
31014 /* OpenACC 2.0:
31015 deviceptr ( variable-list ) */
31017 static tree
31019 {
31023 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31024 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31025 variable-list must only allow for pointer variables. */
31028 {
31035 }
31038 }
31040 /* OpenACC 2.0:
31041 auto
31042 independent
31043 nohost
31044 seq */
31046 static tree
31050 {
31055 }
31057 /* OpenACC:
31058 num_gangs ( expression )
31059 num_workers ( expression )
31060 vector_length ( expression ) */
31062 static tree
31065 {
31075 {
31080 }
31088 }
31090 /* OpenACC:
31092 gang [( gang-arg-list )]
31093 worker [( [num:] int-expr )]
31094 vector [( [length:] int-expr )]
31096 where gang-arg is one of:
31098 [num:] int-expr
31099 static: size-expr
31101 and size-expr may be:
31103 *
31104 int-expr
31105 */
31107 static tree
31110 {
31120 {
31123 do
31124 {
31128 /* Gang static argument. */
31131 {
31139 {
31142 }
31144 /* Check for the '*' argument. */
31148 CPP_CLOSE_PAREN)))
31149 {
31154 {
31157 }
31159 }
31160 }
31161 /* Worker num: argument and vector length: arguments. */
31165 {
31168 }
31170 /* Now collect the actual argument. */
31172 {
31175 }
31187 {
31190 }
31192 }
31197 }
31211 cleanup_error:
31214 }
31216 /* OpenACC 2.0:
31217 tile ( size-expr-list ) */
31219 static tree
31221 {
31230 do
31231 {
31235 {
31238 }
31239 else
31249 }
31252 /* Consume the trailing ')'. */
31260 }
31262 /* OpenACC 2.0
31263 Parse wait clause or directive parameters. */
31265 static tree
31267 {
31277 {
31282 }
31289 {
31293 {
31296 else
31297 {
31304 }
31305 }
31306 }
31309 }
31311 /* OpenACC:
31312 wait ( int-expr-list ) */
31314 static tree
31316 {
31325 }
31327 /* OpenMP 3.0:
31328 collapse ( constant-expression ) */
31330 static tree
31332 {
31334 location_t loc;
31335 HOST_WIDE_INT n;
31355 {
31358 }
31366 }
31368 /* OpenMP 2.5:
31369 default ( shared | none )
31371 OpenACC 2.0
31372 default (none) */
31374 static tree
31377 {
31379 tree c;
31384 {
31389 {
31404 }
31407 }
31408 else
31409 {
31410 invalid_kind:
31413 else
31415 }
31431 }
31433 /* OpenMP 3.1:
31434 final ( expression ) */
31436 static tree
31438 {
31459 }
31461 /* OpenMP 2.5:
31462 if ( expression )
31464 OpenMP 4.5:
31465 if ( directive-name-modifier : expression )
31467 directive-name-modifier:
31468 parallel | task | taskloop | target data | target | target update
31469 | target enter data | target exit data */
31471 static tree
31474 {
31482 {
31494 {
31497 {
31510 else
31511 {
31512 location_t loc
31517 }
31520 {
31522 {
31527 }
31529 {
31530 location_t loc
31534 }
31535 }
31536 }
31537 }
31539 {
31541 {
31544 }
31545 else
31546 {
31548 {
31549 location_t loc
31552 }
31554 }
31555 }
31556 }
31568 {
31571 {
31574 {
31584 }
31586 p);
31588 }
31590 {
31593 else
31596 }
31599 {
31603 }
31604 }
31612 }
31614 /* OpenMP 3.1:
31615 mergeable */
31617 static tree
31620 {
31621 tree c;
31624 location);
31629 }
31631 /* OpenMP 2.5:
31632 nowait */
31634 static tree
31637 {
31638 tree c;
31645 }
31647 /* OpenMP 2.5:
31648 num_threads ( expression ) */
31650 static tree
31652 location_t location)
31653 {
31675 }
31677 /* OpenMP 4.5:
31678 num_tasks ( expression ) */
31680 static tree
31682 location_t location)
31683 {
31705 }
31707 /* OpenMP 4.5:
31708 grainsize ( expression ) */
31710 static tree
31712 location_t location)
31713 {
31735 }
31737 /* OpenMP 4.5:
31738 priority ( expression ) */
31740 static tree
31742 location_t location)
31743 {
31765 }
31767 /* OpenMP 4.5:
31768 hint ( expression ) */
31770 static tree
31772 location_t location)
31773 {
31794 }
31796 /* OpenMP 4.5:
31797 defaultmap ( tofrom : scalar ) */
31799 static tree
31801 location_t location)
31802 {
31810 {
31813 }
31817 {
31820 }
31826 {
31829 }
31833 {
31836 }
31842 location);
31848 out_err:
31853 }
31855 /* OpenMP 2.5:
31856 ordered
31858 OpenMP 4.5:
31859 ordered ( constant-expression ) */
31861 static tree
31864 {
31866 HOST_WIDE_INT n;
31872 {
31889 {
31891 "ordered argument needs positive constant integer "
31894 }
31895 }
31901 }
31903 /* OpenMP 2.5:
31904 reduction ( reduction-operator : variable-list )
31906 reduction-operator:
31907 One of: + * - & ^ | && ||
31909 OpenMP 3.1:
31911 reduction-operator:
31912 One of: + * - & ^ | && || min max
31914 OpenMP 4.0:
31916 reduction-operator:
31917 One of: + * - & ^ | && ||
31918 id-expression */
31920 static tree
31922 {
31930 {
31940 }
31944 else
31945 {
31956 {
31986 }
31987 else
31988 {
31990 resync_fail:
31995 }
31996 }
32002 NULL);
32004 {
32007 }
32010 }
32012 /* OpenMP 2.5:
32013 schedule ( schedule-kind )
32014 schedule ( schedule-kind , expression )
32016 schedule-kind:
32017 static | dynamic | guided | runtime | auto
32019 OpenMP 4.5:
32020 schedule ( schedule-modifier : schedule-kind )
32021 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32023 schedule-modifier:
32024 simd
32025 monotonic
32026 nonmonotonic */
32028 static tree
32030 {
32040 {
32049 else
32055 else
32056 {
32059 }
32060 }
32063 {
32068 {
32089 }
32090 }
32095 else
32101 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32103 {
32107 }
32110 {
32125 else
32130 }
32142 invalid_kind:
32144 resync_fail:
32149 }
32151 /* OpenMP 3.0:
32152 untied */
32154 static tree
32157 {
32158 tree c;
32165 }
32167 /* OpenMP 4.0:
32168 inbranch
32169 notinbranch */
32171 static tree
32174 {
32179 }
32181 /* OpenMP 4.0:
32182 parallel
32183 for
32184 sections
32185 taskgroup */
32187 static tree
32191 {
32195 }
32197 /* OpenMP 4.5:
32198 nogroup */
32200 static tree
32203 {
32208 }
32210 /* OpenMP 4.5:
32211 simd
32212 threads */
32214 static tree
32218 {
32223 }
32225 /* OpenMP 4.0:
32226 num_teams ( expression ) */
32228 static tree
32230 location_t location)
32231 {
32253 }
32255 /* OpenMP 4.0:
32256 thread_limit ( expression ) */
32258 static tree
32260 location_t location)
32261 {
32283 }
32285 /* OpenMP 4.0:
32286 aligned ( variable-list )
32287 aligned ( variable-list : constant-expression ) */
32289 static tree
32291 {
32302 {
32312 }
32318 }
32320 /* OpenMP 4.0:
32321 linear ( variable-list )
32322 linear ( variable-list : expression )
32324 OpenMP 4.5:
32325 linear ( modifier ( variable-list ) )
32326 linear ( modifier ( variable-list ) : expression ) */
32328 static tree
32331 {
32341 {
32353 else
32355 }
32360 else
32361 {
32370 }
32373 {
32378 {
32389 {
32392 }
32395 }
32400 {
32403 }
32411 }
32414 {
32417 }
32420 }
32422 /* OpenMP 4.0:
32423 safelen ( constant-expression ) */
32425 static tree
32427 location_t location)
32428 {
32449 }
32451 /* OpenMP 4.0:
32452 simdlen ( constant-expression ) */
32454 static tree
32456 location_t location)
32457 {
32478 }
32480 /* OpenMP 4.5:
32481 vec:
32482 identifier [+/- integer]
32483 vec , identifier [+/- integer]
32484 */
32486 static tree
32488 tree list)
32489 {
32493 {
32496 }
32499 {
32506 else
32507 {
32508 t = cp_parser_lookup_name_simple
32513 id_loc);
32514 }
32520 {
32523 }
32527 {
32530 }
32534 {
32537 }
32540 add_to_vector:
32542 {
32546 }
32552 }
32555 {
32561 }
32563 }
32565 /* OpenMP 4.0:
32566 depend ( depend-kind : variable-list )
32568 depend-kind:
32569 in | out | inout
32571 OpenMP 4.5:
32572 depend ( source )
32574 depend ( sink : vec ) */
32576 static tree
32578 {
32586 {
32600 else
32602 }
32603 else
32609 {
32619 }
32626 else
32627 {
32633 }
32636 invalid_kind:
32638 resync_fail:
32643 }
32645 /* OpenMP 4.0:
32646 map ( map-kind : variable-list )
32647 map ( variable-list )
32649 map-kind:
32650 alloc | to | from | tofrom
32652 OpenMP 4.5:
32653 map-kind:
32654 alloc | to | from | tofrom | release | delete
32656 map ( always [,] map-kind: variable-list ) */
32658 static tree
32660 {
32669 {
32674 {
32677 nth++;
32683 {
32688 }
32689 }
32690 }
32694 {
32708 else
32709 {
32715 }
32718 }
32721 {
32725 }
32728 NULL);
32734 }
32736 /* OpenMP 4.0:
32737 device ( expression ) */
32739 static tree
32741 location_t location)
32742 {
32764 }
32766 /* OpenMP 4.0:
32767 dist_schedule ( static )
32768 dist_schedule ( static , expression ) */
32770 static tree
32772 location_t location)
32773 {
32786 {
32797 }
32802 location);
32806 invalid_kind:
32808 resync_fail:
32813 }
32815 /* OpenMP 4.0:
32816 proc_bind ( proc-bind-kind )
32818 proc-bind-kind:
32819 master | close | spread */
32821 static tree
32823 location_t location)
32824 {
32825 tree c;
32832 {
32842 else
32844 }
32845 else
32854 location);
32859 invalid_kind:
32861 resync_fail:
32866 }
32868 /* OpenACC:
32869 async [( int-expr )] */
32871 static tree
32873 {
32880 {
32889 }
32899 }
32901 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32902 is a bitmask in MASK. Return the list of clauses found. */
32904 static tree
32908 {
32913 {
32914 location_t here;
32915 pragma_omp_clause c_kind;
32916 omp_clause_code code;
32927 {
32979 clauses);
32997 OMP_CLAUSE_INDEPENDENT,
33009 clauses);
33015 clauses);
33039 clauses);
33061 clauses);
33073 clauses);
33087 }
33092 {
33093 /* Remove the invalid clause(s) from the list to avoid
33094 confusing the rest of the compiler. */
33097 }
33098 }
33100 saw_error:
33107 }
33109 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33110 is a bitmask in MASK. Return the list of clauses found; the result
33111 of clause default goes in *pdefault. */
33113 static tree
33117 {
33123 {
33124 pragma_omp_clause c_kind;
33135 {
33147 clauses);
33161 clauses);
33181 clauses);
33186 clauses);
33196 clauses);
33230 clauses);
33244 clauses);
33261 OMP_CLAUSE_NOTINBRANCH,
33270 {
33271 clause_not_first:
33275 }
33305 clauses);
33306 else
33316 clauses);
33334 {
33342 }
33385 clauses
33391 clauses
33403 }
33408 {
33409 /* Remove the invalid clause(s) from the list to avoid
33410 confusing the rest of the compiler. */
33413 }
33414 }
33415 saw_error:
33416 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33417 no reason to skip to the end. */
33421 {
33424 else
33426 }
33428 }
33430 /* OpenMP 2.5:
33431 structured-block:
33432 statement
33434 In practice, we're also interested in adding the statement to an
33435 outer node. So it is convenient if we work around the fact that
33436 cp_parser_statement calls add_stmt. */
33438 static unsigned
33440 {
33443 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33444 This preserves the "not within loop or switch" style error messages
33445 for nonsense cases like
33446 void foo() {
33447 #pragma omp single
33448 break;
33449 }
33450 */
33455 }
33457 static void
33459 {
33461 }
33463 static tree
33465 {
33473 }
33475 /* OpenMP 2.5:
33476 # pragma omp atomic new-line
33477 expression-stmt
33479 expression-stmt:
33480 x binop= expr | x++ | ++x | x-- | --x
33481 binop:
33482 +, *, -, /, &, ^, |, <<, >>
33484 where x is an lvalue expression with scalar type.
33486 OpenMP 3.1:
33487 # pragma omp atomic new-line
33488 update-stmt
33490 # pragma omp atomic read new-line
33491 read-stmt
33493 # pragma omp atomic write new-line
33494 write-stmt
33496 # pragma omp atomic update new-line
33497 update-stmt
33499 # pragma omp atomic capture new-line
33500 capture-stmt
33502 # pragma omp atomic capture new-line
33503 capture-block
33505 read-stmt:
33506 v = x
33507 write-stmt:
33508 x = expr
33509 update-stmt:
33510 expression-stmt | x = x binop expr
33511 capture-stmt:
33512 v = expression-stmt
33513 capture-block:
33514 { v = x; update-stmt; } | { update-stmt; v = x; }
33516 OpenMP 4.0:
33517 update-stmt:
33518 expression-stmt | x = x binop expr | x = expr binop x
33519 capture-stmt:
33520 v = update-stmt
33521 capture-block:
33522 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33524 where x and v are lvalue expressions with scalar type. */
33526 static void
33528 {
33536 {
33541 {
33547 }
33548 }
33550 {
33562 else
33566 }
33568 {
33574 {
33579 {
33582 }
33583 }
33584 }
33588 {
33598 else
33603 {
33604 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33605 opcode. */
33610 }
33614 {
33617 }
33618 else
33619 {
33625 }
33628 }
33630 restart:
33634 {
33641 /* FALLTHROUGH */
33651 /* FALLTHROUGH */
33666 /* Undo effects of boolean_increment for post {in,de}crement. */
33668 /* FALLTHRU */
33672 {
33673 /* Undo effects of boolean_increment. */
33675 {
33676 /* This is pre or post increment. */
33681 && !structured_block
33685 }
33686 }
33687 /* FALLTHRU */
33690 {
33725 {
33729 }
33732 {
33738 {
33743 }
33745 {
33757 {
33759 {
33764 }
33765 else
33767 }
33771 }
33774 {
33781 }
33785 }
33789 {
33792 {
33800 }
33802 {
33807 }
33842 }
33853 /* FALLTHROUGH */
33858 }
33865 }
33866 stmt_done:
33868 {
33879 }
33881 {
33884 }
33885 done:
33891 saw_error:
33894 {
33898 {
33902 }
33903 }
33904 }
33907 /* OpenMP 2.5:
33908 # pragma omp barrier new-line */
33910 static void
33912 {
33915 }
33917 /* OpenMP 2.5:
33918 # pragma omp critical [(name)] new-line
33919 structured-block
33921 OpenMP 4.5:
33922 # pragma omp critical [(name) [hint(expression)]] new-line
33923 structured-block */
33925 #define OMP_CRITICAL_CLAUSE_MASK \
33926 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33928 static tree
33930 {
33934 {
33948 OMP_CRITICAL_CLAUSE_MASK,
33950 }
33951 else
33956 }
33958 /* OpenMP 2.5:
33959 # pragma omp flush flush-vars[opt] new-line
33961 flush-vars:
33962 ( variable-list ) */
33964 static void
33966 {
33972 }
33974 /* Helper function, to parse omp for increment expression. */
33976 static tree
33978 {
33983 {
33986 }
33989 {
33998 /* Fall through: OpenMP disallows NE_EXPR. */
34002 }
34004 /* If decl is an iterator, preserve LHS and RHS of the relational
34005 expr until finish_omp_for. */
34016 }
34018 /* Helper function, to parse omp for increment expression. */
34020 static tree
34022 {
34026 cp_id_kind idk;
34030 {
34039 }
34048 {
34053 }
34060 {
34064 }
34077 do
34078 {
34085 {
34087 {
34090 else
34092 tf_warning_or_error);
34093 }
34094 else
34097 }
34098 }
34102 {
34108 }
34109 else
34113 }
34115 /* Parse the initialization statement of either an OpenMP for loop or
34116 a Cilk Plus for loop.
34118 Return true if the resulting construct should have an
34119 OMP_CLAUSE_PRIVATE added to it. */
34121 static tree
34130 {
34136 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34138 init-expr:
34139 var = lb
34140 integer-type var = lb
34141 random-access-iterator-type var = lb
34142 pointer-type var = lb
34143 */
34144 cp_decl_specifier_seq type_specifiers;
34146 /* First, try to parse as an initialized declaration. See
34147 cp_parser_condition, from whence the bulk of this is copied. */
34154 {
34155 /* If parsing a type specifier seq succeeded, then this
34156 MUST be a initialized declaration. */
34161 CP_PARSER_DECLARATOR_NAMED,
34172 else
34173 {
34183 {
34185 CPP_OPEN_PAREN))
34186 {
34190 else
34193 }
34194 else
34195 /* Trigger an error. */
34200 }
34204 {
34212 {
34215 auto_node);
34220 }
34223 asm_specification,
34224 LOOKUP_ONLYCONVERTING);
34227 {
34230 }
34231 else
34232 {
34235 {
34237 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34239 {
34243 {
34247 }
34249 }
34251 {
34256 }
34257 }
34258 }
34260 }
34261 else
34262 {
34263 /* Consume '='. */
34267 non_class:
34270 else
34273 asm_specification,
34274 LOOKUP_ONLYCONVERTING);
34275 }
34279 }
34280 }
34281 else
34282 {
34283 cp_id_kind idk;
34284 /* If parsing a type specifier sequence failed, then
34285 this MUST be a simple expression. */
34294 && decl
34297 {
34308 {
34313 }
34318 }
34320 && decl
34323 {
34324 tree rhs;
34332 rhs,
34333 tf_warning_or_error));
34336 }
34337 else
34338 {
34343 {
34347 }
34348 }
34349 }
34351 }
34353 /* Parse the restricted form of the for statement allowed by OpenMP. */
34355 static tree
34358 {
34362 location_t loc_first;
34373 {
34376 }
34379 {
34385 }
34387 {
34390 {
34392 "%<linear%> clause may not be specified together "
34395 }
34396 else
34398 }
34411 {
34414 location_t loc;
34418 {
34421 }
34424 {
34427 }
34436 add_private_clause
34443 {
34446 {
34452 }
34453 else
34455 }
34462 {
34467 {
34471 }
34474 {
34475 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34479 {
34482 }
34483 else
34484 {
34487 }
34489 }
34490 else
34491 {
34496 }
34497 }
34500 {
34501 tree c;
34503 {
34512 decl);
34516 decl);
34517 }
34519 {
34524 else
34529 {
34532 /* For linear, signal that we need to fill up
34533 the so far unknown linear step. */
34536 }
34537 }
34538 }
34547 {
34548 /* If decl is an iterator, preserve the operator on decl
34549 until finish_omp_for. */
34551 && ((processing_template_decl
34556 else
34560 }
34572 {
34575 }
34580 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34581 in between the collapsed for loops to be still considered perfectly
34582 nested. Hopefully the final version clarifies this.
34583 For now handle (multiple) {'s and empty statements. */
34585 do
34586 {
34590 {
34592 bracecount++;
34593 }
34597 else
34598 {
34605 }
34606 }
34610 {
34613 }
34614 }
34619 /* Note that we saved the original contents of this flag when we entered
34620 the structured block, and so we don't need to re-save it here. */
34623 else
34626 /* Note that the grammar doesn't call for a structured block here,
34627 though the loop as a whole is a structured block. */
34634 else
34639 {
34641 {
34643 nbraces--;
34644 }
34647 else
34648 {
34650 {
34653 }
34658 }
34659 }
34662 {
34666 else
34668 }
34672 }
34674 /* Helper function for OpenMP parsing, split clauses and call
34675 finish_omp_clauses on each of the set of clauses afterwards. */
34677 static void
34680 {
34686 }
34688 /* OpenMP 4.0:
34689 #pragma omp simd simd-clause[optseq] new-line
34690 for-loop */
34692 #define OMP_SIMD_CLAUSE_MASK \
34693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34702 static tree
34706 {
34717 {
34721 OMP_CLAUSE_ORDERED);
34723 {
34725 "%<ordered%> clause with parameter may not be specified "
34728 }
34729 }
34740 }
34742 /* OpenMP 2.5:
34743 #pragma omp for for-clause[optseq] new-line
34744 for-loop
34746 OpenMP 4.0:
34747 #pragma omp for simd for-simd-clause[optseq] new-line
34748 for-loop */
34750 #define OMP_FOR_CLAUSE_MASK \
34751 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34761 static tree
34765 {
34772 /* parallel for{, simd} disallows nowait clause, but for
34773 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34776 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34781 {
34786 {
34810 }
34811 }
34813 {
34816 }
34818 /* Composite distribute parallel for disallows linear clause. */
34825 {
34828 }
34839 }
34841 /* OpenMP 2.5:
34842 # pragma omp master new-line
34843 structured-block */
34845 static tree
34847 {
34851 }
34853 /* OpenMP 2.5:
34854 # pragma omp ordered new-line
34855 structured-block
34857 OpenMP 4.5:
34858 # pragma omp ordered ordered-clauses new-line
34859 structured-block */
34861 #define OMP_ORDERED_CLAUSE_MASK \
34862 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34865 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34866 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34868 static bool
34871 {
34875 {
34879 }
34882 {
34887 {
34889 {
34891 "%<depend%> clause may only be used in compound "
34895 }
34896 tree clauses
34898 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34902 }
34903 }
34905 tree clauses
34911 }
34913 /* OpenMP 2.5:
34915 section-scope:
34916 { section-sequence }
34918 section-sequence:
34919 section-directive[opt] structured-block
34920 section-sequence section-directive structured-block */
34922 static tree
34924 {
34936 {
34940 }
34943 {
34951 {
34955 }
34957 {
34960 }
34965 }
34976 }
34978 /* OpenMP 2.5:
34979 # pragma omp sections sections-clause[optseq] newline
34980 sections-scope */
34982 #define OMP_SECTIONS_CLAUSE_MASK \
34983 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34989 static tree
34992 {
35004 {
35007 }
35014 }
35016 /* OpenMP 2.5:
35017 # pragma omp parallel parallel-clause[optseq] new-line
35018 structured-block
35019 # pragma omp parallel for parallel-for-clause[optseq] new-line
35020 structured-block
35021 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35022 structured-block
35024 OpenMP 4.0:
35025 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35026 structured-block */
35028 #define OMP_PARALLEL_CLAUSE_MASK \
35029 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35039 static tree
35043 {
35050 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35056 {
35064 if_p);
35068 if_p);
35071 block);
35076 }
35077 /* When combined with distribute, parallel has to be followed by for.
35078 #pragma omp target parallel is allowed though. */
35082 {
35086 }
35088 {
35091 }
35093 {
35097 {
35107 block);
35110 }
35111 }
35116 {
35119 }
35127 }
35129 /* OpenMP 2.5:
35130 # pragma omp single single-clause[optseq] new-line
35131 structured-block */
35133 #define OMP_SINGLE_CLAUSE_MASK \
35134 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35139 static tree
35141 {
35151 }
35153 /* OpenMP 3.0:
35154 # pragma omp task task-clause[optseq] new-line
35155 structured-block */
35157 #define OMP_TASK_CLAUSE_MASK \
35158 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35169 static tree
35171 {
35182 }
35184 /* OpenMP 3.0:
35185 # pragma omp taskwait new-line */
35187 static void
35189 {
35192 }
35194 /* OpenMP 3.1:
35195 # pragma omp taskyield new-line */
35197 static void
35199 {
35202 }
35204 /* OpenMP 4.0:
35205 # pragma omp taskgroup new-line
35206 structured-block */
35208 static tree
35210 {
35214 if_p));
35215 }
35218 /* OpenMP 2.5:
35219 # pragma omp threadprivate (variable-list) */
35221 static void
35223 {
35224 tree vars;
35230 }
35232 /* OpenMP 4.0:
35233 # pragma omp cancel cancel-clause[optseq] new-line */
35235 #define OMP_CANCEL_CLAUSE_MASK \
35236 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35242 static void
35244 {
35248 }
35250 /* OpenMP 4.0:
35251 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35253 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35259 static void
35262 {
35263 tree clauses;
35267 {
35272 {
35275 }
35276 }
35278 {
35282 }
35285 {
35288 "%<#pragma omp cancellation point%> may only be used in"
35290 else
35294 }
35297 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35299 pragma_tok);
35301 }
35303 /* OpenMP 4.0:
35304 #pragma omp distribute distribute-clause[optseq] new-line
35305 for-loop */
35307 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35308 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35314 static tree
35318 {
35327 {
35335 else
35338 {
35344 {
35348 else
35351 }
35357 else
35371 }
35372 }
35374 {
35377 }
35382 {
35385 }
35396 }
35398 /* OpenMP 4.0:
35399 # pragma omp teams teams-clause[optseq] new-line
35400 structured-block */
35402 #define OMP_TEAMS_CLAUSE_MASK \
35403 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35411 static tree
35415 {
35424 {
35428 {
35452 }
35453 }
35455 {
35458 }
35463 {
35466 }
35474 }
35476 /* OpenMP 4.0:
35477 # pragma omp target data target-data-clause[optseq] new-line
35478 structured-block */
35480 #define OMP_TARGET_DATA_CLAUSE_MASK \
35481 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35486 static tree
35488 {
35489 tree clauses
35494 {
35497 {
35514 "%<#pragma omp target data%> with map-type other "
35515 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35519 }
35521 }
35524 {
35527 "%<#pragma omp target data%> must contain at least "
35530 }
35541 }
35543 /* OpenMP 4.5:
35544 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35545 structured-block */
35547 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35548 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35554 static tree
35557 {
35560 {
35565 {
35568 }
35569 }
35571 {
35575 }
35578 {
35580 "%<#pragma omp target enter data%> may only be "
35584 }
35586 tree clauses
35591 {
35594 {
35607 "%<#pragma omp target enter data%> with map-type other "
35611 }
35613 }
35616 {
35619 "%<#pragma omp target enter data%> must contain at least "
35622 }
35629 }
35631 /* OpenMP 4.5:
35632 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35633 structured-block */
35635 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35636 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35642 static tree
35645 {
35648 {
35653 {
35656 }
35657 }
35659 {
35663 }
35666 {
35668 "%<#pragma omp target exit data%> may only be "
35672 }
35674 tree clauses
35679 {
35682 {
35696 "%<#pragma omp target exit data%> with map-type other "
35697 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35701 }
35703 }
35706 {
35709 "%<#pragma omp target exit data%> must contain at least "
35712 }
35719 }
35721 /* OpenMP 4.0:
35722 # pragma omp target update target-update-clause[optseq] new-line */
35724 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35725 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35732 static bool
35735 {
35737 {
35739 "%<#pragma omp target update%> may only be "
35743 }
35745 tree clauses
35750 {
35752 "%<#pragma omp target update%> must contain at least one "
35755 }
35763 }
35765 /* OpenMP 4.0:
35766 # pragma omp target target-clause[optseq] new-line
35767 structured-block */
35769 #define OMP_TARGET_CLAUSE_MASK \
35770 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35780 static bool
35783 {
35787 {
35791 }
35794 {
35806 {
35814 {
35815 tree stmt;
35817 {
35820 OMP_TARGET_CLAUSE_MASK,
35825 OMP_TARGET_CLAUSE_MASK,
35830 OMP_TARGET_CLAUSE_MASK,
35835 }
35837 }
35842 {
35846 if_p);
35851 if_p);
35856 if_p);
35860 }
35866 {
35867 /* For combined target teams, ensure the num_teams and
35868 thread_limit clause expressions are evaluated on the host,
35869 before entering the target construct. */
35870 tree c;
35876 {
35885 OMP_CLAUSE_FIRSTPRIVATE);
35890 }
35891 }
35900 }
35902 {
35905 }
35907 {
35911 }
35913 {
35917 }
35919 {
35923 }
35925 {
35928 }
35929 }
35944 check_clauses:
35946 {
35949 {
35963 "%<#pragma omp target%> with map-type other "
35964 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35968 }
35970 }
35972 }
35974 /* OpenACC 2.0:
35975 # pragma acc cache (variable-list) new-line
35976 */
35978 static tree
35980 {
35995 }
35997 /* OpenACC 2.0:
35998 # pragma acc data oacc-data-clause[optseq] new-line
35999 structured-block */
36001 #define OACC_DATA_CLAUSE_MASK \
36002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36014 static tree
36016 {
36029 }
36031 /* OpenACC 2.0:
36032 # pragma acc host_data <clauses> new-line
36033 structured-block */
36035 #define OACC_HOST_DATA_CLAUSE_MASK \
36036 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36038 static tree
36040 {
36053 }
36055 /* OpenACC 2.0:
36056 # pragma acc declare oacc-data-clause[optseq] new-line
36057 */
36059 #define OACC_DECLARE_CLAUSE_MASK \
36060 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36073 static tree
36075 {
36084 {
36088 }
36091 {
36095 {
36099 }
36102 {
36114 {
36116 "%qD must be a global variable in"
36118 decl);
36121 }
36126 {
36130 }
36132 {
36134 "invalid use of %<extern%> variable %qD "
36138 }
36140 {
36142 "invalid use of %<global%> variable %qD "
36146 }
36148 }
36153 {
36158 }
36161 {
36162 tree id;
36166 else
36172 {
36175 {
36178 {
36182 }
36183 }
36184 }
36185 }
36186 }
36199 }
36201 /* OpenACC 2.0:
36202 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36204 or
36206 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36208 LOC is the location of the #pragma token.
36209 */
36211 #define OACC_ENTER_DATA_CLAUSE_MASK \
36212 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36220 #define OACC_EXIT_DATA_CLAUSE_MASK \
36221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36227 static tree
36230 {
36239 {
36245 }
36252 else
36257 {
36261 }
36269 }
36271 /* OpenACC 2.0:
36272 # pragma acc loop oacc-loop-clause[optseq] new-line
36273 structured-block */
36275 #define OACC_LOOP_CLAUSE_MASK \
36276 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36287 static tree
36290 {
36299 {
36305 }
36314 }
36316 /* OpenACC 2.0:
36317 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36318 structured-block
36320 or
36322 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36323 structured-block
36324 */
36326 #define OACC_KERNELS_CLAUSE_MASK \
36327 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36342 #define OACC_PARALLEL_CLAUSE_MASK \
36343 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36364 static tree
36367 {
36368 omp_clause_mask mask;
36371 {
36384 }
36387 {
36391 {
36394 tree clauses;
36396 if_p);
36398 }
36399 }
36408 }
36410 /* OpenACC 2.0:
36411 # pragma acc update oacc-update-clause[optseq] new-line
36412 */
36414 #define OACC_UPDATE_CLAUSE_MASK \
36415 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36422 static tree
36424 {
36431 {
36433 "%<#pragma acc update%> must contain at least one "
36436 }
36444 }
36446 /* OpenACC 2.0:
36447 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36449 LOC is the location of the #pragma token.
36450 */
36452 #define OACC_WAIT_CLAUSE_MASK \
36453 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36455 static tree
36457 {
36471 }
36473 /* OpenMP 4.0:
36474 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36476 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36477 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36484 static void
36487 {
36489 cp_omp_declare_simd_data data;
36491 {
36496 /* It is safe to take the address of a local variable; it will only be
36497 used while this scope is live. */
36499 }
36501 /* Store away all pragma tokens. */
36513 {
36517 {
36530 }
36535 "%<#pragma omp declare simd%> not immediately followed by "
36539 }
36540 }
36542 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36543 This function is modelled similar to the late parsing of omp declare
36544 simd. */
36546 static tree
36548 {
36555 {
36557 "used in the same function marked as a Cilk Plus SIMD-enabled "
36563 }
36565 {
36569 }
36574 {
36581 NULL);
36595 }
36601 }
36603 /* Finalize #pragma omp declare simd clauses after direct declarator has
36604 been parsed, and put that into "omp declare simd" attribute. */
36606 static tree
36608 {
36614 {
36618 }
36623 {
36641 }
36645 }
36648 /* OpenMP 4.0:
36649 # pragma omp declare target new-line
36650 declarations and definitions
36651 # pragma omp end declare target new-line
36653 OpenMP 4.5:
36654 # pragma omp declare target ( extended-list ) new-line
36656 # pragma omp declare target declare-target-clauses[seq] new-line */
36658 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36659 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36662 static void
36664 {
36667 clauses
36671 {
36673 clauses);
36676 }
36677 else
36678 {
36682 }
36685 "%<#pragma omp declare target%> with clauses in between "
36686 "%<#pragma omp declare target%> without clauses and "
36689 {
36695 {
36698 }
36699 else
36702 {
36704 "%qD specified both in declare target %<link%> and %<to%>"
36707 }
36709 {
36713 {
36716 {
36720 }
36721 }
36722 }
36723 }
36724 }
36726 static void
36728 {
36731 {
36734 }
36736 {
36740 {
36743 }
36746 else
36747 {
36751 }
36752 }
36753 else
36754 {
36758 }
36762 "%<#pragma omp end declare target%> without corresponding "
36764 else
36766 }
36768 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36769 expression and optional initializer clause of
36770 #pragma omp declare reduction. We store the expression(s) as
36771 either 3, 6 or 7 special statements inside of the artificial function's
36772 body. The first two statements are DECL_EXPRs for the artificial
36773 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36774 expression that uses those variables.
36775 If there was any INITIALIZER clause, this is followed by further statements,
36776 the fourth and fifth statements are DECL_EXPRs for the artificial
36777 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36778 constructor variant (first token after open paren is not omp_priv),
36779 then the sixth statement is a statement with the function call expression
36780 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36781 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36782 to initialize the OMP_PRIV artificial variable and there is seventh
36783 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36785 static bool
36787 {
36799 tree combiner;
36814 {
36817 }
36820 {
36827 {
36830 }
36846 {
36850 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36854 == CPP_CLOSE_PAREN
36857 {
36861 }
36866 }
36867 else
36868 {
36884 {
36889 }
36891 tree arg;
36904 }
36915 }
36921 }
36923 /* OpenMP 4.0
36924 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36925 initializer-clause[opt] new-line
36927 initializer-clause:
36928 initializer (omp_priv initializer)
36929 initializer (function-name (argument-list)) */
36931 static void
36934 {
36944 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36951 {
36983 }
36995 /* Types may not be defined in declare reduction type list. */
36998 parser->type_definition_forbidden_message
37004 saved_colon_doesnt_start_class_def_p
37009 {
37013 ;
37034 else
37039 else
37041 }
37043 /* Restore the saved message. */
37046 parser->colon_doesnt_start_class_def_p
37051 {
37052 fail:
37055 }
37061 {
37062 tree fntype
37065 NULL_TREE);
37085 {
37090 }
37092 {
37094 {
37103 }
37110 }
37111 else
37112 {
37115 }
37118 else
37121 {
37124 }
37126 {
37129 else
37134 }
37139 else
37140 {
37149 }
37156 }
37160 done:
37161 /* Free any declarators allocated. */
37163 }
37165 /* OpenMP 4.0
37166 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37167 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37168 initializer-clause[opt] new-line
37169 #pragma omp declare target new-line */
37171 static void
37174 {
37176 {
37181 {
37184 context);
37186 }
37189 {
37192 context);
37194 }
37196 {
37199 }
37201 {
37205 }
37206 }
37210 }
37212 /* OpenMP 4.5:
37213 #pragma omp taskloop taskloop-clause[optseq] new-line
37214 for-loop
37216 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37217 for-loop */
37219 #define OMP_TASKLOOP_CLAUSE_MASK \
37220 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37235 static tree
37239 {
37248 {
37253 {
37277 }
37278 }
37280 {
37283 }
37288 {
37291 }
37297 if_p);
37303 }
37306 /* OpenACC 2.0:
37307 # pragma acc routine oacc-routine-clause[optseq] new-line
37308 function-definition
37310 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37311 */
37313 #define OACC_ROUTINE_CLAUSE_MASK \
37314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37320 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37321 component, which must resolve to a declared namespace-scope
37322 function. The clauses are either processed directly (for a named
37323 function), or defered until the immediatley following declaration
37324 is parsed. */
37326 static void
37329 {
37331 /* The checking for "another pragma following this one" in the "no optional
37332 '( name )'" case makes sure that we dont re-enter. */
37335 cp_oacc_routine_data data;
37341 /* It is safe to take the address of a local variable; it will only be
37342 used while this scope is live. */
37345 /* Look for optional '( name )'. */
37347 {
37350 /* We parse the name as an id-expression. If it resolves to
37351 anything other than a non-overloaded function at namespace
37352 scope, it's an error. */
37366 {
37370 }
37372 data.clauses
37380 {
37385 }
37387 /* Perhaps we should use the same rule as declarations in different
37388 namespaces? */
37390 {
37395 }
37398 {
37402 }
37406 }
37408 {
37409 /* Store away all pragma tokens. */
37420 /* Emit a helpful diagnostic if there's another pragma following this
37421 one. */
37423 {
37426 /* ..., and then just keep going. */
37428 }
37430 /* We only have to consider the pragma_external case here. */
37435 else
37438 }
37439 }
37441 /* Finalize #pragma acc routine clauses after direct declarator has
37442 been parsed. */
37444 static tree
37446 {
37451 {
37453 "%<#pragma acc routine%> not immediately followed by "
37456 }
37473 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37474 fndecl_seen. */
37477 }
37479 /* Apply any saved OpenACC routine clauses to a just-parsed
37480 declaration. */
37482 static void
37484 {
37486 {
37487 /* Keep going if we're in error reporting mode. */
37493 {
37495 "%<#pragma acc routine%> not immediately followed by"
37499 }
37501 {
37504 }
37507 {
37512 }
37515 {
37521 }
37523 /* Process the routine's dimension clauses. */
37527 /* Add an "omp declare target" attribute. */
37532 /* Don't unset parser->oacc_routine here: we may still need it to
37533 diagnose wrong usage. But, remember that we've used this "#pragma acc
37534 routine". */
37536 }
37537 }
37539 /* Main entry point to OpenMP statement pragmas. */
37541 static void
37543 {
37544 tree stmt;
37549 {
37572 if_p);
37577 if_p);
37594 if_p);
37599 if_p);
37607 if_p);
37616 if_p);
37630 if_p);
37635 if_p);
37639 }
37642 }
37643 \f
37644 /* Transactional Memory parsing routines. */
37646 /* Parse a transaction attribute.
37648 txn-attribute:
37649 attribute
37650 [ [ identifier ] ]
37652 We use this instead of cp_parser_attributes_opt for transactions to avoid
37653 the pedwarn in C++98 mode. */
37655 static tree
37657 {
37672 {
37676 /* For keywords, use the canonical spelling,
37677 not the parsed identifier. */
37681 }
37682 else
37686 error1:
37689 }
37691 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37693 transaction-statement:
37694 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37695 compound-statement
37696 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37697 */
37699 static tree
37701 {
37712 else
37713 {
37717 }
37719 /* Parse a noexcept specification. */
37723 {
37724 /* cancel-and-throw is unimplemented. */
37727 }
37728 else
37731 /* Keep track if we're in the lexical scope of an outer transaction. */
37743 }
37745 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37747 transaction-expression:
37748 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37749 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37750 */
37752 static tree
37754 {
37767 keyword == RID_TRANSACTION_RELAXED
37781 /* Set this early. This might mean that we allow transaction_cancel in
37782 an expression that we find out later actually has to be a constexpr.
37783 However, we expect that cxx_constant_value will be able to deal with
37784 this; also, if the noexcept has no constexpr, then what we parse next
37785 really is a transaction's body. */
37788 /* Parse a noexcept specification. */
37794 {
37801 }
37802 else
37803 {
37804 /* The only expression that is available got parsed for the noexcept
37805 already. noexcept is true then. */
37808 }
37817 }
37819 /* Parse a function-transaction-block.
37821 function-transaction-block:
37822 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37823 function-body
37824 __transaction_atomic txn-attribute[opt] function-try-block
37825 __transaction_relaxed ctor-initializer[opt] function-body
37826 __transaction_relaxed function-try-block
37827 */
37829 static bool
37831 {
37847 else
37848 {
37852 }
37860 else
37861 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37869 }
37871 /* Parse a __transaction_cancel statement.
37873 cancel-statement:
37874 __transaction_cancel txn-attribute[opt] ;
37875 __transaction_cancel txn-attribute[opt] throw-expression ;
37877 ??? Cancel and throw is not yet implemented. */
37879 static tree
37881 {
37887 RT_TRANSACTION_CANCEL);
37894 /* ??? Parse cancel-and-throw here. */
37899 {
37903 }
37905 {
37909 }
37911 {
37914 {
37920 }
37921 }
37923 {
37927 }
37933 }
37934 \f
37935 /* The parser. */
37939 \f
37940 /* Special handling for the first token or line in the file. The first
37941 thing in the file might be #pragma GCC pch_preprocess, which loads a
37942 PCH file, which is a GC collection point. So we need to handle this
37943 first pragma without benefit of an existing lexer structure.
37945 Always returns one token to the caller in *FIRST_TOKEN. This is
37946 either the true first token of the file, or the first token after
37947 the initial pragma. */
37949 static void
37951 {
37960 {
37967 }
37968 else
37971 /* Skip to the end of the pragma. */
37975 /* Now actually load the PCH file. */
37979 /* Read one more token to return to our caller. We have to do this
37980 after reading the PCH file in, since its pointers have to be
37981 live. */
37983 }
37985 /* Parses the grainsize pragma for the _Cilk_for statement.
37986 Syntax:
37987 #pragma cilk grainsize = <VALUE>. */
37989 static void
37991 {
37993 {
37998 {
38001 }
38003 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38006 else
38008 "%<#pragma cilk grainsize%> is not followed by "
38011 }
38013 }
38015 /* Normal parsing of a pragma token. Here we can (and must) use the
38016 regular lexer. */
38018 static bool
38020 {
38023 tree stmt;
38034 {
38042 {
38052 }
38057 {
38067 }
38072 {
38078 "%<#pragma omp taskwait%> may only be "
38083 }
38088 {
38094 "%<#pragma omp taskyield%> may only be "
38099 }
38104 {
38110 "%<#pragma omp cancel%> may only be "
38115 }
38136 {
38140 }
38148 {
38152 }
38160 {
38164 }
38170 {
38174 }
38182 {
38186 }
38237 "%<#pragma omp section%> may only be used in "
38242 {
38244 {
38248 }
38255 {
38258 }
38261 }
38265 {
38269 }
38277 {
38281 }
38283 /* Ignore the pragma if Cilk Plus is not enabled. */
38285 {
38288 }
38289 else
38290 {
38294 }
38301 bad_stmt:
38304 }
38308 }
38310 /* The interface the pragma parsers have to the lexer. */
38312 enum cpp_ttype
38314 {
38326 else
38327 {
38331 }
38334 }
38336 \f
38337 /* External interface. */
38339 /* Parse one entire translation unit. */
38341 void
38343 {
38356 }
38358 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38359 vectorlength clause:
38360 Syntax:
38361 vectorlength ( constant-expression ) */
38363 static tree
38366 {
38368 tree expr;
38369 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38370 safelen clause. Thus, vectorlength is represented as OMP 4.0
38371 safelen. For SIMD-enabled function it is represented by OMP 4.0
38372 simdlen. */
38375 loc);
38376 else
38378 loc);
38386 /* If expr == error_mark_node, then don't emit any errors nor
38387 create a clause. if any of the above functions returns
38388 error mark node then they would have emitted an error message. */
38390 ;
38398 else
38399 {
38400 tree c;
38402 {
38407 }
38408 else
38409 {
38414 }
38415 }
38420 }
38422 /* Handles the Cilk Plus #pragma simd linear clause.
38423 Syntax:
38424 linear ( simd-linear-variable-list )
38426 simd-linear-variable-list:
38427 simd-linear-variable
38428 simd-linear-variable-list , simd-linear-variable
38430 simd-linear-variable:
38431 id-expression
38432 id-expression : simd-linear-step
38434 simd-linear-step:
38435 conditional-expression */
38437 static tree
38439 {
38445 {
38449 }
38454 {
38457 {
38461 }
38468 {
38472 }
38473 else
38474 {
38478 /* If present, parse the linear step. Otherwise, assume the default
38479 value of 1. */
38481 {
38488 {
38489 /* If an error has occurred, then the whole pragma is
38490 considered ill-formed. Thus, no reason to keep
38491 parsing. */
38494 }
38502 else
38504 "step size must be an integer constant "
38506 }
38508 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38514 }
38519 else
38520 {
38525 }
38526 }
38530 }
38532 /* Returns the name of the next clause. If the clause is not
38533 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38534 token is not consumed. Otherwise, the appropriate enum from the
38535 pragma_simd_clause is returned and the token is consumed. */
38537 static pragma_omp_clause
38539 {
38540 pragma_omp_clause clause_type;
38557 else
38562 }
38564 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38566 static tree
38568 {
38573 {
38574 pragma_omp_clause c_kind;
38581 /* Use the OpenMP 4.0 equivalent function. */
38584 /* Use the OpenMP 4.0 equivalent function. */
38586 clauses);
38588 /* Use the OMP 4.0 equivalent function. */
38590 clauses);
38592 /* Use the OMP 4.0 equivalent function. */
38594 else
38595 {
38599 }
38600 }
38606 else
38608 }
38610 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38612 static void
38614 {
38621 {
38625 }
38634 }
38636 /* Main entry-point for parsing Cilk Plus _Cilk_for
38637 loops. The return value is error_mark_node
38638 when errors happen and CILK_FOR tree on success. */
38640 static tree
38642 {
38657 else
38663 }
38665 /* Create an identifier for a generic parameter type (a synthesized
38666 template parameter implied by `auto' or a concept identifier). */
38669 static tree
38671 {
38675 }
38677 /* Predicate that behaves as is_auto_or_concept but matches the parent
38678 node of the generic type rather than the generic type itself. This
38679 allows for type transformation in add_implicit_template_parms. */
38683 {
38685 }
38687 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38688 (creating a new template parameter list if necessary). Returns the newly
38689 created template type parm. */
38691 static tree
38693 {
38696 /* Before committing to modifying any scope, if we're in an
38697 implicit template scope, and we're trying to synthesize a
38698 constrained parameter, try to find a previous parameter with
38699 the same name. This is the same-type rule for abbreviated
38700 function templates.
38702 NOTE: We can generate implicit parameters when tentatively
38703 parsing a nested name specifier, only to reject that parse
38704 later. However, matching the same template-id as part of a
38705 direct-declarator should generate an identical template
38706 parameter, so this rule will merge them. */
38708 {
38711 {
38713 {
38716 /* Return the TEMPLATE_PARM_INDEX. */
38719 }
38721 }
38722 }
38724 /* We are either continuing a function template that already contains implicit
38725 template parameters, creating a new fully-implicit function template, or
38726 extending an existing explicit function template with implicit template
38727 parameters. */
38735 {
38739 }
38740 else
38741 {
38742 /* Roll back to the existing template parameter scope (in the case of
38743 extending an explicit function template) or introduce a new template
38744 parameter scope ahead of the function parameter scope (or class scope
38745 in the case of out-of-line member definitions). The function scope is
38746 added back after template parameter synthesis below. */
38751 {
38754 }
38756 {
38757 /* If not defining a class, then any class scope is a scope level in
38758 an out-of-line member definition. In this case simply wind back
38759 beyond the first such scope to inject the template parameter list.
38760 Otherwise wind back to the class being defined. The latter can
38761 occur in class member friend declarations such as:
38763 class A {
38764 void foo (auto);
38765 };
38766 class B {
38767 friend void A::foo (auto);
38768 };
38770 The template parameter list synthesized for the friend declaration
38771 must be injected in the scope of 'B'. This can also occur in
38772 erroneous cases such as:
38774 struct A {
38775 struct B {
38776 void foo (auto);
38777 };
38778 void B::foo (auto) {}
38779 };
38781 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38782 but, nevertheless, the template parameter list synthesized for the
38783 declarator should be injected into the scope of 'A' as if the
38784 ill-formed template was specified explicitly. */
38787 {
38790 }
38791 }
38797 {
38798 /* Introduce a new template parameter list for implicit template
38799 parameters. */
38803 parser->implicit_template_scope
38810 }
38811 else
38812 {
38813 /* Synthesize implicit template parameters at the end of the explicit
38814 template parameter list. */
38821 parser->implicit_template_parms
38823 }
38824 }
38826 /* Synthesize a new template parameter and track the current template
38827 parameter chain with implicit_template_parms. */
38831 tree synth_tmpl_parm;
38835 synth_tmpl_parm
38838 synth_tmpl_parm
38840 else
38841 {
38845 }
38847 // Attach the constraint to the parm before processing.
38850 tree new_parm
38852 input_location,
38853 node,
38857 // Chain the new parameter to the list of implicit parameters.
38859 parser->implicit_template_parms
38861 else
38866 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38869 /* If creating a fully implicit function template, start the new implicit
38870 template parameter list with this synthesized type, otherwise grow the
38871 current template parameter list. */
38874 {
38881 }
38882 else
38883 {
38888 }
38890 // If the new parameter was constrained, we need to add that to the
38891 // constraints in the template parameter list.
38893 {
38897 }
38902 }
38904 /* Finish the declaration of a fully implicit function template. Such a
38905 template has no explicit template parameter list so has not been through the
38906 normal template head and tail processing. synthesize_implicit_template_parm
38907 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38908 provided if the declaration is a class member such that its template
38909 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38910 form is returned. Otherwise NULL_TREE is returned. */
38912 static tree
38914 {
38919 {
38923 }
38933 }